Author pages are created from data sourced from our academic publisher partnerships and public sources.
Share This Author
Cutting the electric bill for internet-scale systems
- Asfandyar Qureshi, Rick Weber, H. Balakrishnan, J. Guttag, B. Maggs
- Computer ScienceSIGCOMM '09
- 16 August 2009
The variation due to fluctuating electricity prices is characterized and it is argued that existing distributed systems should be able to exploit this variation for significant economic gains.
Less pain, most of the gain: incrementally deployable ICN
A proof-of-concept design of an incrementally deployable ICN architecture is presented and it is found that pervasive caching and nearest-replica routing are not fundamentally necessary and most of the performance benefits can be achieved with simpler caching architectures.
A Maximum Likelihood Stereo Algorithm
- I. Cox, S. Hingorani, Satish Rao, B. Maggs
- Mathematics, Computer ScienceComput. Vis. Image Underst.
- 1 May 1996
Several variants of the algorithm are developed that avoid classical regularization while imposing several global cohesiveness constraints, and this is a novel approach that has the advantage of guaranteeing that solutions minimize the original cost function and preserve discontinuities.
Efficient content location using interest-based locality in peer-to-peer systems
- K. Sripanidkulchai, B. Maggs, Hui Zhang
- Computer ScienceIEEE INFOCOM . Twenty-second Annual Joint…
- 9 July 2003
This work proposes a content location solution in which peers loosely organize themselves into an interest- based structure on top of the existing Gnutella network, and demonstrates the existence of interest-based locality in five diverse traces of content distribution applications, two of which are traces of popular peer-to-peer file-sharing applications.
Globally Distributed Content Delivery
- J. Dilley, B. Maggs, J. Parikh, H. Prokop, R. Sitaraman, W. Weihl
- Computer ScienceIEEE Internet Comput.
- 1 September 2002
The Akamai system has since evolved to distribute dynamically generated pages and even applications to the network's edge, providing customers with on-demand bandwidth and computing capacity and lets content providers' infrastructure requirements be reduced, and lets them deploy or expand services more quickly and easily.
Algorithmic Nuggets in Content Delivery
This paper "peeks under the covers" at the subsystems that provide the basic functionality of a leading content delivery network, and illustrates the close synergy that exists between research and industry where research ideas cross over into products and product requirements drive future research.
The feasibility of supporting large-scale live streaming applications with dynamic application end-points
This paper looks at three key requirements for feasibility of supporting large-scale live streaming using an application end-point architecture, and shows that simple algorithms have the potential to meet these requirements in practice.
R-BGP: Staying Connected in a Connected World
Simulations on the AS-level graph of the current Internet show that R-BGP reduces the number of domains that see transient disconnectivity resulting from a link failure from 22% for edge links and 14% for core links down to zero in both cases.
A comparison of sorting algorithms for the connection machine CM-2
- G. Blelloch, C. Leiserson, B. Maggs, C. G. Plaxton, Stephen J. Smith, M. Zagha
- Computer ScienceSPAA '91
- 1 June 1991
A fast sorting algorithm for the Connection Machine Supercomputer model CM-2 is developed and it is shown that any U(lg n)-depth family of sorting networks can be used to sort n numbers in U( lg n) time in the bounded-degree fixed interconnection network domain.
An analysis of live streaming workloads on the internet
It is found that Internet streaming does reach a wide audience, often spanning hundreds of AS domains and tens of countries, and that small streams also have a diverse audience.