Reliable concurrent multicast from bursty sources

This paper presents a protocol and design for concurrent and reliable group multicast (many-to-many) from bursty data sources in general networks. In a group multicast, any node can be a multicast source and multiple nodes may start to multicast simultaneously, i.e., an asynchronous access to the network. The reliable multicast protocol presented is window based with a combined sender and receiver initiation of the recovery protocol. In reliable multicasting the necessary requirement is to ensure that data is received correctly by all the active members of the multicast group. The approach taken is to combine the multicast operation with the internal flow control. As a result, it is possible to provide: (1) congestion-free multicast routing with a single and immediate acknowledgment message to the sender. Furthermore, in every multicast, (2) a node can access all the capacity allocated to its group with no delay, however, if several nodes are active in the same group, then the capacity will be shared fairly. In addition, (3) each sender in the multicast group uses a single timer, and (4) a node can become active or inactive in a transparent fashion, i.e., there is no need to explicitly notify the members of the group. A multiple criteria optimization study of the bandwidth allocation to each multicast group is presented. The optimization problem has two min-max objective functions: (1) for delay, which is caused by the number of links needed to connect the group, and (2) for congestion, which is caused by sharing a link among multiple multicast groups. The bandwidth allocation among multicast groups sharing the same link are further optimized using the max-min fairness criterion     

Architecture for restorable call allocation and fast VP restorationin mesh ATM networks

This paper presents an architecture for restorable call allocation and fast virtual path (VP) restoration in mesh ATM networks. In this architecture, virtual working and spare capacities needed for call allocation and restoration are reserved and released dynamically on a call-by-call basis at the time of call admission and termination. This obviates the need for advance assignment of spare and working capacities. To shorten the call processing delay, this is done in a parallel-distributed fashion. To provide restorable call allocation, parallel-distributed call processing algorithms of sender-chooser type are suggested. The algorithms integrate, on the call level, virtual bandwidth allocation, virtual spare-capacity assignment, and fixed, alternate, or state-dependent routing. Each routing scheme leads to a particular tradeoff between call processing complexity, call setup delay, and bandwidth efficiency. For each pair of nodes, two sets of VPs are provisioned. The first, working VP (WVP) set, is used for call allocation during the normal operation. The second, spare VP (SVP) set, is used for WVP restoration in the event of failures of network elements. Each SVP protects a preassigned subset of the node pair's WVPs. Each SVP is selected to be link/node disjoint from the WVPs that it is assigned to protect. This assures a protection of the WVP set by a small number of SVPs. Since SVPs are preset and appropriate virtual spare capacities are reserved in advance, the architecture guarantees full restorability and provides very fast restoration. The restoration is done on the VP level in a self-healing manner. The suggested architecture requires only local information to be maintained at each node     

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

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

A resource‐tuned QoS multicast routing protocol

This paper presents a novel framework for quality‐of‐service (QoS) multicast routing with resource allocation that represents QoS parameters, jitter delay, and reliability, as functions of adjustable network resources, bandwidth, and buffer, rather than static metrics. The particular functional form of QoS parameters depends on rate‐based service disciplines used in the routers. This allows intelligent tuning of QoS parameters as functions of allocated resources during the multicast tree search process, rather than decoupling the tree search from resource allocation. The proposed framework minimizes the network resource utilization while keeping jitter delay, reliability, and bandwidth bounded. This definition makes the proposed QoS multicast routing with resource allocation problem more general than the classical minimum Steiner tree problem. As an application of our general framework, we formulate the QoS multicast routing with resource allocation problem for a network consisting of generalized processor sharing nodes as a mixed‐integer quadratic program and find the optimal multicast tree with allocated resources to satisfy the QoS constraints. We then present a polynomial‐time greedy heuristic for the QoS multicast routing with resource allocation problem and compare its performance with the optimal solution of the mixed‐integer quadratic program. The simulation results reveal that the proposed heuristic finds near‐optimal QoS multicast trees along with important insights into the interdependency of QoS parameters and resources.     

Scalable On-Demand Streaming of Nonlinear Media

A conventional video file contains a single temporally-ordered sequence of video frames. Clients requesting on-demand streaming of such a file receive (all or intervals of) the same content. For popular files that receive many requests during a file playback time, scalable streaming protocols based on multicast or broadcast have been devised. Such protocols require server and network bandwidth that grow much slower than linearly with the file request rate. This paper considers ldquononlinearrdquo video content in which there are parallel sequences of frames. Clients dynamically select which branch of the video they wish to follow, sufficiently ahead of each branch point so as to allow the video to be delivered without jitter. An example might be ldquochoose-your-own-endingrdquo movies. With traditional scalable delivery architectures such as movie theaters or TV broadcasting, such personalization of the delivered video content is very difficult or impossible. It becomes feasible, in principle at least, when the video is streamed to individual clients over a network. For on-demand streaming of nonlinear media, this paper analyzes the minimal server bandwidth requirements, and proposes and evaluates practical scalable delivery protocols.     

Multi-Layer Lambda Grid With Exact Bandwidth Provisioning Over Converged IP and Optical Networks

This paper proposes for the first time a multi-layer Lambda Grid, which is a platform to establish dynamically a computing environment with a guaranteed level of throughput and bandwidth over converged IP and optical networks according to each client reservation request. It enables client-side visualization of a computing environment comprising converged IP and optical networks and geographically distributed computing domains. In addition, it dynamically reserves a packet switched path/tunnel (sub-lambda) with the exact requested bandwidth and computer resources according to each client reservation request. Moreover, it links the reserved path to the reserved computers, controls the reserved sub-lambda and the relevant lambda as needed, and routes only the reserved packet flow between the reserved computers to the reserved sub-lambda. In terms of cost performance and bandwidth flexibility, it can use network resources more effectively than existing Lambda Grids. Through the multi-layer Lambda Grid, clients can execute applications in an established computing environment as if the environment was a virtual private computing environment for clients. To achieve the multi-layer Lambda Grid, this paper also proposes a novel technology. This technology dynamically reserves a sub-lambda with the exact requested bandwidth according to each client reservation request. Moreover, it links the reserved sub-lambda to the reserved computers, and controls the reserved sub-lambda and the relevant lambda as needed. In addition, it routes only the reserved packet flow between reserved computers to the reserved sub-lambda. To evaluate the feasibility of the technology, a common computing environment with the multi-layer Lambda Grid for scientific calculation, file transfer, and high-definition video streaming services is presented in an actual field environment. Through this experiment, the total feasibility of the multi-layer Lambda Grid is shown.     

Improving Awareness in Mobile CSCW

The diffusion of mobile devices in the working landscape is promoting collaboration across time and space. Following through this development, we investigate opportunities for improving awareness in mobile environments with a view to enable collaboration under power constraints and transitory network disconnections. We elaborate in particular on synchronous CSCW and expose with it significant details of group awareness, while we contribute a protocol for awareness support over large areas that strikes a balance between energy consumption and notification time. To avoid user disruption, this protocol notifies awareness information in a multicast fashion, while the bandwidth is allocated dynamically among notifications and data requests, thus minimizing the time needed by each one of them and ensuring the isochronous delivery of information to all clients. The efficiency and scalability of our protocol are evaluated with simulation experiments, whereby we compare various notification schemes and finally choose one that changes dynamically over time.     

Fair Bandwidth Allocation Using Effective Multicast Traffic Share in TDM-PONs

In this paper, the effects of optical traffic-sharing on the performance of multicast video delivery in terms of the efficiency of bandwidth allocation and the fairness of link-sharing are discussed for the downstream direction of a time-division-multiplexed passive optical network (TDM-PON). We analyze the practical issues associated with multicast packet switching and transmission control in a TDM-PON and also propose a fair bandwidth allocation mechanism, called share-based proportional bandwidth allocation (S-PBA), to effectively support multicast services. In order to provide an optical network unit with a fair amount of link bandwidth and high throughput independent of traffic type, S-PBA arbitrates the amount of unicast timeslot by using effective multicast traffic share, which is determined based on multicast traffic load distribution and traffic-sharing density. Analytic and simulation results clearly validate the effectiveness of the proposed mechanism. This work is applicable to multicast video delivery or multicast traffic transmission in general, such as voice traffic, or a combination of both in the case of video conferencing, for example.     

Two-stage bandwidth-allocated algorithm for multi-subsystem-based VPON in metro-access optical network

In the metro-access optical network, a two-stage bandwidth-allocated algorithm is proposed for the multi-subsystem-based virtual passive optical network (VPON) that can achieve the syncretism of multiple systems such as time division multiplexing-PON, wavelength division multiplexing-PON and orthogonal frequency division multiplexing-PON. In this paper, the bandwidth is allocated in two stages. The first-stage allocation is designed to improve the admission probability of new VPONs by allocating bandwidth to all new VPONs followed by original VPONs. Meanwhile, to avoid the bandwidth being monopolized by the new VPONs, the bandwidth allocated to each VPON is no more than its guaranteed bandwidth. Therefore, the whole fairness can be guaranteed. The second-stage allocation is used to promote the bandwidth-utilized ratio by assigning the remaining bandwidth to VPONs whose demand is not fully met in the first stage. With the two-stage allocation, not only the admission probability can be improved, but also the bandwidth-utilized ratio can be promoted. MATLAB is used to evaluate the performance of proposed algorithm according to admission probability of new VPONs and bandwidth-utilized ratio.     

MARS: Link-layer rate selection for multicast transmissions in wireless mesh networks

IEEE 802.11 devices dynamically choose among different modulation schemes and bit-rates for frame transmissions. This rate adaptation, however, is restricted only to unicast frames. Multicast (and broadcast) frames are constrained to use a fixed low bit-rate modulation, resulting in low throughput for multicast streams. Availability of high bandwidth and efficient use of the medium is crucial to support multimedia multicast streaming applications such as IPTV, especially in multihop mesh networks. To address this problem, we propose a rate adaptation algorithm for multicast transmissions in these networks. The proposed algorithm, MARS, is distributed in nature, and relies on local network measurements to select a transmission bit-rate for a given multicast group. The algorithm also facilitates the joint use of bit-rate selection and link-layer mechanisms such as acknowledgements and retransmissions to improve reliability of high throughput multicast streams. Based on implementation and evaluation on a testbed, the algorithm provides up to 600% gain in throughput compared to traditional 802.11 networks in some scenarios. Additionally, the algorithm can support multicast streams while consuming a small fraction (20%) of the resources compared to the basic 802.11 operation.     

Architectural design and bandwidth demand analysis for multiparty videoconferencing on SONET/ATM rings

In this paper, we propose a scheme for implementing multiparty videoconferencing service on SONET/ATM rings. We focus on the architectural design and bandwidth demand analysis. Different multicasting methods on SONET/ATM rings are discussed and compared. A new multicast virtual path (VP) called "Multidrop VP" which is particularly suitable for SONET/ATM rings is proposed. An add-drop multiplexer (ADM) structure for rings capable of multidropping is also presented. Several VP assignment schemes are proposed and their bandwidth utilizations are compared.     

A Novel Probability-Based Handoff Strategy for Multimedia LEO Satellite Communications

A novel bandwidth allocation strategy and a connection admission control technique arc proposed to improve the utilization of network resource and provide the network with better quality of service （QoS） guarantees in multimedia low earth orbit （LEO） satellite networks. Our connection admission control scheme, we call the probability based dynamic channel reservation strategy （PDR）, dynamically reserves bandwidth for real-time services based on their handoff probability. And the reserved bandwidth for real-time handoff connection can also be used by new connections under a certain probability determined by the mobility characteristics and bandwidth usage of the system. Simulation results show that our scheme not only lowers the call dropping probability （CDP） for Class I real-time service but also maintains the call blocking probability （CBP） to certain degree. Consequently, the scheme can offer very low CDP for rcal-time connections while keeping resource utilization high.     

一种分层的环状应用层多播模型

提出了一种新型的适合于大规模应用层多播的模型VRBH(Virtual Ring-Based Hierarchy),它以环作为拓扑结构,同时引入了分层和虚拟环的概念。采用了基于优先级的动态规划方法使得该环状拓扑结构随时间的变化逐渐趋于合理,并且采取一定的措施使得当出现数据传输错误时可以进行快速的恢复。由仿真试验结果得知该模型具有较低的控制开销,较高的带宽利用率和较高的数据传输率,应用该多播模型可以较好地提高多播的性能。     

Efficient Resource Allocation for Wireless Multicast

In this paper, we propose a bandwidth-efficient multicast mechanism for heterogeneous wireless networks. We reduce the bandwidth cost of an Internet protocol (IP) multicast tree by adaptively selecting the cell and the wireless technology for each mobile host to join the multicast group. Our mechanism enables more mobile hosts to cluster together and leads to the use of fewer cells to save the scarce wireless bandwidth. Besides, the paths in the multicast tree connecting to the selected cells share more common links to save the wireline bandwidth. Our mechanism supports the dynamic group membership and offers mobility of group members. Moreover, our mechanism requires no modification to the current IP multicast routing protocols. We formulate the selection of the cell and the wireless technology for each mobile host in the heterogeneous wireless networks 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 network protocol based on the algorithm. The simulation results show that our mechanism can effectively save the wireless and wireline bandwidth as compared to the traditional IP multicast.     

Distributed formation of core-based forwarding multicast trees in mobile ad hoc networks

A core-based forwarding multicast tree is a shortest path tree rooted at core node that distributes multicast packets to all group members via the tree after the packets are sent to the core. Traditionally, the bandwidth cost consumed by transmitting a packet from the core via the tree is evaluated by the total weights of all the edges. And, the bandwidth cost is minimized by constructing the multicast tree that has minimum total weights of edges to span all group members. However, when the local broadcast operation is used to multicast a packet, we found that the bandwidth cost is supposed to be evaluated by the total weights of all senders that include the core and all non-leaves. Since the multicast tree with the number of nodes greater than or equal to three has minimum bandwidth cost only when the core is not a leaf, it leads us to find the multicast tree with the minimum number of non-leaves when each sender node has a unit weight. However, no polynomial time approximation scheme can be found for the minimum non-leaf multicast tree problem unless P = NP since the problem is not only NP-hard but also MAX-SNP hard. Thus, a heuristic is proposed to dynamically reduce the number of non-leaves in the multicast tree. Experimental results show that the multicast tree after the execution of our method has smaller number of non-leaves than others in the geometrically distributed network model.     

Efficient Resource Allocation for OFDMA Multicast Systems With Spectrum-Sharing Control

This paper considers the important problem of efficient allocation of available resources (such as radio spectrum and power) in orthogonal frequency-division multiple-access (OFDMA)-based multicast wireless systems. Taking the maximization of system throughput as the design objective, three novel efficient resource-allocation schemes with reduced computational complexity are proposed under constraints on total bandwidth and transmitted power at the base station (BS). Distinct from existing approaches in the literature, our formulation and solution methods also provide an effective and flexible means to share the available radio spectrum among multicast groups by guaranteeing minimum numbers of subcarriers to be assigned to individual groups. The first two proposed schemes are based on the separate optimization of subcarriers and power, where subcarriers are assigned with the assumption of uniform power distribution, followed by water filling of the total available transmitted power over the determined subcarrier allocation. In the third scheme, which is essentially a modified genetic algorithm (GA), each individual of the entire population represents a subcarrier assignment, whose fitness value is the system sum rate computed on the basis of the power water-filling procedure. Numerical results show that with a flexible spectrum-sharing control mechanism, the proposed designs are able to more flexibly and fairly distribute the total available bandwidth among multicast groups and, at the same time, achieve a high system throughput.      

一种新的基于认购速率和QoS等级的动态带宽分配算法

为了实现吉比特无源光网络带宽分配的公平性,降低网络的传输延时,设计了一种新的媒质访问控制协议,提出了一种新的动态带宽分配算法.其基本思想是:在保证拥有不同QoS业务的用户得到认购速率的基础上,根据网络负载的大小,动态地将某些用户未使用的带宽分配给其他带宽需求大的用户,以提高网络的带宽利用率.仿真结果表明,这种新的算法在严格控制数据传输延时的前提下,能够保证多用户之间带宽分配的公平性.     

Wyner-Ziv视频编码中无反馈速率控制算法研究

为了避免在分布式视频编码系统中使用反馈信道,提出了一种基于Wyner-Ziv编码的无反馈速率控制算法。首先,利用目标码率和目标帧率进行GOP层码率分配;然后,根据原始图像的帧间相关性动态选择量化因子和量化矩阵来分配每个GOP内关键帧和Wyner-Ziv帧的比特数;接下来,利用系数带级的相关性计算相关噪声模型参数,并选择对应的LDPC校验矩阵,提出Wyner-Ziv帧的无反馈比特面速率控制算法。实验结果表明,在给定目标码率下,所提算法的编码码率误差小于0.57%,且与现有无反馈速率控制算法相比,解码恢复图像的PSNR(峰值信噪比)可以提高1dB。另外,该算法基本没有增加编码端复杂度,可用于实际分布式视频通信系统。     

GPON中基于认购速率和QoS等级的动态带宽分配算法

为了实现吉比特无源光网络带宽分配的公平性，降低网络的传输延时，设计了一种新的媒质访问控制协议，提出了一种新的动态带宽分配算法。其基本思想是：在保证拥有不同QoS业务的用户得到认购速率的基础上，根据网络负载的大小，动态地将某些用户未使用的带宽分配给其他带宽需求大的用户，以提高网络的带宽利用率。仿真结果表明，这种新的算法在严格控制数据传输延时的前提下，能够保证多用户之间带宽分配的公平性。     

Dynamic Bandwidth Allocation in WDM Passive Star Networks with Asymmetric Traffic

When asymmetric traffic is offered to a WDM passive star network, the offered bandwidth must be allocated is such a way that each station takes a portion of the available bandwidth proportional to its needs. When the traffic characteristics are fixed and a priori known, then, the bandwidth allocation scheme can be based on these characteristics. Unfortunately, the traffic characteristics are often unknown and time-variable. In this paper, a dynamic bandwidth allocation scheme is presented, which is based on the network feedback information in order to be capable of adapting to the changing traffic characteristics. According to the proposed scheme, a set of learning automata processes the network feedback information and dynamically allocates the available bandwidth to the stations according to their needs.