An Improved QoS Routing Algorithm in Internet

Hong Bo Huang; Yong Zhi Wang

doi:10.4028/www.scientific.net/AMM.443.487

Paper Titles

The Building of College Network Experiment Platform for IPv6 QoS
p.468

Study on the Security of the Databases in Cloud Computing Environment
p.473

Research of Distributed Cache Technology Based on Cloud Computing
p.477

Research on Wireless Sensor Networks Based on Data Acquisition Technology
p.482

An Improved QoS Routing Algorithm in Internet
p.487

Research on File System Event Monitoring in Android Platform
p.494

A New Network Security Evaluation Conceptual Model
p.499

Construction and Algorithm Analysis of a Social Network System Structure Based on P2P
p.504

The Study on Wireless Sensor Network Topological Structure for Improving Network Energy Utilization
p.509

HomeApplied Mechanics and MaterialsApplied Mechanics and Materials Vol. 443An Improved QoS Routing Algorithm in Internet

An Improved QoS Routing Algorithm in Internet

Abstract:

An Efficient Routing Algorithm for Improving the QoS in Internet has been proposed and presented in this paper. The algorithm is a kind of Multi Constrained Path algorithm. The routing take place based on more than one link weight components. To avoid the NP complete problem and to increase the computational efficiency some advancement are added. These include the definition of Non Linear Path Length, where the sub paths may not be the shortest path, having k no of shortest paths in a node instead of having only the shortest path, then removing the path dominancy for state space reduction. As a last the concept look ahead is also included through which a predicted path to destination is mapped. This work only implements the removal of path dominancy where the queue is updated by removing the dominated paths from the queue. The simulation is also showing the better performance of the system.

You might also be interested in these eBooks

Computer-Aided Design, Manufacturing, Modeling and Simulation III

View Preview

Info:

Periodical:

Applied Mechanics and Materials (Volume 443)

Pages:

487-493

DOI:

https://doi.org/10.4028/www.scientific.net/AMM.443.487

Citation:

Cite this paper

Online since:

October 2013

Authors:

Hong Bo Huang, Yong Zhi Wang

Keywords:

Internet, QoS, Routing Algorithm

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] Piet Van Mieghem and Fernando A. Kuipers. Concept of Exact QoS Routing Algorithms, IEEE/ACM Transaction on Networking 45(3), 56-58 (2009).

Google Scholar

[2] G. Apostolopoulos, D. Williams, S. Kamart, R. Guerin, A. Orda and T. Przygienda. QoS routing mechanism and OSPF extensions, RFC 2676, Networking Group 23(3), 45-47 (2008).

DOI: 10.17487/rfc2676

Google Scholar

[3] S. Chen and K. Nahrstedt. On Finding multi – constrained paths, in Proc. IC conf, New York 24(3), 2-4 (1998).

Google Scholar

[4] M. I. Henig. The shortest path problem with two objective functions, Eur. J. Oper, Res 25(13), 46-49 (2007).

Google Scholar

[5] J. M. Jaffe. Algorithm for finding paths with multiple constraints, Networks 14(9), 9-10 (2006).

Google Scholar

[6] T. Korkmaz and M. Krunz. A randomized algorithm for finding path subject to multiple QoS routing requirements, Compute, Networks 36(3), 15-18 (2001).

DOI: 10.1016/s1389-1286(00)00209-7

Google Scholar

[7] G. Liu and K. G. Ramakrishnan. An algorithm for finding K shortest paths subject to multiple constraints, In proc, Ieee Infocom 2(24), 146-149 (2009).

Google Scholar

[8] A Orda. Routing with end to end QoS guarantees in broadband networks, Ieee/Acm Trans, Networking 7(33), 22-24 (2008).

DOI: 10.1109/90.779205

Google Scholar