Shortest-hop based reliable network multicast

K. L.Eddie Law, Daniel Siu

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Although many multicast communication protocols have been recommended at IETF, reliable multicast communications currently rely on programs built at the application layer, e.g., multicast overlay. This is because there is a lack of reliable multicast protocols. This is even harder for the multicast capable routers to offer transparent reliable multicast services if receivers are on paths with drastically different path characteristics. In this paper, concept of multicast reliability integrated within routing algorithm is discussed. It is important to map reliability from transport layer to network layer, and subsequently from network layer to data link layer. The novelty of the proposed design is to offer packet recovery mechanisms between every two intelligent routers. The resulting shortest-hop based reliability eliminates the retransmission request implosion problem and shortens the error recovery session time along any multicast tree. Consequently, the proposed design offers high goodput performance for multicasting important information in wired and wireless networks.

Original languageEnglish
Title of host publicationProceedings of the 3rd Annual Communication Networks and Services Research Conference
Pages16-21
Number of pages6
DOIs
Publication statusPublished - 2005
Externally publishedYes
Event3rd Annual Communication Networks and Services Research Conference, 2005 - Halifa, NS, Canada
Duration: 16 May 200518 May 2005

Publication series

NameProceedings of the 3rd Annual Communication Networks and Services Research Conference
Volume2005

Conference

Conference3rd Annual Communication Networks and Services Research Conference, 2005
Country/TerritoryCanada
CityHalifa, NS
Period16/05/0518/05/05

Fingerprint

Dive into the research topics of 'Shortest-hop based reliable network multicast'. Together they form a unique fingerprint.

Cite this