• Title/Summary/Keyword: 혼잡도 완화

Search Result 93, Processing Time 0.024 seconds

Building Low Delay Application Layer Multicasting Trees for Streaming Services (스트리밍 서비스를 위한 적은 지연의 응용계층 멀티캐스트 트리 구축)

  • Kim, Jong-Gyung
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.10
    • /
    • pp.20-26
    • /
    • 2008
  • The quality of stream remaking is decided the load of a server and Jitter through the traffic of the transmission path between end to end. In order to improve these problems in this paper, I propose tree construction method of low-delay-level-multicast. In this case which the network congestion will be occurred by streaming quality, I also propose the technique which dynamically changes the transmission path. This technique first constructs the overlay structure for relaxing the overload of server. Secondly, in order to decrease Jitter of client, it makes upload bandwidth and low latency balanced. In the evaluation of the performance, this paper showed better enhancement of about $15%{\sim}24%$ than P2CAST[4] in the simulation about node average join count, average bandwidth, service request refusal ratio, RTT measurement of nodes, and node average join count by defect ratio.

Predefined Access Routes for Quick Response to Disaster Areas (방재경로 구축방안에 관한 연구 (지구단위 방재경로를 중심으로))

  • Jo, Yong-Chan;Lee, Chang-Ju;Sin, Seong-Il
    • Journal of Korean Society of Transportation
    • /
    • v.25 no.6
    • /
    • pp.43-53
    • /
    • 2007
  • In this research, in order to more concretely define the concept of the previously vaguely defined fire road, the authors propose new terminology called disaster prevention routes. These are defined as predefined access routes for the quick response to disaster areas. For this, the authors suggest selection techniques for disaster prevention routes considering characteristics of fire trucks and selected areas. The paper also includes legally-based ideas for the executive departments with exclusive responsibility for continuous management and supervision of disaster response. In addition, a case study is performed with a virtual scenario including the outbreak of fire in one borough of Seoul. This case study shows that the damage can be decreased by prompt access of fire trucks. The establishment of predefined access routes to disaster areas can help to protect citizens with more rapid response by emergency crews. Indirect benefits also include reduced congestion of roads through the prohibition of parking and stopping on the chosen roads.

A study on Left turn Capacity by Bay Length (Bay길이에 따른 좌회전 용량산정에 관한 연구)

  • 김정례;김기혁
    • Journal of Korean Society of Transportation
    • /
    • v.20 no.3
    • /
    • pp.31-39
    • /
    • 2002
  • The primary objective of this study is to develop a reliable method for estimating the left turn capacity at the signalized intersection. This study is performed during periods of congestion. Multi left turn lane(bay lane and exclusive lane) approaches are examined. When more than one left turn lane exists, traffic volumes are not distributed equally over each lane. The fundamental approach taken in this study is measuring headways on left turn lanes with altering the bay length from 20m to 120m. Left turn lane is divided into 3 sub-sections in this study. These are SLP section(start-up lost time Period), SFP section(saturation flow period), LSP section(lane selection period). Saturation flow rates are evaluated for each sub section periods. As a results of analysis, it has been confirmed that the left turn capacity can be estimated by left turn bay length and effective green time for left turn. The left turn bay length adjustment factor is suggested in this study.

Evaluating location suitability of Park-and-Ride facilities using GIS (GIS를 이용한 환승시설 입지 적합도 평가)

  • Kim, Kam-Young
    • Journal of the Korean association of regional geographers
    • /
    • v.14 no.6
    • /
    • pp.718-735
    • /
    • 2008
  • Park-and- Rides are intermodal transfer facilities providing a staging location for travellers to transfer between transportation modes. They are an alternative to alleviate transportation problems such as traffic congestion and air pollution in metropolitan areas. Siting Park-and-Ride facilities belongs to a kind of multi-criteria spatial decision making problems being associated with a combination of various location factors. The purpose of this paper is to provide a method and procedure to evaluate the location suitability of Park-and-Ride facilities using GIS(Geographic Information Systems). Using GIS-based suitability analysis, land value, landuse, road accessibility, public transportation accessibility, possibility to intercept automobile trips, distance to activity center and competition with existing facilities were evaluated as location factors. The suitabilities of individual factors were combined to produce a composite map with a specific weight scheme. Then a given number of sites with high suitability score were selected as potential facility locations and their demand were evaluated based on a commutershed with parabolic shape. The suggested method and procedure will provide useful information in determining Park-and-Ride sites and designing their structure.

  • PDF

A Mainline Metering Strategy at Toll Plaza Considering Queue Imbalance Among Lanes (차로간 Queue 불균형을 고려한 Toll Plaza 본선미터링 전략)

  • Jang, Sunghoon;Lee, Yong-Gwan;Kho, Seung-Young;Lee, Chungwon
    • Journal of Korean Society of Transportation
    • /
    • v.33 no.1
    • /
    • pp.1-13
    • /
    • 2015
  • This study aims to develop a mainline metering strategy considering queue imbalance among lanes that can reduce congestion at a toll plaza section by managing queue caused by mainline metering. The suggested strategy considers simultaneously optimizing the number of cars in merging area and managing queue by lane. This study analyzes the effectiveness of the strategy with respect to the average travel time and the occurrence rate of spillback using the PARAMICS. The results show that the suggested strategy has an effect on reducing congestion and improving operation efficiency at toll plaza. In particular, the congestion become more intensified when the length of waiting space is shorter; however, this study shows that the suggested strategy can relieve the congestion in that condition.

Passenger Flow Analysis at Transit Connecting Path (철도 환승 연결로에서의 여객 유동 해석)

  • Nam, Seongwon
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.21 no.10
    • /
    • pp.415-420
    • /
    • 2020
  • Crowd flows occur in metropolitan railway transit stations, terminals, multiple buildings, and stadiums and are important in ensuring the safety as well as smooth flow of pedestrians in these facilities. In this study, the author developed a new computational analysis method for crowd flow dynamics and applied it to models of transit connecting paths. Using the analysis method, the potential value of the exit was assigned the smallest value, and the potential value of the surrounding grids gradually increased to form the overall potential map. A pathline map was then constructed by determining the direction vector from the grid with large potential value to the grid and small potential. These pathlines indicate basic routes of passenger flow. In all models of the analysis object, the pedestrians did not move to the first predicted shortest path but instead moved using alternative paths that changed depending on the situation. Even in bottlenecks in which pedestrians in both directions encountered each other, walking became much smoother if the entry time difference was dispersed. The results of the analysis show that a method for reducing congestion could be developed through software analysis such as passenger flow analysis without requiring hardware improvement work at the railway station.

A Solution Algorithm for Elastic Demand Traffic Assignment Model Based on Dynamic Process (동적과정을 이용한 가변수요 통행배정모형의 알고리듬 개발)

  • Im, Yong-Taek;Kim, Hyeon-Myeong
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.2 s.88
    • /
    • pp.169-178
    • /
    • 2006
  • Traffic assignment has been used both for predicting travel demands and for evaluating the tools for alleviating congestion on road network in advance. Some assignment models have been proposed such as equivalent mathematical minimization method, variational inequality problem, nonlinear complementary problem and fixed point method, in following the principle of Wardrop (1952) that no driver can not Improve his travel cost by unilaterally changing his route. Recently Jin(2005a) presented a traffic assignment model based on dynamic process. This paper proposes a solution algorithm for the model of Jin and assesses the performances. Compared to the Frank-Wolfe method, which has been wildly used for solving the existing assignment models, the proposed algorithm is expected to be more efficient because it does not need to evaluate the objective function. Two numerical examples are used for assessing the algorithm, and they show that the algorithm converges to user equilibrium of Wardrop.

TAS: TCP-Aware Sub-layer over IEEE 802.11-based wireless LANs (IEEE 802.11 기반 무선랜에서 TCP 인진서브 계층 TAS)

  • Choi, Nak-Jung;Jung, Ha-Kyung;Ryu, Ji-Ho;Seok, Yong-Ho;Choi, Yang-Hee;Kwon, Tae-Kyoung
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.5
    • /
    • pp.355-368
    • /
    • 2006
  • This paper introduces a new split-TCP approach for improving TCP performance over IEEE 802.11-based wireless LANs. TCP over wireless LANs differently from wired networks is not aggressive, which is a fundamental reason for poor performance. Therefore, we propose TAS (TCP-Aware Sub-layer) to migigate this problem. Our scheme extends the split-connection approach that divides a connection into two different connections at a split point such as an access point (AP). Using TAS, a wireless node emulates TCP ACK packets using MAC ACK frames, instead of receiving real TCP ACK packets. We compared TAS with both normal TCP and I-TCP (Indirect TCP) by NS2 simulation. Results show that TAS achieves higher throughput, more fair resource allocation and, in power-saving mode, shorter delays.

Synchronized One-to-many Media Streaming employing Server-Client Coordinated Adaptive Playout Control (적응형 재생제어를 이용한 동기화된 일대다 미디어 스트리밍)

  • Jo, Jin-Yong;Kim, Jong-Won
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.5C
    • /
    • pp.493-505
    • /
    • 2003
  • A new inter-client synchronization framework for multicast media streaming is proposed employing a server-client coordinated adaptive playout control. The proposed adaptive player controls the playback speed of audio and video by adopting the time-scale modification of audio. Based on the overall synchronization status as well as the buffer occupancy level, the playout speed of each client is manipulated within a perceptually tolerable range. Additionally, the server implicitly helps increasing the time available for retransmission while the clients perform an interactive error recovery mechanism with the assistance of playout control. The network-simulator based simulations show that the proposed framework can reduce the playout discontinuity without degrading the media quality, and thus mitigate the client heterogeneity.

Centralized routing method of unmanned aerial vehicle using vehicular Ad Hoc networks (차량 네트워크 기반 중앙관리형 무인비행체 경로 유도 시스템)

  • Kim, Ryul;Joo, Yang-Ick
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.40 no.9
    • /
    • pp.830-835
    • /
    • 2016
  • With the relaxation of regulations on unmanned aerial vehicles (UAVs) in the USA, the development of related industries is expected. Hence, it is anticipated that the number the UAVs will reach approximately 600,000 in the USA in 2017. However, automated flights of commercial UAVs are restricted owing to concerns about accidents. To deal with the possibility of collisions, several studies on collision prevention and the routing of UAVs have been conducted. However, these studies do not deal with various situations dynamically or provide efficient solutions. Therefore, we propose a centralized routing method for the UAV that uses vehicular networks. In the proposed scheme, vehicular networks regard UAVs as data packets to be routed. Accordingly, the proposed method reduces UAV processing power required for route searches. In addition, the routing efficiency for UAV flight paths can be improved since congestion can be minimized by using a vehicular network.