
显示样式: 排序: IF: - GO 导出
-
The October 2020 issue ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-10-26 Steve Uhlig
This October 2020 issue contains five technical papers, the third paper of our education series, as well as three editorial notes.
-
Partitioning the internet using Anycast catchments ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-10-26 Kyle Schomp; Rami Al-Dalky
In anycast deployments, knowing how traffic will be distributed among the locations is challenging. In this paper, we propose a technique for partitioning the Internet using passive measurements of existing anycast deployments such that all IP addresses within a partition are routed to the same location for an arbitrary anycast deployment. One IP address per partition may then represent the entire
-
LoRadar: LoRa sensor network monitoring through passive packet sniffing ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-10-26 Kwon Nung Choi; Harini Kolamunna; Akila Uyanwatta; Kanchana Thilakarathna; Suranga Seneviratne; Ralph Holz; Mahbub Hassan; Albert Y. Zomaya
IoT deployments targeting different application domains are being unfolded at various administrative levels such as countries, states, corporations, or even individual households. Facilitating data transfers between deployed sensors and back-end cloud services is an important aspect of IoT deployments. These data transfers are usually done using Low Power WAN technologies (LPWANs) that have low power
-
A first look at the IP eXchange ecosystem ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-10-26 Andra Lutu; Byunjin Jun; Fabián E. Bustamante; Diego Perino; Marcelo Bagnulo; Carlos Gamboa Bontje
The IPX Network interconnects about 800 Mobile Network Operators (MNOs) worldwide and a range of other service providers (such as cloud and content providers). It forms the core that enables global data roaming while supporting emerging applications, from VoLTE and video streaming to IoT verticals. This paper presents the first characterization of this, so-far opaque, IPX ecosystem and a first-of-its-kind
-
Mobile web browsing under memory pressure ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-10-26 Ihsan Ayyub Qazi; Zafar Ayyub Qazi; Theophilus A. Benson; Ghulam Murtaza; Ehsan Latif; Abdul Manan; Abrar Tariq
Mobile devices have become the primary mode of Internet access. Yet, differences in mobile hardware resources, such as device memory, coupled with the rising complexity of Web pages can lead to widely different quality of experience for users. In this work, we analyze how device memory usage affects Web browsing performance. We quantify the memory footprint of popular Web pages over different mobile
-
Retrofitting post-quantum cryptography in internet protocols: a case study of DNSSEC ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-10-26 Moritz Müller; Jins de Jong; Maran van Heesch; Benno Overeinder; Roland van Rijswijk-Deij
Quantum computing is threatening current cryptography, especially the asymmetric algorithms used in many Internet protocols. More secure algorithms, colloquially referred to as Post-Quantum Cryptography (PQC), are under active development. These new algorithms differ significantly from current ones. They can have larger signatures or keys, and often require more computational power. This means we cannot
-
COSMOS educational toolkit: using experimental wireless networking to enhance middle/high school STEM education ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-10-26 Panagiotis Skrimponis; Nikos Makris; Sheila Borges Rajguru; Karen Cheng; Jonatan Ostrometzky; Emily Ford; Zoran Kostic; Gil Zussman; Thanasis Korakis
This paper focuses on the K-12 educational activities of COSMOS-Cloud enhanced Open Software defined MObile wireless testbed for city-Scale deployment. The COSMOS wireless reasearch testbed is being deployed in West Harlem (New York City) as part of the NSF Platforms for Advanced Wireless Research (PAWR) program. COSMOS' approach for K-12 education is twofold: (i) create an innovative and concrete
-
Coronavirus contact tracing: evaluating the potential of using bluetooth received signal strength for proximity detection ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-10-26 Douglas J. Leith; Stephen Farrell
Many countries are deploying Covid-19 contact tracing apps that use Bluetooth Low Energy (LE) to detect proximity within 2m for 15 minutes. However, Bluetooth LE is an unproven technology for this application, raising concerns about the efficacy of these apps. Indeed, measurements indicate that the Bluetooth LE received signal strength can be strongly affected by factors including (i) the model of
-
Digital contact tracing: technologies, shortcomings, and the path forward ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-10-26 Amee Trivedi; Deepak Vasisht
Since the start of the COVID-19 pandemic, technology enthusiasts have pushed for digital contact tracing as a critical tool for breaking the COVID-19 transmission chains. Motivated by this push, many countries and companies have created apps that enable digital contact tracing with the goal to identify the chain of transmission from an infected individual to others and enable early quarantine. Digital
-
Using deep programmability to put network owners in control ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-10-26 Nate Foster; Nick McKeown; Jennifer Rexford; Guru Parulkar; Larry Peterson; Oguz Sunay
Controlling an opaque system by reading some "dials" and setting some "knobs," without really knowing what they do, is a hazardous and fruitless endeavor, particularly at scale. What we need are transparent networks, that start at the top with a high-level intent and map all the way down, through the control plane to the data plane. If we can specify the behavior we want in software, then we can check
-
The July 2020 issue ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-07-22 Steve Uhlig
This July 2020 issue contains four technical papers, the second paper of our education series, as well as two editorial notes.
-
Tracking the deployment of TLS 1.3 on the web: a story of experimentation and centralization ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-07-22 Ralph Holz; Jens Hiller; Johanna Amann; Abbas Razaghpanah; Thomas Jost; Narseo Vallina-Rodriguez; Oliver Hohlfeld
Transport Layer Security (TLS) 1.3 is a redesign of the Web's most important security protocol. It was standardized in August 2018 after a four year-long, unprecedented design process involving many cryptographers and industry stakeholders. We use the rare opportunity to track deployment, uptake, and use of a new mission-critical security protocol from the early design phase until well over a year
-
Does domain name encryption increase users' privacy? ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-07-22 Martino Trevisan; Francesca Soro; Marco Mellia; Idilio Drago; Ricardo Morla
Knowing domain names associated with traffic allows eavesdroppers to profile users without accessing packet payloads. Encrypting domain names transiting the network is, therefore, a key step to increase network confidentiality. Latest efforts include encrypting the TLS Server Name Indication (eSNI extension) and encrypting DNS traffic, with DNS over HTTPS (DoH) representing a prominent proposal. In
-
Using application layer banner data to automatically identify IoT devices ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-07-22 Talha Javed; Muhammad Haseeb; Muhammad Abdullah; Mobin Javed
In this paper, we re-implement a recent work published in Usenix Security 2018: "Acquistional Rule Based Engine for Discovering Internet-of-Things Devices". The paper introduced an NLP-based engine for automatically identifying the type, vendor, and product of IoT devices given banner data as input. We report on our efforts to reproduce the original implementation of the engine, documenting ambiguities
-
Towards declarative self-adapting buffer management ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-07-22 Pavel Chuprikov; Sergey Nikolenko; Kirill Kogan
Buffering architectures and policies for their efficient management are one of the core ingredients of network architecture. However, despite strong incentives to experiment with and deploy new policies, opportunities for changing or automatically choosing anything beyond a few parameters in a predefined set of behaviors still remain very limited. We introduce a novel buffer management framework based
-
Open educational resources for computer networking ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-07-22 O. Bonaventure; Q. De Coninck; F. Duchêne; A. Gégo; M. Jadin; F. Michel; M. Piraux; C. Poncin; O. Tilmans
To reflect the importance of network technologies, networking courses are now part of the core materials of Computer Science degrees. We report our experience in jointly developing an open-source ebook for the introductory course, and a series of open educational resources for both the introductory and advanced networking courses. These ensure students actively engage with the course materials, through
-
Lessons learned organizing the PAM 2020 virtual conference ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-07-22 Chris Misa; Dennis Guse; Oliver Hohlfeld; Ramakrishnan Durairajan; Anna Sperotto; Alberto Dainotti; Reza Rejaie
Due to the COVID-19 pandemic, the organizing committee of the 2020 edition of the Passive and Active Measurement (PAM) conference decided to organize it as a virtual event. Unfortunately, little is known about designing and organizing virtual academic conferences in the networking domain and their impacts on the participants' experience. In this editorial note, we first provide challenges and rationale
-
Update on ACM SIGCOMM CCR reviewing process: towards a more open review process ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-07-22 Ralph Holz; Marco Mellia; Olivier Bonaventure; Hamed Haddadi; Matthew Caesar; Sergey Gorinsky; Gianni Antichi; Joseph Camp; kc Klaffy; Bhaskaran Raman; Anna Sperotto; Aline Viana; Steve Uhlig
This editorial note aims to first inform the SIGCOMM community on the reviewing process in place currently at CCR, and second, share our plans to make CCR a more open and welcoming venue by making changes to the review process, adding more value to the SIGCOMM community.
-
The April 2020 issue ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-05-22 Steve Uhlig
Presentation of the April 2020 issue of CCR.
-
RIPE IPmap active geolocation ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-05-22 Ben Du; Massimo Candela; Bradley Huffaker; Alex C. Snoeren; kc claffy
RIPE IPmap is a multi-engine geolocation platform operated by the RIPE NCC. One of its engines, single-radius, uses active geolocation to infer the geographic coordinates of target IP addresses. In this paper, we first introduce the methodology of IPmap's single-radius engine, then we evaluate its accuracy, coverage, and consistency, and compare its results with commercial geolocation databases. We
-
Path persistence in the cloud ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-05-22 Waleed Reda; Kirill Bogdanov; Alexandros Milolidakis; Hamid Ghasemirahni; Marco Chiesa; Gerald Q. Maguire; Dejan Kostić
A commonly held belief is that traffic engineering and routing changes are infrequent. However, based on our measurements over a number of years of traffic between data centers in one of the largest cloud provider's networks, we found that it is common for flows to change paths at ten-second intervals or even faster. These frequent path and, consequently, latency variations can negatively impact the
-
The web is still small after more than a decade ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-05-22 Nguyen Phong Hoang; Arian Akhavan Niaki; Michalis Polychronakis; Phillipa Gill
Understanding web co-location is essential for various reasons. For instance, it can help one to assess the collateral damage that denial-of-service attacks or IP-based blocking can cause to the availability of co-located web sites. However, it has been more than a decade since the first study was conducted in 2007. The Internet infrastructure has changed drastically since then, necessitating a renewed
-
An Artifact Evaluation of NDP ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-05-22 Noa Zilberman
Artifact badging aims to rank the quality of submitted research artifacts and promote reproducibility. However, artifact badging may not indicate inherent design and evaluation limitations.
-
Validating the Sharing Behavior and Latency Characteristics of the L4S Architecture ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-05-22 Dejene BoruOljira; Karl-Johan Grinnemo; Anna Brunstrom; Javid Taheri
The strict low-latency requirements of applications such as virtual reality, online gaming, etc., can not be satisfied by the current Internet. This is due to the characteristics of classic TCP such as Reno and TCP Cubic which induce high queuing delays when used for capacity-seeking traffic, which in turn results in unpredictable latency. The Low Latency, Low Loss, Scalable throughput (L4S) architecture
-
An Open Platform to Teach How the Internet Practically Works ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-05-22 Thomas Holterbach; Tobias Bü; Tino Rellstab; Laurent Vanbever
Each year at ETH Zurich, around 100 students collectively build and operate their very own Internet infrastructure composed of hundreds of routers and dozens of Autonomous Systems (ASes). Their goal? Enabling Internet-wide connectivity. [email protected] find this class-wide project to be invaluable in teaching our students how the Internet infrastructure practically works. Among others, our students
-
Workshop on Internet Economics (WIE 2019) report ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-05-22 kc claffy; David Clark
On 9-11 December 2019, CAIDA hosted the 10th interdisciplinary Workshop on Internet Economics (WIE) at UC San Diego's Supercomputer Center. This workshop series provides a forum for researchers, Internet facilities and service providers, technologists, economists, theorists, policymakers, and other stakeholders to exchange views on current and emerging economic and policy debates. This year's meeting
-
Thoughts about Artifact Badging ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-05-22 Noa Zilberman; Andrew W. Moore
Reproducibility: the extent to which consistent results are obtained when an experiment is repeated, is important as a means to validate experimental results, promote integrity of research, and accelerate follow up work. Commitment to artifact reviewing and badging seeks to promote reproducibility and rank the quality of submitted artifacts.
-
Comment on "Datacenter Congestion Control: Identifying what is essential and making it practical" by Aisha Mushtaq, et al, CCR, July 2019 ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-05-22 James Roberts
We dispute the authors' claim that SRPT is the crucial factor in achieving good FCT performance in datacenter networks.
-
A first look at the Latin American IXPs ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-03-23 Esteban Carisimo; Julián M. Del Fiore; Diego Dujovne; Cristel Pelsser; J. Ignacio Alvarez-Hamelin
We investigated Internet eXchange Points (IXPs) deployed across Latin America. We discovered that many Latin American states have been actively involved in the development of their IXPs. We further found a correlation between the success of a national IXP and the absence of local monopolistic ASes that concentrate the country's IPv4 address space. In particular, three IXPs have been able to gain local
-
Network architecture in the age of programmability ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-03-23 Anirudh Sivaraman; Thomas Mason; Aurojit Panda; Ravi Netravali; Sai Anirudh Kondaveeti
Motivated by the rapid emergence of programmable switches, programmable network interface cards, and software packet processing, this paper asks: given a network task (e.g., virtualization or measurement) in a programmable network, should we implement it at the network's end hosts (the edge) or its switches (the core)? To answer this question, we analyze a range of common network tasks spanning virtualization
-
The January 2020 issue ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-03-23 Olivier Bonaventure
This January 2020 issue starts the fiftieth volume of Computer Communication Review. This marks an important milestone for our newsletter. This issue contains four technical papers and three editorial notes. In C-Share: Optical Circuits Sharing for Software-Defined Data-Centers, Shay Vargaftik and his colleagues tackle the challenge of designing data-center networks that combine optical circuit switches
-
Internet backbones in space ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-03-23 Giacomo Giuliari; Tobias Klenze; Markus Legner; David Basin; Adrian Perrig; Ankit Singla
Several "NewSpace" companies have launched the first of thousands of planned satellites for providing global broadband Internet service. The resulting low-Earth-orbit (LEO) constellations will not only bridge the digital divide by providing service to remote areas, but they also promise much lower latency than terrestrial fiber for long-distance routes. We show that unlocking this potential is non-trivial:
-
A survey on the current internet interconnection practices ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-03-23 Pedro Marcos; Marco Chiesa; Christoph Dietzel; Marco Canini; Marinho Barcellos
The Internet topology has significantly changed in the past years. Today, it is richly connected and flattened. Such a change has been driven mostly by the fast growth of peering infrastructures and the expansion of Content Delivery Networks as alternatives to reduce interconnection costs and improve traffic delivery performance. While the topology evolution is perceptible, it is unclear whether or
-
The state of network neutrality regulation ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-03-23 Volker Stocker; Georgios Smaragdakis; William Lehr
The Network Neutrality (NN) debate refers to the battle over the design of a regulatory framework for preserving the Internet as a public network and open innovation platform. Fueled by concerns that broadband access service providers might abuse network management to discriminate against third party providers (e.g., content or application providers), policymakers have struggled with designing rules
-
Gigabit broadband measurement workshop report ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-03-23 Steve Bauer; David Clark; William Lehr
On July 24-25, 2018, MIT hosted an invitation-only workshop for network researchers from academia, industry, and the policy community engaged in the design and operation of test schemes to measure broadband access, in order to address the measurement challenges associated with highspeed (gigabit) broadband Internet access services. The focus of the workshop was on assessing the current state-of-the-art
-
C-share ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2020-03-23 Shay Vargaftik; Cosmin Caba; Liran Schour; Yaniv Ben-Itzhak
Integrating optical circuit switches in data-centers is an on-going research challenge. In recent years, state-of-the-art solutions introduce hybrid packet/circuit architectures for different optical circuit switch technologies, control techniques, and traffic re-routing methods. These solutions are based on separated packet and circuit planes that cannot utilize an optical circuit with flows that
-
The skillful interrogation of the internet ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 Mark Crovella
As SIGCOMM turns 50, it's interesting to ask how networking research has evolved over time. This is a set of personal observations about the "mindset" associated with Internet research.
-
XORs in the past and future ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 Muriel Médard; Sachin Katti; Dina Katabi; Wenjun Hu; Hariharan Rahul; Jon Crowcroft
While placing the paper "XORs in the Air" in the context of the theoretical and practical understanding of network coding, we present a view of the progress of the field of network coding, In particular, we examine the interplay of theory and practice in the field.
-
The 11th workshop on active internet measurements (AIMS-11) workshop report ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 K C Claffy; David Clark
On 16-17 April 2018, CAIDA hosted its eleventh Workshop on Active Internet Measurements (AIMS-11). This workshop series provides a forum for stakeholders in Internet active measurement projects to communicate their interests and concerns, and explore cooperative approaches to maximizing the collective benefit of deployed infrastructure and gathered data. An overarching theme this year was scaling the
-
Datacenter congestion control ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 Aisha Mushtaq; Radhika Mittal; James McCauley; Mohammad Alizadeh; Sylvia Ratnasamy; Scott Shenker
Recent years have seen a slew of papers on datacenter congestion control mechanisms. In this editorial, we ask whether the bulk of this research is needed for the common case where congestion control involves hosts responding to simple congestion signals from the network and the performance goal is reducing some average measure of flow completion time. We raise this question because we find that, out
-
Towards passive analysis of anycast in global routing ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 Rui Bian; Shuai Hao; Haining Wang; Amogh Dhamdere; Alberto Dainotti; Chase Cotton
Anycast has been widely adopted by today's Internet services, including DNS, CDN, and DDoS protection, in which the same IP address is announced from distributed locations and clients are directed to the topologically-nearest service replica. Prior research has focused on various aspects of anycast, either its usage in particular services such as DNS or characterizing its adoption by Internet-wide
-
Privacy trading in the surveillance capitalism age viewpoints on 'privacy-preserving' societal value creation ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 Ranjan Pal; Jon Crowcroft
In the modern era of the mobile apps (part of the era of surveillance capitalism, a famously coined term by Shoshana Zuboff), huge quantities of data about individuals and their activities offer a wave of opportunities for economic and societal value creation. However, the current personal data ecosystem is mostly de-regulated, fragmented, and inefficient. On one hand, end-users are often not able
-
Deprecating the TCP macroscopic model ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 Matt Mathis; Jamshid Mahdavi
The TCP Macroscopic Model will be completely obsolete soon. It was a closed form performance model for Van Jacobson's landmark congestion control algorithms presented at Sigcomm'88. Jacobson88 requires relatively large buffers to function as intended, while Moore's law is making them uneconomical. BBR-TCP is a break from the past, unconstrained by many of the assumptions and principles defined in Jacobson88
-
My view of computer communication review, 1969--1976 ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 David Walden
Brief notes relating to the Computer Communication Review in 1975--1976.
-
Changing ACM computer communication review (1988--1991) ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 Craig Partridge
A brief description of how SIGCOMM's quarterly newsletter evolved into an entry-level journal.
-
It's not about the internet ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 Lyman Chapin
In the policy realm what we call "Internet issues" are not actually "Internet" issues-they are well-pedigreed social, political, cultural, and economic issues, for which we clever technologists have provided a rich new environment in which to grow and multiply. It follows that the people best prepared to tackle "Internet" issues may be thoughtful professionals in fields such as behavioral psychology
-
Retrospective on "fragmentation considered harmful" ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 Jeffrey C. Mogul; Christopher A Kantarjiev
We look back at our 1987 paper, "Fragmentation Considered Harmful," to explain why we wrote it, how the prevalence of fragmentation was reduced by approaches such as Path MTU Discovery, and how fragmentation-related issues still lurk in today's Internet. Our paper listed several reasons why we thought fragmentation was harmful; some were more true in 1987 than they are today, and after our paper was
-
Retrospective on "measured capacity of an ethernet: myths and reality" ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 Jeffrey C. Mogul; Christopher A Kantarjiev
The original Ethernet design used CSMA/CD on a broadcast cable. Even after it became commercially popular, many people expressed concerns that Ethernet could not efficiently use the full channel bandwidth. In our 1988 paper, "Measured Capacity of an Ethernet: Myths and Reality," we reported on experiments we ran showing that, even under relatively heavy loads, Ethernet typically still performed well
-
A digital fountain retrospective ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 John W. Byers; Michael Luby; Michael Mitzenmacher
We introduced the concept of a digital fountain as a scalable approach to reliable multicast, realized with fast and practical erasure codes, in a paper published in ACM SIGCOMM '98. This invited editorial, on the occasion of the 50th anniversary of the SIG, reflects on the trajectory of work leading up to our approach, and the numerous developments in the field in the subsequent 21 years. We discuss
-
Retrospective on "towards an active network architecture" ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 David Wetherall; David Tennenhouse
Network programmability has metamorphosed over the past twenty years from the controversial research vision of active networks, through PlanetLab, to the juggernaut of SDN and OpenFlow that has swept industry. Now PISA switches are emerging with support for protocol-independent reconfigurability. We reflect on how network architecture has evolved along a different path than we had foreseen to arrive
-
Reflections on "a control-theoretic approach to flow control" ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 S. Keshav
This article discusses the events that led to the publication of my paper 'A Control-Theoretic Approach to Flow Control' that won the Best Student Paper Award in 1991 and a Test-of-Time Award in 2007.
-
Network protocol folklore ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 Perlman Radia
There's no way to understand today's networks without knowing the history. Too often, network protocols are taught as 'memorize the details of what is currently deployed', which creates a lot of confusion, and certainly does not encourage critical thinking. Some decisions have made today's networks unnecessarily complex and less functional. But surprisingly, mechanisms that were created out of necessity
-
Reflections on SIGCOMM's fiftieth anniversary ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 Bruce Davie
On the occasion of the fiftieth anniversary of SIGCOMM, this article contains the reflections of a past SIGCOMM chair on the field of networking over the past few decades.
-
Retrospective on "a delay-tolerant network architecture for challenged internets" ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 Kevin Fall
This article provides a brief retrospective on the evolution of Delay Tolerant Networking since 2003.
-
Lessons from "on the self-similar nature of ethernet traffic" ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 Walter Willinger; Murad S. Taqqu; Daniel V. Wilson
This editorial is an outgrowth of our research efforts that resulted in the SIGCOMM'93 paper [1] entitled On the self-similar nature of Ethernet traffic. We discuss some lessons we have learned as we have watched the published findings being absorbed by the scientific community in general and the networking community in particular. We focus on aspects that have remained relevant today, especially at
-
Sizing router buffers (redux) ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 Nick McKeown; Guido Appenzeller; Isaac Keslassy
The queueing delay faced by a packet is arguably the largest source of uncertainty during its journey. It therefore seems crucial that we understand how big the buffers should be in Internet routers. Our 2004 Sigcomm paper revisited the existing rule of thumb that a buffer should hold one bandwidth-delay product of packets. We claimed that for long-lived TCP flows, it could be reduced by √N, where
-
Don't mind the gap: Bridging network-wide objectives and device-level configurations ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 Ryan Beckett; Ratul Mahajan; Todd Millstein; Jitendra Padhye; David Walker
We reflect on the historical context that lead to Propane, a high-level language and compiler to help network operators bridge the gap between network-wide routing objectives and low-level configurations of devices that run complex, distributed protocols. We also highlight the primary contributions that Propane made to the networking literature and describe ongoing challenges. We conclude with an important
-
The first fifty years of ACM SIGCOMM ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 Olivier Bonaventure
Network researchers know that packets are not always evenly spaced, they sometimes arrive in bursts. This burstiness is also present in history. Important events sometimes occur almost simultaneously even if there is no direct relationship between them. Fifty years ago, several historical events took place within a period of a few months. In July, after years of efforts, NASA engineers successfully
-
Perspective ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 Deepak Vasisht; Swarun Kumar; Hariharan Rahul; Dina Katabi
The ever-increasing demand for data has forced cellular networks towards advanced multi-antenna (MIMO) techniques. However, advanced MIMO solutions such as massive MIMO, coordinated multi-point, distributed MIMO, and multi-user MIMO, all require the base station to know the downlink channels to the client. In the absence of this information, the base station cannot beamform its signal to its users
-
From ethane to SDN and beyond ACM SIGCOMM Comput. Commun. Rev. (IF 1.951) Pub Date : 2019-11-08 Martín Casado; Nick McKeown; Scott Shenker
We briefly describe the history behind the Ethane paper and its ultimate evolution into SDN and beyond.