Balakrishnan
Confidentiality and Security in the Cloud
Raluca Ada Popa, Catherine M. S. Redfield, Nickolai Zeldovich, Hari Balakrishnan, “CryptDB: Protecting Confidentiality with Encrypted Query Processing,” SOSP, 2011. [PDF] Thomas Ristenpart, Eran Tromer, Hovav Shacham, Stefan Savage, “Hey, You, Get Off of My Cloud: Exploring Information Leakage in Third-Party Compute Clouds,” CCS, 2009. [PDF] Summary With the increase in popularity of cloud computing ...
Continue reading →
Cutting the Electric Bill for Internet-Scale Systems
A. Qureshi, R. Weber, H. Balakrishnan, J. Guttag, B. Maggs, “Cutting the Electric Bill for Internet-Scale Systems,” ACM SIGCOMM Conference, (August 2009). [PDF] Summary Large organizations like Google, Microsoft, and Yahoo! annually consume tens of millions of dollars worth of electricity. The traditional approach toward reducing energy costs by reducing the amount of energy consumption ...
Continue reading →
Not-a-Bot: Improving Service Availability in the Face of Botnet Attacks
R. Gummadi, H. Balakrishnan, P. Maniatis, S. Ratnasamy, “Not-a-Bot: Improving Service Availability in the Face of Botnet Attacks,” NSDI’09, (April 2009). [PDF] Summary In recent years, botnets have become the major originators of email spams, DDoS attacks, and click-frauds on advertisement-based web sites. This paper argues that separating human-generated traffic from botnet-generated activities can improve ...
Continue reading →
DNS Performance and the Effectiveness of Caching
J. Jung, E. Sit, H. Balakrishnan, “DNS Performance and the Effectiveness of Caching,” IEEE/ACM Transactions on Networking, V. 10, N. 5, (October 2002). [PDF] Summary Hierarchical design and aggressive caching are considered to be the main two reasons behind the scalability of DNS. Both factors seek to reduce the load on the root servers at ...
Continue reading →
Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications
I. Stoica, R. Morris, D. Karger, F. Kaashoek, H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” ACM SIGCOMM Conference, 2001. [PDF] Summary Chord is a DHT-based distributed lookup protocol – one of too many actually – for P2P systems that looks up a value given a key. What makes it more interesting ...
Continue reading →
Looking Up Data in P2P Systems
H. Balakrishnan, F. Kaashoek, D. Karger, R. Morris, I. Stoica, “Looking Up Data in P2P Systems,” Communications of the ACM, V. 46, N. 2, (February 2003). [ACM] Summary P2P systems have attracted large following due to their manageability, flexibility, resource-aggregation capabilities, and fault-tolerance properties. One of the biggest challenges in this area of research is ...
Continue reading →
A Comparison of Mechanisms for Improving TCP Performance over Wireless Links
H. Balakrishnan, V. Padmanabhan, S. Seshan, R. H. Katz, “A Comparison of Mechanisms for Improving TCP Performance over Wireless Links,” IEEE/ACM Transactions on Networking, (December 1997). [PDF] Summary Unlike wired networks, congestion is not the only source of packet loss in wireless networks. Networks with wireless and lossy links also suffer from significant losses due ...
Continue reading →
Interdomain Internet Routing
H. Balakrishnan, “Interdomain Internet Routing,” MIT Lecture Notes, (January 2009). Summary Connectivity between different autonomous systems (ASes) with heterogeneous characteristics was the primary objective while designing the Internet. Interdomain routing enables end-to-end communication and global connectivity in a distributed manner through the dissemination of reachability information among the ASes/ISPs in the Internet. This lecture provides ...
Continue reading →