425 search results - page 29 / 85 » A Fully Dynamic Algorithm for Distributed Shortest Paths |
IPPS
2000
IEEE
14 years 1 months ago
2000
IEEE
Dynamic, distributed, real-time systems control an environment that varies widely without any time-invariant statistical or deterministic characteristic, are spread across multiple...
TWC
2008
13 years 8 months ago
2008
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
PODC
2009
ACM
14 years 9 months ago
2009
ACM
d Abstract] Prosenjit Bose School of Computer Science Carleton University Ottawa, Canada jit@scs.carleton.ca Paz Carmi Dept. of Computer Science Ben-Gurion Univ. of the Negev Beer-...
ICDCS
1998
IEEE
14 years 1 months ago
1998
IEEE
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
SIGMETRICS
2005
ACM
14 years 2 months ago
2005
ACM
The ability to discover the AS-level path between two end-points is valuable for network diagnosis, performance optimization, and reliability enhancement. Virtually all existing t...