Presentation is loading. Please wait.

Presentation is loading. Please wait.

2006-10-25 20th CODATA 2006, BEJING1 A P2P Service Discovery Strategy Based on Content Catalogues Dr. Lican Huang, Director Institute of Network & Distributed.

Published byFranklin Harvey Modified over 8 years ago

Similar presentations

Presentation on theme: "2006-10-25 20th CODATA 2006, BEJING1 A P2P Service Discovery Strategy Based on Content Catalogues Dr. Lican Huang, Director Institute of Network & Distributed."— Presentation transcript:

1 2006-10-25 20th CODATA 2006, BEJING1 A P2P Service Discovery Strategy Based on Content Catalogues Dr. Lican Huang, Director Institute of Network & Distributed Computing Zhejiang Sci-Tech University Hangzhou e-Brain Information Company, LTD

2 2006-10-25 20th CODATA 2006, BEJING2 Outline Introduction Overview of VIRGO P2P Service Discovery Based on VIRGO Implementation Conclusion

3 2006-10-25 20th CODATA 2006, BEJING3 Introduction The current strategy for service discovery is based on centralized registers such as UDDI. More distributed service discoveries based on P2P technologies such as Chord lose locality. Distributed service discovery based on VIRGO may solve the above problems.

4 2006-10-25 20th CODATA 2006, BEJING4 Overview of VIRGO Decentralization: VIRGO is fully distributed, robust, easy-managed. Load balance: Cached LRU and MinD nodes in route table help to solve the problem of the load balance in the tree structure. Scalability: Time complexity, space complexity and message-cost of lookup protocol of VIRGO is O(logN), where N is the total number of nodes in the network. Availability: There is at least one path between every two nodes.

5 2006-10-25 20th CODATA 2006, BEJING5 VIRGO - two_tuple Virtual Hierarchical Overlay Network-1

6 2006-10-25 20th CODATA 2006, BEJING6 VIRGO - two_tuple Virtual Hierarchical Overlay Network-2

7 2006-10-25 20th CODATA 2006, BEJING7 One_tuple Virtual Hierarchical Overlay Network—Music Example Music Catalogue music.popular music.classic There are 3 nodes--Node A, B, C A node can join more than one group

8 2006-10-25 20th CODATA 2006, BEJING8 New VIRGO Network Creation (1) Node A(IP address 10.31.21.5) Set up new VIRGO network A music popular Britney music.popular.Britney.A(1) 10.31.21.5 Node A is the provider of Song of Britney, so it is classified as the group of music.popular.Britney

9 2006-10-25 20th CODATA 2006, BEJING9 Node Join-1 Node C (IP address 78.2.127.45) joins VIRGO network A music popular Britney music.popular.Britney.A(1) 10.31.21.5 C music.classic.Beethoven.C(1) 78.2.127.45 classic Beethoven Node C is the provider of Song of Beethoven, so it is classified as the group of music.classic.Beethoven Domains of Node A and C share the prefix--music

10 2006-10-25 20th CODATA 2006, BEJING10 Node Join-2 Node B (IP address 210.12.56.125 ) joins goup (music.popular. Madonna and music.popular.Britney) A music popular Britney music.popular.Britney.A(1) 10.31.21.5 C music.classic.Beethoven.C(1) 78.2.127.45 classic Beethoven B music.popular.Madonna.B(2) Music.popular.Britney.B(3) 210.12.56.125 Madonna Node B is the provider of Song of Britney and Madanna, so it is classified as the groups of music.popular.Britney and music.popular.Madonna Domain of node B shares the prefix— music.popular.Britney with node A, the prefix—music with node C.

11 2006-10-25 20th CODATA 2006, BEJING11 Node’s Join Protocol 1. P join.send(JOINMESSAGE, P groupToJoin ) 2. P groupToJoin.send(JOINMESSAGE, ∀ p i {p i ∊ joinGroup}) 3. ∀ p i {p i ∊ joinGroup}.send(p i.APPROVEMESSAGE,P join ); ∀ p i {p i ∊ joinGroup}.RouteTableAdd(P join.NE,TREE) 4. P join.RouteTableAdd( ∀ p i {p i ∊ joinGroup}.NE,TREE) 5. Repeat step 2 to 4 in upper layer groups until replicated nodes no less than n-tuple or root group.

12 2006-10-25 20th CODATA 2006, BEJING12 Node’s Leave Protocol 1.P dpt.send(LEFTMESSAGE, ∀ p i {p i ∊ leftgroup}) 2. ∀ p i {p i ∊ leftgroup}.RouteTableDelete(P dpt.NE,TREE) 3.Choose p replacenode to replace the left node's role 4.Repeat step 1 and 3 in lower layer groups until to the bottom layer group of P dpt.

13 2006-10-25 20th CODATA 2006, BEJING13 Node’s failure Protocol 1.P notice.send(FAILUREMESSAGE, ∀ p i {p i ∊ failgroup}) 2. ∀ p i {p i ∊ failgroup}.RouteTableDelete(P fail.NE,TREE) 3.Choose p replacenode to replace the left node's role 4.Repeat step 1 and 3 in lower layer groups until to the bottom layer group of left node P fail.

14 2006-10-25 20th CODATA 2006, BEJING14 Software Architecture of VIRGO

15 2006-10-25 20th CODATA 2006, BEJING15 VIRGO based Distributed Service Discovery Web Services are classified into catalogues according to their functions or disciplines such as (all.service.science.bioinformatics). Service providers registry their services into their own Registers such as UDDIs. Service providers join VIRGO network according to their domains which are the same as catalogues of web services they provided.

16 2006-10-25 20th CODATA 2006, BEJING16 UDDI-classification Use yellow page as Domain Catalogue Web Service

17 2006-10-25 20th CODATA 2006, BEJING17 Service Lookup

18 2006-10-25 20th CODATA 2006, BEJING18 Lookup Protocol Step 1 user uses client to send QUERY MESSAGE to entrance node. Step 2 entrance node forwards QUERY MESSAGE to user's owner node. Step 3 user's owner node checks the user's authentication. Step 4 user's owner node routes to the node which is closer to the destination group. Step 5 the route node routes to the closer node to the destination group. Repeat process step 5 until the destination group has been found. Step 6 the node found by step 5 broadcasts QUERY MESSAGE to all nodes belongs to the destination Group and gets the responses from all the nodes. Step 7 the node sends the RESULT MESSAGE to the user ’ s owner node. Step 8 owner node sends RESULT MESSAGE to entrance node. The latter forwards the message to the client.

19 2006-10-25 20th CODATA 2006, BEJING19 Service Lookup-QueryMessage XML Format for QueryMessage: …

20 2006-10-25 20th CODATA 2006, BEJING20 Service Lookup-ResultMessage XML Format for ResultMessage: …

21 2006-10-25 20th CODATA 2006, BEJING21 Implementation-- Enviroment Program languages: Java, Jsp Operation systems: linux, windows Web service container: Tomcat + AXIS Database: mySQL UDDI server: JUDDI UDDI Client: UDDI Browser version0.2

22 2006-10-25 20th CODATA 2006, BEJING22 Implementation-Package

23 2006-10-25 20th CODATA 2006, BEJING23 Conclusion 1.VIRGO-based distributed service discovery is fully self-organized. 2.VIRGO-based distributed service discovery is self-contained. 3.VIRGO-based distributed service discovery is effective. 4.All service providers have their own service registers(such as UDDI) 5.All messages are XML-formed

24 2006-10-25 20th CODATA 2006, BEJING24 More material http://virgo.sourceforge.net/

25 2006-10-25 20th CODATA 2006, BEJING25 Question? Thanks

Download ppt "2006-10-25 20th CODATA 2006, BEJING1 A P2P Service Discovery Strategy Based on Content Catalogues Dr. Lican Huang, Director Institute of Network & Distributed."

Similar presentations

Peer-to-Peer Infrastructure and Applications Andrew Herbert Microsoft Research, Cambridge +44 1223 479818

Peer-to-Peer Infrastructure and Applications Andrew Herbert Microsoft Research, Cambridge
IP Router Architectures. Outline Basic IP Router Functionalities IP Router Architectures.

IP Router Architectures. Outline Basic IP Router Functionalities IP Router Architectures.
Pastry Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK Some slides are borrowed from the original presentation by the authors.

Pastry Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK Some slides are borrowed from the original presentation by the authors.
L. Alchaal & al. Page 1 2002 Offering a Multicast Delivery Service in a Programmable Secure IP VPN Environment Lina ALCHAAL Netcelo S.A., Echirolles INRIA.

L. Alchaal & al. Page Offering a Multicast Delivery Service in a Programmable Secure IP VPN Environment Lina ALCHAAL Netcelo S.A., Echirolles INRIA.
Scalable Content-Addressable Network Lintao Liu 2001.11.19.

Scalable Content-Addressable Network Lintao Liu
CHORD – peer to peer lookup protocol Shankar Karthik Vaithianathan & Aravind Sivaraman University of Central Florida.

CHORD – peer to peer lookup protocol Shankar Karthik Vaithianathan & Aravind Sivaraman University of Central Florida.
Technische Universität Yimei Liao Chemnitz Kurt Tutschku Vertretung - Professur Rechner- netze und verteilte Systeme Chord - A Distributed Hash Table Yimei.

Technische Universität Yimei Liao Chemnitz Kurt Tutschku Vertretung - Professur Rechner- netze und verteilte Systeme Chord - A Distributed Hash Table Yimei.
Technische Universität Chemnitz Kurt Tutschku Vertretung - Professur Rechner- netze und verteilte Systeme Chord - A Distributed Hash Table Yimei Liao.

Technische Universität Chemnitz Kurt Tutschku Vertretung - Professur Rechner- netze und verteilte Systeme Chord - A Distributed Hash Table Yimei Liao.
Massively Distributed Database Systems Distributed Hash Spring 2014 Ki-Joune Li Pusan National University.

Massively Distributed Database Systems Distributed Hash Spring 2014 Ki-Joune Li Pusan National University.
University of Cincinnati1 Towards A Content-Based Aggregation Network By Shagun Kakkar May 29, 2002.

University of Cincinnati1 Towards A Content-Based Aggregation Network By Shagun Kakkar May 29, 2002.
Domain Name System. DNS is a client/server protocol which provides Name to IP Address Resolution.

Domain Name System. DNS is a client/server protocol which provides Name to IP Address Resolution.
Small-world Overlay P2P Network

Small-world Overlay P2P Network
Peer to Peer File Sharing Huseyin Ozgur TAN. What is Peer-to-Peer?  Every node is designed to(but may not by user choice) provide some service that helps.

Peer to Peer File Sharing Huseyin Ozgur TAN. What is Peer-to-Peer?  Every node is designed to(but may not by user choice) provide some service that helps.
Cis3.2 -- e-commerce -- lecture #6: Content Distribution Networks and P2P (based on notes from Dr Peter McBurney © 2002-2005)

Cis e-commerce -- lecture #6: Content Distribution Networks and P2P (based on notes from Dr Peter McBurney © )
Topics in Reliable Distributed Systems 048961 Lecture 2, Fall 2004-2005 Dr. Idit Keidar.

Topics in Reliable Distributed Systems Lecture 2, Fall Dr. Idit Keidar.
Web Servers How do our requests for resources on the Internet get handled? Can they be located anywhere? Global?

Web Servers How do our requests for resources on the Internet get handled? Can they be located anywhere? Global?
Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications Stoica et al. Presented by Tam Chantem March 30, 2007.

Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications Stoica et al. Presented by Tam Chantem March 30, 2007.
P2P: Advanced Topics Filesystems over DHTs and P2P research Vyas Sekar.

P2P: Advanced Topics Filesystems over DHTs and P2P research Vyas Sekar.
Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek and Hari alakrishnan.

Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek and Hari alakrishnan.
Workshop on Cyber Infrastructure in Combustion Science April 19-20, 2006 Subrata Bhattacharjee and Christopher Paolini Mechanical.

Workshop on Cyber Infrastructure in Combustion Science April 19-20, 2006 Subrata Bhattacharjee and Christopher Paolini Mechanical.

Similar presentations

Ads by Google