Sciweavers

155 search results - page 18 / 31
» A New Necessary Condition for Shortest Path Routing
Sort
View
ICDE
2005
IEEE
136views Database» more  ICDE 2005»
14 years 9 months ago
Bloom Filter-based XML Packets Filtering for Millions of Path Queries
The filtering of XML data is the basis of many complex applications. Lots of algorithms have been proposed to solve this problem[2, 3, 5, 6, 7, 8, 9, 11, 12, 13, 18]. One importan...
Xueqing Gong, Ying Yan, Weining Qian, Aoying Zhou
ICDCS
2010
IEEE
14 years 9 days ago
CONTRACT: Incorporating Coordination into the IP Network Control Plane
—This paper presents the CONTRACT framework to address a fundamental deficiency of the IP network control plane, namely the lack of coordination between an IGP and other control...
Zheng Cai, Florin Dinu, Jie Zheng, Alan L. Cox, T....
INFOCOM
2005
IEEE
14 years 2 months ago
A distributed adaptive cache update algorithm for the dynamic source routing protocol
On-demand routing protocols use route caches to make routing decisions. Due to frequent topology changes, cached routes easily become stale. To address the cache staleness issue i...
Xin Yu, Zvi M. Kedem
ICNP
2007
IEEE
14 years 2 months ago
Routing amid Colluding Attackers
Abstract— We propose the first practical solution to the longstanding problem of secure wireless routing in the presence of colluding attackers. Our secure routing protocol, Spr...
Jakob Eriksson, Michalis Faloutsos, Srikanth V. Kr...
TWC
2008
135views more  TWC 2008»
13 years 8 months ago
Optimal Distributed Stochastic Routing Algorithms for Wireless Multihop Networks
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
Alejandro Ribeiro, Nikolas D. Sidiropoulos, Georgi...