组播/单播OFDMA系统中资源分配算法研究

本文研究了组播/单播OFDMA系统中的无线资源分配,为了在满足组播速率需求的条件下最大化单播用户的总速率的优化目标,提出两种资源分配算法.分别采用代价函数和适度度量作为依据为组播用户选择子载波,剩余资源按照最大吞吐量准则分配给单播用户.仿真表明,两种算法均能够满足组播速率需求,且获得的单播用户的总速率接近理论最大值.     

对IP组播可达性测试模型的研究

IP组播可达性较单播可达性复杂 ,通过对比单播可达性和组播可达性 ,引入IP组播可达性 ,分析通用的IP组播可达性测试模型 ,说明该通用模型如何较高效完成组播可达性测试。     

MPLS组播流量工程综述

介绍了MPLS网络、组播技术和流量工程技术的特点与特征,结合它们之间的优势和对单播与组播流量工程的比较,重点综述了目前在MPLS网络上实施组播流量工程的几种建树方法、发展现状和存在的问题,最后对MPLS组播流量工程的研究作出了展望.     

组播视频点播的新方法：时隙分割—SRMDRU

在对视频点播采用的各种组播方法比较的基础上,提出了一种新的组播方法－－时隙分割－SRMDRU法。与单播和现有的其它组播方式比较,此种方法提高了视频点播系统的实时、交互性,并节省了系统的资源开销。     

WDM-PON中基于码型动态切换的组播实现方案

提出了一种利用码型动态切换的机制来实现波分复用无源光网络中组播业务的传输.组播业务采用DPSK调制格式,下行单播业务采用动态切换的Manchester/NRZ调制格式.其中Manchester调制格式是由下行单播数据和同频的时钟信号通过电逻辑异或门产生.实验验证了同时传输5Gb/s下行点对点信号和1.25Gb/s组播信号的WDM-PON组播传输方案的可行性.     

一种基于MPLS VPN网络的IPv6组播过渡技术

通过IPv4骨干网传输IPv6组播数据目前并没有很好的方案。借助单播封装,配置复杂,且浪费带宽。在MPLS VPN骨干网的环境下,对IPv4组播VPN组播隧道技术进行改进,通过IPv6私网单播和组播路由信息的自动扩散,实现IPv6组播数据的自动穿越。     

组播视频点播的新方法—时间槽分割—SRMDRU

在对视频点播采用的各种组播方法比较的基础上，提出了一种新的组播方法——时间槽分割－ＳＲＭＤＲＵ 法。与单播和现有的其它组播方式比较，此种方法提高了视频点播系统的实时、交互性，并节省了系统的资源开销。     

IP组播技术在广电网络中的应用

IP组播技术不同于IP单播技术,它是一种能够节省并优化网络资源的技术。介绍IP组播技术的一些概念,并结合广电业务的应用,探讨在不同的网络技术架构中IP组播技术的应用。     

IP组播技术及其应用探讨

随着互联网上流媒体、VOD视频点播、视频会议等业务的相继开展,IP组播技术和应用开始快速发展。本文对单播、广播、组播三种通信方式做了分析探讨,着重介绍了组播技术的产生、概念、实现的前提条件、实现的原理、相关支撑协议,以及组播技术在当前的应用。     

IP网组播的实现机制（下）

广域网上的组播实现有多种技术方式，但是最常用的实现方式是采用PIM—SM组播路由协议。PIM—SM协议与单播路由协议无关，并可同时支持基于源的组播树和共享树两种组播方式，特别是它是实现跨AS域组播的基础。因此，当前多数网络是以PIM—SM作为其组播路由协议。下面，将针对实例详细介绍PIM—SM的组播实现方式。     

Incremental service deployment using the hop-by-hop multicast routing protocol

IP multicast is facing a slow take-off although it has been a hotly debated topic for more than a decade. Many reasons are responsible for this status. Hence, the Internet is likely to be organized with both unicast and multicast enabled networks. Thus, it is of utmost importance to design protocols that allow the progressive deployment of the multicast service by supporting unicast clouds. This paper presents HBH (hop-by-hop multicast routing protocol). HBH adopts the source-specific channel abstraction to simplify address allocation and implements data distribution using recursive unicast trees, which allow the transparent support of unicast-only routers. An important original feature of HBH is its tree construction algorithm that takes into account the unicast routing asymmetries. Since most multicast routing protocols rely on the unicast infrastructure, the unicast asymmetries impact the structure of the multicast trees. We show through simulation that HBH outperforms other multicast routing protocols in terms of the delay experienced by the receivers and the bandwidth consumption of the multicast trees. Additionally, we show that HBH can be incrementally deployed and that with a small fraction of HBH-enabled routers in the network HBH outperforms application-layer multicast.     

Optimization-based congestion control for multicast communications

This article outlines an approach for multicast congestion control based on an economic model that has been successfully applied to unicast congestion control. In this model, congestion signals are interpreted as prices and congestion-controlled sessions as utility maximizing agents. A naive extension of the unicast model fails to achieve a reasonable balance between providing the incentives necessary to promote the use of multicast and ensuring that multicast sessions do not interact too aggressively with unicast sessions. We extend the model by introducing a rational definition of multicast utility. The revised model provides a basis for multicast congestion control protocols that provide incentives to use multicast but are necessarily unfair to unicast traffic. We show, however, that the degree of unfairness can be controlled by appropriately setting a design parameter with a limiting case of strict fairness     

Priority differentiated multicast flow scheduling method in Ceph cloud storage network

In order to solve the problem that existing flow scheduling method is difficult to meet the different multicast scheduling requirements of multi-service flows in the Ceph cloud storage network,a service priority-based multicast flow scheduling method was tailored.First,the network status was obtained via software defined network (SDN) to support flow scheduling.Then,a multicast task was decomposed into multiple attribute decision problems for multiple unicast path selection,and a method of unicast path selection based on technique for order preference by similarity to ideal solution (TOPSIS) was proposed.The unicast path selection method was used to find the optimal unicast path set for the service flow based on the flow’s network performance requirements.Then,the multicast distribution node was determined by the maximum common sub-path among the optimal unicast path sets for construct a multicast transmission path.The experiment results show that the proposed method can reduce the transmission delay of high priority flows while reduce the redundant traffic and better balance the traffic loads compared with the existing methods.     

Bandwidth-allocation policies for unicast and multicast flows

Using multicast delivery to multiple receivers reduces the aggregate bandwidth required from the network compared to using unicast delivery to each receiver. However, multicast is not yet widely deployed in the Internet. One reason is the lack of incentive to use multicast delivery. To encourage the use of multicast delivery, we define a new bandwidth-allocation policy, called LogRD, taking into account the number of downstream receivers. This policy gives more bandwidth to a multicast flow as compared to a unicast flow that shares the same bottleneck, without starving the unicast flows, however. The LogRD policy also provides an answer to the question on how to treat a multicast flow compared to a unicast flow sharing the same bottleneck. We investigate three bandwidth-allocation policies for multicast flows and evaluate their impact on both receiver satisfaction and fairness using a simple analytical study and a comprehensive set of simulations. The policy that allocates the available bandwidth as a logarithmic function of the number of receivers downstream of the bottleneck achieves the best tradeoff between receiver satisfaction and fairness     

On max-min fair congestion control for multicast ABR service in ATM

In the ATM Forum activities, considerable efforts have focused on the congestion control of point-to-point available bit rate (ABR) service. We present a novel approach that extends existing point-to-point (unicast) congestion control protocols to a point-to-multipoint (multicast) environment. In particular, we establish a unified framework to derive a multicast congestion control protocol for an ABR service from a given rate-based unicast protocol. We generalize a known necessary and sufficient condition on the max-min fairness of unicast rate allocation for a multicast service. Using this condition, we show that the resulting multicast protocol derived using our framework preserves the fairness characteristics of the underlying unicast protocol. The practical significance of our approach is illustrated by extending a standard congestion control mechanism for an ABR service to a multicast environment. The performance of the resulting multicast protocol is examined using benchmark network configurations suggested by the traffic management subworking group at the ATM Forum, and simulation results are presented to substantiate our claims     

Contention resolution considering multicast traffic in optically burst-switched WDM networks

This paper proposes a contention resolution scheme considering multicast traffic in optical burst switching (OBS) networks. In OBS networks, for unicast bursts, contention can be avoided by deflection routing. However, deflection routing cannot be applied to multicast bursts because multicast bursts are transmitted along light-trees which are fixed, tree-shaped routes. Therefore, the loss probability of multicast bursts is generally high. To resolve this problem, the proposed scheme introduces an ingenious offset time assignment strategy which completely avoids contention of multicast bursts due to transmissions of unicast bursts by strategically assigning additional offset times. Furthermore, in the proposed scheme, unicast bursts avoid contention with deflection routing. Through simulation experiments, we show that the proposed scheme improves the loss probabilities of both of unicast bursts and multicast bursts.     

一种支持单播与组播混合业务的高速Crossbar调度算法

当前在高速crossbar中支持单、组播混合业务调度的实用算法一般采用请求-许可-接受的处理流程(例如ESLIP算法)。研究发现,该类算法中存在单、组播许可相互阻塞现象,造成调度效率降低。从实用性出发,该文提出了一种新的支持单、组播混合业务的调度算法ERGRR(Extended Request-Grant-based Round- Robin),通过简化调度处理流程,克服了许可阻塞现象,提高了系统吞吐量、时延等性能。仿真结果表明,在单、组播混合业务流下,ERGRR算法吞吐量、时延等性能优于ESLIP算法。另外,ERGRR算法具有更好的公平性以及更加易于硬件实现。     

A collision detection method for multicast transmissions in CSMA/CA networks

Compared to unicast traffic, multicast is not protected by any ARQ mechanism in 802.11 networks: collisions with other multicast and unicast transmissions are not detected and senders will not adapt to the contention situation by backing off. This results in an unreliable service for multicast transmissions. We propose early multicast collision detection (EMCD), an algorithm with the purpose of increasing the reliability of multicast transmissions in the MAC layer of an IEEE 802.11 network. A multicast sender using it will introduce an early pause in a transmission, perform a clear channel assessment (CCA), and if a collision is detected abort the transmission after a fixed time and schedule a retransmission. This allows for detecting collisions with both multicast and unicast transmissions but also adapting to the contention situation. A probabilistic analysis is provided showing that EMCD is more efficient than ordinary multicast and can be made even more efficient by tuning parameters. Simulations show that EMCD leads to increased reliability for multicast transmissions. Copyright © 2006 John Wiley & Sons, Ltd.     

全双工协作多播业务在NOMA系统中的应用和性能

研究了多播业务在协作非正交多址接入（non-orthogonal multiple access,NOMA）系统中的应用及其性能。在一个单播和多播混合业务的场景中,多播用户组中选择某个信道状态最好的用户作为中继进行解码转发单播用户的信号,并在中继用户支持全双工的模式下,分析和推导了单播用户的中断概率和平均可达速率的闭式表达式。蒙特卡洛仿真结果和理论推导高度一致,表明提出的协作多播应用可以极大改善单播用户的中断性能,且多播用户的容量性能在中继发射功率不是很高的情况下不会受到影响。     

Scheduling Combined Unicast and Multicast Traffic in Broadcast WDM Networks

This paper studies the performance of various strategies for scheduling a combined load of unicast and multicast traffic in a broadcast WDM network. The performance measure of interest is schedule length, which directly affects both aggregate network throughput and average packet delay. Three different scheduling strategies are presented, namely: separate scheduling of unicast and multicast traffic, treating multicast traffic as a number of unicast messages, and treating unicast traffic as multicasts of size one. A lower bound on the schedule length for each strategy is first obtained. Subsequently, the strategies are compared against each other using extensive simulation experiments in order to establish the regions of operation, in terms of a number of relevant system parameters, for which each strategy performs best. Our main conclusions are as follows. Multicast traffic can be treated as unicast traffic, by replicating all multicast packets, under very limited circumstances. On the other hand, treating unicast traffic as a special case of multicast traffic with a group of size 1, produces short schedules in most cases. Alternatively, scheduling and transmitting each traffic component separately is also a good choice.