Advertisement
Published in:
2013 | OriginalPaper | Chapter
15. An On-Demand QoS Routing Algorithm in Multiservice Scenarios
Authors : Yanjing Li, Li Li
Published in: Proceedings of the International Conference on Information Engineering and Applications (IEA) 2012
Publisher: Springer London
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.