View Item 

Multicast QoS Routing Using Collaborative Path Exploration

Access Status
Open access
Authors
Singh, Jaipal
Date
2010
Type
Conference Paper

Metadata
Show full item record
Citation
Singh, J. 2010. Multicast QoS Routing Using Collaborative Path Exploration, in Rahayu, W. and Xhafa, F. and Denko, M. (ed), IEEE 24th International Conference on Advanced Information Networking and Applications (AINA 2010), Apr 20 2010, pp. 120-125. Perth, WA: IEEE.
Source Title
Proceedings of the IEEE 24th international conference on advanced information networking and applications (AINA 2010)
Source Conference
IEEE 24th International Conference on Advanced Information Networking and Applications (AINA 2010)
DOI
ISBN
School
Digital Ecosystems and Business Intelligence Institute (DEBII)
Remarks

Copyright © 2010 IEEE This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.

URI
Collection
Abstract

Quality of Service (QoS) is one of the most active research areas in networking. The most fundamental requirement for QoS routing is the ability to find and maintain a network path that provides the required network resources between two or more nodes. In this paper, we present a distributed collaborative multicast QoS routing architecture that uses a semi-greedy probing heuristic to quickly find a QoS path between a joining node and the multicast tree. The proposed architecture will enable the routers along the path to intelligently and dynamically discover a QoS path. Any router that receives a probe will only know its neighbours and it will create a link to the previous router from where the probe comes from. The proposed architecture is a tree-initiated QoS search and the first QoS packet to reach the joining node will be used as the QoS path. Analysis of this method shows that the path search time and message overhead is lower than other similar schemes.