Chord: A scalable peer-to-peer lookup service for internet applications
- I. Stoica, R. Morris, David R Karger, M. Kaashoek, H. Balakrishnan
- Computer ScienceConference on Applications, Technologies…
- 1 October 2001
Results from theoretical analysis, simulations, and experiments show that Chord is scalable, with communication cost and the state maintained by each node scaling logarithmically with the number of Chord nodes.
OpenFlow: enabling innovation in campus networks
- N. McKeown, T. Anderson, J. Turner
- Computer ScienceCCRV
- 31 March 2008
This whitepaper proposes OpenFlow: a way for researchers to run experimental protocols in the networks they use every day. OpenFlow is based on an Ethernet switch, with an internal flow-table, and a…
Span: An Energy-Efficient Coordination Algorithm for Topology Maintenance in Ad Hoc Wireless Networks
- Benjie Chen, Kyle Jamieson, H. Balakrishnan, R. Morris
- Computer ScienceACM/IEEE International Conference on Mobile…
- 16 July 2001
A randomized algorithm where coordinators rotate with time is given, demonstrating how localized node decisions lead to a connected, capacity-preserving global topology.
Adaptive protocols for information dissemination in wireless sensor networks
- W. Heinzelman, Joanna Kulik, H. Balakrishnan
- Computer ScienceACM/IEEE International Conference on Mobile…
- 1 August 1999
It is found that the SPIN protocols can deliver 60% more data for a given amount of energy than conventional approaches, and that, in terms of dissemination rate and energy usage, the SPlN protocols perform close to the theoretical optimum.
Resilient overlay networks
- D. Andersen, H. Balakrishnan, M. Kaashoek, R. Morris
- Computer ScienceCCRV
- 2002
It is found that forwarding packets via at most one intermediate RON node is sufficient to overcome faults and improve performance in most cases, demonstrating the benefits of moving some of the control over routing into the hands of end-systems.
The Cricket location-support system
- B. Priyantha, Anit Chakraborty, H. Balakrishnan
- Computer ScienceACM/IEEE International Conference on Mobile…
- 1 August 2000
The randomized algorithm used by beacons to transmit information, the use of concurrent radio and ultrasonic signals to infer distance, the listener inference algorithms to overcome multipath and interference, and practical beacon configuration and positioning techniques that improve accuracy are described.
CryptDB: protecting confidentiality with encrypted query processing
- R. A. Popa, Catherine M. S. Redfield, N. Zeldovich, H. Balakrishnan
- Computer ScienceSymposium on Operating Systems Principles
- 23 October 2011
The evaluation shows that CryptDB has low overhead, reducing throughput by 14.5% for phpBB, a web forum application, and by 26% for queries from TPC-C, compared to unmodified MySQL.
A comparison of mechanisms for improving TCP performance over wireless links
- H. Balakrishnan, V. Padmanabhan, S. Seshan, R. Katz
- Computer ScienceConference on Applications, Technologies…
- 1 October 1996
The results show that a reliable link-layer protocol with some knowledge of TCP provides very good performance, and it is possible to achieve good performance without splitting the end-to-end connection at the base station.
Cutting the electric bill for internet-scale systems
- Asfandyar Qureshi, Rick Weber, H. Balakrishnan, J. Guttag, B. Maggs
- EconomicsConference on Applications, Technologies…
- 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.
Mitigating congestion in wireless sensor networks
- Bret Hull, Kyle Jamieson, H. Balakrishnan
- Computer Science, BusinessACM International Conference on Embedded…
- 3 November 2004
Fusion, a combination of hop-by-hop flow control, rate limiting source traffic when transit traffic is present, and a prioritized medium access control (MAC) protocol, can improve network efficiency by a factor of three under realistic workloads.
...
...