A channel assignment problem for optical networks modelled by Cayley graphs

Theoretical Computer Science

Volumn 310, Issue 1-3, 2004, Pages 501-511

  Zhou, Sanming ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Cayley graph; Channel assignment; Hypercube; Optical network

Indexed keywords

CHANNEL CAPACITY; FIBER OPTIC NETWORKS; GRAPH THEORY; MATRIX ALGEBRA; SET THEORY;

CAYLEY GRAPHS; CHANNEL ASSIGNMENT;

COMPUTER SCIENCE;

EID: 0242692578     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(03)00394-3     Document Type: Article

References (19)

1. K.A. Aly, Reconfigurable WDM interconnection of large-scale multiprocessor systems, Ph.D. Thesis, Department of Electrical and Computer Engineering, SUNY, Buffalo, 1993.
2. K.A. Aly, P.W. Dowd, A class of scalable optical interconnection networks through discrete broadcast-selected multi-domain WDM, in: Proc. IEEE INFOCOM'94, Torando, Canada, 1994.
3. Biggs N.L. Algebraic Graph Theory. 2nd Edition:1993;Cambridge University Press, Cambridge.
4. Griggs J.R., Yeh R.K. Labelling graphs with a condition at distance two. SIAM J. Discrete Math. 5:1992;586-595.
5. F. Harary, M. Plantholt, Graphs whose radio coloring number equals the number of nodes, in: P. Hansen, O. Marcotte (Eds.), Graph Colouring and Applications (Montreal, QC, 1997), CRM Proc., Lecture Notes, Vol. 23, American Mathematical Society, Providence, RI, 1999, pp. 99-100.
6. F. Harary, M. Plantholt, Graphs whose radio coloring number equals the number of nodes, in: P. Hansen, O. Marcotte (Eds.), Graph Colouring and Applications (Montreal, QC, 1997), CRM Proc., Lecture Notes, Vol. 23, American Mathematical Society, Providence, RI, 1999, pp. 99-100.
7. M.C. Heydemann, Cayley graphs and interconnection networks, in: G. Hahn, G. Sabidussi (Eds.), Graph Symmetry (Montreal, PQ, 1996), NATO Advanced Science Institutes Series C, Mathematica and Physical Sciences, Vol. 497, Kluwer Academic Publishers, Dordrecht, 1997, pp. 167-224.
8. M.C. Heydemann, Cayley graphs and interconnection networks, in: G. Hahn, G. Sabidussi (Eds.), Graph Symmetry (Montreal, PQ, 1996), NATO Advanced Science Institutes Series C, Mathematica and Physical Sciences, Vol. 497, Kluwer Academic Publishers, Dordrecht, 1997, pp. 167-224.
9. W. Imrich, Graphs with transitive abelian automorphism group, in: P. Erdos, A.R. Rényi, V. Sós (Eds.), Combinatorica Theory and its Applications, Vol. 4, Colloquia Mathematica Societatis János Bolyai, North-Holland, Amsterdam, 1970, pp. 651-656.
10. Imrich W., Klavžar S. Product Graphs. 2000;Wiley, New York.
11. Imrich W., Watkins M.E. On automorphism groups of Cayley graphs. Period. Math. Hungar. 7:1976;243-258.
12. Kim D.S., Du D.-Z., Pardalos P.M. A coloring problem on the. n -cube Discrete Appl. Math. 103:2000;307-311.
13. Lakshmivarahan S., Jwo J.S., Dhall S.K. Symmetry in interconnection networks based on Cayley graphs of permutation groups. a survey Parallel Comput. 19:1993;361-407.
14. Ramaswami R., Sivarajan K. Optical Networks. 1998;Morgan Kauffman Publishers, Los Altos, CA.
15. Rose J.S. A Course on Group Theory. 1978;Cambridge University Press, Cambridge.
16. Wan P.-J. Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network. J. Combin. Optim. 1:1997;179-186.
17. Wan P.-J. Conflict-free channel set assignment for an optical cluster interconnection network based on rotator digraphs. Theoret. Comput. Sci. 207:1998;193-201.
18. Zhou S. Locally restricted colorings of graphs. J. Combin. Math. Combin. Comput. 43:2002;147-157.
19. S. Zhou, Labelling Cayley graphs on abelian groups, submitted.