Scheduling light-trails on WDM rings

DOI10.1016/j.jpdc.2012.05.010zbMath1248.68122arXiv1112.6254OpenAlexW2118781912MaRDI QIDQ455990

Soumitra Pal, Abhiram G. Ranade

Publication date: 23 October 2012

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.6254

zbMATH Keywords

schedulingsimulationapproximationon-line algorithmroutingwavelength division multiplexinglight-trailreconfigurable bus architecturewavelength assignmentWDM

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Network design and communication in computer systems (68M10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Distributed systems (68M14) Online algorithms; streaming algorithms (68W27)

Related Items (1)

Fragmented coloring of proper interval and split graphs

Cites Work

• An optimal greedy heuristic to color interval graphs
• Online algorithms: a survey
• Efficient deterministic and probabilistic simulations of PRAMs on linear arrays with reconfigurable pipelined bus systems
• An efficient \(O(1)\) time 3D all nearest neighbor algorithm from image processing perspective
• Unnamed Item
• Unnamed Item

This page was built for publication: Scheduling light-trails on WDM rings