• Title/Summary/Keyword: maximum Possible throughput rate

Search Result 5, Processing Time 0.022 seconds

Development of Capacity Analysis Procedure for Freeway Facility System (고속도로 최대통과교통량 산정 및 서비스수준 평가 기법 개발)

  • Lee, Seung-Jun
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.4 s.90
    • /
    • pp.129-148
    • /
    • 2006
  • The objective of this thesis is to develop a capacity analysis and to develop a methodology to evaluate Level of Service over the entire freeway sections by single MOE (Measure of Effectiveness) This study set forth from a following viewpoint. to analyze entire freeway sections as freeway facility system, it is important to identify the exact point where congestion would occur and the extent of the congestion. Therefore, in this thesis, congestion mechanism on freeways was figured out and congestion analysis methodology was developed. Thereby maximum possible throughput rate and maximum throughput rate in bottleneck sections were calculated and a congestion analysis was carried out. The difference between the new method and existing Procedures is that maximum possible throughput rate and maximum throughput rate. that can be considered as capacities of un-congested and congested flow in the bottleneck section, are variable capacities dependent on demand flow.

Development of Analysis Model and Improvement of Evaluation Method of LOS for Freeway Merging Areas (고속도로 합류부 분석모형 개발 및 서비스수준 평가 기법 개선 연구)

  • Lee, Seung-Jun;Park, Jae-Beom
    • Journal of Korean Society of Transportation
    • /
    • v.24 no.7 s.93
    • /
    • pp.115-128
    • /
    • 2006
  • The analytic methodology of a merging area in KHCM(2004) supposes that congestion nay occur when traffic demand is more than capacity However, in many cases, congestion on merging area occurs when summation of traffic demand of main line and ramp is less than capacity, and in present methodology analysis of how main line and ramp flow effect on congestion occurrence is difficult. In this study, the model that is able to estimate traffic flow condition on merging area in accordance with the combination of main line and ramp demand flow is developed. Main characteristic of the model is estimation of maximum possible throughput rate and maximum throughput rate according to the combination of main line and ramp demand flow. Through the estimation of maximum possible throughput rate and maximum throughput rate. it was Possible to predict whether congestion would occur or not and how much maximum throughput rate and congestion would be on merging area. On one hand, in present LOS evaluation methodology on merging area, congestion state is determined as un-congested flow if demand flow is less than capacity. Therefore, to establish more reasonable In evaluation method, new criterion of LOS evaluation on merging area was searched based on the model of this study.

Practical Schemes for Tunable Secure Network Coding

  • Liu, Guangjun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.9 no.3
    • /
    • pp.1193-1209
    • /
    • 2015
  • Network coding is promising to maximize network throughput and improve the resilience to random network failures in various networking systems. In this paper, the problem of providing efficient confidentiality for practical network coding system against a global eavesdropper (with full eavesdropping capabilities to the network) is considered. By exploiting a novel combination between the construction technique of systematic Maximum Distance Separable (MDS) erasure coding and traditional cryptographic approach, two efficient schemes are proposed that can achieve the maximum possible rate and minimum encryption overhead respectively on top of any communication network or underlying linear network code. Every generation is first subjected to an encoding by a particular matrix generated by two (or three) Vandermonde matrices, and then parts of coded vectors (or secret symbols) are encrypted before transmitting. The proposed schemes are characterized by tunable and measurable degrees of security and also shown to be of low overhead in computation and bandwidth.

Dynamic Capacity Concept and its Determination for Managing Congested Flow (혼잡교통류 관리를 위한 동적 용량의 개념 및 산정방법)

  • Park, Eun-Mi
    • Journal of Korean Society of Transportation
    • /
    • v.22 no.3 s.74
    • /
    • pp.159-166
    • /
    • 2004
  • The capacity concept presented in the Highway Capacity Manual is for steady-state traffic flow assuming that there is no restriction in downstream flowing, which is traditionally used for planning, design, and operational analyses. In the congested traffic condition, the control objective should be to keep the congested regime from growing and to recover the normal traffic condition as soon as possible. In this control case, it is important to predict the spatial-temporal pattern of congestion evolution or dissipation and to estimate the throughput reduction according to the spatial-temporal pattern. In this context, the new concept of dynamic capacity for managing congested traffic is developed in terms of spatial-temporal evolution of downstream traffic congestion and in view of the 'input' concept assuming that flow is restricted by downstream condition rather than the 'output' concept assuming that there is no restriction in downstream flowing (e.g. the mean queue discharge flow rate). This new capacity is defined as the Maximum Sustainable Throughput that is determined based on the spatial-temporal evolution pattern of downstream congestion. And the spatial-temporal evolution pattern is estimated using the Newell's simplified q-k model.

A Study on an Adaptive AQM Using Queue Length Variation

  • Seol, Jeong-Hwan;Lee, Ki-Young
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.1
    • /
    • pp.19-23
    • /
    • 2008
  • The AQM (Active Queue Management) starts dropping packets earlier to notify traffic sources about the incipient stage of congestion. The AQM improves fairness between response flow (like TCP) and non-response flow (like UDP), and it can provide high throughput and link efficiency. In this paper, we suggest the QVARED (Queue Variation Adaptive RED) algorithm to respond to bursty traffic more actively. It is possible to provide more smoothness of average queue length and the maximum packet drop probability compared to RED and ARED (Adaptive RED). Therefore, it is highly adaptable to new congestion condition. Our simulation results show that the drop rate of QVARED is decreased by 80% and 40% compare to those of RED and ARED, respectively. This results in shorter end-to-end delay by decreasing the number of retransmitted packets. Also, the QVARED reduces a bias effect over 18% than that of drop-tail method; therefore packets are transmitted stably in the bursty traffic condition.