Multicast Data Transmission Research Articles

Network Coding Datagram Protocol for TCP/IP Networks

In this article, a new multicast protocol is introduced at the session layer, which is based on network coding and is called the Network Coding Datagram Protocol (NCDP). The NCDP protocol is specifically designed for content delivery systems that utilize multicast data transmission from multiple sources. The development of the NCDP packet and its operational logic takes into consideration the variability of the protocols used in conjunction with it, as well as the packet header processing algorithms for routing nodes-coders. Additionally, a virtual laboratory bench is proposed to facilitate research on the operation of the protocol. The article also includes the results of testing the NCDP protocol in networks with butterfly and diamond topologies, with a comparison between simple sequential multicast transmission and network coding transmission.

Spatial Linear Coding in Joint Radar and Multicast Communication Systems

Introduction. This paper presents optimization methods for the amplitude-phase distribution in a transmitting antenna array in a system with a common signal for multicast data transmission and radar sensing in a given sector of space. Two approaches are considered for the choice of an objective function for the optimization problem. The first approach involves minimizing the transmitted power for a given quality of user service and radar surveillance. The second approach involves optimizing the quality of service for the worst radar and communication channel under a given power budget. The value that determines the quality of service is the signal-to-noise ratio, for both communication and radar.Aim. Тo solve the optimization problem of spatial linear coding of signals in a joint multicast radar and communication system, which shares a common signal.Materials and methods. Optimization of spatial linear coding in a joint radio radar and communication system was carried out by the methods of statistical theory and optimization theory using the numerical solution of optimization problems. The performance characteristics of the system were analyzed by Monte Carlo simulation. Statistical simulation was performed in the MATLAB environment using standard tools, as well as the CVX package for the numerical solution of convex optimization problems.Results. Optimization problems were formulated based on the criteria of the minimum radiated power and the maximum signal-to-noise ratio in the worst channel. A limitation on the radiated power of individual antenna channels was used for both cases. Optimization problems were approximately reduced to convex problems with semidefinite constraints, which could be solved using the wellknown interior point algorithm with polynomial complexity. The performed statistical simulation produced optimal performance characteristics of a joint system, including the total power versus the threshold signal-to-noise ratio and the signal-to-noise ratio for the worst channel versus the power budget.Conclusion. The proposed numerical optimization methods for spatial linear coding in a transmitting antenna array can be recommended when designing joint radar communication systems.

The concept of multicast protocol based on network coding

Research subject. The paper presents the concept of a multicast session protocol based on the net-work coding method. Method. Development of a data transfer protocol based on the analysis of existing principles and models of network coding. Core results. The proposed NCDP multicast protocol is de-signed to work over a datagram transport protocol. The basic structure of the NCDP packet header has been developed, taking into account the variability of the protocols used in conjunction with NCDP. Prac-tical relevance. The proposed protocol is intended for use in content delivery systems based on mul-ticast data transmission from several sources.

Efficient Management of Multicast Traffic in Directional mmWave Networks

Multicasting is becoming more and more important in the Internet of Things (IoT) and wearable applications (e.g., high definition video streaming, virtual reality gaming, public safety, among others) that require high bandwidth efficiency and low energy consumption. In this regard, millimeter wave (mmWave) communications can play a crucial role to efficiently disseminate large volumes of data as well as to enhance the throughput gain in fifth-generation (5G) and beyond networks. There are, however, challenges to face in view of providing multicast services with high data rates under the conditions of short propagation range caused by high path loss at mmWave frequencies. Indeed, the strong directionality required at extremely high frequency bands excludes the possibility of serving all multicast users via a single transmission. Therefore, multicasting in directional systems consists of a sequence of beamformed transmissions to serve all multicast group members, subgroup by subgroup. This paper focuses on multicast data transmission optimization in terms of throughput and, hence, of the energy efficiency of resource-constrained devices such as wearables, running their resource-hungry applications. In particular, we provide a means to perform the beam switching and propose a radio resource management (RRM) policy that can determine the number and width of the beams required to deliver the multicast content to all interested users. Achieved simulation results show that the proposed RRM policy significantly improves network throughput with respect to benchmark approaches. It also achieves a high gain in energy efficiency over unicast and multicast with fixed predefined beams.

SPECIAL CASE OF DETERMINING FLOW PARAMETERS OF MULTI-SERVICE TELECOMMUNICATION NETWORK

The task of research of non-Poisson trafc obtained during the procedure of statistical characterization at the specifed rates of packets arrival is considered. In order to investigate the statistical characteristics of multimedia stream, multicast data transmission is considered, which implies that the server generates one data stream and sends it over the network to connected clients. The load rate of the total packet fow at each point in time depends on the software products serving the outgoing requests and the requests number ratio by taking into account these software products. Based on histograms of measurements, approximate functions of time interval distributions between packets and duration of packets, their approximating expressions are obtained in the form of sum of damped exponents satisfying the properties of distribution density function of random quantity. Values for the average packet delay time in the network and queue length are obtained using the spectral method of solving the Lindley integral equation for G/G/1 queuing system. The solution accuracy is determined by the approximation accuracy of the «heavy» tail distributions used.

Multicast improvement for LOADng in Internet of Things networks

The Lightweight On-demand Ad hoc Distance-vector Routing Protocol – Next Generation (LOADng) is an emerging routing solution for low-power wireless networks, which is receiving much attention and is being adopted in Internet of Things (IoT) networks. Although the current literature has introduced improvements to allow the protocol to fulfill the requirements of a higher set of IoT applications, the multicast support stills a deficiency of the protocol. Thus, to overcome this limitation, this study proposes a multicast improvement for LOADng. The proposal, named Multicast LOADng (M-LOADng) introduces a new route discovery process to enable the construction of a multicast routing tree and perform forwarding multicast data messages. The proposed solution also introduces mechanisms to reduce the control message overhead and increase the reliability of the route discovery process. Further, M-LOADng allows multicast data transmission in three different modes. The conducted experiments, through a real testbed, show that the proposed solution can reach a reliable and constant performance in terms of quality-of-service, energy consumption, and memory usage, even when increasing the multicast group size.

Providing multicast services over SDN-evolved LTE network: Architecture, procedures and performance analysis

The recent innovation in cellular technologies like LTE/LTE-Advanced has increased the demand of high bandwidth services e.g. mobile Internet Protocol TV (IPTV), on-demand video streaming etc. However, current cellular multicast service called Evolved Multimedia Broadcast Multicast Service (eMBMS) is not enough in terms of IPTV service provisioning, flexibility, and efficiency. Software-defined networking (SDN) being an emerging networking paradigm offers its services to program such cellular networks, providing a remotely configurable forwarding plane. This paper enlightens the notion of SDN in cellular multicast data transmission within eMBMS networks. It presents an objective sketch of transforming current multicast cellular communication into OpenFlow based SDN-evolved communication. We perform the first fine-grained analysis of common multicast procedures (group join, handover etc.) involved in both the current and SDN-evolved eMBMS network along with the supporting simulation results while providing multimedia services to the users. Considering user plurality of multicast services, we model the user requests as independent events of a Zipf-like distribution and find out the correlation among multimedia content popularity, operational load on the network and delay metrics. This paper provides a comparison of both the networks, summarizes the significant differences between the two, and highlights the effectiveness of our proposed SDN-evolved multicast approach in terms of minimized network operations, reduced delays, reliable and streamlined multicast tree construction.

Multicast-enabled survivable architecture for wavelength-division-multiplexed passive optical networks

We propose and experimentally demonstrate a multicast-enabled survivable architecture for wavelength-division-multiplexed passive optical networks. By manipulating the sinusoidal control clock and the wavelength of the light source for each downstream wavelength channel at the optical line terminal, different optical subcarriers are generated to provide subscribers with not only multicast data transmission but also survivability against fiber failure in either distribution or feeder fibers. The simultaneous transmissions of 10-Gb/s unicast data and 10-Gb/s multicast data under normal working mode, as well as the 10-Gb/s transmissions for unicast data under protection mode, are experimentally demonstrated.

Opportunistic Transmission Scheme with Raptor Code in IEEE 802.11 Multirate WLANs

In IEEE 802.11 wireless local area networks (WLANs), a fixed low transmission rate is used for multicast transmissions regardless of the channel conditions of the receivers. This may lead to inefficient use of the wireless channel, especially when the access point (AP) has both unicast and multicast data frames in the transmission queue. In this paper, we propose an opportunistic transmission scheme with Raptor code for efficient use of the wireless channel. In contrast to the legacy WLAN AP that has a single first-in-first-out (FIFO) queue, the AP in the proposed scheme maintains two separate queues at the AP: one for unicast data and another for multicast data. When the AP accesses a wireless channel, it decides on the type of data (unicast or multicast) and the transmission rate according to the channel condition and the delay boundary of the multicast data. In addition, Raptor code is applied for reliable multicast data transmission. Our simulation results show that the proposed scheme increases the average data rate and energy consumption saving when compared to the auto rate fallback (ARF), receiver-based auto rate (RBAR), and IEEE 802.11aa, schemes, which determine the transmission data rate only by considering the channel condition.

Performance analysis of hybrid WDM-OTDM optical multicast overlay system employing 120 Gbps polarization and subcarrier multiplexed unicast signal with 40 Gbps multicast signal

In this paper, we have propose and investigated the performance of hybrid WDM-OTDM optical multicast overlay system which employs 120Gbps unicast and 40Gbps multicast data operating over SMF+DCF and amplifier link in C-band. The polarization and subcarrier multiplexed modulation formats are used to obtain 120Gbps unicast data and DPSK (differential phase shift keying) modulation format for 40Gbps multicast data transmission. In multicast operation, DPSK data is superimposed on to multiplexed unicast data channels. The impact of extinction ratio, input power and transmission distance on the performance of proposed system in terms of output optical power, BER and Q-factor has been investigated for both unicast and multicast data. We have also concluded that polarization and subcarrier multiplexed modulation formats are promising option to increase per channel capacity and less vulnerable to CD and PMD. In addition, the proposed system using hybrid modulation techniques offers higher bandwidth utilization efficiency at higher per channel data rate than conventional modulation formats.

Energy-Efficient Two-Stage Cooperative Multicast: Effect of User Density

Exploiting the spatial diversity and path-loss gain provided by the cooperative transmission with the mobile relay (MR), two-stage cooperative multicast (CM) can provide the same performance as conventional multicast does with reduced power consumption. However, this target cannot always be achieved, such as when the user density is low. To investigate the impact of user density on the energy efficiency of CM, selective combining based on average received signal strength (SCA) is assumed for the second-stage signal processing, and maximum ratio combining (MRC) is employed to collect useful signals from the first and second stages. Then, a try-best MR selection scheme is proposed, choosing the successful mobile station closest to the unsuccessful MS as its MR. Based on this MR selection scheme, the coverage analysis is carried out. A lower bound of user density can be numerically obtained, below which the two-stage CM is energy inefficient. The analysis is verified by simulations. It is shown that to guarantee a given coverage performance such as 95%, for a cell with a radius of 1500 m and a multicast data transmission efficiency of 0.45 b/s/Hz, the lower bound of user density for CM to be energy efficient is found to be 13. The total power consumption of two-stage CM is significantly reduced when the number of MSs $(N)$ increases. For $N=\mbox{100}$ , a reduction of 50% could be achieved compared with that of conventional multicast. Moreover, for the signal processing scheme, the SCA assumption is verified to be reasonable for low user density, and MRC could effectively reduce the lower bound of user density from 24 to 13. Finally, the energy efficiency of the proposed CM scheme with try-best MR selection is shown to be much higher than that of existing schemes.

SD-ICN: Toward Wide Area Deployable Software Defined Information Centric Networking

Information Centric Networking that uses content name instead of IP address as routing identifier can handle challenges such as traffic explosion and user mobility, but it also suffers from scalability and incompatibility problems. In this paper by combining the concept of software defined networking and Internet end to end arguments, we propose a wide area deployable software defined information centric networking service model named SD-ICN. SD-ICN employs a dual space structure that separates edge service network and core transmission network. The enhanced SDN techniques are used in edge service network in order to implement intelligent data routing and caching, while traditional IP technique is reserved in core transmission network so as to provide wide area high speed data transmission. Besides, a distributed name resolution system based on the cooperation of different controllers is also presented. The prototype experiments in our campus network show that SD-ICN can be deployed in a scalable and incremental way with no modification of the core network, and can support typical communication modes such as multicast, mobility, multihoming, load balancing, and multipath data transmission effectively.

Multicast Wi-Fi Raptor-enabled data carousel design: simulation and practical implementation

Multicast is an efficient way of transmitting the same set of data to multiple interested users. Unlike the 3rd Generation Partnership Project (3GPP) cellular standards, for Wi-Fi, there is no standardised solution for reliable multicast data transmission. Multicast packets are delivered to multiple users as a broadcast service without support for automatic repeat request. Hence, multicast transmission often results in high packet loss. In order to improve the reliability of multicast delivery, a fixed low-speed (robust) transmission mode can be used. However, this results in the inefficient use of scarce and valuable radio bandwidth. This paper presents a reliable and efficient Wi-Fi multicast delivery solution for use in challenging outdoor environments. An application layer forward error correction (AL-FEC)-enabled data carousel is proposed to enhance reliability. For multicast transmission, we demonstrate that limitations in the Wi-Fi clients are a major source of packet loss, even in ideal channel conditions. Client limitations (particularly data rate limitations) were found to vary as a function of modulation and coding mode, Raptor code parameters and multicast server rate. Our initial Raptor-enabled carousel designs are based on computer simulations and lab-based trials. Analysis is then extended to field trials using a practical implementation of the recommended design. These trials were performed in central Bristol with parameters such as received signal level, packet loss traces and file download times recorded at the clients. Finally, we compare our site-specific simulated results against real-world measurements.

An optimised multicast data transmission scheme in IEEE 802.16j wireless relay networks

Relay enabled wireless networks play a significant role in data transmission, as it not only extends the base station (BS) coverage range but also improves the transmission efficiency of those mobile station (MS) with poor channel conditions. Multicast transmission is an efficient transmission mode and quite suitable for the relay-based networks. However, how to perform the desired multicast transmission in wireless relay network has not been specified. To realise the effective multicast-based data delivery over the whole relay network, we propose an optimised transmission scheme by formulating an objective problem to achieve the desired performance goals. Specifically, an efficient multicast data transmission mechanism with respect to two schedule hops is proposed in detail to implement the optimisation process. Moreover, we also incorporate the spatial reuse into the transmission mechanism to improve the scheduling efficiency. The simulation results verify the efficacy and efficiency of the proposed transmission scheme.

Algorithmic Support of Optimization of Multicast Data Transmission in Networks with Dynamic Routing

This article describes the optimization process for the multicast tree in the networks with dynamic traffic routing, which is based on the channel state and evaluates each channel. The problem of constructing a multicast connections tree on graphs is formalized. The possibility of improving the existing algorithms by selecting certain rendezvous points, as well as the algorithm for reducing the cost of the multicast routing tree are analysed. Simulation of tree construction was made in accordance with the family of Protocol-Independent Multicast protocols and the proposed algorithm. A critical analysis of the simulation results and comparative evaluation of uniformity of loading data channel at multicast routing are carried out.

Enhanced multicast cluster-based routing protocol for delay tolerant mobile networks

The delay-tolerant networks (DTNs) are a network designed to operate effectively over extreme distance. In DTNs, due to the unique characteristic of frequent partitioning, multicasting becomes a considerably different and challenging problem. In this paper we study multicasting in DTNs and propose a multicasting protocol, cluster-based multicast routing protocol (CBMRP), to support clustering in DTNs. Here multicast data transmission is simulated to transmit data to multiple destinations. Initially the distributed clusters are formed based on their EWMA values and depending on the services offered by mobile nodes inside the cluster, they are split into various groups. The data transmitted from source node is received by all the nodes of the group, in which the destination resides. The results show that our proposed protocol increase the network performance in terms of delivery rate as an epidemic routing scheme, and at a substantially lower overhead in multicast data transmission.

Reliable Data Transmission Scheme Based on Network Coding in Wireless Sensor Network

In order to achieve reliable data transmission in clustering structure based data acquisition systems of wireless sensor network, in this paper, we propose a reliable data transmission scheme based on network coding for clustering wireless sensor network. We use random linear network coding to solve reliable multicast data transmission from base station to other nodes, and then combine random linear network coding with multipath routing for transmitting acquired data to the base station, so as to improve the success rate for sending acquired data to the base station. Simulation results show that the proposed algorithm can achieve reliable data transmission with lower energy, and significantly improve the transmission reliability compared to data transmission without using network coding.

Core Selection to Solve Multicast Routing with Delay and Delay-Variation Constraints

The basis of multicast data transmission is to construct a multicast tree. The main problem concerning the construction of a multicast tree is the selection of the root of the shared tree or the core point. Therefore, the algorithm we propose guarantees that the delay from the source to any destination does not exceed a real-time constraint satisfying the delay-variation constraint under cost minimization. The core selection function in this algorithm achieves a balance of optimizing cost and delay of the multicast tree. Simulation results show that the algorithm has low complexity and balances between the computational complexity and performance.

Multicast scheduling algorithm supporting spatial mini-slot reuse for IEEE 802.16 mesh networks

In this paper, we propose a mechanism for multicast data transmission in IEEE 802.16 mesh networks aimed at increasing the throughput by incorporating mini-slot spatial reuse. The proposed mechanism includes two novel algorithms: a source-based multicast tree topology construction algorithm followed by an interference-aware multicast scheduling algorithm. The proposed multicast interference-aware scheduling algorithm can be applied to both source-based and rendezvous-based multicast tree topologies. Results of our simulation study show that in comparison to the mechanism used for the IEEE 802.16's standard, the proposed multicast tree generation algorithm reduces the number of consumed mini-slots by 64% on average. Moreover, using the proposed interference-aware scheduling algorithm decreases the number of required mini-slots by a further 22% on average. Therefore, the proposed multicast scheduling mechanism shows a higher throughput than the previous approaches and it is more scalable with respect to increasing the number of multicast groups as well as increasing the number of members inside each multicast group.

A Heuristic Algorithm for Core Selection in Multicast Routing

With the development of network multimedia technology, more and more real-time multimedia applications need to transmit information using multicast. The basis of multicast data transmission is to construct a multicast tree. The main problem concerning the construction of a shared multicast tree is selection of a root of the shared tree or the core point. In this paper, we propose a heuristic algorithm for core selection in multicast routing. The proposed algorithm selects core point by considering both delay and inter-destination delay variation. The simulation results show that the proposed algorithm performs better than the existing algorithms in terms of delay variation subject to the end-to-end delay bound. The mathematical time complexity and the execution time of the proposed algorithm are comparable to those of the existing algorithms.