2016
DOI: 10.1142/s0217979215410015
|View full text |Cite
|
Sign up to set email alerts
|

Queuing model of a traffic bottleneck with bimodal arrival rate

Abstract: This paper revisits the problem of tuning the density in a traffic bottleneck by reduction of the arrival rate when the queue length exceeds a certain threshold, studied recently for variants of totally asymmetric simple exclusion process (TASEP) and Burgers equation. In the present approach, a simple finite queuing system is considered and its contrasting “phase diagram” is derived. One can observe one jammed region, one low-density region and one region where the queue length is equilibrated around the thres… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2016
2016
2019
2019

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 10 publications
0
1
0
Order By: Relevance
“…At present, the application of queuing theory is extensive. Load balancing [35], urban traffic [36], [37] and resource utilization [38] all involve queuing theory. A queuing model is generally expressed as a 6-tuple: X /Y /Z /A/B/C.…”
Section: A Queuing Modelsmentioning
confidence: 99%
“…At present, the application of queuing theory is extensive. Load balancing [35], urban traffic [36], [37] and resource utilization [38] all involve queuing theory. A queuing model is generally expressed as a 6-tuple: X /Y /Z /A/B/C.…”
Section: A Queuing Modelsmentioning
confidence: 99%