An all hops optimal algorithm for dynamic routing of sliding scheduled traffic demands

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.