On multicasting with minimum end-to-end delay

Young Cheol Bang; S. Radhakrishnan; N. S.V. Rao; Steven G. Batsell

doi:10.1109/ICCCN.1999.805580

On multicasting with minimum end-to-end delay

Young Cheol Bang, S. Radhakrishnan, N. S.V. Rao, Steven G. Batsell

Autonomous and Complex Systems

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

6 Scopus citations

Abstract

We develop and evaluate several heuristics for the construction of a multicast tree to transmit a given message of size r from a source to a set of destinations with guarantees on the end-to-end delay over a computer network. Different multicast trees can be constructed for various values of r. We consider delay sources on links to be from propagation and bandwidth availability. The heuristics that we have developed try to minimize the end-to-end delay of the multicast tree taking into consideration various switching architectures that range from pipeline to store-and-forward. Our evaluations of these heuristics consider various network generation models including locality, Waxman I and II, and transit-stub. We have evaluated multicast tree generation heuristics based on both shortest path and Steiner tree heuristics. A novel heuristic called grow-tree is proposed in this paper and it is based on both Kruskal's and Prim's minimum spanning tree algorithm. This heuristic performs admirably well in many network environments.

Original language	English
Title of host publication	Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999
Editors	Arun Somani, EK Park, Sudhir Dixit
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	604-609
Number of pages	6
ISBN (Print)	0780357949, 9780780357945
DOIs	https://doi.org/10.1109/ICCCN.1999.805580
State	Published - 1999
Event	8th International Conference on Computer Communications and Networks, ICCCN 1999 - Boston, United States Duration: Oct 11 1999 → Oct 13 1999

Publication series

Name	Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999

Conference

Conference	8th International Conference on Computer Communications and Networks, ICCCN 1999
Country/Territory	United States
City	Boston
Period	10/11/99 → 10/13/99

Access to Document

10.1109/ICCCN.1999.805580

Cite this

Bang, Y. C., Radhakrishnan, S., Rao, N. S. V., & Batsell, S. G. (1999). On multicasting with minimum end-to-end delay. In A. Somani, EK. Park, & S. Dixit (Eds.), Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999 (pp. 604-609). Article 805580 (Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCCN.1999.805580

Bang, Young Cheol ; Radhakrishnan, S. ; Rao, N. S.V. et al. / On multicasting with minimum end-to-end delay. Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999. editor / Arun Somani ; EK Park ; Sudhir Dixit. Institute of Electrical and Electronics Engineers Inc., 1999. pp. 604-609 (Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999).

@inproceedings{a641c54914de4aa4823ec646925c18cf,

title = "On multicasting with minimum end-to-end delay",

abstract = "We develop and evaluate several heuristics for the construction of a multicast tree to transmit a given message of size r from a source to a set of destinations with guarantees on the end-to-end delay over a computer network. Different multicast trees can be constructed for various values of r. We consider delay sources on links to be from propagation and bandwidth availability. The heuristics that we have developed try to minimize the end-to-end delay of the multicast tree taking into consideration various switching architectures that range from pipeline to store-and-forward. Our evaluations of these heuristics consider various network generation models including locality, Waxman I and II, and transit-stub. We have evaluated multicast tree generation heuristics based on both shortest path and Steiner tree heuristics. A novel heuristic called grow-tree is proposed in this paper and it is based on both Kruskal's and Prim's minimum spanning tree algorithm. This heuristic performs admirably well in many network environments.",

author = "Bang, {Young Cheol} and S. Radhakrishnan and Rao, {N. S.V.} and Batsell, {Steven G.}",

note = "Publisher Copyright: {\textcopyright} 1999 IEEE.; 8th International Conference on Computer Communications and Networks, ICCCN 1999 ; Conference date: 11-10-1999 Through 13-10-1999",

year = "1999",

doi = "10.1109/ICCCN.1999.805580",

language = "English",

isbn = "0780357949",

series = "Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "604--609",

editor = "Arun Somani and EK Park and Sudhir Dixit",

booktitle = "Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999",

}

Bang, YC, Radhakrishnan, S, Rao, NSV & Batsell, SG 1999, On multicasting with minimum end-to-end delay. in A Somani, EK Park & S Dixit (eds), Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999., 805580, Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999, Institute of Electrical and Electronics Engineers Inc., pp. 604-609, 8th International Conference on Computer Communications and Networks, ICCCN 1999, Boston, United States, 10/11/99. https://doi.org/10.1109/ICCCN.1999.805580

On multicasting with minimum end-to-end delay. / Bang, Young Cheol; Radhakrishnan, S.; Rao, N. S.V. et al.
Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999. ed. / Arun Somani; EK Park; Sudhir Dixit. Institute of Electrical and Electronics Engineers Inc., 1999. p. 604-609 805580 (Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - On multicasting with minimum end-to-end delay

AU - Bang, Young Cheol

AU - Radhakrishnan, S.

AU - Rao, N. S.V.

AU - Batsell, Steven G.

PY - 1999

Y1 - 1999

N2 - We develop and evaluate several heuristics for the construction of a multicast tree to transmit a given message of size r from a source to a set of destinations with guarantees on the end-to-end delay over a computer network. Different multicast trees can be constructed for various values of r. We consider delay sources on links to be from propagation and bandwidth availability. The heuristics that we have developed try to minimize the end-to-end delay of the multicast tree taking into consideration various switching architectures that range from pipeline to store-and-forward. Our evaluations of these heuristics consider various network generation models including locality, Waxman I and II, and transit-stub. We have evaluated multicast tree generation heuristics based on both shortest path and Steiner tree heuristics. A novel heuristic called grow-tree is proposed in this paper and it is based on both Kruskal's and Prim's minimum spanning tree algorithm. This heuristic performs admirably well in many network environments.

AB - We develop and evaluate several heuristics for the construction of a multicast tree to transmit a given message of size r from a source to a set of destinations with guarantees on the end-to-end delay over a computer network. Different multicast trees can be constructed for various values of r. We consider delay sources on links to be from propagation and bandwidth availability. The heuristics that we have developed try to minimize the end-to-end delay of the multicast tree taking into consideration various switching architectures that range from pipeline to store-and-forward. Our evaluations of these heuristics consider various network generation models including locality, Waxman I and II, and transit-stub. We have evaluated multicast tree generation heuristics based on both shortest path and Steiner tree heuristics. A novel heuristic called grow-tree is proposed in this paper and it is based on both Kruskal's and Prim's minimum spanning tree algorithm. This heuristic performs admirably well in many network environments.

UR - http://www.scopus.com/inward/record.url?scp=1542597085&partnerID=8YFLogxK

U2 - 10.1109/ICCCN.1999.805580

DO - 10.1109/ICCCN.1999.805580

M3 - Conference contribution

AN - SCOPUS:1542597085

SN - 0780357949

SN - 9780780357945

T3 - Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999

SP - 604

EP - 609

BT - Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999

A2 - Somani, Arun

A2 - Park, EK

A2 - Dixit, Sudhir

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 8th International Conference on Computer Communications and Networks, ICCCN 1999

Y2 - 11 October 1999 through 13 October 1999

ER -

Bang YC, Radhakrishnan S, Rao NSV, Batsell SG. On multicasting with minimum end-to-end delay. In Somani A, Park EK, Dixit S, editors, Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999. Institute of Electrical and Electronics Engineers Inc. 1999. p. 604-609. 805580. (Proceedings - 8th International Conference on Computer Communications and Networks, ICCCN 1999). doi: 10.1109/ICCCN.1999.805580

On multicasting with minimum end-to-end delay

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this