Delay Minimization in a Multicasting Tree
Summary :
This paper investigates the problem of constructing a logical multicasting tree which dispatches data to multiple destinations according to their bandwidth requirements. An optimization problem is formulated to minimize the maximum delay between a sender and multiple receivers. An algorithm of finding the optimum branching locations is presented. Performance analysis from the closed queueing network theory is given to evaluate a multicasting tree network based on this proposed algorithm.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E80-B No.2 pp.301-306
- Publication Date
- 1997/02/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Telecommunications Network Planning and Design)
- Category
- Network and traffic control
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Peifang ZHOU, Oliver W. W. YANG, "Delay Minimization in a Multicasting Tree" in IEICE TRANSACTIONS on Communications,
vol. E80-B, no. 2, pp. 301-306, February 1997, doi: .
Abstract: This paper investigates the problem of constructing a logical multicasting tree which dispatches data to multiple destinations according to their bandwidth requirements. An optimization problem is formulated to minimize the maximum delay between a sender and multiple receivers. An algorithm of finding the optimum branching locations is presented. Performance analysis from the closed queueing network theory is given to evaluate a multicasting tree network based on this proposed algorithm.
URL: https://global.ieice.org/en_transactions/communications/10.1587/e80-b_2_301/_p
Copy
@ARTICLE{e80-b_2_301,
author={Peifang ZHOU, Oliver W. W. YANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Delay Minimization in a Multicasting Tree},
year={1997},
volume={E80-B},
number={2},
pages={301-306},
abstract={This paper investigates the problem of constructing a logical multicasting tree which dispatches data to multiple destinations according to their bandwidth requirements. An optimization problem is formulated to minimize the maximum delay between a sender and multiple receivers. An algorithm of finding the optimum branching locations is presented. Performance analysis from the closed queueing network theory is given to evaluate a multicasting tree network based on this proposed algorithm.},
keywords={},
doi={},
ISSN={},
month={February},}
Copy
TY - JOUR
TI - Delay Minimization in a Multicasting Tree
T2 - IEICE TRANSACTIONS on Communications
SP - 301
EP - 306
AU - Peifang ZHOU
AU - Oliver W. W. YANG
PY - 1997
DO -
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E80-B
IS - 2
JA - IEICE TRANSACTIONS on Communications
Y1 - February 1997
AB - This paper investigates the problem of constructing a logical multicasting tree which dispatches data to multiple destinations according to their bandwidth requirements. An optimization problem is formulated to minimize the maximum delay between a sender and multiple receivers. An algorithm of finding the optimum branching locations is presented. Performance analysis from the closed queueing network theory is given to evaluate a multicasting tree network based on this proposed algorithm.
ER -
English
