• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.6
• /
• pp.1953-1972
• /
• 2022

The COVID-19 pandemic has resulted in a profound impact on large-scale gatherings throughout the world. Social distancing has become one of the most common measures to restrict the spread of the novel Coronavirus. Islamic pilgrimage attracts millions of pilgrims to Saudi Arabia annually. One of the mandatory rituals of pilgrimage is the symbolic stoning of the devil. Every pilgrim is required to perform this ritual within a specified time on three days of pilgrimage. This ritual is prone to congestion due to strict spatiotemporal requirements. We propose a pedestrian simulation model for implementing social distancing in the stoning ritual. An agent-based simulation is designed to analyze the impact of inter-queue and intra-queue spacing between adjacent pilgrims on the throughput and congestion during the stoning ritual. After analyzing several combinations of intra-queue and inter-queue spacings, we conclude that 25 queues with 1.5 meters of intra-queue spacing result in an optimal combination of throughput and congestion. The Ministry of Hajj in Saudi Arabia may benefit from these findings to manage and plan pilgrimage more effectively.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06d
• /
• pp.401-403
• /
• 2012

In this paper, we introduce a multipath congestion control algorithm for audio/video streaming, called MPSQRT. MPSQRT is derived from single-path Square-Root TCP (SQRT TCP) designed for multimedia streaming, where a lower variation of sending rate is important. Based on the fluid model of SQRT for single-path, we extend it towards spreading concurrently packets across multiple paths ensuring load-balancing and fairness to SQRT at shared bottleneck. Through simulations, we evaluate the proposed protocol under various network conditions.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1359-1362
• /
• 2004

유무선 통합 환경에서의 기존의 TCP가 가지는 문제점은 혼잡 제어 알고리즘이 무선환경의 에러를 모두 congestion으로 인식하는 것에 있다. 무선환경에 의한 에러일 경우 네트워크의 상황이 좋음에도 불구하고 전송률을 낮춰서 네트워크의 성능을 떨어뜨리게 된다. 따라서 본 논문에서는 Link-layer가 발생시킨 이벤트를 통해 에러의 원인을 명확이 구분하여 기존의 TCP의 큰 수정이 없이도 성능을 크게 향상 시킬 수 있는 혼잡 제어 알고리즘을 제안한다.

• Journal of Communications and Networks
• /
• v.12 no.5
• /
• pp.499-509
• /
• 2010

A plethora of transmission control protocol (TCP) congestion control algorithms have been devoted to achieving the ultimate goal of high link utilization and fair bandwidth sharing in high bandwidth-delay product (HBDP) networks. We present a new insight into the TCP congestion control problem; in particular an end-to-end delay-based approach for an HBDP network. Our main focus is to design an end-to-end mechanism that can achieve the goal without the assistance of any network feedback. Without a router's aid in notifying the network load factor of a bottleneck link, we utilize goodput and throughput values in order to estimate the load factor. The obtained load factor affects the congestion window adjustment. The new protocol, which is called TCP-goodput and throughput (GT), adopts the carefully designed inversely-proportional increase multiplicative decrease window control policy. Our protocol is stable and efficient regardless of the link capacity, the number of flows, and the round-trip delay. Simulation results show that TCP-GT achieves high utilization, good fairness, small standing queue size, and no packet loss in an HBDP environment.

• The KIPS Transactions:PartC
• /
• v.10C no.1
• /
• pp.39-44
• /
• 2003

The network performance gets down during congestion periods to solve the problem effectively. A RED(Random Earl Detection) algorithm of the queue management algorithm is proposed and IETF recommends it as a queue management. A RED algorithm controls a congestion aspect dynamically. In analyzing parameters when static value of parameter is set in the gateway cannot be handled the status of current network traffic properly We propose the Effective RED algorithm to solve with the weakness of RED In this algorithm the maximum drop probability decides to accept or drop the interning packets, is adjusted dynamically on the current queue state for controlling the congestion phase effectively in the gateway. This algorithm is confirmed by computer simulation using the NS(Network Simulator)-2.

• Journal of Internet Computing and Services
• /
• v.18 no.6
• /
• pp.65-73
• /
• 2017

Congestion occurring at wireless sensor networks(WSNs) causes packet delay and packet drop, which directly affects overall QoS(Quality of Service) parameters of network. Network congestion is critical when important data is to be transmitted through network. Thus, it is significantly important to effectively control the congestion. In this paper, new mechanism to guarantee reliable transmission for the important data is proposed by considering the importance of packet, configuring packet priority and utilizing the settings in routing process. Using this mechanism, network condition can be maintained without congestion in a way of making packet routed through various routes. Additionally, congestion control using packet service time, packet inter-arrival time and buffer utilization enables to reduce packet delay and prevent packet drop. Performance for the proposed mechanism was evaluated by simulation. The simulation results indicate that the proposed mechanism results to reduction of packet delay and produces positive influence in terms of packet loss rate and network lifetime. It implies that the proposed mechanism contributes to maintaining the network condition to be efficient.

• 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 Institute of Convergence Signal Processing
• /
• v.8 no.1
• /
• pp.39-43
• /
• 2007

In high speed communication networks, the determination of a transmission rate is critical for the stability of a closed-loop network system with the congestion control scheme. In ATM networks, the available bit rate (ABR) service is based on a feedback mechanism, i.e., the network status is transferred to the ABR source by a resource management (RM) cell. RM cells contain the traffic information of the downstream nodes for the traffic rate control. However, the traffic status of the downstream nodes can not be directly transferred to the source node in the IP based networks. In this paper, a new rate-based congestion control scheme using an exponential weighted moving average algorithm is proposed to build an efficient feedback control law for congestion avoidance in high speed communication networks. The proposed congestion control scheme assures the stability of switch buffers and higher link utilization of the network. Moreover, we note that the proposed congestion scheme can flexibly work along with the increasing number of input sources in the network, which results in an improved scalability.

• Journal of KIISE
• /
• v.42 no.12
• /
• pp.1600-1610
• /
• 2015

While today's networks have been shown to exhibit HBDP (High Bandwidth Delay Product) characteristics, the legacy TCP increases the size of the congestion window slowly and decreases the size of the congestion window drastically such that it is not suitable for HBDP Networks. In order to solve this problem with the legacy TCP, many congestion control TCP mechanisms have been proposed. C-TCP (Compound-TCP) is a hybrid TCP which is a synergy of delay-based and loss-based approaches. C-TCP adapts the decreasing rate of the delay window without considering the congestion level, leading to degradation of performance. In this paper, we propose a new scheme to improve the performance of C-TCP. By controlling the increasing and decreasing rates according to the congestion level of the network, our proposed scheme can improve the bandwidth occupancy and fairness of C-TCP. Through performance evaluation, we show that our proposed scheme offers better performance in HBDP networks as compared to the legacy C-TCP.

• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.58-67
• /
• 2000

The paper presents a representative-based feedback mechanism and rate adaptation policy for congestion control in multicast traffic for multimedia applications. In multicast congestion control, feedback implosion occurs as many receivers send feedback to a sender. We propose to use representatives to avoid the feedback implosion. In our scheme, receivers feedback packet loss information periodically and a sender adapts the sending rate based on the information collected through a hierarchy of representatives. A representative is selected in each region and roles as a filter to decrease the number of feedbacks. The simulation results show that the proposed scheme solves the feedback implosion problem and well adapts in a congested situation.