Hot-Potato Routing



For this project I performed a simulation analysis of the algorithm presented in "Routing without Flow Control," by Busch, Herlihy and Wattenhoffer, 2001.  The hot-potato routing algorithm is simulated using Rensselaer's Optimistic Simulation System.  The simulation uses a novel reverse computation approach to efficiently and optimistically parallelize the system simulation.  In addition to simulating and analyzing the routing algorithm, the performance of the simulation itself is also analyzed. 


Paper

Slide Presentation


Code Printouts :

          Router.c
          Makefile

Running Instructions



Test Sequence

Sample Output



Main Reference Paper





Introduction | Fuzzy Logic Controller | Generic Distribution and Filtering | Hot-Potato Routing | Lock-Free
Linked List | Grep for Windows | RSA

To contact us:

Phone: (617) 924-2974
Email: bushL2@cs.rpi.edu