Abstract
The trend that Internet applications are becoming more various puts forward higher request on Quality of Service (QoS) of coexisting multiservices in modern networks. An on-demand QoS path selection algorithm (marked as BW-cost algorithm) satisfying constrained conditions of both bandwidth and cost is proposed innovatively in this paper, and its usage procedures in OSPF is claimed accordingly. The core idea of the algorithm is choosing the best route satisfying certain bandwidth requirement with smallest cost in order to achieve the goal of splitting streams and balancing load. Simulation results shows the BW-cost algorithm can successfully guarantee multiservices’ QoS demands as well as has much better performance in some targets such as throughput and network utility, comparing to traditional Dijkstra algorithm. It also exceeds en existing on-demand QoS algorithm.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Goel A, Ramakrishnan KG, Katatria D, Logothetis D (2001) Efficient computation of delay-sensitive routes from one source to all destinations. Proc IEEE Infocom 12(5):683–687
Sahoo A (2002) An OSPF based load sensitive QoS routing algorithm using alternate paths. J IEEE 43(43):345–348
Maalaoui K, Belghith A et al (2005) Performance evaluation of QoS routing algorithms. J IEEE 32(3):742–749
Antic M, Maksic N et al (1997) Two phase load balanced routing using OSPF. IEEE J Selected Areas Commun 28(1):64–69
Guerin RA, Orda Williams A (1997) QoS routing mechanisms and OSPF extensions. Proceed IEEE GLOBECOM 19(9):67–73
Apostolopoulos G, Network working group (1999) RFC 2676. QoS routing mechanisms and OSPF extensions 24(2):37–42
Yanwen Hua, Songrong Qian (2006) Research on OSPF extensions supporting QoS routing mechanism. Comput Eng Des 27(3):415–417
Acknowledgments
The research work is supported by the Fundamental Research Funds for the Central Universities (2012RC0120).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this paper
Cite this paper
Li, Y., Li, L. (2013). An On-Demand QoS Routing Algorithm in Multiservice Scenarios. In: Zhong, Z. (eds) Proceedings of the International Conference on Information Engineering and Applications (IEA) 2012. Lecture Notes in Electrical Engineering, vol 219. Springer, London. https://doi.org/10.1007/978-1-4471-4853-1_15
Download citation
DOI: https://doi.org/10.1007/978-1-4471-4853-1_15
Published:
Publisher Name: Springer, London
Print ISBN: 978-1-4471-4852-4
Online ISBN: 978-1-4471-4853-1
eBook Packages: EngineeringEngineering (R0)