Difference between revisions of "Private:vikas kumar"
From NMSL
| Line 1: | Line 1: | ||
Work Progress for Vikas. | Work Progress for Vikas. | ||
| − | |||
| − | |||
| − | |||
| − | |||
=== Priorities === | === Priorities === | ||
* Implement Mao's Algorithm | * Implement Mao's Algorithm | ||
| − | * Implement our customer only | + | * Implement our customer only heuristic |
* Get familiar with Nitin's peer matching simulation | * Get familiar with Nitin's peer matching simulation | ||
* Collect real IP addresses from Bit - Torrent networks for evaluation | * Collect real IP addresses from Bit - Torrent networks for evaluation | ||
| Line 14: | Line 10: | ||
* more efficient peer matching algorithm | * more efficient peer matching algorithm | ||
* Better shortest path algorithm | * Better shortest path algorithm | ||
| + | |||
| + | == Week 1: May 26 == | ||
| + | |||
| + | * Rewriting the code. | ||
| + | |||
== Week 2 : May 27 on == | == 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 | ||
Revision as of 16:30, 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.
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
