text:
% Some common conference names
%@string{ICRA = "Proceedings of IEEE ICRA"}
%@string{HOTOS = "Proceedings of HotOS"}
%@string{OSDI = "Proceedings of USENIX OSDI"}
%@string{HOTNETS = "Proceedings of HotNets"}
%@string{SIGCOMM = "Proceedings of the ACM SIGCOMM"}
%@string{SIGCOMM = "Proceedings of the ACM SIGCOMM Symposium on Communications Architectures and Protocols"}
%@string{MOBICOM = "Proceedings of ACM MobiCom"}
%@string{MOBISYS = "Proceedings of ACM MobiSys"}
%@string{SIGMETRICS = "Proceedings of ACM SIGMETRICS"}
%@string{IMC = "Proceedings of IMC"}
%@string{PAM = "Proceedings of the PAM conference"}
%@string{SENSYS = "Proceedings of the ACM SenSys"}
%@string{NSDI = "Proceedings of the USENIX NSDI"}
%@string{FAST = "Proceedings of the USENIX FAST"}
%@string{CONEXT = "Proceedings of ACM CoNEXT"}
%@string{NDSS = "Proceedings of the NDSS Symposium"}

@string{ICRA = "IEEE International Conference on Robotics and Automation (ICRA)"}
@string{HOTOS = "Workshop on Hot Topics in Operating Systems"}
@string{HOTNETS = "Workshop on Hot Topics in Networking (HotNets)"}
@string{IEEEPCS = "IEEE Personal Communications Magazine"}
@string{OSDI = "USENIX Symposium on Operating Systems Design and Implemnetation (OSDI)"}
@string{SIGCOMM = "Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication (ACM SIGCOMM)"}
@string{MOBICOM = "ACM Conference on Mobile Computing and Networking (Mobicom)"}
@string{MOBISYS = "ACM Conference on Mobile Systems, Applications, and Services (MobiSys)"}
@string{SIGMETRICS = "ACM SIGMETRICS International Conference on Measurement and Modeling of Computer Systems"}
@string{TON = "IEEE/ACM Transactions on Networking"}
@string{INFOCOM = "IEEE Conference on Computer Communications (INFOCOM)"}
@string{IMC = "ACM Internet Measurement Conference (IMC)"}
@string{SENSYS = "ACM Conference on Embedded Networked Sensor Systems (SenSys)"}
@string{NSDI = "USENIX Symposium on Networked Systems Design and Implementation (NSDI)"}
@string{FAST = "USENIX Conference on File and Storage Technologies (FAST)"}
@string{CONEXT = "ACM Conference on Emerging Networking EXperiments and Technologies (CoNEXT)"}
@string{SIGMOD = "ACM SIGMOD International Conference on Management of Data (SIGMOD)"}
@string{WINTECH = "ACM International Workshop on Wireless Network Testbeds, Experimental Evaluation and Characterization (Wintech)"}
@string{MC2R = "SIGMOBILE Mobile Computing Communications Review (MC2R)"}
@string{CCR = "{SIGCOMM Computer Communications Review}

@inproceedings{1993-Chen-ipps,
  author = "P. M. Chen and E. K. Lee and A. L. Drapeau and K. Lutz and
            E. L. Miller and S. Seshan and K. Shirriff and
            D. A. Patterson and R. H. Katz",
  title = {Performance and Design Evaluation of the RAID-II Storage Server},
  booktitle = {1993 International Parallel Processing
                Symposium Workshop on I/O in Parallel Computer Systems},
  address =  {Newport Beach, CA},
  month = Apr,
  year = 1993,
  pages = "110--120",
  category = "[File Systems]",
  summary = "",
}

@inproceedings{1993-Katz-vlsi,
  author = "R. H. Katz and P. M. Chen and A. L. Drapeau and E. K. Lee and
            E. L. Miller and S. Seshan and D. A. Patterson",
  title = {RAID-II: Design and Implementation of a Large Scale Disk
            Array Controller},
  booktitle = {VLSI System Design Conference},
  address =  {Seattle, WA},
  month = Mar,
  year = 1993,
  category = "[File Systems]",
  summary = "",
}

@inproceedings{1993-Keeton-usenixmobile,
  author = "Keeton, K. and Mah, B. A. and Seshan, S. and Katz, R. H. and
            Ferrari, D.",
  category = "[Mobile, Video]",
  summary = "",
  title = {Providing {Connection-Oriented} Network Services to Mobile Hosts},
  booktitle = {USENIX Mobile & Location-Independent Computing Symposium},
  year = {1993},
  address = {Cambridge, MA},
  url = {https://www.usenix.org/conference/usenix-mobile-location-independent-computing-symposium/providing-connection-oriented},
  publisher = {USENIX Association},
  month = aug,
}

@inproceedings{1993-Mah-wwos,
  author = "Mah, B. A. and Seshan, S. and Keeton, K. and Ferrari,
            D. and Katz, R. H.",
  title = {Providing Network Video Service to Mobile Clients},
  booktitle = {Workshop on Workstation Operating Systems},
  month = Oct,
  year = 1993,
  address = {Napa, CA},
  category = "[Mobile, Video]",
  summary = "",
}

@inproceedings{1993-Seshan-lcn,
  address = {Minneapolis, MN},
  month = Sep,
  author={Seshan, S. and Katz, R.H.},
  booktitle={1993 18th Conference on Local Computer Networks},
  title={Interfacing a high performance disk array file server to a gigabit LAN},
  year={1993},
  volume={},
  number={},
  pages={344-353},
  doi={10.1109/LCN.1993.591242},
  url = {https://doi.org/10.1109/LCN.1993.591242},
  category = "[File Systems, NIC]",
  summary = "",
}

@MastersThesis{1993-Seshan-masters,
  author = {S. Seshan},
  title = {An Efficient Network Interface for the RAID-II File Server},
  school = {UC, Berkeley},
  year = 1993,
  month = Jun,
  note = {Technical Report UCB/CSD 93/769},
  category = "[File Systems, NIC]",
  summary = "",
}

@article{1994-Chen-jdpd,
	Abstract = {RAID-II is a high-bandwidth, network-attached storage server designed and implemented at the University of California at Berkeley. In this paper, we measure the performance of RAID-II and evaluate various architectural decisions made during the design process. We first measure the end-to-end performance of the system to be approximately 20 MB/s for both disk array reads and writes. We then perform a bottleneck analysis by examining the performance of each individual subsystem and conclude that the disk subsystem limits performance. By adding a custom interconnect board with a high-speed memory and bus system and parity engine, we are able to achieve a performance speedup of 8 to 15 over a comparative system using only off-the-shelf hardware.},
	Author = {Chen, Peter M. and Lee, Edward K. and Drapeau, Ann L. and Lutz, Ken and Miller, Ethan L. and Seshan, Srinivasan and Shirriff, Ken and Patterson, David A. and Katz, Randy H.},
	Da = {1994/07/01},
	Doi = {10.1007/BF01266330},
	Isbn = {1573-7578},
	Journal = {Distributed and Parallel Databases},
	Number = {3},
	Pages = {243--260},
	Title = {Performance and design evaluation of the RAID-II storage server},
	Ty = {JOUR},
	Url = {https://doi.org/10.1007/BF01266330},
	Volume = {2},
	Year = {1994},
  Month = oct,
  category = "[File Systems]",
	Bdsk-Url-1 = {https://doi.org/10.1007/BF01266330}}

@inproceedings{1994-Drapeau-isca,
author = {Drapeau, A. L. and Shirriff, K. W. and Hartman, J. H. and Miller, E. L. and Seshan, S. and Katz, R. H. and Lutz, K. and Patterson, D. A. and Lee, E. K. and Chen, P. M. and Gibson, G. A.},
title = {RAID-II: A High-Bandwidth Network File Server},
year = {1994},
isbn = {0818655100},
publisher = {IEEE Computer Society Press},
address = {Washington, DC, USA},
month = apr,
url = {https://doi.org/10.1109/ISCA.1994.288146},
doi = {10.1109/ISCA.1994.288146},
booktitle = {International Symposium on Computer Architecture (ISCA)},
pages = {234–244},
numpages = {11},
location = {Chicago, Illinois, USA},
series = {ISCA '94},
  category = "[File Systems]",
abstract = {In 1989, the RAID (Redundant Arrays of Inexpensive Disks) group at U. C. Berkeley built a prototype disk array called RAID-I. The bandwidth delivered to clients by RAID-I was severely limited by the memory system bandwidth of the disk array' s host workstation. We designed our second prototype, RAID-H, to deliver more of the disk array bandwidth to file server clients. A custom-built crossbar memory system called the XBUS board connects the disks directly to the high-speed network, allowing data for large requests to bypass the server workstation. RAID-II runs Log-Structured File System (LFS) software to optimize performance for bandwidth-intensive applications.The RAID-II hardware with a single XBUS controller board delivers 20 megabytes/second for large, random read operations and up to 31 megabytes/second for sequential read operations. A preliminary implementation of LFS on RAID-II delivers 21 megabytes/second on large read requests and 15 megabytes/second on large write operations.},
}

@inproceedings{1994-Seshan-mobidata,
  author = "Seshan, S. and Le, M. T. and Burghardt, F. L. and Rabaey, J.",
  title = {Software Architecture of the InfoPad System},
  booktitle = "Mobidata Workshop",
  address = {Rutgers University, N.J.},
  month = Nov,
  year = 1994,
  category = "[Mobile]",
  summary = "",
}

@INPROCEEDINGS{1995-Amir-hotos,
  author={Amir, E. and Balakrishnan, H. and Seshan, S. and Katz, R.H.},
  booktitle=HOTOS,
  title={Efficient TCP over networks with wireless links},
  year={1995},
  volume={},
  number={},
  pages={35-40},
  category = "[Mobile, Wireless, TCP]",
  month = May,
  doi={10.1109/HOTOS.1995.513451},
  url={https://doi.org/10.1109/HOTOS.1995.513451}
}

@inproceedings{1995-Balakrishnan-mobicom,
  award = {Best Student Paper Award},
  category = "[Mobile, Wireless, TCP]",
  author = {Balakrishnan, Hari and Seshan, Srinivasan and Amir, Elan and Katz, Randy H.},
  title = {Improving TCP/IP Performance over Wireless Networks},
  year = {1995},
  isbn = {0897918142},
  publisher = {Association for Computing Machinery},
  address = {New York, NY, USA},
  url = {https://doi.org/10.1145/215530.215544},
  doi = {10.1145/215530.215544},
  abstract = {TCP is a reliable transport protocol tuned to perform well in
  traditional networks made up of links with low bit-error rates.
  Networks with higher bit-error rates, such as those with wireless
  links and mobile hosts, violate many of the assumptions made by
  TCP, causing degraded end-to-end performance. In tbis paper, we
  describe the design and implementation of a simple protocol, called
  the snoop protocol, that improves TCP performance in wireless
  networks. The protocol modifies network-layer software mainly at a
  base station and preserves end-to-end TCP semantics. The main idea
  of the protocol is to cache packets at the base station and perform
  local retransmissions across the wireless link. We have implemented
  the snoop protocol on a wireless testbed consisting of IBM ThinkPad
  laptops and i486 base stations communicating over an AT&T
  Wavelan. Our experiments show that it is significantly more robust
  at dealing with unreliable wireless links as compared to normal
  TCP; we have achieved throughput speedups of up to 20 times over
  regular TCP in our experiments with the protocol.},
  booktitle = MOBICOM,
  pages = {2–11},
  numpages = {10},
  location = {Berkeley, California, USA},
  series = {MobiCom '95},
  month = nov
}

@article{1995-Balakrishnan-winet,
	abstract = {TCP is a reliable transport protocol tuned to perform well in traditional networks where congestion is the primary cause of packet loss. However, networks with wireless links and mobile hosts incur significant losses due to bit-errors and handoffs. This environment violates many of the assumptions made by TCP, causing degraded end-to-end performance. In this paper, we describe the additions and modifications to the standard Internet protocol stack (TCP/IP) to improve end-to-end reliable transport performance in mobile environments. The protocol changes are made to network-layer software at the base station and mobile host, and preserve the end-to-end semantics of TCP. One part of the modifications, called the snoop module, caches packets at the base station and performs local retransmissions across the wireless link to alleviate the problems caused by high bit-error rates. The second part is a routing protocol that enables low-latency handoff to occur with negligible data loss. We have implemented this new protocol stack on a wireless testbed. Our experiments show that this system is significantly more robust at dealing with unreliable wireless links than normal TCP; we have achieved throughput speedups of up to 20 times over regular TCP and handoff latencies over 10 times shorter than other mobile routing protocols.},
	author = {Balakrishnan, Hari and Seshan, Srinivasan and Katz, Randy H.},
	date = {1995/12/01},
	doi = {10.1007/BF01985757},
	id = {Balakrishnan1995},
	isbn = {1572-8196},
	journal = {Wireless Networks},
	number = {4},
	pages = {469--481},
	title = {Improving reliable transport and handoff performance in cellular wireless networks},
	url = {https://doi.org/10.1007/BF01985757},
    note = {This is an extended and much-revised journal version of the
     Mobicom 1995 paper.  Significant changes include a better
     description of the protocol and sections on how the Daedalus
     low-latency multicast-based handoff protocol and the snoop
     protocol are integrated together.},
  category = "[Mobile, Wireless, TCP]",
	volume = {1},
	year = {1995},
  month = dec
}

@INPROCEEDINGS{1995-Le-compcon,
author={Le, M.T. and Burghardt, F. and Seshan, S. and Rabaey, J.},
booktitle={Digest of Papers. COMPCON'95. Technologies for the Information Superhighway},
title={InfoNet: The networking infrastructure of InfoPad},
year={1995},
volume={},
number={},
  category = "[Mobile]",
  month = Mar,
pages={163-168},
doi={10.1109/CMPCON.1995.512381},
url = {https://doi.org/10.1109/CMPCON.1995.512381}
}

@phdthesis{1995-Seshan-thesis,
  author = "Seshan, S.",
  title = {Low Latency Handoffs in Cellular Data Networks},
  school = "University of California at Berkeley",
  month = Dec,
  year = 1995,
  category = "[Mobile, Wireless]",
  summary = "",
}

@inproceedings{1996-Balakrishnan-sigcomm,
author = {Balakrishnan, Hari and Padmanabhan, Venkata N. and Seshan, Srinivasan and Katz, Randy H.},
title = {A Comparison of Mechanisms for Improving TCP Performance over Wireless Links},
year = {1996},
isbn = {0897917901},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/248156.248179},
doi = {10.1145/248156.248179},
abstract = {Reliable transport protocols such as TCP are tuned to perform well in traditional networks where packet losses occur mostly because of congestion. However, networks with wireless and other lossy links also suffer from significant non-congestion-related losses due to reasons such as bit errors and handoffs. TCP responds to all losses by invoking congestion control and avoidance algorithms, resulting in degraded end-to-end performance in wireless and lossy systems. In this paper, we compare several schemes designed to improve the performance of TCP in such networks. These schemes are classified into three broad categories: end-to-end protocols, where the sender is aware of the wireless link; link-layer protocols, that provide local reliability; and split-connection protocols, that break the end-to-end connection into two parts at the base station. We present the results of several experiments performed in both LAN and WAN environments, using throughput and goodput as the metrics for comparison.Our results show that a reliable link-layer protocol with some knowledge of TCP provides very good performance. Furthermore, it is possible to achieve good performance without splitting the end-to-end connection at the base station. We also demonstrate that selective acknowledgments and explicit loss notifications result in significant performance improvements.},
booktitle = SIGCOMM,
pages = {256–269},
numpages = {14},
location = {Palo Alto, California, USA},
  category = "[Mobile, Wireless, TCP]",
series = {SIGCOMM '96},
month = aug
}

@ARTICLE{1996-Narayanaswamy-pcs,
author={Narayanaswamy, S. and Seshan, S. and Amir, E. and Brewer, E. and Brodersen, R.W. and Burghardt, F. and Burstein, A. and Yuan-Chi Chang and Fox, A. and Gilbert, J.M. and Han, R. and Katz, R.H. and Long, A.C. and Messerschmitt, D.G. and Rabaey, J.M.},
journal=IEEEPCS,
title={A low-power, lightweight unit to provide ubiquitous information access application and network support for InfoPad},
year={1996},
volume={3},
number={2},
pages={4-17},
url = {https://doi.org/10.1109/98.490749},
  category = "[Mobile]",
doi={10.1109/98.490749},
month = apr
}

@inproceedings{1997-Balakrishnan-allerton,
  author = "H. Balakrishnan and V. N. Padmanabhan and S. Seshan and M. Stemm and
            E. Amir and R. H. Katz",
  title = {TCP Improvements for Heterogeneous Networks: The Daedalus
            Approach},
  booktitle = {Allerton Conference on Communication, Control},
  month = Oct,
  address = {Urbana, IL},
  year = 1997,
  category = "[Mobile, Wireless, TCP]",
  summary = "",
}

@inproceedings{1997-Balakrishnan-sigmetrics,
author = {Balakrishnan, Hari and Stemm, Mark and Seshan, Srinivasan and Katz, Randy H.},
title = {Analyzing Stability in Wide-Area Network Performance},
year = {1997},
month = Jun,
isbn = {0897919092},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/258612.258631},
doi = {10.1145/258612.258631},
abstract = {The Internet is a very large scale, complex, dynamical system that is hard to model and analyze. In this paper, we develop and analyze statistical models for the observed end-to-end network performance based on extensive packet-level traces (consisting of approximately 1.5 billion packets) collected from the primary Web site for the Atlanta Summer Olympic Games in 1996. We find that observed mean throughputs for these transfers measured over 60 million complete connections vary widely as a function of end-host location and time of day, confirming that the Internet is characterized by a large degree of heterogeneity. Despite this heterogeneity, we find (using best-fit linear regression techniques) that we can express the throughput for Web transfers to most hosts as a random variable with a log-normal distribution. Then, using observed throughput as the control parameter, we attempt to quantify the spatial (statistical similarity across neighboring hosts) and temporal (persistence over time) stability of network performance. We find that Internet hosts that are close to each other often have almost identically distributed probability distributions of throughput. We also find that throughputs to individual hosts often do not change appreciably for several minutes. Overall, these results indicate that there is promise in protocol mechanisms that cache and share network characteristics both within a single host and amongst nearby hosts.},
booktitle = SIGMETRICS,
pages = {2–12},
numpages = {11},
location = {Seattle, Washington, USA},
series = {SIGMETRICS '97},
  category = "[Measurement, Prediction]",
}

@article{1997-Balakrishnan-ton,
author = {Balakrishnan, Hari and Padmanabhan, Venkata N. and Seshan, Srinivasan and Katz, Randy H.},
title = {A Comparison of Mechanisms for Improving TCP Performance over Wireless Links},
year = {1997},
issue_date = {Dec. 1997},
publisher = {IEEE Press},
volume = {5},
number = {6},
issn = {1063-6692},
url = {https://doi.org/10.1109/90.650137},
doi = {10.1109/90.650137},
journal = TON,
month = dec,
pages = {756–769},
numpages = {14},
  note = {This is the extended and improved journal version of the
          SIGCOMM '96 paper.},
  category = "[Mobile, Wireless, TCP]",
keywords = {computer networks, wireless networks, TCP, internetworking, link-layer protocols}
}

@techreport{1997-Balakrishnan-tr-webtcp,
  author = "Balakrishnan, H. and Padmanabhan, V. N. and Seshan, S. and
            Stemm, M. and Katz, R.H.",
  title = {TCP Behavior of a Busy Web Server: Analysis and Improvements},
  number = "UCB/CSD-97-966",
  institution = "University of California at Berkeley",
  month = Jul,
  year = 1997,
  category = "[Congestion Control, TCP]",
  summary = "",
}

@article{1997-Seshan-kluwer,
 author = {S. Seshan and Hari Balakrishnan and Randy H. Katz},
 title = {Handoffs in Cellular Wireless Networks: The Daedalus Implementation and Experience},
 volume = {4},
 number = {2},
 year = {1997},
 issn = {0929-6212},
 pages = {141--162},
 url = {https://doi.org/10.1023/A:1008830311723},
 journal = {Wireless Personal Networks},
 publisher = {Springer Netherlands},
 address = {Hingham, MA},
  month = Jan,
  category = "[Mobile, Wireless]",
  summary = "",
}

@inproceedings{1997-Seshan-usits,
  author = {Srinivasan Seshan and Mark Stemm and Randy H. Katz},
  title = {{SPAND}: Shared Passive Network Performance Discovery},
  booktitle = {USENIX Symposium on Internet Technologies and Systems (USITS 97)},
  month = Dec,
  address = {Monterey, CA},
  year = 1997,
  publisher = {USENIX Association},
  pages={135--146},
  category = "[Measurement, Prediction, Adaptive Applications]",
  url = {https://www.usenix.org/conference/usits-97/spand-shared-passive-network-performance-discovery},
  summary = "",
}

@INPROCEEDINGS{1998-Balakrishnan-infocom,
author={Balakrishnan, H. and Padmanabhan, V.N. and Seshan, S. and Stemm, M. and Katz, R.H.},
booktitle=INFOCOM,
title={TCP behavior of a busy Internet server: analysis and improvements},
year={1998},
volume={1},
number={},
  category = "[Congestion Control, TCP]",
  month = Mar,
pages={252-262 vol.1},
doi={10.1109/INFCOM.1998.659661},
url = {https://doi.org/10.1109/INFCOM.1998.659661},
}

@ARTICLE{1998-Brewer-pcs,
author={Brewer, E.A. and Katz, R.H. and Chawathe, Y. and Gribble, S.D. and Hodes, T. and Giao Nguyen and Stemm, M. and Henderson, T. and Amir, E. and Balakrishnan, H. and Fox, A. and Padmanabhan, V.N. and Seshan, S.},
journal=IEEEPCS,
title={A network architecture for heterogeneous mobile computing},
year={1998},
  month = Oct,
  category = "[Mobile, Adaptive Applications]",
volume={5},
number={5},
pages={8-24},
doi={10.1109/98.729719},
url = {https://doi.org/10.1109/98.729719}
}

@inproceedings{1998-Seshan-globalinet,
  author={Seshan, Srinivasan and Stemm, Mark and Katz, Randy H},
  title = {Benefits of Transparent Content Negotiation in HTTP},
  booktitle={IEEE Globcom 98 Internet Mini-Conference},
  month = Nov,
  geography = {Sydney, Australia},
  year = 1998,
  category = "[Measurement, Prediction, Adaptive Applications]",
  summary = "",
}

@InBook{1999-Balakrishnan-mobility,
 author = 	 {Balakrishnan, H. and Padmanabhan, V. N. and Seshan, S. and
                 Stemm, M. and Katz, R.H.},
 editor = 	 {Dejan Milojicic and Frederic Douglis and Richard Wheeler},
 booktitle = 	 {Mobility: Processes, Computers, and Agents},
 title = {A Comparison of Mechanisms for Improving TCP Performance over Wireless Links},
 chapter = 	 {10.4},
 publisher = 	 {Addison-Wesley},
 year = 	 {1999},
 month = 	 {February},
 pages = 	 {401-419},
 note = 	 {also in IEEE/ACM Transactions on Networking 5(6):756-769},
  category = "[Mobile, Wireless, TCP]",
 summary = "",
}

@inproceedings{1999-Balakrishnan-sigcomm,
author = {Balakrishnan, Hari and Rahul, Hariharan S. and Seshan, Srinivasan},
title = {An Integrated Congestion Management Architecture for Internet Hosts},
year = {1999},
isbn = {1581131356},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/316188.316220},
doi = {10.1145/316188.316220},
abstract = {This paper presents a novel framework for managing network congestion from an end-to-end perspective. Our work is motivated by trends in traffic patterns that threaten the long-term stability of the Internet. These trends include the use of multiple independent concurrent flows by Web applications and the increasing use of transport protocols and applications that do not adapt to congestion. We present an end-system architecture centered around a Congestion Manager (CM) that ensures proper congestion behavior and allows applications to easily adapt to network congestion. Our framework integrates congestion management across all applications and transport protocols. The CM maintains congestion parameters and exposes an API to enable applications to learn about network characteristics, pass information to the CM, and schedule data transmissions. Internally, it uses a window-based control algorithm, a scheduler to regulate transmissions, and a lightweight protocol to elicit feedback from receivers.We describe how TCP and an adaptive real-time streaming audio application can be implemented using the CM. Our simulation results show that an ensemble of concurrent TCP connections can effectively share bandwidth and obtain consistent performance, without adversely affecting other network flows. Our results also show that the CM enables audio applications to adapt to congestion conditions without having to perform congestion control or bandwidth probing on their own. We conclude that the CM provides a useful and pragmatic framework for building adaptive Internet applications.},
booktitle = SIGCOMM,
pages = {175–187},
numpages = {13},
location = {Cambridge, Massachusetts, USA},
  category = "[Congestion Control, TCP]",
series = {SIGCOMM '99},
month = aug
}

@inproceedings{1999-Balakrishnan-smartenv,
  author = {H. Balakrishnan and S. Seshan and P. Bhagwat and F. Kaashoek},
  title = {Self-Organizing Collaborative Environments},
  booktitle = {NSF/DARPA/NIST Workshop on Smart Environments},
  month = Jul,
  year = 1999,
  address = {Atlanta, GA},
  category = "[Mobile]",
  summary = "",
}

@techreport{1999-Balakrishnan-tr-cm,
  author = "Balakrishnan, H. and Rahul, H. S. and Seshan, S.",
  title = {An Integrated Congestion Management Architecture for Internet
            Hosts},
  number = "MIT-LCS-TR-771",
  institution = "Massachusetts Institute of Technology",
  month = Feb,
  year = 1999,
  category = "[Congestion Control, TCP]",
  summary = "",
}

@INPROCEEDINGS{1999-Rahul-hotos,
author={Rahul, H.S. and Balakrishnan, H. and Seshan, S.},
booktitle=HOTOS,
title={An end-system architecture for unified congestion management},
year={1999},
  month = Mar,
  category = "[Congestion Control, TCP]",
volume={},
number={},
pages={52-57},
doi={10.1109/HOTOS.1999.798377},
url = {https://doi.org/10.1109/HOTOS.1999.798377}
}

@inproceedings{2000-Andersen-osdi,
author = {Andersen, David and Bansal, Deepak and Curtis, Dorothy and Seshan, Srinivasan and Balakrishnan, Hari},
title = {System Support for Bandwidth Management and Content Adaptation in Internet Applications},
year = {2000},
publisher = {USENIX Association},
address = {USA},
abstract = {This paper describes the implementation and evaluation of an operating system module, the Congestion Manager (CM), which provides integrated network flow management and exports a convenient programming interface that allows applications to be notified of, and adapt to, changing network conditions. We describe the API by which applications interface with the CM, and the architectural considerations that factored into the design. To evaluate the architecture and API, we describe our implementations of TCP; a streaming layered audio/video application; and an interactive audio application using the CM, and show that they achieve adaptive behavior without incurring much end-system overhead. All flows including TCP benefit from the sharing of congestion information, and applications are able to incorporate new functionality such as congestion control and adaptive behavior.},
booktitle = OSDI,
articleno = {15},
location = {San Diego, California},
url = {https://www.usenix.org/conference/osdi-2000/system-support-bandwidth-management-and-content-adaptation-internet},
  category = "[Congestion Control, TCP]",
series = {OSDI'00},
month = oct
}

@inproceedings{2000-Lilley-mobicom,
author = {Lilley, Jeremy and Yang, Jason and Balakrishnan, Hari and Seshan, Srinivasan},
title = {A Unified Header Compression Framework for Low-Bandwidth Links},
year = {2000},
isbn = {1581131976},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/345910.345933},
doi = {10.1145/345910.345933},
abstract = {Compressing protocol headers has traditionally been an attractive way of conserving bandwidth over low-speed links, including those in wireless systems. However, despite the growth in recent years in the number of end-to-end protocols beyond TCP/IP, header compression deployment for those protocols has not kept pace. This is in large part due to complexities in implementation, which often requires a detailed knowledge of kernel internals, and a lack of a common way of pursuing the general problem across a variety of end-to-end protocols. To address this, rather than defining several new protocol-specific standards, we present a unified framework for header compression. This framework includes a simple, platform-independent header description language that protocol implementors can use to describe high-level header properties, and a platform-specific code generation tool that produces kernel source code automatically from this header specification. Together, the high-level description language and code generator free protocol designers from having to understand any details of the target platform, enabling them to implement header compression with relatively little effort. We analyze the performance of compression produced using this framework for TCP/IP in the Linux 2.0 kernel and demonstrate that unified, automatically-generated header compression without significant performance penalty is viable.},
booktitle = MOBICOM,
pages = {131–142},
numpages = {12},
location = {Boston, Massachusetts, USA},
  award = {Best Student Paper Award},
  category = "[Mobile]",
series = {MobiCom '00},
month = aug
}

@INPROCEEDINGS{2000-Seshan-infocom,
author={Stemm, M. and Katz, R. and Seshan, S.},
booktitle=INFOCOM,
title={A network measurement architecture for adaptive applications},
year={2000},
volume={1},
number={},
pages={285-294 vol.1},
address = {Tel Aviv, Israel},
doi={10.1109/INFCOM.2000.832198},
url = {https://doi.org/10.1109/INFCOM.2000.832198},
  category = "[Measurement, Prediction, Adaptive Applications]",
month = mar
}

@techreport{2001-Akella-tr-falseshare,
  author = "A. Akella and S. Seshan and H. Balakrishnan",
  title = {The Impact of False Sharing on Shared Congestion Management},
  number = "CMU-CS-01-135",
  institution = "Carnegie Mellon University",
  location = {Pittsburgh, PA},
  month = Jul,
  year = 2001,
  category = "[Congestion Control, TCP]",
  summary = "",
}

@manual{2001-Balakrishnan-rfc3124,
  author = "Balakrishnan, H. and Seshan, S.",
  title = {The Congestion Manager, RFC 3124},
  note = {RFC 3124},
  organization= {Internet Engineering Task Force},
  month = Jun,
  year = 2001,
  category = "[Congestion Control, TCP]",
  summary = "",
}

@inproceedings{2001-Chu-sigcomm,
author = {Chu, Yang and Rao, Sanjay and Seshan, Srinivasan and Zhang, Hui},
title = {Enabling Conferencing Applications on the Internet Using an Overlay Muilticast Architecture},
year = {2001},
isbn = {1581134118},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/383059.383064},
doi = {10.1145/383059.383064},
abstract = {In response to the serious scalability and deployment concerns with IP Multicast, we and other researchers have advocated an alternate architecture for supporting group communication applications over the Internet where all multicast functionality is pushed to the edge. We refer to such an architecture as End System Multicast. While End System Multicast has several potential advantages, a key concern is the performance penalty associated with such a design. While preliminary simulation results conducted in static environments are promising, they have yet to consider the challenging performance requirements of real world applications in a dynamic and heterogeneous Internet environment.In this paper, we explore how Internet environments and application requirements can influence End System Multicast design. We explore these issues in the context of audio and video conferencing: an important class of applications with stringent performance requirements. We conduct an extensive evaluation study of schemes for constructing overlay networks on a wide-area test-bed of about twenty hosts distributed around the Internet. Our results demonstrate that it is important to adapt to both latency and bandwidth while constructing overlays optimized for conferencing applications. Further, when relatively simple techniques are incorporated into current self-organizing protocols to enable dynamic adaptation to latency and bandwidth, the performance benefits are significant. Our results indicate that End System Multicast is a promising architecture for enabling performance-demanding conferencing applications in a dynamic and heterogeneous Internet environment.},
booktitle = SIGCOMM,
pages = {55–67},
numpages = {13},
  month = Aug,
  category = "[Overlay, P2P, Video]",
location = {San Diego, California, USA},
series = {SIGCOMM '01}
}

@inproceedings{2001-Nahum-sigmetrics,
author = {Nahum, Erich M. and Rosu, Marcel-Catalin and Seshan, Srinivasan and Almeida, Jussara},
title = {The Effects of Wide-Area Conditions on WWW Server Performance},
  month = Jun,
year = {2001},
isbn = {1581133340},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/378420.378790},
doi = {10.1145/378420.378790},
abstract = {WWW workload generators are used to evaluate web server performance, and thus have a large impact on what performance optimizations are applied to servers. However, current benchmarks ignore a crucial component: how these servers perform in the environment in which they are intended to be used, namely the wide-area Internet.This paper shows how WAN conditions can affect WWW server performance. We examine these effects using an experimental test-bed which emulates WAN characteristics in a live setting, by introducing factors such as delay and packet loss in a controlled and reproducible fashion. We study how these factors interact with the host TCP implementation and what influence they have on web server performance. We demonstrate that when more realistic wide-area conditions are introduced, servers exhibit very different performance properties and scaling behaviors, which are not exposed by existing benchmarks running on LANs. We show that observed throughputs can give misleading information about server performance, and thus find that maximum throughput, or capacity, is a more useful metric. We find that packet losses can reduce server capacity by as much as 50 percent and increase response time as seen by the client. We show that using TCP SACK can reduce client response time, without reducing server capacity.},
booktitle = SIGMETRICS,
pages = {257–267},
numpages = {11},
category = "[Measurement]",
location = {Cambridge, Massachusetts, USA},
series = {SIGMETRICS '01}
}

@inproceedings{2001-Raman-saint,
  author = "Bhaskaran Raman and Pravin Bhagwat and Srinivasan Seshan",
  title = {Arguments for Cross-Layer Optimizations in Bluetooth Scatternets},
  month = Jan,
  year = 2001,
  address = {San Diego, CA},
  summary = "",
  booktitle={2001 Symposium on Applications and the Internet (SAINT'01)},
  pages={176-184},
  doi={10.1109/SAINT.2001.905181},
  category = "[Mobile]",
  url = {https://doi.org/10.1109/SAINT.2001.905181}
}

@article{2002-Akella-ccr-falsesharing,
author = {Akella, Aditya and Seshan, Srinivasan},
title = {The Impact of False Sharing on Shared Congestion Management},
year = {2002},
issue_date = {January 2002},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {32},
number = {1},
issn = {0146-4833},
url = {https://doi.org/10.1145/510726.510744},
doi = {10.1145/510726.510744},
abstract = {Recently, several proposals have been made for sharing congestion information across concurrent flows between end-systems. In these proposals, the granularity for sharing has ranged from all flows to a common host to all hosts on a shared LAN. While these proposals have been successful at ensuring sound AIMD behavior of the aggregate of flows, they suffer from what we term "false sharing". False sharing occurs when two or more flows sharing congestion state may, in fact, not share the same bottleneck.In this work, we investigate the effects of false sharing on shared congestion management schemes. We characterize the origins of false sharing into two distinct cases: (i) networks with QoS enhancements such as differentiated services, where a flow classifier segregates flows into different queues, and (ii) networks with path diversity where different flows to the same destination address are routed differently --- a situation that occurs in dispersity routing, load-balancing, and with network address translators (NATs). We evaluate the impact of false sharing on flow performance and consider whether it might cause a bottleneck link to become persistently overloaded. We propose schemes for detecting false sharing and show how different metrics (loss rate, delay distribution, and reordering) compare for this purpose. We also consider the issue of how a sender should respond when it detects false sharing.},
journal = CCR,
  category = "[Congestion Control, TCP]",
month = jan,
pages = {70},
numpages = {1}
}

@inproceedings{2002-Akella-sigcomm,
author = {Akella, Aditya and Seshan, Srinivasan and Karp, Richard and Shenker, Scott and Papadimitriou, Christos},
title = {Selfish Behavior and Stability of the Internet: A Game-Theoretic Analysis of TCP},
year = {2002},
isbn = {158113570X},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/633025.633037},
doi = {10.1145/633025.633037},
abstract = {For years, the conventional wisdom [7, 22] has been that the continued stability of the Internet depends on the widespread deployment of "socially responsible" congestion control. In this paper, we seek to answer the following fundamental question: If network end-points behaved in a selfish manner, would the stability of the Internet be endangered?.We evaluate the impact of greedy end-point behavior through a game-theoretic analysis of TCP. In this "TCP Game" each flowattempts to maximize the throughput it achieves by modifying its congestion control behavior. We use a combination of analysis and simulation to determine the Nash Equilibrium of this game. Our question then reduces to whether the network operates efficiently at these Nash equilibria.Our findings are twofold. First, in more traditional environments -- where end-points use TCP Reno-style loss recovery and routers use drop-tail queues -- the Nash Equilibria are reasonably efficient. However, when endpoints use more recent variations of TCP (e.g., SACK) and routers employ either RED or drop-tail queues, the Nash equilibria are very inefficient. This suggests that the Internet of the past could remain stable in the face of greedy end-user behavior, but the Internet of today is vulnerable to such behavior. Second, we find that restoring the efficiency of the Nash equilibria in these settings does not require heavy-weight packet scheduling techniques (e.g., Fair Queuing) but instead can be done with a very simple stateless mechanism based on CHOKe [21].},
booktitle = SIGCOMM,
pages = {117–130},
numpages = {14},
location = {Pittsburgh, Pennsylvania, USA},
  category = "[Congestion Control, TCP]",
  month = Aug,
series = {SIGCOMM '02}
}

@inproceedings{2002-Akella-sigcomm-lowpower,
  author = "A. Akella and R. Balan and S. Seshan",
  title = {Protocols for Low Power},
  booktitle = "Poster and Short Paper in ACM Sigcomm CCR",
  address = {San Diego, CA},
  month = Jan,
  year = 2002,
category = "[Mobile]",
  summary = "",
}

@techreport{2002-Akella-tr-multimodal,
  author = "A. Akella and A. Bharambe and S. Nath and S. Seshan",
  title = {Multi-Modal Network Protocols: Adapting to Highly Variable Operating Conditions},
  number = "CMU-CS-02-170",
  institution = "Carnegie Mellon University",
  location = {Pittsburgh, PA},
  year = 2002,
  category = "[Congestion Control, TCP]",
  summary = "",
  month = aug
}

@article{2002-Balan-ccr-multimodal,
author = {Balan, Rajesh Krishna and Akella, Aditya and Seshan, Srini},
title = {Multi-Modal Network Protocols},
year = {2002},
issue_date = {January 2002},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {32},
number = {1},
issn = {0146-4833},
url = {https://doi.org/10.1145/510726.510734},
doi = {10.1145/510726.510734},
abstract = {Many of the basic parameters of a ubiquitous computing environment are highly variable. For example, rate of mobility, quality of wireless communication, density of communicating nodes, power constraints and computational constraints all vary greatly from situation to situation. Unfortunately, existing routing protocols, transport protocols and adaptive applications can only adapt in a limited way. One feature that is missing from many systems is the ability to identify gross operating conditions and take on very different modes of operation. Such adaptability would improve the efficiency of many solutions. We use the term multi-modal protocols to describe systems that adapt in this way. We have explored two such systems: Wireless TCP and Overlay Routing.},
journal = CCR,
month = jan,
pages = {60},
note = "poster",
  category = "[Congestion Control, TCP]",
numpages = {1}
}

@inproceedings{2002-Bharambe-netgames,
author = {Bharambe, Ashwin R. and Rao, Sanjay and Seshan, Srinivasan},
title = {Mercury: A Scalable Publish-Subscribe System for Internet Games},
year = {2002},
isbn = {1581134932},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/566500.566501},
doi = {10.1145/566500.566501},
abstract = {Today's network games suffer from scalability and performance limitations caused by centralized client-server architectures and/or broadcast communication. In this paper, we argue that the communication between components of a game can be modeled as a publish-subscribe system. We present the design of MERCURY, a completely distributed publish-subscribe system, which supports a content-based publish-subscribe model of communication and performs distributed matching using a novel content-based routing protocol. We also present preliminary simulation results identifying key design decisions affecting the scalability and network efficiency of the system.},
booktitle = {Workshop on Network and System Support for Games},
pages = {3–9},
numpages = {7},
location = {Braunschweig, Germany},
  month = Apr,
  category = "[Overlay, P2P, Games]",
series = {NetGames '02}
}

@article{2002-Chu-jsac,
  author = "Yang-hua Chu and S. G. Rao and S. Seshan and H. Zhang",
  title = {A Case for End-System Multicast},
  journal = "IEEE Journal on Selected Areas in Communications special issue on Network Support for Multicast Communications",
  volume = 20,
  number = 8,
  month = Oct,
  year = 2002,
  category = "[Overlay, P2P, Video]",
  summary = "",
  pages={1456-1471},
  doi={10.1109/JSAC.2002.803066},
  url = {https://doi.org/10.1109/JSAC.2002.803066}
}

@inproceedings{2002-Pan-globalinet,
  author = "J. Pan and S.Seshan and C. Faloutsos",
  title = {Fast Correlation-Aware Sampling for Network Data Mining},
  booktitle={Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE},
  month = Nov,
  geography = {Taipei, Taiwan},
  year = 2002,
  category = "Misc",
  summary = "",
  volume={3},
  number={},
  pages={2155-2159 vol.3},
  doi={10.1109/GLOCOM.2002.1189013},
    category = "[Measurements]",
  url = {https://doi.org/10.1109/GLOCOM.2002.1189013}
}

@inproceedings{2003-Agrawal-hotos,
  author = {Mukesh Agrawal and Srinivasan Seshan},
  title = {Development Tools for Distributed Applications},
  booktitle = HOTOS,
  month = May,
  year = 2003,
  address = {Lihue, HI},
  category = "[Management, Overlay, P2P, Evolution]",
  summary = "",
  url = {https://www.usenix.org/conference/hotos-ix/development-tools-distributed-applications},
}

@inproceedings{2003-Agrawal-infocom,
  author={Mukesh Agrawal and Manjhi, A. and Bansal, N. and Srinivasan Seshan},
  title = {Improving Web Performance in Broadcast-Unicast Networks},
  booktitle=INFOCOM,
  month = Apr,
  year = 2003,
  address = {San Francisco, CA},
  category = "[Multipath, Content Aware Networks]",
  summary = "",
  volume={1},
  number={},
  pages={229-239 vol.1},
  doi={10.1109/INFCOM.2003.1208675},
  url = {https://doi.org/10.1109/INFCOM.2003.1208675}
}

@inproceedings{2003-Akella-icnp,
  author = "A. Akella and S. Seshan and H. Balakrishnan",
  title = {The Impact of False Sharing on Shared Congestion Management},
  booktitle={11th IEEE International Conference on Network Protocols},
  address = {Atlanta, GA},
  month = Nov,
  year = 2003,
  category = "[Congestion Control, TCP]",
  summary = "",
  doi={10.1109/ICNP.2003.1249759},
  url = {https://doi.org/10.1109/ICNP.2003.1249759}
}

@inproceedings{2003-Akella-imc,
author = {Akella, Aditya and Seshan, Srinivasan and Shaikh, Anees},
title = {An Empirical Evaluation of Wide-Area Internet Bottlenecks},
year = {2003},
isbn = {1581137737},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/948205.948219},
doi = {10.1145/948205.948219},
abstract = {Conventional wisdom has been that the performance limitations in the current Internet lie at the edges of the network -- i.e last mile connectivity to users, or access links of stub ASes. As these links are upgraded, however, it is important to consider where new bottlenecks and hot-spots are likely to arise. In this paper, we address this question through an investigation of non-access bottlenecks. These are links within carrier ISPs or between neighboring carriers that could potentially constrain the bandwidth available to long-lived TCP flows. Through an extensive measurement study, we discover, classify, and characterize bottleneck links (primarily in the U.S.) in terms of their location, latency, and available capacity.We find that about 50\% of the Internet paths explored have a non-access bottleneck with available capacity less than 50 Mbps, many of which limit the performance of well-connected nodes on the Internet today. Surprisingly, the bottlenecks identified are roughly equally split between intra-ISP links and peering links between ISPs. Also, we find that low-latency links, both intra-ISP and peering, have a significant likelihood of constraining available bandwidth. Finally, we discuss the implications of our findings on related issues such as choosing an access provider and optimizing routes through the network. We believe that these results could be valuable in guiding the design of future network services, such as overlay routing, in terms of which links or paths to avoid (and how to avoid them) in order to improve performance.},
booktitle = IMC,
pages = {101–114},
numpages = {14},
location = {Miami Beach, FL, USA},
  category = "[Measurement, Multipath]",
  month = Oct,
series = {IMC '03}
}

@inproceedings{2003-Akella-mpds,
  author = {A. Akella and A. Bharambe and M. Reiter and S. Seshan},
  title = {Detecting DDoS Attacks on ISP Networks},
  booktitle = {ACM SIGMOD/PODS Workshop on Management and Processing of Data Streams (MPDS) FCRC 2003},
  month = Jun,
  year = 2003,
  address = {San Diego, CA},
  category = "[Measurement]",
  summary = "",
}

@inproceedings{2003-Akella-nymetro,
  author = "A. Akella and S. Seshan and A. Shaikh",
  title = {Toward Representative Internet Measurements},
  booktitle = {New York Metro Area Networking Workshop},
  address = "New York, NY",
  month = Sep,
  year = 2003,
  category = "[Measurement]",
  summary = "",
}

@inproceedings{2003-Akella-podc,
author = {Akella, Aditya and Chawla, Shuchi and Kannan, Arvind and Seshan, Srinivasan},
title = {Scaling Properties of the Internet Graph},
year = {2003},
isbn = {1581137087},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/872035.872087},
doi = {10.1145/872035.872087},
abstract = {As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added each day. Although the speeds of links in the core and at the edges roughly improve according to Moore's law, this improvement alone might not be enough. Indeed, the structure of the Internet graph and routing in the network might necessitate much faster improvements in the speeds of key links in the network.In this paper, using a combination of analysis and extensive simulations, we show that the worst congestion in the Internet in fact scales poorly with the network size (n1+Ω(1), where n is the number of nodes), when shortest-path routing is used. We also show, somewhat surprisingly, that policy-based routing does not exacerbate the maximum congestion when compared to shortest-path routing.Our results show that it is crucial to identify ways to alleviate this congestion to avoid some links from being perpetually congested. To this end, we show that the congestion scaling properties of the Internet graph can be improved dramatically by introducing moderate amounts of redundancy in the graph in terms of parallel edges between pairs of adjacent nodes.},
booktitle = {Symposium on Principles of Distributed Computing (PODC)},
pages = {337–346},
numpages = {10},
   month = Jul,
keywords = {shortest path routing, policy routing, congestion, power-law distribution},
location = {Boston, Massachusetts},
series = {PODC '03},
  category = "[Measurement, Multipath, Congestion Control]",
}

@inproceedings{2003-Akella-sigcomm,
author = {Akella, Aditya and Maggs, Bruce and Seshan, Srinivasan and Shaikh, Anees and Sitaraman, Ramesh},
title = {A Measurement-Based Analysis of Multihoming},
year = {2003},
isbn = {1581137354},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/863955.863995},
doi = {10.1145/863955.863995},
abstract = {Multihoming has traditionally been employed by stub networks to enhance the reliability of their network connectivity. With the advent of commercial "intelligent route control" products, stubs now leverage multihoming to improve performance. Although multihoming is widely used for reliability and, increasingly for performance, not much is known about the tangible benefits that multihoming can offer, or how these benefits can be fully exploited. In this paper, we aim to quantify the extent to which multihomed networks can leverage performance and reliability benefits from connections to multiple providers. We use data collected from servers belonging to the Akamai content distribution network to evaluate performance benefits from two distinct perspectives of multihoming: high-volume content-providers which transmit large volumes of data to many distributed clients, and enterprises which primarily receive data from the network. In both cases, we find that multihoming can improve performance significantly and that not choosing the right set of providers could result in a performance penalty as high as 40\%. We also find evidence of diminishing returns in performance when more than four providers are considered for multihoming. In addition, using a large collection of measurements, we provide an analysis of the reliability benefits of multihoming. Finally, we provide guidelines on how multihomed networks can choose ISPs, and discuss practical strategies of using multiple upstream connections to achieve optimal performance benefits.},
booktitle = SIGCOMM,
pages = {353–364},
numpages = {12},
  month = Aug,
  category = "[Measurement, Multipath]",
location = {Karlsruhe, Germany},
series = {SIGCOMM '03}
}

@inproceedings{2003-Deshpande-sigmod,
author = {Deshpande, Amol and Nath, Suman and Gibbons, Phillip B. and Seshan, Srinivasan},
title = {Cache-and-Query for Wide Area Sensor Databases},
year = {2003},
isbn = {158113634X},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/872757.872818},
doi = {10.1145/872757.872818},
abstract = {Webcams, microphones, pressure gauges and other sensors provide exciting new opportunities for querying and monitoring the physical world. In this paper we focus on querying wide area sensor databases, containing (XML) data derived from sensors spread over tens to thousands of miles. We present the first scalable system for executing XPATH queries on such databases. The system maintains the logical view of the data as a single XML document, while physically the data is fragmented across any number of host nodes. For scalability, sensor data is stored close to the sensors, but can be cached elsewhere as dictated by the queries. Our design enables self starting distributed queries that jump directly to the lowest common ancestor of the query result, dramatically reducing query response times. We present a novel query-evaluate gather technique (using XSLT) for detecting (1) which data in a local database fragment is part of the query result, and (2) how to gather the missing parts. We define partitioning and cache invariants that ensure that even partial matches on cached data are exploited and that correct answers are returned, despite our dynamic query-driven caching. Experimental results demonstrate that our techniques dramatically increase query throughputs and decrease query response times in wide area sensor databases.},
booktitle = {ACM SIGMOD International Conference on Management of Data (SIGMOD)},
pages = {503–514},
numpages = {12},
   month = Jun,
  category = "[Sensor Networks]",
location = {San Diego, California},
series = {SIGMOD '03}
}

@inproceedings{2003-Deshpande-sigmod-poster,
author = {Deshpande, Amol and Nath, Suman and Gibbons, Phillip B. and Seshan, Srinivasan},
title = {IrisNet: Internet-Scale Resource-Intensive Sensor Services},
year = {2003},
isbn = {158113634X},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/872757.872856},
doi = {10.1145/872757.872856},
booktitle = SIGMOD,
pages = {667},
numpages = {1},
notes = {poster},
location = {San Diego, California},
series = {SIGMOD '03},
  category = "[Sensor Networks]",

month = jun
}

@article{2003-Gibbons-pervasive,
  author={Gibbons, P.B. and Karp, B. and Ke, Y. and Nath, S. and Srinivasan Seshan},
  title={IrisNet: an architecture for a worldwide sensor Web},
  journal={IEEE Pervasive Computing},
  month = Oct,
  year = 2003,
  category = "IrisNet",
  summary = "",
  volume={2},
  number={4},
  pages={22-33},
    category = "[Sensor Networks]",
  doi={10.1109/MPRV.2003.1251166},
  url = {https://doi.org/10.1109/MPRV.2003.1251166}
}

@article{2003-Nath-mc2r,
  author = "S.Nath and A. Deshpande and P. B. Gibbons and S. Seshan",
  title = {Mining a World of Smart Sensors},
  journal = MC2R,
  note = "short paper",
  volume = 7,
  number = 1,
  month = Jan,
  year = 2003,
  category = "[Sensor Networks]",
  summary = "",
}

@inproceedings{2003-Akella-sigmetrics,
author = {Akella, Aditya and Seshan, Srinivasan and Shaikh, Anees},
title = {An Empirical Evaluation of Wide-Area Internet Bottlenecks},
year = {2003},
isbn = {1581136641},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/781027.781075},
doi = {10.1145/781027.781075},
abstract = {Performance limitations in the current Internet are thought to lie at the edges of the network -- i.e last mile connectivity to users, or access links of stub ASes. As these links are upgraded, however, it is important to consider where new bottlenecks and hot-spots are likely to arise. Through an extensive measurement study, we discover, classify and characterize non-access bottleneck links in terms of their location, latency and available capacity. We find that nearly half of the paths explored have a non-access bottleneck with available capacity less than 50 Mbps. The bottlenecks identified are roughly equally split between intra-ISP links and links between ISPs. These results have implications on issues such as the choice of access providers and route optimization.},
booktitle = SIGMETRICS,
pages = {316–317},
note = {Short Paper},
numpages = {2},
keywords = {network measurement, bottleneck links},
location = {San Diego, CA, USA},
series = {SIGMETRICS '03},
  category = "[Measurement, Multipath]",
month = jun
}

@inproceedings{2003-Nath-sensys,
   author = "S. Nath and Y. Ke and A. Deshpande and P. B. Gibbons and B. Karp and S. Seshan",
   title = {IrisNet: An Architecture for Internet-scale Sensing Services},
   booktitle = SENSYS,
   note = "Demo and Short Paper",
   month = Nov,
   year = 2003,
   address = {Los Angeles, CA},
  category = "IrisNet",
    category = "[Sensor Networks]",
  summary = "",
}

@inproceedings{2003-Nath-sosp,
   author = "S. Nath and P. B. Gibbons and B. Karp and S. Seshan",
   title = {Adaptive Data Placement for Wide-Area Sensing Services},
   booktitle = "Poster in the 19th ACM SOSP Conference",
   month = Oct,
   year = 2003,
   address = {Bolton Landing, NY},
  category = "[Sensor Networks]",
  summary = "",
}

@inproceedings{2003-Nath-vldb,
author = {Nath, Suman and Deshpande, Amol and Ke, Yan and Gibbons, Phillip B. and Karp, Brad and Seshan, Srinivasan},
title = {IrisNet: An Architecture for Internet-Scale Sensing Services},
year = {2003},
isbn = {0127224424},
publisher = {VLDB Endowment},
abstract = {We demonstrate the design and an early prototype of IrisNet (Internet-scale Resource-Intensive Sensor Network services), a common, scalable networked infrastructure for deploying wide area sensing services. IrisNet is a potentially global network of smart sensing nodes, with webcams or other monitoring devices, and organizing nodes that provide the means to query recent and historical sensor-based data. IrisNet exploits the fact that high-volume sensor feeds are typically attached to devices with significant computing power and storage, and running a standard operating system. It uses aggressive filtering, smart query routing, and semantic caching to dramatically reduce network bandwidth utilization and improve query response times, as we demonstrate.Our demo will present two services built on Iris-Net, from two very different application domains. The first one, a parking space finder, utilizes webcams that monitor parking spaces to answer queries such as the availability of parking spaces near a user's destination. The second one, a distributed infrastructure monitor, uses measurement tools installed in individual nodes of a large distributed infrastructure to answer queries such as average network bandwidth usage of a set of nodes.},
booktitle = {International Conference on Very Large Data Bases},
pages = {1137–1140},
numpages = {4},
  category = "[Sensor Networks]",
   month = Sep,
note = "Demo and Short Paper",
location = {Berlin, Germany},
series = {VLDB '03}
}

@article{2004-Akella-ccr,
author = {Akella, Aditya and Chawla, Shuchi and Kannan, Arvind and Seshan, Srinivasan},
title = {On the Scaling of Congestion in the Internet Graph},
year = {2004},
issue_date = {July 2004},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {34},
number = {3},
issn = {0146-4833},
url = {https://doi.org/10.1145/1031134.1031141},
doi = {10.1145/1031134.1031141},
abstract = {As the Internet grows in size, it becomes crucial to understand how the speeds of links in the network must improve in order to sustain the pressure of new end-nodes being added each day. Although the speeds of links in the core and at the edges improve roughly according to Moore's law, this improvement alone might not be enough. Indeed, the structure of the Internet graph and routing in the network might necessitate much faster improvements in the speeds of key links in the network.In this paper, using a combination of analysis and extensive simulations, we show that the worst congestion in the Internet AS-level graph in fact scales poorly with the network size (<i>n</i><sup>1+ω(1)</sup>, where <i>n</i> is the number of nodes), when shortest-path routing is used to route traffic between ASes. We also show, somewhat surprisingly, that policy-based routing <i>does not</i> exacerbate the maximum congestion when compared to shortest-path routing.Our results show that it is crucial to identify ways to alleviate this congestion to avoid some links from being perpetually congested. To this end, we show that the congestion scaling properties of Internet-like graphs can be improved dramatically by introducing moderate amounts of redundancy in the graph in terms of parallel edges between pairs of adjacent nodes.},
journal = CCR,
month = jul,
pages = {43–56},
numpages = {14},
note = "Special Issue on Science of Network Design",
  category = "[Measurement, Multipath]",
keywords = {power-law graphs, congestion, shortest path routing}
}

@inproceedings{2004-Akella-sigcomm,
author = {Akella, Aditya and Pang, Jeffrey and Maggs, Bruce and Seshan, Srinivasan and Shaikh, Anees},
title = {A Comparison of Overlay Routing and Multihoming Route Control},
year = {2004},
isbn = {1581138628},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1015467.1015479},
doi = {10.1145/1015467.1015479},
abstract = {The limitations of BGP routing in the Internet are often blamed for poor end-to-end performance and prolonged connectivity interruptions. Recent work advocates using overlays to effectively bypass BGP's path selection in order to improve performance and fault tolerance. In this paper, we explore the possibility that intelligent control of BGP routes, coupled with ISP multihoming, can provide competitive end-to-end performance and reliability. Using extensive measurements of paths between nodes in a large content distribution network, we compare the relative benefits of overlay routing and multihoming route control in terms of round-trip latency, TCP connection throughput, and path availability. We observe that the performance achieved by route control together with multihoming to three ISPs (3-multihoming), is within 5-15% of overlay routing employed in conjunction 3-multihoming, in terms of both end-to-end RTT and throughput. We also show that while multihoming cannot offer the nearly perfect resilience of overlays, it can eliminate almost all failures experienced by a singly-homed end-network. Our results demonstrate that, by leveraging the capability of multihoming route control, it is not necessary to circumvent BGP routing to extract good wide-area performance and availability from the existing routing system.},
booktitle = SIGCOMM,
pages = {93–106},
numpages = {14},
  month = Aug,
  category = "[Measurement, Multipath, Overlay]",
keywords = {multihoming, overlay routing, route control},
location = {Portland, Oregon, USA},
series = {SIGCOMM '04}
}

@inproceedings{2004-Akella-usenix,
  author = "A. Akella and A. Shaikh and S. Seshan",
  title = {Multihoming Performance Benefits: An Experimental Evaluation of Practical Enterprise Strategies},
  booktitle = {USENIX Annual Technical Conference (ATC)},
  month = Jun,
  year = 2004,
  address = {Boston, MA},
  category = "[Multipath]",
  summary = "",
  url = {https://www.usenix.org/legacy/events/usenix04/tech/general/akella.html}
}

@inproceedings{2004-Bharambe-hotnets,
   author = "A. Bharambe and V. Padmanabhan and S. Seshan",
   title = {Supporting Spectators in Online Multiplayer Games},
   booktitle = HOTNETS,
   month = Nov,
   year = 2004,
   address = {San Diego, CA},
  category = "[Overlay, P2P, Games]",
  summary = "",
}

@inproceedings{2004-Bharambe-sigcomm,
author = {Bharambe, Ashwin R. and Agrawal, Mukesh and Seshan, Srinivasan},
title = {Mercury: Supporting Scalable Multi-Attribute Range Queries},
year = {2004},
isbn = {1581138628},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1015467.1015507},
doi = {10.1145/1015467.1015507},
abstract = {This paper presents the design of Mercury, a scalable protocol for supporting multi-attribute range-based searches. Mercury differs from previous range-based query systems in that it supports multiple attributes as well as performs explicit load balancing. To guarantee efficient routing and load balancing, Mercury uses novel light-weight sampling mechanisms for uniformly sampling random nodes in a highly dynamic overlay network. Our evaluation shows that Mercury is able to achieve its goals of logarithmic-hop routing and near-uniform load balancing.We also show that Mercury can be used to solve a key problem for an important class of distributed applications: distributed state maintenance for distributed games. We show that the Mercury-based solution is easy to use, and that it reduces the game's messaging overheard significantly compared to a na\{\i}ve approach.},
booktitle = SIGCOMM,
pages = {353–366},
numpages = {14},
keywords = {range queries, random sampling, load balancing, distributed hash tables, peer-to-peer systems},
location = {Portland, Oregon, USA},
  month = Aug,
category = "DistApps",
series = {SIGCOMM '04}
}

@inproceedings{2004-Nath-basenets,
   author = "S. Nath and Y. Ke and P. B. Gibbons and B. Karp and S. Seshan",
   title = {A Distributed Filtering Architecture for Multimedia Sensors},
   booktitle = {First Workshop on Broadband Advanced Sensor Networks (BaseNets)},
   month = Oct,
   year = 2004,
   address = {San Jose, CA},
   award = {Best Student Paper Award},
  category = "IrisNet",
  summary = "",
}

@inproceedings{2004-Nath-mobiwac,
author = {Nath, Suman and Anderson, Zachary and Seshan, Srinivasan},
title = {Choosing Beacon Periods to Improve Response Times for Wireless HTTP Clients},
year = {2004},
isbn = {1581139209},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1023783.1023792},
doi = {10.1145/1023783.1023792},
abstract = {The IEEE 802.11 wireless LAN standard power-saving mode (PSM) allows the network interface card (NIC) to periodically sleep between receiving data. In this paper, we show that 802.11 PSM performs poorly due to the fact that an access point is unable to adapt to the requirements of each client. Therefore, we propose a novel power saving algorithm, named Dynamic Beacon Period, where the access point uses different beacon periods for different clients. During HTTP downloads, each client carefully chooses a good beacon period for itself, based on the RTT of its current connections, and informs the access point of this beacon period. This technique enables download times for Web pages that are comparable to those without any power-saving and provides energy savings comparable to the standard 802.11 PSM. We show, using real-world measurements and emulation-based experiments, that it is feasible for both clients and access points to efficiently support such per-client beacon periods, instead of having a common, static beacon for all clients. The solution is simple enough that it can be implemented with just small enhancements to the existing 802.11 specification.},
booktitle = {Workshop on Mobility Management & Wireless Access Protocols (Mobiwac)},
pages = {43–50},
numpages = {8},
   month = Sep,
  category = "Misc",
keywords = {beacon periods, wireless access},
location = {Philadelphia, PA, USA},
series = {MobiWac '04}
}

@inproceedings{2004-Nath-sensys,
author = {Nath, Suman and Gibbons, Phillip B. and Seshan, Srinivasan and Anderson, Zachary R.},
title = {Synopsis Diffusion for Robust Aggregation in Sensor Networks},
year = {2004},
isbn = {1581138792},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1031495.1031525},
doi = {10.1145/1031495.1031525},
abstract = {Previous approaches for computing duplicate-sensitive aggregates in sensor networks (<i>e.g.</i>, in TAG) have used a tree topology, in order to conserve energy and to avoid double-counting sensor readings. However, a tree topology is not robust against node and communication failures, which are common in sensor networks. In this paper, we present <i>synopsis diffusion</i>, a general framework for achieving signi.cantly more accurate and reliable answers by combining energy-efficient multi-path routing schemes with techniques that avoid double-counting. Synopsis diffusion avoids double-counting through the use of <i>order- and duplicate-insensitive (ODI) synopses</i> that compactly summarize intermediate results during in-network aggregation. We provide a surprisingly simple test that makes it easy to check the correctness of an ODI synopsis. We show that the properties of ODI synopses and synopsis di.usion create <i>implicit</i> acknowledgments of packet delivery. We show that this property can, in turn, enable the system to adapt message routing to dynamic message loss conditions, even in the presence of asymmetric links. Finally, we illustrate, using extensive simulations, the significant robustness, accuracy, and energy-efficiency improvements of synopsis diffusion over previous approaches.},
booktitle = SENSYS,
pages = {250–262},
numpages = {13},
keywords = {sensor networks, synopsis diffusion, query processing},
location = {Baltimore, MD, USA},
   month = Nov,
  category = "IrisNet",
series = {SenSys '04}
}

@inproceedings{2004-Pang-imc-dns,
author = {Pang, Jeffrey and Hendricks, James and Akella, Aditya and De Prisco, Roberto and Maggs, Bruce and Seshan, Srinivasan},
title = {Availability, Usage, and Deployment Characteristics of the Domain Name System},
year = {2004},
isbn = {1581138210},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1028788.1028790},
doi = {10.1145/1028788.1028790},
abstract = {The Domain Name System (DNS) is a critical part of the Internet's infrastructure, and is one of the few examples of a robust, highly-scalable, and operational distributed system. Although a few studies have been devoted to characterizing its properties, such as its workload and the stability of the top-level servers, many key components of DNS have not yet been examined. Based on large-scale measurements taken fromservers in a large content distribution network, we present a detailed study of key characteristics of the DNS infrastructure, such as load distribution, availability, and deployment patterns of DNS servers. Our analysis includes both local DNS servers and servers in the authoritative hierarchy. We find that (1) the vast majority of users use a small fraction of deployed name servers, (2) the availability of most name servers is high, and (3) there exists a larger degree of diversity in local DNS server deployment and usage than for authoritative servers. Furthermore, we use our DNS measurements to draw conclusions about federated infrastructures in general. We evaluate and discuss the impact of federated deployment models on future systems, such as Distributed Hash Tables.},
booktitle = IMC,
pages = {1–14},
numpages = {14},
  category = "DistApps",
  month = Oct,
keywords = {federated, availability, DNS},
location = {Taormina, Sicily, Italy},
series = {IMC '04}
}

@inproceedings{2004-Pang-imc-route,
author = {Pang, Jeffrey and Akella, Aditya and Shaikh, Anees and Krishnamurthy, Balachander and Seshan, Srinivasan},
title = {On the Responsiveness of DNS-Based Network Control},
year = {2004},
isbn = {1581138210},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1028788.1028792},
doi = {10.1145/1028788.1028792},
abstract = {For the last few years, large Web content providers interested in improving their scalability and availability have increasingly turned to three techniques: mirroring, content distribution, and ISP multihoming. The Domain Name System (DNS) has gained a prominent role in the way each of these techniques directs client requests to achieve the goals of scalability and availability. The DNS is thought to offer the transparent and agile control necessary to react quickly to ISP link failures or phenomenon such as flash crowds.In this paper, we investigate this assumption with the objective of quantifying the degree of responsiveness that can be expected from DNS. We use a combination of Web and DNS access measurements from several busy Web sites, as well as a large content distribution network, to characterize the behavior of end-systems and local DNS servers in terms of their adherence to DNS-based controls. Our results suggest that DNS is at best a coarse-grained mechanism, and poorly suited for applications, such as route control, which require quick response to link failures or performance degradations. We then propose several proactive techniques that, when deployed in cooperation between large content providers and important clients, have the potential to improve the responsiveness of DNS-based control.},
booktitle = IMC,
pages = {21–26},
numpages = {6},
keywords = {network control, time-to-live, DNS},
location = {Taormina, Sicily, Italy},
  category = "Multihoming",
  month = Oct,
series = {IMC '04}
}

@inproceedings{2004-Yalagandula-worlds,
   author = "P. Yalagandula and S. Nath and H. Yu and P. B. Gibbons and S. Seshan",
   title = {Beyond Availability: Towards a Deeper Understanding of Machine Failure Characteristics in Large Distributed Systems},
   booktitle = {Workshop on Real, Large Distributed Systems (WORLDS)},
   month = Dec,
   year = 2004,
   address = {San Francisco, CA},
  category = "DistApps",
  summary = "",
  url = {https://www.usenix.org/legacy/events/worlds04/tech/yalagandula.html}
}

@inproceedings{2005-Akella-mobicom,
author = {Akella, Aditya and Judd, Glenn and Seshan, Srinivasan and Steenkiste, Peter},
title = {Self-Management in Chaotic Wireless Deployments},
year = {2005},
isbn = {1595930205},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1080829.1080849},
doi = {10.1145/1080829.1080849},
abstract = {Over the past few years, wireless networking technologies have made vast forays into our daily lives. Today, one can find 802.11 hardware and other personal wireless technology employed at homes, shopping malls, coffee shops and airports. Present-day wireless network deployments bear two important properties: they are unplanned, with most access points (APs) deployed by users in a spontaneous manner, resulting in highly variable AP densities; and they are unmanaged, since manually configuring and managing a wireless network is very complicated. We refer to such wireless deployments as being chaotic.In this paper, we present a study of the impact of interference in chaotic 802.11 deployments on end-client performance. First, using large-scale measurement data from several cities, we show that it is not uncommon to have tens of APs deployed in close proximity of each other. Moreover, most APs are not configured to minimize interference with their neighbors. We then perform trace-driven simulations to show that the performance of end-clients could suffer significantly in chaotic deployments. We argue that end-client experience could be significantly improved by making chaotic wireless networks self-managing. We design and evaluate automated power control and rate adaptation algorithms to minimize interference among neighboring APs, while ensuring robust end-client performance.},
booktitle = MOBICOM,
pages = {185–199},
numpages = {15},
keywords = {access points, power control, channel assignment, interference},
location = {Cologne, Germany},
  category = "Chaotic",
  month = Sep,
series = {MobiCom '05}
}

@inproceedings{2005-Aksak-sensys,
author = {Aksak, Burak and Bhat, Preethi Srinivas and Campbell, Jason and DeRosa, Michael and Funiak, Stanislav and Gibbons, Phillip B. and Goldstein, Seth Copen and Guestrin, Carlos and Gupta, Ashish and Helfrich, Casey and Hoburg, James and Kirby, Brian and Kuffner, James and Lee, Peter and Mowry, Todd C. and Pillai, Padmanabhan S. and Ravichandran, Ram and Rister, Benjamin D. and Seshan, Srinivasan and Sitti, Metin and Yu, Haifeng},
title = {Claytronics: Highly Scalable Communications, Sensing, and Actuation Networks},
year = {2005},
month = nov,
isbn = {159593054X},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1098918.1098964},
doi = {10.1145/1098918.1098964},
abstract = {We propose a demonstration of extremely scalable modular robotics algorithms developed as part of the Claytronics Project (http://www-2.cs.cmu.edu/~claytronics/), as well as a demonstration of proof-of-concept prototypes. Our effort envisions multi-million-module robot ensembles able to morph into three-dimensional scenes, eventually with sufficient fidelity so as to convince a human observer the scenes are real. Although this work is potentially revolutionary in the sense that it holds out the possibility of radically altering the relationship between computation, humans, and the physical world, many of the research questions involved are similar in flavor to more mainstream systems research, albeit larger in scale. For instance, as in sensor networks, each robot will incorporate sensing, computation, and communications components. However, unlike most sensor networks each robot will also include mechanisms for actuation and motion. Many of the key challenges in this project involve coordination and communication of sensing and actuation across such large ensembles of independent units.},
booktitle = SENSYS,
pages = {299},
numpages = {1},
keywords = {distributed sensor fusion, distributed planning and coordination, telepresence, modular reconfigurable robotics, collective actuation, dynamic physical rendering, programmable matter},
location = {San Diego, California, USA},
series = {SenSys '05}
}

@inproceedings{2005-Campbell-multimedia,
author = {Campbell, Jason and Gibbons, Phillip B. and Nath, Suman and Pillai, Padmanabhan and Seshan, Srinivasan and Sukthankar, Rahul},
title = {IrisNet: An Internet-Scale Architecture for Multimedia Sensors},
year = {2005},
isbn = {1595930442},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1101149.1101162},
doi = {10.1145/1101149.1101162},
abstract = {Most current sensor network research explores the use of extremely simple sensors on small devices called motes and focuses on over-coming the resource constraints of these devices. In contrast, our research explores the challenges of multimedia sensors and is motivated by the fact that multimedia devices, such as cameras, are rapidly becoming inexpensive, yet their use in a sensor network presents a number of unique challenges. For example, the data rates involved with multimedia sensors are orders of magnitude greater than those for sensor motes and this data cannot easily be processed by traditional sensor network techniques that focus on scalar data. In addition, the richness of the data generated by multimedia sensors makes them useful for a wide variety of applications. This paper presents an overview of IRISNET, a sensor network architecture that enables the creation of a planetary-scale infrastructure of multimedia sensors that can be shared by a large number of applications. To ensure the efficient collection of sensor readings, IRISNET enables the application-specific processing of sensor feeds on the significant computation resources that are typically attached to multimedia sensors. IRISNET enables the storage of sensor readings close to their source by providing a convenient and extensible distributed XML database infrastructure. Finally, IRISNET provides a number of multimedia processing primitives that enable the effective processing of sensor feeds in-network and at-sensor.},
booktitle = {ACM International Conference on Multimedia (ACM Multimedia)},
pages = {81–88},
numpages = {8},
keywords = {multimedia sensors, sensor networks, wide-area sensing infrastructure},
location = {Hilton, Singapore},
   month = Nov,
  category = "IrisNet",
series = {MULTIMEDIA '05}
}

@inproceedings{2005-Nath-fast,
author = {Nath, Suman and Gibbons, Phillip B. and Seshan, Srinivasan},
title = {Adaptive Data Placement for Wide-Area Sensing Services},
year = {2005},
publisher = {USENIX Association},
address = {USA},
abstract = {Wide-area sensing services enable users to query data collected from multitudes of widely distributed sensors. In this paper, we consider the novel distributed database workload characteristics of these services, and present IDP, an online, adaptive data placement and replication system tailored to this workload. Given a hierarchical database, IDP automatically partitions it among a set of networked hosts, and replicates portions of it. IDP makes decisions based on measurements of access locality within the database, read and write load for individual objects within the database, proximity between queriers and potential replicas, and total load on hosts participating in the database. Our evaluation of IDP under real and synthetic workloads, including flash crowds of queriers, demonstrates that in comparison with previously-studied replica placement techniques, IDP reduces average response times for user queries by up to a factor of 3 and reduces network traffic for queries, updates, and data movements by up to an order of magnitude.},
booktitle = FAST,
location = {San Francisco, CA},
  category = "IrisNet",
   month = Dec,
series = {FAST'05},
url = {https://www.usenix.org/legacy/event/fast05/tech/nath.html}
}

@InProceedings{2005-Rao-iptps,
author="Bharambe, Ashwin R. and Rao, Sanjay G. and Padmanabhan, Venkata N. and Seshan, Srinivasan and Zhang, Hui",
editor="Castro, Miguel and van Renesse, Robbert",
title="The Impact of Heterogeneous Bandwidth Constraints on DHT-Based Multicast Protocols",
booktitle="IPTPS 2005: Peer-to-Peer Systems IV",
year="2005",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
pages="115--126",
  category = "Overlay",
  month = Feb,
abstract="In this paper, we consider support for bandwidth-demanding applications such as video broadcasting using DHTs. Our investigations focus on the impact of heterogeneity in the outgoing bandwidth capabilities of nodes on Scribe, a representative and relatively mature DHT-based multicast protocol. We expose important issues that arise due to the mismatch between the ID space that underlies the DHT and the outgoing bandwidth constraints on nodes.",
isbn="978-3-540-31906-1",
doi = {10.1007/11558989_11},
url = {https://doi.org/10.1007/11558989_11}
}

@inproceedings{2006-Agrawal-inm,
author = {Agrawal, Mukesh and Bailey, Susan R. and Greenberg, Albert and Pastor, Jorge and Sebos, Panagiotis and Seshan, Srinivasan and van der Merwe, Kobus and Yates, Jennifer},
title = {RouterFarm: Towards a Dynamic, Manageable Network Edge},
year = {2006},
isbn = {1595935703},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1162638.1162639},
doi = {10.1145/1162638.1162639},
abstract = {Planned maintenance is a fact of life in IP networks. Examples of maintenance activities include updating router software as well as processor upgrades, memory upgrades, installation of additional line cards, and other hardware upgrades. While planned maintenance is clearly necessary, it is also costly. Software upgrades, for example, require rebooting the router. Due to the time required to reboot the router, and then synchronize state (such as BGP routing information) with network neighbors, the upgrade process can yield outages of 10--15 minutes.},
booktitle = {SIGCOMM Workshop on Internet Network Management},
pages = {5–10},
numpages = {6},
keywords = {network edge, availability, reliability, manageability},
location = {Pisa, Italy},
   month = Sep,
  category = "Multihoming",
series = {INM '06}
}

@inproceedings{2006-Bharambe-nsdi,
   author = "A. Bharambe and J. Pang and S. Seshan",
   title = {Colyseus: A Distributed Architecture for Online Multiplayer Games},
   booktitle = NSDI,
   month = May,
   year = 2006,
   address = {San Jose, CA},
  category = "DistApps",
  summary = "",
  url = {https://www.usenix.org/legacy/event/nsdi06/tech/bharambe.html}
}

@inproceedings{2006-Nath-nsdi,
   author = "S. Nath and H. Yu and P. B. Gibbons and S. Seshan",
   title = {Subtleties in Tolerating Correlated Failures},
   booktitle = NSDI,
   month = May,
   year = 2006,
   address = {San Jose, CA},
  category = "DistApps",
  summary = "",
  url = {https://www.usenix.org/legacy/event/nsdi06/tech/nath.html}
}

@inproceedings{2006-Raychaudhuri-mobiarch,
author = {Raychaudhuri, Dipankar and Mandayam, Narayan B. and Evans, Joseph B. and Ewy, Benjamin J. and Seshan, Srinivasan and Steenkiste, Peter},
title = {CogNet: An Architectural Foundation for Experimental Cognitive Radio Networks within the Future Internet},
year = {2006},
isbn = {1595935665},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1186699.1186707},
doi = {10.1145/1186699.1186707},
abstract = {This paper describes a framework for research on architectural tradeoffs and protocol designs for cognitive radio networks at both the local network and the global internetwork levels. Several key architectural issues for cognitive radio networks are discussed, including control and management protocols, support for collaborative PHY, dynamic spectrum coordination, flexible MAC layer protocols, ad hoc group formation and cross-layer adaptation. The overall goal of this work is the design and validation of the control/management and data interfaces between cognitive radio nodes in a local network, and also between cognitive radio networks and the global Internet. Protocol design and implementation based on this framework will result in the CogNet architecture, a prototype open-source cognitive radio protocol stack. Experimental evaluations on emerging cognitive radio platforms are planned for future work, first in a wireless local-area radio network scenario using wireless testbeds such as ORBIT, and later as part of several end-to-end experiments using a wide-area network testbed such as PlanetLab (and GENI in the future).},
booktitle = {ACM/IEEE International Workshop on Mobility in the Evolving Internet Architecture (MobiArch)},
pages = {11–16},
numpages = {6},
keywords = {protocols, network protocols, cognitive radio, internet architecture},
location = {San Francisco, California},
   month = Dec,
  category = "Chaotic",
series = {MobiArch '06}
}

@article{2007-Akella-winet,
	abstract = {Over the past few years, wireless networking technologies have made vast forays into our daily lives. Today, one can find 802.11 hardware and other personal wireless technology employed at homes, shopping malls, coffee shops and airports. Present-day wireless network deployments bear two important properties: they are unplanned, with most access points (APs) deployed by users in a spontaneous manner, resulting in highly variable AP densities; and they are unmanaged, since manually configuring and managing a wireless network is very complicated. We refer to such wireless deployments as being chaotic.},
	author = {Akella, Aditya and Judd, Glenn and Seshan, Srinivasan and Steenkiste, Peter},
	date = {2007/12/01},
	date-added = {2022-05-01 22:31:57 -0400},
	date-modified = {2022-05-01 22:31:57 -0400},
	doi = {10.1007/s11276-006-9852-4},
	id = {Akella2007},
	isbn = {1572-8196},
  journal = "Wireless Networks (WINET), Special Issue on Selected Papers from MobiCom 2005",
	number = {6},
    category = "Chaotic",
	pages = {737--755},
  title = {Self Management in Chaotic Wireless Deployments},
	url = {https://doi.org/10.1007/s11276-006-9852-4},
	volume = {13},
	year = {2007},
  month = oct
}

@inproceedings{2007-Gummadi-sigcomm,
author = {Gummadi, Ramakrishna and Wetherall, David and Greenstein, Ben and Seshan, Srinivasan},
title = {Understanding and Mitigating the Impact of RF Interference on 802.11 Networks},
year = {2007},
isbn = {9781595937131},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1282380.1282424},
doi = {10.1145/1282380.1282424},
abstract = {We study the impact on 802.11 networks of RF interference from devices such as Zigbee and cordless phones that increasingly crowd the 2.4GHz ISM band, and from devices such as wireless camera jammers and non-compliant 802.11 devices that seek to disrupt 802.11 operation. Our experiments show that commodity 802.11 equipment is surprisingly vulnerable to certain patterns of weak or narrow-band interference. This enables us to disrupt a link with an interfering signal whose power is 1000 times weaker than the victim's 802.11 signals, or to shut down a multiple AP, multiple channel managed network at a location with a single radio interferer. We identify several factors that lead to these vulnerabilities, ranging from MAC layer driver implementation strategies to PHY layer radio frequency implementation strategies. Our results further show that these factors are not overcome by simply changing 802.11 operational parameters (such as CCA threshold, rate and packet size) with the exception of frequency shifts. This leads us to explore rapid channel hopping as a strategy to withstand RF interference. We prototype a channel hopping design using PRISM NICs, and find that it can sustain throughput at levels of RF interference well above that needed to disrupt unmodified links, and at a reasonable cost in terms of switching overheads.},
booktitle = SIGCOMM,
pages = {385–396},
numpages = {12},
   month = Aug,
  category = "Chaotic",
keywords = {channel hopping, jamming, RF interference, 802.11, SINR},
location = {Kyoto, Japan},
series = {SIGCOMM '07}
}

@inproceedings{2007-Greenstein-hotos,
   author = "B. Greenstein and R. Gummadi and J. Pang and M. Chen and T. Kohno and S. Seshan and D. Wetherall",
   title = {Can Ferris Bueller Still Have His Day Off? Protecting Privacy in an Era of Wireless Devices},
   booktitle = HOTOS,
   month = May,
   year = 2007,
   address = {San Diego, CA},
  category = "Privacy",
  summary = "",
  url = {https://www.usenix.org/legacy/events/hotos07/tech/full_papers/greenstein/greenstein.pdf}
}

@inproceedings{2007-Krevat-petascale,
author = {Krevat, Elie and Vasudevan, Vijay and Phanishayee, Amar and Andersen, David G. and Ganger, Gregory R. and Gibson, Garth A. and Seshan, Srinivasan},
title = {On Application-Level Approaches to Avoiding TCP Throughput Collapse in Cluster-Based Storage Systems},
year = {2007},
isbn = {9781595938992},
   month = Nov,
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1374596.1374598},
doi = {10.1145/1374596.1374598},
abstract = {TCP Incast plagues scalable cluster-based storage built atop standard TCP/IP-over-Ethernet, often resulting in much lower client read bandwidth than can be provided by the available network links. This paper reviews the Incast problem and discusses potential application-level approaches to avoiding it.},
booktitle = {Workshop on Petascale Data Storage: Held in Conjunction with Supercomputing '07},
pages = {1–4},
numpages = {4},
keywords = {TCP, Incast, cluster-based storage},
location = {Reno, Nevada},
series = {PDSW '07}
}

@inproceedings{2007-Pang-hotnets,
   author = "J. Pang and B. Greenstein and D. McCoy and S. Seshan and D. Wetherall",
   title = {Tryst: The Case for Confidential Service Discovery},
   booktitle = HOTNETS,
   month = Nov,
   year = 2007,
   address = {Atlanta, GA},
  category = "Privacy",
  summary = "",
}

@inproceedings{2007-Pang-icdcs,
author={Pang, Jeffrey and Gibbons, Phillip B. and Kaminsky, Michael and Seshan, Srinivasan and Yu, Haifeng},
title = {Defragmenting DHT-based Distributed File Systems},
booktitle={27th International Conference on Distributed Computing Systems (ICDCS '07)},
month = Jun,
year = 2007,
address = {Toronto, Canada},
category = "DistApps",
doi={10.1109/ICDCS.2007.97},
url ={https://doi.org/10.1109/ICDCS.2007.97}
}

@inproceedings{2007-Pang-mobicom,
author = {Pang, Jeffrey and Greenstein, Ben and Gummadi, Ramakrishna and Seshan, Srinivasan and Wetherall, David},
title = {802.11 User Fingerprinting},
year = {2007},
isbn = {9781595936813},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1287853.1287866},
doi = {10.1145/1287853.1287866},
abstract = {The ubiquity of 802.11 devices and networks enables anyone to track our every move with alarming ease. Each 802.11 device transmits a globally unique and persistent MAC address and thus is trivially identifiable. In response, recent research has proposed replacing such identifiers with pseudonyms (i.e., temporary, unlinkable names). In this paper, we demonstrate that pseudonyms are insufficient to prevent tracking of 802.11 devices because implicit identifiers, or identifying characteristics of 802.11 traffic, can identify many users with high accuracy. For example, even without unique names and addresses, we estimate that an adversary can identify 64\% of users with 90\% accuracy when they spend a day at a busy hot spot. We present an automated procedure based on four previously unrecognized implicit identifiers that can identify users in three real 802.11 traces even when pseudonyms and encryption are employed. We find that the majority of users can be identified using our techniques, but our ability to identify users is not uniform; some users are not easily identifiable. Nonetheless, we show that even a single implicit identifier is sufficient to distinguish many users. Therefore, we argue that design considerations beyond eliminating explicit identifiers (i.e., unique names and addresses), must be addressed in order to prevent user tracking in wireless networks.},
booktitle = MOBICOM,
pages = {99–110},
numpages = {12},
  category = "Privacy",
   month = Sep,
keywords = {privacy, 802.11, anonymity, wireless},
location = {Montr\'{e}al, Qu\'{e}bec, Canada},
series = {MobiCom '07}
}

@inproceedings{2007-Seshan-ita,
   author = "S. Seshan and X. Liu and P. Steenkiste",
   title = {Interference-Aware Transmission Power Control for Dense Wireless Networks},
   booktitle = "Annual Conference of ITA",
   month = Sep,
   year = 2007,
   address = {College Park, MD},
  category = "Chaotic",
  summary = "",
}

@article{2008-Akella-ton,
author = {Akella, Aditya and Maggs, Bruce and Seshan, Srinivasan and Shaikh, Anees},
title = {On the Performance Benefits of Multihoming Route Control},
year = {2008},
issue_date = {February 2008},
publisher = {IEEE Press},
volume = {16},
number = {1},
issn = {1063-6692},
url = {https://doi.org/10.1109/TNET.2007.899068},
doi = {10.1109/TNET.2007.899068},
abstract = {Multihoming is increasingly being employed by large enterprises and data centers to extract good performance and reliability from their ISP connections. Multihomed end networks today can employ a variety of route control products to optimize their Internet access performance and reliability. However, little is known about the tangible benefits that such products can offer, the mechanisms they employ and their trade-offs. This paper makes two important contributions. First, we present a study of the potential improvements in Internet round-trip times (RTTs) and transfer speeds from employing multihoming route control. Our analysis shows that multihoming to three or more ISPs and cleverly scheduling traffic across the ISPs can improve Internet RTTs and throughputs by up to 25\% and 20\%, respectively. However, a careful selection of ISPs is important to realize the performance improvements. Second, focusing on large enterprises, we propose and evaluate a wide-range of route control mechanisms and evaluate their design trade-offs. We implement the proposed schemes on a Linux-based Web proxy and perform a trace-based evaluation of their performance. We show that both passive and active measurement-based techniques are equally effective and could improve the Web response times of enterprise networks by up to 25\% on average, compared to using a single ISP. We also outline several "best common practices" for the design of route control products.},
journal = TON,
month = feb,
pages = {91–104},
numpages = {14},
  category = "Multihoming",
keywords = {multihoming, performance, reliability}
}

@inproceedings{2008-Anand-sigcomm,
author = {Anand, Ashok and Gupta, Archit and Akella, Aditya and Seshan, Srinivasan and Shenker, Scott},
title = {Packet Caches on Routers: The Implications of Universal Redundant Traffic Elimination},
year = {2008},
isbn = {9781605581750},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1402958.1402984},
doi = {10.1145/1402958.1402984},
abstract = {Many past systems have explored how to eliminate redundant transfers from network links and improve network efficiency. Several of these systems operate at the application layer, while the more recent systems operate on individual packets. A common aspect of these systems is that they apply to localized settings, e.g. at stub network access links. In this paper, we explore the benefits of deploying packet-level redundant content elimination as a universal primitive on all Internet routers. Such a universal deployment would immediately reduce link loads everywhere. However, we argue that far more significant network-wide benefits can be derived by redesigning network routing protocols to leverage the universal deployment. We develop "redundancy-aware" intra- and inter-domain routing algorithms and show that they enable better traffic engineering, reduce link usage costs, and enhance ISPs' responsiveness to traffic variations. In particular, employing redundancy elimination approaches across redundancy-aware routes can lower intra and inter-domain link loads by 10-50\%. We also address key challenges that may hinder implementation of redundancy elimination on fast routers. Our current software router implementation can run at OC48 speeds.},
booktitle = SIGCOMM,
pages = {219–230},
numpages = {12},
month = Aug,
  category = "CAN",
keywords = {routing, traffic engineering, traffic redundancy},
location = {Seattle, WA, USA},
series = {SIGCOMM '08}
}

@inproceedings{2008-Bharambe-sigcomm,
author = {Bharambe, Ashwin and Douceur, John R. and Lorch, Jacob R. and Moscibroda, Thomas and Pang, Jeffrey and Seshan, Srinivasan and Zhuang, Xinyu},
title = {Donnybrook: Enabling Large-Scale, High-Speed, Peer-to-Peer Games},
year = {2008},
isbn = {9781605581750},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1402958.1403002},
doi = {10.1145/1402958.1403002},
abstract = {Without well-provisioned dedicated servers, modern fast-paced action games limit the number of players who can interact simultaneously to 16-32. This is because interacting players must frequently exchange state updates, and high player counts would exceed the bandwidth available to participating machines. In this paper, we describe Donnybrook, a system that enables epic-scale battles without dedicated server resources, even in a fast-paced game with tight latency bounds. It achieves this scalability through two novel components. First, it reduces bandwidth demand by estimating what players are paying attention to, thereby enabling it to reduce the frequency of sending less important state updates. Second, it overcomes resource and interest heterogeneity by disseminating updates via a multicast system designed for the special requirements of games: that they have multiple sources, are latency-sensitive, and have frequent group membership changes. We present user study results using a prototype implementation based on Quake III that show our approach provides a desirable user experience. We also present simulation results that demonstrate Donnybrook's efficacy in enabling battles of up to 900 players.},
booktitle = SIGCOMM,
pages = {389–400},
numpages = {12},
month = Aug,
  category = "DistApps",
keywords = {computer games, doppelg\{a}ngers, interest sets},
location = {Seattle, WA, USA},
series = {SIGCOMM '08}
}

@inproceedings{2008-Greenstein-mobisys,
author = {Greenstein, Ben and McCoy, Damon and Pang, Jeffrey and Kohno, Tadayoshi and Seshan, Srinivasan and Wetherall, David},
title = {Improving Wireless Privacy with an Identifier-Free Link Layer Protocol},
year = {2008},
isbn = {9781605581392},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1378600.1378607},
doi = {10.1145/1378600.1378607},
month = Jun,
  award = {Best Student Paper Award},
  category = "Privacy",
  abstract = {We present the design and evaluation of an 802.11-like wireless link layer protocol that obfuscates all transmitted bits to increase privacy. This includes explicit identifiers such as MAC addresses, the contents of management messages, and other protocol fields that the existing 802.11 protocol relies on to be sent in the clear. By obscuring these fields, we greatly increase the difficulty of identifying or profiling users from their transmissions in ways that are otherwise straightforward. Our design, called SlyFi, is nearly as efficient as existing schemes such as WPA for discovery, link setup, and data delivery despite its heightened protections; transmission requires only symmetric key encryption and reception requires a table lookup followed by symmetric key decryption. Experiments using our implementation on Atheros 802.11 drivers show that SlyFi can discover and associate with networks faster than 802.11 using WPA-PSK. The overhead SlyFi introduces in packet delivery is only slightly higher than that added by WPA-CCMP encryption (10\% vs. 3\% decrease in throughput).},
booktitle = MOBISYS,
pages = {40–53},
numpages = {14},
keywords = {802.11, privacy, anonymity, wireless},
location = {Breckenridge, CO, USA},
series = {MobiSys '08}
}

@inproceedings{2008-Han-imc,
author = {Han, Dongsu and Agarwala, Aditiya and Andersen, David G. and Kaminsky, Michael and Papagiannaki, Konstantina and Seshan, Srinivasan},
title = {Mark-and-Sweep: Getting the 'inside' Scoop on Neighborhood Networks},
year = {2008},
isbn = {9781605583341},
  category = "Chaotic",
  month = Oct,
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1452520.1452532},
doi = {10.1145/1452520.1452532},
abstract = {Residential Internet connectivity is growing at a phenomenal rate. A number of recent studies have attempted to characterize this connectivity - measuring coverage and performance of last-mile broadband links - from a various vantage points on the Internet, via wireless APs, and even with user cooperation. These studies, however, sacrifice accuracy or require substantial human time. In this work, we present a novel two-pass method to characterize neighborhood networks. We demonstrate that the two pass method dramatically reduces the time spent in active measurement while retaining accuracy. A case study on two neighborhoods in Pittsburgh provide new and accurate insights into broadband connectivity, including throughput, broadband coverage (DSL vs. cable vs. fiber), NAT configurations, DHCP, DNS usage. The results further characterize 802.11 connectivity in the neighborhood.},
booktitle = IMC,
pages = {99–104},
numpages = {6},
keywords = {access network, access point, measurement tool, broadband connection},
location = {Vouliagmeni, Greece},
series = {IMC '08}
}

@article{2008-Jakubczak-mc2r,
author = {Jakubczak, Szymon and Andersen, David G. and Kaminsky, Michael and Papagiannaki, Konstantina and Seshan, Srinivasan},
title = {Link-Alike: Using Wireless to Share Network Resources in a Neighborhood},
year = {2009},
issue_date = {October 2008},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {12},
number = {4},
issn = {1559-1662},
url = {https://doi.org/10.1145/1508285.1508287},
doi = {10.1145/1508285.1508287},
abstract = {Asymmetric broadband connections in the home provide a limited upstream pipe to the Internet. This limitation makes various applications, such as remote backup and sharing high definition video, impractical. However, homes in a neighborhood often have high bandwidth wireless networks, whose bandwidth exceeds that of a single wired uplink. Moreover, most (wired and wireless) connections are idle most of the time.In this paper, we examine the fundamental requirements of a system that aggregates upstream broadband connections in a neighborhood using wireless communication between homes. A scheme addressing this problem must operate efficiently in an environment that is: i) highly lossy; ii) broadcast in nature; and iii) half-duplex. We propose a novel scheme, Link-alike, that addresses those three challenges using opportunistic wireless reception, a novel wireless broadcast rate control scheme, and preferential use of the wired downlink. Through analytical and experimental evaluation, we demonstrate that our approach provides significantly better throughput than previous solutions based on TCP or UDP unicast.},
 journal = MC2R,
month = feb,
pages = {1–14},
numpages = {14}
}

@article{2008-Nath-tosn,
author = {Nath, Suman and Gibbons, Phillip B. and Seshan, Srinivasan and Anderson, Zachary},
title = {Synopsis Diffusion for Robust Aggregation in Sensor Networks},
year = {2008},
issue_date = {March 2008},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {4},
number = {2},
issn = {1550-4859},
url = {https://doi.org/10.1145/1340771.1340773},
doi = {10.1145/1340771.1340773},
abstract = {Previous approaches for computing duplicate-sensitive aggregates in wireless sensor networks have used a tree topology, in order to conserve energy and to avoid double-counting sensor readings. However, a tree topology is not robust against node and communication failures, which are common in sensor networks. In this article, we present synopsis diffusion, a general framework for achieving significantly more accurate and reliable answers by combining energy-efficient multipath routing schemes with techniques that avoid double-counting. Synopsis diffusion avoids double-counting through the use of order- and duplicate-insensitive (ODI) synopses that compactly summarize intermediate results during in-network aggregation. We provide a surprisingly simple test that makes it easy to check the correctness of an ODI synopsis. We show that the properties of ODI synopses and synopsis diffusion create implicit acknowledgments of packet delivery. Such acknowledgments enable energy-efficient adaptation of message routes to dynamic message loss conditions, even in the presence of asymmetric links. Finally, we illustrate using extensive simulations the significant robustness, accuracy, and energy-efficiency improvements of synopsis diffusion over previous approaches.},
journal = {ACM Trans. Sen. Netw.},
month = apr,
articleno = {7},
numpages = {40},
  category = "IrisNet",
keywords = {query processing, Sensor networks, synopsis diffusion}
}

@inproceedings{2008-Phanishayee-fast,
   author = "A. Phanishayee and E. Krevat and V. Vasudevan and D. Andersen and G. Ganger and G. Gibson and S. Seshan",
   title = {Measurement and Analysis of TCP Throughput Collapse in Cluster-Based Storage Systems},
   booktitle = FAST,
   month = Feb,
   year = 2008,
   address = {San Jose, CA},
  category = "Misc",
  summary = "",
  url = {https://www.usenix.org/legacy/event/fast08/tech//phanishayee.html}
}

@InProceedings{2009-Gummadi-comsnets,
  author = 	 {Ramakrishna Gummadi and Hari Balakrishnan and Srinivasan Seshan},
  title = 	 {Metronome: Coordinating spectrum sharing in heterogeneous wireless networks},
  booktitle = "International Conference on COMmunication Systems and NETworkS (COMSNETS)",
  year = 	 {2009},
  month = 	 Jan,
  category = "Chaotic",
  address = 	 {Bangalore, India},
  doi={10.1109/COMSNETS.2009.4808853},
  url = {https://doi.org/10.1109/COMSNETS.2009.4808853}
}

@InProceedings{2009-Han-pam,
author="Han, Dongsu and Andersen, David G. and Kaminsky, Michael and Papagiannaki, Konstantina and Seshan, Srinivasan",
editor="Moon, Sue B. and Teixeira, Renata and Uhlig, Steve",
title="Access Point Localization Using Local Signal Strength Gradient",
booktitle="Passive and Active Measurement Conference (PAM)",
year="2009",
  month = Apr,
  category = "Chaotic",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
location = "Seoul, Korea",
pages="99--108",
abstract="Many previous studies have examined the placement of access points (APs) to improve the community's understanding of the deployment and behavioral characteristics of wireless networks. A key implicit assumption in these studies is that one can estimate the AP location accurately from wardriving-like measurements. However, existing localization algorithms exhibit high error because they over-simplify the complex nature of signal propagation. In this work, we propose a novel approach that localizes APs using directional information derived from local signal strength variations. Our algorithm only uses signal strength information, and improves localization accuracy over existing techniques. Furthermore, the algorithm is robust to the sampling biases and non-uniform shadowing, which are common in wardriving measurements.",
isbn="978-3-642-00975-4",
doi = {10.1007/978-3-642-00975-4_10},
url = {https://doi.org/10.1007/978-3-642-00975-4_10}
}

@inproceedings{2009-Lakshminarayanan-conext,
author = {Lakshminarayanan, Kaushik and Sapra, Samir and Seshan, Srinivasan and Steenkiste, Peter},
title = {RFDump: An Architecture for Monitoring the Wireless Ether},
year = {2009},
isbn = {9781605586366},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1658939.1658968},
doi = {10.1145/1658939.1658968},
abstract = {Networking researchers have been using tools like wireshark and tcpdump to sniff packets on physical links that use different types of datalink protocols, e.g. Ethernet or 802.11, allowing them to monitor higher level protocols sharing these links. However, monitoring wireless links is more challenging, since the transmission medium is shared by flows using diverse datalink protocols (e.g. 802.11, Bluetooth) and physical layer schemes (e.g. QPSK and GFSK). To this end, we propose RFDump, a software architecture for monitoring packets on heterogeneous wireless networks. The key idea underlying our architecture is the use of a fast detection stage which can tentatively map signals to protocols very efficiently. As a result, RFDump can scale up to a modest number (5-10) of wireless technologies.We implemented RFDump on the GNU Radio and USRP platforms. This is, to our knowledge, the first inexpensive software-based infrastructure for simultaneously analyzing multiple wireless protocols in real-time. Using traces from the real world and from a wireless emulator testbed, we show that our implementation is efficient and accurate. Further, we demonstrate that our system is extensible and scales with the addition of new protocols.},
booktitle = CONEXT,
pages = {253–264},
numpages = {12},
  month = Dec,
  category = "Chaotic",
keywords = {software defined radio, wi-fi, bluetooth, wireless networks, monitoring, tcpdump},
location = {Rome, Italy},
series = {CoNEXT '09}
}

@inproceedings{2009-Liu-sigcomm,
author = {Liu, Xi and Sheth, Anmol and Kaminsky, Michael and Papagiannaki, Konstantina and Seshan, Srinivasan and Steenkiste, Peter},
title = {DIRC: Increasing Indoor Wireless Capacity Using Directional Antennas},
year = {2009},
isbn = {9781605585949},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1592568.1592589},
doi = {10.1145/1592568.1592589},
abstract = {The demand for wireless bandwidth in indoor environments such as homes and offices continues to increase rapidly. Although wireless technologies such as MIMO can reach link throughputs of 100s of Mbps (802.11n) for a single link, the question of how we can deliver high throughput to a large number of densely-packed devices remains an open problem. Directional antennas have been shown to be an effective way to increase spatial reuse, but past work has focused largely on outdoor environments where the interactions between wireless links can usually be ignored. This assumption is not acceptable in dense indoor wireless networks since indoor deployments need to deal with rich scattering and multipath effects. In this paper we introduce DIRC, a wireless network design whose access points use phased array antennas to achieve high throughput in dense, indoor environments. The core of DIRC is an algorithm that increases spatial reuse and maximizes overall network capacity by optimizing the orientations of a network of directional antennas. We implemented DIRC and evaluated it on a nine node network in an enterprise setting. Our results show that DIRC improves overall network capacity in indoor environments, while being flexible enough to adapt to node mobility and changing traffic workloads.},
booktitle = SIGCOMM,
pages = {171–182},
  month = Aug,
numpages = {12},
keywords = {directional antenna, indoor wireless capacity},
location = {Barcelona, Spain},
  category = "Chaotic",
series = {SIGCOMM '09}
}

@inproceedings{2009-Nychis-nsdi,
   author = "G. Nychis and  T. Hottelier and  Z. Yang and  S. Seshan and P. Steenkiste",
   title = {Enabling MAC Protocol Implementations on Software-defined Radios},
   booktitle = NSDI,
   month = Apr,
   year = 2009,
   address = {Boston, MA},
  category = "Chaotic",
  summary = "",
  url = {https://www.usenix.org/legacy/event/nsdi09/tech/full_papers/nychis/nychis.pdf}
}

@inproceedings{2009-Pang-mobisys,
author = {Pang, Jeffrey and Greenstein, Ben and Kaminsky, Michael and McCoy, Damon and Seshan, Srinivasan},
title = {Wifi-Reports: Improving Wireless Network Selection with Collaboration},
year = {2009},
isbn = {9781605585666},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1555816.1555830},
doi = {10.1145/1555816.1555830},
abstract = {Wi-Fi clients can obtain much better performance at some commercial hotspots than at others. Unfortunately, there is currently no way for users to determine which hotspot access points (APs) will be sufficient to run their applications before purchasing access. To address this problem, this paper presents Wifi-Reports, a collaborative service that provides Wi-Fi clients with historical information about AP performance and application support. The key research challenge in Wifi-Reports is to obtain accurate user-submitted reports. This is challenging because two conflicting goals must be addressed in a practical system: preserving the privacy of users' reports and limiting fraudulent reports. We introduce a practical cryptographic protocol that achieves both goals, and we address the important engineering challenges in building Wifi-Reports. Using a measurement study of commercial APs in Seattle, we show that Wifi-Reports would improve performance over previous AP selection approaches in 30\%-60\% of locations.},
booktitle = MOBISYS,
pages = {123–136},
numpages = {14},
month = Jun,
  category = "Privacy",
keywords = {802.11, privacy, wireless, anonymity, reputation},
location = {Krak\'{o}w, Poland},
series = {MobiSys '09}
}

@inproceedings{2009-Sheth-pervasive,
 author = {Sheth, A. and Seshan, S. and Wetherall, D.},
 title = {Geo-fencing: Confining Wi-Fi Coverage to Physical Boundaries},
 booktitle = {International Conference on Pervasive Computing},
 month = May,
 year = {2009},
 isbn = {978-3-642-01515-1},
 pages = {274--290},
  category = "Privacy",
 address = {Nara, Japan},
 doi = {http://dx.doi.org/10.1007/978-3-642-01

repository: sseshan/homepage

repo_name: sseshan/homepage