IEEE Communications Letters · 2005 · 16 citations · 3 references
ComputingComputer SystemsAlgorithmsPath PlanningSchedulingDynamic SchedulingRoutingRouting AlgorithmsRouting ProtocolsShortest Path AlgorithmsPath ComputationRouting OptimizationRouting ProblemsTimingTraffic Timing
We consider dynamic routing of holding-time aware demands under a sliding scheduled traffic model to satisfy demands' bandwidth and timing requirements. We propose an all hops optimal routing algorithm that iteratively finds all feasible paths of at most h hops at the end of h-th iteration. We prove the correctness and analyze the time complexity of the algorithm.
3
Efficient channel scheduling algorithms in optical burst switched networks
Jinhui Xu, Chunming Qiao, J. Li et al. · 2004 · 157 citations