Overlay multicast routing algorithm with delay and delay variation constraints

Authors:
Longxin Lin;Jie Zhou;Zhao Ye
Affiliations:
School of Computer Science and Engineering, South China University of Technology, Guangzhou, China;School of Computer Science and Engineering, South China University of Technology, Guangzhou, China;School of Computer Science and Engineering, South China University of Technology, Guangzhou, China
Venue:
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Year:
2007

Citing 8
Cited 0

Bayeux: an architecture for scalable and fault-tolerant wide-area data dissemination

NOSSDAV '01 Proceedings of the 11th international workshop on Network and operating systems support for digital audio and video
SplitStream: high-bandwidth multicast in cooperative environments

SOSP '03 Proceedings of the nineteenth ACM symposium on Operating systems principles
Scattercast: an adaptable broadcast distribution framework

Multimedia Systems
Multicast Routing with Delay and Delay Variation Constraints for Collaborative Applications on Overlay Networks

IEEE Transactions on Parallel and Distributed Systems
How to model an internetwork

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
A fast and efficient heuristic algorithm for the delay- and delay variation-bounded multicast tree problem

Computer Communications
Multicast routing with end-to-end delay and delay variation constraints

IEEE Journal on Selected Areas in Communications
Scribe: a large-scale and decentralized application-level multicast infrastructure

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Overlay multicast is considered as a very effective technique to provide large-scale data dissemination over Internet. In overlay multicast, some applications require the messages should arrive at the destinations within a specified delay bound and these applications also require that the destinations receive the messages from source at approximately the same time. It is defined as the problem of Delay and delay Variation Bounded Multicasting Network (DVBMN) and has been proved to be an NP complete problem. In this paper, by improving the CHAINS algorithm, we present a more efficient heuristic algorithm FCHAINS. We have proved the correctness of our algorithm theoretically, and shown that our algorithm is obviously better than CHAINS in terms of time complexity by performance experiments.