Scalable reliable multicast using multiple multicast channels

We examine an approach for providing reliable, scalable multicast communication, involving the use of multiple multicast channels for reducing receiver processing costs and reducing network bandwidth consumption in a multicast session. In this approach a single multicast channel is used for the original transmission of packets. Retransmissions of packets are done on separate multicast channels, which receivers dynamically join and leave. We first show that protocols using an infinite number of multicast channels incur much less processing overhead at the receivers compared to protocols that use only a single multicast channel. This is due to the fact that receivers do not receive retransmissions of packets they have already received correctly. Next, we derive the number of unwanted redundant packets at a receiver due to using only a finite number of multicast channels, for a specific negative acknowledgment (NAK)-based protocol. We then explore the minimum number of multicast channels required to keep the cost of processing unwanted packets to a sufficiently low value. For an application consisting of a single sender transmitting reliably to many receivers we find that only a small number of multicast channels are required for a wide range of system parameters. In the case of an application where all participants simultaneously act as both senders and receivers a moderate number of multicast channels is needed. Finally, we present two mechanisms for implementing multiple multicast channels, one using multiple IP multicast groups and the other using additional router support for selective packet forwarding. We discuss the impact of both mechanisms on performance in terms of end-host and network resources     

Performance Investigation of One-to-Six Wavelength Multicasting of ASK–DPSK Signal in a Highly Nonlinear Bismuth Oxide Fiber

We investigate the wavelength multicast performance of a 20 Gb/s (Gigabit per second) orthogonally modulated ASK–differential phase-shift keying (DPSK) signal. The multicast is achieved using four-wave mixing in a 32 cm highly nonlinear bismuth oxide fiber. Six multicast channels each operating at 20 Gb/s are obtained at a 200-GHz spacing, resulting in a 120 Gb/s throughput. Widely opened eye diagrams are obtained in the detection of both the ASK and DPSK components of the multicast channels. Bit error rate measurements have also been performed for both the amplitude and the phase of the signals. A power penalty of less than 3 dB is obtained in all the six multicast channels.      

Regenerative all-optical wavelength multicast for next generation WDM network and system applications

We experimentally demonstrate regenerative all-optical wavelength multicast by simultaneous multi-wavelength conversion of 10 Gb/s non-return-to-zero signals to four ITU 100 GHz spaced channels with a receiver sensitivity improvement of 1.84 dB and less than 0.14 dB difference among all the multicast channels, using a single commercial monolithically integrated SOA-MZI. The multicast device also exhibited about 22 dB optical signal-to-noise ratio enhancement for all the converted channels compared to the original signal channel without wavelength conversion. Our experiment for the first time revealed the regeneration properties of a SOA-MZI device for WDM wavelength multicast purposes, and proved the excellent performance of a simple scheme for various future network and system applications, such as all-optical wavelength routing and grid networking.     

Cognitive multicast with partially overlapped channels in vehicular ad hoc networks

Vehicle to many vehicles (V2MV) multicast is an attractive application to provide vehicle safety and traffic control information, urban sensing and multimedia content sharing in vehicular ad hoc networks. Due to the limitation of DSRC channels, Wi-Fi channels can be alternative to realize the multicast in the vehicular networks. However, the deployment using the Wi-Fi in ISM bands is challenging due to the interference from increasing residential Wi-Fi users as well as inter-vehicle interference. In this study, we propose a cognitive multi-channel, multi-radio multicast protocol, CoCast, borrowing concept of recently developed cognitive radio techniques, which can help overcome such interference, with spectrum sensing and multi-channel assignment. Unfortunately, number of orthogonal channels is very limited in the ISM band to avoid interference in urban Wi-Fi cloud. Therefore, we apply two additional features to use partially overlapped channels: parallel frame transmission over OFDM subchannels to exploit spectral diversity, and network coding for the subchannel frames. Our evaluation results show that the reliability of multicast communication among vehicles in a dense urban environment can be significantly improved with these protocol extensions.     

Secrecy Trade-off at the Physical Layer over Mixed Fading Multicast Channels Employing Antenna Diversity

This paper deals with the secrecy performance analysis of a multicast network over mixed fading scenarios in which a cluster of passive eavesdroppers is trying to overhear the secret transmission. Our key contribution is to prevent this malicious attack of the illegitimate receivers. Rayleigh/ Rician mixed fading channels are considered to model alternately the multicast/ eavesdropper and eavesdropper/ multicast channels as such mixed fading scenarios are often encountered in cellular communication where only one link (either multicast or eavesdropper) undergo a line-of-sight propagation path. At first, we derive the probability density functions for the single-input-multiple-output multicast scenarios and then the secrecy analysis is carried out by obtaining closed-form expressions for the performance matrices such as the probability of non-zero secrecy multicast capacity, ergodic secrecy multicast capacity, and secure outage probability for multicasting. The derived expressions are beneficial to investigate how the antenna diversity can combat the detrimental impact of fading as well as the number of multicast users and eavesdroppers, and improve the secrecy level to the acceptable limit. Moreover, the best secure scenario in terms of the secrecy parameters is obtained when the multicast channels undergo Rician fading whereas the eavesdropper channels experience Rayleigh fading. Finally, the analytical expressions are justified via the Monte-Carlo simulations.

     

Performance of shared-memory switches under multicast burstytraffic

We study shared-memory switches under multicast bursty traffic and characterize the relation between their performance and the multicast distribution that defines the mix of multicast traffic arriving at the switches. We consider two schemes that have been used in practical realizations of these switches to replicate multicast cells: (1) replication-at-receiving (RAR), where multiple copies of a multicast cell are stored in the buffer and served independently, and (2) replication-at-sending (RAS), where a single instance of a multicast cell is stored in the buffer, and the cell is replicated as it is transmitted to the output ports. For each scheme, we study two configurations: (1) the shared-memory-only (SMO) configuration, where the bandwidth of the replication mechanism is sufficient to accommodate even the worst-case replication requirements, and (2) the shared-memory-with-replication-first-in-first-out (SM+RFIFO) configuration, where the bandwidth of the replication mechanism is lower than that required by the worst case, and thus an additional buffer is used in front of the shared memory to temporarily store cells while they are replicated. For all cases, using simulation, we find upper bounds for the buffer requirements to achieve a desired cell-loss rate. We show that these upper bounds are significantly larger than the buffer requirements under unicast traffic and are approached even for very small volumes of multicast traffic; thus, these upper bounds should be used in practice to size the buffers to achieve the desired performance under traffic with general multicast distributions. We also study shared-memory switches with output demultiplexers and characterize and compare the different multicasting schemes that are used in these switches     

Measures to quantify the gain of multicast with application to IPTV transmissions via WiMAX networks

In applications like IPTV, multicasting provides beneficial services. However, due to overhead and problems of multicast transmission, multicasting is not always profitable. In order to make well-justified decisions whether it is worthwhile to use multicasting or not, its efficiency must be quantified. Therefore, the metric of ‘multicast gain’ is introduced as a measure for the bandwidth reduction which can be expected when using multicast (instead of multiple unicast). Different definitions for multicast gain are given to cover different types of links. As an application of our metric, multicast transmission of live TV channels in WiMAX-based access networks is analyzed. WiMAX as one of the 4G candidates can transmit IPTV services to mobile subscribers because of salient features such as multicast support, wide coverage range and high bandwidth. In OFDMA-based WiMAX the smallest logical bandwidth allocation unit is a slot. In this article, we use the term slot to measure the efficiency of multicasting in WiMAX networks. We show that for unpopular TV channels, using unicast flows can be preferable.     

Design and analysis of a large-scale multicast output buffered ATMswitch

Proposes and analyzes a recursive modular architecture for implementing a large-scale multicast output buffered ATM switch (MOBAS). A multicast knockout principle, an extension of the generalized knockout principle, is applied in constructing the MOBAS in order to reduce the hardware complexity (e.g., the number of switch elements and interconnection wires) by almost one order of magnitude. In the proposed switch architecture, four major functions of designing a multicast switch: cell replication, cell routing, cell contention resolution, and cell addressing, are all performed distributively so that a large switch size is achievable. The architecture of the MOBAS has a regular and uniform structure and, thus, has the advantages of: (1) easy expansion due to the modular structure, (2) high integration density for VLSI implementation, (3) relaxed synchronization for data and clock signals, and (4) building the center switch fabric (i.e., the multicast grouping network) with a single type of chip. A two-stage structure of the multicast output buffered ATM switch (MOBAS) is described. The performance of the switch fabric in cell loss probability is analyzed, and the numerical results are shown. The authors show that a switch designed to meet the performance requirement for unicast calls will also satisfy multicast calls' performance. A 16×16 ATM crosspoint switch chip based on the proposed architecture has been implemented using CMOS 2-μm technology and tested to operate correctly     

An efficient channel assignment algorithm for multicast wireless mesh networks

Multicast can enhance the performance of wireless mesh networks (WMNs) effectively, which has attracted great attentions in recent years. However, multicast communication in WMNs requires efficient channel assignment strategy to reduce the total network interference and maximize the network throughput. In this paper, the concept of local multicast is proposed to measure interference and solve hidden channel problem in multicast communication. Basing on the concept, we propose a channel assignment algorithm considering the interference of local multicast and forwarding weight of each node (LMFW). The algorithm fully considers partially overlapped channels and orthogonal channels to improve the network performance. Simulations show that the proposed algorithm can reduce interference and improve network capacity of WMNs.     

An analytical approach to the performance evaluation of the balanced gamma switch under multicast traffic

This paper presents the performance evaluation of a new cell‐based multicast switch for broadband communications. Using distributed control and a modular design, the balanced gamma (BG) switch features high performance for unicast, multicast and combined traffic under both random and bursty conditions. Although it has buffers on input and output ports, the multicast BG switch follows predominantly an output‐buffered architecture. The performance is evaluated under uniform and non‐uniform traffic conditions in terms of cell loss ratio and cell delay. An analytical model is presented to analyse the performance of the multicast BG switch under multicast random traffic and used to verify simulation results. The delay performance under multicast bursty traffic is compared with those from an ideal pure output‐buffered multicast switch to demonstrate how close its performance is to that of the ideal but impractical switch. Performance comparisons with other published switches are also studied through simulation for non‐uniform and bursty traffic. It is shown that the multicast BG switch achieves a performance close to that of the ideal switch while keeping hardware complexity reasonable. Copyright © 2006 John Wiley & Sons, Ltd.     

Channel sharing in multi-hop WDM lightwave networks: realizationand performance of multicast traffic

A local lightwave network can be constructed by employing two-way fibers to connect nodes in a passive-star physical topology, and the available optical bandwidth may be effectively accessed by the nodal transmitters and receivers at electronic rates using wavelength division multiplexing (WDM). The number of channels, ω, in a WDM network is limited by technology and is usually less than the number of nodes, N, in the network. We provide a general method using channel sharing to construct practical multi-hop networks under this limitation. Channel sharing may be achieved through time division multiplexing. The method is applied to a generalized shuffle-exchange-based multi-hop architecture, called GEMNET. Multicasting-the ability to transmit information from a single source node to multiple destination nodes-is becoming an important requirement in high-performance networks. Multicasting, if improperly implemented, can be bandwidth-abusive. Channel sharing is one approach toward efficient management of multicast traffic. We develop a general modeling procedure for the analysis of multicast (point-to-multipoint) traffic in shared-channel, multihop WDM networks. The analysis is comprehensive in that it considers all components of delay that packets in the network experience-namely, synchronization, queuing, transmission, and propagation. The results show that, in the presence of multicast traffic, WDM networks with ω相似文献   

Hybrid multicast mode based on active vertical coupler optical crosspoint switch matrix

Novel optical hybrid multicast mode operation has been successfully demonstrated using an active vertical coupler optical crosspoint switch matrix. A fibre delay line has been used to recirculate optical packages, and the OXS matrix provides three parallel output copies in each recirculation or time slot. Nine output copies have been obtained in only three time slots and shorter delay lines, which exceeds the scale of parallel multicast mode operation and has shorter differential delay than serial multicast mode operation.     

An ultrafast photonic ATM switch based on bit-interleavemultiplexing

An optical ATM switch is proposed in which cells from individual input channels are time-division multiplexed in a bit-interleave manner. This switch can easily handle multicast switching because it is based on a broadcast-and-select network. Compared to an alternative switch that uses a cell-interleave time-division multiplexing scheme, the proposed optical switch has a much simpler structure. It does not need a cell compressor at each input and a cell expander at each output, which greatly reduces hardware complexity. Feasibility analyzes showed that a 64×64 photonic ATM switch with 2.5 Gb/s input/output is possible using the proposed technology. In an experimental demonstration, 4 b cells were selected from a 55 Gb/s bit-interleave multiplexed cell stream by using a new nonlinear optical fiber switch. With its high switch throughput, our switch is a strong candidate for future large-capacity optical switching nodes     

Design and implementation of multicasting for multi-channel multi-interface wireless mesh networks

Multicasting is a useful communication method in wireless mesh networks (WMNs). Many applications in WMNs require efficient and reliable multicast communications, i.e., high delivery ratio with low overhead among a group of recipients. In spite of its significance, little work has been done on providing such multicast service in multi-channel WMNs. Traditional multicast protocols for wireless and multi-hop networks tend to assume that all nodes, each of which is equipped with a single interface, collaborate on the same channel. This single-channel assumption is not always true, as WMNs often provide nodes with multiple interfaces to enhance performance. In multi-channel and multi-interface (MCMI) WMNs, the same multicast data must be sent multiple times by a sender node if its neighboring nodes operate on different channels. In this paper, we try to tackle the challenging issue of how to design a multicast protocol more suitable for MCMI WMNs. Our multicast protocol builds multicast paths while inviting multicast members, and tries to allocate the same channel to neighboring members in a bottom-up manner. By unifying fixed channels of one-hop multicast neighbors, the proposed algorithm can improve the performance such as reducing multicast data transmission overhead and delay, while managing a successful delivery ratio. In order to prove such expectation on the performance, we have implemented and evaluated the proposed solution on the real testbed having the maximum 24 nodes, each of which is equipped with two IEEE 802.11a Atheros WLAN cards.     

Popularity–Based Adaptive Content Delivery Scheme with In‐Network Caching

To solve the increasing popularity of video streaming services over the Internet, recent research activities have addressed the locality of content delivery from a network edge by introducing a storage module into a router. To employ in‐network caching and persistent request routing, this paper introduces a hybrid content delivery network (CDN) system combining novel content routers in an underlay together with a traditional CDN server in an overlay. This system first selects the most suitable delivery scheme (that is, multicast or broadcast) for the content in question and then allocates an appropriate number of channels based on a consideration of the content's popularity. The proposed scheme aims to minimize traffic volume and achieve optimal delivery cost, since the most popular content is delivered through broadcast channels and the least popular through multicast channels. The performance of the adaptive scheme is clearly evaluated and compared against both the multicast and broadcast schemes in terms of the optimal in‐network caching size and number of unicast channels in a content router to observe the significant impact of our proposed scheme.     

最优协同无线多播超图高维聚类算法

In order to guarantee the wireless multicast throughput at a minimum cost, we propose a layered hypergraph high-dimension clustering algorithm (LayerHC) considering the channels and statistical locations of mobile members. The algorithm can achieve a minimum multicast spanning tree to obtain a minimum number of relays and effective cooperative areas with low computational complexity.     

Performance assessment of multicast node placement for multicast routing in WDM networks with sparse light splitting

This article examines all-optical multicast routing for wavelength-routed optical networks with sparse Multicast Capable (MC) nodes in two phases. The first phase is MC node placement and use of a simple and straightforward Maximum Path Count First (MPCF) algorithm to obtain candidates for MC nodes. The second phase is multicast routing with MC-based schemes that minimizes the number of wavelength channels with minimum transmission delay as required by a given multicast session, in that a light-tree is first constructed to connect MC nodes in a multicast group by using two algorithms, namely, the Pre-computing Minimum Cost (PMC) tree algorithm and the Pre-computing Shortest Path (PSP) tree algorithm. System performance of the proposed MPCF MC node placement algorithm is compared with that of the Normalized Cuts (NC) MC node placement algorithm for both PMC and PSP multicast routing. Furthermore, simulation results compare PMC and PSP multicast routing based on MPCF and NC node placement with Re-route-to-Source (RTS), Re-route-to-Any (RTA), Member-First (MF), and Member-Only (MO) multicast routing based on a light forest for a given multicast session in terms of average number of wavelengths needed, average blocking probability, and mean maximum transmission delay.

Minimizing the Number of Multicast Transmissions in Single-Hop WDM Networks

The problem of minimizing the number of transmissions for a multicast transmission under the condition that the packet delay is minimum in single-hop wavelength division multiplexing (WDM) networks is studied in this paper. This problem is proved to be NP-complete. A heuristic multicast scheduling algorithm is proposed for this problem. Extensive simulations are performed to compare the performance of the proposed heuristic algorithm with two other multicast scheduling algorithms, namely, the greedy and no-partition scheduling algorithms. The greedy algorithm schedules as many destination nodes as possible in the earliest data slot. The no-partition algorithm schedules the destination nodes of a multicast packet to receive the packet in the same data slot without partitioning the multicast transmission into multiple unicast or multicast transmissions. Our simulation results show that (i) an algorithm which partitions a multicast transmission into multiple unicast or multicast transmissions may not always produce lower mean packet delay than the no-partition algorithm when the number of data channels in the system is limited and (ii) the proposed heuristic algorithm always produces lower mean packet delay than the greedy and the no-partition algorithms because this algorithm not only partitions a multicast transmission into multiple unicast or multicast transmissions to keep the packet delay low but also reduces the number of transmissions to conserve resources.     

A novel dynamic Multiple Ring-based Local Restoration for point-to-multipoint multicast traffic in WDM mesh networks

Optical networks with DWDM (Dense Wavelength Division Multiplex) can provide multiple data channels to supply high speed, high capacity to perform bandwidth-intensive multicast transmission service. Light-tree is a popular technique applied to support point-to-multipoint multicast services. Any failure during a multicast session would cause severe service loss or disruptions, especially when the faults occur near the source node. A novel ring-based local fault recovery mechanism, Multiple Ring-based Local Restoration (MRLR), for point-to-multipoint multicast traffic based on the minimum spanning tree (MST) in WDM mesh networks is proposed in this article. The MRLR mechanism dismembers the multicast tree into several disjoint segment-blocks (sub-trees) and reserves preplanned spare capacity to set up multiple protection rings in each segment-block for providing rapid local recovery. The MRLR scheme outperforms other methodologies in terms of the blocking probability, recovery time, and average hop count of protection path per session for different network topologies.     

k冗余多播网络中网络编码算法设计与分析

k冗余多播网络采用网络编码可实现最大多播速率k的信息传输。该文利用最大距离可分码已有成果,给出k冗余多播网络在不同发送速率下所需的最小有限域,构造最大距离可分码[n, k]生成矩阵,将其列向量作为信源输出链路的全局编码向量,设计网络码字,实现网络编码。应用实例表明该网络编码方法相对现有的通用网络编码算法而言,具有更低的计算复杂度。