Experimental Study on Network Coordinate based Node Clustering

1. Experimental Study on Network Coordinate basedNode Clustering Yang CHEN Tsinghua University China Good morning everyone. My name is Yang CHEN, I am from Tsinghua University. Today I will present my work on the experimental study on network coordinate based node clustering.Good morning everyone. My name is Yang CHEN, I am from Tsinghua University. Today I will present my work on the experimental study on network coordinate based node clustering.

2. 2 Outline Introduction Network Coordinate System Node Clustering Experiment on PlanetLab Application Here is the outline of my presentation.Here is the outline of my presentation.

3. 3 Introduction large-scale globally-distributed network services and applications application layer multicast peer-to-peer file sharing global data store consider the distribution of the nodes to build effective network architecture Network distance based node clustering According to the fast development of the Internet, large-scale globally-distributed network services and applications, such as application layer multicast, peer-to-peer file sharing, global data store, play a more and more important role. In these services and applications, we must consider the distribution of the nodes to build effective network architecture. Network distance based node clustering is a useful way. According to the fast development of the Internet, large-scale globally-distributed network services and applications, such as application layer multicast, peer-to-peer file sharing, global data store, play a more and more important role. In these services and applications, we must consider the distribution of the nodes to build effective network architecture. Network distance based node clustering is a useful way.

4. 4 Distance Prediction in Internet End-to-end Measurement Most directly method Tools : ping, traceroute, � Will add severe impact on each node Generally limited by their overhead not a scalable method and not suitable for large-scale distributed network Network Coordinate identifying a node�s position in Internet In this paper, we implement a simple coordinate system The most direct method to obtain distance information is using ping or traceroute to do the end-to-end measurement. While these tools are easy to use, their utility is generally limited by their overhead. These measurement will add severe impact on each node, so it�s not a scalable method and not suitable for large-scale distributed network. A convenient method of identifying a node�s position in Internet is using network coordinate. In this paper, we implement a simple coordinate system, which using a set of round-trip time from each node to a group of well-known landmark nodes as its network coordinate. The nodes which are able to reflect the ICMP ping message and are in steady status can be chosen as landmark nodes.The most direct method to obtain distance information is using ping or traceroute to do the end-to-end measurement. While these tools are easy to use, their utility is generally limited by their overhead. These measurement will add severe impact on each node, so it�s not a scalable method and not suitable for large-scale distributed network. A convenient method of identifying a node�s position in Internet is using network coordinate. In this paper, we implement a simple coordinate system, which using a set of round-trip time from each node to a group of well-known landmark nodes as its network coordinate. The nodes which are able to reflect the ICMP ping message and are in steady status can be chosen as landmark nodes.

5. 5 We use� Triangulated Heuristic select N Landmark nodes node H is assigned coordinates which are simply given by the N-tuple of distances between H and the N base nodes The distance between H1 & H2 is bounded by