Controllable multicast for IPTV over EPON

The character of 1 Gbps bandwidth and tree-based structure make Ethernet passive optical network (EPON) very suitable for broadcast or multicast services such as Internet protocol television video (IPTV). The document proposed a novel scheme, based on the former research for controllable multicast over EPON system, mainly considering system security and maintainability. It can both control the IPTV program source's and the receiver's validity, improving the efficiency and precision.     

基于10 G EPON的IPTV可控组播的实现方式研究

10 G EPON被称为下一代PON(NG PON)技术,能更好地满足三网融合条件下IPTV等视频业务的高带宽接入需求.为了在10 G EPON系统上承载IFTTV组播业务,需要引入可控组播技术,对10 G EPON系统的组播方式进行控制.主要研究了10 GEPON系统中IPTV可控组播的实现原理及流程,提出,了基于I...     

Explicit Multicast Extension (Xcast+) for Efficient Multicast Packet Delivery

In this letter, we propose a new multicast scheme, named Xcast+, which is an extension of Explicit Multicast (Xcast) for an efficient delivery of multicast packets. The mechanism incorporates the host group model and a new control plane into existing Xcast, and not only does it provide the transparency of traditional multicast schemes to senders and receivers, but it also enhances the routing efficiency in networks. Since intermediate routers do not have to maintain any multicast states, it results in a more efficient and scalable mechanism to deliver multicast packets. Our simulation results show distinct performance improvements of our approach compared to Xcast, particularly as the number of receivers in a subnet increases.     

Erasure coding for reliable adaptive retransmission in wireless broadcast/multicast systems

In this paper, we present new adaptive automatic repeat request (ARQ) schemes for wireless broadcast/multicast combining erasure coding (EC) and packet retransmission. Traditional approaches rely on retransmitting the lost packets in a point-to-point or point-to-multipoint mode. The main idea behind the presented protocols is to retransmit adaptive combinations of the lost packets using EC, which can help several receivers to recover the lost information with fewer retransmission attempts. We propose two versions of EC-based ARQ protocols, and investigate theoretically the corresponding transmission bandwidths in different contexts. We show through simulation results the efficiency of the proposed protocols with respect to conventional ARQ strategies and new published ARQ works for broadcast/multicast. Finally, a new sliding window NACK feedback policy is presented for the case of a high number of receivers to avoid the feedback implosion problem.     

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     

EPON系统承载IPTV业务的关键技术研究

目前固网运营商纷纷开始了IPTV业务的试验和网络部署。IPTV业务部署涉及内容分发、业务平台建设、传输和接入承载网络建设以及终端部署等多个方面。接入承载网络包含了DSL接入、LAN接入、EPON接入等多种模式,文章着重阐述了EPON接入模式下,系统承载IPTV业务的关键技术要求,包括业务隔离和VLAN规划、组播功能、端口定位与认证和业务安全等。     

Reliable multicast transport protocol (RMTP)

This paper presents the design, implementation, and performance of a reliable multicast transport protocol (RMTP). The RMTP is based on a hierarchical structure in which receivers are grouped into local regions or domains and in each domain there is a special receiver called a designated receiver (DR) which is responsible for sending acknowledgments periodically to the sender, for processing acknowledgment from receivers in its domain, and for retransmitting lost packets to the corresponding receivers. Since lost packets are recovered by local retransmissions as opposed to retransmissions from the original sender, end-to-end latency is significantly reduced, and the overall throughput is improved as well. Also, since only the DRs send their acknowledgments to the sender, instead of all receivers sending their acknowledgments to the sender, a single acknowledgment is generated per local region, and this prevents acknowledgment implosion. Receivers in RMTP send their acknowledgments to the DRs periodically, thereby simplifying error recovery. In addition, lost packets are recovered by selective repeat retransmissions, leading to improved throughput at the cost of minimal additional buffering at the receivers. This paper also describes the implementation of RMTP and its performance on the Internet     

EPON承载IPTV组播业务的设计

提出一种在EPON系统上实现IPTV组播业务的方案,该方案通过重新定义逻辑链路标识(LLID)作为VLAN的标志,把具有相同节目频道业务的ONU划分到同一个VLAN上,实现组播功能。并在OLT和ONU分别执行因特网组管理协议代理(IGMP Proxy)和监听(IGMP Snooping)机制对组播成员进行管理,大大减少了组播控制报文的开销。最后用现场可编程门阵列(FPGA)设计实现该方案的主要功能模块,通过仿真验证该方案的可行性。     

Hop-by-hop Content Distribution with Network Coding in Multihop Wireless Networks

The predominant use of today's networks is content access and distribution. Network Coding (NC) is an innovative technique that has potential to improve the efficiency of multicast content distribution over multihop Wireless Mesh Networks (WMNs) by allowing intermediate Forwarding Nodes (FNs) to encode and then forward data packets. Practical protocols are needed to realize the benefits of the NC technique. However, the existing NC-based multicast protocols cannot accurately determine the minimum number of coded packets that a FN should send in order to ensure successful data delivery to the destinations, so that many redundant packets are injected into the network, leading to performance degradation. In this paper, we propose HopCaster, a novel reliable multicast protocol that incorporates network coding with hop-by-hop transport. HopCaster completely eliminates the need for estimating the number of coded packets to be transmitted by a FN, and avoids redundant packet transmissions. It also effectively addresses the challenges of heterogeneous multicast receivers. Moreover, a cross-layer multicast rate adaptation mechanism is proposed, which enables HopCaster to optimize multicast throughput by dynamically adjusting wireless transmission rate based on the changes in the receiver population and channel conditions during the course of multicasting a coded data chunk. Our evaluations show that HopCaster significantly outperforms the existing NC-based multicast protocols.     

ASON组播技术及其应用研究

业务的多样性和不断出现的新业务正在驱动网络的发展，以IPTV为代表的基于流媒体的业务对光网络提出了新的挑战，光网络需要引入组播功能，支持组播业务。组播功能的引入使得光网络的带宽利用率得到有效提高。组播是未来光网络必不可少的技术。层叠网络的进一步演进，将进一步融合IP组播和光网络组播。未来，可以通过降低光网络组播树的粒度来降低光组播的使用门槛，这将有利于促进组播技术的更广泛使用。     

Protocol-independent multicast packet delivery improvement service for mobile Ad hoc networks

This paper addresses the issue of improving multicast packet delivery in mobile ad hoc networks and proposes an adaptive mechanism called Protocol-Independent Packet Delivery Improvement Service (PIDIS) to recover lost multicast packets. PIDIS provides its packet-delivery improvement services to any multicast routing protocol for mobile ad hoc networks by exploiting the mechanism of swarm intelligence to make intelligent decisions about where to fetch the lost multicast packets from. PIDIS is a gossip protocol, and nodes using PIDIS are only concerned with which neighbor nodes to gossip with to recover the most lost packets, rather than which member nodes to gossip with. Thus, it does not rely on membership information in a multicast scenario, which is often difficult to get. PIDIS employs the beneficial aspects of probabilistic routing and adapts well to mobility. PIDIS achieves probabilistic improvement in multicast packet delivery and, unlike other gossip-based schemes, does not need to maintain information about group members from which lost multicast packets are retrieved. Further, the operations of PIDIS do not rely on any underlying routing protocol or primitive, and can be incorporated into any ad hoc multicast routing protocol. We incorporated PIDIS over ODMRP [On-Demand Multicast Routing Protocol in Multihop Wireless Mobile Networks, Kluwer Mobile Networks and Applications, 2000], and compared it against Anonymous Gossip (AG) [International Conference on Distributed Computing Systems (ICDCS 2001) Phoenix, Arizona, April 2001] implemented over ODMRP, and ODMRP itself. Our simulation results show that ODMRP + PIDIS is more efficient and performs better than ODMRP + AG and ODMRP in terms of multicast packet delivery, end-to-end delay, and MAC layer overheads. We attribute the better performance and lower MAC overheads of ODMRP + PIDIS to the efficient gossiping made possible by using the swarm intelligence techniques.     

Source Filtering in IP Multicast Routing

IP multicasting is an efficient group communication mechanism. It avoids transmitting packets from a sender to each of the receivers separately. Under the current IP multicast model, once having joined a group, the host will receive all data destined to the group from any source, irrespective of whether it wishes to receive them. This paper studies source filtering (SF) in IP multicasting. Source filtering allows individual hosts to specify the reception of packets sent to a multicast group only from a list of source addresses or to explicitly identify a list of the sources whose data the hosts do not want to receive. We investigate the issue of source filtering in the context of multicast routing protocols, and provide support of source filtering for shared-tree based IP multicast routing. We also discuss how source filtering improves the performance of existing work on IP multicast. Finally, we provide analysis and conduct simulations to evaluate the performance of the proposed SF mechanism. The results show that our mechanism allows better bandwidth utilization and scalability than those without the capability of source filtering, thus achieving a truly efficient use of resources for IP multicasting     

不可靠信道上抗主动攻击的组播认证

组播是视频会议、协同工作等各种群组应用的基本通讯模式,组播安全性的研究具有重要意义.组播通常构建在不可靠的通讯协议上,因此存在数据包的丢包现象.大多数的组播认证方案不能用于这种环境,其他一些方案的主要目标是针对网络通讯故障引起的随机包丢失情况,而不能抵抗主动攻击.本文提出了抗部分碰撞哈希函数簇的思想,然后利用哈希图和纠错码技术提构造一种在不可靠信道上新的组播认证方案.该方案不仅具有很高的通讯性能和计算性能,并且在存在部分数据包丢失的情况下也可以抵抗主动攻击.本文提出了一种针对该方案特性的不可靠信道组播认证的形式安全模型,并在此安全模型下基于规约技术证明了该方案的安全性.     

多播网络中基于网络编码的高效丢失恢复机制

网络编码为无线网络中可靠多播通信提供了有效解决途径。该文分析了网络中编码机会的变化规律,研究了解码失败的编码数据包对网络编码性能的影响,提出了新的基于网络编码的丢失恢复算法(NCLR)。NCLR要求节点缓存解码失败的编码数据包,并反馈信息给发送节点。根据各个节点的丢包情况,NCLR通过优先传输对编码性能影响较大的数据包,并在需要重传的已编码数据包和原始数据包中选择编码组合,来充分挖掘网络中的编码机会。仿真结果表明相对于已有算法,NCLR算法可以在重传次数和丢失恢复时延方面有显著性能改善。     

ICAM: integrated cellular and ad hoc multicast

In third generation (3G) wireless data networks, multicast throughput decreases with the increase in multicast group size, since a conservative strategy for the base station is to use the lowest data rate of all the receivers so that the receiver with the worst downlink channel condition can decode the transmission correctly. This paper proposes ICAM, integrated cellular and ad hoc multicast, to increase 3G multicast throughput through opportunistic use of ad hoc relays. In ICAM, a 3G base station delivers packets to proxy mobile devices with better 3G channel quality. The proxy then forwards the packets to the receivers through an IEEE 802.11-based ad hoc network. In this paper, we first propose a localized greedy algorithm that discovers for each multicast receiver the proxy with the highest 3G downlink channel rate. We discover that due to capacity limitations and interference of the ad hoc relay network, maximizing the 3G downlink data rate of each multicast receiver's proxy does not lead to maximum throughput for the multicast group. We then show that the optimal ICAM problem is NP-hard, and derive a polynomial-time 4-approximation algorithm for the construction of the multicast forest. This bound holds when the underlying wireless MAC supports broadcast or unicast, single rate or multiple rates (4(1 + /spl isin/) approximation scheme for the latter), and even when there are multiple simultaneous multicast sessions. Through both analysis and simulations, we show that our algorithms achieve throughput gains up to 840 percent for 3G downlink multicast with modest overhead on the 3G uplink.     

EPON系统LLID组播实现初探

作为光纤到户(FTTH)的理想解决方案之一,以太无源光网络(EPON)提供了1Gbit／s的上下行带宽。组播实现了IP网络中点到多点的高效数据传输,能够有效地节约网络带宽和降低网络负载。随着视频点播、电视会议和远程教育等各种高尊宽要求业务的推广,组播技术的加入,将会使EPON能够更加自如地迎接各种新兴的高带宽要求的多媒体业务的挑战。文章作者根据EPON的特点,增加了组播逻辑链路标识(LLID),结合运用因特网组用户管理协议(IGMP)snooping以及操作管理维护(OAM),在EPON系统中实现了一套LLID组播机制。     

Explicit Multicasting for Mobile Ad Hoc Networks

In this paper we propose an explicit multicast routing protocol for mobile ad hoc networks (MANETs). Explicit multicasting differs from common approaches by listing destination addresses in data packet headers. Using the explicit destination information, the multicast routing protocol can avoid the overhead of employing its own route construction and maintenance mechanisms by taking advantage of unicast routing table. Our protocol – termed Differential Destination Multicast (DDM) – is an explicit multicast routing protocol specifically designed for MANET environment. Unlike other MANET multicasting protocols, instead of distributing membership control throughout the network, DDM concentrates this authority at the data sources (i.e. senders) thereby giving sources knowledge of group membership. In addition, differentially-encoded, variable-length destination headers are inserted in data packets which are used in combination with unicast routing tables to forward multicast packets towards multicast receivers. Instead of requiring that multicast forwarding state to be stored in all participating nodes, this approach also provides the option of stateless multicasting. Each node independently has the choice of caching forwarding state or having its upstream neighbor to insert this state into self-routed data packets, or some combination thereof. The protocol is best suited for use with small multicast groups operating in dynamic MANET environment.     

Network loss tomography using striped unicast probes

In this paper, we explore the use of end-to-end unicast traffic as measurement probes to infer link-level loss rates. We leverage off of earlier work that produced efficient estimates for link-level loss rates based on end-to-end multicast traffic measurements. We design experiments based on the notion of transmitting stripes of packets (with no delay between transmission of successive packets within a stripe) to two or more receivers. The purpose of these stripes is to ensure that the correlation in receiver observations matches as closely as possible what would have been observed if a multicast probe followed the same path to the receivers. Measurements provide good evidence that a packet pair to distinct receivers introduces considerable correlation which can be further increased by simply considering longer stripes. Using an M/M/1/K model for a link, we theoretically confirm this benefit for stripes. We also use simulation to explore how well these stripes translate into accurate link-level loss estimates. We observe good accuracy with packet pairs, with a typical error of about 1%, which significantly decreases as stripe length is increased.     

The core-assisted mesh protocol

The core-assisted mesh protocol (CAMP) is introduced for multicast routing in ad hoc networks. CAMP generalizes the notion of core-based trees introduced for internet multicasting into multicast meshes that have much richer connectivity than trees. A shared multicast mesh is defined for each multicast group; the main goal of using such meshes is to maintain the connectivity of multicast groups even while network routers move frequently, CAMP consists of the maintenance of multicast meshes and loop-free packet forwarding over such meshes. Within the multicast mesh of a group, packets from any source in the group are forwarded along the reverse shortest path to the source, just as in traditional multicast protocols based on source-based trees. CAMP guarantees that within a finite time, every receiver of a multicast group has a reverse shortest path to each source of the multicast group. Multicast packets for a group are forwarded along the shortest paths front sources to receivers defined within the group's mesh. CAMP uses cores only to limit the traffic needed for a router to join a multicast group; the failure of cores does not stop packet forwarding or the process of maintaining the multicast meshes     

A Simple and Efficient One‐to‐Many Large File Distribution Method Exploiting Asynchronous Joins

In this paper, we suggest a simple and efficient multiple‐forwarder‐based file distribution method which can work with a tree‐based application layer multicast. Existing multiple‐forwarder approaches require high control overhead. The proposed method exploits the assumption that receivers join a session at different times. In tree‐based application layer multicast, a set of data packets is delivered from its parent after a receiver has joined but before the next receiver joins without overlapping that of other receivers. The proposed method selects forwarders from among the preceding receivers and the forwarder forwards data packets from the non‐overlapping data packet set. Three variations of forwarder selection algorithms are proposed. The impact of the proposed algorithms is evaluated using numerical analysis. A performance evaluation using PlanetLab, a global area overlay testbed, shows that the proposed method enhances throughput while maintaining the data packet duplication ratio and control overhead significantly lower than the existing method, Bullet.