Multicast Routing in GMPLS Networks with Unequal Branching Capability
Summary :
In this letter, we study dynamic multicasting in GMPLS networks with unequal branching capability. An overlapped multicasting tree is proposed to reduce blocking probability, which can utilize the branching capabilities more efficiently than the traditional Steiner tree. A nearest node branch first heuristic is developed to find such an overlapped tree.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E88-B No.4 pp.1682-1684
- Publication Date
- 2005/04/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietcom/e88-b.4.1682
- Type of Manuscript
- LETTER
- Category
- Switching for Communications
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
Peigang HU, Yaohui JIN, Weisheng HU, Yikai SU, Wei GUO, Chunlei ZHANG, Hao HE, Weiqiang SUN, "Multicast Routing in GMPLS Networks with Unequal Branching Capability" in IEICE TRANSACTIONS on Communications,
vol. E88-B, no. 4, pp. 1682-1684, April 2005, doi: 10.1093/ietcom/e88-b.4.1682.
Abstract: In this letter, we study dynamic multicasting in GMPLS networks with unequal branching capability. An overlapped multicasting tree is proposed to reduce blocking probability, which can utilize the branching capabilities more efficiently than the traditional Steiner tree. A nearest node branch first heuristic is developed to find such an overlapped tree.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.4.1682/_p
Copy
@ARTICLE{e88-b_4_1682,
author={Peigang HU, Yaohui JIN, Weisheng HU, Yikai SU, Wei GUO, Chunlei ZHANG, Hao HE, Weiqiang SUN, },
journal={IEICE TRANSACTIONS on Communications},
title={Multicast Routing in GMPLS Networks with Unequal Branching Capability},
year={2005},
volume={E88-B},
number={4},
pages={1682-1684},
abstract={In this letter, we study dynamic multicasting in GMPLS networks with unequal branching capability. An overlapped multicasting tree is proposed to reduce blocking probability, which can utilize the branching capabilities more efficiently than the traditional Steiner tree. A nearest node branch first heuristic is developed to find such an overlapped tree.},
keywords={},
doi={10.1093/ietcom/e88-b.4.1682},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Multicast Routing in GMPLS Networks with Unequal Branching Capability
T2 - IEICE TRANSACTIONS on Communications
SP - 1682
EP - 1684
AU - Peigang HU
AU - Yaohui JIN
AU - Weisheng HU
AU - Yikai SU
AU - Wei GUO
AU - Chunlei ZHANG
AU - Hao HE
AU - Weiqiang SUN
PY - 2005
DO - 10.1093/ietcom/e88-b.4.1682
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 4
JA - IEICE TRANSACTIONS on Communications
Y1 - April 2005
AB - In this letter, we study dynamic multicasting in GMPLS networks with unequal branching capability. An overlapped multicasting tree is proposed to reduce blocking probability, which can utilize the branching capabilities more efficiently than the traditional Steiner tree. A nearest node branch first heuristic is developed to find such an overlapped tree.
ER -
English
