Graph Edge Colouring Problems Arising from Optical Network Design

Add to your list(s) Download to your calendar using vCal

• Gordon Wilfong: Mathematical and Algorithmic Sciences Center - Bell Labs
• Thursday 11 October 2007, 16:30-17:30
• Lecture Theatre 2, Computer Laboratory, William Gates Builiding.

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 multi-graphs. The first problem is concerned with optimal design of cross-connects 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 time-division 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:

• All Talks (aka the CURE list)
• CL's SRG seminar
• Cambridge Centre for Data-Driven Discovery (C2D3)
• Cambridge talks
• Chris Davis' list
• Computer Laboratory Systems Research Group Seminar
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• Lecture Theatre 2, Computer Laboratory, William Gates Builiding
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31
• ndk22's list
• ob366-ai4er
• rp587

Note that ex-directory lists are not shown.