Guided ByProf.M.Narayanan

Department Of CSE & IT

Presented ByManimaran.S

M.E CSE191231006

A COMMUNITY BASED LOOKUP SERVICE IN P2P

Abstract A Community-Based Caching (CBC) solution that

enhances both communitywide and system-wide lookup performance is proposed.

CBC consists of a sub-overlay formation scheme and a Local-Knowledge-based Distributed Caching (LKDC) algorithm. Sub overlays enable communities to forward queries through their members.

To develop the heuristic-based LKDC algorithm that not only relies on purely local information but also provides close-to-optimal caching performance.

Introduction Modern Peer-to-Peer (P2P) systems share a variety of

resources such as files, processor cycles, storage capacity, and sensors.

Current systems are designed based on either the system-wide behavior, attempting to provide everyone an equal level of service (e.g., average search/download time), or optimized for more dominant users’ requirements.

A community is a subset of peers that share some similarity in terms of resource semantics, geography, or organizational boundaries.

Existing Work P2P systems consist of many smaller communities based

on semantic, geographic, and organizational interests.

Sharing among P2P communities suggests that communities should not be isolated, and conversely combining multiple communities together subsides relative popularities of contents

Existing solution space is insufficient as they are limited to either isolating communities or combining all the communities together.

Alternatively, better lookup performance can be gained by catering to the popularity of individual communities while being members of a larger P2P system

Community based larger P2P system

Single Community based P2P system

Proposed MethodDISTRIBUTED CACHING

First formulate the Distributed Local Caching (DLC) problem.

DLC problem requires global information that is difficult to obtain.

A heuristic is a technique designed for solving a problem more quickly when classic methods are too slow, or for finding an approximate solution when classic methods fail to find any exact solution. This is achieved by trading optimality, completeness, accuracy, or precision for speed.

A distributed, or partitioned, cache is a clustered, fault-tolerant cache that has linear scalability.

Data is partitioned among all the computers of the cluster.

For fault-tolerance, partitioned caches can be configured to keep each piece of data on one or more unique computers within a cluster.

Distributed caches are the most commonly used caches in Coherence.

They are two types of Distributed Caching

1. Modified Global-Knowledge-Based Distributed Caching

2. Modified Local Knowledge-Based Distributed Caching

Architecture

Each system in particular Community have unique CID

MODULES

Setup Peer to Peer network Create Community peers in Network

and assign CID to each node Create Local Knowledge based cache

and Global knowledge based cache System

Compare the results

SCREEN SHOT

System RequirementHardware Specification

Processor - Dual Core or higher.

Ram - 1 GB.

Hard Disk - 320 GB.

General - Keyboard, Monitor, Mouse.

 

Software Specification

Language - C++ (visual basic 6.0)

Operating System - Windows XP/sp3

Back End - Silicon Lab, Lab Tech Soft (LTNetSoft 1.0)

References1. Min Yang ; Dept. of Electr. & Comput. Eng., Stony Brook Univ., Stony Brook, NY, USA ;

Yuanyuan Yang “An Efficient Hybrid Peer-to-Peer System for Distributed Data Sharing” , Computers, IEEE Transactions on  (Volume:59 ,  Issue: 9 ) Sept. 2010.

2. Weijie Wu, Richard T.B. Ma, John C.S. Lui,” Distributed Caching via Rewarding: An Incentive Scheme Design in P2P-VoD Systems” May 29, 2013.

3. H. M. N. Dilum Bandara, Student Member, IEEE and Anura P. Jayasumana, Senior Member, IEEE “Community-Based Caching for Enhanced Lookup Performance in P2P Systems” IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, Parallel and Distributed Systems, IEEE Transactions on  (Volume:24 ,  Issue: 9 ) , Sept. 2013.

4. AlTuhafi, A.W. ; Ramadass, S. ; Jaber, A.N. “Framework for adaptable topology for peer-to-peer live video streaming” IEEE Digital Object Identifier: 10.1109/BEIAC.2013.6560154 Publication Year: 2013 , Page(s): 386 – 389

5. Wu, W. ; Ma, R. ; Lui, J." Full text access may be available. Click article title to sign in or learn about subscription options. Distributed Caching via Rewarding: An Incentive Scheme Design in P2P-VoD Systems"

Thank

You