Chapter 1

Table of Contents

Abstract 3

List images 5

List tables 7

Chapter 1: Peer to Peer and Ranking Problem 5

1.1. Peer to Peer 5

1.1.1. Peer to Peer overview 5

1.1.2. Architecture of Peer to Peer Systems 7

1.1.3. Distributed hash tables 8

1.2. Ranking in Peer to Peer networks 9

1.2.1. Introduction 10

1.2.2. Ranking Roles 10

1.2.3. Research’s important objects 10

Chapter 2: Ranking on DHT Peer to Peer Networks 11

2.1. Chord Protocol 11

2.2. Pagerank 12

2.2.1. Description 12

2.2.2. Algorithms 13

2.3. Distributed Computing 17

2.2.1. Introduction 17

2.2.2. Algorithms 18

2.4 if-idf 18

Chapter 3: Building a new algorithm for ranking in chord networks 24

3.1. Targets and Missions of Research 24

3.2. Idea 24

3.2.1. Major problems to exploit 25

3.2.2. Ranking Idea 25

Chapter 4: Ranking on Details 37

4.1. Ranking algorithm 37

4.2. Ranking’s features 37

Chapter 5: Evaluation 50

Chapter 6: Related Work 52

Chapter 7: Contributions and future work 53

References 54

List Images

Image 1.1.1 Peer to Peer means connected together. 2

Image 1.1.3 Distributed hash tables example. 5

Image 1.2.1 System must to have the ranking engine to find the one. 6

Image 2.1 A 16-node Chord network. example. 7

Image 2.2.2: How Pagerank works 9

Image 2.3: Distributed Nodes Graph example 9

Image 3.2.1: Google almost is not exact 9

Image 3.2.2: Intersect Idea 9

Image 3.4: Factor Percent 9

Image 4.1: Bandwidth is the key of ranking trusted 9

Image 4.1.2: Example of sub-graph semantic rank 9

Fig 4: A global graph of both local nodes and external nodes 9

Fig 5: An external local graph without a strategy 9

Fig 6: An external local graph 9

Image 4.2: Eigenvalue 9

Image 4.2.3: Random walk 9

Image 4.2.4: (n+1) graph nodes 9

Image 4.2.5: Graph example - 6 nodes 9

Image 4.2.6: Multiplication result example 9

Image 4.2.7: Multiplication result example – at iterators 9

List tables

Table 3.2.1: The Pagerank converge and HITS converge 26

Table 3.2.2: The Pagerank converge increasing to fast 26

Table 3.2.3: Pagerank convergence are not steady when Epsilon small 27

Table 3.2.4: HITS convergence ( take lots time than Pagerank)...............28

Table 5.1: the number of iterators which converges……………………….32