<?xml version="1.0"?>
<feed xmlns="http://www.w3.org/2005/Atom" xml:lang="en-CA">
	<id>https://nmsl.cs.sfu.ca/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Vikas</id>
	<title>NMSL - User contributions [en-ca]</title>
	<link rel="self" type="application/atom+xml" href="https://nmsl.cs.sfu.ca/api.php?action=feedcontributions&amp;feedformat=atom&amp;user=Vikas"/>
	<link rel="alternate" type="text/html" href="https://nmsl.cs.sfu.ca/index.php/Special:Contributions/Vikas"/>
	<updated>2026-04-23T07:53:34Z</updated>
	<subtitle>User contributions</subtitle>
	<generator>MediaWiki 1.35.1</generator>
	<entry>
		<id>https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2166</id>
		<title>Private:vikas kumar</title>
		<link rel="alternate" type="text/html" href="https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2166"/>
		<updated>2008-07-04T00:58:30Z</updated>

		<summary type="html">&lt;p&gt;Vikas: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Work Progress for Vikas. &lt;br /&gt;
&lt;br /&gt;
=== Priorities ===&lt;br /&gt;
* Implement Mao's Algorithm&lt;br /&gt;
* Implement our customer only heuristic&lt;br /&gt;
* Get familiar with Nitin's peer matching simulation&lt;br /&gt;
* Collect real IP addresses from Bit - Torrent networks for evaluation&lt;br /&gt;
* Quantify AS dynamics&lt;br /&gt;
* Validate valley-free rule&lt;br /&gt;
* more efficient peer matching algorithm&lt;br /&gt;
* Better shortest path algorithm&lt;br /&gt;
&lt;br /&gt;
== Week 1: May 26 ==&lt;br /&gt;
&lt;br /&gt;
* Rewriting the code for computing distance matrices between any pair of ASes based on Mao's Algorithm&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Week 2 : Jun 2 ==&lt;br /&gt;
* Completed implementation of Mao's Algorithm&lt;br /&gt;
* Completed implementation of customer only heuristic and verified that output of both implementations are the same&lt;br /&gt;
* Starting peer matching simulation using Nitin's simulator&lt;br /&gt;
&lt;br /&gt;
== Week 3: Jun 9 ==&lt;br /&gt;
* Completed AS Dynamics&lt;br /&gt;
* Working on Nitin's Simulator&lt;br /&gt;
=== 13th June's Meeting Minutes ===&lt;br /&gt;
* We want to compute AS Dynamics for only core ASes ( excluding customer only ASes)&lt;br /&gt;
* Implement the simulator for ISP friendly matching&lt;br /&gt;
* We also want to support the longest IP-prefix matching if receiver and sender are in the same AS&lt;br /&gt;
* In addition to AS hop distance, also use IP hop distance to evaluate our ISP friendly matching. (Consider a couple of ISPs' graph at Rocketfuel project)&lt;br /&gt;
&lt;br /&gt;
== Week 4 + 5 Jun 15 ==&lt;br /&gt;
* Completed AS Dynamics for core ASes( excluding customer only ASes ), for only providers ASes and also for others ASes( excluding only provider and only-customer ASes ).&lt;br /&gt;
* Implemented simulator for Random Matching, Network Order Matching and ISP Friendly Matching.&lt;br /&gt;
* Got the result for different population and different percentage popularity. We used real IPs for simulation of actual bit-torrent users.&lt;br /&gt;
=== 26th June's Meeting Minutes ===&lt;br /&gt;
* Fixing the bugs in simulator and ISP-algorithm&lt;br /&gt;
* Implementation of AS distance-cum IP prefix Matching Algorithm&lt;br /&gt;
* Get the real IP list from CBC&lt;br /&gt;
* How can we improve AS-graph given by CAIDA as suggested in Sigmetrics paper.&lt;br /&gt;
&lt;br /&gt;
== Week 6  Jun 30 ==&lt;br /&gt;
* Fixed the bugs in the simulator&lt;br /&gt;
* Implemented AS-cum-IP-PrefixMatching Algorithm&lt;br /&gt;
* Implemented code for checking IP distribution among ASes&lt;br /&gt;
* Simulated all the four algorithms on last 12 weeks AS maps by CAIDA and IPs list from nit torrent&lt;/div&gt;</summary>
		<author><name>Vikas</name></author>
	</entry>
	<entry>
		<id>https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2165</id>
		<title>Private:vikas kumar</title>
		<link rel="alternate" type="text/html" href="https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2165"/>
		<updated>2008-07-04T00:57:46Z</updated>

		<summary type="html">&lt;p&gt;Vikas: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Work Progress for Vikas. &lt;br /&gt;
&lt;br /&gt;
=== Priorities ===&lt;br /&gt;
* Implement Mao's Algorithm&lt;br /&gt;
* Implement our customer only heuristic&lt;br /&gt;
* Get familiar with Nitin's peer matching simulation&lt;br /&gt;
* Collect real IP addresses from Bit - Torrent networks for evaluation&lt;br /&gt;
* Quantify AS dynamics&lt;br /&gt;
* Validate valley-free rule&lt;br /&gt;
* more efficient peer matching algorithm&lt;br /&gt;
* Better shortest path algorithm&lt;br /&gt;
&lt;br /&gt;
== Week 1: May 26 ==&lt;br /&gt;
&lt;br /&gt;
* Rewriting the code for computing distance matrices between any pair of ASes based on Mao's Algorithm&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Week 2 : Jun 2 ==&lt;br /&gt;
* Completed implementation of Mao's Algorithm&lt;br /&gt;
* Completed implementation of customer only heuristic and verified that output of both implementations are the same&lt;br /&gt;
* Starting peer matching simulation using Nitin's simulator&lt;br /&gt;
&lt;br /&gt;
== Week 3: Jun 9 ==&lt;br /&gt;
* Completed AS Dynamics&lt;br /&gt;
* Working on Nitin's Simulator&lt;br /&gt;
&lt;br /&gt;
=== 13th June's Meeting Minutes ===&lt;br /&gt;
* We want to compute AS Dynamics for only core ASes ( excluding customer only ASes)&lt;br /&gt;
* Implement the simulator for ISP friendly matching&lt;br /&gt;
* We also want to support the longest IP-prefix matching if receiver and sender are in the same AS&lt;br /&gt;
* In addition to AS hop distance, also use IP hop distance to evaluate our ISP friendly matching. (Consider a couple of ISPs' graph at Rocketfuel project)&lt;br /&gt;
&lt;br /&gt;
== Week 4 + 5 Jun 15 ==&lt;br /&gt;
* Completed AS Dynamics for core ASes( excluding customer only ASes ), for only providers ASes and also for others ASes( excluding only provider and only-customer ASes ).&lt;br /&gt;
* Implemented simulator for Random Matching, Network Order Matching and ISP Friendly Matching.&lt;br /&gt;
* Got the result for different population and different percentage popularity. We used real IPs for simulation of actual bit-torrent users.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
=== 26th June's Meeting Minutes ===&lt;br /&gt;
* Fixing the bugs in simulator and ISP-algorithm&lt;br /&gt;
* Implementation of AS distance-cum IP prefix Matching Algorithm&lt;br /&gt;
* Get the real IP list from CBC&lt;br /&gt;
* How can we improve AS-graph given by CAIDA as suggested in Sigmetrics paper.&lt;br /&gt;
&lt;br /&gt;
== Week 6  Jun 30 ==&lt;br /&gt;
* Fixed the bugs in the simulator&lt;br /&gt;
* Implemented AS-cum-IP-PrefixMatching Algorithm&lt;br /&gt;
* Implemented code for checking IP distribution among ASes&lt;br /&gt;
* Simulated all the four algorithms on last 12 weeks AS maps by CAIDA and IPs list from nit torrent&lt;/div&gt;</summary>
		<author><name>Vikas</name></author>
	</entry>
	<entry>
		<id>https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2164</id>
		<title>Private:vikas kumar</title>
		<link rel="alternate" type="text/html" href="https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2164"/>
		<updated>2008-07-04T00:51:03Z</updated>

		<summary type="html">&lt;p&gt;Vikas: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Work Progress for Vikas. &lt;br /&gt;
&lt;br /&gt;
=== Priorities ===&lt;br /&gt;
* Implement Mao's Algorithm&lt;br /&gt;
* Implement our customer only heuristic&lt;br /&gt;
* Get familiar with Nitin's peer matching simulation&lt;br /&gt;
* Collect real IP addresses from Bit - Torrent networks for evaluation&lt;br /&gt;
* Quantify AS dynamics&lt;br /&gt;
* Validate valley-free rule&lt;br /&gt;
* more efficient peer matching algorithm&lt;br /&gt;
* Better shortest path algorithm&lt;br /&gt;
&lt;br /&gt;
== Week 1: May 26 ==&lt;br /&gt;
&lt;br /&gt;
* Rewriting the code for computing distance matrices between any pair of ASes based on Mao's Algorithm&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Week 2 : Jun 2 ==&lt;br /&gt;
* Completed implementation of Mao's Algorithm&lt;br /&gt;
* Completed implementation of customer only heuristic and verified that output of both implementations are the same&lt;br /&gt;
* Starting peer matching simulation using Nitin's simulator&lt;br /&gt;
&lt;br /&gt;
== Week 3: Jun 9 ==&lt;br /&gt;
* Completed AS Dynamics&lt;br /&gt;
* Working on Nitin's Simulator&lt;br /&gt;
&lt;br /&gt;
=== 13th June's Meeting Minutes ===&lt;br /&gt;
* We want to compute AS Dynamics for only core ASes ( excluding customer only ASes)&lt;br /&gt;
* Implement the simulator for ISP friendly matching&lt;br /&gt;
* We also want to support the longest IP-prefix matching if receiver and sender are in the same AS&lt;br /&gt;
* In addition to AS hop distance, also use IP hop distance to evaluate our ISP friendly matching. (Consider a couple of ISPs' graph at Rocketfuel project)&lt;br /&gt;
&lt;br /&gt;
== Week 4 + 5 Jun 15 ==&lt;br /&gt;
* Completed AS Dynamics for core ASes( excluding customer only ASes ), for only providers ASes and also for others ASes( excluding only provider and only-customer ASes ).&lt;br /&gt;
* Implemented simulator for Random Matching, Network Order Matching and ISP Friendly Matching.&lt;br /&gt;
* Got the result for different population and different percentage popularity. We used real IPs for simulation of actual bit-torrent users.&lt;br /&gt;
&lt;br /&gt;
== Week 6  Jun 30 ==&lt;br /&gt;
* Fixed the bugs in the simulator&lt;br /&gt;
* Implemented AS-cum-IP-PrefixMatching Algorithm&lt;br /&gt;
* Implemented code for checking IP distribution among ASes&lt;br /&gt;
* Simulated all the four algorithms on last 12 weeks AS maps by CAIDA and IPs list from nit torrent&lt;/div&gt;</summary>
		<author><name>Vikas</name></author>
	</entry>
	<entry>
		<id>https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2108</id>
		<title>Private:vikas kumar</title>
		<link rel="alternate" type="text/html" href="https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2108"/>
		<updated>2008-06-26T19:32:02Z</updated>

		<summary type="html">&lt;p&gt;Vikas: Submitted by Vikas on 26th June&lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Work Progress for Vikas. &lt;br /&gt;
&lt;br /&gt;
=== Priorities ===&lt;br /&gt;
* Implement Mao's Algorithm&lt;br /&gt;
* Implement our customer only heuristic&lt;br /&gt;
* Get familiar with Nitin's peer matching simulation&lt;br /&gt;
* Collect real IP addresses from Bit - Torrent networks for evaluation&lt;br /&gt;
* Quantify AS dynamics&lt;br /&gt;
* Validate valley-free rule&lt;br /&gt;
* more efficient peer matching algorithm&lt;br /&gt;
* Better shortest path algorithm&lt;br /&gt;
&lt;br /&gt;
== Week 1: May 26 ==&lt;br /&gt;
&lt;br /&gt;
* Rewriting the code for computing distance matrices between any pair of ASes based on Mao's Algorithm&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Week 2 : Jun 2 ==&lt;br /&gt;
* Completed implementation of Mao's Algorithm&lt;br /&gt;
* Completed implementation of customer only heuristic and verified that output of both implementations are the same&lt;br /&gt;
* Starting peer matching simulation using Nitin's simulator&lt;br /&gt;
&lt;br /&gt;
== Week 3: Jun 9 ==&lt;br /&gt;
* Completed AS Dynamics&lt;br /&gt;
* Working on Nitin's Simulator&lt;br /&gt;
&lt;br /&gt;
=== 13th June's Meeting Minutes ===&lt;br /&gt;
* We want to compute AS Dynamics for only core ASes ( excluding customer only ASes)&lt;br /&gt;
* Implement the simulator for ISP friendly matching&lt;br /&gt;
* We also want to support the longest IP-prefix matching if receiver and sender are in the same AS&lt;br /&gt;
* In addition to AS hop distance, also use IP hop distance to evaluate our ISP friendly matching. (Consider a couple of ISPs' graph at Rocketfuel project)&lt;br /&gt;
&lt;br /&gt;
== Week 4 + 5 Jun 15 ==&lt;br /&gt;
* Completed AS Dynamics for core ASes( excluding customer only ASes ), for only providers ASes and also for others ASes( excluding only provider and only-customer ASes ).&lt;br /&gt;
* Implemented simulator for Random Matching, Network Order Matching and ISP Friendly Matching.&lt;br /&gt;
* Got the result for different population and different percentage popularity. We used real IPs for simulation of actual bit-torrent users.&lt;/div&gt;</summary>
		<author><name>Vikas</name></author>
	</entry>
	<entry>
		<id>https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2053</id>
		<title>Private:vikas kumar</title>
		<link rel="alternate" type="text/html" href="https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2053"/>
		<updated>2008-06-13T22:24:02Z</updated>

		<summary type="html">&lt;p&gt;Vikas: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Work Progress for Vikas. &lt;br /&gt;
&lt;br /&gt;
=== Priorities ===&lt;br /&gt;
* Implement Mao's Algorithm&lt;br /&gt;
* Implement our customer only heuristic&lt;br /&gt;
* Get familiar with Nitin's peer matching simulation&lt;br /&gt;
* Collect real IP addresses from Bit - Torrent networks for evaluation&lt;br /&gt;
* Quantify AS dynamics&lt;br /&gt;
* Validate valley-free rule&lt;br /&gt;
* more efficient peer matching algorithm&lt;br /&gt;
* Better shortest path algorithm&lt;br /&gt;
&lt;br /&gt;
== Week 1: May 26 ==&lt;br /&gt;
&lt;br /&gt;
* Rewriting the code for computing distance matrices between any pair of ASes based on Mao's Algorithm&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Week 2 : Jun 2 ==&lt;br /&gt;
* Completed implementation of Mao's Algorithm&lt;br /&gt;
* Completed implementation of customer only heuristic and verified that output of both implementations are the same&lt;br /&gt;
* Starting peer matching simulation using Nitin's simulator&lt;br /&gt;
&lt;br /&gt;
== Week 3: Jun 9 ==&lt;br /&gt;
* Completed AS Dynamics&lt;br /&gt;
* Working on Nitin's Simulator&lt;br /&gt;
&lt;br /&gt;
=== 13th June's Meeting Minutes ===&lt;br /&gt;
* We want to compute AS Dynamics for only core ASes ( excluding customer only ASes)&lt;br /&gt;
* Implement the simulator for ISP friendly matching&lt;br /&gt;
* We also want to support the longest IP-prefix matching if receiver and sender are in the same AS&lt;br /&gt;
* In addition to AS hop distance, also use IP hop distance to evaluate our ISP friendly matching. (Consider a couple of ISPs' graph at Rocketfuel project)&lt;/div&gt;</summary>
		<author><name>Vikas</name></author>
	</entry>
	<entry>
		<id>https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2035</id>
		<title>Private:vikas kumar</title>
		<link rel="alternate" type="text/html" href="https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2035"/>
		<updated>2008-06-06T00:32:57Z</updated>

		<summary type="html">&lt;p&gt;Vikas: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Work Progress for Vikas. &lt;br /&gt;
&lt;br /&gt;
=== Priorities ===&lt;br /&gt;
* Implement Mao's Algorithm&lt;br /&gt;
* Implement our customer only heuristic&lt;br /&gt;
* Get familiar with Nitin's peer matching simulation&lt;br /&gt;
* Collect real IP addresses from Bit - Torrent networks for evaluation&lt;br /&gt;
* Quantify AS dynamics&lt;br /&gt;
* Validate valley-free rule&lt;br /&gt;
* more efficient peer matching algorithm&lt;br /&gt;
* Better shortest path algorithm&lt;br /&gt;
&lt;br /&gt;
== Week 1: May 26 ==&lt;br /&gt;
&lt;br /&gt;
* Rewriting the code for computing distance matrices between any pair of ASes based on Mao's Algorithm&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Week 2 : Jun 2 ==&lt;br /&gt;
* Completed implementation of Mao's Algorithm&lt;br /&gt;
* Completed implementation of customer only heuristic and verified that output of both implementations are the same&lt;br /&gt;
* Starting peer matching simulation using Nitin's simulator&lt;/div&gt;</summary>
		<author><name>Vikas</name></author>
	</entry>
	<entry>
		<id>https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2034</id>
		<title>Private:vikas kumar</title>
		<link rel="alternate" type="text/html" href="https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2034"/>
		<updated>2008-06-06T00:32:12Z</updated>

		<summary type="html">&lt;p&gt;Vikas: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Work Progress for Vikas. &lt;br /&gt;
&lt;br /&gt;
=== Priorities ===&lt;br /&gt;
* Implement Mao's Algorithm&lt;br /&gt;
* Implement our customer only heuristic&lt;br /&gt;
* Get familiar with Nitin's peer matching simulation&lt;br /&gt;
* Collect real IP addresses from Bit - Torrent networks for evaluation&lt;br /&gt;
* Quantify AS dynamics&lt;br /&gt;
* Validate valley-free rule&lt;br /&gt;
* more efficient peer matching algorithm&lt;br /&gt;
* Better shortest path algorithm&lt;br /&gt;
&lt;br /&gt;
== Week 1: May 26 ==&lt;br /&gt;
&lt;br /&gt;
* Rewriting the code for computing distance matrices between any pair of ASes based on Mao's Algorithm&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Week 2 : Jun 2 ==&lt;br /&gt;
* Completed implementation of Mao's Algorithm&lt;br /&gt;
* Completed implementation of customer only heuristic and verified that both output are same&lt;br /&gt;
* Starting peer matching simulation using Nitin's simulator&lt;/div&gt;</summary>
		<author><name>Vikas</name></author>
	</entry>
	<entry>
		<id>https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2033</id>
		<title>Private:vikas kumar</title>
		<link rel="alternate" type="text/html" href="https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2033"/>
		<updated>2008-06-06T00:31:34Z</updated>

		<summary type="html">&lt;p&gt;Vikas: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Work Progress for Vikas. &lt;br /&gt;
&lt;br /&gt;
=== Priorities ===&lt;br /&gt;
* Implement Mao's Algorithm&lt;br /&gt;
* Implement our customer only heuristic&lt;br /&gt;
* Get familiar with Nitin's peer matching simulation&lt;br /&gt;
* Collect real IP addresses from Bit - Torrent networks for evaluation&lt;br /&gt;
* Quantify AS dynamics&lt;br /&gt;
* Validate valley-free rule&lt;br /&gt;
* more efficient peer matching algorithm&lt;br /&gt;
* Better shortest path algorithm&lt;br /&gt;
&lt;br /&gt;
== Week 1: May 26 ==&lt;br /&gt;
&lt;br /&gt;
* Rewriting the code for computing distance matrices between any pair of ASes based on Mao's Algorithm&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Week 2 : May 27 on ==&lt;br /&gt;
* Completed implementation of Mao's Algorithm&lt;br /&gt;
* Completed implementation of customer only heuristic and verified that both output are same&lt;br /&gt;
* Starting peer matching simulation using Nitin's simulator&lt;/div&gt;</summary>
		<author><name>Vikas</name></author>
	</entry>
	<entry>
		<id>https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2032</id>
		<title>Private:vikas kumar</title>
		<link rel="alternate" type="text/html" href="https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2032"/>
		<updated>2008-06-06T00:30:31Z</updated>

		<summary type="html">&lt;p&gt;Vikas: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Work Progress for Vikas. &lt;br /&gt;
&lt;br /&gt;
=== Priorities ===&lt;br /&gt;
* Implement Mao's Algorithm&lt;br /&gt;
* Implement our customer only heuristic&lt;br /&gt;
* Get familiar with Nitin's peer matching simulation&lt;br /&gt;
* Collect real IP addresses from Bit - Torrent networks for evaluation&lt;br /&gt;
* Quantify AS dynamics&lt;br /&gt;
* Validate valley-free rule&lt;br /&gt;
* more efficient peer matching algorithm&lt;br /&gt;
* Better shortest path algorithm&lt;br /&gt;
&lt;br /&gt;
== Week 1: May 26 ==&lt;br /&gt;
&lt;br /&gt;
* Rewriting the code.&lt;br /&gt;
&lt;br /&gt;
&lt;br /&gt;
== Week 2 : May 27 on ==&lt;br /&gt;
* Completed implementation of Mao's Algorithm&lt;br /&gt;
* Completed implementation of customer only heuristic and verified that both output are same&lt;br /&gt;
* Starting peer matching simulation using Nitin's simulator&lt;/div&gt;</summary>
		<author><name>Vikas</name></author>
	</entry>
	<entry>
		<id>https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2019</id>
		<title>Private:vikas kumar</title>
		<link rel="alternate" type="text/html" href="https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2019"/>
		<updated>2008-05-30T22:52:55Z</updated>

		<summary type="html">&lt;p&gt;Vikas: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Work Progress for Vikas. &lt;br /&gt;
&lt;br /&gt;
== Week 1: May 26 ==&lt;br /&gt;
&lt;br /&gt;
* Rewriting the code.&lt;br /&gt;
&lt;br /&gt;
=== Priorities ===&lt;br /&gt;
* Implement Mao's Algorithm&lt;br /&gt;
* Implement our customer only Algorithm&lt;br /&gt;
* Get familiar with Nitin's peer matching simulation&lt;br /&gt;
* Collect real IP addresses from Bit - Torrent networks for evaluation&lt;br /&gt;
* Quantify AS dynamics&lt;br /&gt;
* Validate valley-free rule&lt;br /&gt;
* more efficient peer matching algorithm&lt;br /&gt;
* Better shortest path algorithm&lt;br /&gt;
&lt;br /&gt;
== Week 2 : May 27 on ==&lt;/div&gt;</summary>
		<author><name>Vikas</name></author>
	</entry>
	<entry>
		<id>https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2018</id>
		<title>Private:vikas kumar</title>
		<link rel="alternate" type="text/html" href="https://nmsl.cs.sfu.ca/index.php?title=Private:vikas_kumar&amp;diff=2018"/>
		<updated>2008-05-30T22:52:18Z</updated>

		<summary type="html">&lt;p&gt;Vikas: &lt;/p&gt;
&lt;hr /&gt;
&lt;div&gt;Work Progress for Vikas. &lt;br /&gt;
&lt;br /&gt;
== Week 1: May 26 ==&lt;br /&gt;
&lt;br /&gt;
* Rewriting the code.&lt;br /&gt;
&lt;br /&gt;
=== Priorities ===&lt;br /&gt;
1) Implement Mao's Algorithm&lt;br /&gt;
2) Implement our customer only Algorithm&lt;br /&gt;
3) Get familiar with Nitin's peer matching simulation&lt;br /&gt;
4) Collect real IP addresses from Bit - Torrent networks for evaluation&lt;br /&gt;
5) Quantify AS dynamics&lt;br /&gt;
6) Validate valley-free rule&lt;br /&gt;
7) more efficient peer matching algorithm&lt;br /&gt;
8) Better shortest path algorithm&lt;br /&gt;
&lt;br /&gt;
== Week 2 : May 27 on ==&lt;/div&gt;</summary>
		<author><name>Vikas</name></author>
	</entry>
</feed>