• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.129-137
• /
• 2016

Transmission Control Protocol as a transport layer protocol provides steady data transfer service. There are some serious concerns about the performance of TCP over diverse networks. The vital concern in TCP network environment is congestion which may occur due to quick transmission rates or because of large number of new connections entering the network at the same time. Size of queues in routers grows thus resulting in packet drops. Retransmission of the dropped packets, and reduced throughput can prove costly. Explicit Congestion Notification (ECN) in conjunction with Active Queue Management mechanisms (AQM) such as Random early detection (RED) is used for packet marking rather than dropping. In IP packet header ECN bits can be added as a sign of congestion thus avoiding needless packet drops. The proposed ECN and AQM mechanism can be implemented with help of ns2 simulator and the performance can be tested on different TCP variants.

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

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.158-163
• /
• 2005

Competitive electricity markets necessitate equitable methods for allocating transmission usage in order to set transmission usage charges and congestion charges in an unbiased and an open-accessed basis. So in competitive markets it is usually necessary to trace the contribution of each participant to line usage, congestion charges and transmission losses, and then to calculate charges based on these contributions. A UPFC offers flexible power system control, and has the powerful advantage of providing, simultaneously and independently, real-time control of voltage, impedance and phase angle, which are the basic power system parameters on which sys-tem performance depends. Therefore, UPFC can be used efficiently and flexibly to optimize line utilization and increase system capability and to enhance transmission stability and dampen system oscillations. In this paper, a mathematical approach to allocate the contributions of system users and UPFCs to transmission system usage is presented. The paper uses a dc-based load flow modeling of UPFC-inserted transmission lines in which the injection model of the UPFC is used. The relationships presented in the paper showed modified distribution factors that modeled impact of utilizing UPFCs on line flows and system usage. The derived relationships show how bus voltage angles are attributed to each of changes in generation, injections of UPFC, and changes in admittance matrix caused by inserting UPFCs in lines. The relationships derived are applied to two test systems. The results illustrate how transmission usage would be affected when UPFC is utilized. The relationships derived can be adopted for the purpose of allocating usage and payments to users of transmission network and owners of UPFCs used in the network. The relationships can be modified or extended for other control devices.

• Proceedings of the KIEE Conference
• /
• 2005.07a
• /
• pp.30-32
• /
• 2005

Due to a major contingency, the congestion of the transmission may happen in power systems. In order to manage the congestion problem, load curtailment is one of the ways to resolve the problem. It is essential that the systematic and effective mechanism for the load shedding be developed. In this paper, the load shedding algorithm using the linear programming for the congestion problems by a major contingency is proposed. The simulations of the proposed algorithm are performed for the power system of Korea and their results are presented.

• International Journal of Control, Automation, and Systems
• /
• v.4 no.1
• /
• pp.53-62
• /
• 2006

In this paper, ATM network congestion control with explicit rate feedback is considered. In ATM networks, delays commonly appear in data transmission and have to be considered in congestion control design. In this paper, a bounded single round delay on the return path is considered. Our objective is to design an explicit rate feedback control that achieves a robust optimal $H_2$ performance regardless of the bounded time-varying delays. An optimization approach in terms of linear matrix inequalities (LMIs) is given. Saturation in source rate and queue buffer is also taken into consideration in the proposed design. Simulations for the cases of single source and multiple sources are presented to demonstrate the effectiveness of the design.

• Journal of Korea Society of Industrial Information Systems
• /
• v.8 no.4
• /
• pp.17-25
• /
• 2003

In the current bandwidth mechanism, ISPs provide guaranteed internet bandwidth within itself domains. Also transmission of data through the network can cause congestion. An inevitable consequence is partly responsible for the difficulties to ISPs and customers. In economic views, multiple demands for a scarce resource are mediated through a bandwidth market. Using the auction-based admission algorithm In price congestion, I propose a different pricing scheme for statistically guaranteed QoS.

• Journal of Advanced Navigation Technology
• /
• v.15 no.2
• /
• pp.241-247
• /
• 2011

Most of network congestions are caused by TCP packet losses in the wired network ecosystems. On the contrary, high BER (Bit Error Rate), which is characteristic of the wireless networks, is a main factor in wireless network environments. Many wireless networks carry out the congestion control mechanisms frequently because they estimate that packet losses are not due to the wireless signal qualities but the congestion controls in their networks. To solve this problem, we propose the improved EWLN (Explicit Wireless Loss Notification) algorithm that more efficiently utilize the congestion window size to increase the wireless network throughput than legacy EWLN algorithm.

• Journal of KIISE:Information Networking
• /
• v.41 no.4
• /
• pp.186-191
• /
• 2014

Previous work only focuses on a maximization of network coding opportunity since it can reduce the number of packets in network system. However, it can make congestion in a relay node as each source node may transmit each packet with the maximum transmission rate based on the channel qualities. Therefore, in this paper, we propose CmNC (Congestion minimized Network Coding over unreliable wireless links) performing opportunistic network coding to guarantee the network coding gain with the consideration of the congestion and channel qualities. The relay node selects the best network code set based on the objective function for reducing the packet loss and congestion via a dynamic programming. With Qualnet simulations, we show CmNC is better up to 20% than the previous work.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.45 no.9
• /
• pp.30-38
• /
• 2008

The traditional TCP was designed assuming wired networks. Thus, if it is used networks consisting of both wired and wireless networks, all packet losses including random losses in wireless links are regarded as network congestion losses. Misclassification of packet losses causes unnecessary reduction of transmission rate, and results in waste of bandwidth. In this paper, we present WTCP(wireless TCP) congestion control algorithm that differentiates the random losses more accurately, and adopts improved congestion control which results in better network throughput. To evaluate the performance of proposed scheme, we compared the proposed algorithm with TCP Westwood and TCP Veno via simulations.

• Journal of Advanced Navigation Technology
• /
• v.14 no.3
• /
• pp.343-350
• /
• 2010

Wireless Sensor Network is an event-driven system that a large number of micro sensor nodes are collected, giving and Wing information. Congestion can take place easily since a great number of sensor nodes are sensing data and transferring them to sink nodes when an event occurs, comparing to the existing wired network. Current internet transport protocol is TCP/UDP, however, this is not proper for wireless sensor network event-driven ESRT, STCP and CODA are being studied for reliable data transport in the wireless sensor network. Congestion are being detected local buffer and channel loading with these techniques. Broadcasting is mainly used and can avoid congestion when one happens. The way that combining local buffer and channel loading information and detecting congestion is being studied in this paper. When congestion occurs, buffering state is divided into three in order to lessen the broadcasting sending the message on congestion control to the node having frequent channel loading. Thus they have advantage of decreasing network's loading.