Multicast Routing Scheme Research Articles

IDR: Intent‐driven routing strategy for reliable and cost‐effective multicasting in airborne tactical networks

AbstractTraditional multicast routing strategies can hardly meet the demanding requirements of multicasting mission assignment messages in airborne tactical networks. This letter proposes an intent‐driven routing strategy, termed as IDR, to realize reliable and efficient multicast. IDR exploits bit index explicit replication technique to encode not only the destination information but also the retransmission information into packet headers. If part of the multicast members failed to receive the packet, IDR can perceive the error and retransmit the packet to the precise set of nodes. Compared to the state‐of‐the‐art reliable multicast routing methods, IDR can enhance multicast retransmission success rate by about 10% or more and reduce retransmission overhead by around 50%.

On Efficient Delay-Aware Multisource Multicasting in NFV-Enabled Softwarized Networks

To comply with security and performance policies, multicast communication requires inline service that chains an ordered sequence of virtualized network functions (VNFs) with an emerging paradigm of network function virtualization (NFV). As many-to-many multicast pattern is widely used especially in current MEC, multimedia and big data industries, in this paper we focus on multi-source NFV-enabled multicasting in software-defined networks (SDN). By jointly investigating VNF placement and multicast tree routing strategy, it is envisioned to construct service function tree with minimum network resource expenditure while yielding lower delay. We explore this problem in static and online scenarios individually. In static situation with a bunch of multicast requests to be served, a column generation based computing model is first formulated, based on which an approximation algorithm MDNM that leverages logic of Viterbi and puts emphasis on resource optimization and segmental delay satisfaction is developed. In online situation with a single incoming request, another ILP model to enhance VNF instance reuse is established. Then, SVM algorithm giving importance to source determination and VNF instance consolidation is designed to efficiently construct a service function tree with minimum resource usage and delay. Simulation results show that the gap between each of the two proposed algorithms and their respective ILP models is marginal, and both MDNM and SVM outperform the state-of-art work.

GOR: Group-oblivious multicast routing in airborne tactical networks under uncertainty

Disseminating mission assignment messages always requires effective and flexible multicast routing scheme design in airborne tactical networks, in particular, when the multicast group members are under uncertainty. Traditional IP multicast routing strategies have little regard for the uncertainty of multicasting in airborne tactical networks, wherein the multicast groups are highly unpredictable and are changing over different sessions. In this work, we present a group-oblivious multicast routing strategy, termed as GOR, to hedge against the uncertainty of multicasting in airborne tactical networks. GOR exploits Bit Index Explicit Replication (BIER) technique for the sake of stateless multicast. In order to minimize multicast delay, GOR re-formulates the hierarchical deployment of BIER into a modified group Steiner tree problem for a better routing. Both analytical and experimental results demonstrate that the presented GOR can provide reasonably better multicast performance across all possible sets of group members.

A Hybrid-Mode On-Chip Router for the Large-Scale FPGA-Based Neuromorphic Platform

Large-scale neuromorphic computing requires the multi-chip network to provide high computing power. Efficient routing schemes and on-chip router design are necessary for handling various inter-chip transmission patterns. In this paper, we propose a hybrid-mode on-chip router that supports both multicast and unicast routing for the large-scale neuromorphic simulation. Two routing schemes, namely Cache-like Spike Weight Indexing and General Unicast Flow Control, are proposed to accommodate the chip-to-chip transmission of spike and non-spike data. This work is evaluated on a neuromorphic platform built with an <inline-formula> <tex-math notation="LaTeX">$8\times 8$ </tex-math></inline-formula> FPGA chips array. Running a simulation of 1M neurons at 200MHz, the proposed router achieves a processing latency of 25ns and a chip-to-chip latency of 287ns. Working in the unicast mode, the router can synchronize status flags of all chips within <inline-formula> <tex-math notation="LaTeX">$5 ~\mu \text{s}$ </tex-math></inline-formula>. Moreover, it reduces the peak spike traffic by 25.65&#x0025; with the help of Load-aware Multicast Routing, compared with other multicast routing strategies.

QoS-VNS-CS: QoS constraints Core Selection Algorithm based on Variable Neighborhood Search Algorithm

Within the development of network multimedia technology, more and more real-time multimedia applications arrive with the need to transmit information using multicast communication. Multicast IP routing is an important topic, covering both theoretical and practical interest in different networks layers. In network layer, there are several multicast routing protocols using multicast routing trees different in the literature. However PIM-SM and CBT protocols remains the most used multicast routing protocols; they propose using a shared Core-based Tree CBT. This kind of tree provides efficient management of multicast path in changing group memberships, scalability and performance. The prime problem concerning construction of a shared tree is to determine the best position of the core. QoS-CS’s problem (QoS constraints core Selection) consists in choosing an optimal multicast router in the network as core of the Shared multicast Tree (CBT) within specified QoS constraints associated. The choice of this specific router, called RP in PIM-SM protocol and core in CBT protocol, affects the structure of multicast routing tree, and therefore influences performances of both multicast session and routing scheme. QoS-CS is an NP complete problem need to be solved through a heuristic algorithm, in this paper, we propose a new core Selection algorithm based on Variable Neighborhood Search algorithm and new CMP fitness function. Simulation results show that good performance is achieved in multicast cost, end-to-end delay, tree construction delay and others metrics.

A Novel Approach to Support Scalable Multicast Routing in Wireless Ad Hoc Networks

Nowadays, group communications over Mobile Ad hoc Networks (MANETs) have received significant attention. Multicasting plays an important role in simultaneous delivery of information to group of receivers. Thus, it is necessary to design efficient and effective multicast routing protocol to support group communication applications. Several efforts have been put to improve multicast routing. However, they do not consider scalability issue. This paper introduces a a novel Scalable Geographic Multicast Routing Protocol (SGMRP). The main objective of this protocol is to design a lightweight scalable multicast routing scheme irrespective of the number of multicast members and network size. To achieve this, a virtual clustering strategy has been introduced. This strategy based on partitioning the network into sectorial zones. The proposed solution performs efficient packet forwarding with reduced communication overhead. The proposed scheme eliminates the duplicate packets between clusters and reduces the number of participating nodes

Multiobjectives for Optimal Geographic Routing in IoT Health Care System

In numerous internet of things (IoT) appliances, messages might require to be distributed to certain specified nodes or objects with the multicast transmission. “The multicast routing protocol can be divided into nongeographic based and geographic based.” As locations of device are roughly extracted by GPS devices, geographic‐oriented multicast routing schemes were chosen, because it induces lesser overheads. Nevertheless, the extant geographic‐oriented routing models are found to have particular disadvantages. After the advent of the IoT systems for remote healthcare, medical services can be rapidly provided to patients in rural areas. The IoT network encapsulates flexible sensors in the environment to collect environmental information. This gathered sensor information is sent to the nursing stations for timely medical assistance. The IoT network is wireless, which leads to security breaches. Therefore, there is a necessity to have a secured data transmission in the context of healthcare. Hence, this study intends to propose a novel optimal route selection model in IoT healthcare by deploying optimized ANFIS. Here, the optimal routes for medical data are selected using a new self‐adaptive jellyfish search optimizer (SA‐JSO) that is the enhanced edition of the extant JSO model. Accordingly, the optimal route selection for medical data is performed under the consideration of “energy, distance, delay, overhead, trust, quality of service (QoS), and security (high risk, low risk, and medium risk).” In the end, the performances of adopted work are compared and proved over other extant schemes.

A Multicast Routing Scheme for the Internet: Simulation and Experimentation in Large-Scale Networks

With the globalisation of the multimedia entertainment industry and the popularity of streaming and content services, multicast routing is (re-)gaining interest as a bandwidth saving technique. In the 1990’s, multicast routing received a great deal of attention from the research community; nevertheless, its main problems still remain mostly unaddressed and do not reach the acceptance level required for its wide deployment. Among other reasons, the scaling limitation and the relative complexity of the standard multicast protocol architecture can be attributed to the conventional approach of overlaying the multicast routing on top of the unicast routing topology. In this paper, we present the Greedy Compact Multicast Routing (GCMR) scheme. GMCR is characterised by its scalable architecture and independence from any addressing and unicast routing schemes; more specifically, the local knowledge of the cost to direct neighbour nodes is enough for the GCMR scheme to properly operate. The branches of the multicast tree are constructed directly by the joining destination nodes which acquire the routing information needed to reach the multicast source by means of an incremental two-stage search process. In this paper we present the details of GCMR and evaluate its performance in terms of multicast tree size (i.e., the stretch), the memory space consumption, the communication cost, and the transmission cost. The comparative performance analysis is performed against one reference algorithm and two well-known protocol standards. Both simulation and emulation results show that GCMR achieves the expected performance objectives and provide the guidelines for further improvements.

Brain Storm Water Optimisation-Driven Secure Multicast Routing and Route Maintenance in IoT

In several Internet of Things (IoT) applications, messages are disseminated to some objects or nodes based on multicast transmissions. However, previous multicast routing schemes in IoT focussed mainly on the ad-hoc sensor network, but they are not robust and responsive in the IoT environment. Hence, this paper introduces the multicast routing protocol based on the proposed optimisation algorithm, named Brain Storm Water Optimisation (BSWO), in the IoT network. By the multicast routing protocol, the multicast path is designed from a multicast source node to various destinations. The multicast source node forwards packet to multiple destinations simultaneously. Initially, the nodes in the IoT network are simulated together and perform the multicast routing process effectively using the proposed optimisation framework. The multicast routing protocol performs the multicast routing mechanism using the multiobjective factors, such as distance, delay, energy, link-quality factor and trust. The multicast routing path is effectively chosen based on the developed BSWO through fitness measures. The proposed BSWO is designed by integrating the Brain Storm Optimisation (BSO) and Water Wave Optimisation (WWO), respectively. The path with the minimum distance is selected as an optimal path using the fitness parameters like delay, distance, trust, energy and link-quality factor. The proposed optimisation algorithm effectively performs the multicast routing mechanism by integrating the parametric features from both the optimisation algorithms. Once the multicast routing mechanism is done, the route maintenance process is carried out in the simulated IoT network to recover the link breakage. The proposed BSWO outperformed other methods with the minimal delay of 0.0682[Formula: see text]s, minimal average routing distance of 178.4[Formula: see text]m, maximal energy of 39.59[Formula: see text]J, maximal throughput of 87.75% and maximal trust of 90%, respectively.

Multicast routing strategy for SDN-cluster based MANET

The energy limitation and frequent movement of the mobile Ad hoc network (MANET) nodes (i.e., devices) make the routing process very difficult. The multicast routing problem is one of the NP-complete problems. Therefore, the need for a new power-aware approach to select an optimum multicast path with minimum power consumption that can enhance the performance and increase the lifetime of MANET has become urgent. Software defined network (SDN) is a new technique that can solve many problems of the traditional networks by dividing the architecture into data part and control part. This paper presents three power-aware multicast routing strategies for MANET. First one called a Reactive Multicast routing strategy for cluster based MANET by using SDN (RMCMS), second one called proactive multicast routing strategy for cluster based MANET by using SDN (PMCMS) and third one represents modification of PMCMS called M-PMCMS. Moreover, it produces a new mathematical model to build a multicast tree with minimum power consumption and takes into account the remaining power in each node. All proposed multicast strategies operate based on this mathematical model and aim to maximize the MANET lifetime by exploiting the advantages of SDN and clustering concepts. They consider the multicast tree with minimum power consumption as an optimal one. The simulation results illustrated that RMCMS is better than PMCMS, M-PMCMS, and MAODV in terms of power consumption and network overhead while M-PMCMS is the best one in terms of dropped packets ratio (DPR) and average end to end (E2E) delay.

A Novel Tree‐Based Genetic Algorithm for the Multicast Protocol in Two‐Tiered WSNs

Genetic algorithms (GAs) serve as a class of powerful tools to search for an effective multicast routing scheme among multiple cluster header nodes, which strongly affects the lifetime of two-tiered Wireless sensor networks (WSNs). This paper proposes a novel Genetic algorithm (GA) with a new crossover mechanism called Leaf crossover for the multicast routing among upper tier nodes in two-tiered WSNs, which outperforms the existing popular tree-based GAs by not requiring the global network link information, encoding/decoding or repair operations. Our simulation study indicates that the proposed algorithm could prolong the lifetime of multicast service, increase the packet delivery ratio as well as converge fast by comparison with existing GAs.

Efficient Event Notification Middleware for Smart Microgrids Over P2P Networks

Microgrids (MGs) are moving toward large-scale smart distributed networks which demand an efficient and reliable communication infrastructure to manage, control and monitor energy resources. With regard to this, publisher/subscriber event-based middleware has become relevant for large-scale distributed time applications because it allows decouple time and space between senders and receivers. Particularly the content publish/subscribe systems over structured peer-to-peer (P2P) networks has emerged to enhance scalability and dynamism of notification middleware systems. However, this type of systems use multicast routing schemes that still generate much network traffic and as a consequence an overload of the communication channel is produced. This results in inefficient network utilization and rapid depletion of network resources leading to unreliable operations, degradation of system performance and even instability of the MG. In this paper, a new content-based publish/subscribe notification middleware over structured P2P systems is proposed, such that smart MG communication requirements are met. This proposed system organizes the publications and subscriptions in a 1-D representation using the Hilbert space filling curve. Through this representation, innovative routing and matching algorithms are developed. Experimental results demonstrate that the proposed publisher/subscribe system significantly enhance efficiency of the system, network performance and the use of computational resources.

WBMR: a new communication scheme for multicast routing in MANETs

There is a great demand for multicast route deployment and time varying link strategies which makes routing difficult in ad-hoc networks. Thus, finding the optimal routes with multicast behaviour in mobile ad hoc networks (MANETs) is a critical issue. The deployed route should fulfil the necessary requirements of MANET, like power utilisation, efficient utilisation of bandwidth, loop free communication, link stability and minimised usage of control overheads. Thus in research, the proposed Weight Based Multicast Routing (WBMR) protocol addresses the critical issues like loop free communication and link stability, which simultaneously yields the optimum routes and reduced energy utilisation of the nodes in MANETs. This proposition uses the weight based routing approach which is based on the distance and signal to noise ratio (SNR) of the demanding links. This WBMR protocol minimise the number of nodes participated in the communication in association with link stability and thus minimise the unnecessary utilisation of bandwidth and energy. The simulated results show that the implemented approach outperforms well when compared with the existing approaches in multicast routing schemes.

Reducing the Overhead of Multicast Using Social Features in Mobile Opportunistic Networks

Through utilizing user mobility and short-range device-to-device communication techniques, mobile opportunistic networks (MONs) enable end-to-end message delivery without the dependence on reliable network infrastructures. Examples of these networks include mobile social networks and vehicular networks. Multicast in MONs is used to disseminate information to a group of mobile nodes, which have attracted considerable attention due to high resource utilization. In this paper, we focus on reducing the overhead of multicast in MONs without compromising the delivery performance, through utilizing static social features of nodes and time-varying social behaviors. We first conduct a trace data analysis using the information entropy theory to identify the most important and representative social features in a popular trace, the Infocom06 trace. Based on these static social features, we propose a Social Profile-based Multicast (SPM) routing scheme, that supports efficient multicast message dissemination with a small maintenance overhead, i.e., little cost on maintaining the historical records. Furthermore, by exploring the time-varying social behaviors during daytime and nighttime, we verify that a small number of forwardings during that daytime is sufficient to achieve a desirable delivery ratio. We thus propose an improved overhead-reducing scheme Social Profile-based Multicast-Overhead Reducing (SPMOR) that restricts the number of forwardings during the daytime. The extensive trace-driven simulations show that SPM achieves desirable delivery performance with small maintenance and transmission cost, and SPMOR can further reduce the transmission overhead under diurnal user behaviors. At last, we conduct a similar study on a campus-based MON trace, SocialBlueConn. We find that the main conclusions and performance results on SocialBlueConn are consistent with the Infocom06 trace, which verifies our methodology is scalable.

Design and Implementation of a Central-Controllable and Secure Multicast System Based on Universal Identifier Network

With the rapid increase of network users and services, the breadth and depth of Internet have greatly changed. The mismatch between current network requirements and original network architecture design has spurred the evolution or revolution of Internet to remedy this gap. Lots of research projects on future network architecture have been launched, in which Universal Identifier Network (UIN) architecture that is based on the identifier/location separation, access/core separation and control/forwarding separation can provide better mobility, security and reliability. On the other hand, the demand of group communication has increased due to the fine-grained network services and successive booming of new applications such as IoT (Internet of Things). Most of current multicast schemes are based on the open group model with open group membership (multicast only care the multicast group state, not the group member) and open access to send/receive multicast data, which are beneficial to multicast routing for its simplification. However, the open group membership makes the group member management difficult to be realized, and open access may result in lots of security vulnerabilities such as Denial of service (DoS), eavesdropping and masquerading, which make deployment more difficult. Therefore, in this paper we propose a Central-Controllable and Secure Multicast (CCSM) system based on the UIN architecture, and redesign the multicast service procedures including registration, join/leave, multicast routing construction and update with objective to achieve better mobility support, security, scalability and controllable. More specifically, we design a new group management scheme to perform the multicast members join/leave with authentication and a central-controllable multicast routing scheme to provide a secure way to set up multicast entries on routers. The CCSM inherits the characteristics of UIN in terms of mobility and security, and it can provide the centralized multicast routing computation and distributes the multicast routing into forwarders. We compare CCSM with Protocol Independent Multicast-Sparse Mode (PIM-SM), and the results show that CCSM reduces the multicast join delay, and performs better than PIM-SM in term of reconstruction cost under low multicast density.

Network-on-Chip Multicast Architectures Using Hybrid Wire and Surface-Wave Interconnects

The network-on-chip (NoC) has been introduced as an efficient communication backbone to tackle the increasing challenges of on-chip communication. Nevertheless, merely metal-based NoC implementation offers only limited performance and power scalability in terms of multicast and broadcast traffics. To meet scalability demands, this paper addresses the system-level challenges for intra-chip multicast communication in a proposed hybrid interconnects architecture. This hybrid NoC combines and utilizes both regular metal on-chip interconnects and new type of wireless-NoC (WiNoC) which is Zenneck surface wave interconnects (SWI). Moreover, this paper embeds novel multicast routing and arbitration schemes to address system-level multicast-challenges in the proposed architecture. Specifically, a design exploration of contention handling in SWI layer is considered in both centralized and decentralized manners. Consequently, the hybrid wire-SWI architecture avoids overloading the network, alleviates the formation of traffic hotspots and avoid deadlocks that are typically associated with state-of-the-art multicast handling. The evaluation is based on a cycle-accurate simulation and hardware description. It demonstrates the effectiveness of the proposed architecture in terms of power consumption (up to around $10$ x) and performance (around $22$ x) compared to regular NoCs. These results are achieved with negligible hardware overheads. This study explore promising potential of the proposed architecture for current and future NoC-based many-core processors.

NEMO: Novel and efficient multicast routing schemes for Hybrid Data Center Networks

Multicast places an important role in group communication in data center networks (DCN’s). As the rapid development of DCN’s, researchers elegantly integrate wireless connections with wired DCN to form a new structure, Hybrid Data Center Network (HDCN), which can improve the performance of multicast significantly with wireless gains. In this paper, we present two novel and efficient multicast routing schemes (named NEMO-Group and NEMO-Cluster) for HDCN to achieve fast multicast tree construction and simple network traffic routing. We theoretically analyze the expected performance improvement of the two designs with different wireless transmission ranges. To the best of our knowledge, we are the first to discuss the sender-driven polynomial-time multicast routing schemes for HDCN, and to estimate the upper and lower bound of wireless gains. Moreover, our numerical results show that with the same construction cost, NEMO’s reduce 15%–40% traffic and improve 10%–40% throughput than the existing multicast protocols.

Joint interference optimization and user satisfaction improvement for multicast routing and channel assignment in wireless mesh networks

Multicast communication is a key technology for wireless mesh networks. In order to reduce co-channel interference in multicast transmission, we jointly study multicast tree construction and channel assignment in this paper. First, interference in multicast is analyzed and measured with considerations of hidden node problem and user coverage. Then, an algorithm called CIOMT is proposed to construct multicast routing tree, In which we find the path with minimum interference to root and add it to the constructing multicast tree, give an upper limit to the source-to-destination distance for QoS consideration, and tree structure is optimized to relieve interference among multicast links. Moreover, we propose a channel assignment algorithm for the constructed multicast tree with the name CIOCA. In CIOCA algorithm, in order to provide good service to the users as much as possible, we take the user coverage of each destination as the top priority in channel assignment, and the nodes are assigned the sending channels by descending order of priority. In each step, we find the channel with minimum interference to the whole tree, and assign it to the related nodes. For making full use of spectrum resources, the non-overlapping and overlapping channels are both taken into consideration. At last, simulation is done, and the results show the effectivity of the proposed multicast routing scheme. As far as user satisfaction is concerned, the proposed scheme has much better performance than the other two classic algorithms.

Fuzzy enhanced secure multicast routing for improving authentication in MANET

Security is a major concern in mobile ad hoc network (MANET) that ensure packet authentication and integrity. A data transmitted from source to destination node has to be protected from the active and passive attacks. Certificate based secure routing scheme are developed precisely to ensure authentication with certificate mechanism. However, this paper uses fuzzy enhanced secure multicast routing (FSMR) scheme ensure better security in network and data. To estimate the presence of misbehaving nodes, FSMR is established based on normal and abnormal behaviors from the statistical data. Certificateless routing is used in the proposed system and it authenticates the data from the concept of key generation, signcryption and unsigncryption. Packets are routed and validated without the knowledge of certificate routing. The evaluation on proposed system proves that the proposed system has better data packet authentication with lesser energy consumption. Further, the proposed system attains better performance in terms of authenticity, data integrity, network lifetime, average delay and maximum throughput.

Adaptive Link Aware on-demand Multicast Routing Scheme in MANET

&lt;em&gt;The main objective of this paper is to propose a new multicast routing scheme to adopt with the dynamic topology of MANET at the same time to provide high multicast efficiency and packet delivery ratio. The proposed scheme is named as Link Aware on Demand Multicast Routing (LAOMR) scheme. In this scheme, initially the source node forms the multicast group by announcing itself as a multicast source agent to all the nodes in the network. The nodes which are eager to join in the group are sending the join request to the source node. Then the source node finds the route to reach the multicast group through some intermediate nodes. The intermediate nodes are not interested to hear the multicast message but they are act as the routers to forward the packets to the multicast group. The intermediate nodes are chosen based on the link residual life (LRL) of the nodes. The node which has the highest LRL and closer to the multicast group is selected as the forwarder node. So, the proposed scheme reduces the link failure in the multicast route and increases the multicast efficiency, throughput. The performance is evaluated by using the simulation results obtained from NS2 Simulator.&lt;/em&gt;