A Fast and Efficient Explicit Multicast Routing Protocol
Summary :
The state-oriented design of IP multicast may lead to the scalability problem, especially when there is a very large number of concurrent multicast groups in the network. Motivated by this problem, explicit multicast offers a stateless design using header space of multicast data packets. In this paper, we propose a novel stateless scheme called Linkcast that efficiently eliminates processing overhead of explicit multicast protocols. In Linkcast, the multicast sender encodes the tree listing its links in a proper way. The tree code is sent with every multicast data packet. Simulation results and experiments with real-trees show that Linkcast completely eliminates processing overhead of other explicit multicast protocols such as Xcast with comparable header size overhead.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E88-B No.10 pp.4000-4007
- Publication Date
- 2005/10/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietcom/e88-b.10.4000
- Type of Manuscript
- PAPER
- Category
- Network
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
Mozafar BAG-MOHAMMADI, Nasser YAZDANI, "A Fast and Efficient Explicit Multicast Routing Protocol" in IEICE TRANSACTIONS on Communications,
vol. E88-B, no. 10, pp. 4000-4007, October 2005, doi: 10.1093/ietcom/e88-b.10.4000.
Abstract: The state-oriented design of IP multicast may lead to the scalability problem, especially when there is a very large number of concurrent multicast groups in the network. Motivated by this problem, explicit multicast offers a stateless design using header space of multicast data packets. In this paper, we propose a novel stateless scheme called Linkcast that efficiently eliminates processing overhead of explicit multicast protocols. In Linkcast, the multicast sender encodes the tree listing its links in a proper way. The tree code is sent with every multicast data packet. Simulation results and experiments with real-trees show that Linkcast completely eliminates processing overhead of other explicit multicast protocols such as Xcast with comparable header size overhead.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e88-b.10.4000/_p
Copy
@ARTICLE{e88-b_10_4000,
author={Mozafar BAG-MOHAMMADI, Nasser YAZDANI, },
journal={IEICE TRANSACTIONS on Communications},
title={A Fast and Efficient Explicit Multicast Routing Protocol},
year={2005},
volume={E88-B},
number={10},
pages={4000-4007},
abstract={The state-oriented design of IP multicast may lead to the scalability problem, especially when there is a very large number of concurrent multicast groups in the network. Motivated by this problem, explicit multicast offers a stateless design using header space of multicast data packets. In this paper, we propose a novel stateless scheme called Linkcast that efficiently eliminates processing overhead of explicit multicast protocols. In Linkcast, the multicast sender encodes the tree listing its links in a proper way. The tree code is sent with every multicast data packet. Simulation results and experiments with real-trees show that Linkcast completely eliminates processing overhead of other explicit multicast protocols such as Xcast with comparable header size overhead.},
keywords={},
doi={10.1093/ietcom/e88-b.10.4000},
ISSN={},
month={October},}
Copy
TY - JOUR
TI - A Fast and Efficient Explicit Multicast Routing Protocol
T2 - IEICE TRANSACTIONS on Communications
SP - 4000
EP - 4007
AU - Mozafar BAG-MOHAMMADI
AU - Nasser YAZDANI
PY - 2005
DO - 10.1093/ietcom/e88-b.10.4000
JO - IEICE TRANSACTIONS on Communications
SN -
VL - E88-B
IS - 10
JA - IEICE TRANSACTIONS on Communications
Y1 - October 2005
AB - The state-oriented design of IP multicast may lead to the scalability problem, especially when there is a very large number of concurrent multicast groups in the network. Motivated by this problem, explicit multicast offers a stateless design using header space of multicast data packets. In this paper, we propose a novel stateless scheme called Linkcast that efficiently eliminates processing overhead of explicit multicast protocols. In Linkcast, the multicast sender encodes the tree listing its links in a proper way. The tree code is sent with every multicast data packet. Simulation results and experiments with real-trees show that Linkcast completely eliminates processing overhead of other explicit multicast protocols such as Xcast with comparable header size overhead.
ER -
English
