Result: On multicast communications with minimum resources
Title:
On multicast communications with minimum resources
Source:
High performance computing and communications (First international conference, HPCC 2005, Sorrento, Italy, September 21-23, 2005, proceedings)Lecture notes in computer science. :4-13
Publisher Information:
New York, NY: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 15 ref 1
Original Material:
INIST-CNRS
Subject Terms:
Computer science, Informatique, Telecommunications, Télécommunications, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Informatique; automatique theorique; systemes, Computer science; control theory; systems, Logiciel, Software, Systèmes informatiques et systèmes répartis. Interface utilisateur, Computer systems and distributed systems. User interface, Asymétrie, Asymmetry, Asimetría, Calcul réparti, Distributed computing, Cálculo repartido, Complexité algorithme, Algorithm complexity, Complejidad algoritmo, Complexité temps, Time complexity, Complejidad tiempo, Haute performance, High performance, Alto rendimiento, Multidestinataire, Multicast, Multidestinatario, Méthode heuristique, Heuristic method, Método heurístico, Propagation trajet multiple, Multipath propagation, Propagación trayecto múltiple, Système réparti, Distributed system, Sistema repartido
Document Type:
Conference
Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Department of Computer Engineering, Korea Polytechnic University, 429-793, Gyeonggi-Do, Korea, Republic of
School of Information and Communication Engineering, Sungkyunkwan University, 440-746, Suwon, Korea, Republic of
Carrier Ethernet Team, Electronics and Telecommunications Research Institute, Daejun, Korea, Republic of
School of Information and Communication Engineering, Sungkyunkwan University, 440-746, Suwon, Korea, Republic of
Carrier Ethernet Team, Electronics and Telecommunications Research Institute, Daejun, Korea, Republic of
ISSN:
0302-9743
Rights:
Copyright 2005 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17221640
Database:
PASCAL Archive
Further Information
We have developed and evaluated an efficient heuristic algorithm to construct a multicast tree with the minimum cost. Our algorithm uses multiple candidate paths to select a path from source to each destination, and works on directed asymmetric networks. We also show that our proposed algorithm have a perform gain in terms of tree cost for real life networks over existing algorithm. The time complexity of our algorithm is O(D(m + nlogn)) for a m-arc n-node network with D number of members in the multicast group, and is comparable to well-known algorithm, TM [13], for a multicast tree construction in terms of the time-complexity. We have performed empirical evaluation that compares our algorithms with the others on large networks.