DocumentCode :
1890637
Title :
Supporting a multicast communication for large scale groups
Author :
El-Derini, M.N. ; Aly, H.H. ; Yassin, M.A.
Author_Institution :
Comput. & Autom. Control Dept., Alexandria Univ., Egypt
fYear :
2002
fDate :
2002
Firstpage :
7
Lastpage :
11
Abstract :
Recently, there has been a growing interest in multicast communication, in which a group of applications works together and a multicast message is sent to only the members of the desired group. New multicast algorithms are required to increase the efficiency of multicast communication. Current multicast algorithms, such as the source-based tree algorithms, become inefficient, especially in the case of large-scale groups, due to the large amount of stored data. The shared based tree (SBT) algorithms are more efficient than the source-based tree algorithms, because they use a single spanning tree shared by all members. But in case of large groups, these algorithms do not try to make use of the large size to reduce the total overhead of sending messages. We present a mechanism belonging to the SBT family to enhance the performance of multicast communication over large scale multicast groups.
Keywords :
multicast communication; protocols; telecommunication network routing; trees (mathematics); large scale groups; multicast communication; multicast protocol; routers; shared based tree algorithms; source-based tree algorithms; spanning tree; Algorithm design and analysis; Application software; Automatic control; Data flow computing; Large-scale systems; Multicast algorithms; Multicast communication; Multicast protocols; Routing protocols; Scalability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Electrotechnical Conference, 2002. MELECON 2002. 11th Mediterranean
Print_ISBN :
0-7803-7527-0
Type :
conf
DOI :
10.1109/MELECON.2002.1014515
Filename :
1014515
Link To Document :
بازگشت