Overview of the Internet Multicast Routing Architecture

Savola, Pekka

doi:10.17487/rfc5110

Cited by 22 publications

(11 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…CoAP group communication will run in the Any Source Multicast (ASM) mode [RFC5110] of IP multicast operation. This means that there is no restriction on the source node that sends (originates) the CoAP messages to the IP multicast group.…”

Section: Rfc 7390mentioning

confidence: 99%

Group Communication for the Constrained Application Protocol (CoAP)

Rahman¹,

Dijk²

2014

View full text Add to dashboard Cite

show abstract

Section: Rfc 7390mentioning

confidence: 99%

Group Communication for the Constrained Application Protocol (CoAP)

Rahman¹,

Dijk²

2014

View full text Add to dashboard Cite

show abstract

“…The elements of the PIM-SM/MBGP/MSDP architecture are the following: (i) improved BGP inter-domain routing protocol, Multiprotocol BGP (MBGP) that can handle not only unicast, but also multicast interdomain routing [6]; (ii) PIM-SM intra-domain multicast routing protocol [7], [8]; and (iii) Multicast Source Discovery Protocol (MSDP) that links PIM-SM and MBGP to enable Internet-wide ASM routing [9]. The idea behind the use of the MBGP for multicast routing was to use hierarchical multicast routing based on hierarchical unicast routing [17]. MBGP uses peering mechanism to exchange multicast routing information between MBGP routers (between domains).…”

Section: Multicast Routing Backgroundmentioning

confidence: 99%

Responsible Source Multicasting

Orosz

Hosszú

2012

Information and Communication Technologies

View full text Add to dashboard Cite

Abstract. There is no effective method to support IP level Internet wide multisource multicast sessions, that can be easily used from almost every ISP There are several protocols implementing the necessary functionality, but the penetration of them is really low recently. The most obvious work all-round is using SSM -Source Specific Multicasting, in which, the IP multicast session is identified by the multicast group address and the source's unicast IP address. SSM allows using all the SSM address range for every source IP addresses and limits the address allocation problem inside the host of the source; however, its significant drawback is that the SSM has no native support to create multicast sessions with more than one source; it uses separate source specific distribution trees for every single source therefore it needs more resources on the router side. The alternative solution for supporting multisource multicast session is the ASM -Any Source Multicasting. However, its significant drawback is the lack of Internet wide dynamic address allocation. To address the recent problems of the Internet wide multisource multicast session a novel IP multicast service model, the Responsible Source Multicasting -RSM is introduced in this paper. RSM uses shared distribution trees like ASM; however, builds a reverse path tree towards an appropriate well-known unicast IP address like SSM. The paper demonstrates that this novel multicast routing protocol handles Internet wide multisource multicast sessions. The paper also shortly presents the DAMA -Dynamic Address Allocation of Multicast Addresses protocol for dynamic multicast IP address allocation, which works in a strong collaboration with the RSM.

show abstract

“…Multicast routing is an efficient mechanism to transmit data simultaneously from one or more sources to multiple destinations by using one or more tree-based structures for oneto-many and many-to-many multicast routings [2,3] in the network. In one-to-many multicast routings involving traditional network computing applications, the process of communication between two nodes is known generally as multipoint communications.…”

Section: Multicast Routingmentioning

confidence: 99%

QoS-constraint multicast restoration with 2-tuple domination core nodes selection in DWDM mesh networks

et al. 2010

View full text Add to dashboard Cite

Internet Service Providers (ISP) need to support Quality-of-Service (QoS) constrains in Internet multicast applications which are often delay-sensitive and demanding on network resources. This paper proposes a QoS-constraint multicast restoration scheme in WDM mesh networks based on 2-tuple domination core node selection algorithm which minimization of total network resources in "hop-count" as metric while meeting the "delay-constraint" as a second metric. The primary aim of this work is to provide fast inter-and intra-domain routings and steady local survivability with QoS-constraints based on the information obtained from the core nodes. Our simulation results show that the proposed algorithm outperforms the Dual Tree and MRLR algorithms in terms of the minimum restoration time needed for all recovery paths, blocking probability based on the minimum restoration time, instead of minimum hop count in our previous study [1], for different network topologies.

show abstract

Overview of the Internet Multicast Routing Architecture

Cited by 22 publications

References 19 publications

Group Communication for the Constrained Application Protocol (CoAP)

Group Communication for the Constrained Application Protocol (CoAP)

Responsible Source Multicasting

QoS-constraint multicast restoration with 2-tuple domination core nodes selection in DWDM mesh networks

Contact Info

Product

Resources

About