Graph Edge Colouring Problems Arising from Optical Network Design
Add to your list(s)
Download to your calendar using vCal
If you have a question about this talk, please contact Eiko Yoneki.
We consider two problems in optical network design that
give rise to interesting edge colouring problems in multigraphs. The first problem is concerned with optimal design of crossconnects in wavelength division multiplexed (WDM) networks. This gives rise to “dynamic” edge colouring problems where edges appear and disappear under the control of an adversary.
The second problem comes from a particular WDM network design in which each wavelength is also timedivision multiplexed. This gives rise to a range of edge colouring problems where edges have “delays” that result in edges having a different colour at each endpoint and where parallel edges (in a multigraph) have to be assigned contiguous colours.
All optical networking issues will be defined in the talk so no expertise in optical networking is assumed.
This talk is part of the Computer Laboratory Systems Research Group Seminar series.
This talk is included in these lists:
Note that exdirectory lists are not shown.
