Difference between revisions of "Private:vikas kumar"
From NMSL
Line 13: | Line 13: | ||
== Week 1: May 26 == | == Week 1: May 26 == | ||
− | * Rewriting the code | + | * Rewriting the code for computing distance matrices between any pair of ASes based on Mao's Algorithm |
Revision as of 16:31, 5 June 2008
Work Progress for Vikas.
Priorities
- Implement Mao's Algorithm
- Implement our customer only heuristic
- Get familiar with Nitin's peer matching simulation
- Collect real IP addresses from Bit - Torrent networks for evaluation
- Quantify AS dynamics
- Validate valley-free rule
- more efficient peer matching algorithm
- Better shortest path algorithm
Week 1: May 26
- Rewriting the code for computing distance matrices between any pair of ASes based on Mao's Algorithm
Week 2 : May 27 on
- Completed implementation of Mao's Algorithm
- Completed implementation of customer only heuristic and verified that both output are same
- Starting peer matching simulation using Nitin's simulator