• Title/Summary/Keyword: congestion management

Search Result 498, Processing Time 0.025 seconds

Slective Buffering Macro Handover Which Applies The F-SNOOP in Hierarchical structure (계층 구조에서 F-SNOOP을 적용한 선택적 버퍼링 매크로 핸드오버)

  • Ahn Chi-Hyun;Kim Dong-Hyun;Kim Hyoung-Chul;Ryou Hwang-Bin;Lee Dae-Young;Jun Kye-Suk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.5B
    • /
    • pp.413-420
    • /
    • 2006
  • HMIPv6 is designed to reduce the signaling load to external network and improve handover speed of MN by including Mobility Anchor Point(MAP) in local handover. However in this case of macro handover, it's just used pervious MIPv6 handover algorithm. So, it occurs packet loss and transmission delay problem. In this paper, we propose the mechanism applying the HMIPv6 for Fast Handover to choose suitable to the condition buffering handover. The condition for the selection is result distance measurement between MN and CN, between MN and NAR. Furthermore, using F-SNOOP protocol, it is possible to improve wireless network performance. Wireless network has high Bit Error Rate(BER) characteristic because of path loss, fading, noise and interference. TCP regards such errors as congestion and starts congestion control. This congestion control makes packet transmission rate low. However, F-SNOOP improves TCP performance based on SNOOP and Freeze TCP that use Zero Window Advertisement(ZWA) message when handoff occurs in wireless network.

A Study on the Improvement of Inter-Terminal Transportation Using Buffer Space (완충지역을 활용한 타부두 환적 컨테이너 운송 개선 방안)

  • Park, Hyoung-Jun;Shin, Jae-Young;Choi, Yang-Ho
    • Journal of Navigation and Port Research
    • /
    • v.45 no.6
    • /
    • pp.314-324
    • /
    • 2021
  • Competition between ports around the world is intensifying to attract transshipment cargo. However, recently, there have been concerns about the departure of transshipment cargo volume at Busan Port, such as the lifting of the cabotage policy in China's shipping sector and the implementation of a safe fare system. In terms of operation, terminal congestion and vehicle waiting time are seriously occurring due to imbalance in the transshipment volume of each terminal and vehicles concentrated in a specific time period. In this paper, we propose a method of inter-terminal transportation (ITT) using buffer space to solve the problem caused by inefficient ITT systems and presented a mixed integer programming (MIP) for the problem. The effect of using the buffer space was analyzed for various work volumes and capacity fluctuation ranges by applying the terminal congestion pattern and ITT vehicle in/out pattern based on the Busan New Port data.

A Model for Analyzing Time-Varying Passengers' Crowdedness Degree of Subway Platforms Using Smart Card Data (스마트카드자료를 활용한 지하철 승강장 동적 혼잡도 분석모형)

  • Shin, Seongil;Lee, Sangjun;Lee, Changhun
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.18 no.5
    • /
    • pp.49-63
    • /
    • 2019
  • Crowdedness management at subway platforms is essential to improve services, including the prevention of train delays and ensuring passenger safety. Establishing effective crowdedness mitigation measures for platforms requires accurate estimation of the congestion level. There are temporal and spatial constraints since crowdedness on subway platforms is assessed at certain locations every 1-2 years by hand counting. However, smart cards generate real-time big data 24 hours a day and could be used in estimating congestion. This study proposes a model based on data from transit cards to estimate crowdedness dynamically. Crowdedness was defined as demand, which can be translated into passengers dynamically moving along a subway network. The trajectory of an individual passenger can be identified through this model. Passenger flow that concentrates or disperses at a platform is also calculated every minute. Lastly, the platform congestion level is estimated based on effective waiting areas for each platform structure.

A New Queue Management Algorithm for Congestion Control in Internet Routers (인터넷 라우터의 혼잡제어를 위한 새로운 큐 관리 알고리즘)

  • 구자헌;송병훈;정광수
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2000.10c
    • /
    • pp.490-492
    • /
    • 2000
  • 기존의 인터넷 라우터는 Drop tail 방식으로 패킷을 관리한다. 따라서 네트워크 트래픽의 지수적인 증가로 인한 혼잡 상황으로 발생하는 패킷 손실을 해결할 수 없다. 이 문제를 해결하기 위해 IETF(Internet Engineering Task Force)에서는 RED(Random Early Detection)와 같은 능동적인 큐 관리 알고리즘을 제시하였다. 하지만 RED는 동적으로 변화하는 인터넷 트래픽에 대하여 단지 큐 크기의 변화 정보를 얻어 혼잡 상황을 제어하기 때문에 성능에 있어는 매우 비효율적이다. 본 논문에서는 기존의 RED를 개선한 MRED를 제안했다. MRED는 RED에 비하여 휴리스틱한 방법을 이용하여 폐기 확률 값을 계산하고, 이를 실험을 통하여 MRED의 성능을 검증하였다.

  • PDF

Performance Analysis of ERICA(Expicit Rate Indication Congestion Avoidance)Switch Algorithm for ABR Traffic Management in Satellite ATM Networks (위성 ATM 네트웍의 ABR트래픽 관리를 위한 ERICA스위치 알고리즘 성능분석)

  • 이정렬;김덕년
    • Proceedings of the Korea Institute of Convergence Signal Processing
    • /
    • 2000.08a
    • /
    • pp.9-12
    • /
    • 2000
  • 본 논문에서는 기존의 지상 ATM망의 제어기법을 바탕으로 위성망으로 확대 적용할 수 방안으로 기존의 지상 ATM망의 막힘제어 기법중 ERICA스위치 알고리즘을 적용하였으며, 기존의 ERICA스위치 알고리즘은 지상과 위성간의 긴 전파지연시간을 고려하지 않아 위성내의 막힘을 알려주는 정보가 지구국까지 전달되어 다시 위성에 전달될 때 위성의 막힘 상태변화로 인한 손실이 발생할 수 있다 본 논문에서는 이러한 손실을 피하기 위한 제어구조에 대해서 다루었다.

  • PDF

A Rate-Based Buffer Management Algorithm to Improve TCP Performance over ATM networks (ATM 네트워크에서 TCP 성능향상을 위한 평균 전송율 기반의 버퍼관리 알고리즘)

  • 김관웅;이창기
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.2B
    • /
    • pp.263-271
    • /
    • 2004
  • In this paper, we proposed a new buffer management algorithm using perVC-Queuing discipline. Proposed algorithm uses service rate estimation and assigns dynamic perVC threshold to each VCs. Service rate estimation and dynamic perVC threshold combined with global threshold provide nearly optimal throughput and improve fairness performance of network resource among GFR VCs as well as guarantee MCR of all VCs. From simulation results, we demonstrate the proposed scheme fulfills the requirement of GFR service as well as improves the TCP throughput.

Performance Analysis of Call Admission Control Utilizing WLAN to Mitigate Congestion of Cellular Networks (WLAN을 이용한 셀룰러망 혼잡도 완화를 위한 호수락제어 성능 분석)

  • Seok, Woo-Jin;Hwang, Young-Ha;Noh, Sung-Kee;Kim, Sang-Ha
    • Journal of KIISE:Information Networking
    • /
    • v.35 no.5
    • /
    • pp.425-436
    • /
    • 2008
  • In this paper, we propose a resource effective call admission control(CAC) in integrated WLAN and cellular network. The proposed CAC mitigates the congestion of cellular network by handing over non-realtime traffic to WLAN. We analyze the proposed CAC in numerical and simulation method. The simulation results show that the proposed CAC achieves better performance than normal CAC. Especially, the proposed CAC can sustain desired QoS more robustly against high incoming non-realtime traffic load than againt realtime traffic load.

Technique for Estimating the Number of Active Flows in High-Speed Networks

  • Yi, Sung-Won;Deng, Xidong;Kesidis, George;Das, Chita R.
    • ETRI Journal
    • /
    • v.30 no.2
    • /
    • pp.194-204
    • /
    • 2008
  • The online collection of coarse-grained traffic information, such as the total number of flows, is gaining in importance due to a wide range of applications, such as congestion control and network security. In this paper, we focus on an active queue management scheme called SRED since it estimates the number of active flows and uses the quantity to indicate the level of congestion. However, SRED has several limitations, such as instability in estimating the number of active flows and underestimation of active flows in the presence of non-responsive traffic. We present a Markov model to examine the capability of SRED in estimating the number of flows. We show how the SRED cache hit rate can be used to quantify the number of active flows. We then propose a modified SRED scheme, called hash-based two-level caching (HaTCh), which uses hashing and a two-level caching mechanism to accurately estimate the number of active flows under various workloads. Simulation results indicate that the proposed scheme provides a more accurate estimation of the number of active flows than SRED, stabilizes the estimation with respect to workload fluctuations, and prevents performance degradation by efficiently isolating non-responsive flows.

  • PDF

Effects of Extending Duration of Nighttime Road Construction (도로품질 향상을 위한 야간 도로공사 시간확대의 영향분석)

  • Lee, Dongmin;Choi, Junseong;Park, Jejin;Park, Yongjin
    • International Journal of Highway Engineering
    • /
    • v.19 no.5
    • /
    • pp.153-162
    • /
    • 2017
  • PURPOSES : This study was conducted to analyze the effects arising from extending the duration of nighttime road construction on improving road quality and durability. METHODS : Most previous studies estimating the social cost of various construction conditions did not consider road pavement cooling time as a factor in improving road pavement quality. This study investigated the feasibility of achieving higher road quality and durability by extending the duration of nighttime road construction time extension. For this investigation, the effects of such an extension on traffic conditions were analyzed based on micro-simulation studies and scenario-based cost-benefit analyses, using factors including traffic volume, delay, construction cost, and road pavement cooling time. RESULTS : The results of the traffic simulation studies and cost-benefit analyses indicate that the current road construction method that emphasizes completing nighttime road construction by 6 a.m. reduces pavement life while causing relatively little traffic delay. If the night construction time is instead extended to 2 p.m., road pavement lifetime is increased, reducing road re-construction cost. These savings are greater than the cost of congestion arising from extending the duration of nighttime construction. CONCLUSIONS : The current nighttime construction durations need to be extended in order to efficiently manage roads and reduce road management costs.

Load Balancing for Zone Routing Protocol to Support QoS in Ad Hoc Network

  • Chimmanee, Sanon;Wipusitwarakun, Komwut;Runggeratigul, Suwan
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1685-1688
    • /
    • 2002
  • Application Routing Load Balancing (ARLB) is a novel load balancing mode that combines QoS routing and load balancing in per application to support QoS far real-time application based on wired network. Zone Routing Protocol (ZRP) is a recent hybrid proactive/reactive routing approach in an attempt to achieve scalability of ad-hoc network. This routing approach has the potential to be efficient in the generation of control traffic than traditional routing schemes. Up to now, without proper load balancing tools, the ZRP can actually guarantee QoS for delay-sensitive applications when congestion occurred in ad-hoc network. In this paper, we propose the ARLB to improve QoS fur delay-sensitive applications based on ZRP in ad-hoc network when congestion occurred and to be forwarding mechanism fur route coupling to support QoS for real-time applications. The critical point is that the routing metric of ARLB is originally designed for wired network environment. Therefore, we study and present an appropriate metric or cost computation routing of ARLB for recently proposed ZRP over ad-hoc network environment.

  • PDF