research-article

Routing into parallel collision channels

Authors:

Mandar Datar,

Eitan Altman,

Ghilas FerratAuthors Info & Claims

ACM SIGMETRICS Performance Evaluation Review, Volume 48, Issue 2

Pages 15 - 17

https://doi.org/10.1145/3439602.3439609

Published: 25 November 2020 Publication History

Get Access

Abstract

We study a Medium Access game modeled as a splittable atomic routing game in a parallel link topology. Each player has to decide how to split her traffic among the links. We take the expected loss probability of a player as her cost and consider various loss scenarios: 1) the M/M/1/1 queue in which an arrival that finds another packet in service is lost, 2) Losses occur as in 1, except that if arrival occurs when another packet is served, then both are lost. We furthermore assume that the packet in service is aborted if there was a collision. 3) Like 2, but the packet in service is not aborted. We study the existence and uniqueness of equilibrium under these three types of losses.

References

[1]

J. B. Rosen: Existence and Uniqueness of Equilibrium Points for Concave N-Person Games. Econometrica Vol. 33, No. 3 (Jul., 1965), pp. 520--534

Crossref

Google Scholar

[2]

A. Orda, R. Rom and N. Shimkin:Competitive routing in multiuser communication networks. IEEE/ACM Transactions on Networking, vol. 1, no. 5, pp. 510--521, Oct. 1993.

Digital Library

Google Scholar

[3]

Eitan Altman, Joy Kuri, Rachid El-Azouzi. A routing game in networks with lossy links. 7th International Conference on NETwork Games COntrol and OPtimization (NETGCOOP 2014), Oct 2014, Trento, Italy. hal-01066453

Google Scholar

Recommendations

Priority tandem queueing system with retrials and reservation of channels as a model of call center

A tandem queue consisting of two multi-server stations is analyzed.Retrials and impatience of customers are taken into account.Ergodicity condition is derived.Steady state distribution of the system states and performance measures are computed.Numerical ...
A tandem retrial queueing system with two Markovian flows and reservation of channels

We consider a tandem queueing system with single-server first station and multi-server second station. The input flow at Station 1 is described by the BMAP (batch Markovian arrival process). Customers from this flow are considered as non-priority ...
Optimal probabilistic routing in distributed parallel queues

We consider the fundamental problem of routing customers among distributed parallel queues to minimize an objective function based on equilibrium sojourn times under general assumptions for the arrival and service processes and under the assumption that ...

Comments

Information & Contributors

Information

Published In

cover image ACM SIGMETRICS Performance Evaluation Review

ACM SIGMETRICS Performance Evaluation Review Volume 48, Issue 2

September 2020

45 pages

ISSN:0163-5999

DOI:10.1145/3439602

Editor:
Zhenhua Liu
Stony Brook University

Issue’s Table of Contents

Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for third-party components of this work must be honored. For all other uses, contact the Owner/Author.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 November 2020

Published in SIGMETRICS Volume 48, Issue 2

Check for updates

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
36
Total Downloads

Downloads (Last 12 months)7
Downloads (Last 6 weeks)1

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Recommendations

Priority tandem queueing system with retrials and reservation of channels as a model of call center

A tandem retrial queueing system with two Markovian flows and reservation of channels

Optimal probabilistic routing in distributed parallel queues

Comments

Published In

Publisher

Publication History

Check for updates

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Login options

Full Access

PDF

eReader

Abstract

References

Recommendations

Priority tandem queueing system with retrials and reservation of channels as a model of call center

A tandem retrial queueing system with two Markovian flows and reservation of channels

Optimal probabilistic routing in distributed parallel queues

Comments

Information

Published In

Publisher

Publication History

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Get Access

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations