IEICE TRANSACTIONS on Communications
Scalability Analysis of Source Routing Multicast for Huge Numbers of Groups
Summary :
Source routing multicast has been gathering much more attention rather than traditional IP multicast, since it is thought to be more scalable in terms of the number of groups at the cost of higher traffic loads. This paper introduces a mathematical framework to analyze the scalability of source routing multicast and IP multicast by leveraging previous multicast studies. We first analyze the amount of data traffic based on the small-world nature of networks, and show that source routing multicast can be as efficient as IP multicast if a simple header fragmentation technique (subgrouping) is utilized. We also analyze scalability in terms of group numbers, which are derived under the equal budget assumption. Our analysis shows that source routing multicast is competitive for low bit-rate streams, like those in the publish/subscribe service, but we find some factors that offset the advantage. This is the first work to analytically investigate the scalability of source routing multicast.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E96-B No.11 pp.2784-2794
- Publication Date
- 2013/11/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E96.B.2784
- Type of Manuscript
- Special Section PAPER (Special Section on Progress in Information Network Science)
- Category
Authors
Yohei KATAYAMA
NTT Network Innovation Laboratories
Takeru INOUE
NTT Network Innovation Laboratories
Noriyuki TAKAHASHI
NTT Network Innovation Laboratories
Ryutaro KAWAMURA
NTT Network Innovation Laboratories
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
Yohei KATAYAMA, Takeru INOUE, Noriyuki TAKAHASHI, Ryutaro KAWAMURA, "Scalability Analysis of Source Routing Multicast for Huge Numbers of Groups" in IEICE TRANSACTIONS on Communications,
vol. E96-B, no. 11, pp. 2784-2794, November 2013, doi: 10.1587/transcom.E96.B.2784.
Abstract: Source routing multicast has been gathering much more attention rather than traditional IP multicast, since it is thought to be more scalable in terms of the number of groups at the cost of higher traffic loads. This paper introduces a mathematical framework to analyze the scalability of source routing multicast and IP multicast by leveraging previous multicast studies. We first analyze the amount of data traffic based on the small-world nature of networks, and show that source routing multicast can be as efficient as IP multicast if a simple header fragmentation technique (subgrouping) is utilized. We also analyze scalability in terms of group numbers, which are derived under the equal budget assumption. Our analysis shows that source routing multicast is competitive for low bit-rate streams, like those in the publish/subscribe service, but we find some factors that offset the advantage. This is the first work to analytically investigate the scalability of source routing multicast.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E96.B.2784/_p
Copy
@ARTICLE{e96-b_11_2784,
author={Yohei KATAYAMA, Takeru INOUE, Noriyuki TAKAHASHI, Ryutaro KAWAMURA, },
journal={IEICE TRANSACTIONS on Communications},
title={Scalability Analysis of Source Routing Multicast for Huge Numbers of Groups},
year={2013},
volume={E96-B},
number={11},
pages={2784-2794},
abstract={Source routing multicast has been gathering much more attention rather than traditional IP multicast, since it is thought to be more scalable in terms of the number of groups at the cost of higher traffic loads. This paper introduces a mathematical framework to analyze the scalability of source routing multicast and IP multicast by leveraging previous multicast studies. We first analyze the amount of data traffic based on the small-world nature of networks, and show that source routing multicast can be as efficient as IP multicast if a simple header fragmentation technique (subgrouping) is utilized. We also analyze scalability in terms of group numbers, which are derived under the equal budget assumption. Our analysis shows that source routing multicast is competitive for low bit-rate streams, like those in the publish/subscribe service, but we find some factors that offset the advantage. This is the first work to analytically investigate the scalability of source routing multicast.},
keywords={},
doi={10.1587/transcom.E96.B.2784},
ISSN={1745-1345},
month={November},}
Copy
TY - JOUR
TI - Scalability Analysis of Source Routing Multicast for Huge Numbers of Groups
T2 - IEICE TRANSACTIONS on Communications
SP - 2784
EP - 2794
AU - Yohei KATAYAMA
AU - Takeru INOUE
AU - Noriyuki TAKAHASHI
AU - Ryutaro KAWAMURA
PY - 2013
DO - 10.1587/transcom.E96.B.2784
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E96-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2013
AB - Source routing multicast has been gathering much more attention rather than traditional IP multicast, since it is thought to be more scalable in terms of the number of groups at the cost of higher traffic loads. This paper introduces a mathematical framework to analyze the scalability of source routing multicast and IP multicast by leveraging previous multicast studies. We first analyze the amount of data traffic based on the small-world nature of networks, and show that source routing multicast can be as efficient as IP multicast if a simple header fragmentation technique (subgrouping) is utilized. We also analyze scalability in terms of group numbers, which are derived under the equal budget assumption. Our analysis shows that source routing multicast is competitive for low bit-rate streams, like those in the publish/subscribe service, but we find some factors that offset the advantage. This is the first work to analytically investigate the scalability of source routing multicast.
ER -
English
