• The KIPS Transactions:PartC
• /
• v.8C no.3
• /
• pp.351-358
• /
• 2001

무선망에서는 유선망에 비해 그 특성상 비교적 많은 패킷을 손실된다. TCP 프로토콜은 흐름제어나 에러정정, 혼잡 제어 등의 기능을 통해 보다 효율적이고 안정적인 통신을 지원하고 있다. 하지만 표준 TCP 프로토콜은 유선망의 특성을 고려하여 개발하였기 때문에 무선망에서 혼잡한 상황에서 패킷이 도달하지 못한 경우와 실제로 패킷이 손실되어 전달되지 못하는 경우를 구분하지 못한다. 최근까지 제시된 여러 이동망 TCP에 대한 논문은 무선망에서 패킷이 손실된 경우 혼잡 제어를 일어나지 못하게 하는 방법을 제시하고 있다. 본 논문에서는 TCP Persist Timer를 이용하여 혼잡제어를 회피하는 방법을 기존에 제시된 Snoop 프로토콜에 적용하여 자체적인 이동망상에서의 TCP 성능향상에 더하여 연속적인 에러에 대한 성능 향상을 제고하고 있다. 개선된 Snoop 프로토콜은 WZACK(Window Size Zero ACKnowledge Packet)을 이용하여 혼잡제어를 정지시킴으로써 비효율적인 혼잡제어를 막도록한다.

• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 1999.12a
• /
• pp.103-111
• /
• 1999

ATM 망의 혼잡상태를 회피하기 위하여 다양한 방법들이 제안되고 있으며, 이들 중에는 전송시스템에 존재하는 스위치의 버퍼 값에 지능형 마킹을 표시함으로서 각 전송회선에 공평한 대역폭을 할당하며 혼잡상태를 회피하는 방법이 있다 ATM Forum은 ATM 망에서 ABR 서비스의 혼잡제어를 위한 표준으로서 셀률 기반 혼잡제어기법을 적용하고 있다. EPRCA(Enhanced Proprotional Rate Control Algorithm)은 망의 상태를 항상 검사하는 것이 아니라 망의 혼잡이 발생하였을 때만 작동하기 때문에 부정확한 셀률 정보를 가질 수 있다. DMRCA(Dynamic Max Rate Control Algorithm)은 혼잡의 정도에 따라서 적절한 셀률을 부여하기 위하여 스위치에 임계값을 지정하며, 셀률은 스위치에서 제공되는 증가계수와 감소계수에 비례하여 변하게 된다. 본 논문은 DMRCA에서 혼잡제어를 위해서 적용하는 증가/감소변수의 크기 변화에 따른 공평대역할당의 수렴속도를 평가하여 최적의 변수값을 찾고자 한다.

• Journal of KIISE:Computing Practices and Letters
• /
• v.8 no.3
• /
• pp.336-343
• /
• 2002

Nowadays, after appearance of wireless network the existent internet environment is changing into the united wire/wireless network. But the present TCP regards all of the packet losses on transmission as the packet tosses due to the congestion. When it is applied on the wireless path, it deteriorates the end-to-end TCP throughput because it regards the packet loss by handoff or bit error as the packet loss by the congestion and it reduces the congestion window. In this paper, for solving these problems we propose the method that controls the performance of TCP on the wireless link by extending ECN which is used as a congestion control mechanism on the existent wire link. This is the method that distinguished the packet loss due to the congestion from due to bit error or handoff on the wireless network, so it calls the congestion control mechanism only when there occurs the congestion in the united wire/wireless network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.10A
• /
• pp.1746-1755
• /
• 2001

본 논문에서는 인터넷 트래픽의 자기 유사성 특성을 이용한 큐 관리 기법을 제안한다. 제안 기법은 LRD 프로세스의 특성을 이용하여 큰 타임 스케일에서 다음 혼잡 검출 주기 동안 평균 트래픽 입력율을 예측하고 이를 통해 혼잡 발생 여부를 미리 검출한다. 혼잡 검출시 입력 패킷을 확률적으로 폐기함으로써 망 내부에서 혼잡 발생을 사전에 방지한다. 제안 기법은 종단 시스템의 혼잡 제어 기법이나 각 플로우의 통신 환경에 무관하게 라우터의 평균 큐 길이와 큐 길이 변이를 작게 유지할 수 있으므로 지연과 지연 변이에 민감한 멀티미디어 서비스 제어에 적합하다. 또한 제안 기법은 입력율 예측을 통해 혼잡을 사전에 검출하기 때문에 종단간 혼잡 제어 기법을 사용하지 않는 플로우들에 의해 발생된 패킷들이 망 자원을 불평등하게 많이 사용하는 현상을 방지한다. 제안 기법은 각 플로우별 상태 정보를 관리하지 않으므로 확장성이 뛰어나며 이로 인해 소수의 PHB에 따라 각 홉별로 차등화된 서비스를 제공하는 Diffserv 구조에 적합하다. 또한 제안 기법은 기존 인터넷 구조에 변화를 주지 않고 라우터의 소프트웨어 업그레이드만으로 서비스가 가능하며, 필요한 버퍼의 양도 크지 않다는 장점을 가진다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.6B
• /
• pp.331-337
• /
• 2005

The optical Internet is considered as a feasible solution for transporting huge amount of traffic volume in the future Internet. Among optical switching technology for the optical Internet, OBS becomes one of the most promoting solution. Recently, a lebeled OBS(LOBS) architecture is considered for an efficient control on OBS network. Given that a data burst may contain few thousands of IP packets, a single loss of data burst results in a serious throughput degradation in LOBS network. In this paper, we improve the performance of LOBS network by introducing the burst congestion control mechanism. More specifically, the OBS router at the network core detects the network congestion by measuring the loss probability of burst control packet. The OBS router at the network edge reduces the burst generation according to the network condition repored by the OBS router at the network core. Through the simulations, it is shown that the proposed congestion control mechanism can reduce the burst loss probability and improve the LOBS network throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1B
• /
• pp.39-46
• /
• 2005

As the multimedia application traffic takes more portion in the internet traffic, it is necessary to control the network congestion through the congestion control protocol. In addition, the QoS-enabled networks such as DiffServ become an indispensable technology when running the multimedia applications. However, the previously proposed end-to-end congestion control algorithms take the round trip time to react the network congestion. Thus, as the RTT becomes larger, the reaction against the congestion gets delayed further, while the network congestion gets worse. In addition the performance of end-to-end congestion control algorithm is degraded if the QoS-enabled network runs the congestion control mechanism in the network level without any coordination between them. In this paper, we propose the early rate adaptation protocol for the DiffServ network which effectively linke the congestion control algorithm at the host and the congestion mechanism in the network together. By taking advantage of early congestion notification from the network it is possible to react the network congestion more quickly and effectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.9
• /
• pp.2027-2034
• /
• 1997

Frame relay is a fast packet switching technology that performs relaying and multiplexing frames with variable lengths over a wide area link at the T1 or E1 speed, by elminating error and flow control in the network. In frame relay networks, congestion control is typically performed through the rate enforcement with a discard eligibility (DE) bit, and the explicit negative feedback meachanisms using explicit congetion notification bits. In this paper, we consider the congestiong control scheme using the rate enforcement mechanism with DE bit for frame relay network. Assuming that each frame with exponentially distributed length arrives according to the Poission fashion, we can treat the frame relay switch as an M/M/1/K priority queueing system with pushout basis. We analyze and present the blocking probabilities and waiting time distributions of frames.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.8
• /
• pp.2096-2105
• /
• 1998

As there can be coincident bursts which may result in congetsion in a node of ATM network, reactive flow control schemes are required to guarantee user's Quality of Service. But, the high speed characteristics of ATM networks make it difficult to control source transmission rate in reacting to congestions in intermediate nodes. Therefore, flow control in Customer Premise Network may be more efficient than end-to-end flow control. In this paper, we propose a management model for flow ontrol in CPN and new Network Access Flow/Congestsion control scheme to utilize efficiently Virtual Path Connection.

• The KIPS Transactions:PartA
• /
• v.13A no.7 s.104
• /
• pp.573-580
• /
• 2006

The conventional transport layer protocol TCP is designed to work under condition of packet loss is due to the network congestion, so that it's suitable in the traditional wired network with fixed hosts but it's inefficient on the wireless network where the environment of fading, noise, and transmission error comes from interference. This result from the needless transmission control of the bit error is due to treats the packet loss as a packet congestion control in the wireless network. In this paper, we propose the advanced SNOOP protocol with the consecutive packet loss and TCP window control to avoid the needless congestion management algorithm in wireless network for the wireless TCP packet transmission enhancement. We verify the performance of the advanced module from the simulation experiment result.

• The Transactions of the Korea Information Processing Society
• /
• v.3 no.4
• /
• pp.697-708
• /
• 1996

In this paper, we study reactive congestion control with priority in ATM network. The priority schemes for buffer access, partial buffer sharing have been investigated in order to improve the utilization of ATM network resources the network and to satisfy the most demanding traffic class. We consider in this paper a discrete-time queueing model for partial buffer sharing with two Markov modulated Poisson inputs. This model can be used to analyze the the effects of the partial buffer sharing priority scheme on system performance for realistic cases of bursty services. Explicit formulae are derived for the number of cells in the system and the loss probabilities for the traffic. Congestion may still occur because of unpredictable statistical fluctuation of traffic sources even when preventive control is performed in the network. In this Paper, we study reactive congestion control, in which each source changes its cell emitting rate a daptively to the traffic load at the switching node. Our intention is that,by incorporating such a congcstion control method in ATM network,more efficient congsestion control is established. We develope an analytical model,and carry out an approximateanalysis of reactive congestion con-trol with priority.Numerical results show that several orders of magnitude improvement in the loss probability can be achieved for the high priority class with little impact on the low priority class performance.And the results show that the reactive congestion control with priority are very effective in avoiding congestion and in achieving the statistical gain.