390 search results - page 46 / 78 » Computing shortest paths for any number of hops |
126
click to vote
INFOCOM
2000
IEEE
15 years 5 months ago
2000
IEEE
This paper presents a new algorithm for dynamic routing of bandwidth guaranteed tunnels where tunnel routing requests arrive one-by-one and there is no a priori knowledge regarding...
128
click to vote
LCN
2003
IEEE
15 years 7 months ago
2003
IEEE
Sensor networks are meant for sensing and disseminating information about the environment they sense. The criticality of a sensed phenomenon determines it’s importance to the en...
104
click to vote
P2P
2006
IEEE
15 years 8 months ago
2006
IEEE
Peer-to-peer systems (p2p) are highly dynamic in nature. They may consist of millions of peers joining only for a limited period of time, resulting in hundreds of join and leave e...
141
click to vote
COMGEO
1999
ACM
15 years 1 months ago
1999
ACM
Let S be a set of n points in IRd and let t > 1 be a real number. A t-spanner for S is a directed graph having the points of S as its vertices, such that for any pair p and q o...
128
click to vote
OPODIS
2010
14 years 12 months ago
2010
Abstract. Small-world networks are currently present in many distributed applications and can be built augmenting a base network with long-range links using a probability distribut...