Multicast routing algorithms and protocols: a tutorial

Multicasting is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locations. There has been an explosion of research literature on multicast communication. This work presents a tutorial-cum-s...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:IEEE network Ročník 14; číslo 1; s. 90 - 102
Hlavní autori: Sahasrabuddhe, L.H., Mukherjee, B.
Médium: Journal Article
Jazyk:English
Vydavateľské údaje: IEEE 01.01.2000
Predmet:
ISSN:0890-8044
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
Abstract Multicasting is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locations. There has been an explosion of research literature on multicast communication. This work presents a tutorial-cum-survey of the various multicast routing algorithms and their relationship with multicast routing protocols for packet-switched-wide-area networks. Our contribution should be of particular benefit to the generic networking audience (and, to a lesser extent, to the expert on this subject).
AbstractList Multicasting is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locations. There has been an explosion of research literature on multicast communication. This work presents a tutorial-cum-survey of the various multicast routing algorithms and their relationship with multicast routing protocols for packet-switched-wide-area networks. Our contribution should be of particular benefit to the generic networking audience (and, to a lesser extent, to the expert on this subject)
Multicasting is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locations. Recently, there has been an explosion of research literature on multicast communication. This work presents a tutorial-cum-survey of the various multicast routing algorithms and their relationship with multicast routing protocols for packet-switched wide-area networks. Our contribution should be of particular benefit to the generic networking audience (and, to a lesser extent, to the expert on this subject).
Author Sahasrabuddhe, L.H.
Mukherjee, B.
Author_xml – sequence: 1
  givenname: L.H.
  surname: Sahasrabuddhe
  fullname: Sahasrabuddhe, L.H.
  organization: California Univ., Los Angeles, Ca, USA
– sequence: 2
  givenname: B.
  surname: Mukherjee
  fullname: Mukherjee, B.
BookMark eNqFkL1PwzAUxD0UibYwsDJlQjCk2HH8xYYqvqQiFpijF8ctRm5cbGfgv8coFQNCID3pDfe70-lmaNL73iB0QvCCEKwuOVtIoohgEzTFUuFS4ro-RLMY3zAmNaPVFPHHwSWrIaYi-CHZflOA2_hg0-s2FtB3xS745LV38aqAIg0pa-CO0MEaXDTH-z9HL7c3z8v7cvV097C8XpW6xiKVsOadloxQU1NOQUCbG2gDCqgULdNd2wqqiJRSQwtM8o4IYrQkrRRccU3n6GzMzS3eBxNTs7VRG-egN36ITSWFVEzS_0HBFM2XwfM_QYKrKvfhmGf0YkR18DEGs252wW4hfGSo-Vq44awZF87s5Q9W2wTJ-j4FsO5Xx-nosMaY7-S9-Alvaoiz
CODEN IENEET
CitedBy_id crossref_primary_10_1109_TBDATA_2018_2878584
crossref_primary_10_1109_TVT_2009_2019281
crossref_primary_10_1109_COMST_2017_2776213
crossref_primary_10_1109_JSAC_2012_120812
crossref_primary_10_1016_j_asej_2011_05_002
crossref_primary_10_1016_j_comnet_2011_07_009
crossref_primary_10_1002_sec_548
crossref_primary_10_1016_j_tcs_2009_05_013
crossref_primary_10_1016_j_simpat_2003_10_004
crossref_primary_10_1364_JOCN_2_000442
crossref_primary_10_1016_j_osn_2015_03_007
crossref_primary_10_1109_MNET_2002_1020234
crossref_primary_10_1016_j_jnca_2008_02_004
crossref_primary_10_1109_TNET_2011_2175007
crossref_primary_10_1002_dac_2535
crossref_primary_10_1007_s11277_021_09174_9
crossref_primary_10_1109_LPT_2008_2011750
crossref_primary_10_1109_MCOM_2006_248167
crossref_primary_10_1016_j_comcom_2005_12_005
crossref_primary_10_1016_j_ins_2014_03_130
crossref_primary_10_1109_TNET_2006_882840
crossref_primary_10_1016_j_tcs_2007_10_021
crossref_primary_10_1109_90_993300
crossref_primary_10_1023_A_1024648402306
crossref_primary_10_1109_4234_984702
crossref_primary_10_1016_S0167_4048_02_00814_3
crossref_primary_10_1109_TWC_2007_025706
crossref_primary_10_1007_s10586_006_7564_2
crossref_primary_10_1109_MCOM_2002_1007412
crossref_primary_10_1002_sat_762
crossref_primary_10_1109_49_887904
crossref_primary_10_3390_app132413349
crossref_primary_10_1016_j_comnet_2005_12_012
crossref_primary_10_1007_s11227_006_0009_0
crossref_primary_10_1109_LPT_2015_2421444
crossref_primary_10_1016_j_comnet_2005_05_024
crossref_primary_10_1002_nem_636
crossref_primary_10_1109_JLT_2025_3582244
crossref_primary_10_1088_1742_6596_574_1_012073
crossref_primary_10_1016_j_compeleceng_2006_01_016
crossref_primary_10_1109_JLT_2007_902773
crossref_primary_10_1007_s11276_015_0940_1
crossref_primary_10_1364_JOCN_5_000667
crossref_primary_10_1007_s11107_015_0589_9
crossref_primary_10_1016_j_comcom_2007_05_058
crossref_primary_10_1016_j_adhoc_2005_09_001
crossref_primary_10_1016_j_tcs_2003_12_019
crossref_primary_10_1016_j_tcs_2009_05_031
crossref_primary_10_1109_TVT_2004_836893
crossref_primary_10_1016_S0020_0190_02_00220_X
crossref_primary_10_1049_ip_com_20050159
crossref_primary_10_1145_510726_510729
crossref_primary_10_1016_S1000_9361_07_60055_7
crossref_primary_10_1016_j_comnet_2015_09_004
crossref_primary_10_1364_JOCN_4_000692
crossref_primary_10_1109_JSAC_2014_140111
crossref_primary_10_1109_JSAC_OCN_2008_030507
crossref_primary_10_1016_j_comcom_2007_08_023
crossref_primary_10_1109_TPDS_2015_2473174
crossref_primary_10_1016_j_comcom_2006_06_011
crossref_primary_10_1080_1206212X_2008_11441904
crossref_primary_10_1364_JOCN_1_000A44
crossref_primary_10_1109_TPDS_2007_70711
crossref_primary_10_1016_j_disopt_2007_09_005
crossref_primary_10_1109_6046_909598
crossref_primary_10_1109_JLT_2007_902092
crossref_primary_10_1109_TCC_2015_2469666
crossref_primary_10_1016_j_comnet_2004_03_034
crossref_primary_10_3745_KIPSTC_2003_10C_6_809
Cites_doi 10.1145/167954.166246
10.1145/359657.359665
10.1145/179606.179627
10.1109/49.564133
10.1109/49.564128
10.17487/rfc2328
10.17487/rfc2362
10.1109/35.649333
10.1109/90.532865
10.1007/978-1-4615-5713-5
10.1109/90.234851
10.1109/INFCOM.1995.515897
10.17487/rfc1058
10.1002/net.3230080402
10.1002/j.1538-7305.1957.tb01515.x
10.1109/65.642357
10.2307/2033241
10.1002/net.3230160305
10.1007/BF01187035
10.17487/rfc1112
10.1109/49.12889
10.1145/179606.179654
10.1109/TCOM.1983.1095818
10.1090/qam/102435
10.17487/rfc2365
10.1007/BF00288961
10.1145/78952.78953
10.17487/rfc1075
10.1007/BF01386390
10.1109/90.490743
10.1002/net.3230170203
10.1007/BF01758767
10.1145/316188.316207
10.1007/978-1-4684-2001-2_9
ContentType Journal Article
DBID RIA
RIE
AAYXX
CITATION
7SP
8FD
F28
FR3
L7M
7SC
JQ2
L~C
L~D
DOI 10.1109/65.819175
DatabaseName IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Xplore
CrossRef
Electronics & Communications Abstracts
Technology Research Database
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
DatabaseTitle CrossRef
Engineering Research Database
Technology Research Database
Advanced Technologies Database with Aerospace
ANTE: Abstracts in New Technology & Engineering
Electronics & Communications Abstracts
Computer and Information Systems Abstracts
Computer and Information Systems Abstracts – Academic
ProQuest Computer Science Collection
Computer and Information Systems Abstracts Professional
DatabaseTitleList Computer and Information Systems Abstracts
Engineering Research Database
Computer and Information Systems Abstracts

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EndPage 102
ExternalDocumentID 10_1109_65_819175
819175
GroupedDBID -~X
.DC
0R~
29I
4.4
5GY
5VS
6IK
97E
AAIKC
AAJGR
AAMNW
AARMG
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACIWK
AENEX
AETIX
AFOGA
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
AZLTO
BEFXN
BFFAM
BGNUA
BKEBE
BKOMP
BPEOZ
CS3
DU5
EBS
EJD
F5P
HZ~
H~9
ICLAB
IES
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
MS~
O9-
OCL
PQQKQ
RIA
RIE
RNS
TN5
VH1
ZCA
AAYXX
CITATION
7SP
8FD
F28
FR3
L7M
7SC
JQ2
L~C
L~D
ID FETCH-LOGICAL-c407t-af6dc8513e4363a7ab044cea9a387b5cdbb7391888caba586d171ec81b87696c3
IEDL.DBID RIE
ISICitedReferencesCount 153
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000085102600012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 0890-8044
IngestDate Sun Sep 28 07:37:40 EDT 2025
Sun Sep 28 02:11:52 EDT 2025
Sat Sep 27 22:59:43 EDT 2025
Tue Nov 18 22:16:43 EST 2025
Sat Nov 29 03:08:52 EST 2025
Wed Aug 27 03:08:03 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 1
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c407t-af6dc8513e4363a7ab044cea9a387b5cdbb7391888caba586d171ec81b87696c3
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
PQID 1022888606
PQPubID 23500
PageCount 13
ParticipantIDs proquest_miscellaneous_27593593
proquest_miscellaneous_1022888606
crossref_citationtrail_10_1109_65_819175
crossref_primary_10_1109_65_819175
ieee_primary_819175
proquest_miscellaneous_28789583
PublicationCentury 2000
PublicationDate 2000-Jan.-Feb.
2000-01-00
20000101
PublicationDateYYYYMMDD 2000-01-01
PublicationDate_xml – month: 01
  year: 2000
  text: 2000-Jan.-Feb.
PublicationDecade 2000
PublicationTitle IEEE network
PublicationTitleAbbrev NET-M
PublicationYear 2000
Publisher IEEE
Publisher_xml – name: IEEE
References ref35
ref13
ref34
ref12
wei (ref21) 1994
ref31
ref30
ref33
ref11
rayward-smith (ref15) 1986; 16
ref32
ref10
miller (ref6) 1999
plesnik (ref14) 1981; 31
ref2
ref1
ref39
ref17
ballardie (ref23) 1997
johnson (ref18) 1978; 8
estrin (ref45) 1999
perlman (ref38) 1999
takahashi (ref16) 1980; 24
ref24
wall (ref19) 1980
ref26
ref25
bellman (ref8) 1958; 16
ref20
ref41
ref22
holbrook (ref37) 1999
ref43
thaler (ref36) 1998
estrin (ref46) 1999
ref28
ref27
thaler (ref42) 1999
ref29
ref7
ref9
deering (ref44) 1999
ref4
ref3
ref5
ref40
References_xml – ident: ref22
  doi: 10.1145/167954.166246
– ident: ref40
  doi: 10.1145/359657.359665
– ident: ref29
  doi: 10.1145/179606.179627
– ident: ref26
  doi: 10.1109/49.564133
– ident: ref2
  doi: 10.1109/49.564128
– ident: ref33
  doi: 10.17487/rfc2328
– volume: 31
  start-page: 155
  year: 1981
  ident: ref14
  article-title: A Bound for the Steiner Tree Problem in Graphs
  publication-title: Mathematica Slovaca
– year: 1980
  ident: ref19
  publication-title: Mechanisms for broadcast and selective broadcast
– ident: ref35
  doi: 10.17487/rfc2362
– ident: ref4
  doi: 10.1109/35.649333
– ident: ref17
  doi: 10.1109/90.532865
– ident: ref5
  doi: 10.1007/978-1-4615-5713-5
– ident: ref25
  doi: 10.1109/90.234851
– year: 1999
  ident: ref6
  publication-title: Multicast Networking and Applications
– ident: ref27
  doi: 10.1109/INFCOM.1995.515897
– ident: ref43
  doi: 10.17487/rfc1058
– volume: 8
  start-page: 279
  year: 1978
  ident: ref18
  article-title: The Complexity of the Network Design Problem
  publication-title: Networks
  doi: 10.1002/net.3230080402
– year: 1994
  ident: ref21
  article-title: The Trade-Offs of Multicast Trees and Algorithms
  publication-title: Proc Int'l Conf Comp Commun Networks
– ident: ref11
  doi: 10.1002/j.1538-7305.1957.tb01515.x
– year: 1999
  ident: ref38
  publication-title: Simple multicast A design for simple low-overhead multicast
– ident: ref3
  doi: 10.1109/65.642357
– ident: ref10
  doi: 10.2307/2033241
– volume: 16
  start-page: 283
  year: 1986
  ident: ref15
  article-title: On Finding Steiner Vertices
  publication-title: Networks
  doi: 10.1002/net.3230160305
– ident: ref12
  doi: 10.1007/BF01187035
– ident: ref30
  doi: 10.17487/rfc1112
– ident: ref24
  doi: 10.1109/49.12889
– volume: 24
  start-page: 573
  year: 1980
  ident: ref16
  article-title: An Approximate Solution for the Steiner Problem in Graphs
  publication-title: Mathematica Japonica
– ident: ref32
  doi: 10.1145/179606.179654
– ident: ref20
  doi: 10.1109/TCOM.1983.1095818
– year: 1998
  ident: ref36
  publication-title: Border Gateway Multicast Protocol (BGMP) Protocol Specification
– volume: 16
  start-page: 87
  year: 1958
  ident: ref8
  article-title: On a Routing Problem
  publication-title: Qtryl Applied Math
  doi: 10.1090/qam/102435
– ident: ref41
  doi: 10.17487/rfc2365
– year: 1999
  ident: ref46
  publication-title: The Multicast Address-Set Claim (MASC) Protocol
– ident: ref13
  doi: 10.1007/BF00288961
– ident: ref39
  doi: 10.1145/78952.78953
– ident: ref31
  doi: 10.17487/rfc1075
– ident: ref9
  doi: 10.1007/BF01386390
– year: 1999
  ident: ref44
  publication-title: Protocol independent multicast-dense mode (PIM-DM) Protocol specification
– year: 1999
  ident: ref42
  publication-title: The Internet Multicast Address Allocation Architecture
– year: 1997
  ident: ref23
  publication-title: Core based trees (CBT Version 2) multicast routing
– ident: ref34
  doi: 10.1109/90.490743
– year: 1999
  ident: ref45
  publication-title: Protocol independent multicast-sparse mode (PIM-SM) Protocol specification
– ident: ref1
  doi: 10.1002/net.3230170203
– ident: ref28
  doi: 10.1007/BF01758767
– year: 1999
  ident: ref37
  article-title: IP Multicast Channels: EXPRESS Support for Large-Scale Single-Source Applications
  publication-title: Proc ACM SIGCOMM '99
  doi: 10.1145/316188.316207
– ident: ref7
  doi: 10.1007/978-1-4684-2001-2_9
SSID ssj0014532
Score 2.072809
Snippet Multicasting is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 90
SubjectTerms Algorithms
Broadcasting
Communication networks
Computer networks
Local area networks
Messages
Motion pictures
Multicast
Multicast algorithms
Multicast communication
Multicast protocols
Networks
Protocol (computers)
Routing (telecommunications)
Routing protocols
Tutorial
Wide area networks
Title Multicast routing algorithms and protocols: a tutorial
URI https://ieeexplore.ieee.org/document/819175
https://www.proquest.com/docview/1022888606
https://www.proquest.com/docview/27593593
https://www.proquest.com/docview/28789583
Volume 14
WOSCitedRecordID wos000085102600012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  issn: 0890-8044
  databaseCode: RIE
  dateStart: 19870101
  customDbUrl:
  isFulltext: true
  dateEnd: 99991231
  titleUrlDefault: https://ieeexplore.ieee.org/
  omitProxy: false
  ssIdentifier: ssj0014532
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB5s8aAHH1WxPqN48JI27WZf3kQsnooHhd7CvqqFmkge_n53N2lRrIK3EGZJZnbZmdnZ7xuAK8MIMdZThEhx7iA5LBScy9DGApI5yivKtG82QcdjNpnwx4Zn22NhjDH-8pnpuUdfy9eZqtxRWd8nF7gFLUppDdVaFgxi7HuRRcwho6M4bkiEBhHvE9yrB35zPb6Xyo8N2HuV0fa__mcHtprgMbitZ3sX1kzagc0vlIJ7QDyiVomiDPKscneaAzF_yfJZ-fpWBCLVgWNmyOz0FzeBCEpHYWCX4D48j-6f7h7CpjdCqGwKVoZiSrSy0RIyMSJIUCGt0soILhCjEistJUV8YPNbJaTAjOgBHRhlg1S7_XGi0AG00yw1hxAgaf02HSo1lSq2OgqqbRAlh4RpHRsed-F6YbZENcThrn_FPPEJRMQTgpPaFF24XIq-12wZq4Q6zpRLgcXbi8VUJHaFu7KFSE1WFYnLSa0eNtPqwvkvMkOKHcQY_SHBKOOYoaOVXz-GjRpj785WTqBd5pU5hXX1Uc6K_MwvtU_YpNLw
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB58gXrwURXrM4oHL2mb7tubiKKoxYNCb2FfVUETaVJ_v7ubtCg-wFsIsyQ7O-zM7Oz3DcCR5ZRa5ylipIXwkBweSyFU7GIBxT3lFeMmNJtgvR7v98VdzbMdsDDW2nD5zLb8Y6jlm1yP_FFZOyQXZBpmCcbdpAJrTUoGmIRuZB3usdEdjGsaoaQj2pS0qqFfnE_opvJtCw5-5WL5X3-0Akt1-BidVuu9ClM2a8DiJ1LBNaABU6tlUUbDfORvNUfy5TEfPpdPr0UkMxN5bobcGUBxEsmo9CQGzgjX4eHi_P7sMq67I8TaJWFlLAfUaBcvIYsRRZJJ5SatrRQScaaINkoxJBKX4WqpJOHUJCyx2oWpbgMUVKMNmMnyzG5ChJTz3Kyr9UBp7OYomXFhlOpSbgy2AjfheKy2VNfU4b6DxUsaUoiOSClJK1U04XAi-lbxZfwk1PCqnAiM3x6MlyJ1Nu4LFzKz-ahIfVbq5uFyrSbs_yLTZcSDjNEfEpxxQTja-vHr-zB_eX97k95c9a63YaFC3PuTlh2YKYcjuwtz-r18LoZ7wew-APYM1jc
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Multicast+routing+algorithms+and+protocols%3A+a+tutorial&rft.jtitle=IEEE+network&rft.au=Sahasrabuddhe%2C+L.H.&rft.au=Mukherjee%2C+B.&rft.date=2000-01-01&rft.pub=IEEE&rft.issn=0890-8044&rft.volume=14&rft.issue=1&rft.spage=90&rft.epage=102&rft_id=info:doi/10.1109%2F65.819175&rft.externalDocID=819175
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0890-8044&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0890-8044&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0890-8044&client=summon