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.