On Source-Based Route Computation for Quickest Paths under Dynamic Bandwidth Constraints

Abstract

Routing in the newer generation of network transmission methods may be performed at various levels of the IP stack such as datagram, TCP stream, and application levels. It is important in the use of these methods to compute the routes that minimize the end-to-end delays for the specific routing mechanism. We formulate an abstract network path computation problem, the dynamic quickest path problem, to encompass a number of message forwarding mechanisms including circuit switching, Internet Protocol, and their variations. This problem deals with the transmission of a message from a source to a destination with the minimum end-to-end delay over a network with propagation delays and dynamic bandwidth constraints on the links. The available bandwidth for each link is specified as a piecewise constant function. We present for each message forwarding mechanism or mode an algorithm to compute a path with the minimum end-to-end delay for a given message size. Our algorithms with suitable network restrictions have polynomial time complexity in the size of the network and total number of segments in the bandwidth list.