Multicast Network Research Articles

Multilink Solution for Seamless Transition Between Multicast and Unicast Areas in 5G Core Network

Multilink Solution for Seamless Transition Between Multicast and Unicast Areas in 5G Core Network

Wide-Sense Nonblocking Multicast in WDM Optical Linear Array and Ring Networks with 3-Length Extension Under Longest Link First Routing

The modern scientific growths in optical networks based on wavelength division multiplexing (WDM) are more attractive to satisfy the high bandwidth requirements of the modern internet infrastructure. Moreover, they potential to satisfy the future bandwidth requirements.WDM optical networks act as the backbone for telecommunication and high-performance communication networks. Multicast communication is the simultaneous transmission of data from one source node to many destination nodes available in the network over wavelength division multiplexing. It is extensively deployed in high performance computing and communication networks. In this article, a linear array and ring networks are extended by directly linking all nodes which are separated by two intermediate nodes with additional fibers which is referred as linear array and ring network with 3-length extension. The wavelength allotment methods are proposed to realize one-to-many communication over wavelength division multiplexing optical linear array and ring with 2-length extension under longest link first routing and the minimum wavelength number needed is determined. The minimum wavelength number needed to support for the extended linear array is reduced approximately by 20% when compared with that of a linear array network and for the extended unidirectional ring is reduced approximately by 25% when compared with that of a unidirectional ring network. And also, for the extended bidirectional ring the minimum wavelength number is reduced approximately by 33% when compared with that of bidirectional ring network.

MSK‐PK: A Public‐Key Encryption Cryptosystem with Multiple Secret‐Keys

By allowing intermediate nodes to combine multiple packets before forwarding them, the concept of network coding in multi-cast networks can provide maximum possible information flow. However, this also means traditional encryption methods are less applicable, since the different public-keys of receivers imply different ciphertexts which cannot be easily combined by network coding. While network coding itself may provide confidentiality, its effectiveness heavily depends on the underlying network topology and ability of the eavesdroppers. Finally, broadcast encryption and group key agreement techniques both allow a sender to broadcast the same ciphertext to all the receivers, although they rely on the assumptions of trusted key servers or secure channels. In this paper, we propose a novel public-key encryption concept with a single public-key for encryption and multiple secret keys for decryption (MSK-PK), which has limited ciphertext expansion and does not require trusted key servers or secure channels. To demonstrate the feasibility of this concept, we construct a concrete scheme based on a class of lattice-based multi-trapdoor functions. We prove that those functions satisfy the one-wayness property and can resist the nearest plane algorithm.

Latency and Alphabet Size in the Context of Multicast Network Coding

We study the relation between <i>latency</i> and <i>alphabet size</i> in the context of Multicast Network Coding. Given a graph <inline-formula> <tex-math notation="LaTeX">$G = (V, E)$ </tex-math></inline-formula> representing a communication network, a subset <inline-formula> <tex-math notation="LaTeX">$S \subseteq V$ </tex-math></inline-formula> of sources, each of which initially holds a set of information messages, and a set <inline-formula> <tex-math notation="LaTeX">$T \subseteq V$ </tex-math></inline-formula> of terminals; we consider the problem in which one wishes to design a communication scheme that eventually allows all terminals to obtain all the messages held by the sources. In this study we assume that communication is performed in rounds, where in each round each network node may transmit a single (possibly encoded) information packet on any of its outgoing edges. The objective is to minimize the communication latency, i.e., number of communication rounds needed until all terminals have all the messages of the source nodes. For sufficiently large alphabet sizes (i.e., large block length, packet sizes), it is known that traditional linear multicast network coding techniques (such as random linear network coding) minimize latency. In this work we seek to study the task of minimizing latency in the setting of limited alphabet sizes (i.e., finite block length), and alternatively, the task of minimizing the alphabet size in the setting of bounded latency. We focus on the establishing the computation complexity of the problem and present several intractability results. In particular, through reductive arguments, we prove that it is NP-hard to (i) approximate (and in particular to determine) the minimum alphabet size given a latency constraint; (ii) approximate (and in particular to determine) the minimum latency of communication schemes in the setting of limited alphabet sizes.

Secure Message Transmission Using Centralized Group Key Distribution Protocol

Abstract: In the secure message transmission, transmitted information can only receive by the authorized group members. To achieve a secure communication, symmetric key (group key) is used to both encrypt and decrypt the information, that shared among the group members. This paper, proposes an efficient centralized group key management scheme (GKDP) for achieving a secure multicast communication between the group members that reduces the cost of computation of SERVER(S) and rekeying cost of group members. The group key (GK) generated in the multicast network is securely distributed with the help of the RSA cryptosystem. Whenever the new member joins the group, computation cost of S reduced by performing single addition, multiplication and encryption, for updating the group key (GK). Whenever the member leaves the group, S performs single subtraction, division and encryption, for updating the group key (GK). By comparing with existing group key management protocol, the proposed protocol has significantly reduced computation complexity and rekeying cost. The proposed protocol is tested on star topology, the test results compared with existing group key management protocol. The comparison results show that the proposed protocol is efficient in terms of reducing the computational complexity of S and rekeying cost of group members. Index Terms: Secure multicast, rekeying cost, computational complexity, centralized group key management.

Wide-Sense Nonblocking Multicast in WDM Optical Linear Array and Ring Networks with 2-Length Extension under Index Based Routing

Multicast communication is the concurrent transmission of data from one source node to many destination. It is widely deployed in high performance computing and communication networks.In this paper, a linear array and ring networks are extended by directly linking all nodes which are separated by one intermediate node with additional fibers which is referred as linear array and ring network with 2-length extension and wide sense nonblocking multicast is studied. The wavelength allotment methods are proposed to realize one-to-many communication over wavelength division multiplexing optical linear array and ring with 2-length extension under index-based routing and the minimum wavelength number needed is determined. The minimum wavelength number needed to support for the extended linear array and ring topologies is reduced approximately by half when compared with that of a linear array network and ring network.

Multicast Network Security with Asymmetric Cooperative Relaying

Multicast Network Security with Asymmetric Cooperative Relaying

Permute and Add Network Codes via Group Algebras

A class of network codes have been proposed in the literature where the symbols transmitted on network edges are binary vectors and the coding operation performed in network nodes consists of the application of (possibly several) permutations on each incoming vector and XOR-ing the results to obtain the outgoing vector. These network codes, which we will refer to as <i>permute-and-add</i> network codes, involve simpler operations and are known to provide lower complexity solutions than scalar linear network codes. The complexity of these codes is determined by their <i>degree</i> which is the number of permutations applied on each incoming vector to compute an outgoing vector. Constructions of permute-and-add network codes for multicast networks are known. In this paper, we provide a new framework based on group algebras to design permute-and-add network codes for arbitrary (not necessarily multicast) networks. Our framework allows the use of any finite group of permutations (including circular shifts, proposed in prior works) and admits a trade-off between coding rate and the degree of the code. Further, our technique permits elegant recovery and generalizations of the key results on permute-and-add network codes known in the literature.

Quantum Cooperative Multicast in a Quantum Hybrid Topology Network

Quantum multicast is a significant transmission mode in a multiparty communication scenario. Multisource collaboration can further enhance the efficient multicast. However, it remains a challenge to realize quantum multicast with a cooperative way in a complex topology network. In this article, we propose a scheme of quantum cooperative multicast in a hybrid topology network. It provides information aggregation and simultaneous multipoint transmission services. First, collaborative information aggregation allows central network data to be integrated into the aggregation node. By exploiting the quantum multicast mode, the aggregation node can simultaneously deliver integrated quantum states to multiple targets. Second, our scheme is feasible for dynamic network expansion. It is capable of extending the network architecture iteratively, while the peer network requests can be handled in parallel. Finally, the new scheme shows great application potential in the distributed quantum network. It is a promising candidate for the implementation of quantum data disaster backup in future.

Securing Bluetooth Low Energy networking: An overview of security procedures and threats

Bluetooth Low Energy (BLE) is rapidly becoming the de-facto standard for short-range wireless communications among resource-constrained wireless devices. Securing this technology and its networking capabilities is paramount, as their widespread use by Internet of Things (IoT) applications demands protection from malicious users. While its security features have remarkably improved over the years, the BLE technology is still prone to severe threats, creating a gap between the standard theoretical design and its implementation. Particularly, the BLE Mesh Profile (Bluetooth Mesh), which enables many-to-many communication, prompts an overall analysis of its security, to ensure that its use preserves the integrity and privacy of end users. This work surveys the state-of-the-art of the security of BLE with an emphasis on Bluetooth Mesh, highlighting the threats that can still hinder their usage. We review the latest specifications in terms of link set up and authentication and describe attacks to both point-to-point and multicast networking. Our work also discusses solutions to mitigate and prevent attacks to the current standard, such as Intrusion Detection Systems, thus improving the general level of security of BLE systems.

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

Optimal Throughput for Multicast over MANET-Satellite Networks

The convergence of MANET and satellite networks has been considered as one of the potential solutions to provide emergency communication and disaster relief services. However, unreliable MANET and satellite links may influence seriously to data transmission. In this paper, we study the application of packet-level coding for enhancing network throughput for multicast services over integrated MANET-satellite networks. First, we characterize the performance of multicast networks in terms of the probability of packet delivery under different packet-level codes. We then formulate and solve the coding optimization problem for typical values of computational resources at the network nodes given some target probability of successful delivery to the receivers. Finally, several simulation results show significant gains in the average achievable rate at the receivers with respect to routing for representative scenarios with different types of network devices given a strictly-high probability of successful delivery of the multicast networks. Furthermore, the devices with higher computational resources can obtain significantly better throughput gain.

High-performance reliable network-multicast over a trial deployment

A continuing trend in many scientific disciplines is the growth in the volume of data collected by scientific instruments and the desire to rapidly and efficiently distribute this data to the scientific community. As both the data volume and number of subscribers grows, a reliable network multicast is a promising approach to alleviate the demand for the bandwidth needed to support efficient data distribution to multiple, geographically-distributed, research communities. In prior work, we identified the need for a reliable network multicast: scientists engaged in atmospheric research subscribing to meteorological file-streams. An application called Local Data Manager (LDM) is used to disseminate meteorological data to hundreds of subscribers. This paper presents a high-performance, reliable network multicast solution, Dynamic Reliable File-Stream Multicast Service (DRFSM), and describes a trial deployment comprising eight university campuses connected via Research-and-Education Networks (RENs) and Internet2 and a DRFSM-enabled LDM (LDM7). Using this deployment, we evaluated the DRFSM architecture, which uses network multicast with a reliable transport protocol, and leverages Layer-2 (L2) multipoint Virtual LAN (VLAN/MPLS). A performance monitoring system was developed to collect the real-time performance of LDM7. The measurements showed that our proof-of-concept prototype worked significantly better than the current production LDM (LDM6) in two ways. First, LDM7 distributes data faster than LDM6. With six subscribers and a 100 Mbps bandwidth limit setting, an almost 22-fold improvement in delivery time was observed with LDM7. Second, LDM7 significantly reduces the bandwidth requirement needed to deliver data to subscribers. LDM7 needed 90% less bandwidth than LDM6 to achieve a 20 Mbps average throughput across four subscribers.

Scheduling and Power Control for Wireless Multicast Systems via Deep Reinforcement Learning.

Multicasting in wireless systems is a natural way to exploit the redundancy in user requests in a content centric network. Power control and optimal scheduling can significantly improve the wireless multicast network’s performance under fading. However, the model-based approaches for power control and scheduling studied earlier are not scalable to large state spaces or changing system dynamics. In this paper, we use deep reinforcement learning, where we use function approximation of the Q-function via a deep neural network to obtain a power control policy that matches the optimal policy for a small network. We show that power control policy can be learned for reasonably large systems via this approach. Further, we use multi-timescale stochastic optimization to maintain the average power constraint. We demonstrate that a slight modification of the learning algorithm allows tracking of time varying system statistics. Finally, we extend the multi-time scale approach to simultaneously learn the optimal queuing strategy along with power control. We demonstrate the scalability, tracking and cross-layer optimization capabilities of our algorithms via simulations. The proposed multi-time scale approach can be used in general large state-space dynamical systems with multiple objectives and constraints, and may be of independent interest.

A Two-Layered Shared Tree Multicast Routing Algorithm for Software Defined Hybrid Satellite-Terrestrial Communication Networks

Dynamic routing and congestion control are two major problems in software-defined hybrid satellite-terrestrial multicast networks research. Due to terrestrial users being allowed to join or leave the multicast group at any time and the differences between the satellite and the terrestrial networks, many multicast routing algorithms reroute rapidly and thus increase the rerouting overheads. Meanwhile, the congestion ratio is increased by some hot nodes of satellite-terrestrial link transmission paths. This paper focuses on rerouting overheads and congestion problems in satellite-terrestrial multicast networks. We present a satellite-terrestrial network architecture with the Software-Defined Networking (SDN) features to offer dynamic multicast services for terrestrial users. A Two-Layered Shared Tree Multicast (TSTM) routing algorithm is proposed to achieve efficient dynamic multicast group management, address the trade-off between bandwidth consumption and rerouting overheads. The algorithm also implements congestion control by using a load factor to reflect on the global network bandwidth usage in routing calculations. This algorithm balances the rerouting frequencies of satellite and terrestrial networks to decrease the rerouting overheads and also reduces the network congestion ratio. The simulation shows TSTM decreases rerouting cost, user time delay, and node congestion ratio compared with the locality-aware multicast approach (LAMA).

Age and Energy Tradeoff for Multicast Networks With Short Packet Transmissions

Age of information (AoI) and energy efficiency (EE), as two important performance metrics in status update systems, usually cannot be simultaneously optimized. This paper investigates the age and energy tradeoff for multicast networks with retransmissions, where each sensed status update is encoded as a short blocklength packet and is broadcasted to multiple destinations via independent and identically distributed error-prone channels. By considering the stopping threshold, the average AoI and EE expressions for stopping at earliest- <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">l</i> , stopping at preselected- <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">l</i> , and wait-for-all schemes are derived as a function of the packet length. On this basis, the average AoI-EE ratio is introduced and is minimized to trade off age and energy by optimizing the packet length. Numerical results indicate that among the three schemes, earliest- <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">l</i> scheme attains the minimum AoI when the packet length is small, and preselected- <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">l</i> scheme attains the maximum EE when the packet length is large. An optimal packet length can always be found for each scheme to minimize age-energy ratio. Moreover, the selection of stopping threshold <i xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">l</i> will also impact the age and energy performance.

Transmission power assignment in network-coding-based-multicast-wireless-sensor networks

The advantages of both transmission-power assignment and network-coding-based multicast in wireless sensor networks, in reducing the complexity (medium access control and routing), saving energy, and prolonging network lifetime, are well known. To improve the network efficiency, this paper proposes a Memetic ant colony algorithm that combines the transmission power assignment with the network-coding-based-multicast routing. The proposed algorithm stores the solution in a memory and maintains diversity among the population list to accelerate finding the solutions in the dynamic networks. In the proposed algorithm, energy consumption for receiving, the irregular shape of transmission domain, the discrete transmitting power levels of sensors, and dynamical changes in the network features are of concern. The results of the assessments run through simulations indicate that the proposed algorithm could obtain the optimal or near-optimal satisfactory transmission power levels and multicast routes. In addition, the runtime of proposed algorithm is reduced greatly compared to existing methods.

A suggested testbed to evaluate multicast network and threat prevention performance of Next Generation Firewalls

Although security have to be a key issue for systems carrying intelligence such as surveillance system, it is still overshadowed by bandwidth utilization in multicast networks. Next Generation Firewalls (NGFWs), state of the art cyber security devices, can be a solution with their content awareness features for this issue. NGFWs are both security and network devices, and it is a challenge to place a NGFW in a multicast network optimally and testing NGFWs in terms of threat prevention such as web, malware and exploit attack prevention capabilities. In this study, we proposed a flexible testbed for the first time, that can evaluate NGFWs in terms of security and multicast networking performances. The most popular brand datacenter type NGFWs were also tested by using the testbed under various attacks and network designs. The results showed that NGFWs can be used as both rendezvous points in Layer 3 and bridge mode in Layer 2 in multicast networks successfully. Moreover, proposed testbed allows testing the security functions of NGFWs and benchmark them in terms of threat prevention performance.

Node Selection Algorithm for Network Coding in the Mobile Wireless Network

In the multicast network, network coding has proven to be an effective technique to approach maximum flow capacity. Although network coding has the advantage of improving performance, encoding nodes increases the cost and delay in wireless networks. Therefore, minimizing encoding nodes is of great significance to improve the actual network’s performance under a maximum multicast flow. This paper seeks to achieve partial improvements in the existing selection algorithm of encoding nodes in wireless networks. Firstly, the article gives the condition for an intermediate node to be an encoding node. Secondly, a maximum flow algorithm, which depends on the depth-first search method, is proposed to optimize the search time by selecting the larger augmentation flow in each step. Finally, we construct a random graph model to simulate the wireless network and the maximum multicast flow algorithm to analyze the statistical characteristics of encoding nodes. This paper aims at the optimization to find the minimal number of required coding nodes which means the minimum energy consumption. Meanwhile, the simulations indicate that the curve of coding nodes tends to be a geometric distribution, and that the curve of the maximum flow tends to be symmetric as the network scale and the node covering radius increase.

Using a Solution Construction Algorithm for Cyclic Shift Network Coding under Multicast Network to the Transformation of Musical Performance Styles

This paper presents a theoretical framework of the circular shift network coding system through the study of nonmultiple clustered interval music performance style conversion and the analysis of music conversion by using circular shift topology, and a series of basic research results of circular shift network coding is obtained under this framework. It reveals the essential connection between scalar network coding based on finite domain and cyclic shift network coding, designs a solution construction algorithm for cyclic shift network coding under multicast network, and portrays the multicast capacity of cyclic shift network coding. It overcomes the problem that the piano roll-curtain representation cannot distinguish between a single long note and multiple consecutive notes of the same pitch, describes musical information more comprehensively, extracts musical implicit style from the note matrix based on autoencoder, and better eliminates the potential influence of musical content on musical performance style. A two-way recurrent neural network based on the gated recurrent unit is used to extract a sequence of note feature vectors of different styles, and a one-dimensional convolutional neural network is used to predict the intensity of the extracted note feature vector sequence for a specific style, which better learns the intensity variation of different styles of MIDI music.