Service Discovery and Semantic Overlay Network Creation in DBGlobe University of Ioannina 4th DBGlobe Meeting Paris, June 23, 2003.

Slides:



Advertisements
Similar presentations
SkipNet: A Scalable Overlay Network with Practical Locality Properties Nick Harvey, Mike Jones, Stefan Saroiu, Marvin Theimer, Alec Wolman Microsoft Research.
Advertisements

Sequoia: Virtual-Tree Models for Internet Path Metrics Rama Microsoft Research Also:Ittai Abraham (Hebrew Univ.) Mahesh Balakrishnan (Cornell) Archit Gupta.
Effective Keyword Based Selection of Relational Databases Bei Yu, Guoliang Li, Karen Sollins, Anthony K.H Tung.
“SUB-2-SUB” Self-Organizing Collaborative Content-based Pub/Sub Spyros Voulgaris, Etienne Rivière, Anne-Marie Kermarrec, Maarten van Steen.
Bloom Based Filters for Hierarchical Data Georgia Koloniari and Evaggelia Pitoura University of Ioannina, Greece.
Future and Emerging Technologies (FET) Future and Emerging Technologies (FET) The roots of innovation Proactive initiative on: Global Computing (GC) Proactive.
Lecture 5 - Routing On the Flat Labels M.Sc Ilya Nikolaevskiy Helsinki Institute for Information Technology (HIIT)
University of Cincinnati1 Towards A Content-Based Aggregation Network By Shagun Kakkar May 29, 2002.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.
LSDS-IR’08, October 30, Peer-to-Peer Similarity Search over Widely Distributed Document Collections Christos Doulkeridis 1, Kjetil Nørvåg 2, Michalis.
GloServ: Global Service Discovery Architecture Knarig Arabshian and Henning Schulzrinne IRT internal talk April 26, 2005.
Vassilios V. Dimakopoulos and Evaggelia Pitoura Distributed Data Management Lab Dept. of Computer Science, Univ. of Ioannina, Greece
1 Canon in G Major: Designing DHTs with Hierarchical Structure Prasanna Ganesan (Stanford University) Krishna Gummadi (U. of Washington) Hector Garcia-Molina.
Object Naming & Content based Object Search 2/3/2003.
Ranking by Odds Ratio A Probability Model Approach let be a Boolean random variable: document d is relevant to query q otherwise Consider document d as.
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
INTRODUCTION TO PEER TO PEER NETWORKS Z.M. Joseph CSE 6392 – DB Exploration Spring 2006 CSE, UT Arlington.
Future and Emerging Technologies (FET) Future and Emerging Technologies (FET) The roots of innovation Proactive initiative on: Global Computing (GC) Proactive.
«Tag-based Social Interest Discovery» Proceedings of the 17th International World Wide Web Conference (WWW2008) Xin Li, Lei Guo, Yihong Zhao Yahoo! Inc.,
PIC: Practical Internet Coordinates for Distance Estimation Manuel Costa joint work with Miguel Castro, Ant Rowstron, Peter Key Microsoft Research Cambridge.
1 Locating Application Data Across Service Discovery Domains MobiCom’01.
An affinity-driven clustering approach for service discovery and composition for pervasive computing J. Gaber and M.Bakhouya Laboratoire SeT Université.
Research Interests Georgia Koloniari Computer Science Department University of Ioannina, Greece.
Peer to Peer Research survey TingYang Chang. Intro. Of P2P Computers of the system was known as peers which sharing data files with each other. Build.
Content-Based Music Information Retrieval in Wireless Ad-hoc Networks.
PMLAB Finding Similar Image Quickly Using Object Shapes Heng Tao Shen Dept. of Computer Science National University of Singapore Presented by Chin-Yi Tsai.
Trust- and Clustering-Based Authentication Service in Mobile Ad Hoc Networks Presented by Edith Ngai 28 October 2003.
Content Addressable Network CAN. The CAN is essentially a distributed Internet-scale hash table that maps file names to their location in the network.
Handling Spatial Data In P2P Systems Verena Kantere, Timos Sellis, Yannis Kouvaras.
A Scalable Content-Addressable Network (CAN) Seminar “Peer-to-peer Information Systems” Speaker Vladimir Eske Advisor Dr. Ralf Schenkel November 2003.
Friends and Locations Recommendation with the use of LBSN By EKUNDAYO OLUFEMI ADEOLA
Implicit group messaging in peer-to-peer networks Daniel Cutting, 28th April 2006 Advanced Networks Research Group.
Ground Truth Free Evaluation of Segment Based Maps Rolf Lakaemper Temple University, Philadelphia,PA,USA.
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
Computer Networks Dr. Jorge A. Cobb The Performance of Query Control Schemes for the Zone Routing Protocol.
The Performance of Query Control Schemes for the Zone Routing Protocol Zygmunt J. Haas Marc R. Pearlman.
National Institute of Advanced Industrial Science and Technology Query Processing for Distributed RDF Databases Using a Three-dimensional Hash Index Akiyoshi.
Efficient Semantic Based Content Search in P2P Network Heng Tao Shen, Yan Feng Shu, and Bei Yu.
1 Peer-to-Peer Technologies Seminar by: Kunal Goswami (05IT6006) School of Information Technology Guided by: Prof. C.R.Mandal, School of Information Technology.
Spatial Issues in DBGlobe Dieter Pfoser. Location Parameter in Services Entering the harbor (x,y position)… …triggers information request.
The Bloom Paradox Ori Rottenstreich Joint work with Yossi Kanizo and Isaac Keslassy Technion, Israel.
DOCUMENT UPDATE SUMMARIZATION USING INCREMENTAL HIERARCHICAL CLUSTERING CIKM’10 (DINGDING WANG, TAO LI) Advisor: Koh, Jia-Ling Presenter: Nonhlanhla Shongwe.
Marwan Al-Namari Hassan Al-Mathami. Indexing What is Indexing? Indexing is a mechanisms. Why we need to use Indexing? We used indexing to speed up access.
Semantic Overlay Networks in P2P systems A. Crespo, H. Garcia-Molina Speaker: Pavel Serdyukov Tutor: Jens Graupmann.
Pastry Antony Rowstron and Peter Druschel Presented By David Deschenes.
SocialVoD: a Social Feature-based P2P System Wei Chang, and Jie Wu Presenter: En Wang Temple University, PA, USA IEEE ICPP, September, Beijing, China1.
Taxonomy Caching: A Scalable Low- Cost Mechanism for Indexing Remote Contents in Peer-to-Peer Systems Kjetil Nørvåg Norwegian University of Science and.
1 Subscription Partitioning and Routing in Content-based Publish/Subscribe Networks Yi-Min Wang, Lili Qiu, Dimitris Achlioptas, Gautam Das, Paul Larson,
Database Management Systems, R. Ramakrishnan 1 Algorithms for clustering large datasets in arbitrary metric spaces.
Algorithms and Techniques in Structured Scalable Peer-to-Peer Networks
Two Peer-to-Peer Networking Approaches Ken Calvert Net Seminar, 23 October 2001 Note: Many slides “borrowed” from S. Ratnasamy’s Qualifying Exam talk.
P2P Search COP P2P Search Techniques Centralized P2P systems  e.g. Napster, Decentralized & unstructured P2P systems  e.g. Gnutella.
An Energy-Efficient Approach for Real-Time Tracking of Moving Objects in Multi-Level Sensor Networks Vincent S. Tseng, Eric H. C. Lu, & Kawuu W. Lin Institute.
An overlay for latency gradated multicasting Anwitaman Datta SCE, NTU Singapore Ion Stoica, Mike Franklin EECS, UC Berkeley
REED : Robust, Efficient Filtering and Event Detection in Sensor Network Daniel J. Abadi, Samuel Madden, Wolfgang Lindner Proceedings of the 31st VLDB.
Efficient Semantic Web Service Discovery in Centralized and P2P Environments Dimitrios Skoutas 1,2 Dimitris Sacharidis.
OntoZilla: An Ontology-based, Semi-structured, and Evolutionary P2P Network for Information Systems and Services 指導教授:李官陵 學 生:陳建博 蔡英傑
Tanenbaum & Van Steen, Distributed Systems: Principles and Paradigms, 2e, (c) 2007 Prentice-Hall, Inc. All rights reserved DISTRIBUTED SYSTEMS.
A Place-based Model for the Internet Topology Xiaotao Cai Victor T.-S. Shi William Perrizo NDSU {Xiaotao.cai, Victor.shi,
Presented by Edith Ngai MPhil Term 3 Presentation
The Variable-Increment Counting Bloom Filter
Early Measurements of a Cluster-based Architecture for P2P Systems
Dewan Tanvir Ahmed and Shervin Shirmohammadi
Indexing and Hashing Basic Concepts Ordered Indices
Paraskevi Raftopoulou, Euripides G.M. Petrakis
Panagiotis G. Ipeirotis Luis Gravano
A Semantic Peer-to-Peer Overlay for Web Services Discovery
BPaaS Evaluation Research Prototype
An Architecture for Secure Wide-Area Service Discovery
Presentation transcript:

Service Discovery and Semantic Overlay Network Creation in DBGlobe University of Ioannina 4th DBGlobe Meeting Paris, June 23, 2003

2Outline zPart 1: Service Discovery zPart 2: Semantic Overlay Networks zPart 3: Ontologies

3Outline zPart 1: Service Discovery zPart 2: Semantic Overlay Networks zPart 3: Ontologies

4 System Architecture zPMOs are attached to Cell Administration Servers (CASs) zCASs are responsible for the service discovery process zXML data or XML-based service descriptions

5 Service Discovery zEach CAS maintains data summaries (e.g. Bloom Filters) to assist query routing A B C SumB SumC

6 Multi-level Bloom Filters zHash-based indices that extend Bloom filters to support the evaluation of path queries. zTwo approaches: Breadth and Depth Bloom Filters that rely on different ways of hashing an XML-tree. zCompact structures zAppearance of false positives

7 Performance Results zMulti-level Bloom filters outperform in terms of false postives Simple Bloom filters in evaluating path queries. zFor 2% of the total size of the data, multi- level Bloom filters evaluate path queries for a false positives ratio below 3% zBreadth Blooms work better than Depth Blooms. zDepth Blooms require more space but are suitable for special type of queries.

8 Filters Distribution zPeers organized into hierarchies connected through a main channel zEach server maintains: ya local filter ya merged filter of the filters in its sub-tree. yIf it is a root-peer(connected to the main channel) a merged filter for every other root-peer

9 Distribution: Hierarchical Organization Node C: Local filter Merged filter :E  F  G  H Root filters: A, B, D

10Outline zPart 1: Service Discovery zPart 2: Semantic Overlay Networks zPart 3: Ontologies

11 Content-based organization zGroup peers together according to their content zUse filter and not data similarity for efficiency zWhen a peer joins the system: it broadcasts its local summary and attaches to the most «similar» peer available

12 Bloom Filter Similarity zNodes organized according to Bloom Filter Similarity zMeasure: similarity measure based on the Manhattan distance metric. Let two filters B and C of size m d(B, C) = |B[1] – C[1]| + |B[2] – C[2]| + … |B[m] – C[m]|. similarity(B, C) = m – d(B, C).

13 Bloom Filter Similarity (cont’d) C B similarity(B, C) =8 - ( ) = 4 For multi-level Bloom filters similarity is defined as the sum of each pair of corresponding levels

14 Performance Results zThe content-based organization is much more efficient in finding all the results for a query, than the proximity organization. z They both perform similarly in discovering the first result. z The content-based organization outperforms the proximity one when the nodes that satisfy a given query are limited.

15 Current work zA peer can belong to more than one hierarchies. zSelf-organization--tuning of the system predefined threshold. zService Discovery: yLocate the right cluster (hierarchy) yFind the peer in the hierarchy

16Outline zPart 1: Service Discovery zPart 2: Semantic Overlay Networks zPart 3: Ontologies

17 Ontologies Ontologies are hierarchies --> Thus they can be summarized by multi-level Blooms

18 Ontologies (cont’d) zThe main issue: How to locate the matching hierarchy(cluster) zJust check every root peer. Can we use a global ontology to route us to the matching hierarchy more efficiently?

19 Thank you