One-dimensional service networks and batch service queues

Philippe Nain (), Nitish K. Panigrahy (), Prithwish Basu () and Don Towsley ()
Additional contact information
Philippe Nain: Inria Grenoble - Rhône-Alpes
Nitish K. Panigrahy: University of Massachusetts Amherst
Prithwish Basu: Raytheon BBN Technologies
Don Towsley: University of Massachusetts Amherst

Queueing Systems: Theory and Applications, 2021, vol. 98, issue 1, No 7, 207 pages

Abstract: Abstract The proliferation of smart devices, computational and storage resources is predicted to continue aggressively in the near future. Such “networked” devices and resources which are distributed in a physical space and provide services are collectively referred to as a distributed service network. Assigning users or applications to available resources is important to sustain high performance of the distributed service network. In this work, we consider a one-dimensional service network where both users and resources are located on a line, and analyze a unidirectional assignment policy Move To Right (MTR), which sequentially assigns users to resources available to their right. We express the communication cost for a user-resource assignment as an increasing function of the distance traveled by the user request (request distance) and analyze the expected communication cost for the service network when locations of users and resources are modeled by different spatial point processes. We use results from the literature that map the request distance of an assigned user in a one-dimensional service network to the sojourn time of a customer in an exceptional service accessible batch queueing system. We compute the Laplace–Stieltjes transform of the sojourn time distribution for this queueing system for Poisson distributed users with general inter-resource distance distributions and in the process also generate new results for batch service queues. Unlike previous work (Panigrahy et al. in Perform Eval 142:102, 2020), our framework not only captures the first-order moment of the request distance, but also the request distance distribution itself, thus allowing us to compute the expected communication cost under different cost models.

Keywords: Batch service queues; Accessible batch queues; Resource allocation; Communication cost; One-dimensional networks; Primary 68M20; Secondary 60K25 (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s11134-021-09703-0 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:queues:v:98:y:2021:i:1:d:10.1007_s11134-021-09703-0

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/11134/

DOI: 10.1007/s11134-021-09703-0

Access Statistics for this article

Queueing Systems: Theory and Applications is currently edited by Sergey Foss

More articles in Queueing Systems: Theory and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().