整合式有线电视的视频点播配置方法

提出一种视频点播系统传送数据的结构,结合单播与群播两种数据传送的方法,通过动态改变群播与单播的频道分配比例,让大部分的使用者无需等待即可开始观看影片,进而减少整体使用者的等待时间.     

一种支持QoS的拓扑自适应动态组播路由算法

YAM、QoSMIC、DSDMR等一类支持QoS的动态组播路由算法允许组播成员动态地加入和离开，同时为接收方提供多个可选择的组播接入路径，以满足不同应用的QoS需求。但这些算法普遍存在控制信令开销大和结点加入时延长，可扩展性不好等问题。本文在分析这些算法的基础上，提出改进的支持QoS的动态组播路由算法，即拓扑自适应动态组播路由（Topology Adaptive Dynamic Multicast Routing，TADMR）算法。该算法避免了以往算法中大部分盲目的路径搜索，并使结点加入时延不再受限于固定的等待时钟，而与网络拓扑相自适应。性能分析和仿真结果表明，该算法具有较低的控制信令开销和结点加入时延，适用于各种网络规模和群组规模，具有良好的可扩展性。     

Dynamic Multicast Session Provisioning in WDM Optical Networks with Sparse Splitting Capability

In this work, we study dynamic provisioning of multicast sessions in a wavelength-routed sparse splitting capable WDM network with an arbitrary mesh topology where the network consists of nodes with full, partial, or no wavelength conversion capabilities and a node can be a tap-and-continue (TaC) node or a splitting and delivery (SaD) node. The objectives are to minimize the network resources in terms of wavelength-links used by each session and to reduce the multicast session blocking probability. The problem is to route the multicast session from each source to the members of every multicast session, and to assign an appropriate wavelength to each link used by the session. We propose an efficient online algorithm for dynamic multicast session provisioning. To evaluate the proposed algorithm, we apply the integer linear programming (ILP) optimization tool on a per multicast session basis to solve off-line the optimal routing and wavelength assignment given a multicast session and the current network topology as well as its residual network resource information. We formulate the per session multicast routing and wavelength assignment problem as an ILP. With this ILP formulation, the multicast session blocking probability or success probability can then be estimated based on solving a series of ILPs off-line. We have evaluated the effectiveness of the proposed online algorithm via simulation in terms of session blocking probability and network resources used by a session. Simulation results indicate that our proposed computationally efficient online algorithm performs well even when a fraction of the nodes are SaD nodes.     

The Content Driven Mobile Internet

The development of future mobile networks will be driven, in large part, by content and web based services. In this paper, we examine several performance, scalability and architectural challenges faced by future mobile web applications and how advanced mobile content delivery techniques can address these challenges. We review existing content delivery using a taxonomy that consists of three categories: network scaling, end system acceleration, and content and protocol optimization. While wireline content delivery focuses on network and server scalability, mobile content delivery will likely benefit most from optimizing radio link usage. We also present our ongoing work in this area, which extends the functionality of edge caching to the terminal, uses user interest correlation information to maintain low terminal power consumption and adds a new dimension to radio resource management. This revised version was published online in August 2006 with corrections to the Cover Date.     

基于子节点编码和声搜索的QoS组播路由算法

传统启发式方法求解QoS组播路由问题复杂度高,收敛速率慢,无法满足实际需求。该文提出一种基于子节点编码的和声搜索算法以解决该问题。在和声搜索算法的基础上,该算法设计了新的初始解及新解生成方式,提升了算法执行效率;提出了参数动态调整方案,兼顾了全局搜索以及局部搜索能力;同时设计了一种基于子节点的组播树编码方式,加快了新解生成过程。通过理论分析仿真实验,证明了该文算法的低复杂度,表明该文算法在收敛速率和代价方面具有明显优势。     

Providing reliable and link stability‐based geocasting model in underwater environment

This paper presents a geocast technique for underwater sensor networks. The model named as Routing and Multicast Tree based Geocasting (RMTG) (TRACE'10, Bhopal, India, 2010; ICWET'10, Mumbai, India, 2010) has been designed for underwater sensor networks. In our previous work (TRACE'10, Bhopal, India, 2010; ICWET'10, Mumbai, India, 2010) we proposed only a theoretical model for underwater geocasting. The RMTG technique uses greedy forwarding and previous hop handshaking to route the packets towards the geocast region and further disseminates the data within the geocast region by creating a multicast shortest path tree. We also presented various link broken scenarios along with their solutions. The proposed model does not use the flooding technique to deliver the packets inside the geocast region that is used in most of the geocasting techniques. In this paper, we present the simulated RMTG model. The simulation results show that the proposed model provides an efficient distribution of data in the geocast region in terms of node mobility handling, packet delivery ratio and a better end‐to‐end latency. Most of the work on geocasting has been done for mobile and vehicular ad hoc networks; hence we present in this paper a novel simulated model for underwater environment. Copyright © 2011 John Wiley & Sons, Ltd.     

WDM网络中基于物理损伤的组播节能保护算法

针对存在物理损伤约束的生存性组播网络中的能耗问题,提出了一种基于物理损伤的组播节能保护算法。该算法通过修改工作、保护链路的能耗代价,优化工作、保护路径选择,再进行物理损伤约束判断,在工作、保护路径满足物理损伤约束的条件下实现网络能耗最小化。仿真结果表明,该算法在满足物理损伤约束的条件下,可以降低网络能耗。     

卫星集群IP多播组呼业务协议研究

现有集群通信覆盖范围有限,为实现全方位集群通信,提出将卫星通信与集群通信相结合。以TETRA为例,分析了现有国内外集群通信系统集群业务的实现方式。针对电路域集群,提出实现分组域多媒体集群。为更利于工程实现,提出了基于MBMS技术的卫星集群IP多播组呼业务协议流程,并分析了实现中需要解决的关键问题及解决方案。该方案将为卫星移动通信集群业务的发展提供新的方向。     

一种星载IP交换机队列管理器的设计

针对星载IP交换机中硬件存储资源使用受限的情况,提出了一种适用于共享存储交换结构、存储资源占用少的队列管理器。通过添加索引的方法,使得所有的单播队列能够共享一个指针存储区。根据位图映射,将组播指针转化为多个单播指针,即可把组播操作的数据流按照单播操作方式写到相应的逻辑队列路径,达到节约存储器资源的目的。该队列管理器通过链表数据结构的头部和尾部来控制指针索引的写入和输出。最后,在Xilinx的xc6vlx130t FPGA进行了综合实现,结果显示,该方案相比基于指针复制的队列管理器,在8端口的交换机中存储器资源的使用量要节约22%以上。     

Multicast communications in cognitive radio networks using directional antennas

This paper presents a study on multicast communications in cognitive radio networks (CRNs)using directional antennas. The objective is to maximize the throughput of the CRN. The spectrum is divided into multiple channels and licensed to the primary network. While the CRN is accessing the spectrum, the interference power is carefully controlled to avoid impacting the operation of the primary network. The mathematical model is presented and subsequently formulated as a mixed integer non‐linear programming (MINLP) problem, which is non‐deterministic polynomial‐time hard. Therefore, a greedy algorithm is designed to approximate the optimal performance. The MINLP problem is then relaxed and an upper bound is developed. Simulation results are presented to compare the performance of the greedy algorithm and the upper bound, which demonstrates the efficacy of the greedy algorithm as well as the tightness of the upper bound. Copyright © 2012 John Wiley & Sons, Ltd.