• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.11
• /
• pp.5200-5222
• /
• 2017

The separation of control plane and data plane in Software Defined Network (SDN) makes it flexible to control the network behavior, while also causes some inconveniences to the link failure recovery due to the delay between fail point and the controller. To avoid delay and packet loss, pre-defined backup paths are used to reroute the disrupted flows when failure occurs. However, it may introduce large overhead to build and maintain these backup paths and is hard to dynamically construct backup paths according to the network status so as to avoid congestion during rerouting process. In order to realize congestion aware fast link failure recovery, this paper proposes a novel method which installs multi backup paths for every link via source routing and per-hop-tags and spread flows into different paths at fail point to avoid congestion. We carry out experiments and simulations to evaluate the performance of the method and the results demonstrate that our method can achieve congestion aware fast link failure recovery in SDN with a very low overhead.

• Journal of Internet Computing and Services
• /
• v.18 no.6
• /
• pp.65-73
• /
• 2017

Congestion occurring at wireless sensor networks(WSNs) causes packet delay and packet drop, which directly affects overall QoS(Quality of Service) parameters of network. Network congestion is critical when important data is to be transmitted through network. Thus, it is significantly important to effectively control the congestion. In this paper, new mechanism to guarantee reliable transmission for the important data is proposed by considering the importance of packet, configuring packet priority and utilizing the settings in routing process. Using this mechanism, network condition can be maintained without congestion in a way of making packet routed through various routes. Additionally, congestion control using packet service time, packet inter-arrival time and buffer utilization enables to reduce packet delay and prevent packet drop. Performance for the proposed mechanism was evaluated by simulation. The simulation results indicate that the proposed mechanism results to reduction of packet delay and produces positive influence in terms of packet loss rate and network lifetime. It implies that the proposed mechanism contributes to maintaining the network condition to be efficient.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.1A
• /
• pp.16-24
• /
• 2010

High Speed Uplink Packet Access(HSUPA) is a WCDMA Release 6 technology which corresponds to High Speed Downlink Packet Access(HSDPA). Node B Supports fast scheduling, Hybrid ARQ(HARQ), short Transmission Time Interval(TTI) for high rate uplink packet data. It is very important to detect Iub congestion to improve end user's Quality of Service(QoS). This paper proposes Node B Congestion Detection(BCD) mechanism and suggests to use the hybrid of Transport Network Layer(TNL) congestion detection and BCD. It is shown that HSUPA user throughput performance can be improved by the proposed method even with small Iub bandwidth.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.10
• /
• pp.4977-4996
• /
• 2016

The existence of excessively large and too filled network buffers, known as bufferbloat, has recently gained attention as a major performance problem for delay-sensitive applications. Researchers have made three types of suggestions to solve the bufferbloat problem. One is End to End (E2E) congestion control, second is deployment of Active Queue Management (AQM) techniques and third is the combination of above two. However, these solutions either seem impractical or could not obtain good bandwidth utilization. In this paper, we propose a Transmission Control Protocol（TCP）delayed window update mechanism which uses a congestion detection approach to predict the congestion level of networks. When detecting the network congestion is coming, a delayed window update control strategy is adopted to maintain good protocol performance. If the network is non-congested, the mechanism stops work and congestion window is updated based on the original protocol. The simulation experiments are conducted on both high bandwidth and long delay scenario and low bandwidth and short delay scenario. Experiment results show that TCP delayed window update mechanism can effectively improve the performance of the original protocol, decreasing packet losses and queuing delay while guaranteeing transmission efficiency of the whole network. In addition, it can perform good fairness and TCP friendliness.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.18 no.2
• /
• pp.9-16
• /
• 2022

The nodes constituting the vehicle ad hoc network (VANET) are vehicles moving along the road and road side units (RSUs) installed around the road. The vehicle ad hoc network is used to collect the status, speed, and location information of vehicles driving on the road, and to communicate with vehicles, vehicles, and RSUs. Today, as the number of vehicles continues to increase, urban roads are suffering from traffic jams, which cause various problems such as time, fuel, and the environment. In this paper, we propose a method to solve traffic congestion problems on urban roads and demonstrate that the method can be applied to solve traffic congestion problems through performance evaluation using two typical protocols of vehicle ad hoc networks, AODV and GPSR. The performance evaluation used ns-2 simulator, and the average number of traffic jams and the waiting time due to the average traffic congestion were measured. Through this, we demonstrate that the vehicle ad hoc-based traffic congestion management technique proposed in this paper can be applied to urban roads in smart cities.

• Journal of IKEEE
• /
• v.27 no.4
• /
• pp.379-385
• /
• 2023

Distributed congestion control (DCC) is a technology that mitigates channel congestion and improves communication performance in high-density vehicular networks. Traditional DCC techniques operate to reduce channel congestion without considering quality of service (QoS) requirements. Such design of DCC algorithms can lead to excessive DCC actions, potentially degrading other aspects of QoS. To address this issue, we propose a deep reinforcement learning-based QoS-adaptive DCC algorithm. The simulation was conducted using a quasi-real environment simulator, generating dynamic vehicular densities for evaluation. The simulation results indicate that our proposed DCC algorithm achieves results closer to the targeted QoS compared to existing DCC algorithms.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.4
• /
• pp.183-188
• /
• 2024

As time progresses and technology advances, many modes of transportation have emerged compared to the past. People use various means of transportation including personal cars, subways, buses, and taxis, among which public transport is utilized by people of all ages and genders. Public transportation has the advantage of being affordable and convenient, but with the increase in population compared to the past, traffic congestion has also been increasing, making it increasingly uncomfortable. Especially during specific times or on certain dates, traffic congestion can become significantly worse than usual. Among these, the subway is the mode of transportation used most frequently. Therefore, in this study, we will discuss solutions and analyze the causes of congestion by subway section using the R program.

• Proceedings of the KIEE Conference
• /
• 2000.07a
• /
• pp.347-349
• /
• 2000

Under an open transmission access, the generation dispatch is determined by the bidding process of market participants. Congestion occurs when the dispatch would result in the violation of operational constraints. Congestion problem is formulated and solved by OPF(optimal power flow) calculation. The objective functions in OPF are given as quadratic cost functions or piecewise linear functions of bidding functions. In this study, the optimization technique of generation dispatch is presented for the combination of two types of quadratic and linear cost functions.

• Proceedings of the KIEE Conference
• /
• 2000.11a
• /
• pp.107-109
• /
• 2000

This paper presents an algorithm for reducing congestion cost using decoupled optimal power flow. The main idea of this algorithm is to reduce the reactive power flows on the congested lines in reactive power optimization. New objective function for reducing congestion cost is proposed in the reactive formulation by introducing the shadow prices for congested lines. The proposed algorithm is tested for IEEE 14-bus sample system, and the results are presented and discussed.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.417-424
• /
• 2003

In this paper, we introduce and analyze a feedback control model of TCP/AQM dynamics. Then, we propose the Pro-active Queue Management (PAQM) mechanism, which can provide proactive congestion avoidance and control using an adaptive congestion indicator and a control function for wide range of traffic environments. The PAQM stabilizes the queue length around a desired level while giving smooth and low packet loss rates independent of the traffic load level under a wide range of traffic environment. The PAQM outperforms other AQM algorithms such as Random Early Detection (RED) [1] and PI-controller [2]