Conflict-Free channel set assignment for an optical cluster interconnection network based on rotator digraphs

DOI10.1016/S0304-3975(98)00064-4zbMath0916.68006MaRDI QIDQ1274997

Peng-Jun Wan

Publication date: 12 January 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

vertex coloringoptical networkrotator digraphTWDM

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Related Items

A channel assignment problem for optical networks modelled by Cayley graphs

Cites Work

• TWDM multichannel lightwave hypercube networks
• Near-optimal conflict-free channel set assignments for an optical cluster-based hypercube network