6533b838fe1ef96bd12a4eac

RESEARCH PRODUCT

Optical Routing of Uniform Instances in Cayley Graphs

Olivier Togni

subject

CombinatoricsDiscrete mathematicsVertex-transitive graphCayley graphChordal graphApplied MathematicsDiscrete Mathematics and CombinatoricsOptical routingAssignment problemGraphMathematicsofComputing_DISCRETEMATHEMATICSMathematics

description

Abstract Abstract We consider the problem of routing uniform communication instances in Cayley graphs. Such instances consist of all pairs of nodes whose distance is included in a specified set U. We give bounds on the load induced by these instances on the links and for the wavelength assignment problem as well. For some classes of Cayley graphs that have special symmetry property (rotational graphs), we are able to construct routings for uniform instances such that the load is the same for each link of the graph.

yearjournalcountryeditionlanguage
2001-11-01Electronic Notes in Discrete Mathematics
https://doi.org/10.1016/s1571-0653(04)00411-1