• 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 the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.10 s.352
• /
• pp.8-17
• /
• 2006

Recently, the high-speed Internet users increase rapidly and broadband networks have been widely deployed. However, the current TCP congestion control algorithm was designed for relatively narrowband network environments, and thus its performance is inefficient for traffic transport in broadband networks. To remedy this problem, the TCP having an enhanced congestion control algorithm is required for broadband networks. In this paper, we propose an improved TCP congestion control that can sufficiently utilize the large available bandwidth in broadband networks. The proposed algorithm predicts the available bandwidth by using ACK information and RTT variation, and prevents large packet losses by adjusting congestion window size appropriately. Also, it can rapidly utilize the large available bandwidth by enhancing the legacy TCP algorithm in congestion avoidance phase. In order to evaluate the performance of the proposed algorithm, we use the ns-2 simulator. The simulation results show that the proposed algorithm improves not only the utilization of the available bandwidth but also RTT fairness and the fairness between contending TCP flows better than the HSTCP in high bandwidth delay product network environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.8
• /
• pp.2796-2813
• /
• 2014

This paper presents a new algorithm called the adaptive logarithmic increase and adaptive decrease algorithm (A-LIAD), which mainly addresses the Round-Trip Time (RTT) fairness problem in satellite networks with a very high propagation delay as an alternative to the current TCP congestion control algorithm. We defined a new increasing function in the fashion of a logarithm depending on the increasing factor ${\alpha}$, which is different from the other logarithmic increase algorithm adopting a fixed value of ${\alpha}$ = 2 leading to a binary increase. In A-LIAD, the ${\alpha}$ value is derived in the RTT function through the analysis. With the modification of the increasing function applied for the congestion avoidance phase, a hybrid scheme is also presented for the slow start phase. From this hybrid scheme, we can avoid an overshooting problem during a slow start phase even without a SACK option. To verify the feasibility of the algorithm for deployment in a high-speed and long-distance network, several aspects are evaluated through an NS-2 simulation. We performed simulations for intra- and interfairness as well as utilization in different conditions of varying RTT, bandwidth, and PER. From these simulations, we showed that although A-LIAD is not the best in all aspects, it provides a competitive performance in almost all aspects, especially in the start-up and packet loss impact, and thus can be an alternative TCP congestion control algorithm for high BDP networks including a satellite network.

• Journal of Korean Port Research
• /
• v.14 no.2
• /
• pp.175-185
• /
• 2000

Today freeway is experiencing a severe congestion with incoming or outgoing traffic through freeway ramps during the peak periods. Thus, the purpose of this study is to identify the traffic characteristics, analyze the relationships between the traffic characteristics and finally construct the delay predictive models on the rap junctions of freeway with 70mph speed limit. From the traffic analyses, and model construction and verification for delay prediction on the ramp junctions of freeway, the following results were obtained : ⅰ) Traffic flow showed a big difference depending on the time periods. Especially, more traffic flows were concentrated on the freeway junctions in the morning peak period. ⅱ) The occupancy also showed a big difference depending on the time periods, and the downstream occupancy(Od) was especially shown to have a higher explanatory power for the delay predictive model construction on the ramp junctions of freeway. ⅲ) The delay-occupancy curve showed a remarkable shift based on the occupancies observed : O$\_$d/〈9% and O$\_$d/$\geq$9%. Especially, volume and occupancy were shown to be highly explanatory for delay prediction on the ramp junctions of freeway under O$\_$d/$\geq$9%, but lowly for delay prediction on the ramp junctions of freeway under O$\_$d/〈9%. Rather, the driver characteristics or transportation conditions around the freeway were thought to be a little higher explanatory for the delay prediction under O$\_$d/〈9%. ⅳ) Integrated delay predictive models showed a higher explanatory power in the morning peak period, but a lower explanatory power in the non-peak periods.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.12
• /
• pp.149-158
• /
• 2005

This paper proposes a congestion avoidance algorithm which provides stable throughput and transmission rate regardless of buffer size by limiting the TCP congestion window in fixed bandwidth networks. Additive Increase, Multiplicative Decrease (AIMD) is the most commonly used congestion control algorithm. But, the AIMD-based TCP congestion control method causes unnecessary packet losses and retransmissions from the congestion window increment for available bandwidth verification when used in fixed bandwidth networks. In addition, the saw tooth variation of TCP throughput is inappropriate to be adopted for the applications that require low bandwidth variation. We present an algorithm in which congestion window can be limited under appropriate circumstances to avoid congestion losses while still addressing fairness issues. The maximum congestion window is determined from delay information to avoid queueing at the bottleneck node, hence stabilizes the throughput and the transmission rate of the connection without buffer and window control process. Simulations have performed to verify compatibility, steady state throughput, steady state packet loss count, and the variance of congestion window. The proposed algorithm can be easily adopted to the sender and is easy to deploy avoiding changes in network routers and user programs. The proposed algorithm can be applied to enhance the performance of the high-speed access network which is one of the fixed bandwidth networks.

• Journal of Advanced Navigation Technology
• /
• v.15 no.6
• /
• pp.1025-1033
• /
• 2011

This paper presents a realization of a peer-to-peer communication system for a UAV navigational monitoring using a commercial HSDPA(High Speed Download Packet Access) mobile communication device. The realized system consists of a communication server, an air data terminal and multiple ground monitoring devices, where the server transfers navigational data from a UAV to multiple monitoring devices in real-time with commercial HSDPA modem. Through ground and flight tests, data were obtained to observe the realized system. Test results show that, depending on communicational environment, about 300msec delay, congestion and packet-loss between air data terminal and ground monitoring devices. Nevertheless, through high-speed long range test on a ground vehicle and altitude test with a UAV flight, the feasibility of a UAV navigational monitoring system was observed.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.46 no.2
• /
• pp.104-113
• /
• 2009

Recently, high-speed Internet users and broadband network infrastructure are increasing. However, the TCP protocol widely used in the Internet is an appropriate transport only for the legacy Internet, it is inefficient for traffic transport for network environments with large bandwidth-delay product. In order to remedy this problem, there have been many researches about improved congestion control algorithms for broadband networks. In these studies, most of performance evaluation has been done by simulations. In this paper, after we reviewed the proposed high bandwidth transport layer protocols, we implemented a real testbed, measured the performance and analyzed the problems of high-speed transport protocols through the international research network TEIN2 between three nations, Korea, China, and Germany.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.4
• /
• pp.618-636
• /
• 1997

DQDB(Distributed Queue Dual Bus) protocol, the IEEE 802.6 standard protocol for metropolitan area networks, does not fully take advantage of the capabilities of dual bus architecture. Although fairness in bandwidth distribution among nodes is improved when using so called the bandwidth balancing mechanism, the protocol requires a considerable amount of time to adjust to changes in the network load. Additionally, the bandwidth balancing mechanism leaves a portion of the available bandwidth unused. In a high-speed backbone network, each node may act as a bridge/ router which connects several LANs as well as hosts. However, Because the existence of high speed LANs becomes commonplace, the congestionmay occur on a node because of the limitation on access rate to the backbone network and on available buffer spaces. to release the congestion, it is desirable to install some congestion control algorithm in the node. In this paper, we propose an efficient congestion control mechanism and fair and waster-free MAC protocol for dual bus network. In this protocol, all the buffers in the network can be shared in such a way that the transmission rate of each node can be set proportional to its load. In other words, a heavily loaded node obtains a larger bandwidth to send the sements so tht the congestion can be avoided while the uncongested nodes slow down their transmission rate and store the incoming segments into thier buffers. this implies that the buffers on the network can be shared dynamically. Simulation results show that the proposed probotol significantly reduces the segment queueing delay of a heavily loaded node and segment loss rate when compared with original DQDB. And it enables an attractive high throughput in the backbone network. Because in the proposed protocol, each node does not send a requet by the segment but send a request one time in the meaning of having segments, the frequency of sending requests is very low in the proposed protocol. so the proposed protocol signigificantly reduces the segment queuing dely. and In the proposed protocol, each node uses bandwidth in proportion to its load. so In case of limitation of available buffer spaces, the proposed protocol reduces segment loss rate of a heavily loaded node. Bandwidth balancing DQDB requires the wastage of bandwidth to be fair bandwidth allocation. But the proposed DQDB MAC protocol enables fair bandwidth without wasting bandwidth by using bandwidth one after another among active nodes.

• Journal of the Korea Society of Computer and Information
• /
• v.7 no.3
• /
• pp.143-148
• /
• 2002

Congestion may take place in the ATM network because of high-speed cell transmission features, and cell delay and loss also can be caused by unexpected traffic variation. Thus, traffic control mechanisms are needed. One of them to decrease congestion is the Cell shaping. This paper proposes a hybrid type cell shaper composed of a Leaky Bucket with token pool, Tn with time window, and a spacing control buffer. The simulator BONeS with the ON/OFF traffic source model evaluates the performance of the proposed cell shaping method. Simulation results show that the cell shaping concerning the respective source traffics is adapted to and then controlled on the mean bit rate.

• Journal of the Korea Society of Computer and Information
• /
• v.6 no.1
• /
• pp.45-50
• /
• 2001

Congestion may take place in the ATM network because of high-speed cell transmission features, and cell delay and loss also can be caused by unexpected traffic variation. Thus. traffic control mechanisms are needed. One of them to decrease congestion is the cell shaping. This paper proposes a hybrid type cell shaper composed of a Leaky Bucket with token pool, EWMA with time window, and a spacing control buffer. The simulator BONeS with the ON/OFF traffic source model evaluates the performance of the proposed cell shaping method. Simulation results show that the cell shaping concerning the respective source traffics is adapted to and then controlled on the mean bit rate.