Agenda For the Meeting on 16th, July and Tasks to complete

I am a little behind the progress. At this time, what I should consider is what I have found from the graphs or the charts and how to defineto explain them, instead of what I know about a specific system.

There are mainly two parts of the tasks to complete:

1. (To be complete by next Wednesday or Thursday) The results and clear descriptions of the Experiment of Chord.

2. (To be complete by 11th of Aug, when Nick is coming back)

- Technical differences between Kademlia and Coral:
    Why Coral is used in small files sharing?
    Why Kademlia is used in big files sharing?

- Two methods to prove what I will find:
    Literatures of both these two methods
    Experiments on both these two methods?
      Experiments on a range of file sizes to compare the differences between these two methods.

- How to define and then to measure the closeness?

- How effectively the location of peers affect the performance of the system?


When we talking about the Experiments, there are something should be concerned:

- Closeness number of hops
- Latency - routing latency
                - file transfer latency (bandwidth, hidden conjunction problems two users who request resources are allocated into two different download networks with two different environments, one is conjuncted and one is not that busy)

- Distances (Real-distance/Political distance and topological distance) Is there relation between these distance and two previous notations? Find it out!!

- Load on each nodes (download loads, upload loads, forwarding loads and so on.)

- Routing table information stored in each node.

- Capability of each node and how to measure each node's system consumption for a system's running.

- Mobility, the distribution issue in a mesh network constructed with mobiles. Mobiles are movable and how to distribute the news to each of them is the central issue. For example, Madonna's new songs are released and how to forward these songs to each of her fans.