Packing and Least-Loaded Based Routing in Multi-Rate Loss Networks

摘要

We examine various schemes ]or 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 leastloaded based schemes, which attempt to balance the load among available routes. In addition, we examine pack ing based schemes, which attempt to reduce bandwidth fragmentation possibly at the expense of load balanc ing. Our simulation results show that under skewed workload, our packing based scheme outperforms a tra ditional least-loaded based scheme in terms of revenue (or equivalently, network utilization). Under uniform workload, both schemes provide similar revenue.