• Title/Summary/Keyword: 혼잡 감소

Search Result 258, Processing Time 0.02 seconds

An Analysis of the Causes of the Welfare Gain Achieved by Congestion Pricing and Transit Subsidies (혼잡통행료와 대중교통 보조금의 효용개선 원인 분석)

  • Rhee, Hyok-Joo;Yu, Sang-Gyun
    • 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.

Crash Clearance Time Analysis of Korean Freeway Systems using a Cox Model (Cox 모형을 활용한 고속도로 사고 처리시간 영향인자 분석)

  • Chung, Younshik;Kim, Seon Jung
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.37 no.6
    • /
    • pp.1017-1023
    • /
    • 2017
  • Duration induced by freeway crashes has a critical influence on traffic congestion. In general, crash duration composes detection and verification, response, and clearance time. Of these, the crash clearance time determined by a crash clearance team has attracted considerable attention in the freeway congestion management since the interest of the first two time stages faded away with increasing ubiquitous mobile phone users. The objective of this study is to identify the critical factors that affect freeway crash clearance time using a Cox's proportional hazard model. In total, 6,870 crash duration data collected from 30 major Korean freeways in 2013 were used. As a result, it was found that crashes during the night, with trailer or larger size truck, and in tunnel section contribute to increasing clearance time. Crashes associated with fatality, completed damage of crashed vehicle (s), and vehicles' fire or rollover after crash also lead to increasing clearance time. Additionally, an increase in the number of vehicles involved resulted in longer clearance time. On the other hand, crashes in the vicinity of tollgate, by passenger car, during spring, on flat section, and of car-facility type had longer clearance time. On the basis of the results, this paper suggested some strategic plans and mitigation measures to reduce crash clearance time on Korean freeway systems.

A New Queue Management Algorithm for Improving Fairness between TCP and UDP Flows (TCP와 UDP 플로우 간의 공정성 개선을 위한 새로운 큐 관리 알고리즘)

  • Chae, Hyun-Seok;Choi, Myung-Ryul
    • The KIPS Transactions:PartC
    • /
    • v.11C no.1
    • /
    • pp.89-98
    • /
    • 2004
  • AQM (Active Queue Management) techniques such as RED (Random Early Detection) which be proposed to solve the congestion of internet perform congestion control effectively for TCP data. However, in the situation where TCP and UDP share the bottleneck link, they can not solve the problems of the unfairness and long queueing delay. In this paper, we proposed an simple queue management algorithm, called PSRED (Protocol Sensitive RED), that improves fairness and decreases queueing delay. PSRED algorithm improves fairness and decreases average queue length by distinguishes each type of flow in using protocol field of packets and applies different drop functions to them respectively.

Emprical Tests of Braess Paradox (The Case of Namsan 2nd Tunnel Shutdown) (브라이스역설에 대한 실증적 검증 (남산2호터널 폐쇄사례를 중심으로))

  • 엄진기;황기연;김익기
    • Journal of Korean Society of Transportation
    • /
    • v.17 no.3
    • /
    • pp.61-70
    • /
    • 1999
  • The Purpose of this study is to test whether Braess Paradox (BP) can be revealed in a real world network. Fer the study, Namsan 2nd tunnel case is chosen, which was shut down for 3 years for repair works. The revelation of BP is determined by analyzing network-wise traffic impacts followed by the tunnel closure. The analysis is conducted using a network simulation model called SECOMM developed for the congestion management of the Seoul metropolitan area. Also, the existence of BP is further identified by a before-after traffic survey result of the major arterials nearby the Namsan 2nd tunnel. The model estimation expected that the closure of Namsan 2nd tunnel improve the network-wise average traffic speed from 21.95km/h to 22.21km/h when the travel demand in the study area and congestion Pricing scheme on Namsan 1st & 3rd tunnels remain unchanged. In addition, the real world monitoring results of the corridors surrounding Namsan 2nd tunnel show that the average speed increases from 29.53km/h to 30.37km/h after the closure. These findings clearly identify the BP Phenomenon is revealed in this case.

  • PDF

A Sender-based Packet Loss Differentiation Algorithm based on Estimating the Queue Usage between a TCP sender/receiver (TCP 송수신자간의 큐사용률 추정을 이용한 송신자 기반의 패킷손실 구별기법)

  • Park, Mi-Young;Chung, Sang-Hwa;Lee, Yun-Sung
    • Journal of the Korea Society of Computer and Information
    • /
    • v.16 no.1
    • /
    • pp.133-142
    • /
    • 2011
  • When TCP operates in multi-hop wireless networks, it suffers from severe performance degradation due to the different characteristics of wireless networks and wired networks. This is because TCP reacts to wireless packet losses by unnecessarily decreasing its sending rate assuming the losses as congestion losses. Although several loss differentiation algorithms (LDAs) have been proposed to avoid such performance degradation, their detection accuracies are not high as much as we expect. In addition the schemes have a tendency to sacrifice the detection accuracy of congestion losses while they improve the detection accuracy of wireless losses. In this paper, we suggest a new sender-based loss differentiation scheme which enhances the detection accuracy of wireless losses while minimizing the sacrifice of the detection accuracy of congestion losses. Our scheme estimates the rate of queue usage which is highly correlated with the congestion in the network path between a TCP sender and a receiver, and it distinguishes congestion losses from wireless losses by comparing the estimated queue usage with a certain threshold. In the extensive experiments based on a network simulator, QualNet, we measure and compare each detection accuracy of wireless losses and congestion losses, and evaluate the performance enhancement in each scheme. The results show that our scheme has the highest accuracy among the LDAs and it improves the most highly TCP performance in multi-hop wireless networks.

The Performance Improvement using Rate Control in End-to-End Network Systems (종단간 네트워크 시스템에서 승인 압축 비율 제어를 이용한 TCP 성능 개선)

  • Kim, Gwang-Jun;Yoon, Chan-Ho;Kim, Chun-Suk
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.9 no.1
    • /
    • pp.45-57
    • /
    • 2005
  • In this paper, we extend the performance of bidirectional TCP connection over end-to-end network that uses transfer rate-based flow and congestion control. The sharing of a common buffer by TCP packets and acknowledgement has been known to result in an effect called ack compression, where acks of a connection arrive at the source bunched together, resulting in unfairness and degraded throughput. The degradation in throughput due to bidirectional traffic can be significant. Even in the simple case of symmetrical connections with adequate window size, the connection efficiency is improved about 20% for three levels of background traffic 2.5Mbps, 5.0Mbps and 7.5Mbps. Otherwise, the throughput of jitter is reduced about 50% because round trip delay time is smaller between source node and destination node. Also, we show that throughput curve is improved with connection rate algorithm which is proposed for TCP congetion avoidance as a function of aggressiveness threshold for three levels of background traffic 2.5Mbps, 5Mbps and 7.5Mbps. By analyzing the periodic bursty behavior of the source IP queue, we derive estimated for the maximum queue size and arrive at a simple predictor for the degraded throughput, applicable for relatively general situations.

절벽위의 한국의 항공산업

  • Lee, Dong Ho
    • Aerospace Industry
    • /
    • v.61
    • /
    • pp.14-16
    • /
    • 1998
  • 며칠 전 졸업반 4학년 학생들을 인솔하고 산업체 현장 견학을 다녀왔다. 지난해말 한국을 강습한 IMF 한파 이후 처음 있는 현장 방문이라 여러 가지 면에서 감회가 새로웠다. 일차적으로 김포공항에서 탑승한 부산행 항공기의 현격한 승객 감소가 피부로 와 다았다. 예년 같으면 아침 시간에 좌석배정 카운터가 매우 혼잡할 텐데 별로 힘들지 않게 좌석 배정을 받고 탑승할 수 있었다. 위축된 기업환경과 가계로 인하여 비싼 항공출장과 관광 승객이 대폭 줄은 탓 같았다.

  • PDF

지능형 교통 시스템(ITS) 동향

  • 오종택
    • TTA Journal
    • /
    • s.54
    • /
    • pp.99-113
    • /
    • 1997
  • 전 세계적으로 차량의 숫자는 급격하게 증가하는데 비해 도로 증가율이 이에 미치지 못해 교통 체증으로 인한 경제적, 인적 손실이 국가 산업 경쟁력을 위협하는 수준이 되었다. 이를 극복하기 위해 기존의 도로교통 체계에 첨단 정보통신 및 교통, 제어 체계를 도입하여 교통혼잡 및 환경오염, 연료소비의 감소와 안전운행 확보를 위한 ITS 연구 개발이 활발하게 진행중에 있다.

  • PDF

TCP Congestion Control Algorithm using TimeStamp (TimeStamp를 이용한 TCP 혼잡제어 알고리즘)

  • 김노환
    • Journal of the Korea Society of Computer and Information
    • /
    • v.5 no.3
    • /
    • pp.126-131
    • /
    • 2000
  • Through many users employ TCP of which the performance has been proved in Internet, but many papers Proposed to improve TCP performance according to varying network architecture. In Particular, BWDP(bandwidth-delay Product) grew larger because of the increasing delay in satellite link and the network's speed-up. To consider these increased bandwidth-delay product, it is suggested that TCP options include Window Scale option. TimeStamp option, and PAWS. Because TCP window size should be commonly high in the network with these increased bandwidth-delay product, the multiple decrease and linear increase scheme of current TCP would cause underflow and instability within network. Then TCP performance is reduced as a result. Thus, to improve TCP congestion control algorithm in the network which has large sized window, this paper proposes the congestion control scheme that controls window size by using TimeStamp option.

  • PDF

A Same-Priority Collision-Avoidance Algorithm Using RTS/CTS Frame in IEEE 802.11e EDCA under Network Congested Condition (IEEE 802.11e EDCA 네트워크 혼잡 환경에서 RTS/CTS 프레임을 이용한 동일 우선순위 충돌 회피 알고리즘)

  • Kwon, YongHo;Rhee, Byung Ho
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.5
    • /
    • pp.425-432
    • /
    • 2014
  • The Enhanced Distributed Channel Access (EDCA) function of IEEE 802.11e standard defines contention window (CW) for different Access Category (AC) limits to support Quality-of-Service (QoS). However, it have been remained the problem that the collision probability of transmission is increasing in congested network. Several different solutions have been proposed but the collision occurs among same priority queue within the same station to compete the channel access. This paper presents an APCA (Advanced Priority Collision Avoidance) algorithm for EDCA that increases the throughput in saturated situation. The proposed algorithm use reserved field's bits of FC(Frame Control) using IEEE 802.11e standard's RTS/CTS (Request to Send / Clear to Send) mechanism to avoid data collision. The simulation results show that the proposed algorithm improves the performance of EDCA in packet loss. Using Jain's fairness index formula, we also prove that the proposed APCA algorithm achieves the better fairness than EDCA method under network congested condition.