Searching for just a few words should be enough to get started. If you need to make more complex queries, use the tips below to guide you.
Article type: Research Article
Authors: Sun, Quan; | Langendörfer, Horst
Affiliations: Institute of Operating Systems and Computer Networks, Technical University of Braunschweig, Bültenweg 74/75, 38106 Braunschweig, Germany E‐mail: [email protected]‐bs.de
Note: [] Corresponding author.
Abstract: An efficient delay‐constrained multicast routing algorithm computing low cost delay‐constrained multicast trees with small algorithm complexity is proposed in this paper. The proposed algorithm can be used to compare cost performances of the existing or future multicast routing algorithms that provide quality of service (QoS) guarantees, especially in multicast routing simulation environments which simulate relatively large networks and consider realistic network conditions. The proposed algorithm is also useful for routing real‐time multicast data in high‐speed networks if adequate global information is available to the source.
Keywords: Multicast routing algorithm, delay constraint, tree cost
Journal: Journal of High Speed Networks, vol. 7, no. 1, pp. 43-55, 1998
IOS Press, Inc.
6751 Tepper Drive
Clifton, VA 20124
USA
Tel: +1 703 830 6300
Fax: +1 703 830 2300
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
IOS Press
Nieuwe Hemweg 6B
1013 BG Amsterdam
The Netherlands
Tel: +31 20 688 3355
Fax: +31 20 687 0091
[email protected]
For editorial issues, permissions, book requests, submissions and proceedings, contact the Amsterdam office [email protected]
Inspirees International (China Office)
Ciyunsi Beili 207(CapitaLand), Bld 1, 7-901
100025, Beijing
China
Free service line: 400 661 8717
Fax: +86 10 8446 7947
[email protected]
For editorial issues, like the status of your submitted paper or proposals, write to [email protected]
如果您在出版方面需要帮助或有任何建, 件至: [email protected]