• Title/Summary/Keyword: 혼잡 민감도

Search Result 43, Processing Time 0.022 seconds

Development of a Model for Calculating Road Congestion Toll with Sensitivity Analysis (민감도 분석을 이용한 도로 혼잡통행료 산정 모형 개발)

  • Kim, Byung-Kwan;Lim, Yong-Taek;Lim, Kang-Won
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.5
    • /
    • pp.139-149
    • /
    • 2004
  • As the expansion of road capacity has become impractical in many urban areas, congestion pricing has been widely considered as an effective method to reduce urban traffic congestion in recent years. The principal reason is that the congestion pricing may lead the user equilibrium (UE) flow pattern to system optimum (SO) pattern in road network. In the context of network equilibrium, the link tolls according to the marginal cost pricing principle can user an UE flow to a SO pattern. Thus, the pricing method offers an efficient tool for moving toward system optimal traffic conditions on the network. This paper proposes a continuous network design program (CNDP) in network equilibrium condition, in order to find optimal congestion toll for maximizing net economic benefit (NEB). The model could be formulated as a bi-level program with continuous variable(congestion toll) such that the upper level problem is for maximizing the NEB in elastic demand, while the lower level is for describing route choice of road users. The bi-level CNDP is intrinsically nonlinear, non-convex, and hence it might be difficult to solve. So, we suggest a heuristic solution algorithm, which adopt derivative information of link flow with respect to design parameter, or congestion toll. Two example networks are used for test of the model proposed in the paper.

A Study on Network Competition Under Congestion (네트워크 혼잡이 있는 경우의 네트워크 경쟁효과 분석)

  • Jung, Choong-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.1B
    • /
    • pp.24-33
    • /
    • 2009
  • This paper considers network competition where the subscribers experience network congestion when they use the network and the network providers determine the network price and capacity. This paper discusses the impact of the network competition on social welfare. Network provider determines the price and capacity considering this characteristics of this sensitivity to network congestion where the subscriber has different preference about the congestion. This paper shows that network provider who wants to serve the intolerable customers (who is very sensitive to the congestion) offers higher price and capacity. However, this provider prepares lower capacity than socially optimal capacity. This is because the network provider seeks to earn more profits from additional subscriber while it is desirable to invest the capacity to give the entire subscribers a non-congestion network in the view of social welfare.

Segment-based Differentiated Pricing Strategy for Reducing Congestion of Expressways (고속도로 혼잡 완화를 위한 구간별 차등요금 부과전략)

  • Lee, Eunho;Kim, Dong-Kyu;Kho, Seung-Young;Kim, Hyo Seung
    • Journal of Korean Society of Transportation
    • /
    • v.32 no.6
    • /
    • pp.675-685
    • /
    • 2014
  • This paper develops a differentiated pricing strategy over each segment of expressways based on the second-best pricing method for reducing congestion. To this end, a bi-level problem is proposed, in which the upper level of the model is formulated to determine toll level of each segment for minimizing traffic congestion, whereas the lower level of the model is formulated as a variable demand assignment problem. The sensitivity analysis based algorithm is took placed to find optimal solutions of upper level model. An application of the proposed model uses the modified Sioux-Falls network. The results show that the segment-based differentiated pricing strategy performs better than the existing uniform pricing strategy in reducing traffic congestion. This study can be applied as a demand management method to relieve disutility of excessively congested segments of expressways.

A Improved Network partition Technique Using Marginal Cost Sensitivity Under Transmission Congestion (송전 혼잡하에서 한계비용 민감도를 이용한 개선된 계통분할 알고리즘)

  • Kim, Sung-Pil;Mang, Keun-Ho;Jeong, Hae-Seong;Park, Jong-Keun
    • Proceedings of the KIEE Conference
    • /
    • 2002.07a
    • /
    • pp.428-431
    • /
    • 2002
  • 본 논문에서는 경쟁적 전력시장에서 송전제약에 관한 비용을 적절히 할당하는 방법을 제시하고자 한다. 혼잡비용을 할당하는 방법으로는 모든 사용자들에게 똑같이 배분하는 방법과 혼잡의 원인을 제공한 사용자에게 정도에 따라 가중하여 혼잡비용을 할당하는 nodal pricing과 zonal pricing이 있다. 계산의 신속성과 복잡성으로 인해서 zonal pricing이 유용한 방법으로 사용되고 있다. 기존의 분할 기술은 계통운영자가 설정한 한계범위의 모선들을 zone으로 형성하는 통계적인 방법을 사용했다. 이 방법은 운영자의 임의성이 반영되는 모호한 알고리즘이라는 단점을 가지고 있다. 그래서 본 논문에서는 한계비용민감도를 이용한 계통분할 방법을 제안하였다.

  • PDF

Network Congestion Control Through Adjustment of Data Transmission Time on Smart Grid Networks (스마트 그리드 네트워크에서 데이터 전송시간 조절을 통한 네트워크혼잡 개선 방법)

  • Park, Se-Young;Kim, Mi-Hui
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2012.01a
    • /
    • pp.217-218
    • /
    • 2012
  • 기기간(M2M, Machine-to-Machin) 통신의 한 응용으로서 스마트 그리드 네트워크는 다수의 기기 통신으로 인한 전송 데이터의 방대한 양을 대표적 특징으로 꼽을 수 있다. 이에 현재 사용가능한 통신 기술들을 그대로 사용할 경우, 병목현상 혹은 네트워크 혼잡 등 네트워크 장애 및 전송 지연이 발생할 수 있다. 특히 스마트 그리드 네트워크의 상향 트래픽은 시간조절이 가능한 주기적 미터링 데이터와 지연민감한 이벤트 데이터로 나뉜다. 이에 본 논문에서는 각 트래픽 특성에 따라 트래픽양의 대다수를 이룰 미터링 데이터의 전송시간 조절을 이용한 혼잡제어 기법을 제안한다. 이를 통해 지연민감한 이벤트 데이터의 지연시간 내 전송 보장 확률을 높이고, 트래픽을 분산시킴으로써 전송 효율을 높이고자 한다.

  • PDF

A Router Mechanism for Congestion Control in Internet (인터넷에서 혼잡 제어를 위한 라우터 메커니즘)

  • 박재성;신용철;박희윤;이재용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.10A
    • /
    • pp.1746-1755
    • /
    • 2001
  • 본 논문에서는 인터넷 트래픽의 자기 유사성 특성을 이용한 큐 관리 기법을 제안한다. 제안 기법은 LRD 프로세스의 특성을 이용하여 큰 타임 스케일에서 다음 혼잡 검출 주기 동안 평균 트래픽 입력율을 예측하고 이를 통해 혼잡 발생 여부를 미리 검출한다. 혼잡 검출시 입력 패킷을 확률적으로 폐기함으로써 망 내부에서 혼잡 발생을 사전에 방지한다. 제안 기법은 종단 시스템의 혼잡 제어 기법이나 각 플로우의 통신 환경에 무관하게 라우터의 평균 큐 길이와 큐 길이 변이를 작게 유지할 수 있으므로 지연과 지연 변이에 민감한 멀티미디어 서비스 제어에 적합하다. 또한 제안 기법은 입력율 예측을 통해 혼잡을 사전에 검출하기 때문에 종단간 혼잡 제어 기법을 사용하지 않는 플로우들에 의해 발생된 패킷들이 망 자원을 불평등하게 많이 사용하는 현상을 방지한다. 제안 기법은 각 플로우별 상태 정보를 관리하지 않으므로 확장성이 뛰어나며 이로 인해 소수의 PHB에 따라 각 홉별로 차등화된 서비스를 제공하는 Diffserv 구조에 적합하다. 또한 제안 기법은 기존 인터넷 구조에 변화를 주지 않고 라우터의 소프트웨어 업그레이드만으로 서비스가 가능하며, 필요한 버퍼의 양도 크지 않다는 장점을 가진다.

  • PDF

Efficient Congestion Detection and Control Algorithm based on Threshold for Wireless Sensor Network (무선 센서 네트워크를 위한 임계치 기반 효율적인 혼잡 탐지 및 제어 알고리즘)

  • Lee, Dae-Woon;Lee, Tae-Woo;Choi, Seung-Kwon;Lee, Joon-Suk;Jin, Guangxun;Lee, Jae-Youp
    • The Journal of the Korea Contents Association
    • /
    • v.10 no.9
    • /
    • pp.45-56
    • /
    • 2010
  • This paper reports a new mechanism for congestion controls. The proposed congestion detection algorithm can be provided with delay and unnecessary energy consumption. Conventional congestion control methods decide congestion by queue occupancy or mean packet arrival rate of MAC layer only, however, our method can perform precise detection by considering queue occupancy and mean packet arrival rate. In addition, the congestion avoiding method according to congestion degree and scheduling method using priority for real time packets are proposed. Finally, simulation results show that proposed congestion detection and control methods outperforms conventional scheduling schemes for wireless sensor network.

A Queue Management Algorithm for Improving Fairness in a Private Network (사설 망의 공정성을 향상시키기 위한 큐 관리 알고리즘)

  • Kang, Tae-Hyung;Koo, Ja-Hon;Chung, Kwang-Sue
    • Journal of KIISE:Information Networking
    • /
    • v.29 no.5
    • /
    • pp.524-532
    • /
    • 2002
  • With the recent rapid progress of Internet, the higher speed network is needed to support the exploration of ambient information from text-based to multimedia-based information. Also, demands for additional Layer 3 routing technique, such as Network Address Translator (NAT) and Firewall, are required to solve a limitation of a current Internet address space and to protect the interior network from the exterior network. However, current router-based algorithms do not provide mechanisms to solve the congestion and fairness problems, while supporting the multimedia services and satisfying the user requirements. In this paper, to solve these problems, a new active queue management, called MFRED (Multiple Fairness RED) algorithm, is proposed. This algorithm can efficiently reduce the congestion in a router or gateway based on the Layer 3 routing technique, such as NAT. This algorithm can improve the fairness among TCP-like flows and unresponsive flows. It also works well in fairly protecting congestion-sensitive flows, i.e. fragile TCP, from congestion-insensitive or congestion-causing flows, i.e. robust TCP.

Adaptive Congestion Control for Effective Data Transmission in Wireless Sensor Networks (센서네트워크에서의 효율적인 데이터 전송을 위한 적응적 혼잡 제어)

  • Lee, Joa-Hyoung;Gim, Dong-Gug;Jung, In-Bum
    • The KIPS Transactions:PartC
    • /
    • v.16C no.2
    • /
    • pp.237-244
    • /
    • 2009
  • The congestion in wireless sensor network increases the ratio of data loss and causes the delay of data. The existing congestion protocols for wireless sensor network reduces the amount of transmission by control the sampling frequency of the sensor nodes related to the congestion when the congestion has occurred and was detected. However, the control method of sampling frequency is not applicable on the situation which is sensitive to the temporal data loss. In the paper, we propose a new congestion control, ACT - Adaptive Congestion conTrol. The ACT monitors the network traffic with the queue usage and detects the congestion based on the multi level threshold of queue usage. Given network congestion, the ACT increases the efficiency of network by adaptive flow control method which adjusts the frequency of packet transmission and guarantees the fairness of packet transmission between nodes. Furthermore, ACT increases the quality of data by using the variable compression method. Through experiment, we show that ACT increases the network efficiency and guarantees the fairness to sensor nodes compared with existing method.

Static Optimization Model for Congested Signalized Intersections (혼잡 신호교통로 제어를 위한 최적화 모형 개발)

  • 김영찬
    • Journal of Korean Society of Transportation
    • /
    • v.10 no.3
    • /
    • pp.75-102
    • /
    • 1992
  • 지난 수십년간 수많은 신호교차로제어모형이 제시되어 왔으나 과포화교차로를 특별히 다루는 기법은 거의 없었다. 본고에서는 과포화상태의 신호교차로제어를 위한 최적화모형이 제시된다. 지체도최소화나 연동폭최대화가 전통적인 제어목표로 사용되어 왔으나 혼잡교차로 제어에는 생산성최대화(maximum productivity)가 적절하며 본 모형에 사용되었다. 제시된 최적화모형은 Mixed Integer Linear Programming의 형태를 취한다. 본 모형은 두 개의 교차로 문제에 적용되었으며, 모형화 과정에 사용된 가정들의 적절함이 민감도분석에 의해 증명되었다. 최적해의 검증을 위하여 microscopic simulation model인 TRAF-NETSIM을 사용하였다.

  • PDF