Multicast Design for the MobilityFirst Future Internet Architecture

Yang, Bowen; Chen, Xiang; Xie, Jibo; Li, Sugang; Zhang, Yanyong; Yang, Jian

doi:10.1109/iccnc.2019.8685485

Cited by 6 publications

(5 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Let D r be the average loss recovery delay of multicast receiver r, and RTT be the mean round trip time from all multicast sources to all receivers. Then we evaluate the loss recovery delay by the normalized loss recovery delay (NLRD) D, which is defined in Equation (8).…”

Section: Loss Recovery Delaymentioning

confidence: 99%

“…As a new network architecture, the information-centric network (ICN) [2][3][4] has received extensive attention. The core idea of the ICN is to separate identification and address [5], and to provide efficient content distribution through technologies such as content-oriented name [6], in-network cache [7], and multicast [8]. On the one hand, ICN effectively supports typical application scenarios such as efficient content distribution, multicast transmission, and mobile handover management.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A Dynamic Cache Allocation Mechanism (DCAM) for Reliable Multicast in Information-Centric Networking

2022

View full text Add to dashboard Cite

As a new network architecture, information-centric networking (ICN) decouples the identifiers and locators of network entities and makes full use of in-network cache technology to improve the content distribution efficiency. For reliable multicast, ICN in-network cache can help reduce the loss recovery delay. However, with the development of applications and services, a multicast tree node often serves multiple reliable multicast groups. How to reasonably allocate cache resources for each multicast group will greatly affect the performance of reliable multicast. In order to improve the overall loss recovery performance of reliable multicast, this paper designs a dynamic cache allocation mechanism (DCAM). DCAM considers the packet loss probability, the node depth of the multicast tree, and the multicast transmission rate of multicast group, and then allocates cache space for multicast group based on the normalized cache quota weight. We also explore the performance of three cache allocation mechanisms (DCAM, AARM, and Equal) combined with four cache strategies (LCE, CAPC, Prob, and ProbCache), respectively. Experimental results show that DCAM can adjust cache allocation results in time according to network changes, and its combinations with various cache strategies outperform other combinations. Moreover, the combination of DCAM and CAPC can achieve optimal performance in loss recovery delay, cache hit ratio, transmission completion time, and overhead.

show abstract

Section: Loss Recovery Delaymentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A Dynamic Cache Allocation Mechanism (DCAM) for Reliable Multicast in Information-Centric Networking

2022

View full text Add to dashboard Cite

show abstract

“…Thus, whenever the group membership changes, the multicast service manager needs to recalculate the multicast tree and update the information. MMF [40] is another multicast mechanism based on MobilityFirst, which assigns a unique Multicast GUID (MGUID) to each multicast group. MMF manages multicast groups by using GNRS to maintain the mapping between MGUID and the addresses of receivers.…”

Section: Icn Multicastmentioning

confidence: 99%

An Identifier and Locator Decoupled Multicast Approach (ILDM) Based on ICN

Wang

2021

Applied Sciences

View full text Add to dashboard Cite

Many bandwidth-intensive applications (such as online live, online games, etc.) are more suitable for using multicast to transmit information. Due to the advantages in scalability, Shared Tree (ST) is more suitable for large-scale deployment than Source-Based Tree (SBT). However, in ST-based multicast, all multicast sources need to send multicast data to a center node called a core, which will lead to core overload and traffic concentration. Besides, most existing multicast protocols use the shortest path between the source or the core and each receiver to construct the multicast tree, which will result in traffic overload on some links. In this paper, we propose an Identifier and Locator Decoupled Multicast approach (ILDM) based on Information-Centric Networking (ICN). ILDM uses globally unique names to identify multicast services. For each multicast service, the mapping between the multicast service name and the addresses of multicast tree nodes is stored in the Name Resolution System (NRS). To avoid core overload and traffic aggregation, we presented a dynamic core management and selection mechanism, which can dynamically select a low-load core for each multicast service. Furthermore, we designed a path state-aware multicast tree node selection mechanism to achieve traffic load balancing by using low-load links more effectively. Experimental results showed that our proposed multicast approach outperformed some other multicast methods in terms of core load, number of join requests, link load, traffic concentration, and routing state.

show abstract

“…Multicast Design for the MobilityFirst (MMF) [24] manages multicast groups by using the global name resolution service (GNRS) to map the multicast name to the addresses of receivers. MMF appends the names of receivers as additional destinations to the packet header and employs bitmap to compress the destinations.…”

Section: Related Workmentioning

confidence: 99%

An Adaptive Hierarchical Hybrid Multicast Based on Information-Centric Networking

Wang

Zhu

et al. 2021

Electronics

View full text Add to dashboard Cite

Many information-centric services have emerged, such as IPTV and video conferencing. These services put a lot of demands on scalable multicast communication. However, traditional IP multicast has low adoption because of its poor scalability. Therefore, some stateless multicast methods were proposed, which encapsulate the destination’s information into the packet header without requiring routers to maintain the multicast forwarding state. However, stateless multicast also faces some problems, such as ingress router overload, high forwarding overhead, packet redundancy, etc. In addition, most multicast methods cannot optimize the multicast tree because the multicast flow is simply forwarded along the shortest path tree from the source to receivers. This paper proposes an Adaptive Hierarchical Hybrid Multicast (AHHM) based on Information-Centric Networking. To balance the forwarding states and forwarding overhead, AHHM is designed as a two-layer structure, in which the upper layer establishes a stateful main tree and the lower layer establishes several stateless sub trees. The router on the main tree is defined as the multicast join node (MJN), and AHHM uses the Name Resolution System to maintain the mapping between each multicast group name and corresponding MJNs. To optimize the multicast transmission path, we designed the minimum cost selection strategy for users to select the appropriate MJN to join. Simulation results show that compared with Source-Specific Multicast (SSM) and Bit Index Explicit Replication (BIER), AHHM can not only reduce the multicast forwarding states but also reduce the control overhead and link load.

show abstract

Multicast Design for the MobilityFirst Future Internet Architecture

Cited by 6 publications

References 14 publications

A Dynamic Cache Allocation Mechanism (DCAM) for Reliable Multicast in Information-Centric Networking

A Dynamic Cache Allocation Mechanism (DCAM) for Reliable Multicast in Information-Centric Networking

An Identifier and Locator Decoupled Multicast Approach (ILDM) Based on ICN

An Adaptive Hierarchical Hybrid Multicast Based on Information-Centric Networking

Contact Info

Product

Resources

About