Sciweavers

1574 search results - page 162 / 315
» Efficient QoS Routing
Sort
View
INFOCOM
2005
IEEE
16 years 2 days ago
IPStash: a set-associative memory approach for efficient IP-lookup
—IP-Lookup is a challenging problem because of the increasing routing table sizes, increased traffic, and higher speed links. These characteristics lead to the prevalence of hard...
Stefanos Kaxiras, Georgios Keramidas
COMCOM
2008
127views more  COMCOM 2008»
15 years 6 months ago
A dynamic routing protocol for keyword search in unstructured peer-to-peer networks
The idea of building query-oriented routing indices has changed the way of improving keyword search efficiency from the basis as it can learn the content distribution from the que...
Cong Shi, Dingyi Han, Yuanjie Liu, Shicong Meng, Y...
W2GIS
2005
Springer
15 years 12 months ago
Refined Route Instructions Using Topological Stages of Closeness
In pedestrian navigation, navigators are free to choose any passable way. Because of this characteristic, accurate route instructions are important when navigating from waypoint to...
Markus Wuersch, David Caduff
CONEXT
2008
ACM
15 years 8 months ago
Social DTN routing
Delay-tolerant network architectures exploit mobile devices carried by users to enable new networked applications. Efficiently routing information through these DTNs faces new cha...
Greg Bigwood, Tristan Henderson
ICPPW
2003
IEEE
15 years 11 months ago
A Fault-tolerant Routing Strategy for Gaussian Cube Using Gaussian Tree
Gaussian Cubes (GCs) are a family of interconnection topologies in which the interconnection density and algorithmic efficiency are linked by a common parameter, the variation of ...
Loh Peter, Xinhua Zhang