Article

Optimal insensitive routing and bandwidth sharing in simple data networks

Authors:

J. VirtamoAuthors Info & Claims

SIGMETRICS '05: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

Pages 193 - 204

https://doi.org/10.1145/1064212.1064235

Published: 06 June 2005 Publication History

Abstract

Many communication systems can be efficiently modelled using queueing networks with a stationary distribution that is insensitive to detailed traffic characteristics and depends on arrival rates and mean service requirements only. This robustness enables simple engineering rules and is thus of considerable practical interest. In this paper we extend previous results by relaxing the usual assumption of static routing and balanced service rates to account for both dynamic capacity allocation and dynamic load balancing. This relaxation is necessary to model systems like grid computing, for instance. Our results identify joint dynamic allocation and routing policies for single input reversible networks that are optimal for a wide range of performance metrics. A simple two-pass algorithm is presented for finding the optimal policy. The derived analytical results are applied in a number of simple numerical examples that illustrate their modelling potential.

References

[1]

T. Bonald, A. Proutière, Insensitivity in processor-sharing networks, Performance Evaluation 49 (2002) 193--209.

Digital Library

[2]

T. Bonald, A. Proutière, Insensitive bandwidth sharing in data networks, Queueing Systems 44-1 (2003) 69--100.

Digital Library

[3]

T. Bonald, M. Jonckheere, A. Proutière, Insensitive load balancing, Sigmetrics/performance (2004) 367--378.

Digital Library

[4]

A. Hordijk, G. Koole, On the assignment of customers to parallel queues, Probability in the Engineering and Informational Sciences 6 (1992) 495--511.

[5]

J. Leino, J. Virtamo, Optimal load balancing in insensitive data networks, Lecture Notes in Computer Science, LNCS 3375, Quality of Service in Multiservice IP Networks, Proc. of QoS-IP 2005, Catania, Italy, Springer-Verlag (2005) 313--324.

Digital Library

[6]

J. van Leeuwaarden, S. Aalto, J. Virtamo, Load balancing in cellular networks using first policy iteration, Technical Report, Networking Laboratory, Helsinki University of Technology, 2001.

[7]

D. Mitra, R.J. Gibbens, B.D. Huang, State dependent routing on symmetric loss networks with trunk reservations, IEEE Transactions on communications 41-2 (1993) 400--411.

[8]

J. Palmer, I. Mitrani, Optimal tree structures for large-scale grids, Technical report, School of Computing Science, University of Newcastle, June 2004.

[9]

S. Oueslati-Boulahia, E. Oubagha, An approach to routing elastic flows, in: Proc. of ITC 16, 1999.

[10]

S. Ben Fredj, T. Bonald, A. Proutière, G. Régnié, J. Roberts, Statiscal bandwidth sharing: a study of congestion at flow level,in: Proc. of ACM SIGCOMM 2001.

Digital Library

[11]

P. Sparaggis, C. Cassandras, D. Towley, Optimal control of multiclass parallel service systems with and without state information, in: proc. of the 32nd Conference on Decision Control, San Antonio, 1993.

[12]

S. Stidham, Optimal control of admission to a queueing system, IEEE Transactions on Automatic Control 30-8 (1985) 705--713.

[13]

A.N. Tantawi and D. Towsley, Optimal static load balancing in distributed computer systems, Journal of the ACM 32-2 (1985) 445--465.

Digital Library

[14]

D. Towsley, D. Panayotis, P. Sparaggis, C. Cassandras, Optimal routing and buffer allocation for a class of finite capacity queueing systems, IEEE Trans. on Automatic Control 37-9 (1992) 1446--1451.

[15]

R. Serfozo, Introduction to stochastic networks,Springer, 1999.

Cited By

Naveen KMassoulie LBaccelli ECarneiro Viana ATowsley DChoffnes DVan der Merwe K(2015)On the Interaction between Content Caching and Request Assignment in Cellular Cache NetworksProceedings of the 5th Workshop on All Things Cellular: Operations, Applications and Challenges10.1145/2785971.2785975(37-42)Online publication date: 17-Aug-2015
https://dl.acm.org/doi/10.1145/2785971.2785975
Ferragut APaganini F(2014)Network resource allocation for users with multiple connectionsIEEE/ACM Transactions on Networking10.1109/TNET.2013.225189622:2(349-362)Online publication date: 1-Apr-2014
https://dl.acm.org/doi/10.1109/TNET.2013.2251896
Pla VVirtamo JMartínez-Bauset JBaras J(2008)Optimal robust policies for bandwidth allocation and admission control in wireless networksProceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools10.4108/ICST.VALUETOOLS2008.4376(1-9)Online publication date: 20-Oct-2008
https://dl.acm.org/doi/10.4108/ICST.VALUETOOLS2008.4376
Show More Cited By

Index Terms

Optimal insensitive routing and bandwidth sharing in simple data networks
1. Mathematics of computing
  1. Probability and statistics

Recommendations

Optimal insensitive routing and bandwidth sharing in simple data networks
Performance evaluation review

Many communication systems can be efficiently modelled using queueing networks with a stationary distribution that is insensitive to detailed traffic characteristics and depends on arrival rates and mean service requirements only. This robustness ...
Insensitivity in processor-sharing networks

We consider an open network of processor-sharing nodes with state-dependent service capacities, i.e., the speed of each node may depend on the number of customers at any node. We demonstrate that the stationary distribution of the network state is ...
Insensitivity for PS server farms with JSQ routing

Join-the-Shortest-Queue (JSQ) is a very old and popular routing policy for server farms. Figure 1 shows two examples of server farm architectures employing JSQ routing. In both cases, each incoming job is immediately dispatched, via a front-end router, ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SIGMETRICS '05: Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems

June 2005

428 pages

ISBN:1595930221

DOI:10.1145/1064212

General Chairs:
Derek Eager
University of Saskatchewan, Canada
,
Carey Williamson
University of Calgary, Canada
,
Program Chairs:
Sem Borst
Bell Labs, USA & CWI, The Netherlands
,
John C. S. Lui
Chinese University of Hong Kong, China

ACM SIGMETRICS Performance Evaluation Review Volume 33, Issue 1
Performance evaluation review
June 2005
417 pages
ISSN:0163-5999
DOI:10.1145/1071690
Issue’s Table of Contents

Copyright © 2005 ACM.

Permission to make digital or hard copies of all or part 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 components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 06 June 2005

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

SIGMETRICS05

Sponsor:

SIGMETRICS05: 2005 ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems

June 6 - 10, 2005

Alberta, Banff, Canada

Acceptance Rates

Overall Acceptance Rate 459 of 2,691 submissions, 17%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
333
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 25 Feb 2025

Other Metrics

View Author Metrics

Citations

Cited By

Naveen KMassoulie LBaccelli ECarneiro Viana ATowsley DChoffnes DVan der Merwe K(2015)On the Interaction between Content Caching and Request Assignment in Cellular Cache NetworksProceedings of the 5th Workshop on All Things Cellular: Operations, Applications and Challenges10.1145/2785971.2785975(37-42)Online publication date: 17-Aug-2015
https://dl.acm.org/doi/10.1145/2785971.2785975
Ferragut APaganini F(2014)Network resource allocation for users with multiple connectionsIEEE/ACM Transactions on Networking10.1109/TNET.2013.225189622:2(349-362)Online publication date: 1-Apr-2014
https://dl.acm.org/doi/10.1109/TNET.2013.2251896
Pla VVirtamo JMartínez-Bauset JBaras J(2008)Optimal robust policies for bandwidth allocation and admission control in wireless networksProceedings of the 3rd International Conference on Performance Evaluation Methodologies and Tools10.4108/ICST.VALUETOOLS2008.4376(1-9)Online publication date: 20-Oct-2008
https://dl.acm.org/doi/10.4108/ICST.VALUETOOLS2008.4376
Coronado ECherkaoui S(2007)An AAA Study for Service Provisioning in Vehicular NetworksProceedings of the 32nd IEEE Conference on Local Computer Networks10.1109/LCN.2007.27(669-676)Online publication date: 15-Oct-2007
https://dl.acm.org/doi/10.1109/LCN.2007.27
Jonckheere M(2006)Insensitive versus efficient dynamic load balancing in networks without blockingQueueing Systems: Theory and Applications10.1007/s11134-006-0066-354:3(193-202)Online publication date: 1-Nov-2006
https://dl.acm.org/doi/10.1007/s11134-006-0066-3
Ferragut APaganini F(2014)Network resource allocation for users with multiple connectionsIEEE/ACM Transactions on Networking10.1109/TNET.2013.225189622:2(349-362)Online publication date: 1-Apr-2014
https://dl.acm.org/doi/10.1109/TNET.2013.2251896
Leino JVirtamo J(2006)Insensitive load balancing in data networksComputer Networks: The International Journal of Computer and Telecommunications Networking10.5555/1143164.164869950:8(1059-1068)Online publication date: 6-Jun-2006
https://dl.acm.org/doi/10.5555/1143164.1648699
Leino JVirtamo J(2006)Insensitive load balancing in data networksComputer Networks10.1016/j.comnet.2005.09.00950:8(1059-1068)Online publication date: Jun-2006
https://doi.org/10.1016/j.comnet.2005.09.009

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten