Efficient multicast search under delay and bandwidth constraints

The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard. We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior to the implementation of an optimal single user search on a group of users. Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California. From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February 1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University, Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York. Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks, mobility, search strategies, and multiple access protocols.     

WCDMA的MBMS技术

主要介绍了基于WCDMA的MBMS技术,给出了其网络架构和技术难点,并对其应用给无线网络带来的影响作了一定深度的探讨。     

一种减轻显式组播路由节点负载的策略

本文基于显式组播（Explicit Multicast）机制和遗传算法的思想，提出了一种通过减少组播组中存放转发信息的路由节点数量来减轻路由路径负担的策略。通过算法描述和分析及实验仿真，此方案可以有效地节省网络资源。     

Quantified Cost-Balanced routing scheme for overlay multicast

This paper focuses on the quantitative analysis issue of the routing metrics tradeoff problem, and presents a Quantified Cost-Balanced overlay multicast routing scheme （QCost-Balanced） to the metric tradeoff problem between overlay path delay and access bandwidth at Multicast Server Nodes （MSN） for real-time applications over Internet. Besides implementing a dynamic priority to MSNs by weighing the size of its service clients for better efficiency, QCost-Balanced tradeoffs these two metrics by a unified tradeoff metric based on quantitative analysis. Simulation experiments demonstrate that the scheme achieves a better tradeoff gain in both two metrics, and effective performance in metric quantitative control.     

基于GIS的雷达远程显示系统的设计与实现

将GIS应用在雷达远程显示系统中。运用组件式GIS开发模式,设计了具有串行数据通信、网络数据通信、目标数据定位、属性查询、地理分析等功能的GIS应用软件。系统的研制打破了传统雷达信息显示方式的局限性,实现了雷达信息与GIS的有机结合,给指挥人员的决策带来极大的方便。     

Asymptotic throughput analysis of multicast transmission schemes

This paper demonstrates the use of extreme value theory in the asymptotic throughput analysis of wireless multicast and unicast for large number of users. Exact analysis of these schemes involves finding the probability distributions of maxima or minima of signal to noise ratios (SNRs). Jointly considering random user distribution and Rayleigh fading, exact distributions of these extreme values become complex and lack insights. On the other hand, asymptotic expressions obtained by using extreme value theory are quite accurate even for moderate number of users and they give insights about the performances without using simulations. The results of this analysis can be used in designing cellular unicast and multicast systems.     

A novel dynamic Multiple Ring-based Local Restoration for point-to-multipoint multicast traffic in WDM mesh networks

Optical networks with DWDM (Dense Wavelength Division Multiplex) can provide multiple data channels to supply high speed, high capacity to perform bandwidth-intensive multicast transmission service. Light-tree is a popular technique applied to support point-to-multipoint multicast services. Any failure during a multicast session would cause severe service loss or disruptions, especially when the faults occur near the source node. A novel ring-based local fault recovery mechanism, Multiple Ring-based Local Restoration (MRLR), for point-to-multipoint multicast traffic based on the minimum spanning tree (MST) in WDM mesh networks is proposed in this article. The MRLR mechanism dismembers the multicast tree into several disjoint segment-blocks (sub-trees) and reserves preplanned spare capacity to set up multiple protection rings in each segment-block for providing rapid local recovery. The MRLR scheme outperforms other methodologies in terms of the blocking probability, recovery time, and average hop count of protection path per session for different network topologies.     

Bounded-distance multi-clusterhead formation in wireless ad hoc networks

We present a clustering technique addressing redundancy for bounded-distance clusters, which means being able to determine the minimum number of cluster-heads per node, and the maximum distance from nodes to their cluster-heads. This problem is similar to computing a (k, r)-dominating set, (k, r)-DS, of the network. (k, r)-DS is defined as the problem of selecting a minimum cardinality vertex set D of the network such that every vertex u not in D is at a distance smaller than or equal to r from at least k vertices in D. In mobile ad hoc networks (MANETs), clusters should be computed distributively, because the topology may change frequently. We present the first centralized and distributed solutions to the (k, r)-DS problem for arbitrary topologies. The centralized algorithm computes a (k · ln Δ)-approximation, where Δ is the largest cardinality among all r-hop neighborhoods in the network. The distributed approach is extended for clustering applications, while the centralized is used as a lower bound for comparison purposes. Extensive simulations are used to compare the distributed solution with the centralized one. As a case study, we propose a novel multi-core multicast protocol that applies the distributed solution for the election of cores. The new protocol is compared against PUMA, one of the best performing multicast protocols for MANETS. Simulation results show that the new protocol outperforms PUMA on the context of static networks.     

一种适用于网络视频监控系统的应用层组播方案

分析了视频监控系统中流媒体转发的特点，提出了一种适用于网络视频监控系统的应用层组播方案，给出了该方案的设计思路和组播算法理论，并展望了进一步的研究要点。     

分布式安全组播体系结构的实现

随着因特网不断商业化和用户数量的急剧增加，组播通信中的安全问题受到研究人员的日益关注。许多研究机构提出了解决这些安全问题的体系结构。文章通过分析组播的安全问题和安全服务，给出了设计体系结构中需要注意的问题。在分析这些体系结构的基础上，提出了具有安全策略的DSMA(Dist Iibuted Secure Mumcast Architecture)体系结构，它对Iolus单点故障进行了解决。最后给出了DSMA的实现方案。