The Library
Bounding residence times for atomic dynamic routings
Tools
Cao, Zhigang, Chen, Bo, Chen, Xujin and Wang, Changjun (2022) Bounding residence times for atomic dynamic routings. Mathematics of Operations Research, 47 (4). pp. 3261-3281. doi:10.1287/moor.2021.1242 ISSN 0364-765X.
|
PDF
WRAP-bounding-residence-times-atomic-dynamic-routings-Chen-2021.pdf - Accepted Version - Requires a PDF viewer. Download (686Kb) | Preview |
Official URL: https://doi.org/10.1287/moor.2021.1242
Abstract
In this paper, we are concerned with bounding agents’ residence times in the network for a broad class of atomic dynamic routings. We explore novel token techniques to circumvent direct analysis on complicated chain effects of dynamic routing choices. Even though agents may enter the network over time for an infinite number of periods, we prove that under a mild condition, the residence time of every agent is upper bounded (by a network-dependent constant plus the total number of agents inside the network at the entry time of the agent). Applying this result to three game models of atomic dynamic routing in the recent literature, we establish that the residence times of selfish agents in a series-parallel network with a single origin-destination pair are upper bounded at equilibrium, provided the number of incoming agents at each time point does not exceed the network capacity (i.e., the smallest total capacity of edges in the network whose removal separates the origin from the destination).
Item Type: | Journal Article | ||||||||||||||||||||||||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
Subjects: | Q Science > QA Mathematics T Technology > T Technology (General) T Technology > TK Electrical engineering. Electronics Nuclear engineering |
||||||||||||||||||||||||
Divisions: | Faculty of Social Sciences > Warwick Business School > Operational Research & Management Sciences Faculty of Social Sciences > Warwick Business School |
||||||||||||||||||||||||
Library of Congress Subject Headings (LCSH): | Adaptive routing (Computer network management), Queuing networks (Data transmission) | ||||||||||||||||||||||||
Journal or Publication Title: | Mathematics of Operations Research | ||||||||||||||||||||||||
Publisher: | Informs | ||||||||||||||||||||||||
ISSN: | 0364-765X | ||||||||||||||||||||||||
Official Date: | November 2022 | ||||||||||||||||||||||||
Dates: |
|
||||||||||||||||||||||||
Volume: | 47 | ||||||||||||||||||||||||
Number: | 4 | ||||||||||||||||||||||||
Page Range: | pp. 3261-3281 | ||||||||||||||||||||||||
DOI: | 10.1287/moor.2021.1242 | ||||||||||||||||||||||||
Status: | Peer Reviewed | ||||||||||||||||||||||||
Publication Status: | Published | ||||||||||||||||||||||||
Access rights to Published version: | Restricted or Subscription Access | ||||||||||||||||||||||||
Copyright Holders: | Copyright © 2022, INFORMS | ||||||||||||||||||||||||
Date of first compliant deposit: | 22 November 2021 | ||||||||||||||||||||||||
Date of first compliant Open Access: | 18 February 2022 | ||||||||||||||||||||||||
RIOXX Funder/Project Grant: |
|
||||||||||||||||||||||||
Related URLs: |
Request changes or add full text files to a record
Repository staff actions (login required)
View Item |
Downloads
Downloads per month over past year