DMCA
Efficient Multicast Routing for Delay-Sensitive Applications (1995)
| Venue: | in Proc. Second Workshop on Protocols for Multimedia Systems (PROMS |
| Citations: | 33 - 0 self |
BibTeX
@INPROCEEDINGS{Sun95efficientmulticast,
author = {Quan Sun and Horst Langendörfer},
title = {Efficient Multicast Routing for Delay-Sensitive Applications},
booktitle = {in Proc. Second Workshop on Protocols for Multimedia Systems (PROMS},
year = {1995},
pages = {452--458}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We give a multicast tree construction method for delay-sensitive applications by first trying to compute a constrained low cost tree spanning as many destination nodes as possible and then applying the shortest path algorithm. Experimental results through simulations show that this method greatly improves the multicast tree cost measure in comparison with the existing shortest path routing schemes, while it maintains a short computation time. Key words: Multicast routing, Tree cost, Delay bound 1 Introduction Multimedia communication often requires multicast support. Moreover, multimedia applications are often high bandwidth and delay sensitive. Therefore it is very important to consider the efficiency and quality of multicast delivery trees [1]. There are generally two types of multicast trees, namely group shared trees and source-based trees. Steiner trees [2] and core-based trees (CBT) [3] [4] are typical examples of group shared trees [1]. The main objective of constructing Steine...
Keyphrases
delay-sensitive application efficient multicast routing path algorithm multicast tree construction method short computation time high bandwidth introduction multimedia communication core-based tree multicast delivery tree steiner tree multicast tree cost measure low cost tree many destination node multicast support source-based tree tree cost multicast routing typical example key word main objective experimental result multicast tree multimedia application
