Policy-Aware Connectionless Routing

Abstract

The current Internet implements hop-by-hop packet forwarding based entirely on globally-unique identifiers specified in packet headers, and routing tables that identify destinations with globally unique identifiers and specify the next hops to such destinations. This model is very robust; however, it supports only a single forwarding class per destination. As a result, the Internet must rely on mechanisms working "on top" of IP to support quality-of-service (QoS) or traffic engineering (TE). We present the first policy-based connectionless routing architecture and algorithms to support QoS and TE as part of the basic network-level service of the Internet. We show that policy-aware connectionless routing can be accomplished with roughly the same computational efficiency of the traditional single-path shortest-path routing approach.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2004
Accession Number
ADA459409

Entities

People

  • Bradley R. Smith
  • J.J. Garcia-Luna-Aceves

Organizations

  • University of California, Santa Cruz

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Abstracts
  • Algebra
  • Algorithms
  • Computations
  • Computing System Architectures
  • Engineering
  • Internet
  • Internet Routing
  • Network Architecture
  • Network Protocols
  • Networks
  • Resource Management
  • Routing
  • Routing Protocols
  • Standards
  • Streaming Media
  • Topology

Fields of Study

  • Computer science

Readers

  • Computer Networking