A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem
More and more multicast communications are becoming real-time. In real-time communications, messages must be transmitted to their destination nodes within a certain amount of time; otherwise the messages will be rendered futile. To support real-time multicast communications, computer networks have t...
Saved in:
Published in | Computer communications Vol. 25; no. 8; pp. 825 - 833 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Elsevier B.V
15.05.2002
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!