Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Efficient Routing using NIx--Vectors George F. Riley
 

Summary: Efficient Routing using NIx--Vectors
George F. Riley
Mostafa H. Ammar
Ellen W. Zegura
College of Computing
Georgia Institute of Technology
Atlanta, GA 30332
friley,ammar,ewzg@cc.gatech.edu
(404)8946855, Fax: (404)8940272
May 17, 2000
Abstract
We introduce the concept of NIx--Vector routing which gives efficient and consistent routing
of packets in Internet routers. A NIx--Vector is a compact representation of a routing path,
which is small enough to be included in a packet header. We show how, by including the
routing information in the packet header, routing decisions can be made in O(1) time at each
router, with no caching or state in the routers (other than the existing routing tables). The
creation of a NIx--Vector for a source and destination pair requires one round trip time, but
once the NIx--Vector is known, it can be retained by the source and reused indefinitely with no
further setup time required (or until it becomes no longer valid, which is easily detected).
In addition to O(1) routing decisions, the use of NIx--Vectors to record and specify routes

  

Source: Ammar, Mostafa - College of Computing, Georgia Institute of Technology
Riley, George - College of Computing, Georgia Institute of Technology
Zegura, Ellen W. - College of Computing, Georgia Institute of Technology

 

Collections: Computer Technologies and Information Sciences