Tài liệu Research on node ranking in peer-to-peer networks

ĐỀ TÀI: Research on node ranking in peer-to-peer networks

[TABLE=width: 100%]
[TR]
[TD]ĐẠI HỌC QUỐC GIA HÀ NỘI
TRƯỜNG ĐẠI HỌC CÔNG NGHỆ





Hoàng Cường



Research on node ranking in peer-to-peer networks







KHOÁ LUẬN TỐT NGHIỆP ĐẠI HỌC HỆ CHÍNH QUY

Ngành: Công nghệ thông tin









HÀ NỘI - 2010



[/TD]
[/TR]
[/TABLE]







Lời cảm ơn
Lời đầu tiên em xin bày tỏ ḷng biết ơn sâu sắc tới TS. Nguyễn Hoài Sơn, các thầy đă hướng dẫn và là nguồn cảm hứng cho quá tŕnh nghiên cứu của em.
Em xin bày tỏ ḷng biết ơn tới các thầy, cô giáo trong Khoa Công nghệ thông tin - Trường Đại học Công nghệ - ĐHQGHN. Các thầy cô đă dạy bảo, chỉ dẫn chúng em và luôn tạo điều kiện tốt nhất cho chúng em học tập trong suốt quá tŕnh học đại học đặc biệt là trong thời gian làm khoá luận tốt nghiệp.

Hà Nội, ngày 22 tháng 5 năm 2010
Hoàng Cường


ABSTRACT
This paper defines and describes a fully distributed NODE ranking algorithm for “peer to peer” systems. The research puts forward new approach for ranking nodes over peer to peer.Synthesizing foundation and promoting new method which is feasible for peer to peer networks. Integration of this algorithm into P2P keyword search can produce dramatic benefit both in terms of effectiveness for users and decrease in network traffic. The incremental search algorithm provided approximately a ten-fold reduction in network traffic for two-word and three-word queries.


Chapter 1

Table of Contents

Abstract
List images
List tables

Chapter 1: Peer to Peer and Ranking Problem5
1.1. Peer to Peer
1.1.1. Peer to Peer overview
1.1.2. Architecture of Peer to Peer Systems7
1.1.3. Distributed hash tables
1.2. Ranking in Peer to Peer networks
1.2.1. Introduction
1.2.2. Ranking Roles
1.2.3. Research’s important objects
Chapter 2: Ranking on DHT Peer to Peer Networks1
2.1. Chord Protocol
2.2. Pagerank
2.2.1. Description
2.2.2. Algorithms
2.3. Distributed Computing
2.2.1. Introduction
2.2.2. Algorithms
2.4 if-idf
Chapter 3: Building a new algorithm for ranking in chord networks
3.1. Targets and Missions of Research
3.2. Idea
3.2.1. Major problems to exploit
3.2.2. Ranking Idea
Chapter 4: Ranking on Details
4.1. Ranking algorithm
4.2. Ranking’s features
Chapter 5: Evaluation
Chapter 6: Related Work
Chapter 7: Contributions and future work
References54






























List Images
Image 1.1.1 Peer to Peer means connected together.
Image 1.1.3 Distributed hash tables example.
Image 1.2.1 System must to have the ranking engine to find the one.
Image 2.1 A 16-node Chord network. example.
Image 2.2.2: How Pagerank works
Image 2.3: Distributed Nodes Graph example
Image 3.2.1: Google almost is not exact
Image 3.2.2: Intersect Idea
Image 3.4: Factor Percent
Image 4.1: Bandwidth is the key of ranking trusted
Image 4.1.2: Example of sub-graph semantic rank
Fig 4: A global graph of both local nodes and external nodes
Fig 5: An external local graph without a strategy
Fig 6: An external local graph
Image 4.2: Eigenvalue
Image 4.2.3: Random walk
Image 4.2.4: (n+1) graph nodes
Image 4.2.5: Graph example - 6 nodes
Image 4.2.6: Multiplication result example
Image 4.2.7: Multiplication result example – at iterators










List tables

Table 3.2.1: The Pagerank converge and HITS converge
Table 3.2.2: The Pagerank converge increasing to fast
Table 3.2.3: Pagerank convergence are not steady when Epsilon small
Table 3.2.4: HITS convergence ( take lots time than Pagerank) .
Table 5.1: the number of iterators which converges



















Chapter 1:
Peer to Peer and Ranking Problem


1.1. Peer to Peer
A peer-to-peer, commonly abbreviated to P2P, is any distributed network architecture conceive in associate that make a portion of their resources (such as processing power, disk storage or network bandwidth) directly available to other network partners, without the need for central coordination instances (such as servers or stable hosts). Peers are both suppliers and consumers of resources, in contrast to the traditional client–server model where only servers put out, and clients snack.
Peer-to-peer was popularized by file sharing systems like Napster. File sharing is the practice of distributing or providing access to digitally stored information, such as computer programs, multi-media (audio, video), documents, or electronic books. It may be implemented through a variety of storage, transmission, and distribution models and common methods of file sharing incorporate manual sharing using removable media, centralized computer file server installations on computer networks, World Wide Web-based hyperlinked documents, and the use of distributed peer-to-peer networking.