71 research outputs found
Recommended from our members
Research Problems for Scalable Internet Resource Discovery ; CU-CS-643-93
Recommended from our members
A Case for Caching File Objects Inside Internetworks ; CU-CS-642-93
Recommended from our members
Scalable Internet Resource Discovery: Research Problems and Approaches ; CU-CS-679-93
Recommended from our members
Harvest: A Scalable, Customizable Discovery and Access System ; CU-CS-732-94
Roll, Roll, Roll your Root:A Comprehensive Analysis of the First Ever DNSSEC Root KSK Rollover
The DNS Security Extensions (DNSSEC) add authenticity and integrity to the naming system of the Internet. Resolvers that validate information in the DNS need to know the cryptographic public key used to sign the root zone of the DNS. Eight years after its introduction and one year after the originally scheduled date, this key was replaced by ICANN for the first time in October 2018. ICANN considered this event, called a rollover, "an overwhelming success" and during the rollover they detected "no significant outages". In this paper, we independently follow the process of the rollover starting from the events that led to its postponement in 2017 until the removal of the old key in 2019. We collected data from multiple vantage points in the DNS ecosystem for the entire duration of the rollover process. Using this data, we study key events of the rollover. These events include telemetry signals that led to the rollover being postponed, a near real-time view of the actual rollover in resolvers and a significant increase in queries to the root of the DNS once the old key was revoked. Our analysis contributes significantly to identifying the causes of challenges observed during the rollover. We show that while from an end-user perspective, the roll indeed passed without major problems, there are many opportunities for improvement and important lessons to be learned from events that occurred over the entire duration of the rollover. Based on these lessons, we propose improvements to the process for future rollovers
A Cooperative Game with Applications to Computer Networks
This paper extends our previous results [3]. Cheriton implemented this strategy in the V operating system, employing the uniform distribution [2]. The uniform distribution is intuitively appealing, and, at first glance, appears optimal. The optimal distribution depends on the number of recipients n, the number of buffers b
An analytical model of operating system protocol processing including effects of multiprogramming
- …
