William T. Zaumen

Learn More
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented, validated, and analyzed. According to this algorithms, which is called DASM (Diffusing Algorithm for Shortest Multipath), each router maintains a set of entries for each destination in its routing(More)
The dynamics of shortest-path routing algorithms bss.ed on distance vectors and link states are investigated. Detailed quantitative comparisons of the distributed Belhnen-Ford algorithm used in several routing protocols in the paa~ an ideal link-state ttlgo-nthm similar to the one used in OSPF and in the 0S1 intradomain routing protocol, and a loop-free(More)
—We present a practical approach to internet routing that provides near-minimum delays over multiple loop-free paths to destinations. The new protocol, which we call NEAR-OPT, obtains multiple loop-free paths to destinations using long-term delay measures , and allocates destination-oriented flows over such paths using short-term delay measures to minimize(More)
We present a practical approach to routing and anycasting with near-optimum delays taking into account the processing loads at routers and processing elements of a computer network. To accomplish this, the minimum-delay routing problem formulated by Gal-lager is generalized into the problem of minimum-delay routing with load-balancing to account for(More)
vii Acknowledgments ix 1 Introduction 1 2 Bounded Shortest Multicast Algorithm BSMA 7 2. superedge hs; d; ci from T 0 ; b T 0 is partitioned to two disjoint trees T 1 0 and T 2 0 ; c Reconnecting T 1 0 and T 2 0 by the delay-bounded shortest path hf; a; ci between the two trees gives T
  • 1