Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/30517
Title: A tree switching protocol for multicast state reduction
Authors: Cheng, FYY
Chang, RKC 
Keywords: Multicast communication
Telecommunication network routing
Transport protocols
Trees (mathematics)
Issue Date: 2000
Publisher: IEEE
Source: ISCC 2000 Proceedings : Fifth IEEE Symposium on Computer and Communications, July 3-6, 2000, Antibes-Juan Les Pins, France, p. 672-677 How to cite?
Abstract: We propose a new tree switching protocol (TSP) to reduce multicast routing states required for a forest of multicast trees. The protocol accomplishes this goal by selecting a base multicast tree and “switching” other multicast trees to the base tree. This results in more overlapping among the multicast trees and a net reduction in multicast state. A further reduction in the state is possible by applying state aggregation to the overlapped tree branches. Simulation results show that the tree switching operation alone could result in a very significant state reduction. The TSP is a distributed protocol running on top of any protocol independent multicast routing protocols. It is also loop-free and very efficient
URI: http://hdl.handle.net/10397/30517
ISBN: 0-7695-0722-0
DOI: 10.1109/ISCC.2000.860716
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

WEB OF SCIENCETM
Citations

2
Last Week
0
Last month
0
Citations as of Oct 17, 2017

Page view(s)

6,376
Last Week
5,099
Last month
Checked on Oct 15, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.