• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.437-447
• /
• 2003

In order to reduce the increasing packet loss rates caused by an exponential increase in network traffic, the IETF(Internet Engineering Task Force) is considering the deployment of active queue management techniques such as RED(Random Early Detection) algorithm. However, RED algorithm simple but does not protect traffic from high-bandwidth flows, which include not only flows that fail to use end-to-end congestion control such as UDP flow, but also short round-trip time TCP flows. In this paper, in order to solve this problem, we propose a simple fairness queue management scheme, called AFQM(Approximate Fair Queue Management) algorithm, that discriminate against the flows which submit more packets/sec than is allowed by their fair share. By doing this, the scheme aims to approximate the fair queueing policy Since it is a small overhead and easy to implement, AFQM algorithm controls unresponsive or misbehaving flows with a minimum overhead.

• The KIPS Transactions:PartC
• /
• v.11C no.1
• /
• pp.89-98
• /
• 2004

AQM (Active Queue Management) techniques such as RED (Random Early Detection) which be proposed to solve the congestion of internet perform congestion control effectively for TCP data. However, in the situation where TCP and UDP share the bottleneck link, they can not solve the problems of the unfairness and long queueing delay. In this paper, we proposed an simple queue management algorithm, called PSRED (Protocol Sensitive RED), that improves fairness and decreases queueing delay. PSRED algorithm improves fairness and decreases average queue length by distinguishes each type of flow in using protocol field of packets and applies different drop functions to them respectively.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.297-312
• /
• 2005

The multimedia traffic of continuous video and audio data via streaming service accounts for a significant and expanding portion of the Internet traffic. This streaming data delivery is mostly based on RTP with UDP. However, UDP does not support congestion control. For this reason, UDP causes the starvation of congestion controlled TCP traffic which reduces its bandwidth share during overload situation. In this paper, we propose a new TCP-friendly rate control scheme called 'TF-RTP(TCP-Friendly RTP)'. In the congested network state, the TF-RTP exactly estimates the competing TCP's throughput by using the modified parameters. Then, it controls the sending rate of the video streams. Therefore, the TF-RTP adjusts its sending rate to TCP-friendly and fair share with competing TCP traffics. Through the simulation, we prove that the TF-RTP correctly estimates the TCP's throughput and improves the TCP-friendliness and fairness.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39C no.11
• /
• pp.1031-1041
• /
• 2014

In this paper, we propose a traffic load control scheme, called fast congestion control (FCC), for a satellite channel using enhanced random access schemes. The packet repetition used by enhanced random access schemes increases not only the maximum throughput but also the sensitivity to traffic load. FCC controls traffic load by using an access probability, and estimates backlogged traffic load. If the backlogged traffic load exceeds the traffic load corresponding to the maximum throughput, FCC recognizes congestion state, and processes the backlogged traffic first. The new traffic created during the congestion state accesses the channel after the end of congestion state. During the congestion state, FCC guarantees fast transmission of the backlogged traffic. Therefore, FCC is very suitable for the military traffic which has to be transmit urgently. We simulate FCC and other traffic load control schemes, and validate the superiority of FCC in latency.

• Journal of KIISE:Information Networking
• /
• v.36 no.5
• /
• pp.413-424
• /
• 2009

Wireless sensor network is based on an event driven system. Sensor nodes collect the events in surrounding environment and the sensing data are relayed into a sink node. In particular, when events are detected, the data sensing periods are likely to be shorter to get the more correct information. However, this operation causes the traffic congestion on the sensor nodes located in a routing path. Since the traffic congestion generates the data queue overflows in sensor nodes, the important information about events could be missed. In addition, since the battery energy of sensor nodes exhausts quickly for treating the traffic congestion, the entire lifetime of wireless sensor networks would be abbreviated. In this paper, a new congestion control method is proposed on the basis of genetic algorithm. To apply genetic algorithm, the data traffic rate of each sensor node is utilized as a chromosome structure. The fitness function of genetic algorithm is designed from both the average and the standard deviation of the traffic rates of sensor nodes. Based on dominant gene sets, the proposed method selects the optimal data forwarding sensor nodes for relieving the traffic congestion. In experiments, when compared with other methods to handle the traffic congestion, the proposed method shows the efficient data transmissions due to much less queue overflows and supports the fair data transmission between all sensor nodes as possible. This result not only enhances the reliability of data transmission but also distributes the energy consumptions across the network. It contributes directly to the extension of total lifetime of wireless sensor networks.

• The Journal of the Korea Contents Association
• /
• v.12 no.4
• /
• pp.69-75
• /
• 2012

In this paper, to provide various services of QoS, and moreover applying traffic ratio to CAC(Call Admission Control) algorithm tested how long average data rate and the average packet delay time. When CAC algorithm is not applied, traffic mixture ratio is 1:1:4:4, the FTP Service 0.4, web services 0.6, streaming service 0.7, the packet delay requirements are not satisfied. On the other hand CAC Algorithm is applied, all the service of packet delay are satisfied with arrival rate. Therefore, we can make sure that applying of CAC of traffic control WWW, FTP, Video, VoIP can guarantee the various services of QoS.

• Journal of Advanced Navigation Technology
• /
• v.18 no.5
• /
• pp.461-467
• /
• 2014

Active queue management (AQM) algorithms run on routers and detect incipient congestion by typically monitoring the instantaneous or average queue size. When the average queue size exceeds a certain threshold, AQM algorithms infer congestion on the link and notify the end systems to back off by proactively dropping some of the packets arriving at a router or marking the packets to reduce transmission rate at the sender. Among the existing AQM algorithms, random early detection (RED) is well known as the representative queue-based management scheme by randomizing packet dropping. To reduce the number of timeouts in TCP and queuing delay, maintain high link utilization, and remove bursty traffic biases, the RED considers an average queue size as a degree of congestions. However, RED do not well in the specified networks conditions due to the fixed parameters($P_{max}$ and $TH_{min}$) of RED. This paper addresses a extended RED to be adapted in various networks conditions. By sensing network state, $P_{max}$ and $TH_{min}$ can be automatically changed to proper value and then RED do well in various networks conditions.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.595-603
• /
• 2003

To provide mobile nodes with continuous communication services, it is important to reduce the packet losses during handoffs. The handoffs of mobile nodes cause packet losses and decrease of TCP throughput on account of a variety of factors. One of those is the congestion in the new cell. Due to the congestion, not only the node moving into the cell but also the already existing nodes that were successfully communicating in the cell suffer the performance degradation. In this paper we propose a new handoff mechanism called‘packet freeze control’, which avoids the congestion caused by handoffs by regulating the influx of traffic burst into the new cell. Packet freeze control is applicable to a wireless network domain in which FAs(Foreign Agents) are connected hierarchically and constitute a logical tree. It gradually increases the number of packets transferred to the new cell by buffering packets in the FAs on the packet delivery path over the wireless network domain. The simulation results show that the proposed mechanism not only reduces the packet losses but also enhances the TCP throughput of other mobile nodes in the cell.

• Journal of KIISE:Information Networking
• /
• v.35 no.5
• /
• pp.409-414
• /
• 2008

In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To solve the congestion and achieve load balancing, many protocols have been proposed. However, the existing load balancing schemes has only considered avoiding the congested route in the route discovery procedure or finding an alternative route path during a communication session. To mitigate this problem, we have proposed a new scheme which considers the packet bursting mechanism in congested nodes. The proposed packet bursting scheme, which is originally introduced in IEEE 802.11e QoS specification, is to transmit multiple packets right after channel acquisition. Thus, congested nodes can forward buffered packets promptly and minimize bottleneck situation. Each node begins to transmit packets in normal mode whenever its congested status is dissolved. We also propose two threshold values to define exact overloaded status adaptively; one is interface queue length and the other is buffer occupancy time. Through an experimental simulation study, we have compared and contrasted our protocol with normal on demand routing protocols and showed that the proposed scheme is more efficient and effective especially when network traffic is heavily loaded.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.409-411
• /
• 2001

기존의 인터넷 라우터는 Drop tail 방식으로 패킷을 관리한다. 따라서 네트워크 트래픽의 지수적인 증가로 인한 혼잡 상황으로 발생하는 패킷 손실을 해결 한 수 없다. 이 문제를 해결하기 위해 IETF (Internet Engineering Task Force)에서는 REU(Random Early Detection) 알고리즘과 같은 능동적인 큐 관리 알고리즘을 제시하였다. 하지만 RED 알고리즘은 네트워터 환경에 따른 매개 변수의 설정의 어려움을 가지고 치어 잘못 된 매개변수 설정으로 인하여 네트워크 성능이 저하되는 문제점을 가지고 있다. 본 논문에서는 기존의 RED를 개선한 ARED를 제안했다. ARED는 RED 알고리즘의 문제점을 개선하여 네트워크 특성에 맞추어 동적으로 매개변수글 조절하는 알고리즘이다. ns를 이용한 실험을 통하여 ARED의 성능을 검증하였다.