Sciweavers

625 search results - page 7 / 125
» Semi-preemptive routing on trees
Sort
View
ICNP
2002
IEEE
15 years 5 months ago
Dynamic Routing of Bandwidth Guaranteed Multicasts with Failure Backup
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed multicast tunnels with failure backup. The multicast routing problem arises in many contexts such a...
Murali S. Kodialam, T. V. Lakshman
85
Voted
CIKM
2005
Springer
15 years 6 months ago
Localized routing trees for query processing in sensor networks
In this paper, we propose a novel energy-efficient approach, a localized routing tree (LRT) coupled with a route redirection (RR) strategy, to support various types of queries. LR...
Jie Lian, Lei Chen 0002, Kshirasagar Naik, M. Tame...
110
Voted
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
15 years 6 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
97
Voted
JCM
2006
95views more  JCM 2006»
15 years 11 days ago
A Learning-based Adaptive Routing Tree for Wireless Sensor Networks
One of the most common communication patterns in sensor networks is routing data to a base station, while the base station can be either static or mobile. Even in static cases, a s...
Ying Zhang, Qingfeng Huang
84
Voted
INFOCOM
1997
IEEE
15 years 4 months ago
The Ordered Core Based Tree Protocol
This paper presents a new protocol, the Ordered Core Based Tree (OCBT) protocol, which remedies several shortcomings of the Core Based Tree (CBT) multicast protocol. We show that ...
Clay Shields, J. J. Garcia-Luna-Aceves