Sciweavers

40 search results - page 7 / 8
» Store-and-Forward Multicast Routing on the Mesh
Sort
View
SAC
2005
ACM
13 years 11 months ago
Dynamic group communication in mobile peer-to-peer environments
This paper presents an approach to integrate publish/subscribe semantics with on-demand multicast in wireless ad hoc networks, providing dynamic group communication with fine-gra...
Eiko Yoneki, Jean Bacon
LCN
2007
IEEE
14 years 1 days ago
Achieving True Video-on-Demand Service in Multi-Hop WiMax Mesh Networks
Abstract—In this work, we discuss how to support Video-onDemand service in multi-hop WiMax mesh networks. We are interested in the scenario that end users connect to the video se...
Fei Xie, Kien A. Hua, Ning Jiang
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
13 years 11 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia
GLOBECOM
2008
IEEE
13 years 6 months ago
Many-to-Many Traffic Grooming in WDM Mesh Networks
In many-to-many communication, a session consists of group of users (we call them members) where each one of the members transmits its traffic to all other members in the group. Th...
Mohammad A. Saleh, Ahmed E. Kamal
NGC
2000
Springer
13 years 9 months ago
The use of hop-limits to provide survivable ATM group communications
We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that ...
William Yurcik, David Tipper, Deep Medhi