• International Journal of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.17-26
• /
• 2019

The Constrained Application Protocol (CoAP) is a specialized web transfer protocol proposed by the IETF for use in IoT environments. CoAP was designed as a lightweight machine-to-machine protocol for resource constrained environments. Due to the strength of low overhead, the number of CoAP devices is expected to rise rapidly. When CoAP runs over UDP for wireless sensor networks, CoAP needs to support congestion control mechanisms. Since the default CoAP defines a minimal mechanism for congestion control, several schemes to improve the mechanism have been proposed. To keep CoAP lightweight, the majority of the schemes have been focused mainly on how to measure RTT accurately and how to set RTO adaptively according to network conditions, but other approaches such as rate-based congestion control were proposed more recently. In this paper, we survey the literature on congestion control for CoAP and discuss the future research directions.

• International Journal of Computer Science & Network Security
• /
• v.21 no.12
• /
• pp.257-263
• /
• 2021

Though many have studied choosing one of the alternative ways to reach a destination, the factors such as average road speed, distance, and number of traffic signals, traffic congestion, safety, and services still presents an indisputable challenge. This paper proposes two approaches: Appropriate membership function and ambiguous rule-based approach. It aims to tackle the route choice problem faced by almost all drivers in any city. It indirectly helps in tackling the problem of traffic congestion. The proposed approach considers the preference of each driver which is determined in a flexible way like a human and stored in the driver profile. These preferences relate to the criteria for evaluating each candidate route, considering the average speed, distance, safety, and services available. An illustrative case study demonstrates the added value of the proposed approach compared to some other approaches.

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

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.3
• /
• pp.29-38
• /
• 1998

This ppaer suggests a congestion control scheme for CL(ConnectionLess) overlay network using the feedback loops getween CL werver, between CL servers, and the header translation table of CL server. The CL overlay network for CBDS(Connectionless Broadband Data Service) defined by ITU0T(International Telecommunication Union-Telecommunication) consists of CL servers which route frames and links which connect between CL user and CL server or between CL servers. In this CL overlay network, two kinds of congestions, link congestion and CL server congestion, may occur. We suggest a scheme that can solve the congestion using ABR(Available Bit Rate) feedback control loop, the traffic control mechanism. This scheme is the link-by-link method suing the ABR feedback control loops between CL user and CL server or between CL servers, and the header translation table of CL server. As CL servers are always endpoints of ABR connections, the congestion staturs of the CL server can be informed to the traffic sources using RM(Resource Management) cell of the ABR feedback loops. Also CL server knows the trafffic sources making congestion by inspecting the source address field of CLNAP-PDUs(ConnectionLess Network Access Protocol - Protocol Data Units). Therefore this scheme can be implemeted easily using only both ABR feedback control loop of ATM layer and the congestion state table using the header translation table of CL server because it does not require separate feedback links for congestion control of CL servers.

• Journal of KIISE:Computing Practices and Letters
• /
• v.14 no.4
• /
• pp.431-435
• /
• 2008

Since previous work CDP(Congestion Driven Placement) [1] considers all possible directions to move every cell in nets which contribute highly to routing congestion, it consumes CPU time a lot. In this paper, we propose a faster global placement technique, so called ICDGP(Improved Congestion Driven Global Placement) to relieve the routing congestion. ICDGP uses the force-directed method to determine the target locations of the cells in the nets in the congested spots, and considers only to move the target location for each cell. If moving multiple cells simultaneously is considered better than moving each cell one by one it moves multiple cells simultaneously. By experimental results, ICDGP produces less congested placement than CDP does. Particularly, the CPU time is reduced by 36% on average.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.6
• /
• pp.1085-1094
• /
• 1994

We propose a traffic flow control scheme of B-NT with temporary cell buffering and selective cell discarding to prevent congestion state of the network nodes in B-ISDN systems to reduce or suppress output cell strams towards T interface. We define the states of the network nodes as normal, pre-congestion, and congestion. In a pre-congestion state, the loss-sensitive traffic is temporarily buffered to slow down the rate of the output traffic streams. In a congestion state, the delay-sensitive traffic is selectively discarded to suppress the output traffic streams as possible in addition to the cell buffering. We model the input cell streams and the states of the network nodes with Interrupted Bernoulli Process and 3-state Markov chain to analyze the performance of the proposed scheme in the B-NT system. The appropriate size of the cell buffer is explored by means of simulation and the influence on the performance of the proposed scheme by the network node state is discussed. As results, more than 2,00 cells of buffer size is needed for the control of medium of lower than the medium, degree of congestion occurrence in the network node while the control of high degree of congestion occurrence is nearly impossible.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.11
• /
• pp.2553-2562
• /
• 2013

It is difficult for TCP congestion control algorithm to ensure the bandwidth and delay bound required for media streaming services in broadband wireless network environments. In this paper, we propose the COIN TCP (COncave INcrease TCP) scheme for providing a high-quality media streaming services. The COIN TCP concavely increases the congestion window size by adjusting the increment rate of congestion window, that is inversely proportional to the amount of data accumulated in the router queue. As a result, our scheme can quickly occupy the available bandwidth and prevent the heavy congestion. It also improves the link utilization by adjusting the decrement rate of congestion window according to the packet loss rate with the random loss. Through the simulation results, we prove that our scheme improves the total throughput in broadband wireless network.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.7
• /
• pp.1599-1609
• /
• 2014

TCP does not ensure the bandwidth and delay bound required for multimedia streaming services in broadband wireless network environments. In this paper, we propose a new congestion control scheme for efficient multimedia transmission, called COLO TCP (Concave Increase Slow Start Logarithmic Increase Congestion Avoidance TCP). The COLO TCP prevents the burst packet loss by applying the concave increase algorithm in slow start phase. In the congestion avoidance phase, COLO TCP uses the logarithmic increase algorithm that quickly recovers congestion window after packet loss. To highly utilize network bandwidth and reduce packet loss ratio, COLO TCP uses additive increase algorithm and adaptive decrease algorithm. Through simulation results, we prove that our COLO TCP is more robust for random loss. It is also possible for efficient multimedia transmission.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.25 no.2
• /
• pp.100-109
• /
• 2022

Large-scale urban concentration of population and vehicles due to economic growth in Korea has been causing serious urban transport problems. Although the collection of congestion pricing has been evaluated as the most effective transportation policy to alleviate traffic demand, its effectiveness is very limited as it was just executed around congested points or along main arterial roads. This study derived dynamic congestion zones with the average travel speed of 206 traffic analysis zones in Busan Metropolitan City to propose a dynamic congestion pricing collection system by employing Space-Time Cube Analysis and Emerging Hot Spot Analysis. As a result, dynamic hot spots were formed from 7h to 24h and particularly, traffic congestion was severely deteriorated from 18h to 20h around Seomyeon and Gwangbok-dong. Therefore, it is expected that the effect of dynamic congestion pricing will be maximized in managing traffic demand in the city center.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.16 no.6
• /
• pp.67-78
• /
• 2017

Traffic congestion cost is increasing annually. Specifically congestion caused by the CDB traffic contains more than a half of the total congestion cost. Recent advancement in the field of Big Data, AI paved the way to industry revolution 4.0. And, these new technologies creates tremendous changes in the traffic information dissemination. Eventually, accurate and timely traffic information will give a positive impact on decreasing traffic congestion cost. This study, therefore, focused on developing both recurrent and non-recurrent congestion prediction models on urban roads by adopting Recurrent Neural Network(RNN), a tribe in machine learning. Two hidden layers with scaled conjugate gradient backpropagation algorithm were selected, and tested. Result of the analysis driven the authors to 25 meaningful links out of 33 total links that have appropriate mean square errors. Authors concluded that RNN model is a feasible model to predict congestion.