• Title/Summary/Keyword: network congestion

Search Result 913, Processing Time 0.026 seconds

A User Equilibrium Transit Assignment Model with Vehicle Capacity Constraint (차량용량을 고려한 대중교통 통행배정모형구축에 관한 연구)

  • 이성모;유경상;전경수
    • Journal of Korean Society of Transportation
    • /
    • v.14 no.3
    • /
    • pp.27-44
    • /
    • 1996
  • The purpose of the thesis is providing a new formulation for the transit assignment problem. The existing models dealing with the transit assignment problem don't consider the congestion effects due to the insufficient capacity of transit vehicles. Besides, these models don't provide solutions satisfying the Wardrop's user equilibrium conditions. The congestion effects are considered to be concentrated at the transit stops. For the transit lines, the waiting times at the transit stops are dependent on the passenger flows. The new model suggests the route section cost function analogous to the link performance function of the auto assignment to reflect the congestion effects in congested transit network. With the asymmetric cost function, the variational inequality programming is used to obtain the solutions satisfying Wardrop's condition. The diagonalization algorithm is introduced to solve this model. Finally, the results are compared with those of EMME/2.

  • PDF

TCP Performance Improvement Using Cross-Layer Design in MANET Environments (MANET 환경에서 크로스레이어 디자인을 이용한 TCP 성능 개선에 관한 연구)

  • Nam, Ho-Seok;Lee, Tae-Hoon;Do, Jae-Hwan;Kim, Jun-Nyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.9B
    • /
    • pp.767-774
    • /
    • 2008
  • With the development of ubiquitous sensor networks, the need for communication among mobile nodes has been increased. When the existing TCP is applied to MANET, link failure, route change and network partition make TCP recognize congestion. As a result, TCP shows a poor performance. In this paper, using cross-layer design a new TCP congestion control algorithm that is suitable for MANET is designed and analyzed with ns2.

DCAR: Dynamic Congestion Aware Routing Protocol in Mobile Ad Hoc Networks

  • Kim, Young-Duk;Lee, Sang-Heon;Lee, Dong-Ha
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.1 no.1
    • /
    • pp.8-13
    • /
    • 2006
  • In mobile ad hoc networks, most of on demand routing protocols such as DSR and AODV do not deal with traffic load during the route discovery procedure. To achieve load balancing in networks, many protocols have been proposed. However, existing load balancing schemes do not consider the remaining available buffer size of the interface queue, which still results in buffer overflows by congestion in a certain node which has the least available buffer size in the route. To solve this problem, we propose a load balancing protocol called Dynamic Congestion Aware Routing Protocol (DCAR) which monitors the remaining buffer length of all nodes in routes and excludes a certain congested node during the route discovery procedure. We also propose two buffer threshold values to select an optimal route selection metric between the traffic load and the minimum hop count. Through simulation study, we compare DCAR with other on demand routing protocols and show that the proposed protocol is more efficient when a network is heavily loaded.

  • PDF

Robust $H_{\infty}$ State Feed back Congestion Contro1 of ATM for lineardiscrete-time systems with Uncertain Time-Variant Delav (시간지연을 고려한 ATM 망에서의 체증제어를 위한 $H_{\infty}$ 제어기 설계)

  • Kang, Lae-Chung;Jung, Woo-Chae;Kim, Young-Joong;Lim, Myo-Taeg
    • Proceedings of the KIEE Conference
    • /
    • 2004.07d
    • /
    • pp.2161-2163
    • /
    • 2004
  • This paper focuses on congestion control for ATM network with uncertain time-variant delays. The time-variant delays can be distinguished into two distinct components. The first one that is represented by time-variant queueing delays in the intermediate switches is occurred in the return paths of RM cells. The next one is a forward path delay. It is solved by the VBR Model which quantifies the data propagation from the sources to the switch. Robust $H_{\infty}$ control is studied for solving congestion problem with norm-bounded time-varying uncertain parameters. The suitable robust $H_{\infty}$ controller is obtained from the solution of a convex optimization problem including terms of LMIs.

  • PDF

Congestion Control in ATM Networks Using Mixed-LQR

  • Song, Hae-Seok;Seo, Young-Bong;Choi, Jae-Weon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.57.1-57
    • /
    • 2001
  • The objectives of congestion control in ATM (Asynchronous Transfer Mode) networks are maximum utilization of network resources, acceptable level of low cell loss and fairness among all VCs (Virtual Connections). In this paper, we present a congestion control algorithm which is based on state space model, The proposed controller uses optimal control algorithms (LQR, Mixed-LQR), where control parameters can be designed to ensure the stability of the control loop in a control theoretic sense, over the propagation delay. We show how the control mechanism can be used to design a controller to support ABR service based on feedback of explicit rates. Simulation results are presented to substantiate our claim.

  • PDF

Queue Management using Optimal Margin method to Improve Bottleneck Link Performance

  • Radwa, Amr
    • Journal of Korea Multimedia Society
    • /
    • v.18 no.12
    • /
    • pp.1475-1482
    • /
    • 2015
  • In network routers, buffers are used to resolve congestion and reduce packet loss rate whenever congestion occurs at bottleneck link. Most of the existing methods to manage such buffers focus only on queue-length-based control as one loop which have some issues of low link utilization and system stability. In this paper, we propose a novel framework which exploits two-loop control method, e.g. queue-length and congestion window size, combined with optimal margin method to facilitate parameter choices. Simulation results in ns-2 demonstrate that bottleneck link performance can be improved with higher link utilization (85%) and shorter queue length (22%) than the current deployed scheme in commercial routers (RED and DropTail).

An Assessment of Local Market Power and Bid Cap Under Uniform Pricing Scheme (Uniform Pricing하에서의 지역적 완화방안으로서의 Bid Cap)

  • 신영균;김발호;전영환
    • The Transactions of the Korean Institute of Electrical Engineers A
    • /
    • v.52 no.10
    • /
    • pp.610-615
    • /
    • 2003
  • With the growing competitive pressure from market participants, utilities, consumer and government, analyses of existing competitive electricity market become more important. The presence of congestion in the transmission system can significantly increase the potential of exercising market power. Since the congestion in the network depends on the several factors, the market power cannot be simply analyzed through the existing indices. This paper presents a systematic analysis on local market power under uniform pricing scheme and provides determining approach of the level of price cap as mitigation measure of the strategic market power.

A Simulation Study on the Marine Traffic Congestion in Pusan Port (부산항 해상교통 혼잡도 평가에 관한 연구)

  • 여기태;이홍걸
    • Journal of Korean Port Research
    • /
    • v.12 no.2
    • /
    • pp.177-194
    • /
    • 1998
  • In Pusan port, the studies which analyze container cargo volumes by using forecasting methods and research about container logistics system, etc., have been continuously carried out. But, in Pusan port, the study on an evaluation of traffic congestion has been scarcely performed until now. Especially, when changing and extending a berth, or constructing a new port, it is very important to examine this field. And it should be considered. Thus, this paper aims to analyze the effect of ship traffic condition in the year 2011, to evaluate marine traffic congestion according to changing ship traffic volumes in Pusan port. To analyze it, we examined the results by simulation method.

  • PDF

Improving the TCP Retransmission Timer Adjustment Mechanism for Constrained IoT Networks

  • Chansook Lim
    • International Journal of Internet, Broadcasting and Communication
    • /
    • v.16 no.1
    • /
    • pp.29-35
    • /
    • 2024
  • TCP is considered as one of the major candidate transport protocols even for constrained IoT networks..In our previous work, we investigated the congestion control mechanism of the uIP TCP. Since the uIP TCP sets the window size to one segment by default, managing the retransmission timer is the primary approach to congestion control. However, the original uIP TCP sets the retransmission timer based on the fixed RTO, it performs poorly when a radio duty cycling mechanism is enabled and the hidden terminal problem is severe. In our previous work, we proposed a TCP retransmission timer adjustment scheme for uIP TCP which adopts the notion of weak RTT estimation of CoCoA, exponential backoffs with variable limits, and dithering. Although our previous work showed that the proposed retransmission timer adjustment scheme can improve performance, we observe that the scheme often causes a node to set the retransmission timer for an excessively too long time period. In this work, we show that slightly modifying the dithering mechanism of the previous scheme is effective for improving TCP fairness.

Transmission Rate-Based Overhead Monitoring for Multimedia Streaming Optimization in Wireless Networks (무선 네트워크상에서 멀티미디어 스트리밍 최적화를 위한 전송율 기반의 오버헤드 모니터링)

  • Lee, Chong-Deuk
    • Journal of Advanced Navigation Technology
    • /
    • v.14 no.3
    • /
    • pp.358-366
    • /
    • 2010
  • In the wireless network the congestion and delay occurs mainly when there are too many packets for the network to process or the sender transmits more packets than the receiver can accept. The congestion and delay is the reason of packet loss which degrades the performance of multimedia streaming. This paper proposes a novel transmission rate monitoring-based optimization mechanism to optimize packet loss and to improve QoS. The proposed scheme is based on the trade-off relationship between transmission rate monitoring and overhead monitoring. For this purpose this paper processes a source rate control-based optimization which optimizes congestion and delay. Performance evaluated RED, TFRC, and the proposed mechanism. The simulation results show that the proposed mechanism is more efficient than REC(Random Early Detection) mechanism and TFRC(TCP-friendly Rate Control) mechanism in packet loss rate, throughput rate, and average response rate.