View Item 

Performance of a shared tree multicast label filter architecture

Access Status
Open access
Authors
Singh, Jaipal
Veeraraghavan, P.
Singh, S.
Date
2005
Type
Conference Paper

Metadata
Show full item record
Citation
Singh, Jaipal and Veeraraghavan, Prakash and Singh, Samar. 2005. Performance of a shared tree multicast label filter architecture, in Borhanuddin Mohd Ali, Mahamod Ismail, Hafizal Mohamad (ed), 13th IEEE International Conference on Networks (ICON), Nov 16 2005. Kuala Lumpur: IEEE Computer Society.
Source Title
Proceedings of the 13th IEEE international conference on networks (ICON)
Source Conference
13th IEEE International Conference on Networks (ICON)
ISBN
School
Digital Ecosystems and Business Intelligence Institute (DEBII)
Remarks

Copyright © 2005 IEEEThis 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.

Curtin – Faculties - Curtin Business School - The Digital Ecosystems and Business Intelligence Institute (DEBII)

URI
Collection
Abstract

This paper defines a new multicast filter algorithm. This algorithm is used to filter packets on a mobile multicast architecture using a multicast shared tree. In a mobile multicast architecture, communications between a corresponding node (source) and the mobile node (receiver) should be private and not be sent to every node (receivers) on the multicast tree. We propose using an algorithm that sets up a label sub-tree on an existing mobile multicast shared tree to filter packets based on these labels. Our proposed label filter architecture is implemented differently to the current MPLS architecture. In this paper, we validate the effectiveness of the label filter in mobile communication compared to the traditional method of creating a new multicast tree by analysing the message and time complexity of the algorithm against the setting up time of a new multicast shared tree.