Tree Switching Protocol for multicast state reduction

Filli Y Y Cheng, Kow Chuen Chang

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-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 languageEnglish
Title of host publicationIEEE Symposium on Computers and Communications - Proceedings
Pages672-677
Number of pages6
Publication statusPublished - 1 Jan 2000
EventISCC 2000 - 5th IEEE Symposium on Computers and Communications -
Duration: 3 Jul 20006 Jul 2000

Conference

ConferenceISCC 2000 - 5th IEEE Symposium on Computers and Communications
Period3/07/006/07/00

ASJC Scopus subject areas

  • Computer Science(all)
  • Engineering(all)

Cite this