Sciweavers

5 search results - page 1 / 1
» Maintenance of Multi-level Overlay Graphs for Timetable Quer...
Sort
View
ATMOS
2007
13 years 5 months ago
Maintenance of Multi-level Overlay Graphs for Timetable Queries
In railways systems the timetable is typically represented as a weighted digraph on which itinerary queries are answered by shortest path algorithms, usually running Dijkstra’s a...
Francesco Bruera, Serafino Cicerone, Gianlorenzo D...
MICS
2008
72views more  MICS 2008»
13 years 3 months ago
Dynamic Multi-level Overlay Graphs for Shortest Paths
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
Francesco Bruera, Serafino Cicerone, Gianlorenzo D...
CCR
2004
89views more  CCR 2004»
13 years 3 months ago
Should we build Gnutella on a structured overlay?
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on ...
Miguel Castro, Manuel Costa, Antony I. T. Rowstron
ICDCS
2009
IEEE
14 years 23 days ago
Q-Tree: A Multi-Attribute Based Range Query Solution for Tele-immersive Framework
Users and administrators of large distributed systems are frequently in need of monitoring and management of its various components, data items and resources. Though there exist s...
Md. Ahsan Arefin, Md. Yusuf Sarwar Uddin, Indranil...
PC
2007
118views Management» more  PC 2007»
13 years 3 months ago
Peer-to-peer systems for discovering resources in a dynamic grid
The convergence of the Grid and Peer-to-Peer (P2P) worlds has led to many solutions that try to efficiently solve the problem of resource discovery on Grids. Some of these solutio...
Moreno Marzolla, Matteo Mordacchini, Salvatore Orl...