Finding Time and Buffer Preserving Routes in Gaussian Intermittent Networks

Intermittent networks (IntNET) are networks where all the links in a path may not be available concurrently. Finding routes on such a network is hard. No trivial extension of classical routing protocols is known to provide a correct solution. In this paper, we present a constraint resource planning (CRP) based advanced route computation and scheduling algorithm for IntNET. The algorithm computes routes achieving near minimum delay and also achieve the bound on minimum intermediate buffer requirements. It was difficult previously to deploy such advanced routing. However, this design is suitable for the new IETF traffic engineering extensions that now enable such advanced externally computed route to be injected into a MPLS infrastructure.