17 search results - page 2 / 4 » On the Evaluation of Shortest Journeys in Dynamic Networks |
JSAC
2010
13 years 3 months ago
2010
—Due to the geographic distribution of its subscribers, Ethernet Passive Optical Networks (EPONs) have typically varying propagation delays between the Optical Network Units (ONU...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Efficiently computing fast paths in large-scale dynamic road networks (where dynamic traffic information is known over a part of the network) is a practical problem faced by sever...
GIS
2007
ACM
14 years 6 months ago
2007
ACM
In this paper, we present an original network graph embedding to speed-up distance-range and k-nearest neighbor queries in (weighted) graphs. Our approach implements the paradigm ...
AINA
2005
IEEE
13 years 10 months ago
2005
IEEE
A core-based group-shared multicast tree is a shortest path tree rooted at core node that distributes packets to and from all group members. Traditionally, the bandwidth cost cons...
ICDE
2011
IEEE
12 years 8 months ago
2011
IEEE
—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...