Candidate core selection for load-balanced multicore shared tree multicasting

Koushik Sinha, Bidyut Gupta, Shahram Rahimi, Ansuman Bhattacharya

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publication2016 3rd International Conference on Recent Advances in Information Technology, RAIT 2016
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages35-40
Number of pages6
ISBN (Electronic)9781479985791
DOIs
Publication statusPublished - 8 Jul 2016
Event3rd International Conference on Recent Advances in Information Technology, RAIT 2016 - Dhanbad, India
Duration: 3 Mar 20165 Mar 2016

Other

Other3rd International Conference on Recent Advances in Information Technology, RAIT 2016
CountryIndia
CityDhanbad
Period3/3/165/3/16

Fingerprint

Multicasting
Costs and Cost Analysis
Costs

Keywords

  • core selection
  • distance vector routing
  • fault-tolerance
  • load-balanced multicasting
  • multicore multicasting
  • pseudo diameter

ASJC Scopus subject areas

  • Artificial Intelligence
  • Computer Networks and Communications
  • Computer Science Applications
  • Health Informatics
  • Information Systems

Cite this

Sinha, K., Gupta, B., Rahimi, S., & Bhattacharya, A. (2016). Candidate core selection for load-balanced multicore shared tree multicasting. In 2016 3rd International Conference on Recent Advances in Information Technology, RAIT 2016 (pp. 35-40). [7507871] Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/RAIT.2016.7507871

Candidate core selection for load-balanced multicore shared tree multicasting. / Sinha, Koushik; Gupta, Bidyut; Rahimi, Shahram; Bhattacharya, Ansuman.

2016 3rd International Conference on Recent Advances in Information Technology, RAIT 2016. Institute of Electrical and Electronics Engineers Inc., 2016. p. 35-40 7507871.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sinha, K, Gupta, B, Rahimi, S & Bhattacharya, A 2016, Candidate core selection for load-balanced multicore shared tree multicasting. in 2016 3rd International Conference on Recent Advances in Information Technology, RAIT 2016., 7507871, Institute of Electrical and Electronics Engineers Inc., pp. 35-40, 3rd International Conference on Recent Advances in Information Technology, RAIT 2016, Dhanbad, India, 3/3/16. https://doi.org/10.1109/RAIT.2016.7507871
Sinha K, Gupta B, Rahimi S, Bhattacharya A. Candidate core selection for load-balanced multicore shared tree multicasting. In 2016 3rd International Conference on Recent Advances in Information Technology, RAIT 2016. Institute of Electrical and Electronics Engineers Inc. 2016. p. 35-40. 7507871 https://doi.org/10.1109/RAIT.2016.7507871
Sinha, Koushik ; Gupta, Bidyut ; Rahimi, Shahram ; Bhattacharya, Ansuman. / Candidate core selection for load-balanced multicore shared tree multicasting. 2016 3rd International Conference on Recent Advances in Information Technology, RAIT 2016. Institute of Electrical and Electronics Engineers Inc., 2016. pp. 35-40
@inproceedings{15080a2d97134b7d8c95a547f8457830,
title = "Candidate core selection for load-balanced multicore shared tree multicasting",
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.",
keywords = "core selection, distance vector routing, fault-tolerance, load-balanced multicasting, multicore multicasting, pseudo diameter",
author = "Koushik Sinha and Bidyut Gupta and Shahram Rahimi and Ansuman Bhattacharya",
year = "2016",
month = "7",
day = "8",
doi = "10.1109/RAIT.2016.7507871",
language = "English",
pages = "35--40",
booktitle = "2016 3rd International Conference on Recent Advances in Information Technology, RAIT 2016",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - GEN

T1 - Candidate core selection for load-balanced multicore shared tree multicasting

AU - Sinha, Koushik

AU - Gupta, Bidyut

AU - Rahimi, Shahram

AU - Bhattacharya, Ansuman

PY - 2016/7/8

Y1 - 2016/7/8

N2 - 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.

AB - 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.

KW - core selection

KW - distance vector routing

KW - fault-tolerance

KW - load-balanced multicasting

KW - multicore multicasting

KW - pseudo diameter

UR - http://www.scopus.com/inward/record.url?scp=84998828008&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84998828008&partnerID=8YFLogxK

U2 - 10.1109/RAIT.2016.7507871

DO - 10.1109/RAIT.2016.7507871

M3 - Conference contribution

SP - 35

EP - 40

BT - 2016 3rd International Conference on Recent Advances in Information Technology, RAIT 2016

PB - Institute of Electrical and Electronics Engineers Inc.

ER -