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 |