Richard R. Weber

Learn More
Peer-to-peer (P2P) overlay networks such as BitTorrent and Avalanche are increasingly used for disseminating potentially large files from a server to many end users via the Internet. The key idea is to divide the file into many equally-sized parts and then let users download each part (or, for network coding based systems such as Avalanche, linear(More)
We investigate the optimal allocation of effort to a collection of n projects. The projects are 'restless' in that the state of a project evolves in time, whether or not it is allocated effort. The evolution of the state of each project follows a Markov rule, but transitions and rewards depend on whether or not the project receives effort. The objective is(More)
Many complex Coffrnan, Jr. 1, D. S. Johnsonl, P. W. Shorl, R. R. Weber2 pmcessea can be modeled by (countably) infinite, multidmens~onst Markov chains. Unfortunately, cnrnmt theoretical techniques for analyzing infinite Markov chains are for the most part limited to three or fewer dimensions. In this paper we propose a computer-aided approach to the(More)
A network of queues can serve as a useful model for systems arising in many contexts, including manufacturing, distributed computer systems, voice and data communicat ions, and vehicular traffic flow. Descriptive models can help to evaluate and predict the performance of existing and proposed systems, and thus improve the design of a system. Control models(More)
We address the issue of call acceptance and routing in ATM networks. Our goal is to design an algorithm that guarantees bounds on the fraction of cells lost by a call. The method we propose for call acceptance and routing does not require models describing the trafflc. Each switch estimates the additional fraction of cells that would be lost if new calls(More)
In recent years, overlay networks have proven a popular way of disseminating potentially large files from a single server <i>S</i> to a potentially large group of <i>N</i> end users via the Internet. A number of algorithms and protocols have been suggested, implemented and studied. In particular, much attention has been given to peer-to-peer (P2P) systems(More)
In this article we present a theoretical analysis of the online <i>Sum-of-Squares</i> algorithm (<i>SS</i>) for bin packing along with several new variants. <i>SS</i> is applicable to any instance of bin packing in which the bin capacity <i>B</i> and item sizes <i>s</i>(<i>a</i>) are integral (or can be scaled to be so), and runs in time(More)