Optimal Least Weight Routing Algorithm for Guaranteed Bandwidth Flows

摘要

In this paper, we propose the use of Optimal Least Weight Routing (OLWR) Algorithm for routing guaranteed bandwidth VCs (flows) in high-speed networks, such as ATM and next generation Internet. The main principle of our algorithm is that the choice of the most appropriate route, is based on a set of parameters (least weight parameters) that estimate and consider the impact that, the acceptance and routing decision of a call request belonging to a specific class, would have on the network and other classes of service. Bandwidth and Trunk Reservation techniques, along with load balancing and packing trade off considerations, are also introduced in the proposed routing algorithm. The performance evaluation of our algorithm is achieved via modeling and simulation of multi-class service routing in VP-based networks. The performance results demonstrated that OLWR outperforms both the least-loaded routing algorithms and the most-loaded routing algorithms in terms of both revenue and carried load.