• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.294-301
• /
• 2004

This paper presents a combination of optimization concept and congestion control for multicast communications to bring best benefit for the network. For different types of Internet services, there will be different utility functions and so there will be different ways to choose on how to control the congestion, especially for real time multicast traffic. Our proposed algorithm OMCC brings the first implementation experiment of utility-based Multicast Congestion Control. Simulation results show that OMCC brings better network performances in multicast session throughput while it still keeps a certain fairness of unicast and multicast sessions, and thus, provides better benefit for all network participants.

• Journal of Communications and Networks
• /
• v.6 no.2
• /
• pp.133-146
• /
• 2004

Recently, many active queue management (AQM) algorithms have been proposed to address the performance degradation. of end-to-end congestion control under tail-drop (TD) queue management at Internet routers. However, these AQM algorithms show performance improvement only for limited network environments, and are insensitive to dynamically changing network situations. In this paper, we propose an adaptive queue management algorithm, called PID-controller, that uses proportional-integral-derivative (PID) feedback control to remedy these weak-Dalles of existing AQM proposals. The PID-controller is able to detect and control congestion adaptively and proactively to dynamically changing network environments using incipient as well as current congestion indications. A simulation study over a wide range of IP traffic conditions shows that PID-controller outperforms other AQM algorithms such as Random Early Detection (RED) [3] and Proportional-Integral (PI) controller [9] in terms of queue length dynamics, packet loss rates, and link utilization.

• 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.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.9
• /
• pp.4205-4227
• /
• 2018

Network Coding (NC) is an approach recently investigated for increasing the network throughput and thus enhancing the performance of wireless mesh networks. The benefits of NC can further be improved when routing decisions are made with the awareness of coding capabilities and opportunities. Typically, the goal of such routing is to find and exploit routes with new coding opportunities and thus further increase the network throughput. As shown in this paper, in case of proactive routing the coding awareness along with the information of the measured traffic coding success can also be efficiently used to support the congestion avoidance and enable more encoded packets, thus indirectly further increasing the network throughput. To this end, a new proactive routing procedure called Congestion-Avoidance Network Coding-Aware Routing (CANCAR) is proposed. It detects the currently most highly-loaded node and prevents it from saturation by diverting some of the least coded traffic flows to alternative routes, thus achieving even higher coding gain by the remaining well-coded traffic flows on the node. The simulation results confirm that the proposed proactive routing procedure combined with the well-known COPE NC avoids network congestion and provides higher coding gains, thus achieving significantly higher throughput and enabling higher traffic loads both in a representative regular network topology as well as in two synthetically generated random network topologies.

• Proceedings of the IEEK Conference
• /
• summer
• /
• pp.189-192
• /
• 2004

This paper focuses on a TCP window-based flow control mechanism with Explicit Congestion Notification (ECN). We investigate the fundamental problem of achieving a fair window control for TCP, which cooperates with ECN. This is done by using feedback congestion pricing as a means of estimating the state of bottleneck router. The problem is solved by achieving network optimal performance, which maximize the total user utilities. We then look at the simulation of such scheme.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.11
• /
• pp.487-494
• /
• 2014

This paper focuses on an advanced congestion control scheme for M2M(Machine-to-Machine) communications in 3GPP LTE-A standard. A large number of MTC(Machine-type-Communication) devices try to access to LTE-A networks and send data to the networks all at once. In this characteristics, M2M communications will bring the serious network congestion problems into LTE-A cellular networks. To solve this critical problem, a congestion control mechanism will be required and it has been studied since Rel-10 LTE-A systems based on backoff mechanism for mobility management and session management. In this paper, we briefly introduce the main concept and operation about the congestion control scheme in 3GPP LTE-A standard. Also, simulation results for the basic congestion control and advanced congestion control scheme in MTC communication environment are provided and the improvement direction is considered in future 3GPP LTE-A standard.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.974-981
• /
• 2014

These days, use of multimedia streaming service and demand of QoS (Quality of Service) improvement have been increased because of development of network. QoS of streaming service is influenced by a jitter, delay, throughput, and loss rate. For guaranteeing these factors which are influencing QoS, the role of transport layer is very important. But existing TCP which is a typical transport layer protocol increases the size of congestion window slowly and decreases the size of a congestion window drastically. These TCP characteristic have a problem which cannot guarantee the QoS of UHD multimedia streaming service. In this paper, we propose a router buffer based congestion control method for improving the QoS of UHD streaming services. Our proposed scheme applies congestion window growth rate differentially according to a degree of congestion for preventing an excess of available bandwidth and maintaining a high bandwidth occupied. Also, our proposed scheme can control the size of congestion window according to a change of delay. After comparing with other congestion control protocols in the jitter, throughput, and loss rate, we found that our proposed scheme can offer a service which is suitable for the UDH streaming service.

• 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.

• Journal of KIISE
• /
• v.42 no.9
• /
• pp.1162-1174
• /
• 2015

These days, the networks have exhibited HBDP (High Bandwidth Delay Product) characteristics. The legacy TCP slowly increases the size of the congestion window and drastically decreases the size of a congestion window. The legacy TCP has been found to be unsuitable for HBDP networks. TCP mechanisms for solving the problems of the legacy TCP can be categorized into the loss-based TCP and the delay-based TCP. Most of the TCP mechanisms use the standard slow start phase, which leads to a heavy packet loss event caused by the overshoot. Also, in the case of congestion avoidance, the loss-based TCP has shown problems of wastage in terms of the bandwidth and RTT (Round Trip Time) fairness. The delay-based TCP has shown a slow increase in speed and low occupancy of the bandwidth. In this paper, we propose a new scheme for improving the over shoot, increasing the speed of the bandwidth and overcoming the bandwidth occupancy and RTT fairness issues. By monitoring the buffer condition in the bottleneck link, the proposed scheme does congestion control and solves problems of slow start and congestion avoidance. By evaluating performance, we prove that our proposed scheme offers better performance in HBDP networks compared to the previous TCP mechanisms.

• 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.