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 language | English (US) |
---|---|
Pages | 827-831 |
Number of pages | 5 |
State | Published - 1997 |
Externally published | Yes |
Event | Proceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3) - Montreal, Can Duration: Jun 8 1997 → Jun 12 1997 |
Other
Other | Proceedings of the 1997 IEEE International Conference on Communications, ICC. Part 3 (of 3) |
---|---|
City | Montreal, Can |
Period | 6/8/97 → 6/12/97 |
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering