Deterministic and Semantically Organized Network Topology

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

Performance in Decentralized Filesharing Networks Theodore Hong Freenet Project.
Dynamic Replica Placement for Scalable Content Delivery Yan Chen, Randy H. Katz, John D. Kubiatowicz {yanchen, randy, EECS Department.
Tapestry: Decentralized Routing and Location SPAM Summer 2001 Ben Y. Zhao CS Division, U. C. Berkeley.
CAN 1.Distributed Hash Tables a)DHT recap b)Uses c)Example – CAN.
P2PR-tree: An R-tree-based Spatial Index for P2P Environments ANIRBAN MONDAL YI LIFU MASARU KITSUREGAWA University of Tokyo.
Scalable Content-Addressable Network Lintao Liu
Clayton Sullivan PEER-TO-PEER NETWORKS. INTRODUCTION What is a Peer-To-Peer Network A Peer Application Overlay Network Network Architecture and System.
LightFlood: An Optimal Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.
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.
HyperCuP – P2P Network Boyko Syarov. 2 Outline  HyperCup: What is it?  Basic Concepts  Broadcasting Algorithm  Topology Construction  Ontology Based.
Building Low-Diameter P2P Networks Eli Upfal Department of Computer Science Brown University Joint work with Gopal Pandurangan and Prabhakar Raghavan.
Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek and Hari alakrishnan.
presented by Hasan SÖZER1 Scalable P2P Search Daniel A. Menascé George Mason University.
Object Naming & Content based Object Search 2/3/2003.
Chord-over-Chord Overlay Sudhindra Rao Ph.D Qualifier Exam Department of ECECS.
Freenet A Distributed Anonymous Information Storage and Retrieval System I Clarke O Sandberg I Clarke O Sandberg B WileyT W Hong.
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
Algorithms for Self-Organization and Adaptive Service Placement in Dynamic Distributed Systems Artur Andrzejak, Sven Graupner,Vadim Kotov, Holger Trinks.
INTRODUCTION TO PEER TO PEER NETWORKS Z.M. Joseph CSE 6392 – DB Exploration Spring 2006 CSE, UT Arlington.
Developing Analytical Framework to Measure Robustness of Peer-to-Peer Networks Niloy Ganguly.
Introduction to Peer-to-Peer Networks. What is a P2P network A P2P network is a large distributed system. It uses the vast resource of PCs distributed.
GeoGrid: A scalable Location Service Network Authors: J.Zhang, G.Zhang, L.Liu Georgia Institute of Technology presented by Olga Weiss Com S 587x, Fall.
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.
1 P2P File-Sharing Solution CS654 – Software Architecture course project Guide: T V Prabhakar Members: S Pavan Kumar – Y1306 D V Janardhan Rao – Y
+ Mayukha Bairy Disk Intersection graphs and CDS as a backbone in wireless ad hoc networks.
Andreas Larsson, Philippas Tsigas SIROCCO Self-stabilizing (k,r)-Clustering in Clock Rate-limited Systems.
Jonathan Walpole CSE515 - Distributed Computing Systems 1 Teaching Assistant for CSE515 Rahul Dubey.
Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications Xiaozhou Li COS 461: Computer Networks (precept 04/06/12) Princeton University.
PSI Peer Search Infrastructure. Introduction What are P2P Networks? The term "peer-to-peer" refers to a class of systems and applications that employ.
A Scalable Content-Addressable Network (CAN) Seminar “Peer-to-peer Information Systems” Speaker Vladimir Eske Advisor Dr. Ralf Schenkel November 2003.
Enabling Peer-to-Peer SDP in an Agent Environment University of Maryland Baltimore County USA.
Multiprossesors Systems.. What are Distributed Databases ? “ A Logically interrelated collection of shared data ( and a description of this data) physically.
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.
Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications.
1 Secure Peer-to-Peer File Sharing Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, Hari Balakrishnan MIT Laboratory.
LightFlood: An Efficient Flooding Scheme for File Search in Unstructured P2P Systems Song Jiang, Lei Guo, and Xiaodong Zhang College of William and Mary.
Peer to Peer Network Design Discovery and Routing algorithms
Distributed Computing Systems CSCI 4780/6780. Scalability ConceptExample Centralized servicesA single server for all users Centralized dataA single on-line.
Algorithms and Techniques in Structured Scalable Peer-to-Peer Networks
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.
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.
Malugo – a scalable peer-to-peer storage system..
Advanced Computer Networks: Part 2 Complex Networks, P2P Networks and Swarm Intelligence on Graphs.
Topologies and behavioral properties of the network Yvon Kermarrec Based on tml.
Self-service, with applications to distributed classifier construction Michael K. Reiter and Asad Samar April 27, 2006 Properties & Related Work Self-Service.
Network Topologies for Scalable Multi-User Virtual Environments Lingrui Liang.
Composing Web Services and P2P Infrastructure. PRESENTATION FLOW Related Works Paper Idea Our Project Infrastructure.
The Biologically Inspired Distributed File System: An Emergent Thinker Instantiation Presented by Dr. Ying Lu.
Peer-to-Peer Information Systems Week 12: Naming
Scaling Network Load Balancing Clusters
A Scalable Peer-to-peer Lookup Service for Internet Applications
Peer-to-Peer Data Management
CHAPTER 3 Architectures for Distributed Systems
PROGRAM STUDI TEKNIK INFORMATIKA FAKULTAS ILMU KOMPUTER
Plethora: Infrastructure and System Design
Early Measurements of a Cluster-based Architecture for P2P Systems
EE 122: Peer-to-Peer (P2P) Networks
DHT Routing Geometries and Chord
A Scalable content-addressable network
Towards Next Generation Panel at SAINT 2002
Student: Fang Hui Supervisor: Teo Yong Meng
The Globus Toolkit™: Information Services
Research Scopes in Complex Network
Peer-to-Peer Information Systems Week 6: Performance
Distributed Hash Tables
Dynamic Replica Placement for Scalable Content Delivery
Peer-to-Peer Information Systems Week 12: Naming
Presentation transcript:

Deterministic and Semantically Organized Network Topology HyperCuP – A Scalable and Ontology-Based Peer-to-Peer Infrastructure for Semantic Web Services Mario Schlosser1, Michael Sintek1,2, Stefan Decker1, Wolfgang Nejdl1,3 + Semantic Service Web Peer-to-Peer Networks Large network of service providers capable of instantiating high-level task descriptions in a distributed fashion Task description to be broadcasted among possibly interesting service providers Services classified by global service ontology Decentralized, real-time, immediate Best fit for dynamic service networks Evolution of current Gnutella-style (power-law) networks Poor scalability to large number of nodes Incomplete search without guarantees Long search times Vulnerable against malicious attacks Deterministic and Semantically Organized Network Topology Optimal broadcast on hypercube topology Hypercubes: A Deterministic P2P Topology Interesting topology properties Logarithmic diameter – bounded search times Vertex symmetry – load balancing over nodes Fault tolerance – protection against attacks Efficient search and broadcast algorithms Optimal broadcast, one message per peer Shortest path routing to any peer 1 Network Topology Distributed Topology Construction Properties Decentralized: No central servers, no super peers Message and time complexity: Logarithmic to number of peers in the network Self-healing: Recovery from node failures Algorithm Always implicitly maintain topology of next biggest hypercube in node connections Remaining nodes cover positions of departing nodes based on deterministic buffering scheme Arriving nodes are able to join via any peer in the network and take over position(s) in the hypercube Joining peer 2 Current covering scheme Storage and concept coordinates address peer: Storage coordinates {0,1,0}, concept coordinates {0,1,0} Topology Construction Current network topology Concept coordinates address sub-hypercube: Coordinates {0,1,0} denote support of concept B Ontology-based Network Shaping Concept-driven peer clustering Hypercube network is decomposed into concept clusters, containing peers associated with a particular combination of ontology concepts supported by those peers Concept clusters are sub-hypercubes of top hypercube Addressing scheme: Ontology concept coordinates represent logical conjunction of supported concepts, storage coordinates allow for multiple peers per cluster Algorithms Shortest-path routing on ontology coordinates Flooding optimal broadcast on storage coordinates to reach all peers in concept sub-hypercubes Restricted optimal broadcast on ontology coordinates and logic minimization to answer queries consisting of conjunctions and disjunctions of ontology concepts Scales to millions of peers while allowing for complex queries and providing search guarantees at optimal routing behavior 3 Ontology- Based Routing Service Ontology + is-a Example structuring ontology is-a B SellTickets A BuyTickets is-a C SellAirlineTickets P2P.SemanticWeb.org 1Stanford University, 2On leave from DFKI, Germany 3On leave from University of Hannover, Germany