The heuristics for the constrained multicast routing

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

We present in this paper heuristics for the multicast routing problem in communications. Two constraints are considered, namely, the end-to-end delay along the path from the source to any destination is bounded, and the total cost of the edges associated with the problem-defining graph is minimized. It is shown by computer simulation that our proposed heuristics perform significantly better than that of a previous method [8].

Original languageEnglish
Title of host publicationConcurrency and Parallelism, Programming, Networking, and Security - 2nd Asian Computing Science Conference, ASIAN 1996, Proceedings
EditorsJoxan Jaffar, Roland H. C. Yap
PublisherSpringer Verlag
Pages204-212
Number of pages9
ISBN (Print)3540620311, 9783540620310
DOIs
StatePublished - 1996
Event2nd Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security, ASIAN 1996 - Singapore, Singapore
Duration: 2 Dec 19965 Dec 1996

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1179
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference2nd Asian Computing Science Conference on Concurrency and Parallelism, Programming, Networking, and Security, ASIAN 1996
Country/TerritorySingapore
CitySingapore
Period2/12/965/12/96

Fingerprint

Dive into the research topics of 'The heuristics for the constrained multicast routing'. Together they form a unique fingerprint.

Cite this