Efficient routing algorithms for group multicast communication
The objectives of the research include propose efficient heuristics for group multicast routing problem; derive a tight lower bound of total tree cost to evaluate the performance of proposed heuristics and increase the success rate of building multicast trees for each of the multicast group members.
Saved in:
Main Author: | |
---|---|
Other Authors: | |
Format: | Theses and Dissertations |
Published: |
2008
|
Subjects: | |
Online Access: | http://hdl.handle.net/10356/3675 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
id |
sg-ntu-dr.10356-3675 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-36752023-07-04T15:08:32Z Efficient routing algorithms for group multicast communication Wang, Ning. Low, Chor Ping School of Electrical and Electronic Engineering DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems The objectives of the research include propose efficient heuristics for group multicast routing problem; derive a tight lower bound of total tree cost to evaluate the performance of proposed heuristics and increase the success rate of building multicast trees for each of the multicast group members. Master of Engineering 2008-09-17T09:35:00Z 2008-09-17T09:35:00Z 2001 2001 Thesis http://hdl.handle.net/10356/3675 Nanyang Technological University application/pdf |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
topic |
DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems |
spellingShingle |
DRNTU::Engineering::Electrical and electronic engineering::Computer hardware, software and systems Wang, Ning. Efficient routing algorithms for group multicast communication |
description |
The objectives of the research include propose efficient heuristics for group multicast routing problem; derive a tight lower bound of total tree cost to evaluate the performance of proposed heuristics and increase the success rate of building multicast trees for each of the multicast group members. |
author2 |
Low, Chor Ping |
author_facet |
Low, Chor Ping Wang, Ning. |
format |
Theses and Dissertations |
author |
Wang, Ning. |
author_sort |
Wang, Ning. |
title |
Efficient routing algorithms for group multicast communication |
title_short |
Efficient routing algorithms for group multicast communication |
title_full |
Efficient routing algorithms for group multicast communication |
title_fullStr |
Efficient routing algorithms for group multicast communication |
title_full_unstemmed |
Efficient routing algorithms for group multicast communication |
title_sort |
efficient routing algorithms for group multicast communication |
publishDate |
2008 |
url |
http://hdl.handle.net/10356/3675 |
_version_ |
1772827484223438848 |