632 search results - page 74 / 127 » On Routing in Circulant Graphs |
BROADNETS
2004
IEEE
15 years 1 months ago
2004
IEEE
Failure resilience is one of the desired features of the Internet. Most of the traditional restoration architectures are based on single-failure assumption which is unrealistic. M...
100
click to vote
INFOCOM
2000
IEEE
15 years 1 months ago
2000
IEEE
An efficient and general graph-theoretic model (the Wavelength-Graph (WG)) has been proposed which enables solving the static Routing and Wavelength Assignment (RWA) problems in Mu...
ATMOS
2010
14 years 8 months ago
2010
In this paper we address a real world optimisation problem, the Rail Track Inspection Scheduling Problem (RTISP). This problem consists of scheduling network inspection tasks. The...
IEAAIE
2009
Springer
14 years 7 months ago
2009
Springer
In conflict-free routing a set of agents have to traverse a common infrastructure without interfering with each other. Maza and Castagna [1] showed how route plans can be repaired ...
COMCOM
2006
14 years 10 months ago
2006
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...