189 search results - page 31 / 38 » Shortest Paths Without a Map |
BROADNETS
2007
IEEE
14 years 2 months ago
2007
IEEE
— Network dimensioning for wavelength-routed WDM networks has been extensively studied to maximize connection acceptance rate while minimizing the total cost. However, Internet s...
SENSYS
2006
ACM
14 years 1 months ago
2006
ACM
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Mor...
VLDB
2004
ACM
14 years 1 months ago
2004
ACM
A frequent type of query in spatial networks (e.g., road networks) is to find the K nearest neighbors (KNN) of a given query object. With these networks, the distances between ob...
PODC
1997
ACM
13 years 12 months ago
1997
ACM
This paper proposes algorithms for allocation of wavelengths to connections (lightpaths) in optical wavelength division multiplexed networks, predominantly for ring topologies. Th...
GLOBECOM
2007
IEEE
13 years 11 months ago
2007
IEEE
Open Shortest Path First (OSPF) is one of the most widely used intra-domain routing protocol. It is well known that OSPF protocol does not provide flexibility in terms of packet fo...