• Title/Summary/Keyword: Delay and Congestion Speed

Search Result 55, Processing Time 0.025 seconds

Constructing the Models Estimated for Speed Variation on the Merge Section in the Freeway (고속도로의 합류구간내 속도변화 추정모형 구축에 관한 연구)

  • 신광식;김태곤
    • Journal of Korean Port Research
    • /
    • v.13 no.1
    • /
    • pp.113-122
    • /
    • 1999
  • Congestion and traffic accidents occur on the merge and diverge sections in the interchange of the freeway. Studies have been conducted to reduce the traffic delay and accidents on the merge section in the freeway since 1960s. but a study was not conducted to estimate the speed variation on the merge section construct models estimated for the speed variation and suggest the appropriate measures. The purpose of this study was to identify the traffic flow characteristics on the merge section in the freeway construct the models estimated for the speed variation on the merge section in the freeway and finally establish the appropriate measure for reduction of traffic delay and accidents on the merge section in the freeway. The following results were obtained: I) Speed variations in the urban freeway appeared to be about 3.2mph, 6.5mph and 7.4mph based on the morning peak period, afternoon peak period and 24-hours period but those in the suburban freeway appeared to be about 8.0mph, 11.1mph and 10.1mph based on the same periods respectively. So different speed reduction signs need be installed to reduce delay and accidents on the merge section in the freeway based on the areas and periods as the freeway traffic management system(FTMS). ii) These models estimated for speed variation need to be studied with the changeable message sign(CMS) technique based on the real-time data so that the traffic flow could be maximized and the traffic delay and accidents be on the merge section in the freeway as more efficient freeway traffic management system(FTMS) in the near future.

  • PDF

OFEX Controller to Improve Queueing and User Performance in Multi-bottleneck Networks

  • Liu, Jungang;Yang, Oliver W.W.
    • ETRI Journal
    • /
    • v.36 no.3
    • /
    • pp.396-406
    • /
    • 2014
  • We have designed and investigated a new congestion control scheme, called optimal and fully explicit (OFEX) controller. Different from existing relatively explicit controllers, this new scheme can provide not only optimal bandwidth allocation but also a fully explicit congestion signal to sources. It uses the congestion signal from the most congested link instead of the cumulative signal from the flow path. In this way, it overcomes the drawback of relatively explicit controllers exhibiting bias toward multi-bottlenecked users and significantly improves their convergence speed and source throughput performance. Furthermore, our OFEX-controller design considers a dynamic model by proposing a remedial measure against the unpredictable bandwidth changes in contention-based multi-access networks. Compared with former works/controllers, this remedy also effectively reduces the instantaneous queue size in a router and thus significantly improves queuing delay and packet loss performance. We have evaluated the effectiveness of the OFEX controller in OPNET. The experimental comparison with the existing relatively explicit controllers verifies the superiority of our new scheme.

Adaptive routing algorithm for equitable load balancing with propagation delay (전송지연을 적용한 적응균등부하조절 경로설정 알고리듬)

  • 주만식;백이현;주판유;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.22 no.12
    • /
    • pp.2635-2643
    • /
    • 1997
  • In this paepr, a routing algorithm is proposed in order to reduce average end-to-end delay and congesting in the high speed network. The algorithm proposed here uses the existing one which adaptively modifies routes and the amount of traffic allocated to each link as user traffic partterns flutuate. This algorithm is ELB(Equitable Load Balancing). Also, the new algorithm considers the proportional to the distance between source and destination. It reduces congestion from the ELB and average end-to-end delay from the propagation dealy concepts respectively. Through the simulation, it shows that the algorithm proposed here reduces average end-to-end delay over low load to high load, and it also guarantees the congestion control.

  • PDF

Congestion Control in ATM Using MPC (MPC를 이용한 ATM망의 혼잡 제어)

  • Han, Sung-Hee;Yoon, Tae-Woong
    • Proceedings of the KIEE Conference
    • /
    • 2002.11c
    • /
    • pp.35-38
    • /
    • 2002
  • In this paper, the design of explicit rate-based congestion control in high speed communication networks is considered. The goal of congestion control is to achieve high link utilization, low packet loss, low delay, and fairness among the best-effort sources. To deal with the propagation delays associated with the best effort sources, An MPC technique is employed to solve the congestion problem[1] here. However, the problem with this method is that the closed loop performance relies highly on the knowledge of average service rate. This paper focuses on coping with the problem described above by using a CARIMA model for service rate(available rate).

  • PDF

Highway Ramp Metering Technique for Solving Non-Recurrent Congestion according to Incident (돌발상황에 따른 비 반복정체를 해소하기 위한 고속도로 램프미터링 기법)

  • Kang, Won-Mo;Lee, Sang-Yong
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.2
    • /
    • pp.186-191
    • /
    • 2011
  • Ramp metering has been used to solve recurrent or non-recurrent congestion on many highways. However, the existing ramp metering methods cannot control non-recurrent congestion like incident and don't have any methods to solve congestion after congestion. In addition, the methods cannot solve congestion quickly because ramp metering operates independently for each ramp. In this study, we developed SARAM which is ramp metering technique with shockwave theory in order to solve the problems. In simulation from Jangsoo IC to Joongdong IC, we confirmed that speed increased by 7.32km/h and delay time reduced by 39.14sec.

Construction of Delay Predictine Models on Freeway Ramp Junctions with 70mph Speed Limit (70mph 제한속도를 갖는 고속도로 진출입램프 접속부상의 지체예측모형 구축에 관한 연구)

  • 김정훈;김태곤
    • Proceedings of the Korean Institute of Navigation and Port Research Conference
    • /
    • 1999.10a
    • /
    • pp.131-140
    • /
    • 1999
  • Today freeway is experiencing a severe congestion with incoming or outgoing traffic through freeway ramps during the peak periods. Thus, the objectives of this study is to identify the traffic characteristics, analyze the relationships between the traffic characteristics and finally construct the delay predictive models on the ramp junctions of freeway with 70mph speed limit. From the traffic analyses, and model constructions and verifications for delay prediction on the ramp junctions of freeway, the following results were obtained: ⅰ) Traffic flow showed a big difference depending on the time periods. Especially, more traffic flows were concentrated on the freeway junctions in the morning peak period when compared with the afternoon peak period. ⅱ) The occupancy also showed a big difference depending on the time periods, and the downstream occupancy(Od) was especially shown to have a higher explanatory power for the delay predictive model construction on the ramp junction of freeway. ⅲ) The speed-occupancy curve showed a remarkable shift based on the occupancies observed ; Od < 9% and Od$\geq$9%. Especially, volume and occupancy were shown to be highly explanatory for delay prediction on the ramp junctions of freeway under Od$\geq$9%, but lowly for delay predicion on the ramp junctions of freeway under Od<9%. Rather, the driver characteristics or transportation conditions around the freeway were through to be a little higher explanatory for the delay perdiction under Od<9%. ⅳ) Integrated delay predictive models showed a higher explanatory power in the morning peak period, but a lower explanatory power in the non-peak periods.

Comparison between Congestion Levels and Amount of $CO_2$ Emissions on Arterials (단속류 간선도로에서 지정체와 $CO_2$ 배출량 비교)

  • Gang, Jin-Gu;O, Heung-Un
    • Journal of Korean Society of Transportation
    • /
    • v.29 no.6
    • /
    • pp.17-23
    • /
    • 2011
  • It has been presumed that the amount of vehicle's $CO_2$ emission would highly related to vehicle's cruising speeds on highways. In this study, it was tested if vehicle's $CO_2$ emissions would relate to the types of highways and the level of congestion. The results showed that the amount of $CO_2$ emission changes depending on (1) the vehicles' cruising speeds (b) congestion levels, and (c) the types of intersections. It was found that the vehicle acceleration and deceleration methods increases the amount of $CO_2$ emission up to 12%. It was also found that it changed up to 30% and 40% depending on the level of congestion and the types of intersections, respectively. The findings imply that the amount of $CO_2$ emission from vehicles should be improved when vehicles' cruising speeds are well managed through congestion management.

A New Traffic Congestion Detection and Quantification Method Based on Comprehensive Fuzzy Assessment in VANET

  • Rui, Lanlan;Zhang, Yao;Huang, Haoqiu;Qiu, Xuesong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.12 no.1
    • /
    • pp.41-60
    • /
    • 2018
  • Recently, road traffic congestion is becoming a serious urban phenomenon, leading to massive adverse impacts on the ecology and economy. Therefore, solving this problem has drawn public attention throughout the world. One new promising solution is to take full advantage of vehicular ad hoc networks (VANETs). In this study, we propose a new traffic congestion detection and quantification method based on vehicle clustering and fuzzy assessment in VANET environment. To enhance real-time performance, this method collects traffic information by vehicle clustering. The average speed, road density, and average stop delay are selected as the characteristic parameters for traffic state identification. We use a comprehensive fuzzy assessment based on the three indicators to determine the road congestion condition. Simulation results show that the proposed method can precisely reflect the road condition and is more accurate and stable compared to existing algorithms.

Analysis of Distributed DDQ for QoS Router

  • Kim, Ki-Cheon
    • ETRI Journal
    • /
    • v.28 no.1
    • /
    • pp.31-44
    • /
    • 2006
  • In a packet switching network, congestion is unavoidable and affects the quality of real-time traffic with such problems as delay and packet loss. Packet fair queuing (PFQ) algorithms are well-known solutions for quality-of-service (QoS) guarantee by packet scheduling. Our approach is different from previous algorithms in that it uses hardware time achieved by sampling a counter triggered by a periodic clock signal. This clock signal can be provided to all the modules of a routing system to get synchronization. In this architecture, a variant of the PFQ algorithm, called digitized delay queuing (DDQ), can be distributed on many line interface modules. We derive the delay bounds in a single processor system and in a distributed architecture. The definition of traffic contribution improves the simplicity of the mathematical models. The effect of different time between modules in a distributed architecture is the key idea for understanding the delay behavior of a routing system. The number of bins required for the DDQ algorithm is also derived to make the system configuration clear. The analytical models developed in this paper form the basis of improvement and application to a combined input and output queuing (CIOQ) router architecture for a higher speed QoS network.

  • PDF

Flow Assignment and Packet Scheduling for Multipath Routing

  • Leung, Ka-Cheong;Victor O. K. Li
    • Journal of Communications and Networks
    • /
    • v.5 no.3
    • /
    • pp.230-239
    • /
    • 2003
  • In this paper, we propose a framework to study how to route packets efficiently in multipath communication networks. Two traffic congestion control techniques, namely, flow assignment and packet scheduling, have been investigated. The flow assignment mechanism defines an optimal splitting of data traffic on multiple disjoint paths. The resequencing delay and the usage of the resequencing buffer can be reduced significantly by properly scheduling the sending order of all packets, say, according to their expected arrival times at the destination. To illustrate our model, and without loss of generality, Gaussian distributed end-to-end path delays are used. Our analytical results show that the techniques are very effective in reducing the average end-to-end path delay, the average packet resequencing delay, and the average resequencing buffer occupancy for various path configurations. These promising results can form a basis for designing future adaptive multipath protocols.