Lookup Administration for Shared Frameworks in Versatile Impromptu Systems

0
0
1562 days ago, 709 views
PowerPoint PPT Presentation
09/07/2004. Distributed Systems in Mobile Ad-hoc Networks. 2. Layout. IntroductionMotivationProblem DefinitionRelated WorkRINGS : Lookup ServiceAnalysis and ComparisonSimulation ResultsDirections for Future Work and Conclusion. 09/07/2004. Distributed Systems in Mobile Ad-hoc Networks. 3.

Presentation Transcript

Slide 1

M. Tech Project Presentation By, Kalpesh Patel 02329027 Guided By, Dr. Sridhar Iyer, Dr. Krishna Paul. Query Service for Peer-to-Peer Systems in Mobile Ad-hoc Networks Peer-to-Peer Systems in Mobile Ad-hoc Networks

Slide 2

Outline Introduction Motivation Problem Definition Related Work RINGS : Lookup Service Analysis and Comparison Simulation Results Directions for Future Work and Conclusion Peer-to-Peer Systems in Mobile Ad-hoc Networks

Slide 3

Introduction Peer-to-Peer Systems Nodes share documents and administrations among different hubs in P2P organize. For the most part focuse on wired system. Portable Ad-hoc Networks MANET is an independent framework for versatile has over remote connections. Multi-bounce situation. Portability. Shared Systems in Mobile Ad-hoc Networks

Slide 4

Motivation Why P2P in MANET? What happens if existing P2P conventions are conveyed in MANET? Neighbors at application layer may not really be neighbors at system layer. Issues with existing MANET conventions Peer-to-Peer Systems in Mobile Ad-hoc Networks

Slide 5

Problem Definition The general target is to effectively convey P2P applications in Mobile Ad-hoc Networks. In particular, need of a system layer convention which upgrades question query benefit. Shared Systems in Mobile Ad-hoc Networks

Slide 6

Related Work Mobile Peer-to-Peer Protocol (MPP) : Recent work on P2P in versatile environment. Reference : Rudiger Schollmeier, Ingo Gruber, Michael Finkenzeller, Protocol for Peer-to-Peer Networking in Mobile Environments. The issue is, MPP still depends on flooding at system layer. Distributed Systems in Mobile Ad-hoc Networks

Slide 7

RINGS : Lookup Service Basic Protocol - Advertisement Network layer gets list from application layer. Hub communicates its information file into the system. Each K-jump hubs keep file for a given hub. This procedure is trailed by each hub in the system. Essential Protocol – query Node advances the inquiry to its neighbors. Because of equivalent appropriation of files all through the system, question is replied inside K/2 bounces. In this way, Upper headed for inquiry query is K/2 bounces. Shared Systems in Mobile Ad-hoc Networks

Slide 8

RINGS : Cont… Basic convention makes an arrangement of nonexistent circles for a given source hub as appeared in Fig.1. Fig. 2 demonstrates a case of 2-bounce (K=2) situation. Shared Systems in Mobile Ad-hoc Networks

Slide 9

RINGS : Cont… Route Maintenance Advertise bundle keeps up course to the source hub. This is expert by keeping up turn around course on the way. A hub, which stores the list, keeps this course alongside other data. On the off chance that a question results in these present circumstances hub, it reacts with inquiry result and in addition course to the source. An ideal course . Shared Systems in Mobile Ad-hoc Networks

Slide 10

RINGS : Cont… Mobility has none or little effect on the execution of the convention. In normal, number of neighbors per hub in portable system can be taken as log(N). Thus, regardless of the possibility that as much as log(N) - 1 hubs moves far from the system, hub gets no less than one hub for question result. Therefore, a hub gets no less than one hub which can fulfill its question regardless of the possibility that L number of hubs from closest circle leave the system, where L is, Where K = 2, 4, 6, … Peer-to-Peer Systems in Mobile Ad-hoc Networks

Slide 11

RINGS : Cont… Optimization Data Updates are sent to just those hubs which have put away lists for the source hub. Hub Joining Whenever another hub joins the system, it gets some share of files from its neighbors. Distributed Systems in Mobile Ad-hoc Networks

Slide 12

RINGS : Cont… Node Deletion Neighbors of leaving hub hunt down an option course. In the wake of getting option course, lists are reallocated by bounce (K) esteem. Shared Systems in Mobile Ad-hoc Networks

Slide 13

Analysis Goal Count the "genuine" inquiry query cost for P2P convention like "Harmony" in MANET. The normal separation d between any two hubs at the system layer can be taken as, Now, inquiry query cost for Chord in application layer is log(N). Genuine cost = App. Layer cost + Network layer cost . Along these lines, powerful query cost L harmony for harmony convention is, Peer-to-Peer Systems in Mobile Ad-hoc Networks

Slide 14

Analysis (Cont… ) For RINGS, query cost at first jump is, In turn, each of these log(N) hubs advances question to its neighbors. Proceeding with along these lines, question query cost at the closest K-bounce is, Peer-to-Peer Systems in Mobile Ad-hoc Networks

Slide 15

Simulation Results An essential measure is, the means by which normal number of remote records put away per hub increments as the estimation of K increments. Result shows that, as estimation of K builds, normal number of remote files per hub increments quick. Esteem K = 4 equalizations both the measurements. Shared Systems in Mobile Ad-hoc Networks

Slide 16

Simulation Results (Cont… ) Graph demonstrates examination between inquiry query costs L harmony and L RINGS For the estimation of K = 4, RINGS performs superior to Chord as far as question query cost. For the estimation of K = 6, as the quantity of hubs increments past a specific number, RINGS performs superior to Chord. Shared Systems in Mobile Ad-hoc Networks

Slide 17

Comparison Why RINGS? Latest work still depends on system layer flooding for inquiry query. Most received MANET conventions like AODV, DSR utilizes communicate system, brings about flooding the entire system each time when a hunt down a hub requires. P2P conventions Gnutella utilizes communicate. Harmony doles out each hub a virtual identifier autonomous of genuine areas, which is not ideal at system layer. Shared Systems in Mobile Ad-hoc Networks

Slide 18

Directions for Future Work RINGS accept enough storage room accessible at the hub. There is an extent of change to decrease this overhead. Compelling portability taking care of. Down to earth applications. Distributed Systems in Mobile Ad-hoc Networks

Slide 19

Conclusion There is a need to consolidate P2P applications and Ad-hoc frameworks to share information among versatile clients. Current P2P conventions neglect to perform well with this blend. An underlying stride to this issue is RINGS, which concentrates on question query cost streamlining. Distributed Systems in Mobile Ad-hoc Networks

Slide 20

Thank You Peer-to-Peer Systems in Mobile Ad-hoc Networks

SPONSORS