BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Graph Edge Colouring Problems Arising from Optical Network Design 
 - Gordon Wilfong: Mathematical and Algorithmic Sciences Center - Bell Labs
DTSTART:20071011T153000Z
DTEND:20071011T163000Z
UID:TALK8483@talks.cam.ac.uk
CONTACT:Eiko Yoneki
DESCRIPTION:We consider two problems in optical network design that\ngive 
 rise to interesting edge colouring problems in multi-graphs. The first pro
 blem is concerned with optimal design of cross-connects in wavelength divi
 sion multiplexed (WDM) networks.  This gives rise to "dynamic" edge colour
 ing problems where edges appear and disappear under the control of an adve
 rsary.\nThe second problem comes from a particular WDM network design in w
 hich each wavelength is also time-division multiplexed.  This gives rise t
 o a range of edge colouring problems where edges have "delays" that result
  in edges having a different colour at each endpoint and where parallel ed
 ges (in a multigraph) have to be assigned contiguous colours.\n\nAll optic
 al networking issues will be defined in the talk so no expertise in optica
 l networking is assumed.\n
LOCATION:Lecture Theatre 2\, Computer Laboratory\, William Gates Builiding
END:VEVENT
END:VCALENDAR