Tree Switching Protocol for multicast state reduction

Filli Y Y Cheng; Kow Chuen Chang

Tree Switching Protocol for multicast state reduction

Filli Y Y Cheng, Kow Chuen Chang

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

6 Citations (Scopus)

Abstract

In this paper, 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	IEEE Symposium on Computers and Communications - Proceedings
Pages	672-677
Number of pages	6
Publication status	Published - 1 Jan 2000
Event	ISCC 2000 - 5th IEEE Symposium on Computers and Communications - Duration: 3 Jul 2000 → 6 Jul 2000

Conference

Conference	ISCC 2000 - 5th IEEE Symposium on Computers and Communications
Period	3/07/00 → 6/07/00

ASJC Scopus subject areas

General Computer Science
General Engineering

Cite this

@inproceedings{cbfc497c9f694f5b8c931b15a73bf74c,

title = "Tree Switching Protocol for multicast state reduction",

abstract = "In this paper, 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.",

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

year = "2000",

month = jan,

day = "1",

language = "English",

pages = "672--677",

booktitle = "IEEE Symposium on Computers and Communications - Proceedings",

note = "ISCC 2000 - 5th IEEE Symposium on Computers and Communications ; Conference date: 03-07-2000 Through 06-07-2000",

}

TY - GEN

T1 - Tree Switching Protocol for multicast state reduction

AU - Cheng, Filli Y Y

AU - Chang, Kow Chuen

PY - 2000/1/1

Y1 - 2000/1/1

N2 - In this paper, 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 - In this paper, 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.

UR - http://www.scopus.com/inward/record.url?scp=0033727114&partnerID=8YFLogxK

M3 - Conference article published in proceeding or book

SP - 672

EP - 677

BT - IEEE Symposium on Computers and Communications - Proceedings

T2 - ISCC 2000 - 5th IEEE Symposium on Computers and Communications

Y2 - 3 July 2000 through 6 July 2000

ER -

Tree Switching Protocol for multicast state reduction

Abstract

Conference

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this