ConferenceLecture Notes in Computer Science · January 1, 2025
A 2016 study by Wei and Heidemann showed that anycast routing of DNS queries to root name servers is fairly stable, with only 1% of RIPE Atlas vantage points “flipping” back and forth between different root name server sites. Continuing this study longitud ...
Full textCite
ConferenceHotnets 2023 Proceedings of the 22nd ACM Workshop on Hot Topics in Networks · November 28, 2023
When a root certificate authority (CA) in the Web PKI misbehaves, primary root-store operators such as Mozilla and Google respond by distrusting that CA. However, full distrust is often too broad, so root stores often implement partial distrust of roots, s ...
Full textCite
ConferenceACM Transactions on Algorithms · March 9, 2023
Robust optimization is a widely studied area in operations research, where the algorithm takes as input a range of values and outputs a single solution that performs well for the entire range. Specifically, a robust algorithm aims to minimize regret, defin ...
Full textCite
ConferenceProceedings of the 20th Usenix Symposium on Networked Systems Design and Implementation Nsdi 2023 · January 1, 2023
Interactive mobile applications like web browsing and gaming are known to benefit significantly from low latency networking, as applications communicate with cloud servers and other users' devices. Emerging mobile channel standards have not met these needs ...
Cite
ConferenceProceedings of the ACM Conference on Computer and Communications Security · November 7, 2022
This paper proposes using a logic programming language to disentangle X.509 certificate validation policy from mechanism. Expressing validation policies in a logic programming language provides multiple benefits. First, policy and mechanism can be more ind ...
Full textCite
ConferenceProceedings of the 19th Usenix Symposium on Networked Systems Design and Implementation Nsdi 2022 · January 1, 2022
Low latency is a requirement for a variety of interactive network applications. The Internet, however, is not optimized for latency. We thus explore the design of wide-area networks that move data at nearly the speed of light in vacuum. Our cISP design aug ...
Cite
ConferenceSIGCOMM 2021 Proceedings of the ACM SIGCOMM 2021 Conference · August 9, 2021
The key to optimizing the performance of an anycast-based system (e.g., the root DNS or a CDN) is choosing the right set of sites to announce the anycast prefix. One challenge here is predicting catchments. A naïve approach is to advertise the prefix from ...
Full textCite
ConferenceLeibniz International Proceedings in Informatics Lipics · July 1, 2021
This paper presents universal algorithms for clustering problems, including the widely studied k-median, k-means, and k-center objectives. The input is a metric space containing all potential client locations. The algorithm must select k cluster centers su ...
Full textCite
ConferenceHotmobile 2021 Proceedings of the 22nd International Workshop on Mobile Computing Systems and Applications · February 24, 2021
Interactive mobile applications like web browsing and gaming are known to benefit significantly from low latency networking, as applications communicate with cloud servers and other users' devices. Emerging mobile channel standards have not met these needs ...
Full textCite
ConferenceLecture Notes in Computer Science · January 1, 2021
Imagine one or more non-colluding servers each holding a large public database, e.g., the repository of DNS entries. Clients would like to access entries in this database without disclosing their queries to the servers. Classical private information retrie ...
Full textCite
ConferenceProceedings of the ACM SIGCOMM Internet Measurement Conference IMC · October 27, 2020
Low latency is of interest for a variety of applications. The most stringent latency requirements arise in financial trading, where sub-microsecond differences matter. As a result, firms in the financial technology sector are pushing networking technology ...
Full textCite
ConferenceProceedings of the ACM SIGCOMM Internet Measurement Conference IMC · October 27, 2020
There is a rich body of literature on measuring and optimizing nearly every aspect of the web, including characterizing the structure and content of web pages, devising new techniques to load pages quickly, and evaluating such techniques. Virtually all of ...
Full textCite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2020
Header bidding (HB) is a relatively new online advertising technology that allows a content publisher to conduct a client-side (i.e., from within the end-user’s browser), real-time auction for selling ad slots on a web page. We developed a new browser exte ...
Full textCite
ConferenceProceedings of the ACM SIGCOMM Internet Measurement Conference IMC · October 21, 2019
Despite its critical role in Internet connectivity, the Border Gateway Protocol (BGP) remains highly vulnerable to attacks such as prefix hijacking, where an Autonomous System (AS) announces routes for IP space it does not control. To address this issue, t ...
Full textCite
ConferenceLeibniz International Proceedings in Informatics Lipics · July 1, 2019
We initiate the algorithmic study of retracting a graph into a cycle in the graph, which seeks a mapping of the graph vertices to the cycle vertices so as to minimize the maximum stretch of any edge, subject to the constraint that the restriction of the ma ...
Full textCite
ConferenceProceedings of the Annual ACM SIAM Symposium on Discrete Algorithms · January 1, 2019
It is well-known that a program’s memory access pattern can leak information about its input. To thwart such leakage, most existing works adopt the technique of oblivious RAM (ORAM) simulation. Such an obliviousness notion has stimulated much debate. Altho ...
Full textCite
ConferenceHotnets 2018 Proceedings of the 2018 ACM Workshop on Hot Topics in Networks · November 15, 2018
A new space race is imminent, with several industry players working towards satellite-based Internet connectivity. While satellite networks are not themselves new, these recent proposals are aimed at orders of magnitude higher bandwidth and much lower late ...
Full textCite
ConferenceProceedings of the ACM SIGCOMM Internet Measurement Conference IMC · October 31, 2018
TLS, the de facto standard protocol for securing communications over the Internet, relies on a hierarchy of certificates that bind names to public keys. Naturally, ensuring that the communicating parties are using only valid certificates is a necessary fir ...
Full textCite
ConferenceConext 2017 Proceedings of the 2017 13th International Conference on Emerging Networking Experiments and Technologies · November 28, 2017
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-base ...
Full textCite
ConferenceProceedings of the ACM SIGCOMM Internet Measurement Conference IMC · November 1, 2017
The Domain Name System (DNS) provides a scalable, flexible name resolution service. Unfortunately, its unauthenticated architecture has become the basis for many security attacks. To address this, DNS Security Extensions (DNSSEC) were introduced in 1997. D ...
Full textCite
ConferenceLeibniz International Proceedings in Informatics Lipics · August 1, 2017
Motivated by denial-of-service network attacks, we introduce the symmetric interdiction model, where both the interdictor and the optimizer are subject to the same constraints of the underlying optimization problem. We give a general framework that relates ...
Full textCite
ConferenceProceedings IEEE Symposium on Security and Privacy · June 23, 2017
Currently, no major browser fully checks for TLS/SSL certificate revocations. This is largely due to the fact that the deployed mechanisms for disseminating revocations (CRLs, OCSP, OCSP Stapling, CRLSet, and OneCRL) are each either incomplete, insecure, i ...
Full textCite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2017
In principle, a network can transfer data at nearly the speed of light. Today’s Internet, however, is much slower: our measurements show that latencies are typically more than one, and often more than two orders of magnitude larger than the lower bound imp ...
Full textCite
ConferenceProceedings of the 26th Usenix Security Symposium · January 1, 2017
The Domain Name System’s Security Extensions (DNSSEC) allow clients and resolvers to verify that DNS responses have not been forged or modified inflight. DNSSEC uses a public key infrastructure (PKI) to achieve this integrity, without which users can be su ...
Cite
ConferenceProceedings of the ACM SIGCOMM Internet Measurement Conference IMC · November 14, 2016
SSL and TLS are used to secure the most commonly-used Internet protocols. As a result, the ecosystem of SSL certificates has been thoroughly studied, leading to a broad understanding of the strengths and weak-nesses of the certificates accepted by most web ...
Full textCite
ConferenceProceedings of the ACM Conference on Computer and Communications Security · October 24, 2016
The semantics of online authentication in the web are rather straightforward: if Alice has a certificate binding Bob's name to a public key, and if a remote entity can prove knowledge of Bob's private key, then (barring key compromise) that remote entity m ...
Full textCite
ConferencePerformance Evaluation Review · June 1, 2016
As popular web sites turn to content delivery networks (CDNs) for full-site delivery, there is an opportunity to improve the end-user experience by optimizing the delivery of entire web pages, rather than just individual objects. In particular, this paper ...
Full textCite
ConferenceProceedings of the ACM SIGCOMM Internet Measurement Conference IMC · October 28, 2015
Critical to the security of any public key infrastructure (PKI) is the ability to revoke previously issued certificates. While the overall SSL ecosystem is well-studied, the frequency with which certificates are revoked and the circumstances under which cl ...
Full textCite
ConferenceComputer Communication Review · July 1, 2015
This paper "peeks under the covers" at the subsystems that provide the basic functionality of a leading content delivery network. Based on our experiences in building one of the largest distributed systems in the world, we illustrate how sophisticated algo ...
Full textCite
ConferenceACM International Conference Proceeding Series · January 4, 2015
This paper proposes an approach to the design of large-scale general-purpose data center networks based on the notions of volume and area universality introduced by Leiserson in the 1980's in the context of VLSI design. In particular, we suggest that the p ...
Full textCite
ConferenceProceedings of the ACM SIGCOMM Internet Measurement Conference IMC · November 5, 2014
Although traffic between Web servers and Web browsers is readily apparent to many knowledgeable end users, fewer are aware of the extent of server-to-server Web traffic carried over the public Internet. We refer to the former class of traffic as front-offi ...
Full textCite
ConferenceProceedings of the 13th ACM Workshop on Hot Topics in Networks Hotnets 2014 · October 27, 2014
For many Internet services, reducing latency improves the user experience and increases revenue for the service provider. While in principle latencies could nearly match the speed of light, we find that infrastructural inefficiencies and protocol overheads ...
Full textCite
ConferenceProceedings of Nsdi 2012 9th Usenix Symposium on Networked Systems Design and Implementation · January 1, 2012
Content distribution networks (CDNs) have started to adopt hybrid designs, which employ both dedicated edge servers and resources contributed by clients. Hybrid designs combine many of the advantages of infrastructure-based and peer-to-peer systems, but th ...
Cite
Conference4th Symposium on Networked Systems Design and Implementation Nsdi 2007 · January 1, 2007
Many studies show that, when Internet links go up or down, the dynamics of BGP may cause several minutes of packet loss. The loss occurs even when multiple paths between the sender and receiver domains exist, and is unwarranted given the high connectivity ...
Cite
ConferenceProceedings of the Annual ACM Symposium on Principles of Distributed Computing · July 23, 2006
A quorum system over a universe of logical elements is a collection of subsets (quorums) of elements, any two of which intersect. In numerous distributed algorithms, the elements of the universe reside on the nodes of a physical network and the participati ...
Full textCite
ConferenceProceedings of the Annual ACM Symposium on Principles of Distributed Computing · July 17, 2005
A quorum system is a family of sets (themselves called quorums), each pair of which intersect. In many distributed algorithms, the basic unit accessed by a client is a quorum of nodes. Such algorithms are used for applications such as mutual exclusion, dat ...
Full textCite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2002Cite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 2001Cite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 1998
We consider the problem of extending the analysis of balls and bins processes where a ball is placed in the least loaded of d randomly chosen bins to cover deletions. In particular, we are interested in the case where the system maintains a fixed load, and ...
Full textCite
ConferenceProceedings of the Annual Hawaii International Conference on System Sciences · January 1, 1995
In the realm of sequential computing, the random access machine has successfully provided an underlying model of computation that has promoted consistency and coordination among algorithm developers, computer architects and language experts. In the realm o ...
Full textCite
ConferenceProceedings of the Annual Hawaii International Conference on System Sciences · January 1, 1995
In 1988, Leighton, Maggs and Rao (1988) showed that for any network and any set of packets whose paths through the network are fixed and edge-simple, there exists a schedule for routing the packets to their destinations in O(c+d) steps using constant-size ...
Full textCite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 1993
This paper presents a data structure that supports the operations of inserting and deleting elements drawn from a universe U={0⋯u-1} into a set S, and for finding the predecessors of elements of U in S. We consider both random inputs and worst-case inputs. ...
Full textCite
ConferenceLecture Notes in Computer Science Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics · January 1, 1993
It has recently been discovered that randomly-wired interconnection networks outperform traditional well-structured networks in several notable respects. Among other things, randomly-wired networks have been found to be exceptionally fault-tolerant and wel ...
Full textCite
ConferenceProceedings of 7th International Parallel Processing Symposium IPPS 1993 · January 1, 1993
This paper presents several deterministic algorithms for selecting the kth largest record from a set of n records on any n-node hypercubic network. All of the algorithms are based on the selection algorithm of Cole and Yap (1985), as well as on various sor ...
Full textCite
ConferenceProceedings Annual IEEE Symposium on Foundations of Computer Science Focs · January 1, 1992
The authors analyze the fault-tolerance properties of several bounded-degree networks that are commonly used for parallel computation. Among other things, they show that an N-node butterfly containing N/sup 1- epsilon / worst-case faults (for any constant ...
Full textCite
ConferenceProceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures Spaa 1991 · June 1, 1991
We have implemented three parallel sorting algorithms on the Connection Machine Supercomputer model CM-2: Batcher's bitonic sort, a parallel radix sort, and a sample sort similar to Reif and Valiant's flashsort. We have also evaluated the implementation of ...
Full textCite
