A Dynamic Recursive Unified Internet Design (DRUID)

  • Authors:
  • Joe Touch;Ilia Baldine;Rudra Dutta;Gregory G. Finn;Bryan Ford;Scott Jordan;Dan Massey;Abraham Matta;Christos Papadopoulos;Peter Reiher;George Rouskas

  • Affiliations:
  • USC/ISI, 4676 Admiralty Way, Marina del Rey, CA 90292-6695, United States;Renaissance Computing Institute (RENCI), North Carolina State University's Centennial Campus, Partners I Building, Suite 1500 and Engineering Building II, Room 1235, Raleigh, NC 27606, United Stat ...;Department of Computer Science, North Carolina State University, Raleigh, NC 27695-8206, United States;USC/ISI, 4676 Admiralty Way, Marina del Rey, CA 90292-6695, United States;Department of Computer Science, Yale University, 51 Prospect Street, New Haven, CT 06511, United States;3019 Bren Hall, Department of Computer Science, University of California, Irvine, Irvine, CA 92697-3435, United States;Colorado State University, Department of Computer Science, 1873 Campus Delivery, Fort Collins, CO 80523, United States;Computer Science Department, Boston University, Boston, MA 02215, United States;Colorado State University, Department of Computer Science, 1873 Campus Delivery, Fort Collins, CO 80523, United States;3564 Boelter Hall, UCLA, 405 Hilgard Ave., Los Angeles, CA 90095, United States;Department of Computer Science, North Carolina State University, Raleigh, NC 27695-8206, United States

  • Venue:
  • Computer Networks: The International Journal of Computer and Telecommunications Networking
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Dynamic Recursive Unified Internet Design (DRUID) is a future Internet design that unifies overlay networks with conventional layered network architectures. DRUID is based on the fundamental concept of recursion, enabling a simple and direct network architecture that unifies the data, control, management, and security aspects of the current Internet, leading to a more trustworthy network. DRUID's architecture is based on a single recursive block that can adapt to support a variety of communication functions, including parameterized mechanisms for hard/soft state, flow and congestion control, sequence control, fragmentation and reassembly, compression, encryption, and error recovery. This recursion is guided by the structure of a graph of translation tables that help compartmentalize the scope of various functions and identifier spaces, while relating these spaces for resource discovery, resolution, and routing. The graph also organizes persistent state that coordinates behavior between individual data events (e.g., coordinating packets as a connection), among different associations (e.g., between connections), as well as helping optimize the recursive discovery process through caching, and supporting prefetching and distributed pre-coordination. This paper describes the DRUID architecture composed of these three parts (recursive block, translation tables, persistent state), and highlights its goals and benefits, including unifying the data, control, management, and security planes currently considered orthogonal aspects of network architecture.