STATE KEY LABORATORY OF NETWORKING & SWITCHING BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATAIONS 2007-1-5 A Semantic Peer-to- Peer Overlay for Web Services.

Slides:



Advertisements
Similar presentations
Pronalaženje Skrivenog Znanja
Advertisements

Pastry Peter Druschel, Rice University Antony Rowstron, Microsoft Research UK Some slides are borrowed from the original presentation by the authors.
Digital Library Service – An overview Introduction System Architecture Components and their functionalities Experimental Results.
Chord: A scalable peer-to- peer lookup service for Internet applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashock, Hari Balakrishnan.
SplitStream: High- Bandwidth Multicast in Cooperative Environments Monica Tudora.
University of Cincinnati1 Towards A Content-Based Aggregation Network By Shagun Kakkar May 29, 2002.
1 PASTRY Partially borrowed from Gabi Kliot ’ s presentation.
Common approach 1. Define space: assign random ID (160-bit) to each node and key 2. Define a metric topology in this space,  that is, the space of keys.
On Triple Dissemination, Forward- Chaining and Load Balancing in DHT Based RDF Stores Dominic Battre, Felix Heine, Andre Höing, and Odej Kao Presented.
Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems Antony Rowstron and Peter Druschel Proc. of the 18th IFIP/ACM.
A Similarity Measure for OWL-S Annotated Web Services Web Intelligence Laboratory, Sharif University of Technology, Tehran, Iran WI 2006 SeyedMohsen (Mohsen)
Spring 2003CS 4611 Peer-to-Peer Networks Outline Survey Self-organizing overlay network File system on top of P2P network Contributions from Peter Druschel.
Efficient Content Location Using Interest-based Locality in Peer-to-Peer Systems Presented by: Lin Wing Kai.
Secure routing for structured peer-to-peer overlay networks (by Castro et al.) Shariq Rizvi CS 294-4: Peer-to-Peer Systems.
Object Naming & Content based Object Search 2/3/2003.
1 Peer-to-Peer Networks Outline Survey Self-organizing overlay network File system on top of P2P network Contributions from Peter Druschel.
Grid Service Discovery with Rough Sets Maozhen Li, Member, IEEE, Bin Yu, Omer Rana, and Zidong Wang, Senior Member, IEEE IEEE TRANSACTION S ON KNOLEDGE.
Topology-Aware Overlay Networks By Huseyin Ozgur TAN.
 Structured peer to peer overlay networks are resilient – but not secure.  Even a small fraction of malicious nodes may result in failure of correct.
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems (Antony Rowstron and Peter Druschel) Shariq Rizvi First.
Hashing it Out in Public Common Failure Modes of DHT-based Anonymity Schemes Andrew Tran, Nicholas Hopper, Yongdae Kim Presenter: Josh Colvin, Fall 2011.
Mobile Ad-hoc Pastry (MADPastry) Niloy Ganguly. Problem of normal DHT in MANET No co-relation between overlay logical hop and physical hop – Low bandwidth,
INTRODUCTION TO PEER TO PEER NETWORKS Z.M. Joseph CSE 6392 – DB Exploration Spring 2006 CSE, UT Arlington.
Roger ZimmermannCOMPSAC 2004, September 30 Spatial Data Query Support in Peer-to-Peer Systems Roger Zimmermann, Wei-Shinn Ku, and Haojun Wang Computer.
A Survey of Peer-to-Peer Content Distribution Technologies Stephanos Androutsellis-Theotokis and Diomidis Spinellis ACM Computing Surveys, December 2004.
1 Plaxton Routing. 2 Introduction Plaxton routing is a scalable mechanism for accessing nearby copies of objects. Plaxton mesh is a data structure that.
1 PASTRY. 2 Pastry paper “ Pastry: Scalable, decentralized object location and routing for large- scale peer-to-peer systems ” by Antony Rowstron (Microsoft.
PIC: Practical Internet Coordinates for Distance Estimation Manuel Costa joint work with Miguel Castro, Ant Rowstron, Peter Key Microsoft Research Cambridge.
Matchmaking of Semantic Web Services Using Semantic-Distance Information Mehmet Şenvar, Ayşe Bener Boğaziçi University Department of Computer Engineering.
Web Service Discovery Mechanisms Looking for a Needle in a Haystack? Evangelos Sakkopoulos joint work with J. Garofalakis, Y. Panagis, A. Tsakalidis University.
Jonathan Walpole CSE515 - Distributed Computing Systems 1 Teaching Assistant for CSE515 Rahul Dubey.
Extracting Semantic Constraint from Description Text for Semantic Web Service Discovery Dengping Wei, Ting Wang, Ji Wang, and Yaodong Chen Reporter: Ting.
From Coulouris, Dollimore, Kindberg and Blair Distributed Systems: Concepts and Design Edition 5, © Addison-Wesley 2012 Slides for Chapter 10: Peer-to-Peer.
Hongil Kim E. Chan-Tin, P. Wang, J. Tyra, T. Malchow, D. Foo Kune, N. Hopper, Y. Kim, "Attacking the Kad Network - Real World Evaluation and High.
Network Computing Laboratory Scalable File Sharing System Using Distributed Hash Table Idea Proposal April 14, 2005 Presentation by Jaesun Han.
Resource Addressable Network (RAN) An Adaptive Peer-to-Peer Substrate for Internet-Scale Service Platforms RAN Concept & Design  Adaptive, self-organizing,
An IP Address Based Caching Scheme for Peer-to-Peer Networks Ronaldo Alves Ferreira Joint work with Ananth Grama and Suresh Jagannathan Department of Computer.
1 Peer-to-Peer Technologies Seminar by: Kunal Goswami (05IT6006) School of Information Technology Guided by: Prof. C.R.Mandal, School of Information Technology.
Scalable Content- Addressable Networks Prepared by Kuhan Paramsothy March 5, 2007.
Peer to Peer A Survey and comparison of peer-to-peer overlay network schemes And so on… Chulhyun Park
Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems Antony Rowstron and Peter Druschel, Middleware 2001.
DHT-based unicast for mobile ad hoc networks Thomas Zahn, Jochen Schiller Institute of Computer Science Freie Universitat Berlin 報告 : 羅世豪.
1 Semantic Driven Hshing(SDH): An Ontology-based Search Scheme for Semantic Aware Network(SA Net) Chatree Sangpachatanaruk, Taieb Znati University of Pittsburgh.
Pastry Antony Rowstron and Peter Druschel Presented By David Deschenes.
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
Stefanos Antaris A Socio-Aware Decentralized Topology Construction Protocol Stefanos Antaris *, Despina Stasi *, Mikael Högqvist † George Pallis *, Marios.
Ad-hoc On Demand Distance Vector Protocol Hassan Gobjuka.
Service discovery with semantic alignment Alberto Fernández AT COST WG1 meeting, Cyprus, Dec, 2009.
Peer to Peer Network Design Discovery and Routing algorithms
Algorithms and Techniques in Structured Scalable Peer-to-Peer Networks
Ferdowsi University of Mashhad 1 Automatic Semantic Web Service Composition based on owl-s Research Proposal presented by : Toktam ghafarian.
Peer-to-Peer Systems: An Overview Hongyu Li. Outline  Introduction  Characteristics of P2P  Algorithms  P2P Applications  Conclusion.
LOOKING UP DATA IN P2P SYSTEMS Hari Balakrishnan M. Frans Kaashoek David Karger Robert Morris Ion Stoica MIT LCS.
Stefanos Antaris Distributed Publish/Subscribe Notification System for Online Social Networks Stefanos Antaris *, Sarunas Girdzijauskas † George Pallis.
P2P Search COP6731 Advanced Database Systems. P2P Computing  Powerful personal computer Share computing resources P2P Computing  Advantages: Shared.
Large Scale Sharing Marco F. Duarte COMP 520: Distributed Systems September 19, 2004.
CMSC 691B Multi-Agent System A Scalable Architecture for Peer to Peer Agent by Naveen Srinivasan.
A Software Framework for Matchmaking based on Semantic Web Technology Eyal Oren DERI 2004/04/14 on the paper by Li and Horrocks
Efficient Semantic Web Service Discovery in Centralized and P2P Environments Dimitrios Skoutas 1,2 Dimitris Sacharidis.
Plethora: A Locality Enhancing Peer-to-Peer Network Ronaldo Alves Ferreira Advisor: Ananth Grama Co-advisor: Suresh Jagannathan Department of Computer.
Yoon kyoung-a A Semantic Match Algorithm for Web Services Based on Improved Semantic Distance Gongzhen Wang, Donghong Xu, Yong Qi, Di Hou School.
Fabián E. Bustamante, Fall 2005 A brief introduction to Pastry Based on: A. Rowstron and P. Druschel, Pastry: Scalable, decentralized object location and.
A Survey of Peer-to-Peer Content Distribution Technologies Stephanos Androutsellis-Theotokis and Diomidis Spinellis ACM Computing Surveys, December 2004.
Pastry Scalable, decentralized object locations and routing for large p2p systems.
Plethora: Infrastructure and System Design
PASTRY.
A Scalable content-addressable network
A Semantic Peer-to-Peer Overlay for Web Services Discovery
ECE 544 Project3 Dheeraj Medikonda Ravi Chandra Godavarthi 1.
Presentation transcript:

STATE KEY LABORATORY OF NETWORKING & SWITCHING BEIJING UNIVERSITY OF POSTS AND TELECOMMUNICATAIONS A Semantic Peer-to- Peer Overlay for Web Services Discovery Shuang Kai

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Agenda Introduction Thoughtway of our method Semantic overlay node architecture Routing Table & Neighborhood Table Message Semantic Matching & Routing Example Experimental Evaluation Conclusion

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Introduction-1 service discovery mechanisms –centralized registry UDDI or DAML-S matchmaker –decentralized approach centralized registry –single point failure –performance bottleneck

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Introduction-2 based on P2P technology –unstructured P2P network limitation on the scalability –structured P2P networks based on DHT logn routing hops – network of size n nodes exact match

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Agenda Introduction Thoughtway of our method Semantic overlay node architecture Routing Table & Neighborhood Table Message Semantic Matching & Routing Example Experimental Evaluation Conclusion

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Thoughtway of our method structured P2P semantic method different matching degree extends the Plaxton mesh –dynamic semantic overlay network –keyword prefix routing to semantic prefix routing

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Characteristic Vector - 1 semantic service description –OWL-S or WSMO characteristic vector –a series of numeric string –extract service’s information input, output, Pre-conditions and Effects ontological concept

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Characteristic Vector - 2 service description: Advertisement1 = {C 7, C 6, C 5, C 4 } CV={10, 11, 0000, 0100}.

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Agenda Introduction Thoughtway of our method Semantic overlay node architecture Routing Table & Neighborhood Table Message Semantic Matching & Routing Example Experimental Evaluation Conclusion

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Semantic overlay node architecture -1

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Semantic overlay node architecture -2

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Agenda Introduction Thoughtway of our method Semantic overlay node architecture Routing Table & Neighborhood Table Message Semantic Matching & Routing Example Experimental Evaluation Conclusion

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Routing Table multiple rows each rows holds a number of entries semantic matching of the prefix up to an element in the CV

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Neighborhood Table Contains the nodeID and IP address of the peers Set of peers that are closest to the local peer –Based on semantic similarity

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Agenda Introduction Thoughtway of our method Semantic overlay node architecture Routing Table & Neighborhood Table Message Semantic Matching & Routing Example Experimental Evaluation Conclusion

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Semantic Matching Degree Exact –If advertisement S and request Q are equivalent –S ≡ Q PlugIn –If S could always be used for Q –S is a plug-in match for Q, Q ⊆ S. Subsume –If S is more general than Q –S is a Subsume match for Q, S ⊆ Q

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Message Routing and Locating

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Agenda Introduction Thoughtway of our method Semantic overlay node architecture Routing Table & Neighborhood Table Message Semantic Matching & Routing Example Experimental Evaluation Conclusion

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Example Message ID C 3 C 7 C A C 0 Exact Subsume

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Agenda Introduction Thoughtway of our method Semantic overlay node architecture Routing Table & Neighborhood Table Message Semantic Matching & Routing Example Experimental Evaluation Conclusion

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Experimental Evaluation - 1

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Experimental Evaluation - 2

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Agenda Introduction Thoughtway of our method Semantic overlay node architecture Routing Table & Neighborhood Table Message Semantic Matching & Routing Example Experimental Evaluation Conclusion

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Conclusion Our System –support semantic matching ontological concept encoding scheme –based on the structured overlay network dynamic Plaxton mesh-like network Future work –improve the usability of this system

STATE KEY LABORATORY OF SWITCHING TECHNOLOGY AND COMMUNICATION NETWORK Thank you !