text:
516-8_19},
 publisher = {Springer-Verlag},
abstract = "We present a means of containing Wi-Fi coverage to physical boundaries that are meaningful to users. We call it geo-fencing. Our approach is based on directional antennas, and our motivation is to provide wireless access and privacy models that are a natural fit with user expectations. To evaluate geo-fencing, we use measurements from an indoor testbed of Wi-Fi nodes and APs with electronically-steerable directional antennas. We find that by combining directionality, power control and coding across multiple APs, we are able to successfully confine Wi-Fi coverage to clients located within target regions of varying shapes and sizes; we can select between nodes located as close as five feet from each other.",
summary = "How to use multiple directional antennas to limit packet reception to a specified region"
 }

@inproceedings{2010-Anand-hotnets,
author = {Anand, Ashok and Akella, Aditya and Sekar, Vyas and Seshan, Srinivasan},
title = {A Case for Information-Bound Referencing},
year = {2010},
isbn = {9781450304092},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1868447.1868451},
doi = {10.1145/1868447.1868451},
abstract = {Links and content references form the foundation of the way that users interact today. Unfortunately, the links used today (URLs) are fragile since they tightly specify a protocol, host, and filename. Some past efforts have decoupled this binding to a certain degree; e.g., creating links that bind to byte-level data. We argue that these systems do not go far enough. Our key observation is that users really care about the intent of the referenced link and are relatively agnostic to the byte-level representation. Based on this observation, we argue that references should be bound to the underlying information associated with the referenced content. We call such references Information-Bound References (IBR). In this paper, we focus on the challenges of creating IBRs for multimedia data, since these form a dominant fraction of Internet traffic today. We explore the trade-offs of various alternatives for generating and using IBRs. We identify that it is possible to adapt multimedia fingerprinting algorithms in the literature to generate IBRs.},
booktitle = HOTNETS,
articleno = {4},
numpages = {6},
  month = 	 Oct,
  category = "Video",
  location = {Monterey, California},
series = {Hotnets-IX}
}

@inproceedings{2010-Kumar-sigcomm,
author = {Kumar, Arun and Anand, Ashok and Akella, Aditya and Balachandran, Athula and Sekar, Vyas and Seshan, Srinivasan},
title = {Flexible Multimedia Content Retrieval Using InfoNames},
year = {2010},
isbn = {9781450302012},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1851182.1851260},
doi = {10.1145/1851182.1851260},
abstract = {Multimedia content is a dominant fraction of Internet usage today. At the same time, there is significant heterogeneity in video presentation modes and operating conditions of Internet-enabled devices that access such content. Users are often interested in the content, rather than the specific sources or the formats. The host-centric format of the current Internet does not support these requirements naturally. Neither do the recent data-centric naming proposals, since they rely on naming content based on raw byte-level hashing schemes. We argue that to meet these requirements, enabling content retrieval mechanisms to name and query directly for the underlying information is a good way forward. In addition to decoupling content from available sources and transfer protocols, these "information-aware names" or InfoNames explicitly decouple the information from content presentation factors as well. We envision an InfoName Resolution System (IRS) to resolve location based on InfoNames, while taking into account the operating conditions of devices. In this demo, we present an application to show how InfoNames can serve as presentation-invariant and portable names to fetch video content independent of device capabilities and resource constraints.},
booktitle = SIGCOMM,
pages = {455–456},
numpages = {2},
notes = "poster",
keywords = {naming, InfoName, content retrieval, multimedia, information based architecture},
location = {New Delhi, India},
series = {SIGCOMM '10},
month = aug
}

@inproceedings{2010-Liu-mobicom,
author = {Liu, Xi and Sheth, Anmol and Kaminsky, Michael and Papagiannaki, Konstantina and Seshan, Srinivasan and Steenkiste, Peter},
title = {Pushing the Envelope of Indoor Wireless Spatial Reuse Using Directional Access Points and Clients},
year = {2010},
isbn = {9781450301817},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/1859995.1860020},
doi = {10.1145/1859995.1860020},
abstract = {Recent work demonstrates that directional antennas have significant potential to improve wireless network capacity in indoor environments. This paper provides a broader exploration of the design space of indoor directional antenna systems along two main dimensions: antenna configuration and antenna control. Studying a number of alternative configurations, we find that directionality on APs and clients can significantly improve performance, even over other configurations with stronger directionality. Moreover, it is sufficient to have a small number of narrow beam antennas to achieve such gains, thus making such a solution practical for actual deployment. Designing systems with directional APs and clients for increased spatial reuse comes, however, with a number of challenges in the way the directional antennas are controlled. Antenna control needs to encompass antenna orientation algorithms, an appropriate MAC layer protocol, and novel client-AP association solutions. To overcome these challenges, we propose Speed, a distributed directional antenna control system that is easy to deploy and significantly improves network capacity over existing solutions.},
booktitle = MOBICOM,
pages = {209–220},
numpages = {12},
month = 	 Sep,
  category = "Chaotic",
  keywords = {indoor wireless capacity, directional antenna},
location = {Chicago, Illinois, USA},
series = {MobiCom '10}
}

@Article{2010-Pang-tmc,
author = {Jeffrey Pang and Ben Greenstein and Michael Kaminsky and Damon McCoy and Srinivasan Seshan},
title = {Wifi-reports: improving wireless network selection with collaboration},
  journal = 	 {IEEE Transactions on Mobile Computing},
  year = 	 {2010},
  volume = 	 {9},
  number = 	 {12},
  pages = 	 {1713-1731},
  category = "Privacy",
  month = 	 Dec,
  doi={10.1109/TMC.2010.151},
  url = {https://doi.org/10.1109/TMC.2010.151}
}

@inproceedings{2011-Anand-hotnets,
author = {Anand, Ashok and Dogar, Fahad and Han, Dongsu and Li, Boyan and Lim, Hyeontaek and Machado, Michel and Wu, Wenfei and Akella, Aditya and Andersen, David G. and Byers, John W. and Seshan, Srinivasan and Steenkiste, Peter},
title = {XIA: An Architecture for an Evolvable and Trustworthy Internet},
year = {2011},
isbn = {9781450310598},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2070562.2070564},
doi = {10.1145/2070562.2070564},
abstract = {Motivated by limitations in today's host-based IP network architecture, recent studies have proposed clean-slate network architectures centered around alternative first-class principals, such as content, services, or users. However, much like the host-centric IP design, elevating one principal type above others hinders communication between other principals and inhibits the network's capability to evolve. Our work presents the eXpressive Internet Architecture (XIA), an architecture with native support for multiple principals and the ability to evolve its functionality to accommodate new, as yet unforeseen, principals over time. XIA also provides intrinsic security: communicating entities validate that their underlying intent was satisfied correctly without relying on external databases or configuration.In this paper, we focus on core architectural issues in the XIA data plane. We outline key design requirements relating to native support for multiple principals and intrinsic security. We then use case studies to demonstrate how the XIA design facilitates evolvability and flexibility.},
booktitle = HOTNETS,
articleno = {2},
numpages = {6},
  month = 	 Nov,
  category = "XIA",
  keywords = {evolution, multiple communication styles, internet architecture, intrinsic security},
location = {Cambridge, Massachusetts},
series = {HotNets-X}
}

@inproceedings{2011-Badam-mobihoc,
author = {Badam, Anirudh and Kaminsky, Michael and Han, Dongsu and Papagiannaki, Konstantina and Andersen, David G. and Seshan, Srinivasan},
title = {The Hare and the Tortoise: Taming Wireless Losses by Exploiting Wired Reliability},
year = {2011},
isbn = {9781450307222},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2107502.2107511},
doi = {10.1145/2107502.2107511},
abstract = {Multiple communication channels are common in today's consumer and enterprise networks. For example, a high bandwidth but unreliable wireless network might co-exist with a reliable wired link (EWLANs and neighborhood networks). In this paper, we present a system that uses this reliable wired communication channel to boost the bandwidth of the lossy wireless link. Specifically, we propose a new, efficient partial packet recovery (PPR) technique and adaptive feedback mechanism specially designed to correct partial packets on an 802.11 wireless network using a wired backhaul. Our initial experiments demonstrate up to a 3x improvement over standalone 802.11 and upto a 30% improvement over existing PPR techniques.},
booktitle = {ACM International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)},
articleno = {7},
numpages = {11},
  category = "Chaotic",
  month = 	 May,
  location = {Paris, France},
series = {MobiHoc '11}
}

@inproceedings{2011-Gollakota-sigcomm,
author = {Gollakota, Shyamnath and Adib, Fadel and Katabi, Dina and Seshan, Srinivasan},
title = {Clearing the RF Smog: Making 802.11n Robust to Cross-Technology Interference},
year = {2011},
isbn = {9781450307970},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2018436.2018456},
doi = {10.1145/2018436.2018456},
abstract = {Recent studies show that high-power cross-technology interference is becoming a major problem in today's 802.11 networks. Devices like baby monitors and cordless phones can cause a wireless LAN to lose connectivity. The existing approach for dealing with such high-power interferers makes the 802.11 network switch to a different channel; yet the ISM band is becoming increasingly crowded with diverse technologies, and hence many 802.11 access points may not find an interference-free channel.This paper presents TIMO, a MIMO design that enables 802.11n to communicate in the presence of high-power cross-technology interference. Unlike existing MIMO designs, however, which require all concurrent transmissions to belong to the same technology, TIMO can exploit MIMO capabilities to decode in the presence of a signal from a different technology, hence enabling diverse technologies to share the same frequency band. We implement a prototype of TIMO in GNURadio-USRP2 and show that it enables 802.11n to communicate in the presence of interference from baby monitors, cordless phones, and microwave ovens, transforming scenarios with a complete loss of connectivity to operational networks.},
booktitle = SIGCOMM,
pages = {170–181},
numpages = {12},
  month = 	 Aug,
  category = "Chaotic",
keywords = {cross-technology interference, cognitive mimo},
location = {Toronto, Ontario, Canada},
series = {SIGCOMM '11}
}

@InProceedings{2011-Han-comsnets,
  author = 	 {Dongsu Han and David Andersen and Michael Kaminsky and Dina Papagiannaki and Srinivasan Seshan},
  title = 	 {Hulu in the neighborhood},
  booktitle = "International Conference on COMmunication Systems and NETworkS (COMSNETS)",
  year = 	 {2011},
  month = 	 Jan,
  category = "Video",
  address = 	 {Bangalore, India},
  doi={10.1109/COMSNETS.2011.5716501},
  url={https://doi.org/10.1109/COMSNETS.2011.5716501}
}

@inproceedings{2011-Javed-mobiheld,
author = {Javed, Umar and Han, Dongsu and Caceres, Ramon and Pang, Jeffrey and Seshan, Srinivasan and Varshavsky, Alexander},
title = {Predicting Handoffs in 3G Networks},
year = {2011},
isbn = {9781450309806},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2043106.2043114},
doi = {10.1145/2043106.2043114},
abstract = {Consumers all over the world are increasingly using their smartphones on the go and expect consistent, high quality connectivity at all times. A key network primitive that enables continuous connectivity in cellular networks is handoff. Although handoffs are necessary for mobile devices to maintain connectivity, they can also cause short-term disruptions in application performance. Thus, applications could benefit from the ability to predict impending handoffs with reasonable accuracy, and modify their behavior to counter the performance degradation that accompanies handoffs. In this paper, we study whether attributes relating to the cellular network conditions measured at handsets can accurately predict handoffs. In particular, we develop a machine learning framework to predict handoffs in the near future. An evaluation on handoff traces from a large US cellular carrier shows that our approach can achieve 80\% accuracy -- 27\% better than a naive predictor.},
booktitle = {ACM SOSP Workshop on Networking, Systems, and Applications on Mobile Handhelds},
articleno = {8},
numpages = {6},
  month = 	 Oct,
  category = "Chaotic",
keywords = {prediction, wireless, 3G, UMTS, handoff, measurement, mobility},
location = {Cascais, Portugal},
series = {MobiHeld '11}
}

@inproceedings{2011-Lakshminarayanan-homenets,
author = {Lakshminarayanan, Kaushik and Seshan, Srinivasan and Steenkiste, Peter},
title = {Understanding 802.11 Performance in Heterogeneous Environments},
year = {2011},
  month = 	 Aug,
  category = "Chaotic",
  isbn = {9781450307987},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2018567.2018577},
doi = {10.1145/2018567.2018577},
abstract = {The availability of unlicensed spectrum coupled with the increasing popularity of wireless communication has given rise to a diverse range of wireless technologies that compete for spectrum. In particular, 802.11 devices face a host of problems such as interference with other 802.11 devices (hidden terminals) as well as with technologies like Bluetooth and ZigBee. Understanding how the medium is utilized and inferring the cause of interference, based on observations from a single wireless node, is hard. Past work has used monitoring infrastructures to detect interference between 802.11 nodes in enterprise networks. In this paper, we try to answer the question: "how can we enable users to reason about wireless performance variations without requiring elaborate instrumentation and infrastructure support?". We propose WiMed, a tool that uses only local measurements from commodity 802.11 NICs (at the node being diagnosed) to construct a time map of how the medium is utilized. We have implemented a WiMed prototype using the MadWifi driver for Atheros NICs. Early results show that WiMed is useful and can characterize non-802.11 interference better than existing systems.},
booktitle = {ACM SIGCOMM Workshop on Home Networks},
pages = {43–48},
numpages = {6},
keywords = {802.11, monitoring, performance, heterogeneous environments, wireless networks, interference, bluetooth, diagnosis},
location = {Toronto, Ontario, Canada},
series = {HomeNets '11}
}

@inproceedings{2011-Liu-wintech,
author = {Liu, Xi and Seshan, Srinivasan and Steenkiste, Peter},
title = {When Are Directional Antennas Useful in Indoor Environments},
year = {2011},
isbn = {9781450308670},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2030718.2030731},
doi = {10.1145/2030718.2030731},
abstract = {Directional antenna systems can provide two benefits 1) improve signal strength and increase communication range, and 2) improve spatial reuse. Recent work has drawn contradicting conclusions in terms of which of the two benefits dominates in indoor environments. These contradicting conclusions are in fact caused by different levels of contention within the environments used in these studies, i.e., noise-dominated vs. interference-dominated.In this paper, we first show that due to emerging applications and technologies, wireless networks are becoming interference-dominated, and thus the ability of the directional antennas to improve spatial reuse is becoming critical. Evaluating the benefits of spatial reuse, however, is difficult especially in indoor environments where multipath have both good and bad effect on spatial reuse.In this paper, we use the separation metric to estimate the effectiveness of directional transmission and guide the placement of directional APs in any particular environment. The separation metric summarizes both the angular and the distance separation for a collection of transmissions in a particular environment. We show that this metric, though simple, is powerful enough to capture the various properties of the deployment and the potential interactions among the directional transmissions. Our experimental results show in several scenarios that the separation metric works well in practice.},
booktitle = WINTECH,
pages = {59–66},
numpages = {8},
keywords = {site planning, 60GHz, wireless capacity, separation metric, white-space, directional antenna},
location = {Las Vegas, Nevada, USA},
 month = sep,
   category = "Chaotic",
series = {WiNTECH '11}
}

@article{2011-Raghavendra-mc2r,
author = {Raghavendra, Ramya and Kaminsky, Michael and Papagiannaki, Konstantina and Seshan, Srinivasan and Belding, Elizabeth},
title = {IdleChat: Enabling High Bandwidth Real-Time Applications in Residential Broadband Networks},
year = {2011},
issue_date = {July 2011},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {15},
number = {3},
issn = {1559-1662},
url = {https://doi.org/10.1145/2073290.2073293},
doi = {10.1145/2073290.2073293},
  category = "Chaotic",
abstract = {Residential broadband links are characterized by low and variable upload capacity and large latencies, leading to poor video performance. Aggregating multiple backhaul links using 802.11 Access Points has been considered as a solution to increasing the backhaul capacity limit. In this paper, we revisit the problem of backhaul aggregation in the context of interactive applications. We present the IdleChat architecture that uses wireless connectivity to aggregate idle broadband connectivity in a neighborhood to overcome the limits of individual asymmetric broadband uplinks. In contrast to prior work, IdleChat aggregates in a traffic-aware manner, focussing specifically on low-latency, real-time link aggregation in support of interactive applications such as video chat. IdleChat schedules packets in a deadline-aware manner to improve interactivity. We evaluate IdleChat both in an experimental testbed in our lab and in a residential deployment. Our results show that use of IdleChat in existing deployments can improve video SNR by up to a factor of 10 db in the presence of a single neighboring AP. This results in video quality improvement from a MOS score of bad to excellent.},
journal = MC2R,
month = nov,
pages = {10–22},
numpages = {13}
}

@inproceedings{2012-Balachandran-hotnets,
author = {Balachandran, Athula and Sekar, Vyas and Akella, Aditya and Seshan, Srinivasan and Stoica, Ion and Zhang, Hui},
title = {A Quest for an Internet Video Quality-of-Experience Metric},
year = {2012},
isbn = {9781450317764},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2390231.2390248},
doi = {10.1145/2390231.2390248},
abstract = {An imminent challenge that content providers, CDNs, third-party analytics and optimization services, and video player designers in the Internet video ecosystem face is the lack of a single "gold standard" to evaluate different competing solutions. Existing techniques that describe the quality of the encoded signal or controlled studies to measure opinion scores do not translate directly into user experience at scale. Recent work shows that measurable performance metrics such as buffering, startup time, bitrate, and number of bitrate switches impact user experience. However, converting these observations into a quantitative quality-of-experience metric turns out to be challenging since these metrics are interrelated in complex and sometimes counter-intuitive ways, and their relationship to user experience can be unpredictable. To further complicate things, many confounding factors are introduced by the nature of the content itself (e.g., user interest, genre). We believe that the issue of interdependency can be addressed by casting this as a machine learning problem to build a suitable predictive model from empirical observations. We also show that setting up the problem based on domain-specific and measurement-driven insights can minimize the impact of the various confounding factors to improve the prediction performance.},
booktitle = HOTNETS,
pages = {97–102},
numpages = {6},
  month = 	 Oct,
  category = "Video",
location = {Redmond, Washington},
series = {HotNets-XI}
}

@InProceedings{2012-Han-nsdi-1,
  author = 	 {Dongsu Han and Ashok Anand and Fahad Dogar and Boyan Li and Hyeontaek Lim and Michel Machado and Arvind Mukundan and Wenfei Wu and Aditya Akella and David G Andersen and John W Byers and Srinivasan Seshan and Peter Steenkiste},
title = {{XIA}: Efficient Support for Evolvable Internetworking},
  category = "XIA",
  address = 	 {San Jose, CA},
  url = {https://www.usenix.org/conference/nsdi12/technical-sessions/presentation/han_dongsu_xia},
  booktitle = NSDI,
  year = {2012},
  isbn = {978-931971-92-8},
  pages = {309--322},
  publisher = {USENIX Association},
  month = apr,
}

@InProceedings{2012-Han-nsdi-2,
  author = 	 {Dongsu Han and Ashok Anand and Aditya Akella and Srinivasan Seshan},
  category = "CAN",
  title = {{RPT}: Re-architecting Loss Protection for {Content-Aware} Networks},
booktitle = NSDI,
year = {2012},
isbn = {978-931971-92-8},
address = {San Jose, CA},
pages = {71--84},
url = {https://www.usenix.org/conference/nsdi12/technical-sessions/presentation/han},
publisher = {USENIX Association},
month = apr,
}

@article{2012-Javed-sigops,
author = {Javed, Umar and Han, Dongsu and Caceres, Ramon and Pang, Jeffrey and Seshan, Srinivasan and Varshavsky, Alexander},
title = {Predicting Handoffs in 3G Networks},
year = {2012},
issue_date = {December 2011},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {45},
number = {3},
issn = {0163-5980},
url = {https://doi.org/10.1145/2094091.2094109},
doi = {10.1145/2094091.2094109},
abstract = {Consumers all over the world are increasingly using their smartphones on the go and expect consistent, high quality connectivity at all times. A key network primitive that enables continuous connectivity in cellular networks is handoff. Although handoffs are necessary for mobile devices to maintain connectivity, they can also cause short-term disruptions in application performance. Thus, applications could benefit from the ability to predict impending handoffs with reasonable accuracy, and modify their behavior to counter the performance degradation that accompanies handoffs. In this paper, we study whether attributes relating to the cellular network conditions measured at handsets can accurately predict handoffs. In particular, we develop a machine learning framework to predict handoffs in the near future. An evaluation on handoff traces from a large US cellular carrier shows that our approach can achieve 80\% accuracy - 27\% better than a naive predictor.},
journal = {SIGOPS Oper. Syst. Rev.},
month = jan,
pages = {65–70},
numpages = {6},
  category = "Chaotic",
keywords = {prediction, mobility, UMTS, measurement, handoff, 3G, wireless}
}

@article{2012-Kanuparthy-ccr,
author = {Kanuparthy, Partha and Dovrolis, Constantine and Papagiannaki, Konstantina and Seshan, Srinivasan and Steenkiste, Peter},
title = {Can User-Level Probing Detect and Diagnose Common Home-WLAN Pathologies},
year = {2012},
issue_date = {January 2012},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {42},
number = {1},
issn = {0146-4833},
url = {https://doi.org/10.1145/2096149.2096151},
doi = {10.1145/2096149.2096151},
abstract = {Common Wireless LAN (WLAN) pathologies include low signal-to-noise ratio, congestion, hidden terminals or interference from non-802.11 devices and phenomena. Prior work has focused on the detection and diagnosis of such problems using layer-2 information from 802.11 devices and special purpose access points and monitors, which may not be generally available. Here, we investigate a user-level approach: is it possible to detect and diagnose 802.11 pathologies with strictly user-level active probing, without any cooperation from, and without any visibility in, layer-2 devices? In this paper, we present preliminary but promising results indicating that such diagnostics are feasible.},
journal = CCR,
month = {jan},
pages = {7–15},
numpages = {9},
keywords = {probing, diagnosis, home networks, 802.11, performance}
}

@inproceedings{2012-Khan-hotmobile,
author = {Khan, Azeem J. and Subbaraju, V. and Misra, Archan and Seshan, Srinivasan},
title = {Mitigating the True Cost of Advertisement-Supported 'Free' Mobile Applications},
year = {2012},
isbn = {9781450312073},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2162081.2162083},
doi = {10.1145/2162081.2162083},
abstract = {The dominant, "ad-supported free application" model for consumer-oriented mobile computing is seemingly imperiled by the growing global adoption of metered data pricing plans by mobile operators. In this paper, we explore the opportunities for addressing this emerging conflict by enabling more intelligent ad delivery to such mobile devices. One especially promising path is leveraging the increasing availability of heterogeneous wireless access technologies (e.g., WiFi, femtocells) that offer less restrictive and more energy-efficient transport substrates for such data traffic. To understand the possibilities that exist, we first profile the advertisement traffic characteristics for some of the most popular advertisement-supported consumer applications, and then analyze the key features of mobile advertisement delivery. We then outline the principles of CAMEO, a middleware that uses predictive profiling of a user's {device, network and usage} context to anticipate the advertisements that need to be served, and then modulates their delivery mechanism to enable effective mobile advertising, but at considerably lower costs.},
booktitle = {Workshop on Mobile Computing Systems & Applications (HotMobile)},
articleno = {1},
numpages = {6},
  month = 	 Feb,
  category = "LARC",
location = {San Diego, California},
series = {HotMobile '12}
}

@inproceedings{2012-Luong-wintech,
author = {Luong, Trung-Tuan and Subbaraju, Vigneshwaran and Misra, Archan and Seshan, Srinivasan},
title = {Measurement-Driven Performance Analysis of Indoor Femtocellular Networks},
year = {2012},
isbn = {9781450315272},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2348688.2348695},
doi = {10.1145/2348688.2348695},
abstract = {This paper describes initial empirical studies, performed on a 6-node 3G indoor femtocellular testbed, that investigate the impact of pedestrian mobility on network parameters, such as handoff behavior and data throughput. The studies establish that, owing to the small radii of cells, even modest changes in movement speed can have disproportionately large impact on handoff patterns and network throughput. By also revealing a strong temporal dependency effect, the studies motivate the need for algorithms to accurately predict RF signal strength distributions in dynamic indoor environments. We present such an RF prediction algorithm, based on crowd-sourced signal strength readings, and show that the algorithm can predict RF signal strengths with an average estimation error of 3 dBm.},
booktitle = WINTECH,
pages = {19–26},
numpages = {8},
  month = 	 Aug,
  category = "LARC",
keywords = {crowd-sourced, femtocellular, rf signal},
location = {Istanbul, Turkey},
series = {WiNTECH '12}
}

@inproceedings{2012-Nychis-sigcomm,
author = {Nychis, George P. and Fallin, Chris and Moscibroda, Thomas and Mutlu, Onur and Seshan, Srinivasan},
title = {On-Chip Networks from a Networking Perspective: Congestion and Scalability in Many-Core Interconnects},
year = {2012},
isbn = {9781450314190},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2342356.2342436},
doi = {10.1145/2342356.2342436},
abstract = {In this paper, we present network-on-chip (NoC) design and contrast it to traditional network design, highlighting similarities and differences between the two. As an initial case study, we examine network congestion in bufferless NoCs. We show that congestion manifests itself differently in a NoC than in traditional networks. Network congestion reduces system throughput in congested workloads for smaller NoCs (16 and 64 nodes), and limits the scalability of larger bufferless NoCs (256 to 4096 nodes) even when traffic has locality (e.g., when an application's required data is mapped nearby to its core in the network). We propose a new source throttling-based congestion control mechanism with application-level awareness that reduces network congestion to improve system performance. Our mechanism improves system performance by up to 28\% (15\% on average in congested workloads) in smaller NoCs, achieves linear throughput scaling in NoCs up to 4096 cores (attaining similar performance scalability to a NoC with large buffers), and reduces power consumption by up to 20\%. Thus, we show an effective application of a network-level concept, congestion control, to a class of networks -- bufferless on-chip networks -- that has not been studied before by the networking community.},
booktitle = SIGCOMM,
pages = {407–418},
numpages = {12},
  month = 	 Aug,
  category = "Misc",
keywords = {congestion control, multi-core, on-chip networks},
location = {Helsinki, Finland},
series = {SIGCOMM '12}
}

@inproceedings{2012-Weinsberg-hotnets,
author = {Weinsberg, Udi and Li, Qingxi and Taft, Nina and Balachandran, Athula and Sekar, Vyas and Iannaccone, Gianluca and Seshan, Srinivasan},
title = {CARE: Content Aware Redundancy Elimination for Challenged Networks},
year = {2012},
isbn = {9781450317764},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2390231.2390253},
doi = {10.1145/2390231.2390253},
abstract = {This paper presents the design of a novel architecture called CARE (Content-Aware Redundancy Elimination) that enables maximizing the informational value that challenged networks offer their users. We focus on emerging applications for situational awareness in disaster affected regions. Motivated by advances in computer vision algorithms, we propose to incorporate image similarity detection algorithms in the forwarding path of these networks. The purpose is to handle the large generation of redundant content. We outline the many issues involved in such a vision. With a Delay-Tolerant Network (DTN) setup, our simulations demonstrate that CARE can substantially boost the number of unique messages that escape the disaster zone, and it can also deliver them faster. These benefits are achieved despite the energy overhead needed by the similarity detectors.},
booktitle = HOTNETS,
pages = {127–132},
numpages = {6},
  month = 	 Oct,
  category = "CAN",
keywords = {image similarity, informational value, network architecture, challenged networks},
location = {Redmond, Washington},
series = {HotNets-XI}
}

@inproceedings{2013-Anand-conext,
author = {Anand, Ashok and Balachandran, Athula and Akella, Aditya and Sekar, Vyas and Seshan, Srinivasan},
title = {Enhancing Video Accessibility and Availability Using Information-Bound References},
year = {2013},
isbn = {9781450321013},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2535372.2535393},
doi = {10.1145/2535372.2535393},
abstract = {Users are often frustrated when they cannot view video links shared via blogs, social networks, and shared bookmark sites on their devices or suffer performance and usability problems when doing so. While other versions of the same content better suited to their device and network constraints may be available on other third-party hosting sites, these remain unusable because users cannot efficiently discover these and verify that these variants match the content publisher's original intent. Our vision is to enable consumers to leverage verifiable alternatives from different hosting sites that are best suited to their constraints to deliver a high quality of experience and enable content publishers to reach a wide audience with diverse operating conditions with minimal upfront costs. To this end, we make a case for information-bound references or IBRs that bind references to video content to the underlying information that a publisher wants to convey, decoupled from details such as protocols, hosts, file names, or the underlying bits. This paper addresses key challenges in the design and implementation of IBR generation and resolution mechanisms, and presents an evaluation of the benefits IBRs offer.},
booktitle = CONEXT,
pages = {345–356},
numpages = {12},
  month = 	 Dec,
  award = {Best Paper Award},
  category = "Video",
keywords = {references, video, qoe, availability, accessibility},
location = {Santa Barbara, California, USA},
series = {CoNEXT '13}
}

@inproceedings{2013-Balachandran-imc,
author = {Balachandran, Athula and Sekar, Vyas and Akella, Aditya and Seshan, Srinivasan},
title = {Analyzing the Potential Benefits of CDN Augmentation Strategies for Internet Video Workloads},
year = {2013},
  month = 	 Oct,
  category = "Video",
isbn = {9781450319539},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2504730.2504743},
doi = {10.1145/2504730.2504743},
abstract = {Video viewership over the Internet is rising rapidly, and market predictions suggest that video will comprise over 90\% of Internet traffic in the next few years. At the same time, there have been signs that the Content Delivery Network (CDN) infrastructure is being stressed by ever-increasing amounts of video traffic. To meet these growing demands, the CDN infrastructure must be designed, provisioned and managed appropriately. Federated telco-CDNs and hybrid P2P-CDNs are two content delivery infrastructure designs that have gained significant industry attention recently. We observed several user access patterns that have important implications to these two designs in our unique dataset consisting of 30 million video sessions spanning around two months of video viewership from two large Internet video providers. These include partial interest in content, regional interests, temporal shift in peak load and patterns in evolution of interest. We analyze the impact of our findings on these two designs by performing a large scale measurement study. Surprisingly, we find significant amount of synchronous viewing behavior for Video On Demand (VOD) content, which makes hybrid P2P-CDN approach feasible for VOD and suggest new strategies for CDNs to reduce their infrastructure costs. We also find that federation can significantly reduce telco-CDN provisioning costs by as much as 95\%.},
booktitle = IMC,
pages = {43–56},
numpages = {14},
keywords = {measurement, user behavior, internet video},
location = {Barcelona, Spain},
series = {IMC '13}
}

@inproceedings{2013-Balachandran-sigcomm,
author = {Balachandran, Athula and Sekar, Vyas and Akella, Aditya and Seshan, Srinivasan and Stoica, Ion and Zhang, Hui},
title = {Developing a Predictive Model of Quality of Experience for Internet Video},
year = {2013},
  month = 	 Aug,
  category = "Video",
isbn = {9781450320566},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2486001.2486025},
doi = {10.1145/2486001.2486025},
abstract = {Improving users' quality of experience (QoE) is crucial for sustaining the advertisement and subscription based revenue models that enable the growth of Internet video. Despite the rich literature on video and QoE measurement, our understanding of Internet video QoE is limited because of the shift from traditional methods of measuring video quality (e.g., Peak Signal-to-Noise Ratio) and user experience (e.g., opinion scores). These have been replaced by new quality metrics (e.g., rate of buffering, bitrate) and new engagement centric measures of user experience (e.g., viewing time and number of visits). The goal of this paper is to develop a predictive model of Internet video QoE. To this end, we identify two key requirements for the QoE model: (1) it has to be tied in to observable user engagement and (2) it should be actionable to guide practical system design decisions. Achieving this goal is challenging because the quality metrics are interdependent, they have complex and counter-intuitive relationships to engagement measures, and there are many external factors that confound the relationship between quality and engagement (e.g., type of video, user connectivity). To address these challenges, we present a data-driven approach to model the metric interdependencies and their complex relationships to engagement, and propose a systematic framework to identify and account for the confounding factors. We show that a delivery infrastructure that uses our proposed model to choose CDN and bitrates can achieve more than 20\% improvement in overall user engagement compared to strawman approaches.},
booktitle = SIGCOMM,
pages = {339–350},
numpages = {12},
keywords = {video quality, measurement, peformance, human factors},
location = {Hong Kong, China},
series = {SIGCOMM '13}
}

@inproceedings{2013-Balachandran-sigmetrics,
author = {Balachandran, Athula and Sekar, Vyas and Akella, Aditya and Seshan, Srinivasan},
title = {Understanding Internet Video Viewing Behavior in the Wild},
year = {2013},
month = jun,
isbn = {9781450319003},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2465529.2465534},
doi = {10.1145/2465529.2465534},
abstract = {Over the past few years video viewership over the Internet has risen dramatically and market predictions suggest that video will account for more than 50\% of the traffic over the Internet in the next few years. Unfortunately, there has been signs that the Content Delivery Network (CDN) infrastructure is being stressed with the increasing video viewership load. Our goal in this paper is to provide a first step towards a principled understanding of how the content delivery infrastructure must be designed and provisioned to handle the increasing workload by analyzing video viewing behaviors and patterns in the wild. We analyze various viewing behaviors using a dataset consisting of over 30 million video sessions spanning two months of viewership from two large Internet video providers. In these preliminary results, we observe viewing patterns that have significant impact on the design of the video delivery infrastructure.},
booktitle = SIGMETRICS,
pages = {379–380},
numpages = {2},
keywords = {internet video, user behavior},
notes = "poster",
location = {Pittsburgh, PA, USA},
series = {SIGMETRICS '13}
}

@inproceedings{2013-Han-sigcomm,
author = {Han, Dongsu and Grandl, Robert and Akella, Aditya and Seshan, Srinivasan},
title = {FCP: A Flexible Transport Framework for Accommodating Diversity},
year = {2013},
isbn = {9781450320566},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2486001.2486004},
doi = {10.1145/2486001.2486004},
abstract = {Transport protocols must accommodate diverse application and network requirements. As a result, TCP has evolved over time with new congestion control algorithms such as support for generalized AIMD, background flows, and multipath. On the other hand, explicit congestion control algorithms have been shown to be more efficient. However, they are inherently more rigid because they rely on in-network components. Therefore, it is not clear whether they can be made flexible enough to support diverse application requirements. This paper presents a flexible framework for network resource allocation, called FCP, that accommodates diversity by exposing a simple abstraction for resource allocation. FCP incorporates novel primitives for end-point flexibility (aggregation and preloading) into a single framework and makes economics-based congestion control practical by explicitly handling load variations and by decoupling it from actual billing. We show that FCP allows evolution by accommodating diversity and ensuring coexistence, while being as efficient as existing explicit congestion control algorithms.},
booktitle = SIGCOMM,
pages = {135–146},
numpages = {12},
  month = 	 Aug,
  category = "XIA",
keywords = {transport protocol, congestion control, end-point flexibility},
location = {Hong Kong, China},
series = {SIGCOMM '13}
}

@inproceedings{2013-Khan-mobisys,
author = {Khan, Azeem J. and Jayarajah, Kasthuri and Han, Dongsu and Misra, Archan and Balan, Rajesh and Seshan, Srinivasan},
title = {CAMEO: A Middleware for Mobile Advertisement Delivery},
year = {2013},
  month = 	 Jun,
  category = "LARC",
isbn = {9781450316729},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2462456.2464436},
doi = {10.1145/2462456.2464436},
abstract = {Advertisements are the de-facto currency of the Internet with many popular applications (e.g. Angry Birds) and online services (e.g., YouTube) relying on advertisement generated revenue. However, the current economic models and mechanisms for mobile advertising are fundamentally not sustainable and far from ideal. In particular, as we show, applications which use mobile advertising are capable of using significant amounts of a mobile users' critical resources without being controlled or held accountable. This paper seeks to redress this situation by enabling advertisement supported applications to become significantly more ``user-friendly''. To this end, we present the design and implementation of CAMEO, a new framework for mobile advertising that 1) employs intelligent and proactive retrieval of advertisements, using context prediction, to significantly reduce the bandwidth and energy overheads of advertising, and 2) provides a negotiation protocol and framework that empowers applications to subsidize their data traffic costs by ``bartering'' their advertisement rights for access bandwidth from mobile ISPs. Our evaluation, that uses real mobile advertising data collected from around the globe, demonstrates that CAMEO effectively reduces the resource consumption caused by mobile advertising.},
booktitle = MOBISYS,
pages = {125–138},
numpages = {14},
keywords = {wireless, mobile, advertising},
location = {Taipei, Taiwan},
series = {MobiSys '13}
}

@inproceedings{2013-Mukerjee-conext,
author = {Mukerjee, Matthew K. and Han, Dongsu and Seshan, Srinivasan and Steenkiste, Peter},
title = {Understanding Tradeoffs in Incremental Deployment of New Network Architectures},
year = {2013},
  month = 	 Dec,
  category = "XIA",
isbn = {9781450321013},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2535372.2535396},
doi = {10.1145/2535372.2535396},
abstract = {Despite the plethora of incremental deployment mechanisms proposed, rapid adoption of new network-layer protocols and architectures remains difficult as reflected by the widespread lack of IPv6 traffic on the Internet. We show that all deployment mechanisms must address four key questions: How to select an egress from the source network, how to select an ingress into the destination network, how to reach that egress, and how to reach that ingress. By creating a design space that maps all existing mechanisms by how they answer these questions, we identify the lack of existing mechanisms in part of this design space and propose two novel approaches: the "4ID" and the "Smart 4ID". The 4ID mechanism utilizes new data plane technology to flexibly decide when to encapsulate packets at forwarding time. The Smart 4ID mechanism additionally adopts an SDN-style control plane to intelligently pick ingress/egress pairs based on a wider view of the local network. We implement these mechanisms along with two widely used IPv6 deployment mechanisms and conduct wide-area deployment experiments over PlanetLab. We conclude that Smart 4ID provide better overall performance and failure semantics, and that innovations in the data plane and control plane enable straightforward incremental deployment.},
booktitle = CONEXT,
pages = {271–282},
numpages = {12},
keywords = {network architectures, incremental deployment, future internet architectures},
location = {Santa Barbara, California, USA},
series = {CoNEXT '13}
}

@InProceedings{2013-Wang-icra,
  author = 	 {Richard Wang and Manuela Veloso and Srinivasan Seshan},
  title = 	 {Multi-robot information sharing for complementing limited perception: A case study of moving ball interception},
  booktitle=ICRA,
  year = 	 {2013},
  month = 	 May,
  category = "Robotics",
  address = 	 {Karlsruhe, Germany},
  doi={10.1109/ICRA.2013.6630826},
  url = {https://doi.org/10.1109/ICRA.2013.6630826}
}

@InProceedings{2013-Wang-robocup,
author="Wang, Richard and Veloso, Manuela and Seshan, Srinivasan",
editor="Behnke, Sven and Veloso, Manuela and Visser, Arnoud and Xiong, Rong",
title = 	 {Iterative Snapping of Odometry Trajectories for Path Identification},
booktitle="RoboCup 2013: Robot World Cup XVII",
year="2014",
publisher="Springer Berlin Heidelberg",
address="Berlin, Heidelberg",
location =  {Eindhoven, Netherlands},
pages="432--443",
month = 	 Jul,
abstract="An increasing number of mobile devices are capable of automatically sensing and recording rich information about the surrounding environment. Spatial locations of such data can help to better learn about the environment. In this work, we address the problem of identifying the locations visited by a mobile device as it moves within an indoor environment. We focus on devices equipped with odometry sensors that capture changes in motion. Odometry suffers from cumulative errors of dead reckoning but it captures the relative shape of the traversed path well. Our approach will correct such errors by matching the shape of the trajectory from odometry to traversable paths of a known map. Our algorithm is inspired by prior vehicular GPS map matching techniques that snap global GPS measurements to known roads. We similarly wish to snap the trajectory from odometry to known hallways. Several modifications are required to ensure these techniques are robust when given relative measurements from odometry. If we assume an office-like environment with only straight hallways, then a significant rotation indicates a transition to another hallway. As a result, we partition the trajectory into line segments based on significant turns. Each trajectory segment is snapped to a corresponding hallway that best maintains the shape of the original trajectory. These snapping decisions are made based on the similarity of the two curves as well as the rotation to transition between hallways. We will show robustness under different types of noise in complex environments and the ability to propose coarse sensor noise errors.",
isbn="978-3-662-44468-9",
doi = {10.1007/978-3-662-44468-9_38},
url = {https://doi.org/10.1007/978-3-662-44468-9_38}
}

@inproceedings{2014-Balachandran-mobicom,
author = {Balachandran, Athula and Aggarwal, Vaneet and Halepovic, Emir and Pang, Jeffrey and Seshan, Srinivasan and Venkataraman, Shobha and Yan, He},
title = {Modeling Web Quality-of-Experience on Cellular Networks},
year = {2014},
isbn = {9781450327831},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2639108.2639137},
doi = {10.1145/2639108.2639137},
abstract = {Recent studies have shown that web browsing is one of the most prominent cellular applications. It is therefore important for cellular network operators to understand how radio network characteristics (such as signal strength, handovers, load, etc.) influence users' web browsing Quality-of-Experience (web QoE). Understanding the relationship between web QoE and network characteristics is a pre-requisite for cellular network operators to detect when and where degraded network conditions actually impact web QoE. Unfortunately, cellular network operators do not have access to detailed server-side or client-side logs to directly measure web QoE metrics, such as abandonment rate and session length. In this paper, we first devise a machine-learning-based mechanism to infer web QoE metrics from network traces accurately. We then present a large-scale study characterizing the impact of network characteristics on web QoE using a month-long anonymized dataset collected from a major cellular network provider. Our results show that improving signal-to-noise ratio, decreasing load and reducing handovers can improve user experience. We find that web QoE is very sensitive to inter-radio-access-technology (IRAT) handovers. We further find that higher radio data link rate does not necessarily lead to better web QoE. Since many network characteristics are interrelated, we also use machine learning to accurately model the influence of radio network characteristics on user experience metrics. This model can be used by cellular network operators to prioritize the improvement of network factors that most influence web QoE.},
booktitle = MOBICOM,
pages = {213–224},
numpages = {12},
  month = Sep,
  category = "Video",
keywords = {web browsing, performance, quality of experience (qoe), cellular network},
location = {Maui, Hawaii, USA},
series = {MobiCom '14}
}

@inproceedings{2014-Muralidharan-debs,
author = {Muralidharan, Kartik and Seshan, Srinivasan and Ramasubbu, Narayan and Balan, Rajesh Krishna},
title = {Handling Location Uncertainty in Event Driven Experimentation},
year = {2014},
  month = May,
  category = "LARC",
isbn = {9781450327374},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2611286.2611303},
doi = {10.1145/2611286.2611303},
abstract = {The wide spread use of smart phones has ushered in a wave of context-based advertising services that operate on pre-defined user events. A prime example is Location Based Advertising. What is missing though, is the ability to experiment with these services under varying event conditions with real users using their regular phones in real-world environments. Such experiments provide greater insight into user needs for and responsiveness towards context-based advertising applications. However, these event-driven experiments rely on data that arrive from sources such as mobile sensors which have inherent uncertainties associated with them. This effects the interpretation of the outcome of an experiment. In this paper we introduce Jarvis, a behavioural experimentation platform that supports running in-situ real-time experiments of mobile advertising services, targeting real participants on their smart phones based on multiple context-specific events. We highlight the challenges of handling uncertainty on such a platform as well as how we deal with ambiguity in the location attribute.},
booktitle = {ACM International Conference on Distributed Event-Based Systems},
pages = {206–212},
numpages = {7},
keywords = {context uncertainty, event processing},
location = {Mumbai, India},
series = {DEBS '14}
}

@article{2014-Naylor-ccr,
author = {Naylor, David and Mukerjee, Matthew K. and Agyapong, Patrick and Grandl, Robert and Kang, Ruogu and Machado, Michel and Brown, Stephanie and Doucette, Cody and Hsiao, Hsu-Chun and Han, Dongsu and Kim, Tiffany Hyun-Jin and Lim, Hyeontaek and Ovon, Carol and Zhou, Dong and Lee, Soo Bum and Lin, Yue-Hsun and Stuart, Colleen and Barrett, Daniel and Akella, Aditya and Andersen, David and Byers, John and Dabbish, Laura and Kaminsky, Michael and Kiesler, Sara and Peha, Jon and Perrig, Adrian and Seshan, Srinivasan and Sirbu, Marvin and Steenkiste, Peter},
title = {XIA: Architecting a More Trustworthy and Evolvable Internet},
year = {2014},
issue_date = {July 2014},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
volume = {44},
number = {3},
issn = {0146-4833},
url = {https://doi.org/10.1145/2656877.2656885},
doi = {10.1145/2656877.2656885},
abstract = {Motivated by limitations in today's host-centric IP network, recent studies have proposed clean-slate network architectures centered around alternate first-class principals, such as content, services, or users. However, muchlike the host-centric IP design, elevating one principal type above others hinders communication between other principals and inhibits the network's capability to evolve. This paper presents the eXpressive Internet Architecture (XIA), an architecture with native support for multiple principals and the ability to evolve its functionality to accommodate new, as yet unforeseen, principals over time. We present the results of our ongoing research motivated by and building on the XIA architecture, ranging from topics at the physical level (``how fast can XIA go'') up through to the user level.},
journal = CCR,
month = jul,
pages = {50–57},
numpages = {8},
  category = "XIA",
keywords = {network addressing, internet architecture}
}

@inproceedings{2014-Nychis-Dyspan,
  title={Centralized, measurement-based, spectrum management for environments with heterogeneous wireless networks},
  author={Nychis, George and Tsourakakis, Charalampos and Seshan, Srinivasan and Steenkiste, Peter},
  booktitle={2014 IEEE International Symposium on Dynamic Spectrum Access Networks (DYSPAN)},
  pages={303--314},
  year={2014},
  organization={IEEE},
  month = Apr,
  category = "Chaotic",
  address = {Mclean, VA},
  doi={10.1109/DySPAN.2014.6817807},
  url = {https://doi.org/10.1109/DySPAN.2014.6817807}
}

@inproceedings{2014-Nychis-hotwireless,
author = {Nychis, George and Seshan, Srinivasan and Steenkiste, Peter},
title = {Using Your Smartphone to Detect and Map Heterogeneous Networks and Devices in the Home},
year = {2014},
isbn = {9781450330763},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2643614.2643624},
doi = {10.1145/2643614.2643624},
abstract = {Heterogeneity in the wireless spectrum is an increasing problem which breaks down coordination and exacerbates wireless interference. In particular, this is a growing problem in the home: heterogeneity is increasing, yet there is a lack of tools and expertise in the home to gather the necessary information about its RF environment to combat this issue.In this paper, we present a unique monitoring system design which leverages the smartphone: now commodity, flexible and familiar to the home user, and equipped with multiple heterogeneous for sensing. Our design overcomes challenges inherent to monitoring with the phone (e.g., it is location agnostic without in-door localization) to derive where signals go and what they interfere with. It does so only requiring simple user-interaction, and as we will show, can bring the information to a level the user can understand.},
booktitle = {ACM Workshop on Hot Topics in Wireless},
pages = {31–36},
numpages = {6},
  month = Sep,
  category = "Chaotic",
keywords = {smartphone, heterogeneous networks, conflict graph, wireless monitoring},
location = {Maui, Hawaii, USA},
series = {HotWireless '14}
}

@InProceedings{2014-Wang-icra,
  author = 	 {Richard Wang and Manuela Veloso and Srinivasan Seshan},
  title={O-Snap: Optimal snapping of odometry trajectories for route identification},
  booktitle=ICRA,
  year = 	 {2014},
  month = 	 May,
  pages={5824--5829},
  organization={IEEE},
  category = "Robotics",
  address = 	 {Hong Kong, China},
  doi={10.1109/ICRA.2014.6907715},
  url={https://doi.org/10.1109/ICRA.2014.6907715}
}

@inproceedings{2015-Liu-conext,
author = {Liu, He and Mukerjee, Matthew K. and Li, Conglong and Feltman, Nicolas and Papen, George and Savage, Stefan and Seshan, Srinivasan and Voelker, Geoffrey M. and Andersen, David G. and Kaminsky, Michael and Porter, George and Snoeren, Alex C.},
title = {Scheduling Techniques for Hybrid Circuit/Packet Networks},
year = {2015},
  month = 	 Dec,
  category = "Misc",
isbn = {9781450334129},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2716281.2836126},
doi = {10.1145/2716281.2836126},
abstract = {A range of new datacenter switch designs combine wireless or optical circuit technologies with electrical packet switching to deliver higher performance at lower cost than traditional packet-switched networks. These "hybrid" networks schedule large traffic demands via a high-rate circuits and remaining traffic with a lower-rate, traditional packet-switches. Achieving high utilization requires an efficient scheduling algorithm that can compute proper circuit configurations and balance traffic across the switches. Recent proposals, however, provide no such algorithm and rely on an omniscient oracle to compute optimal switch configurations.Finding the right balance of circuit and packet switch use is difficult: circuits must be reconfigured to serve different demands, incurring non-trivial switching delay, while the packet switch is bandwidth constrained. Adapting existing crossbar scheduling algorithms proves challenging with these constraints. In this paper, we formalize the hybrid switching problem, explore the design space of scheduling algorithms, and provide insight on using such algorithms in practice. We propose a heuristic-based algorithm, Solstice that provides a 2.9\texttimes{} increase in circuit utilization over traditional scheduling algorithms, while being within 14\% of optimal, at scale.},
booktitle = CONEXT,
articleno = {41},
numpages = {13},
keywords = {packet networks, circuit networks, hybrid networks},
location = {Heidelberg, Germany},
series = {CoNEXT '15}
}

@inproceedings{2015-Mukerjee-Sigcomm,
author = {Mukerjee, Matthew K. and Naylor, David and Jiang, Junchen and Han, Dongsu and Seshan, Srinivasan and Zhang, Hui},
title = {Practical, Real-Time Centralized Control for CDN-Based Live Video Delivery},
year = {2015},
  month= Aug,
  category = "Video",
isbn = {9781450335423},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2785956.2787475},
doi = {10.1145/2785956.2787475},
abstract = {Live video delivery is expected to reach a peak of 50 Tbps this year. This surging popularity is fundamentally changing the Internet video delivery landscape. CDNs must meet users' demands for fast join times, high bitrates, and low buffering ratios, while minimizing their own cost of delivery and responding to issues in real-time. Wide-area latency, loss, and failures, as well as varied workloads ("mega-events" to long-tail), make meeting these demands challenging.An analysis of video sessions concluded that a centralized controller could improve user experience, but CDN systems have shied away from such designs due to the difficulty of quickly handling failures, a requirement of both operators and users. We introduce VDN, a practical approach to a video delivery network that uses a centralized algorithm for live video optimization. VDN provides CDN operators with real-time, fine-grained control. It does this in spite of challenges resulting from the wide-area (e.g., state inconsistency, partitions, failures) by using a hybrid centralized+distributed control plane, increasing average bitrate by 1.7x and decreasing cost by 2x in different scenarios.},
booktitle = SIGCOMM,
pages = {311–324},
numpages = {14},
keywords = {hybrid control, live video, CDNs, central optimization},
location = {London, United Kingdom},
series = {SIGCOMM '15}
}

@InProceedings{2015-Shroff-aaai,
  author = 	 {Ravi Shroff and Y. Zha and Richard Wang and Manuela Veloso and Srinivasan Seshan},
  title = 	 {Indoor Trajectory Identification: Snapping with Uncertainty},
  booktitle = "AAAI Conference on Artificial Intelligence",
  year = 	 {2015},
  month = 	 Jan,
  category = "Robotics",
  address = 	 {Austin, TX}
}

@InProceedings{2015-Wang-finer,
  author = 	 {Richard Wang and Manuela Veloso and Srinivasan Seshan},
  title = 	 {Using Autonomous Robots to Diagnose Wireless Connectivity},
  booktitle = "Workshop on The Path to Success: Failures in rEal Robots (FinE-R)(FINER'15)",
  year = 	 {2015},
  month = 	 Oct,
  category = "Robotics",
  address = 	 {Hamburg, Germany}
}

@InProceedings{2015-Wang-icra,
  author = 	 {Richard Wang and Matthew Mukerjee and Manuela Veloso and Srinivasan Seshan},
  title = 	 {Wireless Map-Based Handoffs for Mobile Robots},
  booktitle=ICRA,
  year = 	 {2015},
  month = 	 May,
  category = "Robotics",
  address = 	 {Seattle, WA},
  pages={5545-5550},
  doi={10.1109/ICRA.2015.7139974},
  url = {https://doi.org/10.1109/ICRA.2015.7139974}
}

@InProceedings{2015-Wang-iros,
  author = 	 {Richard Wang and Ravi Shroff and Y. Zha and Manuela Veloso and Srinivasan Seshan},
  title = 	 {Indoor Trajectory Identification: Snapping with Uncertainty},
  booktitle = "IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'15)",
  year = 	 {2015},
  month = 	 Sep,
  category = "Robotics",
  address = 	 {Hamburg, Germany},
    pages={4901-4906},
  doi={10.1109/IROS.2015.7354066},
  url={https://doi.org/10.1109/IROS.2015.7354066}
}

@inproceedings{2015-Yu-hotnets,
author = {Yu, Tianlong and Sekar, Vyas and Seshan, Srinivasan and Agarwal, Yuvraj and Xu, Chenren},
title = {Handling a Trillion (Unfixable) Flaws on a Billion Devices: Rethinking Network Security for the Internet-of-Things},
year = {2015},
  month = 	 Nov,
  category = "Security",
isbn = {9781450340472},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/2834050.2834095},
doi = {10.1145/2834050.2834095},
abstract = {The Internet-of-Things (IoT) has quickly moved from the realm of hype to reality with estimates of over 25 billion devices deployed by 2020. While IoT has huge potential for societal impact, it comes with a number of key security challenges---IoT devices can become the entry points into critical infrastructures and can be exploited to leak sensitive information. Traditional host-centric security solutions in today's IT ecosystems (e.g., antivirus, software patches) are fundamentally at odds with the realities of IoT (e.g., poor vendor security practices and constrained hardware). We argue that the network will have to play a critical role in securing IoT deployments. However, the scale, diversity, cyberphysical coupling, and cross-device use cases inherent to IoT require us to rethink network security along three key dimensions: (1) abstractions for security policies; (2) mechanisms to learn attack and normal profiles; and (3) dynamic and context-aware enforcement capabilities. Our goal in this paper is to highlight these challenges and sketch a roadmap to avoid this impending security disaster.},
booktitle = HOTNETS,
articleno = {5},
numpages = {7},
location = {Philadelphia, PA, USA},
series = {HotNets-XIV}
}

@Misc{2016-Akella-patent,
  author = 	 {Srinivasa Aditya Akella and Ashok Anand and Srinivasan Seshan},
  title = 	 {Network routing system providing increased network bandwidth},
  howpublished = {US Patent 9,438,504},
  month = 	 Sep,
  year = 	 {2016},
}

@article{2016-Anand-ton,
author = {Anand, Ashok and Balachandran, Athula and Akella, Aditya and Sekar, Vyas and Seshan, Srinivasan},
title = {Enhancing Video Accessibility and Availability Using Information-Bound References},
year = {2016},
issue_date = {April 2016},
publisher = {IEEE Press},
volume = {24},
number = {2},
issn = {1063-6692},
url = {https://doi.org/10.1109/TNET.2015.2413352},
doi = {10.1109/TNET.2015.2413352},
abstract = {Users are often frustrated when they cannot view video links shared via blogs, social networks, and shared bookmark sites on their devices or suffer performance and usability problems when doing so. While other versions of the same content better suited to their device and network constraints may be available on other third-party hosting sites, these remain unusable because users cannot efficiently discover these and verify that these variants match the content publisher's original intent. Our vision is to enable consumers to leverage verifiable alternatives from different hosting sites that are best suited to their constraints to deliver a high quality of experience and enable content publishers to reach a wide audience with diverse operating conditions with minimal upfront costs. To this end, we make a case for information-bound references or IBRs that bind references to video content to the underlying information that a publisher wants to convey, decoupled from details such as protocols, hosts, file names, or the underlying bits. This paper addresses key challenges in the design and implementation of IBR generation and resolution mechanisms, and presents an evaluation of the benefits IBRs offer.},
journal = TON,
month = apr,
pages = {1223–1236},
numpages = {14}
}

@inproceedings{2016-Mukerjee-hotnets,
author = {Mukerjee, Matthew K. and Bozkurt, Ilker Nadi and Maggs, Bruce and Seshan, Srinivasan and Zhang, Hui},
title = {The Impact of Brokers on the Future of Content Delivery},
year = {2016},
month = nov,
isbn = {9781450346610},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3005745.3005749},
doi = {10.1145/3005745.3005749},
abstract = {Various trends are reshaping content delivery on the Internet: the explosive growth of traffic due to video, users' increasing expectations for higher quality of experience (QoE), and the proliferation of server capacity from a variety of sources (e.g., cloud computing, content provider-owned datacenters, and ISP-owned CDNs). In order to meet the scale and quality demands imposed by users, content providers have started to spread demand across a variety of CDNs using a broker. Brokers break many traditional CDN assumptions (e.g., unexpected traffic skew, significant variance in demand over short timescales, etc.). Through an analysis of data from a leading broker and a leading CDN, we show the potential challenges and opportunities that brokers impart on content delivery. We take the first steps towards improvement through a redesigned broker-CDN interface.},
booktitle = HOTNETS,
pages = {127–133},
numpages = {7},
location = {Atlanta, GA, USA},
series = {HotNets '16}
}

@InProceedings{2016-Wang-icra,
  author = 	 {Richard Wang and Manuela Veloso and Srinivasan Seshan},
  title = 	 {Active Sensing Data Collection with Autonomous Mobile Robots},
  booktitle=ICRA,
  year = 	 {2016},
  month = 	 May,
  address = 	 {Stockholm, Sweden},
  category = "Robotics",
  pages={2583-2588},
  doi={10.1109/ICRA.2016.7487415},
  url={https://doi.org/10.1109/ICRA.2016.7487415}
}

@inproceedings{2017-Li-ancs,
author = {Li, Conglong and Mukerjee, Matthew K. and Andersen, David G. and Seshan, Srinivasan and Kaminsky, Michael and Porter, George and Snoeren, Alex C.},
title = {Using Indirect Routing to Recover from Network Traffic Scheduling Estimation Error},
year = {2017},
isbn = {9781509063864},
publisher = {IEEE Press},
url = {https://doi.org/10.1109/ANCS.2017.12},
doi = {10.1109/ANCS.2017.12},
abstract = {Increasingly, proposals for new datacenter networking fabrics employ some form of traffic scheduling---often to avoid congestion, mitigate queuing delays, or avoid timeouts. Fundamentally, practical implementations require estimating upcoming traffic demand. Unfortunately, as our results show, it is difficult to accurately predict demand in typical datacenter applications more than a few milliseconds ahead of time. We explore the impact of errors in demand estimation on traffic scheduling in circuit-switched networks. We show that even relatively small estimation errors such as shifting the arrival time of at most 30\% of traffic by a few milliseconds can lead to suboptimal schedules that dramatically reduce network efficiency. Existing systems cope by provisioning extra capacity---either on each circuit, or through the addition of a separate packet-switched fabric. We show through simulation that indirect traffic routing is a powerful technique for recovering from the inefficiencies of suboptimal scheduling under common datacenter workloads, performing as well as networks with 16\% extra circuit bandwidth or a packet switch with 6\% of the circuit bandwidth.},
booktitle = {Symposium on Architectures for Networking and Communications Systems (ANCS)},
pages = {13–24},
numpages = {12},
location = {Beijing, China},
category = "Optics",
month=May,
series = {ANCS '17}
}

@inproceedings{2017-Mukerjee-conext,
author = {Mukerjee, Matthew K. and Bozkurt, Ilker Nadi and Ray, Devdeep and Maggs, Bruce M. and Seshan, Srinivasan and Zhang, Hui},
title = {Redesigning CDN-Broker Interactions for Improved Content Delivery},
year = {2017},
month = nov,
isbn = {9781450354226},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3143361.3143366},
doi = {10.1145/3143361.3143366},
abstract = {Various trends are reshaping Internet video delivery: exponential growth in video traffic, rising expectations of high video quality of experience (QoE), and the proliferation of varied content delivery network (CDN) deployments (e.g., cloud computing-based, content provider-owned datacenters, and ISP-owned CDNs). More fundamentally though, content providers are shifting delivery from a single CDN to multiple CDNs, through the use of a content broker. Brokers have been shown to invalidate many traditional delivery assumptions (e.g., shifting traffic invalidates short- and long-term traffic prediction) by not communicating their decisions with CDNs. In this work, we analyze these problems using data from a CDN and a broker. We examine the design space of potential solutions, finding that a marketplace design (inspired by advertising exchanges) potentially provides interesting tradeoffs. A marketplace allows all CDNs to profit on video delivery through fine-grained pricing and optimization, where CDNs learn risk-adverse bidding strategies to aid in traffic prediction. We implement a marketplace-based system (which we dub Video Delivery eXchange or VDX) in CDN and broker data-driven simulation, finding significant improvements in cost and data-path distance.},
booktitle = CONEXT,
pages = {68–80},
numpages = {13},
keywords = {content brokers, interfaces, CDNs, content delivery},
location = {Incheon, Republic of Korea},
 award = {Best Paper Award},
 category = "Web/Video",
series = {CoNEXT '17}
}

@InProceedings{2017-Yu-NDSS,
  author = 	 {Tianlong Yu and Seyed K. Fayaz and Michael Collins and Vyas Sekar and Srinivasan Seshan},
  title = 	 {{PSI}: Precise Security Instrumentation for Enterprise Networks},
  booktitle = {Network and Distributed System Security Symposium (NDSS)},
  month = 	 Feb,
  year = 	 {2017},
  address = 	 {San Diego, CA},
  category = "Security",
  url = {https://www.ndss-symposium.org/ndss2017/ndss-2017-programme/psi-precise-security-instrumentation-enterprise-networks/}
}

@inproceedings{2018-Kim-hotnets,
author = {Kim, Daehyeok and Zhu, Yibo and Kim, Changhoon and Lee, Jeongkeun and Seshan, Srinivasan},
title = {Generic External Memory for Switch Data Planes},
year = {2018},
month = nov,
isbn = {9781450361200},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3286062.3286063},
doi = {10.1145/3286062.3286063},
abstract = {Network switches are an attractive vantage point to serve various network applications and functions such as load balancing and virtual switching because of their in-network location and high packet processing rate. Recent advances in programmable switch ASICs open more opportunities for offloading various functionality to switches. However, the limited memory capacity on switches has been a major challenge that such applications struggle to deal with. In this paper, we envision that by enabling network switches to access remote memory purely from data planes, the performance of a wide range of applications can be improved. We design three remote memory primitives, leveraging RDMA operations, and show the feasibility of accessing remote memory from switches using our prototype implementation.},
booktitle = HOTNETS,
pages = {1–7},
numpages = {7},
location = {Redmond, WA, USA},
series = {HotNets '18}
}

@inproceedings{2018-Kim-sigcomm,
author = {Kim, Daehyeok and Memaripour, Amirsaman and Badam, Anirudh and Zhu, Yibo and Liu, Hongqiang Harry and Padhye, Jitu and Raindel, Shachar and Swanson, Steven and Sekar, Vyas and Seshan, Srinivasan},
title = {Hyperloop: Group-Based NIC-Offloading to Accelerate Replicated Transactions in Multi-Tenant Storage Systems},
year = {2018},
month = aug,
isbn = {9781450355674},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3230543.3230572},
doi = {10.1145/3230543.3230572},
abstract = {Storage systems in data centers are an important component of large-scale online services. They typically perform replicated transactional operations for high data availability and integrity. Today, however, such operations suffer from high tail latency even with recent kernel bypass and storage optimizations, and thus affect the predictability of end-to-end performance of these services. We observe that the root cause of the problem is the involvement of the CPU, a precious commodity in multi-tenant settings, in the critical path of replicated transactions. In this paper, we present HyperLoop, a new framework that removes CPU from the critical path of replicated transactions in storage systems by offloading them to commodity RDMA NICs, with non-volatile memory as the storage medium. To achieve this, we develop new and general NIC offloading primitives that can perform memory operations on all nodes in a replication group while guaranteeing ACID properties without CPU involvement. We demonstrate that popular storage applications can be easily optimized using our primitives. Our evaluation results with microbenchmarks and application benchmarks show that HyperLoop can reduce 99th percentile latency ≈ 800X with close to 0\% CPU consumption on replicas.},
booktitle = SIGCOMM,
pages = {297–312},
numpages = {16},
keywords = {replicated transactions, NIC-offloading, distributed storage systems, RDMA},
location = {Budapest, Hungary},
category = "DC Network",
series = {SIGCOMM '18}
}

@inproceedings{2019-Feng-conext,
author = {Feng, Guoyao and Seshan, Srinivasan and Steenkiste, Peter},
title = {UNARI: An Uncertainty-Aware Approach to AS Relationships Inference},
year = {2019},
month = dec,
isbn = {9781450369985},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3359989.3365420},
doi = {10.1145/3359989.3365420},
abstract = {Over the last two decades, several algorithms have been proposed to infer the type of relationship between Autonomous Systems (ASes). While the recent works have achieved increasingly higher accuracy, there has not been a systematic study on the uncertainty of AS relationship inference. In this paper, we analyze the factors contributing to this uncertainty and introduce a new paradigm to explicitly model the uncertainty and reflect it in the inference result. We also present UNARI, an exemplary algorithm implementing this paradigm, that leverages a novel technique to capture the interdependence of relationship inference across AS links.},
booktitle = CONEXT,
pages = {272–284},
numpages = {13},
keywords = {routing policies, AS relationships, measurement},
location = {Orlando, Florida},
series = {CoNEXT '19}
}

@inproceedings{2019-Helt-sec,
author = {Helt, Jeffrey and Feng, Guoyao and Seshan, Srinivasan and Sekar, Vyas},
title = {Sandpaper: Mitigating Performance Interference in CDN Edge Proxies},
year = {2019},
month = nov,
isbn = {9781450367332},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3318216.3363313},
doi = {10.1145/3318216.3363313},
abstract = {Modern content delivery networks (CDNs) allow their customers (i.e., operators of web services) to customize the processing of requests by uploading and executing code at the edges of the CDN's network. To achieve scale, CDNs have forgone heavyweight virtualization techniques. Instead, all requests often execute within the same OS or even process. However, performance interference may arise when these requests have differing demands on multiple system resources. In this paper, we study the sources of performance interference based on workloads from real customers, identify the lack of multi-resource fairness as the culprit, and show that existing schedulers available in commodity OSs are insufficient to enforce fairness between customers.We then design Sandpaper, a new and practical multi-resource request scheduler for mitigating performance interference in CDN edge environments. Sandpaper enforces fairness despite constraints, such as sitting within the application runtime and running atop the OS's underlying resource schedulers. By leveraging key insights about the differences between theoretical system models and real systems, Sandpaper bridges the trade-off between resource utilization and multi-resource fairness that plagues existing schedulers. We implement Sandpaper atop Varnish, an open-source CDN edge proxy, and show that it mitigates performance interference while maintaining high resource utilization and with little performance overhead.},
booktitle = {ACM/IEEE Symposium on Edge Computing},
pages = {30–46},
numpages = {17},
keywords = {fair queuing, content delivery networks, scheduling},
location = {Arlington, Virginia},
series = {SEC '19}
}

@inproceedings{2019-Kim-nsdi,
author = {Daehyeok Kim and Tianlong Yu and Hongqiang Harry Liu and Yibo Zhu and Jitu Padhye and Shachar Raindel and Chuanxiong Guo and Vyas Sekar and Srinivasan Seshan},
title = {{FreeFlow}: Software-based Virtual {RDMA} Networking for Containerized Clouds},
booktitle = NSDI,
year = {2019},
isbn = {978-1-931971-49-2},
address = {Boston, MA},
pages = {113--126},
url = {https://www.usenix.org/conference/nsdi19/presentation/kim},
publisher = {USENIX Association},
month = feb,
}

@inproceedings{2019-Ray-sigcomm,
author = {Ray, Devdeep and Kosaian, Jack and Rashmi, K. V. and Seshan, Srinivasan},
title = {Vantage: Optimizing Video Upload for Time-Shifted Viewing of Social Live Streams},
year = {2019},
month = aug,
isbn = {9781450359566},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3341302.3342064},
doi = {10.1145/3341302.3342064},
abstract = {Social live video streaming (SLVS) applications are becoming increasingly popular with the rise of platforms such as Facebook-Live, YouTube-Live, Twitch and Periscope. A key characteristic that differentiates this new class of applications from traditional live streaming is that these live streams are watched by viewers at different delays; while some viewers watch a live stream in real-time, others view the content in a time-shifted manner at different delays. In the presence of variability in the upload bandwidth, which is typical in mobile environments, existing solutions silo viewers into either receiving low latency video at a lower quality or a higher quality video with a significant delay penalty, without accounting for the presence of diverse time-shifted viewers.In this paper, we present Vantage, a live-streaming upload solution that improves the overall quality of experience for diverse time-shifted viewers by using selective quality-enhancing retransmissions in addition to real-time frames, optimizing the encoding schedules to balance the allocation of the available bandwidth between the two. Our evaluation using real-world mobile network traces shows that Vantage can provide high quality simultaneously for both low-latency and delayed viewing.For delayed viewing, Vantage achieves an average improvement of 19.9\% over real-time optimized video streaming techniques across all the network traces and test videos, with observed gains of up to 42.9\%. These benefits come at the cost of an average drop in real-time quality of 3.3\%, with a maximum drop of 7.1\%. This represents a significant performance improvement over current techniques used for SLVS applications, which primarily optimize the video upload for real-time viewing.},
booktitle = SIGCOMM,
pages = {380–393},
numpages = {14},
keywords = {VOD, adaptive bitrate algorithms, live streaming, video delivery},
location = {Beijing, China},
series = {SIGCOMM '19}
}

@inproceedings{2019-Ware-hotnets,
author = {Ware, Ranysha and Mukerjee, Matthew K. and Seshan, Srinivasan and Sherry, Justine},
title = {Beyond Jain's Fairness Index: Setting the Bar For The Deployment of Congestion Control Algorithms},
year = {2019},
month = nov,
isbn = {9781450370202},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3365609.3365855},
doi = {10.1145/3365609.3365855},
abstract = {The Internet community faces an explosion in new congestion control algorithms such as Copa, Sprout, PCC, and BBR. In this paper, we discuss considerations for deploying new algorithms on the Internet. While past efforts have focused on achieving 'fairness'or 'friendliness' between new algorithms and deployed algorithms, we instead advocate for an approach centered on quantifying and limiting harm caused by the new algorithm on the status quo. We argue that a harm-based approach is more practical, more future proof, and handles a wider range of quality metrics than traditional notions of fairness and friendliness.},
booktitle = HOTNETS,
pages = {17–24},
numpages = {8},
location = {Princeton, NJ, USA},
series = {HotNets '19}
}

@inproceedings{2019-Ware-imc,
author = {Ware, Ranysha and Mukerjee, Matthew K. and Seshan, Srinivasan and Sherry, Justine},
title = {Modeling BBR's Interactions with Loss-Based Congestion Control},
year = {2019},
month = oct,
isbn = {9781450369480},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3355369.3355604},
doi = {10.1145/3355369.3355604},
abstract = {BBR is a new congestion control algorithm (CCA) deployed for Chromium QUIC and the Linux kernel. As the default CCA for YouTube (which commands 11+\% of Internet traffic), BBR has rapidly become a major player in Internet congestion control. BBR's fairness or friendliness to other connections has recently come under scrutiny as measurements from multiple research groups have shown undesirable outcomes when BBR competes with traditional CCAs. One such outcome is a fixed, 40\% proportion of link capacity consumed by a single BBR flow when competing with as many as 16 loss-based algorithms like Cubic or Reno. In this short paper, we provide the first model capturing BBR's behavior in competition with loss-based CCAs. Our model is coupled with practical experiments to validate its implications. The key lesson is this: under competition, BBR becomes window-limited by its 'in-flight cap' which then determines BBR's bandwidth consumption. By modeling the value of BBR's in-flight cap under varying network conditions, we can predict BBR's throughput when competing against Cubic flows with a median error of 5\%, and against Reno with a median of 8\%.},
booktitle = IMC,
pages = {137–143},
numpages = {7},
location = {Amsterdam, Netherlands},
series = {IMC '19}
}

@inproceedings{2020-Kim-sigcomm,
author = {Kim, Daehyeok and Liu, Zaoxing and Zhu, Yibo and Kim, Changhoon and Lee, Jeongkeun and Sekar, Vyas and Seshan, Srinivasan},
title = {TEA: Enabling State-Intensive Network Functions on Programmable Switches},
year = {2020},
month = aug,
isbn = {9781450379557},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3387514.3405855},
doi = {10.1145/3387514.3405855},
abstract = {Programmable switches have been touted as an attractive alternative for deploying network functions (NFs) such as network address translators (NATs), load balancers, and firewalls. However, their limited memory capacity has been a major stumbling block that has stymied their adoption for supporting state-intensive NFs such as cloud-scale NATs and load balancers that maintain millions of flow-table entries. In this paper, we explore a new approach that leverages DRAM on servers available in typical NFV clusters. Our new system architecture, called TEA (Table Extension Architecture), provides a virtual table abstraction that allows NFs on programmable switches to look up large virtual tables built on external DRAM. Our approach enables switch ASICs to access external DRAM purely in the data plane without involving CPUs on servers. We address key design and implementation challenges in realizing this idea. We demonstrate its feasibility and practicality with our implementation on a Tofino-based programmable switch. Our evaluation shows that NFs built with TEA can look up table entries on external DRAM with low and predictable latency (1.8-2.2 μs) and the lookup throughput can be linearly scaled with additional servers (138 million lookups per seconds with 8 servers).},
booktitle = SIGCOMM,
pages = {90–106},
numpages = {17},
keywords = {Data centers, Programmable switches, Remote Direct Memory Access, Network Function Virtualization, Programmable networks},
location = {Virtual Event, USA},
series = {SIGCOMM '20}
}

@inproceedings{2020-Mukerjee-nsdi,
author = {Matthew K. Mukerjee and Christopher Canel and Weiyang Wang and Daehyeok Kim and Srinivasan Seshan and Alex C. Snoeren},
title = {Adapting {TCP} for Reconfigurable Datacenter Networks },
booktitle = NSDI,
year = {2020},
isbn = {978-1-939133-13-7},
address = {Santa Clara, CA},
pages = {651--666},
url = {https://www.usenix.org/conference/nsdi20/presentation/mukerjee},
publisher = {USENIX Association},
month = feb,
}

@INPROCEEDINGS{2020-Yu-iotdi,
author={Yu, Tianlong and Li, Tian and Sun, Yuqiong and Nanda, Susanta and Smith, Virginia and Sekar, Vyas and Seshan, Srinivasan},
booktitle={2020 IEEE/ACM Fifth International Conference on Internet-of-Things Design and Implementation (IoTDI)},
title={Learning Context-Aware Policies from Multiple Smart Homes via Federated Multi-Task Learning},
year={2020},
month = apr,
volume={},
number={},
pages={104-115},
doi={10.1109/IoTDI49375.2020.00017},
url={https://doi.org/10.1109/IoTDI49375.2020.00017}
}

@inproceedings{2021-Agarwal-hotnets,
author = {Agarwal, Anup and Sun, Jinghan and Noghabi, Shadi and Iyengar, Srinivasan and Badam, Anirudh and Chandra, Ranveer and Seshan, Srinivasan and Kalyanaraman, Shivkumar},
title = {Redesigning Data Centers for Renewable Energy},
year = {2021},
month = nov,
isbn = {9781450390873},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3484266.3487394},
doi = {10.1145/3484266.3487394},
abstract = {Renewable energy is becoming an important power source for data centers, especially with the zero-carbon waste pledges made by big cloud providers. However, one of the main challenges of renewable energy sources is the high variability of power produced. Traditional approaches such as batteries or transmitting to the grid fall short on scale, overhead, or "green-ness". We propose Virtual Battery: instead of adapting the availability of power to match the computation demand we shift computational demand to meet the availability of power. Virtual batteries shift demand by requiring applications to either be flexible and delay-tolerant or proactively migrating to where power is (going to be) available. We show that using multiple virtual battery sites in combination can meet the needs of modern applications. Moreover, we show how an intelligent network and power aware co-scheduler can not only provide availability despite variability but also help mitigate migration related network overhead by over 30\% in total and 4.2x at peak.},
booktitle = HOTNETS,
pages = {45–52},
numpages = {8},
location = {Virtual Event, United Kingdom},
series = {HotNets '21}
}

@inproceedings{2021-Kim-sigcomm,
author = {Kim, Daehyeok and Nelson, Jacob and Ports, Dan R. K. and Sekar, Vyas and Seshan, Srinivasan},
title = {RedPlane: Enabling Fault-Tolerant Stateful in-Switch Applications},
year = {2021},
month = aug,
isbn = {9781450383837},
publisher = {Association for Computing Machinery},
address = {New York, NY, USA},
url = {https://doi.org/10.1145/3452296.3472905},
doi = {10.1145/3452296.3472905},
abstract = {Many recent efforts have demonstrated the performance benefits of running datacenter functions (emph{e.g.,} NATs, load balancers, monitoring) on programmable switches. However, a key missing piece remains: fault tolerance. This is especially critical as the network is no longer stateless and pure endpoint recovery does not suffice. In this paper, we design and implement RedPlane, a fault-tolerant state store for stateful in-switch applications. This provides in-switch applications consistent access to their state, even if the switch they run on fails or traffic is rerouted to an alternative switch. We address key challenges in devising a practical, provably correct replication protocol and implementing it in the switch data plane. Our evaluations show that RedPlane incurs negligible overhead and enables end-to-end applications to rapidly recover from switch failures.},
booktitle = SIGCOMM,
pages = {223–244},
numpages = {22},
keywords = {state replication, programmable switches, programmable networks, fault tolerance},
location = {Virtual Event, USA},
series = {SIGCOMM '21}
}

@INPROCEEDINGS{2021-Liu-netsoft,
author={Liu, Zaoxing and Namkung, Hun and Agarwal, Anup and Manousis, Antonis and Steenkiste, Peter and Seshan, Srinivasan and Sekar, Vyas},
booktitle={2021 IEEE 7th International Conference on Network Softwarization (NetSoft)},
title={Sketchy With a Chance of Adoption: Can Sketch-Based Telemetry Be Ready for Prime Time?},
year={2021},
month = jun,
volume={},
number={},
pages={9-16},
doi={10.1109/NetSoft51509.2021.9492582},
url={https://doi.org/10.1109/NetSoft51509.2021.9492582}
}

@inproceedings{2022-Agarwal-nsdi,
author = {Anup Agarwal and Zaoxing Liu and Srinivasan Seshan},
title = {{HeteroSketch}: Coordinating Network-wide Monitoring in Heterogeneous and Dynamic Networks},
booktitle = NSDI,
year = {2022},
isbn = {978-1-939133-27-4},
address = {Renton, WA},
pages = {719--741},
url = {https://www.usenix.org/conference/nsdi22/presentation/agarwal},
publisher = {USENIX Association},
month = apr,
}

license: MIT

license_type: permissive

branch_name: refs/heads/master

extension: bib


text:
@misc{ahmed2020discovering,
      title={Discovering Lexical Similarity Through Articulatory Feature-based Phonetic Edit Distance},
      author={Tafseer Ahmed and Muhammad Suffian Nizami and Muhammad Yaseen Khan},
      year={2020},
      eprint={2008.06865},
      archivePrefix={arXiv},
      primaryClass={cs.CL}
}

repository: msnizami/suffian-profile

repo_name: msnizami/suffian-profile

gha_license_id: MIT

gha_language: Jupyter Notebook


text:
@inproceedings{Malaviya2019ExploitingSA,
 author = {Chaitanya Malaviya and Chandra Bhagavatula and Antoine Bosselut and Yejin Choi},
 booktitle = {Proceedings of the 34th AAAI Conference on Artificial Intelligence},
 title = {Exploiting Structural and Semantic Context for Commonsense Knowledge Base Completion},
 volume = {abs/1910.02915},
 year = {2020}
}

repository: atcbosselut/academic-kickstart

repo_name: atcbosselut/academic-kickstart

gha_language: TeX


text:
FILE(REMOVE_RECURSE
  "CMakeFiles/opencv_dpm_object.dir/src/dpm_nms.cpp.o"
  "CMakeFiles/opencv_dpm_object.dir/src/dpm_feature.cpp.o"
  "CMakeFiles/opencv_dpm_object.dir/src/precomp.cpp.o"
  "CMakeFiles/opencv_dpm_object.dir/src/dpm_cascade_detector.cpp.o"
  "CMakeFiles/opencv_dpm_object.dir/src/dpm_model.cpp.o"
  "CMakeFiles/opencv_dpm_object.dir/src/dpm_convolution.cpp.o"
  "CMakeFiles/opencv_dpm_object.dir/src/dpm_cascade.cpp.o"
)

# Per-language clean rules from dependency scanning.
FOREACH(lang CXX)
  INCLUDE(CMakeFiles/opencv_dpm_object.dir/cmake_clean_${lang}.cmake OPTIONAL)
ENDFOREACH(lang)

extension: cmake