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.     

A call admission and rate control scheme for multimedia support over IEEE 802.11 wireless LANs

Quality of service (QoS) support for multimedia services in the IEEE 802.11 wireless LAN is an important issue for such WLANs to become a viable wireless access to the Internet. In this paper, we endeavor to propose a practical scheme to achieve this goal without changing the channel access mechanism. To this end, a novel call admission and rate control (CARC) scheme is proposed. The key idea of this scheme is to regulate the arriving traffic of the WLAN such that the network can work at an optimal point. We first show that the channel busyness ratio is a good indicator of the network status in the sense that it is easy to obtain and can accurately and timely represent channel utilization. Then we propose two algorithms based on the channel busyness ratio. The call admission control algorithm is used to regulate the admission of real-time or streaming traffic and the rate control algorithm to control the transmission rate of best effort traffic. As a result, the real-time or streaming traffic is supported with statistical QoS guarantees and the best effort traffic can fully utilize the residual channel capacity left by the real-time and streaming traffic. In addition, the rate control algorithm itself provides a solution that could be used above the media access mechanism to approach the maximal theoretical channel utilization. A comprehensive simulation study in ns-2 has verified the performance of our proposed CARC scheme, showing that the original 802.11 DCF protocol can statically support strict QoS requirements, such as those required by voice over IP or streaming video, and at the same time, achieve a high channel utilization. Hongqiang Zhai received the B.E. and M.E. degrees in electrical engineering from Tsinghua University, Beijing, China, in July 1999 and January 2002 respectively. He worked as a research intern in Bell Labs Research China from June 2001 to December 2001, and in Microsoft Research Asia from January 2002 to July 2002. Currently he is pursuing the PhD degree in the Department of Electrical and Computer Engineering, University of Florida. He is a student member of IEEE. Xiang Chen received the B.E. and M.E. degrees in electrical engineering from Shanghai Jiao Tong University, Shanghai, China, in 1997 and 2000, respectively, and the Ph.D. degree in electrical and computer engineering from the University of Florida, Gainesville, in 2005. He is currently a Senior Research Engineer at Motorola Labs, Arlington Heights, IL. His research interests include resource management, medium access control, and quality of service (QoS) in wireless networks. He is a Member of Tau Beta Pi and a student member of IEEE. Yuguang Fang received a Ph.D degree in Systems and Control Engineering from Case Western Reserve University in January 1994, and a Ph.D degree in Electrical Engineering from Boston University in May 1997. From June 1997 to July 1998, he was a Visiting Assistant Professor in Department of Electrical Engineering at the University of Texas at Dallas. From July 1998 to May 2000, he was an Assistant Professor in the Department of Electrical and Computer Engineering at New Jersey Institute of Technology. In May 2000, he joined the Department of Electrical and Computer Engineering at University of Florida where he got the early promotion with tenure in August 2003 and has been an Associate Professor since then. He has published over one hundred (100) papers in refereed professional journals and conferences. He received the National Science Foundation Faculty Early Career Award in 2001 and the Office of Naval Research Young Investigator Award in 2002. He is currently serving as an Editor for many journals including IEEE Transactions on Communications, IEEE Transactions on Wireless Communications, IEEE Transactions on Mobile Computing, and ACM Wireless Networks. He is also actively participating in conference organization such as the Program Vice-Chair for IEEE INFOCOM’2005, Program Co-Chair for the Global Internet and Next Generation Networks Symposium in IEEE Globecom’2004 and the Program Vice Chair for 2000 IEEE Wireless Communications and Networking Conference (WCNC’2000).     

广东省智能网工程建设

本文介绍了广东省智能网的组网方案及所能提供的业务,并论述了智能网工程建设,安装维护以及与广东省现有移动通信网联网中存在的一些问题。     

Internet网的服务方式与入网方式一览

目前，世界上最大的计算机网络Ｉｎｔｅｒｎｅｔ网，已成为通达１５０多个国家的国际互联网络。作为引导中国计算机用户进入Ｉｎｔｅｒｎｅｔ的中国公用计算机互联网ＣＨＩＮＡＮＥＴ也正迅速发展。本文就Ｉｎｔｅｒｎｅｔ网的服务方式和入网方式进行了综述。     

一种新的WDM光网中的共享链路保护策略

研究了WDM光网中的链路保护问题.提出了一种新的共享链路保护策略--基于SRLG的共享链路保护策略(SRLG-SLP).SRLG(共享风险链路组)定义了对一条工作光通道分配保护资源时的资源可用性的约束.它规定任意两条有着同样故障风险或者说处于同一个SRLG的工作光通道不能利用同样的保护资源.另外,还提出了一种更加符合实际的单链路故障模型,其中链路故障间隔时间和链路故障保持时间被考虑作为两个独立的变量.基于该链路故障模型,通过大量的仿真试验,比较了专用链路保护(DLP)、共享链路保护(SLP)和提出的SRLG-SLP保护策略的资源利用率、保护效率以及业务中断率.结果显示,我们提出的SRLG-SLP在保护效率和业务中断率方面的保护性能远好于DLP和SLP,但会牺牲一些资源利用率.     

Solving the trade-off between fairness and throughput: Token bucket and leaky bucket-based weighted fair queueing schedulers

In this article, we present two efficient weighted fair queueing (WFQ) scheduling algorithms leaned on the well-known token bucket and leaky bucket shaping/policing algorithms. The performance of the presented algorithms is compared to those of the state-of-the-art WFQ approximations such as weighted round robin (WRR) and the recently proposed bin sort fair queueing (BSFQ). Our simulation results show that the proposed algorithms provide a better fairness at a lower implementation complexity while simultaneously achieving a comparable network utilization.     

The Region 1 & 3 Broadcasting‐Satellite Service Plan after WRC‐03

The 1977 Broadcasting‐Satellite Service (BSS) Plan for Region 1 & 3 had been widely acknowledged to be out‐of‐date by the late 1980s. Development of digital modulation in the early 1990s provided an opportunity to update the technical provisions of the Plan to make it more economically viable. After a decade of work and three World Radiocommunication Conferences (WRCs), the revision of Region 1 & 3 BSS Plan was finally completed in 2003. The new Plan increased channel assignments from 5 to 10 analog‐equivalent channels for each country in Region 1, and from 4 to 12 channels for each country in Region 3. Yet, despite the increase in capacity, the new Plan is surprisingly similar to the original one in terms of the technical parameters. It is still based on national coverage, and the channel plan, orbital location, orbital spacing, and polarization are also the same. As a result, the new Plan is no more economically viable to implement than the old. To create economically viable BSS systems would most likely require modifications to the assignment in the Plan. Yet, modification procedures were made more difficult to apply after replanning. Less future implementation of BSS networks than would otherwise have occurred can be expected, and an inefficient usage of these frequency bands will likely result. On the other hand, less implemented systems will mean more capacity set aside for future use. This is important for countries that currently do not have satellite operations. In the end, BSS replanning reflects the eternal conflict between efficient usage and guaranteed future access. Copyright © 2005 John Wiley & Sons, Ltd.     

SMS——智能网的业务管理系统

本文叙述了智能网的业务管理系统所实现的３种功能：业务管理功能，网络管理功能和业务管理访问功能，还介绍了业务管理和网络管理之间的关系，ＳＭＳ的集中式和分布式两种体系结构及业务管理功能的设计方法和进一步研究方向。     

网格技术综述

网格技术被认为是互联网技术发展的下一次浪潮，目前对网格的研究已经成为信息领域的热点。本文首先介绍了网格的产生背景，接着阐述了网格的概念和目的，然后分析了网格的系统构成，最后展望了网格技术的应用前景。