Effective bandwidths at multi-class queues
Queueing Systems: Theory and Applications
IEEE/ACM Transactions on Networking (TON)
Performance modeling and management of high-speed networks
Performance modeling and management of high-speed networks
Effective bandwidths for multiclass Markov fluids and other ATM sources
IEEE/ACM Transactions on Networking (TON)
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
MPLS and traffic engineering in IP networks
IEEE Communications Magazine
Traffic engineering standards in IP-networks using MPLS
IEEE Communications Magazine
The complementary roles of RSVP and differentiated services in the full-service QoS network
IEEE Communications Magazine
A virtual path routing algorithm for ATM networks based on the equivalent bandwidth concept
Computer Communications
IEEE Journal on Selected Areas in Communications
IEEE Network: The Magazine of Global Internetworking
Traffic engineering with MPLS in the Internet
IEEE Network: The Magazine of Global Internetworking
Inter-Area Traffic Engineering in a Differentiated Services Network
Journal of Network and Systems Management
Hi-index | 0.00 |
Routing algorithms play a critical role in meeting both the stringent quality of service (QoS) requirements of guaranteed services and the certain QoS requirement of assured services over next-generation multiservice high-speed networks. In this paper, we propose the use of optimal least weight routing (OLWR) algorithm for routing QoS flows in high-speed networks. 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. Effective bandwidth, 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 multiclass service routing in various network topologies. The performance results demonstrated that OLWR outperforms both the multihop least-loaded routing algorithms and the multihop most-loaded routing algorithms in terms of both revenue and carried load.