Optimization of layered multicast with network coding and genetic algorithm

This article studies the problem of constructing optimal layered multicast with network coding for heterogeneous networks.Based on the flexibility of layered source coding, a global-favorable optimization scheme is proposed, which maximizes the aggregate throughput of heterogeneous sink nodes for layered multicast with network coding by determining the optimal bit rates of the layers. To solve this global-favorable optimization scheme, especially in the large-scale heterogeneous networks, a new problem-specific genetic algorithm (GA) is further proposed. It not only searches efficiently for the optimal allocation of layer bit rates, but also guarantees the validity of candidate solutions in the whole evolutionary process. Simulation results demonstrate that this new GA-based optimization scheme could obtain efficiently the optimal or satisfactorily near-optimal bit rates for layered multicast with network coding, even in the large-scale heterogeneous networks.     

一种短波通信可靠多播群组管理方法

针对异步短波单层可靠多播网络群组管理中临时节点加入或退出时网络处理时延较 长的问题,提出了一种分层可靠多播网络群组管理方法。通过设置群首节点来减少该临时节 点与网络内部成员的交互次数。理论分析和仿真结果表明,该方法较单层可靠多播网络群组 管理方法,具有网络对该临时节点处理时延小、群组管理复杂度低等优点,其应用前景广阔 。     

Layered multicast congestion control by particle swarm optimization in heterogeneous environment

To enhance multicast throughput in heterogeneous environment,a new layered multicast congestion control scheme is proposed.With the goal of maximizing global satisfaction of the whole group,allocating sending rate in each layer is formulated to an optimization problem.Since the problem is noncovexity,the sender uses particle swarm optimization to search a set of optimal layers rates.The new scheme also eliminates ’lowest-first’ phenomenon by proposing a feedbacks suppression algorithm named equal-probability sampling (EPS).Upon EPS all the receivers send feedbacks at equal probability without bias.Simulation results prove that the new scheme can enhance global satisfaction and multicast throughput efficiently,compared with the traditional layered multicast congestion control scheme based on representatives.     

主动网络中的分层组播拥塞控制策略

为了满足在网络异构情况下根据不同客户端的网络状况保证Qos的组播需求,文章研究了在主动网络中的分层组播的方法,提出了根据主动包进行粗粒度的层加入和根据统计网络拥塞标志信息进行细粒度的离开的拥塞处理的组播实现策略.仿真结果表明,该策略能对网络环境的变化进行多点传输的分层的做出动态适应性调节,同时在网络中实现了与TCP的友好.该算法可以满足多媒体组播在网络异构情况下的拥塞处理.     

一种新的多速率多播拥塞控制策略

本文提出了一种新的多速率多播拥塞控制策略,以满足分层多播接收者的可用带宽异构性。这种接收方驱动的拥塞控制策略,能够根据网络情况变化动态地调整分层的数量及层速率,运用最优层速率分配算法来满足接收者的可用带宽异构性,接收者的可用带宽可以用根据TCP友好经验公式计算出。仿真实验表明,该算法在TCP友好性上有良好的性能,同时它可以明显提高系统的吞吐量。     

Achieving inter-session fairness for layered video multicast

The Internet is increasingly used to deliver multimedia services. Since there are heterogeneous receivers and changing network conditions, it has been proposed to use adaptive rate control techniques such as layered video multicast to adjust the video traffic according to the available Internet resources. A problem of layered video multicast is that it is unable to provide fair bandwidth sharing between competing video sessions. We propose two schemes, layered video multicast with congestion sensitivity and adaptive join-timer (LVMCA) and layered video multicast with priority dropping (LVMPD), to achieve inter-session fairness for layered video multicast. Receiver-driven layered multicast (RLM), layer-based congestion sensitivity, LVMCA, and LVMPD are simulated and compared. Results show both proposed schemes, especially LVMPD, are fairer and have shorter convergence time than the other two schemes.     

Application versus network layer multicasting in ad hoc networks: the ALMA routing protocol

Application layer multicasting has emerged as an appealing alternative to network layer multicasting in wireline networks. Here, we examine the suitability of application layer multicast in ad hoc networks. To this effect, we propose a flexible receiver-driven overlay multicast protocol which we call Application Layer Multicast Algorithm (ALMA). ALMA constructs an overlay multicast tree in a dynamic, decentralized and incremental way. First, ALMA is receiver-driven: the member nodes find their connections according to their needs. Second, it is flexible, and thus, it can satisfy the performance goals and the needs of a wide range of applications. Third, it is highly adaptive: it reconfigures the tree in response to mobility or congestion. In addition, our protocol has the advantages of an application layer protocol: (a) simplicity of deployment, (b) independence from lower layer protocols, and (c) capability of exploiting features such as reliability and security that may be provided by the lower layers. Through extensive simulations, we show that ALMA performs favorably against the currently best application layer and network layer protocols. In more detail, we find that ALMA performs significantly better than ODMRP, a network layer, for small group sizes. We conclude that the application layer approach and ALMA seem very promising for ad hoc multicasting.     

Bandwidth Efficient Video Multicasting in Multiradio Multicellular Wireless Networks

In this paper, we propose a new mechanism to select the cells and the wireless technologies for layer-encoded video multicasting in the heterogeneous wireless networks. Different from the previous mechanisms, each mobile host in our mechanism can select a different cell with a different wireless technology to subscribe each layer of a video stream, and each cell can deliver only a subset of layers of the video stream to reduce the bandwidth consumption. We formulate the Cell and Technology Selection Problem (CTSP) to multicast each layer of a video stream as an optimization problem. We use Integer Linear Programming to model the problem and show that the problem is NP-hard. To solve the problem, we propose a distributed algorithm based on Lagrangean relaxation and a protocol based on the proposed algorithm. Our mechanism requires no change of the current video multicasting mechanisms and the current wireless network infrastructures. Our algorithm is adaptive not only to the change of the subscribers at each layer, but also the change of the locations of each mobile host.     

A New Systematic Framework for Autonomous Cross-Layer Optimization

Cross-layer optimization solutions have been proposed in recent years to improve the performance of wireless users that operate in a time-varying, error-prone network environment. However, these solutions often rely on centralized cross-layer optimization solutions that violate the layered network architecture of the protocol stack by requiring layers to provide access to their internal protocol parameters to other layers. This paper presents a new systematic framework for cross-layer optimization, which allows each layer to make autonomous decisions to maximize the wireless user's utility by optimally determining what information should be exchanged among layers. Hence, this cross-layer framework preserves the current layered network architecture. Since the user interacts with the wireless environment at various layers of the protocol stack, the cross-layer optimization problem is solved in a layered fashion such that each layer adapts its own protocol parameters and exchanges information (messages) with other layers that cooperatively maximize the performance of the wireless user. Based on the proposed layered framework, we also design a message-exchange mechanism that determines the optimal cross-layer transmission strategies, given the user's experienced environment dynamics.     

A cross‐layer optimization for maximum‐revenue‐based multicast in multichannel multiradio wireless mesh networks

Given a video/audio streaming system installed on a multichannel multiradio wireless mesh network, we are interested in a problem concerning about how to construct a delay‐constrained multicast tree to support concurrent interference‐free transmissions so that the number of serviced mesh clients is maximized. In this paper, we propose a heuristic approach called cross‐layer and load‐oriented (CLLO) algorithm for the problem. On the basis of the cross‐layer design paradigm, our CLLO algorithm can consider application demands, multicast routing, and channel assignment jointly during the formation of a channel‐allocated multicast tree. The experimental results show that the proposed CLLO outperforms the layered approaches in terms of the number of serviced mesh clients and throughputs. This superiority is due to information from higher layers can be used to guide routing selection and channel allocation at the same time. As a result, the CLLO algorithm can explore more solution spaces than the traditional layered approaches. In addition to that, we also propose a channel adjusting procedure to enhance the quality of channel‐allocated multicast trees. According to our simulations, it is proved to be an effective method for improving the performance of the proposed CLLO algorithm. Copyright © 2013 John Wiley & Sons, Ltd.     

Cross-Layer Architecture for Adaptive Video Multicast Streaming Over Multirate Wireless LANs

Multicast video streaming over multirate wireless LANs imposes strong demands on video codecs and the underlying network. It is not sufficient that only the video codec or only the underlying protocols adapt to changes in the wireless link quality. Research efforts should be applied in both and in a synchronized way. Cross layer design is a new paradigm that addresses this challenge by optimizing communication network architectures across traditional layer boundaries. This paper presents cross-layer architecture for adaptive video multicast streaming over multirate wireless LANs where layer-specific information is passed in both directions, top-down and bottom-up. The authors jointly consider three layers of the protocol stack: the application, data link and physical layers. The authors analyze the performance of the proposed architecture and extensively evaluate it via simulations. The results show that the real-time video quality of the overall system can be greatly improved by cross-layer signaling.     

一种新的分层多播拥塞控制协议

提出了一种新的自适应分层多播拥塞控制方案(ALM)。ALM是发送方与接收方共同驱动、由路由器辅助流量控制的拥塞控制方案,通过把发送方的动态分层和接收方的自适应速率调整有机结合,不仅增强了分层多播的适应能力,提高了系统的吞吐量,而且较好地满足了TCP友好性。仿真实验表明,ALM能有效地利用网络带宽,解决网络带宽的异构性问题,并能通过接收端计算TCP友好速率,使接收端达到与TCP流公平竞争网络资源的目的。     

基于网络控制的分层多点播送速率控制机制研究

本文在视频分层编码及分层传输协议的基础上，将基于网络控制与接收端控制机制相结合，提出一种新的分层多点播送速率控制机制。文中给出了该机制的拥塞检测、流行度权衡和数据层增加和丢弃算法。实验结果表明，该速率控制机制通史对拥塞做也快速响应，并在较好利用宽带的基础上保证高流行度的会话流具有较好的服务质量。     

FLID-DL: congestion control for layered multicast

We describe fair layered increase/decrease with dynamic layering (FLID-DL): a new multirate congestion control algorithm for layered multicast sessions. FLID-DL generalizes the receiver-driven layered congestion control protocol (RLC) introduced by Vicisano et al. (Proc. IEEE INFOCOM, San Francisco, CA, , p.996-1003, Mar. 1998)ameliorating the problems associated with large Internet group management protocol (IGMP) leave latencies and abrupt rate increases. Like RLC, FLID-DL, is a scalable, receiver-driven congestion control mechanism in which receivers add layers at sender-initiated synchronization points and leave layers when they experience congestion. FLID-DL congestion control coexists with transmission control protocol (TCP) flows as well as other FLID-DL sessions and supports general rates on the different multicast layers. We demonstrate via simulations that our congestion control scheme exhibits better fairness properties and provides better throughput than previous methods. A key contribution that enables FLID-DL and may be useful elsewhere is dynamic layering (DL), which mitigates the negative impact of long IGMP leave latencies and eliminates the need for probe intervals present in RLC. We use DL to respond to congestion much faster than IGMP leave operations, which have proven to be a bottleneck in practice for prior work.     

基于效用距离的分层多播反馈控制算法

源自适应的分层多播存在着因反馈信息爆炸而导致的缩放性问题，反馈信息合并是一个较好的解决办法。本文给出一个以效用最优为目标的自适应分层多播模型UALM，分析了在反馈树的支持下，通过反馈合并策略实现反馈控制的方法，提出了一种基于加权效用距离的分层多播反馈合并算法。仿真结果表明，该算法能够有效地控制反馈信息数目，同时使得在此基础上完成的动态分层效用接近于不进行反馈合并时的系统效用，满足分层多播的缩放性要求。     

Fine-grained Layered multicast with STAIR

Traditional approaches to receiver-driven layered multicast have advocated the benefits of cumulative layering, which can enable coarse-grained congestion control that complies with TCP-friendliness equations over large time scales. In this paper, we quantify the costs and benefits of using noncumulative layering and present a new, scalable multicast congestion control scheme called STAIR that embodies this approach. Our first main contribution is a set of performance criteria on which we base a comparative evaluation of layered multicast schemes. In contrast to the conventional wisdom, we demonstrate that fine-grained rate adjustment can be achieved with only modest increases in the number of layers, aggregate bandwidth consumption and control traffic. The STAIR protocol that we subsequently define and evaluate is a multiple rate congestion control scheme that provides a fine-grained approximation to the behavior of TCP additive increase/multiplicative decrease (AIMD) on a per-receiver basis.     

一种新的逐跳TCP友好的主动分层多播拥塞控制方案

基于Internet的多媒体多播应用的迅猛发展对多播拥塞控制提出了要求.分层多播是适应网络异构性较有效的方案.针对现有分层多播存在的问题,将主动网技术思想引入到分层多播拥塞控制中,提出了一种逐跳TCP友好的主动分层多播拥塞控制方案(HTLMA),采用主动标记分层、逐跳探测TCP友好可用带宽,以及主动速率控制机制.仿真实验表明,HTLMA方案大大改进了分层多播拥塞控制的性能,具有较快的拥塞响应速度、较好的稳定性和TCP友好特性.     

Performance analysis of multicast routing and wavelength assignment protocol with dynamic traffic grooming in WDM networks

The need for on‐demand provisioning of wavelength‐routed channels with service‐differentiated offerings within the transport layer has become more essential because of the recent emergence of high bit rate Internet protocol (IP) network applications. Diverse optical transport network architectures have been proposed to achieve the above requirements. This approach is determined by fundamental advances in wavelength division multiplexing (WDM) technologies. Because of the availability of ultra long‐reach transport and all‐optical switching, the deployment of all‐optical networks has been made possible. The concurrent transmission of multiple streams of data with the assistance of special properties of fiber optics is called WDM. The WDM network provides the capability of transferring huge amounts of data at high speeds by the users over large distances. There are several network applications that require the support of QoS multicast, such as multimedia conferencing systems, video‐on‐demand systems, real‐time control systems, etc. In a WDM network, the route decision and wavelength assignment of lightpath connections are based mainly on the routing and wavelength assignment (RWA). The multicast RWA's task is to maximize the number of multicast groups admitted or minimize the call‐blocking probability. The dynamic traffic‐grooming problem in wavelength‐routed networks is generally a two‐layered routing problem in which traffic connections are routed over lightpaths in the virtual topology layer and lightpaths are routed over physical links in the physical topology layer. In this paper, a multicast RWA protocol for capacity improvement in WDM networks is designed. In the wavelength assignment technique, paths from the source node to each of the destination nodes and the potential paths are divided into fragments by the junction nodes and these junction nodes have the wavelength conversion capability. By using the concept of fragmentation and grouping, the proposed scheme can be generally applied for the wavelength assignment of multicast in WDM networks. An optimized dynamic traffic grooming algorithm is also developed to address the traffic grooming problem in mesh networks in the multicast scenario for maximizing the resource utilization and minimizing the blocking probability. Copyright © 2011 John Wiley & Sons, Ltd.     

Random linear network coding with ladder-shaped global coding matrix for robust video transmission

Robust video multicast in erasure networks using network coding (NC) to reduce the impact of packet loss is studied in this paper. In our proposed solution, random linear network coding (RLNC) is adopted at intermediate nodes of the network. RLNC linearly combines a group of packets by randomly selecting weighting coefficients on a finite field, and the loss of an RLNC-coded packet is equivalent to the loss of one constraint in a linear system of equations required for RLNC decoding. Unless the global coding coefficient matrix, or simply called the global coding matrix (GCM), is of full rank, a receive node cannot reconstruct all source packets. To address this rank deficiency problem, we propose to construct a special-structured GCM, called the ladder-shaped GCM (LGCM), for layered H.264/SVC (scalable video coding) video multicast. The ladder shape of the sparse coding matrix is maintained throughout the RLNC process to achieve two objectives: (1) to enable partial decoding of a block; and (2) to provide unequal erasure protection for H.264/SVC priority layers. Furthermore, quality degradation is minimized by optimizing the amount of redundancy assigned to each layer, and graceful quality degradation is achieved by error concealment (EC). Simulation results are given to demonstrate the superior performance of the proposed RLNC–LGCM scheme over the traditional RLNC with a generalGCM.     

Efficient scalable video multicast based on network-coded communication

In order to increase the efficiency of mobile video transmission in a 5G network, this paper investigates a cooperative multicast of scalable video using network coding with adaptive modulation and coding over dedicated relay-based cellular networks. Different scalable video layers prefer different protection degrees, and user equipments (UEs) in different locations experience different packet loss rates in wireless networks. Guaranteeing that all UEs experience a certain level of video quality is one of the biggest challenges in scalable video multicast. Using the number of satisfied UEs as a metric, the proposed efficient scalable video multicast based on network-coded cooperation (SVM-NC) scheme, combined with adaptive modulation and coding, enhances the attainable system performance under strict time and bandwidth resource constraints for guaranteed smooth playback. Various simulations were performed for performance evaluation. The proposed scheme ensures that the expected percentage of satisfied UEs approximately achieves the maximum number of UEs in a multicast group by using network-coded cooperation over dedicated relay-based cellular networks. In addition, the peak signal-to-noise ratio metric is asymptotic to the maximum performance of high-resolution video quality offered by service providers.