MIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Analytical and Scalable Analysis of Transient Tandem Markovian Finite Capacity Queueing Networks

Author(s)
Osorio Pizano, Carolina; Yamani, Jana Hashim
Thumbnail
DownloadOsorio_Analytical and scalable.pdf (827.0Kb)
OPEN_ACCESS_POLICY

Open Access Policy

Creative Commons Attribution-Noncommercial-Share Alike

Terms of use
Creative Commons Attribution-Noncommercial-Share Alike http://creativecommons.org/licenses/by-nc-sa/4.0/
Metadata
Show full item record
Abstract
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.
Date issued
2017-01
URI
http://hdl.handle.net/1721.1/111144
Department
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Journal
Transportation Science
Publisher
Institute for Operations Research and the Management Sciences (INFORMS)
Citation
Osorio, Carolina et al. “Analytical and Scalable Analysis of Transient Tandem Markovian Finite Capacity Queueing Networks.” Transportation Science 51, 3 (August 2017): 823–840 © 2017 Institute for Operations Research and the Management Sciences (INFORMS)
Version: Author's final manuscript
ISSN
0041-1655
1526-5447

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries
PrivacyPermissionsAccessibilityContact us
MIT
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.