552 search results - page 13 / 111 » Routing complexity of faulty networks |
NSDI
2008
14 years 11 months ago
2008
The paper presents and evaluates Nysiad,1 a system that implements a new technique for transforming a scalable distributed system or network protocol tolerant only of crash failur...
BROADNETS
2007
IEEE
15 years 1 months ago
2007
IEEE
Abstract-- We present and evaluate a reinforcement learningbased RWA algorithm for all-optical networks subject to physical impairments. The technique is suitable for decentralized...
AAIM
2005
Springer
15 years 3 months ago
2005
Springer
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
FLAIRS
2007
14 years 11 months ago
2007
Temporal Networks play an important role in solving planning problems and they are also used, though not as frequently, when solving scheduling problems. In this paper we propose ...
SIGCOMM
2006
ACM
15 years 3 months ago
2006
ACM
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...