• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.1
• /
• pp.139-145
• /
• 2016

Dumbbell is the most basic topology that can be used in almost all kind of network experiment within it or just by little expansion. While Transmission Control Protocol TCP is the basic protocol that is used for the connectivity among networks and stations. TCP major and basic goal is to provide path and services to different applications for communication. For that reason TCP has to transfer a lot of data through a communication medium that cause serious congestion problem. To calculate the congestion problem, different kind of pre-cure solutions are developer which are Loss Based Variant and Delay Based Variant. While LBV keep track of the data that is going to be passed through TCP protocol, if the data packets start dropping that means congestion occurrence which notify as a symptom, TCP CUBIC use LBV for notifying the loss. Similarly the DBV work with the acknowledgment procedure that is used in when data ACK get late with respect to its set data rate time, TCP COMPOUND/VAGAS are examples of DBV. Many algorithms have been purposed to control the congestion in different TCP variants but the loss of data packets did not completely controlled. In this paper, the congestion control algorithms are implemented and corresponding results are analyzed in Dumbbell topology, it is typically used to analyze the TCP traffic flows. Fairness of throughput is evaluated for different TCP variants using network simulator (NS-2).

• 전자공학회논문지 IE
• /
• v.43 no.3
• /
• pp.41-48
• /
• 2006

In this paper, we propose a new active queue management (AQM) scheme by utilizing the predictability of the Internet traffic. The proposed scheme predicts future traffic input rate by using the auto-regressive (AR) time series model and determines the future congestion level by comparing the predicted input rate with the service rate. If the congestion is expected, the packet drop probability is dynamically adjusted to avoid the anticipated congestion level. Unlike the previous AQM schemes which use the queue length variation as the congestion measure, the proposed scheme uses the variation of the traffic input rate as the congestion measure. By predicting the network congestion level, the proposed scheme can adapt more rapidly to the changing network condition and stabilize the average queue length and its variation even if the traffic input level varies widely. Through ns-2 simulation study in varying network environments, we compare the performance among RED, Adaptive RED (ARED), REM, Predicted AQM (PAQM) and the proposed scheme in terms of average queue length and packet drop rate, and show that the proposed scheme is more adaptive to the varying network conditions and has shorter response time.

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

This study proposes a new polling algorithm allowing dynamic change in polling period based on line utilization prediction. Polling is the most important function in network monitoring, but excessive polling data causes rather serious congestion conditions of network when network is In congestion. Therefore, existing multiple polling algorithms decided network congestion or load of agent with previously performed polling Round Trip Time or line utilization, chanced polling period, and controlled polling traffic. But, this algorithm is to change the polling period based on the previous polling and does not reflect network conditions in the current time to be polled. A algorithm proposed in this study is to predict whether polling traffic exceeds threshold of line utilization on polling path based on the past data and to change the polling period with the prediction. In this study, utilization of each line configuring network was predicted with AR model and violation of threshold was presented in probability. In addition, suitability was evaluated by applying the proposed dynamic polling algorithm based on line utilization prediction to the actual network, reasonable level of threshold for line utilization and the violation probability of threshold were decided by experiment. Performance of this algorithm was maximized with these processes.

• Journal of Korean Society of Transportation
• /
• v.31 no.3
• /
• pp.74-85
• /
• 2013

We analyze the efficiency of congestion pricings and transit subsidies in the spatial micro-economic model based on a general equilibrium environment. In this setting, we decompose the total welfare change into component factors and identify the reason of the change in the efficiency caused by policy instruments; these component factors are divided into indirect factors and direct factors including of origin-destination and mode choices. We set up the model as adding mode choice to the standard format in the fashion of Anas and Kim (1996) and extend the methodology proposed by Yu and Rhee (2011) and Rhee (2012) for deriving theoretical and analytical solution. Most of welfare gain comes from the modal shift from car to bus. The relative efficiency of subsidies in relation to the first-best pricing is lower than it of congestion pricings although the change in bus share by subsidies is similar to it by congestion pricing. Subsidies give rise to more modal shift from a car to a bus for long-distance commuting than it caused by congestion pricings. As the increase of bus share for long-distance commuting leads to the increase of cross-commuters passing through CBD, the welfare gain by subsidies is lower than it by congestion pricings.

• Journal of KIISE:Information Networking
• /
• v.30 no.5
• /
• pp.656-667
• /
• 2003

Congestion control is a key task in reliable multicast along with error control. However, existing tree-based congestion control schemes such as MTCP and TRAMCC are designed for one-to-many reliable multicast and have some drawbacks when they are used for many-to-many reliable multicast. We propose an efficient congestion control mechanism, TMRCC, for tree-based many-to-many reliable multicast protocols. The proposed scheme is based on the congestion windowing mechanism and a rate controller is used in addition. The feedback for error recovery is exploited for congestion control as well to minimize the overhead at the receivers. The ACK timer and the NACK timers are set dynamically reflecting the network condition changes. The rate regulation algorithm in the proposed scheme is designed to help the flows sharing the same link to achieve the fair share quickly The performance of the proposed scheme is evaluated using ns-2. The simulation results show that the proposed scheme outperforms TRAMCC in terms of intra- session fairness and shows good level of responsiveness, TCP-friendliness, and scalability. In addition, we implemented the proposed scheme by integrating with GAM that is one of many-to-many reliable multicast protocols and evaluated the performance in a laboratory-wide testbed.

• Journal of the Korean Society of Marine Environment & Safety
• /
• v.25 no.5
• /
• pp.527-534
• /
• 2019

Several types of mathematical analysis methods are used for port waterway risk assessment based on marine traffic volume. In Korea, a marine traffic congestion model that standardizes the size of the vessels passing through the port waterway is applied to evaluate the risk of the waterway. For example, when marine traffic congestion is high, risk situations such as collisions are likely to occur. However, a scientific review is required to determine if there is a correlation between high density of maritime traffic and a high risk of waterway incidents. In this study, IWRAP Mk2(IALA official recommendation evaluation model) and a marine traffic congestion model were used to analyze the correlation between port waterway risk and marine traffic congestion in the same area. As a result, the linear function of R2 was calculated as 0.943 and it was determined to be significant. The Pearson correlation coefficient was calculated as 0.971, indicating a strong positive correlation. It was confirmed that the port waterway risk and the marine traffic congestion have a strong correlation due to the influence of the common input variables of each model. It is expected that these results will be used in the development of advanced models for the prediction of port waterway risk assessment.

• Journal of Korea Society of Industrial Information Systems
• /
• v.27 no.5
• /
• pp.13-24
• /
• 2022

SNS has become a very close service to our daily life. As marketing is done through SNS, places often called hot places are created, and users are flocking to these places. However, it is often crowded with a large number of people in a short period of time, resulting in a negative experience for both visitors and service providers. In order to improve this problem, it is necessary to recognize the congestion level, but the method to determine the congestion level in a specific area at an individual level is very limited. Therefore, in this study, we tried to propose a system that can identify the congestion level information and the characteristics of visitors to a specific tourist destination by using the data on the SNS. For this purpose, posting data uploaded by users and image analysis were used, and the performance of the proposed system was verified using the Naver DataLab system. As a result of comparative verification by selecting three places by type of tourist destination, the results calculated in this study and the congestion level provided by DataLab were found to be similar. In particular, this study is meaningful in that it provides a degree of congestion based on real data of users that is not dependent on a specific company or service.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.4
• /
• pp.83-91
• /
• 2023

In this paper, we propose a robustness sensitivity index (RSI) of highway networks to analyze the effect of congestion in a specific section on the entire highway. The newly proposed RSI is defined as the change in the total mileage of the transportation network per extended unit length when the length of a particular section is extended. When the RSI value is large, traffic congestion in the section has a worse effect on the entire network than in other sections. The existing network robustness index (NRI) simply observes changes in transportation networks with and without specific sections, but the RSI proposed in this study is a kind of performance indicator that allows quantitative analysis of the ripple effect of the entire network according to the degree of congestion in a specific section. While changing the degree of congestion in a particular section, it is possible to calculate how the traffic volume increases, decreases, and the size and location of the congestion section change. This analysis proves the superiority of RSI as it cannot be analyzed with NRI. Various properties of RSI are analyzed using data from the domestic highway network. In addition, using the RSI concept, it is shown that the ripple effect on other sections in which a change in the degree of congestion of a specific section occurs can be analyzed.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.11
• /
• pp.3097-3107
• /
• 1999

Recently many studies have been done on the Random Early Detection(RED) algorithm as an active queue management and congestion avoidance scheme in the Internet. In this paper we first overview the characteristics of RED and the modified RED algorithms in order to understand the current status of these studies. Then we analyze the RED dynamics by investigating how RED parameters affect router queue behavior. We show the cases when RED fails since it cannot react to queue state changes aggressively due to the deterministic use of its parameters. Based on the RED parameter analysis, we propose a self-adaptive algorithm to cope with this RED weakness. In this algorithm we make two parameters be adjusted themselves depending on the queue states. One parameter is the maximum probability to drop or mark the packet at the congestion state. This parameter can be adjusted to react the long burst of traffic, consequently reducing the congestion disaster. The other parameter is the queue weight which is also adjusted aggressively in order for the average queue size to catch up with the current queue size when the queue moves from the congestion state to the stable state.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.37 no.10
• /
• pp.18-25
• /
• 2000

In this paper, we analyze TCP congestion control algorithm over ATM-UBR network. TCP congestion control algorithm consists of slow start, congestion avoidance, fast recovery, fast retransmit. We analyze the ATM-UBR network service using the BSD 4.3 TCP Reno, Vanilla. However we found the fact that the characteristic of fast retransmit, recovery algorithm makes a serious degradation of Performance in multiple losses of packets. We propose new fast retransmit, recovery algorithm to improve the problem. The results of performance analysis improve the multiple losses of packets using a proposed fast retransmit, recovery algorithm.