Analytical and Scalable Analysis of Transient Tandem Markovian Finite Capacity Queueing Networks
This paper proposes an analytical model to approximate the transient aggregate joint queue-length distribution of tandem finite (space) capacity Markovian networks. The methodology combines ideas from transient aggregation-disaggregation techniques as well as transient network decomposition methods....
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Article |
Language: | en_US |
Published: |
Institute for Operations Research and the Management Sciences (INFORMS)
2017
|
Online Access: | http://hdl.handle.net/1721.1/111144 https://orcid.org/0000-0003-0979-6052 |
Summary: | This paper proposes an analytical model to approximate the transient aggregate joint queue-length distribution of tandem finite (space) capacity Markovian networks. The methodology combines ideas from transient aggregation-disaggregation techniques as well as transient network decomposition methods. The complexity of the proposed method is linear in the number of queues and is independent of the space capacities of the individual queues. This makes it a suitable approach for the analysis of large-scale networks. The transient joint distributions are validated versus simulation estimates. The model is then used to describe urban traffic dynamics and to address a dynamic traffic signal control problem. The signal plan analysis shows the added value of using joint distributional information, and more generally spatial-temporal between-link dependency information, to enhance urban traffic operations. |
---|