A tree switching protocol for multicast state reduction

F.Y.Y. Cheng; Kow Chuen Chang

doi:10.1109/ISCC.2000.860716

A tree switching protocol for multicast state reduction

F.Y.Y. Cheng, Kow Chuen Chang

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

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

Original language	English
Title of host publication	ISCC 2000 Proceedings : Fifth IEEE Symposium on Computer and Communications, July 3-6, 2000, Antibes-Juan Les Pins, France
Publisher	IEEE
Pages	672-677
Number of pages	6
ISBN (Print)	0769507220
DOIs	https://doi.org/10.1109/ISCC.2000.860716
Publication status	Published - 2000
Event	IEEE Symposium on Computers and Communications [ISCC] - Duration: 1 Jan 2000 → …

Conference

Conference	IEEE Symposium on Computers and Communications [ISCC]
Period	1/01/00 → …

Keywords

Multicast communication
Telecommunication network routing
Transport protocols
Trees (mathematics)

More information

10.1109/ISCC.2000.860716

Cite this

@inproceedings{d4616d7cbb004092a2fd32468a13e26e,

title = "A tree switching protocol for multicast state reduction",

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",

keywords = "Multicast communication, Telecommunication network routing, Transport protocols, Trees (mathematics)",

author = "F.Y.Y. Cheng and Chang, {Kow Chuen}",

year = "2000",

doi = "10.1109/ISCC.2000.860716",

language = "English",

isbn = "0769507220",

pages = "672--677",

booktitle = "ISCC 2000 Proceedings : Fifth IEEE Symposium on Computer and Communications, July 3-6, 2000, Antibes-Juan Les Pins, France",

publisher = "IEEE",

address = "United States",

note = "IEEE Symposium on Computers and Communications [ISCC] ; Conference date: 01-01-2000",

}

A tree switching protocol for multicast state reduction. / Cheng, F.Y.Y.; Chang, Kow Chuen.
ISCC 2000 Proceedings : Fifth IEEE Symposium on Computer and Communications, July 3-6, 2000, Antibes-Juan Les Pins, France. IEEE, 2000. p. 672-677.

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

TY - GEN

T1 - A tree switching protocol for multicast state reduction

AU - Cheng, F.Y.Y.

AU - Chang, Kow Chuen

PY - 2000

Y1 - 2000

N2 - 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

AB - 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

KW - Multicast communication

KW - Telecommunication network routing

KW - Transport protocols

KW - Trees (mathematics)

U2 - 10.1109/ISCC.2000.860716

DO - 10.1109/ISCC.2000.860716

M3 - Conference article published in proceeding or book

SN - 0769507220

SP - 672

EP - 677

BT - ISCC 2000 Proceedings : Fifth IEEE Symposium on Computer and Communications, July 3-6, 2000, Antibes-Juan Les Pins, France

PB - IEEE

T2 - IEEE Symposium on Computers and Communications [ISCC]

Y2 - 1 January 2000

ER -

A tree switching protocol for multicast state reduction

Abstract

Conference

Keywords

More information

Fingerprint

Cite this