• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.571-580
• /
• 2005

In fast long-distance networks, TCP's congestion control algorithm has the problem of utilizing bandwidth effectively. Several window-based congestion control protocols for high-speed and large delay networks have been proposed to solve this problem. These protocols deliberate mainly three properties : scalability, TCP-friendliness, and RTT-fairness. These protocols, however, cannot satisfy above three properties at the same time because of the trade-off among them This paper presents a new window-based congestion control algorithm, called EM (Exponential Increase/ Multiplicative Decrease), that simultaneously supports all four properties including fast convergence, which is another important constraint for fast long-distance networks; it can support scalability by increasing congestion window exponentially proportional to the time elapsed since a packet loss; it can support RTT-fairness and TCP-friendliness by considering RTT in its response function; it can support last fair-share convergence by increasing congestion window inversely proportional to the congestion window just before packet loss. We evaluate the performance of EIMD and other algorithms by extensive computer simulations.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.10
• /
• pp.529-538
• /
• 2007

Fair Queueing algorithms based on Generalized Processor Sharing (GPS) not only guarantee sessions with service rate and delay, but also provide sessions with instantaneous fair sharing. This fair sharing distributes server capacity to currently backlogged sessions in proportion to their weights without regard to the amount of service that the sessions received in the past. From a long-term perspective, the instantaneous fair sharing leads to a different quality of service in terms of delay and bandwidth to sessions with the same weight depending on their traffic pattern. To minimize such long-term unfairness, we propose a delay-bandwidth normalization model that defines the concept of value of service (VoS) from the aspect of both delay and bandwidth. A model and a packet-by-packet scheduling algorithm are proposed to realize the VoS concept. Performance comparisons between the proposed algorithm and algorithms based on fair queueing and service curve show that the proposed algorithm provides better long-term fairness among sessions and that is more adaptive to dynamic traffic characteristics without compromising its service rate and delay guarantees.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1A
• /
• pp.74-80
• /
• 2000

In this paper, we proposed the MAC protocol and analyzed the performance for CATV/LAN network which was based upon HFC(hybrid optic coaxial) increased abruptly as alternative method of high speed network. Upstream channel which analyzed very deeply for CATV/LAN network have the preferential access property depending upon that position and unidirectional property. To solve this fairness problem, we propose the CSMA-CD/U/P protocol that transm it as $P_i$ probability although data packets is immediately transmitted when it was occurred. As the analytic result and simulation, we obtained $P_i$ value and its average delay time. Also, we get its variance value and queue length distribution. The mean delay time and queue length increase as the load and number of stations increase in the CATV/LAN network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.304-309
• /
• 2004

Recently, the needs for multimedia stream such as digital audio and video in the Internet has increased tremendously. Unlike TCP, the UDP protocol, which has been used to transmit streaming traffic thorough the Internet, does not apply any congestion control mechanism to regulate the data flow thorough the shared network And it leads to congestion collapse of the Internet and results in long-term transmission delay. To avoid any adverse effect on the current Internet functionality, a now protocol of modification or addition of some functionality to perform congestion control and to reduce huge transmission delay in transmitting of multimedia stream are in study. TCP-friendly congestion control mechanism is classified into two : one is window-based congestion control scheme using general window management functionalities, the other is rate-based congestion control scheme using TCP modeling equation. In this paper, we propose an algorithm for improving the transmitting rate on a hybrid TCP-friendly congestion control scheme combined with widow-based and late-based congestion control for multimedia stream. And we also simulate the performance of improved TEAR implementation using NS. With He simulation results, we show that the improved TEAR can provide better fairness and lower rate fluctuations than TCP.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.221-224
• /
• 2000

The issue of supporting TCP traffic over ATM networks is currently one of the most important issues in the field of data networks. One important part of this issue is congestion control. In general, congestion control uses method such as packet drop to relieve network resource when the network is congested so as to maintain high throughput and low delay. In addition, congestion control is required to ensure fair sharing of resources among all users during congestion. In this paper we propose a new congestion control method using WRED & per-VC accounting mechanism. This packet discard scheme is proposed with the goal to provide both good performance in terms of throughput and fairness in terms of bandwidth exploitation of the output link among all virtual circuits.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2008.11a
• /
• pp.103-105
• /
• 2008

차세대 양방향데이터방송 (BIFS: BInary Format for Scenes) 서비스에서는 하향링크(downlink) 데이터 전송률에 상응하는 높은 상향링크(uplink) 데이터 전송률이 요구되고 있다. 이에 무선 전송 채널의 한정된 자원 환경 속에서 상향링크 전송용량 증대를 위한 주파수 효율성 제고 기술의 필요성이 대두되고 있다. 본 논문에서는 차세대 양방향데이터방송을 위한 다중 모바일(mobile) 사용자의 클러스터(cluster) 기반 상향링크 협동 다이버시티(cooperative diversity) 기법을 제안한다. 제안된 기법은 하나의 단일 안테나(single antenna) 방송 기지국과 다수의 단일 안테나 모바일 사용자가 있는 상향링크 시분할다중접속 (TDMA: Time Division Multiple Access) 시스템에서 데이터 지연허용(delay-tolerant)에 따라 클러스터를 구성하고 제곱 다이버시티 차수(square diversity order)의 협동 프로토콜(cooperative protocol)을 통해 높은 공간다이버시티 이득(spatial diversity gain)을 얻는다. 또한, 비대칭(asymmetric) 무선 채널 환경에서 공정성(fairness)을 보장한다.

• ETRI Journal
• /
• v.36 no.3
• /
• pp.396-406
• /
• 2014

We have designed and investigated a new congestion control scheme, called optimal and fully explicit (OFEX) controller. Different from existing relatively explicit controllers, this new scheme can provide not only optimal bandwidth allocation but also a fully explicit congestion signal to sources. It uses the congestion signal from the most congested link instead of the cumulative signal from the flow path. In this way, it overcomes the drawback of relatively explicit controllers exhibiting bias toward multi-bottlenecked users and significantly improves their convergence speed and source throughput performance. Furthermore, our OFEX-controller design considers a dynamic model by proposing a remedial measure against the unpredictable bandwidth changes in contention-based multi-access networks. Compared with former works/controllers, this remedy also effectively reduces the instantaneous queue size in a router and thus significantly improves queuing delay and packet loss performance. We have evaluated the effectiveness of the OFEX controller in OPNET. The experimental comparison with the existing relatively explicit controllers verifies the superiority of our new scheme.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.2
• /
• pp.29-40
• /
• 2005

In this research, we propose packet scheduling algorithm considering different QoS characteristics of real-time traffic and non-real-time traffic in the next generation wireless communication system serving the multimedia traffic and a new efficient framing method cooperated with this packet scheduler. When the selected traffic classes of the selected users are transmitted, our proposed framing method can increase the number of serviced traffic classes by mixing the many different traffic classes within one frame considering data rate decided by the allocated AMC (Adaptive Modulation and Coding) option. Using this proposed method, the fairness among the traffic classes can be achieved and the system performance for total throughput and delay can be enhanced. Simulations are performed to analyze the performance of the proposed framing method. Our proposed packet scheduler and framing method will be applied to the next generation multimedia wireless communication system serving many traffic classes.

• Journal of information and communication convergence engineering
• /
• v.6 no.1
• /
• pp.19-23
• /
• 2008

The AQM (Active Queue Management) starts dropping packets earlier to notify traffic sources about the incipient stage of congestion. The AQM improves fairness between response flow (like TCP) and non-response flow (like UDP), and it can provide high throughput and link efficiency. In this paper, we suggest the QVARED (Queue Variation Adaptive RED) algorithm to respond to bursty traffic more actively. It is possible to provide more smoothness of average queue length and the maximum packet drop probability compared to RED and ARED (Adaptive RED). Therefore, it is highly adaptable to new congestion condition. Our simulation results show that the drop rate of QVARED is decreased by 80% and 40% compare to those of RED and ARED, respectively. This results in shorter end-to-end delay by decreasing the number of retransmitted packets. Also, the QVARED reduces a bias effect over 18% than that of drop-tail method; therefore packets are transmitted stably in the bursty traffic condition.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.57.1-57
• /
• 2001

The objectives of congestion control in ATM (Asynchronous Transfer Mode) networks are maximum utilization of network resources, acceptable level of low cell loss and fairness among all VCs (Virtual Connections). In this paper, we present a congestion control algorithm which is based on state space model, The proposed controller uses optimal control algorithms (LQR, Mixed-LQR), where control parameters can be designed to ensure the stability of the control loop in a control theoretic sense, over the propagation delay. We show how the control mechanism can be used to design a controller to support ABR service based on feedback of explicit rates. Simulation results are presented to substantiate our claim.