Packing and least-loaded based routing in multi-rate loss networks

Ibrahim Matta, Marwan Krunz

Research output: Contribution to conferencePaper

15 Scopus citations

Abstract

We examine various schemes for dynamically routing virtual circuits (VCs) in a multi-class network. A VC setup request may be rejected by admission control because resources are either unavailable or being reserved for future incoming VCs. We examine least-loaded based schemes, which attempt to balance the load among available routes. In addition, we examine packing based schemes, which attempt to reduce bandwidth fragmentation possibly at the expense of load balancing. Our simulation results show that under skewed workload, our packing based scheme outperforms a traditional least-loaded based scheme in terms of revenue (or equivalently, network utilization). Under uniform workload, both schemes provide similar revenue.

Original languageEnglish (US)
Pages827-831
Number of pages5
StatePublished - Jan 1 1997
Externally publishedYes
EventProceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3) - Montreal, Can
Duration: Jun 8 1997Jun 12 1997

Other

OtherProceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3)
CityMontreal, Can
Period6/8/976/12/97

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Packing and least-loaded based routing in multi-rate loss networks'. Together they form a unique fingerprint.

  • Cite this

    Matta, I., & Krunz, M. (1997). Packing and least-loaded based routing in multi-rate loss networks. 827-831. Paper presented at Proceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3), Montreal, Can, .