Sciweavers

4037 search results - page 89 / 808
» Routing without ordering
Sort
View
CORR
2010
Springer
136views Education» more  CORR 2010»
13 years 7 months ago
Delay-Constrained Multicast Routing Algorithm Based on Average Distance Heuristic
Multicast is the ability of a communication network to accept a single message from an application and to deliver copies of the message to multiple recipients at different locatio...
Ling Zhou, Wei-xiong Ding, Yu-xi Zhu
ICDE
2011
IEEE
272views Database» more  ICDE 2011»
13 years 23 days ago
A continuous query system for dynamic route planning
—In this paper, we address the problem of answering continuous route planning queries over a road network, in the presence of updates to the delay (cost) estimates of links. A si...
Nirmesh Malviya, Samuel Madden, Arnab Bhattacharya
MOBIHOC
2002
ACM
14 years 8 months ago
Path set selection in mobile ad hoc networks
Topological changes in mobile ad hoc networks frequently render routing paths unusable. Such recurrent path failures have detrimental effects on the network ability to support QoS...
Emin Gün Sirer, Panagiotis Papadimitratos, Zy...
SIGMOD
2004
ACM
114views Database» more  SIGMOD 2004»
14 years 9 months ago
An initial study of overheads of eddies
An eddy [2] is a highly adaptive query processing operator that continuously reoptimizes a query in response to changing runtime conditions. It does this by treating query process...
Amol Deshpande
AINA
2008
IEEE
14 years 3 months ago
Ternary CAM Compaction for IP Address Lookup
Motivated by the high cost problem of ternary CAM, we proposed a new technique for providing a compaction routing table. With the comparisons with existing algorithms, our new tec...
Yi-Ting Fang, Tzung-Chian Huang, Pi-Chung Wang