A tree switching protocol for multicast state reduction

F.Y.Y. Cheng, Kow Chuen Chang

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-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 languageEnglish
Title of host publicationISCC 2000 Proceedings : Fifth IEEE Symposium on Computer and Communications, July 3-6, 2000, Antibes-Juan Les Pins, France
PublisherIEEE
Pages672-677
Number of pages6
ISBN (Print)0769507220
DOIs
Publication statusPublished - 2000
EventIEEE Symposium on Computers and Communications [ISCC] -
Duration: 1 Jan 2000 → …

Conference

ConferenceIEEE Symposium on Computers and Communications [ISCC]
Period1/01/00 → …

Keywords

  • Multicast communication
  • Telecommunication network routing
  • Transport protocols
  • Trees (mathematics)

Cite this