• Proceedings of the Korea Society for Simulation Conference
• /
• 2000.04a
• /
• pp.23-24
• /
• 2000

최근 개인 이동 통신 단말기의 수요와 인터넷 사용자의 증가와 함께, 유선 통신 서비스에서부터 개인 휴대 통신 서비스에 이르기까지 다양한 통신 서비스가 제공되기 시작하면서 이러한 서비스가 결합된 mobile IP의 관심이 높아지고 있다. 기존의 IP에서는 노드가 계속해서 접속을 유지하기 위해서는 접속되는 위치가 반드시 고정적으로 지정되는 것이 필요하며 노드의 위치가 바뀌면 기존의 IP 주소는 사용할 수 없다. 그러나 mobile IP는 인터넷상의 임의의 다른 위치에 접속해 노드가 IP 주소를 바꾸지 않고 인터넷을 사용할 수 있도록 한다. 이동(mobile) 노드가 새로운 셀 지역으로 이동하면, 그 셀에 해당하는 외부(foreign) 에이전트로부터 임시 주소(care-of address)를 할당받아 홈 네트워크에 위치한 홈 에이전트에 등록하고, 홈 에이전트는 송신 노드가 이동노드로 전송한 패킷을 새롭게 등록된 임시 주소로 터널링을 통해 전달한다. 이러한 기본적인 mobile IP 방법은 모든 패킷이 홈 에이전트를 통해 이동 노드로 전송되므로 최적화된 라우팅 방법을 제공하지 못한다. 그러므로 이러한 mobile IP의 단점을 보완한 route optimization mobile IP가 제안되고 있다. Route optimization mobile IP는 이동 노드의 현재 위치와 관련된 정보를 갖는 바인딩을 저장하여 송신 노드가 패킷을 이동 노드의 홈 에이전트를 거치지 않고 이동 노드로 직접 전송하는 기능을 제공한다. 또한 이동 노드가 다른 셀 지역으로 핸드오프가 이루어질 경우, 핸드오프 발생전의 바인딩 정보를 이용하여 송신 노드가 전송한 패킷은 이전 셀 지역에 있는 에이전트가 새로운 셀 지역에 있는 이동 노드로 패킷을 재전송하여 전달하는 smooth 핸드오프 기능을 제공한다. 이전 셀 지역에 속한 외부 에이전트가 바인딩을 갱신하기 전에 송신 노드로부터 이동노드로 전달된 패킷이 있을 경우는 패킷을 저장하여 이후에 이동 노드의 위치 정보에 관한 바인딩 정보가 갱신되면 이러한 바인딩 정보에 따라 패킷을 재전송하는 버퍼기능도 제공한다. route optimization mobile IP는 기본적인 mobile IP에서의 복잡한 라우팅 문제를 해결하고, 핸드오프에서의 패킷 손실률을 최소화 한다.본 논문에서는 컴퓨터 시뮬레이션을 통해 smooth 핸드오프를 이용한 mobile IP의 성능을 분석한다. 일반적으로 데이터 트래픽 특성, 노드의 이동성, 바인딩 갱신시간, 버퍼관리 방법 등은 핸드오프 동안 mobile IP의 성능에 많은 영향을 미친다. 따라서 시뮬레이션 모델을 이용하여 다양한 트래픽 환경에서 위에 언급된 성능 파라미터들의 영향을 분석한다. 마지막으로 시뮬레이션 결과를 이용하여 mobile IP의 성능을 개선시키기 위한 방법을 제시한다.

• Journal of the Korea Society of Computer and Information
• /
• v.5 no.3
• /
• pp.119-125
• /
• 2000

A network of Asynchronous Transfer Mode (ATM) will be required to carry the traffics(CVR, VBR, UBR, ABR) generated by a wide range of services. The algorithm of WRR cell multiplexing is designed to serve no only CBR, VBR traffic but also ABR, UBR traffic in ATM. BSW algorithm was Proposed to carry on manage buffer efficiently at implementing of WRR scheduler. But, BSW a1gorithm cause serious degradation to the weight of each VC and the ratio of scheduler throughput because it allocates more weight than the weight allocated actually in VC and because it could not serve cell if the VC queue is empty. In this paper, we propose the WRR scheduling algorithm of BSW structure which improves the cell service ratio and cell delay. The proposed algorithm is capable of maintaining an allocated VC's weight correctly and decrease of average cell delay by serving other VC cell when empty in each VC queue and increase of cell service ratio as a whole.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.8C
• /
• pp.803-811
• /
• 2002

Asynchronous Transfer Mode-Passive Optical Network(ATM-PON) Technology is one of the best solutions for implementation of broadband access network. In this paper, we propose a new Dynamic Bandwidth Allocation (DBA) algorithm for ATM-PON systems. The DBA is a key technique for data traffic management. DBA has been studied widely to allow ATM-PON to transport data traffic cost-effectively and efficiently, and currently a hot standardization issue in Full Service Access Network(FSAN) and ITU-T. The proposed DBA algorithm efficiently manages the user traffics according to their service categories. Performance of the proposed algorithm, in aspect of Cell Transfer Delay(CTD) and Cell Delay Variation(CDV), is evaluated using computer simulation.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.41 no.1
• /
• pp.73-82
• /
• 2004

As a new service category to better support TCP traffic in ATM networks, the Guaranteed Frame Rate (GFR) service category aims to support minimum cell rate guarantee, fairly distribute available bandwidth while keeping the simplicity of Unspecified Bit Rate (UBR). In this paper, we proposed a buffer management scheme which uses the per-VC accounting of single FWO queue and capable of supporting both GFR.1 and GFR.2 conformance definition. The proposed buffer management deal with GFR.1 and GFR.2 conformance definitions differentially by controlling the number of CLP=0 cell and CLP=1 cell which are occupying buffer space. The simulation results show that our proposed scheme satisfies the requirements of GFR services as well as improves total fairness index and each conformance definition fairness index.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4B
• /
• pp.316-323
• /
• 2002

In this paper, we analyze the call control scheme that is using buffer at new call and handoff call for non-uniform traffic load distribution, the multiple cell environments and the multiple types of services such as voice and data service. Considering the facts, the call admission control method using the effective bandwidth concept is employed in this paper, The bandwidth for a new call and a handoff call is allocated by the number of mobile station and dynamically assigned by taking account of the blocking rate of new calls and the dropping rate of handoff calls. The call control procedure is experimented through a simulation study by dynamically the bandwidth to new and handoff calls based on the blocking rate and the dropping rate. The results show our call control scheme can get a good quality of service for mobile users.

• The KIPS Transactions:PartC
• /
• v.10C no.5
• /
• pp.595-602
• /
• 2003

In this paper, we proposed new buffer management and cell scheduling scheme of GFR service for improving fairness of TCP/IP traffic in ATM networks. The proposed algorithm used untagged cell, which came to ATM switch, to decide the policy for discard of frame and what kind of VC cell it would serve. Performance analysis through the simulation present that proposed scheme can meet fairness 2 (MCR Plus equal share), which are not met by conventional scheduling mechanism such as WRR. Also, proposed scheme is superior to WRR about 30% in throughput and more efficiency in fairness criteria.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.39 no.7
• /
• pp.22-29
• /
• 2002

The Gauranteed Frame Rate service category was proposed by the ATM Forum as an enhancement to the UBR service. This service aims to support minimum cell rate gaurantee for each virtual connection and allow any excess bandwidth in the network to be shared among the contending VCs in a fair manner. We propose a new buffer management algorithm for GFR service through FIFO queuing discipline. Proposed scheme can provide minimum bandwidth guarantee for GFR VCs as well as improve the fairness among the competing GFR VCs on a single FIFO queue. From simulation results, we demonstrate the proposed scheme fulfills the requirement of GFR service as well as improves the TCP throughput.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.5 no.5
• /
• pp.429-432
• /
• 2004

In this paper, we propose a new sorting algorithm for ATM switch with a shared buffer which has a sequencer architecture with single queue. The proposed switch performs a sorting procedure of ATM cell based on the output port number of ATM cell with hardware implementation. The proposed architecture has a single buffer physically but logically it has function of multi-queue which is designed at most to control the conflicts in output port. In the future, this architecture will take various applications for routing switch and has flexibility for the extension of system structure. therefore, this structure is expected on good structure in effective transmission.

• Journal of Korea Multimedia Society
• /
• v.6 no.2
• /
• pp.301-308
• /
• 2003

In this paper, we propose a multicast ATM switch that reduces traffic load by using the method of storing unicast cells and multicast cells separately according to the type of the cells. The switch is based on a shared memory type to reduce HOL blocking and deadlock. In the proposed switch, we use a control scheme that schedules stored cells to output ports to reduce the loss of traffic cells and to output effectively. We analyzed the Performance of the proposed switch through the computer simulation and the results have shown the effectiveness of the switch.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.3
• /
• pp.492-504
• /
• 1994

In ATM network was two QOS bearer services for flexible bandwidth assignment, various priority assignment buffer access mechanisms have been sugested. In this paper, a performance model with 3 state discrete time Markov proess in explicit priority assignment is suggested and cell loss probability is analytically derived. Also flexible space priority control mechanism with partial buffer sharing is studied and verified by simulation with OPNET.