检索结果-内蒙古大学图书馆

Multicast routing with delay and delay variation constraints for collaborative applications on overlay networks

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007年第3期18卷 421-431页

作者： Banik, Shankar M. Radhakrishnan, Sridhar Sekharan, Chandra N. Univ Oklahoma Sch Comp Sci Norman OK 73019 USA Loyola Univ Dept Comp Sci Chicago IL 60626 USA

Computer supported collaborative applications on overlay networks are gaining popularity among users who are geographically dispersed. Examples of these kinds of applications include video-conferencing, distributed database replication, and online games. This type of application requires a multicasting subnetwork, using which messages should arrive at the destinations within a specified delay bound. These applications also require that destinations receive the message from the source at approximately the same time. The problem of finding a multicasting subnetwork with delay and delay-variation bound has been proved to be an NP Complete problem in the literature and heuristics have been proposed for this problem. In this paper, we provide an efficient heuristic to obtain a multicast subnetwork on an overlay network, given a source and a set of destinations that is within a specified maximum delay and a specified maximum variation in the delays from a source to the destinations. The time-complexity of our algorithm is O(\E\+nk log(\E\/n) + m(2)k), where n and \E\ are the number of nodes and edges in the network, respectively, k is the number of shortest paths determined, and m is the number of destinations. We have shown that our algorithm is significantly better in terms of time-complexity than existing algorithms for the same problem. Our extensive empirical studies indicate that our heuristic uses significantly less runtime in comparison with the best-known heuristics while achieving the tightest delay variation for a given end-to-end delay bound.

关键词： multicasting protocols overlay networks shortest path

来源：评论

学校读者我要写书评

暂无评论

A scalability comparison of GST and SST MANET multicast routing algorithms

引用

COMPUTER COMMUNICATIONS 2007年第18期30卷 3851-3858页

作者： Kim, Sang-Chul Kookmin Univ Sch Comp Sci Seoul 136702 South Korea

Since network resource of mobile ad hoe network (MANET) is limited due to the contention-based wireless communication channel at the medium access layer and energy of mobile nodes is constrained due to the energy-limited batteries, the scalability issue is one of main research topics in developing MA NET routing algorithms. Therefore, this paper analyzes the message complexities of group shared tree (GST) and source-specific tree (SST) that are implemented in most MANET multicast routing algorithms. Simulation demonstrates that in a wireless ad hoc network where SST and GST are well maintained during the simulation, SST algorithm is able to achieve very competitive performance (i.e. less message complexity) under the multiple packet transmissions, in comparison with GST where no core selection algorithm is adopted. (C) 2007 Elsevier B.V. All rights reserved.

关键词： ad hoc network multicasting protocols complexity group shared tree source-specific tree

来源：评论

学校读者我要写书评

暂无评论

Supporting multicasting in mobile ad-hoc wireless networks: issues, challenges, and current protocols

引用

WIRELESS COMMUNICATIONS & MOBILE COMPUTING 2002年第2期2卷 115-130页

作者： Papavassiliou, S An, BK New Jersey Inst Technol Dept Elect & Comp Engn New Jersey Ctr Multimedia Res Newark NJ 07102 USA New Jersey Ctr Wireless Telecommun Newark NJ 07102 USA

The basic philosophy of personal communication services is to provide user-to-user. location independent communication services. The emerging group communication wireless applications. such as multipoint data dissemination and Multiparty conferencing tools have made the design and development of efficient multicast techniques in mobile ad-hoc networking environments a necessity and not just a desire. Multicast protocols in mobile ad-hoc networks have been an area of active research for the past couple of years. This paper summarizes the activities and recent advances in this work-in-progress area by identifying the main issues and challenges that multicast protocols are facing in mobile ad-hoc networking environments, and by surveying several existing multicasting protocols. This article presents a classification of the current multicast protocols, discusses the functionality of the individual existing protocols, and provides a qualitative comparison of their characteristics according to several distinct features and performance parameters. Furthermore, since many of the additional issues and constraints associated with the mobile ad-hoc networks are due, to a large extent, to the attribute of user mobility. we also present an overview of research and development efforts in the area of group mobility modeling in mobile ad-hoc networks. Copyright (C) 2001 John Wiley Sons, Ltd.

关键词： multicasting protocols mobile ad-hoc networks wireless networks mobility

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：