Source routing in computer networks

  • Authors:
  • Carl A. Sunshine

  • Affiliations:
  • The Rand Corporation, Santa Monica, CA

  • Venue:
  • ACM SIGCOMM Computer Communication Review
  • Year:
  • 1977

Quantified Score

Hi-index 0.00

Visualization

Abstract

As plans for network interconnection develop, the problems of internet routing and addressing become increasingly important. In one popular model of internet addressing, a hierarchical form of network and local (within network) address is used, with the source providing only the destination address while the intermediate network(s) and/or Gateways between networks take care of routing packets to that destination by various paths. This and related techniques requiring some form of routing table and knowledge at intermediate nodes are more fully discussed in [1,2,3]. This paper considers another technique for internet routing in which the source of internet packets specifies the complete internet route. When the entire route accompanies each internet packet, no routing decisions or tables are required at Gateways, but the packet format is complicated and overhead increases. In particular, the packet must carry a varying number of intermediate addresses depending on the path and destination [4]. This overhead may be reduced by setting up a fixed route with connection tables [1] when a connection is established.