Result: On estimation for reducing multicast delay variation

Title:
On estimation for reducing multicast delay variation
Source:
High performance computing and communications (First international conference, HPCC 2005, Sorrento, Italy, September 21-23, 2005, proceedings)Lecture notes in computer science. :117-122
Publisher Information:
New York, NY: Springer, 2005.
Publication Year:
2005
Physical Description:
print, 5 ref 1
Original Material:
INIST-CNRS
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
School of Information and Communication Engineering, Sungkyunkwan University, 440-746, Suwon, Korea, Republic of
Department of Computer Engineering, Korea Polytechnic University, 429-793, Gyeonggi-Do, 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
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.17221648
Database:
PASCAL Archive

Further Information

The core-based multicast routing protocol plays a significant role in many multimedia applications such as video-conferencing, replicated database updating and querying, and etc. However, existing core-based multicast routing protocols construct only the shortest paths between the core and the members in a multicast group without optimizing the quality of service requirements. In this paper, we propose an efficient algorithm for multicast delay variations and tree cost. The efficiency of our algorithm is verified through the performance evaluation and the enhancements are up to about 2.5% ∼ 4.5% and 3.8% ∼ 15.5% in terms of the multicast delay variation and the tree cost, respectively. The time complexity of our algorithm is O{m{l + nlogn)).