Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Achieving Distributed Buffering in Multi-path Routing using Fair Allocation
 

Summary: Achieving Distributed Buffering in Multi-path
Routing using Fair Allocation
Ali Al-Dhaher, Tricha Anjali
Department of Electrical and Computer Engineering
Illinois Institute of Technology
Chicago, Illinois 60616
Email: {aaldhahe, anjali}@iit.edu
Alexandre Fortin
Midtronics Inc.
Willowbrook, Illinois 60527
Email: alexandrefortin@free.fr
Abstract--Traditional network routing algorithms send data
from the source to destination along a single path. The selected
path may experience congestion due to other traffic, thereby
reducing throughput. Multi-path routing divides the data along
multiple paths, with the aim of increasing overall throughput.
Due to the different latencies of using multiple paths, packets
are received out-of-order at the destination, and thus require
reordering. This problem can be overcome by placing a buffer
at the destination node in order to synchronize the incoming

  

Source: Anjali, Tricha - Department of Electrical and Computer Engineering, Illinois Institute of Technology

 

Collections: Computer Technologies and Information Sciences; Engineering