• Proceedings of the IEEK Conference
• /
• 2002.06e
• /
• pp.83-86
• /
• 2002

In this paper while a router is routing all packet to the next hop, it inspects whether there is congestion on this current hop router or not and if the router discovers that it has some congestion, it informs that the packet is experienced to congestion. The packet arrived to next hop including some information about the congestion is processed first and it has wider bandwidth than another packet The amount of congestion is recorded to the DS field of IP header by congestion experience level. In the next hop when the packet including the congestion information is routed, the standard packet dropping ratio of the current router is changed in proportion to congestion experience that is recorded in IP header on of that. When the packet that has experienced congestion before is arrived, the router extends the drop threshold value not to drop the packet. It mean that transferring the audio or video stream, if the packet is already experienced the congestion in another hop, the router can provide the better service quality about 15∼25% than another.

• Journal of Electrical Engineering and Technology
• /
• v.7 no.2
• /
• pp.141-150
• /
• 2012

The present study examines an efficient congestion management system compatible with the evolving environment. The key is to build an information model shared and exchanged for marketbased solutions to alleviate congestion. Traditional methods for congestion management can be classified into two categories, i.e., the centralized scheme and the decentralized scheme, depending on the extent to which the independent system operator (ISO) is involved in market participants' (MPs) activities. Although the centralized scheme is more appropriate for providing reliable system operation and relieving congestion in near real-time, the decentralized scheme is preferred for supporting efficient market operation. The minimum set of information between the ISO and MPs for decentralized scheme is identified: i) congestion-based zone, ii) Power Transfer Distribution Factors, and iii) transmission congestion cost. The mathematical modeling of the proposed information is expressed, considering its process of making effective use of information. Numerical analysis is conducted to demonstrate both cost minimization from the MP perspective and the reliability enhancement from the ISO perspective based on the proposed information exchange scheme.

• The KIPS Transactions:PartC
• /
• v.9C no.4
• /
• pp.513-522
• /
• 2002

Current end-to-end congestion control depends only on the information of end points (using three duplicate ACK packets) and generally responds slowly to the network congestion. This mechanism can't avoid TCP global synchronization which TCP congestion window size is fluctuated during congestion occurred and if RTT (Round Trip Time) is increased, three duplicate ACK packets is not a correct congestion signal because congestion maybe already disappeared and the host may send more packets until receive the three duplicate ACK packets. Recently there is increasing interest in solving end-to-end congestion control using active network frameworks to improve the performance of TCP protocols. ACC (Active congestion control) is a variation of TCP-based congestion control with queue management In addition traffic modifications nay begin at the congested router (active router) so that ACC will respond more quickly to congestion than TCP variants. The advantage of this method is that the host uses the information provided by the active routers as well as the end points in order to relieve congestion and improve throughput. In this paper, we model enhanced ACC, provide its algorithm which control the congestion by using information in core networks and communications between active routers, and finally demonstrate enhanced performance by simulation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2006.05a
• /
• pp.442-445
• /
• 2006

In Wireless Sensor Networks(WSNs), a sensor node broadcasts an acquisited data to neighboring other nodes and it makes serious data duplication problem that increases network traffic loads and data loss. This problem is concerned with the conflict condition for supporting both the reliability of data transfer and avoidance of network congestion. To solve the problem, a reliable congestion control protocol is necessary that considers critical factors affecting on data transfer reliability such as reliable data transmission, wireless loss, and congestion loss for supporting effective congestion control in WSNs. In this paper, we proposes a reliable congestion protocol, ratted HRCCP, based on hop-hop sequence number, and DSbACK by minimizing useless data transfers as an energy-saved congestion control method.

• Journal of the Korea Society of Computer and Information
• /
• v.24 no.2
• /
• pp.49-56
• /
• 2019

In this paper, we propose an efficient congestion control scheme for interworking between 5GS(5G system) and LTE(Long-Term Evolution), called ECC(Efficient Congestion Control). The proposed congestion control scheme (ECC) is considered for coexistence of 5GS and legacy LTE systems and provides a prompt service connectivity based on overriding method while the backoff timer is running in the UE. Also, we briefly introduce Rel-15 5GS from a congestion control perspective and the proposed ECC and simulation results for the existing legacy congestion control mechanism and ECC in the 5GS-LTE coexisting environment are presented. Lastly, the improvement direction is considered in future 3GPP 5GS phase 2 standard in this paper.

• Journal of Information Technology Services
• /
• v.20 no.5
• /
• pp.29-41
• /
• 2021

The spread of COVID-19 has been changed the tourism industry. Travelers changed their traveling style and started to consider congestion of the spot for their health and safety. In Jeju, a famous tourist destination in South Korea, managing the congestion of tourists has become an important issue. This example introduces the Jeju Tourism Organization's development of a system as a smart tourism information service that manages congestion in real-time big data. Combining with congestion theory and behavior immune system, we would like to assure the necessity of the system. Also, by analyzing the system, we understand how deducing congestion information from big data and the new paradigm of the tourism industry combined with congestion theory. Data was collected by Korea's telecommunication company SKT to develop the system. The paper explains the reason for choosing the company and the pros of data quality. We expect this system to be a solution for any other city in the world under a similar situation. Finally, several suggestions for the system are included to promote and better future usage.

• Journal of Korea Multimedia Society
• /
• v.13 no.12
• /
• pp.1798-1804
• /
• 2010

TCP with AIMD mechanism, one of the most popular protocols in internet, can solve congestion control in wired networks. This protocol, however, is not efficient in wireless networks. This paper proposes a new mechanism namely General AIMD with Congestion Window Upper Bound in which congestion window is limited by an upper bound. By applying optimization theory, we find an optimal policy for congestion window upper bound to maximize network throughput.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.33 no.11B
• /
• pp.961-967
• /
• 2008

Congestion control is one of major mechanisms to avoid dropped packets. Many researchers use optimization theories to find an efficient way to reduce congestion in networks, but they do not consider robustness that may lead to unstable network utilities. This paper proposes a new methodology in order to solve a congestion control problem for wired networks by using a robust design principle. In our particular numerical example, the proposed method provides robust solutions that guarantee high and stable network utilities.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.8
• /
• pp.3809-3822
• /
• 2017

Wireless Sensor Networks hold the limelight because of significant potential for distributed sensing of large geographical areas. The radio duty cycling mechanism that turns off the radio periodically is necessary for the energy conservation, but it deteriorates the network congestion when the traffic load is high, which increases the packet loss and the delay too. Although many papers for WSNs have tried to mitigate network congestion, none of them has mentioned the congestion problem caused by the radio duty cycling of MAC protocols. In this paper, we present a simple and efficient congestion control technique that operates on the radio duty cycling MAC protocol. It detects the congestion by checking the current queue size. If it detects the congestion, it extends the network capacity by adding supplementary wakeup times. Simulation results show that our proposed scheme highly reduces the packet loss and the delay.

• KIISE Transactions on Computing Practices
• /
• v.21 no.1
• /
• pp.19-28
• /
• 2015

In this paper, we proposed an algorithm for the identification of relieving or worsening current traffic congestion using historic traffic congestion patterns. Historical congestion patterns were placed in an adjacency list. The patterns were constructed to represent spatial and temporal length for status of a congested road. Then, we found information about historical traffic congestions that were similar to today's traffic congestion and will use that information to show how to change traffic congestion in the future. The most similar pattern to current traffic status among the historical patterns corresponded to starting section of current traffic congestion. One of our experiment results had average error when we compared identified changes of the congestion for one of the sections in the congestion road by using our proposal and real traffic status. The average error was 15 minutes. Another result was for the long congestion road consisting of several sections. The average error for this result was within 10 minutes.