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

Ibrahim Matta, Marwan M Krunz

Research output: Chapter in Book/Report/Conference proceedingConference contribution

14 Citations (Scopus)

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)
Title of host publicationIEEE International Conference on Communications
PublisherIEEE
Pages827-831
Number of pages5
Volume2
StatePublished - 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

Fingerprint

Networks (circuits)
Access control
Resource allocation
Bandwidth

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Matta, I., & Krunz, M. M. (1997). Packing and least-loaded based routing in multi-rate loss networks. In IEEE International Conference on Communications (Vol. 2, pp. 827-831). IEEE.

Packing and least-loaded based routing in multi-rate loss networks. / Matta, Ibrahim; Krunz, Marwan M.

IEEE International Conference on Communications. Vol. 2 IEEE, 1997. p. 827-831.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Matta, I & Krunz, MM 1997, Packing and least-loaded based routing in multi-rate loss networks. in IEEE International Conference on Communications. vol. 2, IEEE, pp. 827-831, Proceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3), Montreal, Can, 6/8/97.
Matta I, Krunz MM. Packing and least-loaded based routing in multi-rate loss networks. In IEEE International Conference on Communications. Vol. 2. IEEE. 1997. p. 827-831
Matta, Ibrahim ; Krunz, Marwan M. / Packing and least-loaded based routing in multi-rate loss networks. IEEE International Conference on Communications. Vol. 2 IEEE, 1997. pp. 827-831
@inproceedings{9303cf8fd16144d29f97862854f46236,
title = "Packing and least-loaded based routing in multi-rate loss networks",
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.",
author = "Ibrahim Matta and Krunz, {Marwan M}",
year = "1997",
language = "English (US)",
volume = "2",
pages = "827--831",
booktitle = "IEEE International Conference on Communications",
publisher = "IEEE",

}

TY - GEN

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

AU - Matta, Ibrahim

AU - Krunz, Marwan M

PY - 1997

Y1 - 1997

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0030721918&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030721918&partnerID=8YFLogxK

M3 - Conference contribution

VL - 2

SP - 827

EP - 831

BT - IEEE International Conference on Communications

PB - IEEE

ER -