Reliable Multicast Based on Congestion-Aware Cache in ICN

Reliable multicast distribution is essential for some applications such as Internet of Things (IoT) alarm information and important file distribution. Traditional IP reliable multicast usually relies on multicast source retransmission for recovery losses, causing huge recovery delay and redundancy. Moreover, feedback implosion tends to occur towards multicast source as the number of receivers grows. Information-Centric Networking (ICN) is an emerging network architecture that is efficient in content distribution by supporting multicast and in-network caching. Although ubiquitous in-network caching provides nearby retransmission, the design of cache strategy greatly affects the performance of loss recovery. Therefore, how to recover losses efficiently and quickly is an urgent problem to be solved in ICN reliable multicast. In this paper, we first propose an overview architecture of ICN-based reliable multicast and formulate a problem using recovery delay as the optimization target. Based on the architecture, we present a Congestion-Aware Probabilistic Cache (CAPC) strategy to reduce recovery delay by caching recently transmitted chunks during multicast transmission. Then, we propose NACK feedback aggregation and recovery isolation scheme to decrease recovery overhead. Finally, experimental results show that our proposal can achieve fully reliable multicast and outperforms other approaches in recovery delay, cache hit ratio, transmission completion time, and overhead.

An enhanced hybrid Pareto metaheuritic algorithm-based multicast tree estimation for reliable multicast routing in VANETs

Prompt and reliable data dissemination among the vehicular nodes of the network is indispensable as its mobility rate and limited coverage characteristics introduce the possibility of frequent topology changes. The effective and efficient sharing of critical information in the event of emergency necessitates either direct interaction or Road Side Units (RSUs)-based vehicular communication in the primitive place. Multicast routing is confirmed to be the significant scheme of data transfer since they establish reliable data dissemination between the source and destination vehicular nodes by estimating an optimal multicast tree. Moreover, QoS-constraint enforced meta-heuristic approaches are considered to be excellent for determining optimal multicast tree under multicasting. An Enhanced Hybrid Pareto Metaheuritic Algorithm-based Multicast Tree Estimation Scheme (EHPMA-MTES) is contributed for reliable multicast routing. The proposed EHPMA-MTES is confirmed to reduce the cost of transmission by 28% through the minimization of the multicast tree count formed during the process of multicast routing.

Multi-Source Reliable Multicast Routing with QoS Constraints of NFV in Edge Computing

Edge Computing (EC) allows processing to take place near the user, hence ensuring scalability and low latency. Network Function Virtualization (NFV) provides the significant convenience of network layout and reduces the service operation cost in EC and data center. Nowadays, the interests of the NFV layout focus on one-to-one communication, which is costly when applied to multicast or group services directly. Furthermore, many artificial intelligence applications and services of cloud and EC are generally communicated through groups and have special Quality of Service (QoS) and reliable requirements. Therefore, we are devoted to the problem of reliable Virtual Network Function (VNF) layout with various deployment costs in multi-source multicast. To guarantee QoS, we take into account the bandwidth, latency, and reliability constraints. Additionally, a heuristic algorithm, named Multi-Source Reliable Multicast Tree Construction (RMTC), is proposed. The algorithm aims to find a common link to place the Service Function Chain (SFC) in the multilevel overlay directed (MOD) network of the original network, so that the deployed SFC can be shared by all users, thereby improving the resource utilization. We then constructed a Steiner tree to find the reliable multicast tree. Two real topologies are used to evaluate the performance of the proposed algorithm. Simulation results indicate that, compared to other heuristic algorithms, our scheme effectively reduces the cost of reliable services and satisfies the QoS requirements.

Energy Efficient Communications for Reliable IoT Multicast 5G/Satellite Services

Satellites can provide strong value-add and complementarity with the new cellular system of the fifth generation (5G) in cost-effective solutions for a massive number of users/devices/things. Due to the inherent broadcast nature of satellite communications, which assures access to remote areas and the support to a very large number of devices, satellite systems will gain a major role in the development of the Internet of Things (IoT) sector. In this vision, reliable multicast services via satellite can be provided to deliver the same content efficiently to multiple devices on the Earth, or for software updating to groups of cars in the Machine-to-Machine (M2M) context or for sending control messages to actuators/IoT embedded devices. The paper focuses on the Network coding (NC) techniques applied to a hybrid satellite/terrestrial network to support reliable multicast services. An energy optimization method is proposed based on joint adaptation of: (i) the repetition factor of data symbols on multiple subcarries of the transmitted orthogonal frequency division multiplexing (OFDM) signal; and (ii) the mean number of needed coded packets according to the requirements of each group and to the physical satellite links conditions.

Current State of Multicast Routing Protocols for Disruption Tolerant Networks: Survey and Open Issues

The deployment of Internet of Things (IoT) applications in remote areas, such as environmental sensing areas, requires Disruption Tolerant Networking (DTN) support due to the lack of continuous network connectivity. IoT devices in DTN generate and store data until a network link is available for data transmission. Data mules or ferries are scheduled to travel among intermittent networks to collect data and disseminate configuration updates from control centers to all participating nodes in a reliable manner. The incorporation of efficient, reliable multicast algorithms into DTN helps to overcome the current limitations in updating large numbers of nodes in remote areas with identical configurations. In this paper, the current state of multicast routing protocols in DTN is outlined according to their design aspects. Open issues are also discussed to provide impetus for further research into the Reliable Multicast DTN (RMDTN) protocol.