Scheduling schemes for delay graphs with applications to optical packet networks

We revisit the problem of scheduling optical packet switched networks such as packet switches, WDM rings, and general mesh structures, when propagation delays are not negligible. We use a general model based on delay graphs, and show that several optical packet switched networks can be modeled using this abstraction. We devise mechanisms that take into account propagation delays and can achieve 100% throughput for admissible traffic patterns, when traffic demands are known. We then present necessary and sufficient conditions for providing 100% throughput in such graphs.