Dynamic adaptive windows for high speed data networks with multiple paths and propagation delays

摘要: Abstract Recently the optimal design of windows for virtual circuits has been studied high speed, wide area data networks in an asymptotic framework which delay bandwidth product is large parameter. Based on results this analysis we have previously proposed and evaluated a new class algorithms dynamically adapting single path, multi-hop networks. Here complement our previous work by first developing parallel theory having multiple paths with different propagation delays (VCs) each path. A common feature these that source VC measures round trip response time its packets uses measurements to adjust window goal satisfying certain identities proven hold stationary asymptotically designs. These identities, all values cross traffic intensities, serve as “design equations” algorithms. major part reported here evaluation performance adaptive realistic, nonstationary conditions simulations rates 45 Mbps up 47 ms. One two 3 nodes, 2 16 VCs path; level determines whether path 1 or bottlenecks. The simulation generally confirm realizations give stable, efficient are close theoretical expectations.