Dynamic Adaptive Windows for High Speed Data Networks with Multiple Paths and Propagation Delays

Recently the optimal design of windows for virtual circuits has been studied for high speed, wide area data networks in an asymptotic framework in which the delay bandwidth product is the large parameter. Based on the results of this analysis we have previously proposed and evaluated a new class of algorithms for dynamically adapting windows in single path, multi-hop networks. Here we complement our previous work by first developing a parallel theory for algorithms for dynamically adapting windows on networks having multiple paths with different propagation delays and multiple virtual circuits (VCs) on each path. A common feature of these algorithms is that the source of each VC measures the round trip response time of its packets and uses these measurements to adjust its window with the goal of satisfying certain asymptotic identities that have been proven to hold in stationary asymptotically optimal designs. These identities, which hold for all values of cross traffic intensities, serve as design equations for the algorithms.