We derive several algorithms for the busy period distribution of the canonical Markovian fluid flow model. One of them is similar to the Latouche-Ramaswami algorithm for quasi-birth-death models and ...

Mathematics of Operations Research, Vol. 18, No. 1 (Feb., 1993), pp. 71-97 (27 pages) This paper is concerned with the design and probabilistic analysis of algorithms for the maximum-flow problem and ...

Finding the most efficient way to transport items across a network like the U.S. highway system or the Internet is a problem that has taxed mathematicians and computer scientists for decades. To ...

Algorithm promises to greatly streamline solutions to the 'max flow' problem. Research could boost the efficiency even of huge networks like the Internet. Finding the most efficient way to transport ...