Prof. Ramesh K. Sitaraman

 
 

SELECTED PUBLICATIONS AND PRESENTATIONS

 

Copyright notice for published papers: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright.

Copyright notice for presentations and other work: All of my presentations, talks, and images  on this page are available with Creative Commons Attribution ShareAlike 4.0 license.

 2014


  1. Overlay Networks: An Akamai Perspective, Ramesh K. Sitaraman, Mangesh Kasbekar, Woody Lichtenstein, and Manish Jain.
    In Advanced Content Delivery, Streaming, and Cloud Services, Ed. Pathan, Sitaraman, and Robinson, John Wiley & Sons, 2014.

  2. Download pdf


  3. Tradeoffs in Optimizing the Cache Deployments of CDNs, Syed Hasan, Sergey Gorinsky, Constantine Dovrolis, and Ramesh Sitaraman, Proceedings of the 33rd Annual IEEE International Conference on Computer Communications (INFOCOM), 2014.
    Download pdf

  4. Reducing Energy Costs in Internet-Scale Distributed Systems using Load-shifting, Vimal Mathew, Ramesh Sitaraman and Prashant Shenoy, In Proceedings of the Fifth International Conference on Communication Systems and Networks (COMSNETS), January, 2014.
    Download pdf


2013


    1. Understanding the Effectiveness of Video Ads: A Measurement Study, S.Shunmuga Krishnan and Ramesh Sitaraman, In the Proceedings of the ACM Internet Measurement Conference (IMC), Oct 2013.

    2. Download PDF    Download Presentation


    3. Energy‐Efficient Content Delivery Networks using Cluster Shutdown, Vimal Mathew, Ramesh Sitaraman and Prashant Shenoy, The Fourth International  Green Computing Conference (IGCC),  June  2013.

    4. Download PDF


    1. Distributing content simplifies ISP traffic engineering, Abhigyan Sharma, Arun Venkataramani, Ramesh K. Sitaraman, ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS),  June  2013.

    2. Download PDF


  1. Dynamic provisioning in next-generation data centers with on-site  power production, Jinlong Tu, Lian Lu, Minghua Chen, Ramesh K. Sitaraman, The Fourth International Conference on Future Energy Systems, e-Energy. pages 137-148, May, 2013.

        Download PDF

       

    1. Network Performance: Does it Really Matter to Users and By How Much?,  Ramesh K. Sitaraman, In Proceedings of the Fifth International Conference on Communication Systems and Networks (COMSNETS), January, 2013.

    2. Download PDF.


  1. 2012


    1. Video Stream Quality Impacts Viewer Behavior: Inferring Causality using Quasi-Experimental Designs, S. Shunmuga Krishnan and Ramesh Sitaraman,  Proceedings of the ACM Internet Measurement Conference (IMC), Boston, MA, Nov 2012.

    2. Download PDF Watch Presentation Download Presentation


    3. Using Batteries to Reduce the Power Costs of Internet-scale Distributed Networks, D.S. Palasamudram, R.K. Sitaraman, B.Urgaonkar, and R. Urgaonkar,  Proceedings of the ACM Symposium of Cloud Computing (SOCC), San Jose, CA,  October 2012.

    4. Download PDF


    5. An Empirical Study of Memory Sharing in Virtual Machines,

    6. Sean Barker, Timothy Wood, Prashant Shenoy, and Ramesh Sitaraman
      Proceedings of the USENIX Annual Technical Conference (USENIX ATC), Boston, MA, June 2012
      Download PDF


    7. Energy-Aware Load Balancing in Content Delivery Networks, Vimal Mathew, Ramesh K. Sitaraman, and Prashant Shenoy, Proceedings of the the 31st Annual IEEE International Conference on Computer Communications (IEEE INFOCOM 2012), March, 2012.

    8. Download PDF.


 2011

    1. Algorithms for Constructing Overlay Networks For Live Streaming, Konstantin Andreev, Bruce M. Maggs, Adam Meyerson, Jevan Saks, Ramesh K. Sitaraman, Also,  ArXiv CoRR abs/1109.4114: (2011).

    2. Download PDF


    3. Algorithms for optimizing the bandwidth cost of content delivery. Micah Adler, Ramesh K. Sitaraman, Harish Venkataramani:  Computer Networks 55(18): 4007-4020 (2011).

    4. Download PDF.


    5. Sharing-aware Algorithms for Virtual Machine Colocation, Michael Sindelar, Ramesh K. Sitaraman, and Prashant Shenoy, Proceedings of 23rd ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), San Jose, CA, June 2011.

    6. Download PDF.


  1.  2010

    1. Assessing the Vulnerability of Replicated Network Services, G.D. Bissias, B.N. Levine, R.K. Sitaraman, 7th International Conference on emerging Networking EXperiments and Technologies (CoNEXT), November, 2010.

    2. Download PDF


    1. “The Akamai network: a platform for high-performance Internet applications," E. Nygren, Ramesh K. Sitaraman, and J. Sun, ACM SIGOPS Operating Systems Review, Volume 44 Issue 3, July 2010.

    2. Download pdf.


  2.  2009

    1. Lazy-Adaptive Tree: An Optimized Index Structure for Flash Devices,” D. Agrawal, D. Ganesan,  Ramesh K. Sitaraman, Y. Diao, and S. Singh, VLDB, 2009.

    2. Download PDF


  3.  2008

    1.   “Performance and Availability Benefits of Global Overlay Routing,” H.S. Rahul, M. Kasbekar, Ramesh K. Sitaraman, and A. Berger, Content Delivery Networks, Editors: R. Buyya, M. Pathan, and A. Vakali, Springer-Verlag, New York, LLC, 2008.

    2. Download PDF


    1. “On the Performance Benefits of Multihoming Route Control,” A. Akella,  B. Maggs, S. Seshan, A, Shaikh, and Ramesh K. Sitaraman, IEEE/ACM Transactions on Networking (TON), p 91, vol. 16, 2008.  Download PDF

    2. Download Errata


  4.  2006

    1. “Minimal test collections for retrieval evaluation,” B. Carterette, J. Allan, and R. K. Sitaraman, 29th Annual International ACM SIGIR Conference, p. 268, 2006.

    2. Download PDF


    3. “ Towards Realizing the Performance and Availability of a Global Overlay Network,” Passive and Active Monitoring (PAM) Conference, H. Rahul, M. Kasbekar, Ramesh Sitaraman, and A. Berger, 2006.

    4. Download PDF


    1. “Algorithms for Optimizing Bandwidth Costs on the Internet,” Micah Adler, Ramesh K. Sitaraman, and Harish Venkataramani, HotWeb Conference, 2006.

    2. Download PDF


  5.  2004

    1. A Transport Layer for Live Streaming in a Content Delivery Network, Leonidas Kontothanassis, Ramesh Sitaraman, Joel Wein, Duke Hong, Robert Kleinberg, Brian Mancuso, David Shaw, and Daniel Stodolsky. Proceedings of the IEEE, Special Issue on Evolution of Internet Technologies 92(9):1408-1419 (September, 2004).

    2. Download PDF


  6.  2003

    1. A Measurement-Based Analysis of Multihoming, A. Akella, B. Maggs, S. Seshan, A. Shaikh, and Ramesh Sitaraman, Proceedings of the 2003 ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (SIGCOMM), August 2003.

    2. Download PDF 



    1. Designing Overlay Multicast Networks for Streaming, K. Andreev, B. M. Maggs, and A. Meyerson and R. Sitaraman, Proceedings of the Fifteenth Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), June 2003.

    2. Download PDF


  7. 2002

    1. Globally distributed content delivery, J. Dilley, B. Maggs, J. Parikh, H. Prokop, R. Sitaraman, and B. Weihl, IEEE Internet Computing, September/October 2002, pp. 50-58.

    2. Download PDF



2001

    1. Tree Layout for Internal Network Characterizations in Multicast Networks, M. Adler, T. Bu, R. K. Sitaraman, and D. Towsley, Proceedings of Third International Workshop on Networked Group Communication, London, pp. 189--204, Nov. 2001. 


    1. The power of two random choices: A survey of the techniques and results, M. Mitzenmacher, A. Richa, and R. K. Sitaraman, Handbook of Randomized Computing, vol 1, pp. 255-305, July 2001, edited by P. Pardalos, S. Rajasekaran, and J. Rolim, Kluwer Press.

    2. Download PDF


    3. On the Benefit of Supporting Virtual Channels in Wormhole Routers, R. Cole, B.M. Maggs, and R. K. Sitaraman, Journal of Computer and System Sciences (JCSS), Vol. 62, No. 1, February 2001, pp. 152-177. Conference Version: 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp.131-141, June 1996. Download PDF


  1. 1999

    1. Augmented Ring Networks, W. Aiello, S.N. Bhatt, F.R.K. Chung, A.L. Rosenberg, and R. K. Sitaraman, IEEE Transactions on Parallel and Distributed Systems, 12 (2001) pp. 598-609._ Conference version: 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Proceedings in Informatics 5, Carleton Scientific, pp. 1--16, July 1999.

    2. Download PDF 


    1. Convergence and Concentration Results for Packet Routing Networks, S. Datta and R. K. Sitaraman, 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO), Proceedings in Informatics 5, Carleton Scientific,_ pp. 78--92, July 1999.


    1. Optimal clustering of tree-sweep computations for high-latency parallel environments, L. Gao, A. L. Rosenberg, and R. K. Sitaraman, IEEE Transactions on Parallel and Distributed Systems, Vol. 10, No. 8, pp. 813--824, August 1999. Conference Version: _Optimal Architecture-Independent Scheduling of Fine-Grain Tree-Sweep Computations, with L. Gao and A. Rosenberg, 7th IEEE Symposium on Parallel and Distributed Processing (SPDP), pp. 620-629, Oct 1995.

    2. Download PDF


    3. Simple algorithms for routing on butterfly networks with bounded queues, B. Maggs and R. K. Sitaraman, SIAM Journal on Computing, Vol. 28, No. 3, pp. 984--1003, 1999. Conference Version: _Proceedings of the 24th Annual ACM Symposium on Theory of Computing (STOC),_ pp. 150--161, May 1992.

    4. Download PDF


  2. 1998

    1. On the Bisection Width and Expansion of Butterfly Networks, C. F._ Bornstein, A. Litman, B. M. Maggs, R. K. Sitaraman, and T. Yatzkar, Theory of Computing Systems (TOCS), Vol. 34, No. 6, November 2001, pp. 491-518. Conference Version: First Merged International Parallel Processing Symposium (IPPS) and Symposium on Parallel and Distributed Processing (SPDP),_ pp. 144-150, March 1998.

    2. Download PDF


    1. Scheduling time-constrained communication in linear networks, M. Adler, A.L. Rosenberg, R. K. Sitaraman, and W. Unger, 10th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), June 1998.

    2. Download PDF


    1. On the fault tolerance of some popular bounded-degree networks, F.T. Leighton, B.M. Maggs, and R. K. Sitaraman, SIAM Journal on Computing, Vol. 27, No. 5, pp. 1303--1333, October 1998. _Conference Version: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 542--552, October 1992.

    2. Download PDF


    1. On Balls and Bins with Deletions, R. Cole, A. Frieze, B.M. Maggs, M. Mitzenmacher, A. W. Richa, R. K. Sitaraman, and E. Upfal, 2nd International Workshop on Randomization and Approximation Techniques in Computer Science (RANDOM), Barcelona, Spain, October 1998.

    2. Download PS

  3.  

    1. Randomized protocols for low-congestion circuit routing in multistage interconnection networks, R. Cole, B.M. Maggs, F. Meyer auf der Heide, M. Mitzenmacher, A.W. Richa, K. Schroder, R. K. Sitaraman, and B. Vocking,_ Proceedings of the 30th Annual ACM Symposium on Theory of Computing (STOC), May 1998.

      1. Download PS 

  4. 1997

    1. The performance of simple routing algorithms that drop packets, S. Datta and R. K. Sitaraman, 9th ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 159-167,_ June, 1997.


    1. Reconfiguring Arrays with Faults Part I: Worst-Case Faults, R. Cole , B. Maggs, and R. K. Sitaraman, SIAM Journal on Computing, Vol. 26,_ No. 6, pp. 1581--1611, December 1997. 

    2. Conference Version: Multi-scale self-simulation: A technique for reconfiguring_ processor arrays with faults, with R. Cole and B. Maggs, Proceedings of the 25th Annual ACM Symposium on Theory of Computing (STOC),_ pp. 561--572, May 1993.

    3. Download PDF


    4. The reconfigurable ring of processors: Fine-grain tree-structured computations, A.L. Rosenberg, V. Scarano, R. K. Sitaraman, IEEE Transactions on Computers, Vol. 46, No. 10, pp. 1119 -- 1131, October 1997. Conference Version: 6th IEEE Symposium on Parallel and Distributed Processing} (SPDP), pp. 470--477, Oct 1994.

    5. Download PDF


    6. REfficient emulations of trees and arrays on a reconfigurable ring of processors, A.L. Rosenberg , V. Scarano, and R. K. Sitaraman, Invited paper, 11th International Conference on Mathematical and Computer Modelling and Scientific Computing (ICMCM & SC), March 1997.


    7. Routing on Butterfly Networks with Random Faults, R. Cole, B.M. Maggs, and R. K. Sitaraman, 36th Annual Symposium on Foundations of Computer Science (FOCS), pp. 558--570, October 1995.

    8. Download PS 


  5. 1996

    1. A system to place observers on a polyhedral terrain in polynomial time, M. Marengoni, B.A. Draper, A. Hanson, and R. Sitaraman, Image and Vision Computing Journal, 18: pages 773-780, 2000. 

    2. Conference Version: 3rd {IEEE} Workshop on Applications of Computer Vision, Sarasota, Florida, pp. 77--82, December 1996.


    3. A system to place observers on a polyhedral terrain in polynomial time, M. Marengoni, B.A. Draper, A. Hanson, and R. Sitaraman, Image and Vision Computing Journal, 18: pages 773-780, 2000.

    4. Conference Version: 3rd {IEEE} Workshop on Applications of Computer Vision, Sarasota, Florida, pp. 77--82, December 1996.


    5. On Trading Task Reallocation for Thread Management in Partitionable Multiprocessors, L. Gao, A. Rosenberg, and R. K. Sitaraman, 8th Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA), pp. 309--317, June 1996.


    6. Optimal design of checks for error detection and location in fault tolerant multiprocessor systems, R. K. Sitaraman and N. K. Jha, IEEE Transactions on Computers, Vol. 42, No. 7, pp. 780--793, 1993. Conference Version: Proceedings of the Fault Tolerant Computing Systems Conference, pp. 396--406, September 1991. Download PDF


  6. 1995 & Earlier

    1. The Reconfigurable Ring of Processors:_ Efficient Algorithms via Hypercube Emulation, A. L. Rosenberg , V. Scarano, and R. K. Sitaraman, Special issue on ``Dynamically Reconfigurable Architectures'' of Parallel Processing Letters, Vol. 5, No. 1, pp. 37--48, 1995.


    2. Parallel Optimization of Motion Controllers via Policy Iteration, J.A. Coelho, R. Sitaraman, and R.A. Grupen,_ Advances in Neural Information Processing Systems Conference} {(NIPS)}, pp. 996--1002, MIT Press, November 1995.

    3. Download PDF


    4. Communication and Fault Tolerance in Parallel Computers, R. K. Sitaraman, Ph.D Thesis, Princeton Univerisity, 1993.

    5. Download PDF


    6. Learning programs with an easy to calculate set of errors, W. Gasarch, C. Smith, R. Sitaraman, and, M. Velauthapillai, Fundamenta Informaticae, Vol. 16, No. 3-4, pp. 355--370, 1992.

    7. Conference Version: Proceedings of the Workshop on Computational Learning Theory (COLT), May 1988.


    8. Probabilistic analysis of two stage matching, R. Sitaraman, and A. Rosenfeld, Pattern Recognition, Vol. 22, No. 3, pp. 331--343, 1989.


    9. Using probabilistic domain knowledge to reduce the expected cost of matching, A. Margalit, R. Sitaraman, and A. Rosenfeld, Image Understanding Workshop, pp. 678--689, April 1988.