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

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

Family ACK tree (FAT): supporting reliable multicast in mobile ad hoc networks

A new protocol, called family ACK tree (FAT), is proposed to support a reliable multicast service for mobile ad hoc networks. For each reliable multicast protocol, a recovery scheme is used to ensure end-to-end delivery of unreliable multicast packets for all group members. FAT employs a tree-based recovery mechanism that localizes ACKs and retransmissions to avoid feedback implosion. To cope with node movements, FAT constructs an ACK tree on which each node maintains reachability information to three generations of nodes on the ACK tree. When a tree is fragmented due to a departed node, the fragments are glued back to the tree using the underlying multicast routing protocol. FAT then adopts an adaptive scheme to recover missed packets that have been multicast to the group during fragmentation and are not repaired by the new reliability agent. We have conducted simulations to compare the performance of FAT with existing solutions. The results show that FAT achieves better performance for the provision of reliable service in ad hoc networks, in terms of reliability, scalability, and delivery efficiency.     

HMRB:基于层状多环结构的应用层多播协议

提出HMRB（Hierarchical Rings Based）协议,并对其性能进行仿真评估.HMRB建立在层次多环拓扑之上,是-可扩展的应用层多播协议.该方案设计提出区间划分机制.通过该机制可以简单快速地建立起转发树转发数据.利用p2psim,对HMRB进行性能仿真并和NICE协议作比较.仿真结果表明：和NICE相比,HMRB带宽利用率高、平均路径长度小、链路压力低.     

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.     

oStream: asynchronous streaming multicast in application-layer overlay networks

Although initially proposed as the deployable alternative to Internet protocol multicast, the application-layer overlay network actually revolutionizes the way network applications can be built, since each overlay node is an end host and is able to carry out more functions than simply forwarding packets. The paper addresses the on-demand media distribution problem in the context of an overlay network. We take advantage of the strong buffering capabilities of end hosts, and propose a novel overlay multicast strategy, oStream. We have performed extensive analysis and performance evaluation with respect to the scalability and the efficiency of oStream. With respect to the required server bandwidth, we show that oStream defeats the theoretical lower bound of traditional multicast-based approaches, under both sequential and nonsequential stream access patterns. oStream is also robust against bursty requests. With respect to bandwidth consumption on the backbone network, we show that the benefit introduced by oStream overshadows the topological inefficiency (e.g., link stress and stretch) introduced by using application-layer multicast.     

Enabling Confidentiality of Data Delivery in an Overlay Broadcasting System

In this paper, we present an extensive study of key dissemination schemes in an overlay multicast context, and the first to involve actual implementation, real traces, and performance in Internet environments. Given that rekey traffic has stronger resilience requirements and is burstier than data traffic, we consider whether data and keys must be distributed using the same overlay or using two separate dissemination structures. Our key findings are: (i) a coupled architecture is effective in achieving resilient key dissemination. Using TCP in each hop of the dissemination structure (an opportunity unique to overlays) is effective in achieving resiliency in end-to-end key delivery. The performance can be further enhanced if convergence properties of overlays are considered; and (ii) a coupled architecture optimized for data delivery has high overheads, while a coupled architecture optimized for key delivery may not honor access bandwidth constraints of nodes. Distributing data and keys using separate overlays achieves low overhead for key dissemination while honoring access bandwidth constraints of nodes.     

A peer-to-peer architecture for media streaming

Given that the Internet does not widely support Internet protocol multicast while content-distribution-network technologies are costly, the concept of peer-to-peer could be a promising start for enabling large-scale streaming systems. In our so-called Zigzag approach, we propose a method for clustering peers into a hierarchy called the administrative organization for easy management, and a method for building the multicast tree atop this hierarchy for efficient content transmission. In Zigzag, the multicast tree has a height logarithmic with the number of clients, and a node degree bounded by a constant. This helps reduce the number of processing hops on the delivery path to a client while avoiding network bottlenecks. Consequently, the end-to-end delay is kept small. Although one could build a tree satisfying such properties easily, an efficient control protocol between the nodes must be in place to maintain the tree under the effects of network dynamics. Zigzag handles such situations gracefully, requiring a constant amortized worst-case control overhead. Especially, failure recovery is done regionally with impact on, at most, a constant number of existing clients and with mostly no burden on the server.     

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.     

Understanding and Exploiting the Trade-Offs between Broadcasting and Multicasting in Mobile Ad Hoc Networks

We find that current group communications protocols are far from "one size fits all", they are typically geared toward and optimized for particular scenarios. Multicasting, in general, works well if the density of group members is sparse and in low mobility; broadcasting, in contrast, works well with a high density of group members and in high mobility. Due to the dynamics of the network, one strategy may be preferable to the other at different times and in different localized regions. In this paper, we first quantify the trade-offs between broadcasting and multicasting and evaluate the suitability of a strategy in various scenarios of deployment. Based on the lessons learned, we design a protocol that adapts in response to the dynamics of the network. We named our protocol Fireworks. Fireworks is a hybrid two-tier multicast/broadcast protocol that provides efficient and lightweight multicast dissemination and self-adapts in response to variations in the density and distribution of group members to provide efficient performance. Fireworks creates pockets of broadcast distribution in areas with many members, while it creates and maintains a multicast backbone to interconnect these dense pockets. Fireworks offers packet delivery statistics comparable to that of a pure multicast scheme but with significantly lower overheads. We also show that Fireworks has a lower level of degrading influence on the performance of coexisting unicast sessions than either traditional multicast or broadcast methods     

Exploring the design space of reliable multicast protocols for wireless mesh networks

Many important applications in wireless mesh networks require reliable multicast communication, i.e., with 100% packet delivery ratio (PDR). Previously, numerous multicast protocols based on automatic repeat request (ARQ) have been proposed to improve the packet delivery ratio. However, these ARQ-based protocols can lead to excessive control overhead and drastically reduced throughput. In this paper, we present a comprehensive exploration of the design space for developing high-throughput, reliable multicast protocols that achieve 100% PDR.Motivated by the fact that 802.11 MAC layer broadcast, which is used by most wireless multicast protocols, offers no reliability, we first examine if better hop-by-hop reliability provided by unicasting the packets at the MAC layer can help to achieve end-to-end multicast reliability. We then turn to end-to-end solutions at the transport layer. Previously, forward error correction (FEC) techniques have been proved effective for providing reliable multicast in the Internet, by avoiding the control packet implosion and scalability problems of ARQ-based protocols. In this paper, we examine if FEC techniques can be equally effective to support reliable multicast in wireless mesh networks. We integrate four representative reliable schemes (one ARQ, one FEC, and two hybrid) originally developed for the Internet with a representative multicast protocol ODMRP and evaluate their performance.Our experimental results via extensive simulations offer an in-depth understanding of the various choices in the design space. First, compared to broadcast-based unreliable ODMRP, using unicast for per-hop transmission only offers a very small improvement in reliability under low load, but fails to improve the reliability under high load due to the significantly increased capacity requirement which leads to congestion and packet drop. Second, at the transport layer, the use of pure FEC can significantly improve the reliability, increasing PDR up to 100% in many cases, but can be inefficient in terms of the number of redundant packets transmitted. In contrast, a carefully designed ARQ–FEC hybrid protocol, such as RMDP, can also offer 100% reliability while improving the efficiency by up to 38% compared to a pure FEC scheme. To our best knowledge, this is the first in-depth study of high-throughput, reliable multicast protocols that provide 100% PDR for wireless mesh networks.     

An Efficient Multicast Routing Protocol in Wireless Mobile Networks

Providing multicast service to mobile hosts in wireless mobile networking environments is difficult due to frequent changes of mobile host location and group membership. If a conventional multicast routing protocol is used in wireless mobile networks, several problems may be experienced since existing multicast routing protocols assume static hosts when they construct the multicast delivery tree. To overcome the problems, several multicast routing protocols for mobile hosts have been proposed. Although the protocols solve several problems inherent in multicast routing proposals for static hosts, they still have problems such as non-optimal delivery path, datagram duplication, overheads resulting from frequent reconstruction of a multicast tree, etc. In this paper, we summarize these problems of multicast routing protocols and propose an efficient multicast routing protocol based on IEFT mobile IP in wireless mobile networks. The proposed protocol introduces a multicast agent, where a mobile host receives a tunneled multicast datagram from a multicast agent located in a network close to it or directly from the multicast router in the current network. While receiving a tunneled multicast datagram from a remote multicast agent, the local multicast agent may start multicast join process, which makes the multicast delivery route optimal. The proposed protocol reduces data delivery path length and decreases the amount of duplicate copies of multicast datagrams. We examined and compared the performance of the proposed protocol and existing protocols by simulation under various environments and we got an improved performance over the existing proposals.     

Multicast with network coding in application-layer overlay networks

All of the advantages of application-layer overlay networks arise from two fundamental properties: 1) the network nodes in an overlay network, as opposed to lower-layer network elements such as routers and switches, are end systems and have capabilities far beyond basic operations of storing and forwarding; 2) the overlay topology, residing above a densely connected Internet protocol-layer wide-area network, can be constructed and manipulated to suit one's purposes. We seek to improve end-to-end throughput significantly in application-layer multicast by taking full advantage of these unique characteristics. This objective is achieved with two novel insights. First, we depart from the conventional view that overlay nodes can only replicate and forward data. Rather, as end systems, these overlay nodes also have the full capability of encoding and decoding data at the message level using efficient linear codes. Second, we depart from traditional wisdom that the multicast topology from source to receivers needs to be a tree, and propose a novel and distributed algorithm to construct a two-redundant multicast graph (a directed acyclic graph) as the multicast topology, on which network coding is applied. We design our algorithm such that the costs of link stress and stretch are explicitly considered as constraints and minimized. We extensively evaluate our algorithm by provable analytical and experimental results, which show that the introduction of two-redundant multicast graph and network coding may indeed bring significant benefits, essentially doubling the end-to-end throughput in most cases.     

Realization of a Scalable and Reliable Multicast Transport Protocol for Many‐to‐Many Sessions

In this paper, we present the Enhanced Communication Transport Protocol–Part 5 (ECTP‐5), which provides scalable and reliable multicast communication service for many‐to‐many applications by constructing high quality recovery trees from two‐layer logical trees and repairing the losses via unicast automatic repeat request–based error control. In order to realize the protocol, we developed feasible protocol architectures and building blocks including additional functions which deal with engineering details, such as membership dynamics and sender coordination. Experimental results show that ECTP‐5 scales well with various session sizes and packet loss rates in terms of control overhead and recovery latency.     

A Comparison of Resilient Overlay Multicast Approaches

Overlay-based multicast has been proposed as a key alternative for large-scale group communication. There is ample motivation for such an approach, as it delivers the scalability advantages of multicast while avoiding the deployment issues of a network-level solution. As multicast functionality is pushed to autonomous, unpredictable end systems, however, significant performance loss can result from their higher degree of transiency when compared to routers. Consequently, a number of techniques have recently been proposed to improve overlays' resilience by exploiting path diversity and minimizing node dependencies. Delivering high application performance at relatively low costs and under high degree of transiency has proven to be a difficult task. Each of the proposed resilient techniques comes with a different trade-off in terms of delivery ratio, end-to-end latency and additional network traffic. In this paper, we review some of these approaches and evaluate their effectiveness by contrasting the performance and associated cost of representative protocols through simulation and wide area experimentation.     

Key management protocol with end-to-end data security and key revocation for a multi-BS wireless sensor network

Focusing on a large-scale wireless sensor network with multiple base stations (BS), a key management protocol is designed in this paper. For securely relaying data between a node and a base station or two nodes, an end-to-end data security method is adopted by this protocol. Further employing a distributed key revocation scheme to efficiently remove compromised nodes then forms our key management protocol celled multi-BS key management protocol (MKMP). Through performance evaluation, we show that MKMP outperforms LEDS Ren et al. (IEEE Trans Mobile Comput 7(5):585–598, 2008) in terms of efficiency of resilience against the node capture attack. With the analysis of key storage overheads, we demonstrate that MKMP performs better than mKeying Wang et al. (A key management protocol for wireless sensor networks with multiple base stations. In: Procceedings of ICC'08, pp 1625–1629, 2008) in terms of this overhead.     

A Proactive Tree Recovery Mechanism for Resilient Overlay Multicast

Overlay multicast constructs a multicast delivery tree among end hosts. Unlike traditional IP multicast, the non-leaf nodes in the tree are normal end hosts, which are potentially more susceptible to failures than routers and may leave the multicast group voluntarily. In these cases, all downstream nodes are affected. Thus, an important problem for making overlay multicast more dependable is how to recover from node departures in order to minimize the disruption of service to those affected nodes. In this paper, we propose a proactive tree recovery mechanism to make the overlay multicast resilient to these failures and unexpected events. Rather than letting downstream nodes try to find a new parent after a node departure, each non-leaf node precalculates a parent-to-be for each of its children. When this non-leaf node is gone, all its children can find their respective new parents immediately. The salient feature of the approach is that rescue plans for multiple non-leaf nodes can work together for their respective children when they fail or leave at the same time. Extensive simulations demonstrate that our proactive approach can recover from node departures much faster than reactive methods, while the quality of trees restored and the cost of recovery are reasonable     

A reliable multicast framework for light-weight sessions andapplication level framing

This paper describes scalable reliable multicast (SRM), a reliable multicast framework for light-weight sessions and application level framing. The algorithms of this framework are efficient, robust, and scale well to both very large networks and very large sessions. The SRM framework has been prototyped in wb, a distributed whiteboard application, which has been used on a global scale with sessions ranging from a few to a few hundred participants. The paper describes the principles that have guided the SRM design, including the IP multicast group delivery model, an end-to-end, receiver-based model of reliability, and the application level framing protocol model. As with unicast communications, the performance of a reliable multicast delivery algorithm depends on the underlying topology and operational environment. We investigate that dependence via analysis and simulation, and demonstrate an adaptive algorithm that uses the results of previous loss recovery events to adapt the control parameters used for future loss recovery. With the adaptive algorithm, our reliable multicast delivery algorithm provides good performance over a wide range of underlying topologies     

Codecast: a network-coding-based ad hoc multicast protocol

In this article we present CodeCast, a network-coding-based ad hoc multicast protocol. CodeCast is especially well-suited for multimedia applications with low-loss, low-latency constraints such as audio/video streaming. The key ingredient of CodeCast is random network coding, which transparently implements both localized loss recovery and path diversity with very low overhead. Simulation results show that in a typical setting, CodeCast yields a nearly 100 percent delivery ratio, as compared to a 94 percent delivery ratio by traditional multicast. More importantly, the overhead is reduced by as much as 50 percent     

VoIP over cdma2000 1xEV-DO revision A

In this article we analyze performance of VoIP services over 1xEVDO-Revision A (DO-Rev A) networks and show that high-quality VoIP with unconstrained mobility and high capacity can be achieved. Together with quality of service (QoS) requirements, we emphasize practical issues such as mobility, degradation of feedback-channel quality, and packet overheads. Novel techniques are presented for voice processing such as smart blanking and adaptive dejitter playback buffer with time warping. These techniques help to meet QoS constraints to achieve a circuit-like voice quality while improving overall capacity. Detailed end-to-end simulations are presented and system capacity is analyzed under the QoS and system stability constraints. We claim that DO-Rev A can provide VoIP capacity comparable to circuit-switched cellular CDMA technologies (e.g., IS-2000) and simultaneously carry significant amount of other types of traffic such as non-delay sensitive applications and downlink multicast.     

一种基于带宽和时延约束的分布式组播路由算法

针对已有分布式组播路由算法在寻找QoS路由时的低成功率问题,本文提出了一种新的基于带宽和时延约束的分布式组播路由算法-QDMR(QoS-based Distributed Multicast Routing).在为新组播成员搜索连接到组播树的可行路径时,QDMR算法使用RBMF(Reverse Best Metric Forwarding)转发算法代替RPF(Reverse Path Forwarding)转发算法,从而优先搜索满足带宽和时延约束要求的路径,然后才考虑代价的优化.模拟分析表明,QDMR提高了路由搜索的成功率,并且降低了协议开销.