Sciweavers

41 search results - page 7 / 9
» Always acyclic distributed path computation
Sort
View
CCGRID
2005
IEEE
14 years 3 months ago
A dynamically adaptive hybrid algorithm for scheduling lightpaths in lambda-grids
This paper focuses on the scheduling of multiple-wavelength lightpaths and outlines an algorithm to provide increased simultaneous allocations of lightpaths on the Lambda-Grid. Se...
Neena R. Kaushik, Silvia M. Figueira
CONEXT
2007
ACM
14 years 1 months ago
NetDiagnoser: troubleshooting network unreachabilities using end-to-end probes and routing data
The distributed nature of the Internet makes it difficult for a single service provider to troubleshoot the disruptions experienced by its customers. We propose NetDiagnoser, a tr...
Amogh Dhamdhere, Renata Teixeira, Constantine Dovr...
PODC
2005
ACM
14 years 3 months ago
Adaptive routing with stale information
We investigate the behaviour of load-adaptive rerouting policies in the Wardrop model where decisions must be made on the basis of stale information. In this model, an infinite n...
Simon Fischer, Berthold Vöcking
ICPP
1998
IEEE
14 years 2 months ago
Routing Algorithms for Anycast Messages
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
Dong Xuan, Weijia Jia, Wei Zhao
SIGECOM
2006
ACM
119views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
Nash equilibria in graphical games on trees revisited
Graphical games have been proposed as a game-theoretic model of large-scale distributed networks of non-cooperative agents. When the number of players is large, and the underlying...
Edith Elkind, Leslie Ann Goldberg, Paul W. Goldber...