Candidate core selection for load-balanced multicore shared tree multicasting

K. Sinha, B. Gupta, S. Rahimi, Ansuman Bhattacharya
{"title":"Candidate core selection for load-balanced multicore shared tree multicasting","authors":"K. Sinha, B. Gupta, S. Rahimi, Ansuman Bhattacharya","doi":"10.1109/RAIT.2016.7507871","DOIUrl":null,"url":null,"abstract":"Multicasting can be done in two different ways: source based tree approach and shared tree approach. Protocols such as Core Based Tree (CBT), Protocol Independent Multicasting Sparse Mode (PIM-SM) use shared tree approach. Shared tree approach is preferred over source-based tree approach because in the latter construction of minimum cost tree per source is needed unlike a single shared tree in the former approach. Objective of the present work is two-fold: to provide a candidate core selection approach for shared tree multicasting to guard against any possible core failure and to provide an efficient load balanced multicore multicasting approach using the candidate cores.","PeriodicalId":289216,"journal":{"name":"2016 3rd International Conference on Recent Advances in Information Technology (RAIT)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 3rd International Conference on Recent Advances in Information Technology (RAIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RAIT.2016.7507871","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Multicasting can be done in two different ways: source based tree approach and shared tree approach. Protocols such as Core Based Tree (CBT), Protocol Independent Multicasting Sparse Mode (PIM-SM) use shared tree approach. Shared tree approach is preferred over source-based tree approach because in the latter construction of minimum cost tree per source is needed unlike a single shared tree in the former approach. Objective of the present work is two-fold: to provide a candidate core selection approach for shared tree multicasting to guard against any possible core failure and to provide an efficient load balanced multicore multicasting approach using the candidate cores.
负载均衡多核共享树广播的候选核选择
多播可以通过两种不同的方式完成:基于源的树方法和共享树方法。基于核心的树(CBT)、协议独立多播稀疏模式(PIM-SM)等协议都采用了共享树的方法。共享树方法优于基于源的树方法,因为在后者中,每个源需要最小成本树的构建,而不像前一种方法中需要单个共享树。本研究的目的有两个:为共享树组播提供一种候选核心选择方法,以防止任何可能的核心故障,并使用候选核心提供一种有效的负载均衡多核组播方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信