Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/3743
Title: Group multicast routing
Authors: Wong, Heng Ming.
Keywords: DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems
Issue Date: 2000
Abstract: Multicast is a communication abstract in which a source sends messages to a group of destinations. Group multicast refers to a kind of multicast where only members of a group can multicast to the group and every member is able to multicast to the group. Group multicast is an important tool to implement group coordinations, groupware and conferencing systems. An example of such an application is a video conferencing system where each message multicast by a presenter must be received by all the participants and every participant can be a presenter. In such real-time multimedia applications, the ability to transmit information with bounded end-to-end delay while minimizing network cost by sharing network bandwidth is an important goal. The objective of group multicast is to find a set of routing trees that is able to meet these quality of service requirements. In the research project, we proposed two routing heuristics, the Constrained Group TM (CGTM) algorithm and the Constrained Group KMB (CGKMB) algorithm for finding constrained group multicast trees. The performance of the two algorithms were then compared against one another and the CGTM algorithm was found to have better cost performance than the CGKMB algorithm. The tradeoff was that the CGTM algorithm had higher average delays as compared to the CGKMB algorithm.
URI: http://hdl.handle.net/10356/3743
Rights: Nanyang Technological University
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:EEE Theses

Files in This Item:
File Description SizeFormat 
EEE-THESES_1575.pdf
  Restricted Access
8.16 MBAdobe PDFView/Open

Page view(s)

229
Updated on Nov 29, 2020

Download(s) 50

2
Updated on Nov 29, 2020

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.