• 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:Information Networking
• /
• v.32 no.5
• /
• pp.583-592
• /
• 2005

An important factor influencing the robustness of the Internet is the end-to-end TCP congestion control. However, the congestion control scheme of TCP Reno, the most popular TCP version on the Internet, employs passive congestion indication. It makes the network congestion worse. Brakmo and Peterson proposed a congestion control algorithm, TCP Vegas, by modifying the congestion avoidance scheme of TCP Reno. Many studies indicate that Vegas is able to achieve better throughput and higher stability than Reno. But there are three unfairness problems in Vegas. These problems hinder the spread of Vegas in the current Internet. In this paper, in order to solve these unfairness problems, we propose a new congestion control algorithm called TCP NewVegas. The proposed NewVegas is able to solve these unfairness problems effectively by using the variation of the number of queued packets in a bottleneck router. To evaluate the proposed approach, we compare the performance among NewVegas, Reno and Vegas. Through the simulation, NewVegas is shown to be able to achieve throughput and better fairness than Vegas.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1917-1921
• /
• 1999

In this paper, we studied the method of path distribution in order to increase reliability of the network by reducing path congestion, solving the problems of increasing blocking statistics, and increasing the utilization of network resource. A scheme of efficient path calculation which can reduce the traffic congestion in an arbitrary link is proposed by path calculation equations considering link occupation rates. A rapid method of establishing a connection which can efficiently cope with accidental connection failure are studied.

• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.8
• /
• pp.774-779
• /
• 2012

We design and implement a RTT (Round Trip Time) based TCP (Transmission Control Protocol) for USN (Ubiquitous Sensor Network). We adopt a basic update algorithm for window size from FAST TCP that uses the queuing delay at link as the congestion measure. The designed TCP estimates the queuing delay at link from the measured RTT in the network layer, and updates the window size based on the estimated queuing delay. The designed TCP allows to utilize the full capacity of USN links and avoids the waste of the given link capacity that is common without the flow control in the transport layer. The experiment results show that the window size of the sender converges within a small range of variations without any packet loss, and verify the stability and performance of the designed TCP.

• Journal of Korea Multimedia Society
• /
• v.19 no.8
• /
• pp.1404-1414
• /
• 2016

Cross-layer design is a concept, which captures the dependencies and interactions and enables information sharing among layers in order to improve the network performance and security. There are two key challenges in wireless networks, lossy features of links and power assumption of network nodes. Cross-layer design of congestion control and power allocation in wireless lossy networks has been studied in the existing literature; however, there has been no contribution proposed in the literature that exploits the path diversity. In this paper, we are motivated to develop a cross-layer design of congestion control and power allocation, which takes into account lossy features of wireless links and transmission powers of network nodes and can be implemented in a distributed manner. Numerical simulation is conducted to illustrate the performance of our proposed algorithm and the comparison with current alternative approaches.

• ETRI Journal
• /
• v.44 no.2
• /
• pp.194-207
• /
• 2022

In the last decade, substantial progress has been achieved in intelligent traffic control technologies to overcome consistent difficulties of traffic congestion and its adverse effect on smart cities. Edge computing is one such advanced progress facilitating real-time data transmission among vehicles and roadside units to mitigate congestion. An edge computing-based deep reinforcement learning system is demonstrated in this study that appropriately designs a multiobjective reward function for optimizing different objectives. The system seeks to overcome the challenge of evaluating actions with a simple numerical reward. The selection of reward functions has a significant impact on agents' ability to acquire the ideal behavior for managing multiple traffic signals in a large-scale road network. To ascertain effective reward functions, the agent is trained withusing the proximal policy optimization method in several deep neural network models, including the state-of-the-art transformer network. The system is verified using both hypothetical scenarios and real-world traffic maps. The comprehensive simulation outcomes demonstrate the potency of the suggested reward functions.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.18 no.2
• /
• pp.67-73
• /
• 2023

Tree routing is one of appropriate routing schemes in wireless sensor network because the complexity of this approach is relatively low. But, congestion at a specific node may happen because a parent node toward a sink node is usually selected in one hop way, specially where large number of node are deployed. As feasible solution for this problem, multiple paths and sinks schemes can be applied. However, the performance of these schemes are not proved and analyzed yet. In this paper, we conduct diverse simulaton scenarios performance evaluation for these cases to identify the improvement and analyze the impact of schemes. The performance is measured in the aspects of packet transmission rate, throughput, and end-to-end delay as a function of amount of network traffic.

• Journal of Advanced Navigation Technology
• /
• v.12 no.3
• /
• pp.233-238
• /
• 2008

Recently, network component become to follow wireless and mobile network from wired network proposed that many TCP algorithm optimized in variety environment. When TCP was created, however as it was design based on wired link, wireless link made more transmission error than wired link. Transmission errors are more frequent and may be incorrectly regarded as indications of network congestion. In this paper, it conduct how effect congestion control algorithm in Mobile ad-hoc network and compare traffic of TCP-Tahoe, TCP-Reno, TCP-New-Reno and TCP-Vegas in Mobile ad-hoc environment.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2019.05a
• /
• pp.451-453
• /
• 2019

Recently, as the use of wireless communication devices has increased, the wireless network usage has increased, and a wired network and a wireless network have been mixed to form a network. Existing TCP algorithms are designed for wired networks. Therefore, in the modern network environment, packet loss can not be accurately distinguished and improper congestion control is performed, resulting in degradation of TCP performance. In this paper, we propose SLDA (Support Vector Machine based Loss Discrimination Algorithm) which can accurately classify the packet loss environment to improve TCP performance and evaluate its performance.