DocumentCode :
2582482
Title :
A new routing algorithm for delay-constrained dynamic multicast
Author :
Asaka, Takuya ; Miyoshi, Takumi ; Tanaka, Yoshiaki
Author_Institution :
NTT Service Integration Labs., Tokyo, Japan
fYear :
2000
fDate :
2000
Firstpage :
231
Lastpage :
238
Abstract :
Many new multimedia applications involve dynamic multiple participants, have stringent source-to-end delay requirements, and consume large amounts of network resources. A conventional algorithm that allows “two coming paths”, where nodes in a multicast tree transmit the several identical data flows, is therefore not practical. We have developed an algorithm for delay-constrained dynamic routing. This algorithm uses a QoS label to prevent the occurrence of “two coming paths”, and can construct an efficient multicast tree for any traffic volume. The proposed algorithm was superior to conventional routing algorithms in terms of cost when nodes are added to or removed from the multicast group during a steady-state simulation
Keywords :
delays; multicast communication; multimedia communication; quality of service; telecommunication network routing; QoS label; delay-constrained dynamic multicast; delay-constrained dynamic routing; dynamic multiple participants; multicast tree; multimedia applications; network resources; routing algorithm; source-to-end delay requirements; traffic volume; two coming paths; Costs; Delay; Heuristic algorithms; High-speed networks; Laboratories; Multicast algorithms; Multicast protocols; Routing protocols; Telecommunication traffic; Traffic control;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Universal Multiservice Networks, 2000. ECUMN 2000. 1st European Conference on
Conference_Location :
Colmar
Print_ISBN :
0-7803-6419-8
Type :
conf
DOI :
10.1109/ECUMN.2000.880746
Filename :
880746
Link To Document :
بازگشت