• International Journal of Computer Science & Network Security
• /
• v.21 no.9
• /
• pp.132-140
• /
• 2021

Under the mobile ad-hoc network system, the main reason for causing congestion is because of the limited availability of resources. On the other hand, the standardised TCP based congestion controlling mechanism is unable to control and handle the major properties associated with the shared system of wireless channels. It creates an effect on the design associated with suitable protocols along with protocol stacks through the process of determining the mechanisms of congestion on a complete basis. Moreover, when bringing a comparison with standard TCP systems the major environment associated with mobile ad hoc network is regraded to be more problematic on a complete basis. On the other hand, an agent-based mobile technique for congestion is designed and developed for the part of avoiding any mode of congestion under the ad-hoc network systems.

• 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 Korean Port Research
• /
• v.11 no.2
• /
• pp.173-189
• /
• 1997

Whether over taking or parallel sailing of two or more vessels is allowable on marine traffic route or not, the traffic congestion due to traffic volume has to be evaluated separately. In Gaduk-sudo, overtaking or parallel sailing is so allowable that the Bumper Model is introduced to evaluated the traffic congestion. But the channels within the habour limit such as the route of Ulsan New Port are so prohibited overtaking or parallel sailing that the traffic congestion has to be evaluated by using theoretical traffic capacity or by traffic simulation. In this paper, the congestion of Southern New Port and Mipo Port was evaluated the congestion by using theoretical traffic capacity and the other area of Ulsan Port by traffic simulation. The incresed traffic volumes on Ulsan Channels according to Ulsan New Port Development in 2011 were evaluated to have no effect with the traffic congestion.

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

• Journal of Korean Society of Transportation
• /
• v.3 no.1
• /
• pp.46-57
• /
• 1985

The objective of this paper is to derive a optimum distance and time taxi fare structure based on social costs. Social costs expressed in terms of congestion and vehicle operating costs were successfully internalized. Speed and volume data for three major arterials in Seoul CBD were used. Optimum congestion charge turned out to be 97.01 Won/Km which can be regarded as congestion tax in the context of Seoul CBD. This congestion tax can possibly be incorporated into time-based taxi fare structure. Congestion is likely to be reduced as a result of imposition of time-based taxi fare which reflects social costs.

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

• Journal of Information Technology Applications and Management
• /
• v.14 no.2
• /
• pp.97-115
• /
• 2007

The present paper investigates the technological and conceptional characteristics of peering and transit in internet interconnection. Especially, the market with two ISP competing for customers is modeled and the outcome with peering is compared with transit. This paper also analyze the congestion effects on retail price and network capacity. When there is congestion effects occurring from network sharing, the retail price is increased and the fixed fee is decreased with the degree of congestion. Finally, the optimal access charge assuring the socially optimal retail price and network capacity is derived.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4342-4366
• /
• 2016

Congestion control in Cluster Wireless Sensor Networks (CWSNs) has drawn widespread attention and research interests. The increasing number of nodes and scale of networks cause more complex congestion control and management. Active Queue Management (AQM) is one of the major congestion control approaches in CWSNs, and Random Early Detection (RED) algorithm is commonly used to achieve high utilization in AQM. However, traditional RED algorithm depends exclusively on source-side control, which is insufficient to maintain efficiency and state stability. Specifically, when congestion occurs, deficiency of feedback will hinder the instability of the system. In this paper, we adopt the Additive-Increase Multiplicative-Decrease (AIMD) adjustment scheme and propose an improved RED algorithm by using neighbor feedback and scheduling scheme. The congestion control model is presented, which is a linear system with a non-linear feedback, and modeled by Lur'e type system. In the context of delayed Lur'e dynamical network, we adopt the concept of cluster synchronization and show that the congestion controlled system is able to achieve cluster synchronization. Sufficient conditions are derived by applying Lyapunov-Krasovskii functionals. Numerical examples are investigated to validate the effectiveness of the congestion control algorithm and the stability of the network.

• Journal of IKEEE
• /
• v.21 no.2
• /
• pp.115-122
• /
• 2017

In vehicular safety service, every vehicle broadcasts Basic Safety Message (BSM) periodically to inform neighbor vehicles of host vehicle information. However, this can cause network congestion in a region that is crowded with vehicles resulting in a reduction in the message delivery ratio and an increase in the end-to-end delay. Therefore, it could destabilize the vehicular safety service system. In this paper, in order to improve the congestion control and to consider the hidden node problem, we propose a congestion control scheme using entire network congestion level estimation combined with transmission power control, data rate control and time slot based transmission control algorithm. The performance of this scheme is evaluated using a Qualnet network simulator. The simulation result shows that our scheme mitigates network congestion in heavy traffic cases and enhances network capacity in light traffic cases, so that packet error rate is perfectly within 10% and entire network load level is maintained within 60~70%. Thus, it can be concluded that the proposed congestion control scheme has quite good performance.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.9 no.4
• /
• pp.52-59
• /
• 2010

MAC frame aggregation is a method that combines multiple MPDUs (MAC protocol data units) into one PPDU (PHY protocol data units) to enhance network performance at the MAC layer. In ad hoc networks, TCP underperforms due to the congestion window overshooting problem and thus by setting CWL (congestion window limit) TCP performance can be improved. In this paper, we investigate the problem of setting CWL for TCP performance optimization in ad hoc networks with MAC frame aggregation.