Enabling Peer-to-Peer SDP in an Agent Environment University of Maryland Baltimore County USA.

Slides:



Advertisements
Similar presentations
Web Service Ahmed Gamal Ahmed Nile University Bioinformatics Group
Advertisements

Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, Hari Balakrishnan MIT and Berkeley presented by Daniel Figueiredo Chord: A Scalable Peer-to-peer.
MCTS Guide to Microsoft Windows Server 2008 Network Infrastructure Configuration Chapter 6 Managing and Administering DNS in Windows Server 2008.
Massively Distributed Database Systems Distributed Hash Spring 2014 Ki-Joune Li Pusan National University.
An Overview of Peer-to-Peer Networking CPSC 441 (with thanks to Sami Rollins, UCSB)
Peer-to-Peer Networks as a Distribution and Publishing Model Jorn De Boever (june 14, 2007)
P2p, Spring 05 1 Topics in Database Systems: Data Management in Peer-to-Peer Systems March 29, 2005.
Internet Networking Spring 2006 Tutorial 12 Web Caching Protocols ICP, CARP.
Rheeve: A Plug-n-Play Peer- to-Peer Computing Platform Wang-kee Poon and Jiannong Cao Department of Computing, The Hong Kong Polytechnic University ICDCSW.
Cis e-commerce -- lecture #6: Content Distribution Networks and P2P (based on notes from Dr Peter McBurney © )
Scalable Application Layer Multicast Suman Banerjee Bobby Bhattacharjee Christopher Kommareddy ACM SIGCOMM Computer Communication Review, Proceedings of.
P2P as a Discovery Instrument for Multi-Agent Ubiquitous Middleware P2P as a Discovery Instrument for Multi-Agent Ubiquitous Middleware A work-package.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #13 Web Caching Protocols ICP, CARP.
Exploiting Content Localities for Efficient Search in P2P Systems Lei Guo 1 Song Jiang 2 Li Xiao 3 and Xiaodong Zhang 1 1 College of William and Mary,
presented by Hasan SÖZER1 Scalable P2P Search Daniel A. Menascé George Mason University.
A Distributed Search Service for Peer-to-Peer File Sharing in Mobile Application Presented by Tony Sung On Loy, MC Lab, CUHK IE 1 A Distributed Search.
Adaptive Web Caching Lixia Zhang, Sally Floyd, and Van Jacob-son. In the 2nd Web Caching Workshop, Boulder, Colorado, April 25, System Laboratory,
SensIT PI Meeting, April 17-20, Distributed Services for Self-Organizing Sensor Networks Alvin S. Lim Computer Science and Software Engineering.
1 Seminar: Information Management in the Web Gnutella, Freenet and more: an overview of file sharing architectures Thomas Zahn.
Improving Data Access in P2P Systems Karl Aberer and Magdalena Punceva Swiss Federal Institute of Technology Manfred Hauswirth and Roman Schmidt Technical.
Peer-to-Peer Networks Slides largely adopted from Ion Stoica’s lecture at UCB.
1CS 6401 Peer-to-Peer Networks Outline Overview Gnutella Structured Overlays BitTorrent.
P2P File Sharing Systems
Freenet. Anonymity  Napster, Gnutella, Kazaa do not provide anonymity  Users know who they are downloading from  Others know who sent a query  Freenet.
Peer-to-Peer Computing CS587x Lecture Department of Computer Science Iowa State University.
1 Napster & Gnutella An Overview. 2 About Napster Distributed application allowing users to search and exchange MP3 files. Written by Shawn Fanning in.
Introduction Widespread unstructured P2P network
Chapter 16 – DNS. DNS Domain Name Service This service allows client machines to resolve computer names (domain names) to IP addresses DNS works at the.
SensIT PI Meeting, January 15-17, Self-Organizing Sensor Networks: Efficient Distributed Mechanisms Alvin S. Lim Computer Science and Software Engineering.
1 Telematica di Base Applicazioni P2P. 2 The Peer-to-Peer System Architecture  peer-to-peer is a network architecture where computer resources and services.
HERO: Online Real-time Vehicle Tracking in Shanghai Xuejia Lu 11/17/2008.
An affinity-driven clustering approach for service discovery and composition for pervasive computing J. Gaber and M.Bakhouya Laboratoire SeT Université.
Jonathan Walpole CSE515 - Distributed Computing Systems 1 Teaching Assistant for CSE515 Rahul Dubey.
70-291: MCSE Guide to Managing a Microsoft Windows Server 2003 Network Chapter 6: Name Resolution.
70-291: MCSE Guide to Managing a Microsoft Windows Server 2003 Network, Enhanced Chapter 6: Name Resolution.
2: Application Layer1 Chapter 2 outline r 2.1 Principles of app layer protocols r 2.2 Web and HTTP r 2.3 FTP r 2.4 Electronic Mail r 2.5 DNS r 2.6 Socket.
Chord: A Scalable Peer-to-peer Lookup Protocol for Internet Applications Xiaozhou Li COS 461: Computer Networks (precept 04/06/12) Princeton University.
Peer-to-Pee Computing HP Technical Report Chin-Yi Tsai.
Network Computing Laboratory Scalable File Sharing System Using Distributed Hash Table Idea Proposal April 14, 2005 Presentation by Jaesun Han.
PSI Peer Search Infrastructure. Introduction What are P2P Networks? The term "peer-to-peer" refers to a class of systems and applications that employ.
1 Vigil : Enforcing Security in Ubiquitous Environments Authors : Lalana Kagal, Jeffrey Undercoffer, Anupam Joshi, Tim Finin Presented by : Amit Choudhri.
Super-peer Network. Motivation: Search in P2P Centralised (Napster) Flooding (Gnutella)  Essentially a breadth-first search using TTLs Distributed Hash.
The Start Shawn Fanning (19-yr-old student nicknamed Napster) developed the original Napster application and service in January 1999 while a freshman.
Adaptive Web Caching CS411 Dynamic Web-Based Systems Flying Pig Fei Teng/Long Zhao/Pallavi Shinde Computer Science Department.
INTERNET AND ADHOC SERVICE DISCOVERY BY: NEHA CHAUDHARY.
1 Peer-to-Peer Technologies Seminar by: Kunal Goswami (05IT6006) School of Information Technology Guided by: Prof. C.R.Mandal, School of Information Technology.
An Efficient Wireless Mesh Network A New Architecture 指導教授:許子衡 教授 學生:王志嘉.
Kemal Baykal Rasim Ismayilov
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
Peer to Peer Network Design Discovery and Routing algorithms
Providing web services to mobile users: The architecture design of an m-service portal Minder Chen - Dongsong Zhang - Lina Zhou Presented by: Juan M. Cubillos.
INTERNET TECHNOLOGIES Week 10 Peer to Peer Paradigm 1.
P2P Search COP P2P Search Techniques Centralized P2P systems  e.g. Napster, Decentralized & unstructured P2P systems  e.g. Gnutella.
09/13/04 CDA 6506 Network Architecture and Client/Server Computing Peer-to-Peer Computing and Content Distribution Networks by Zornitza Genova Prodanoff.
CMSC 691B Multi-Agent System A Scalable Architecture for Peer to Peer Agent by Naveen Srinivasan.
P2P Networking: Freenet Adriane Lau November 9, 2004 MIE456F.
Seminar On Rain Technology
Mobility With IP, implicit assumption that there is no mobility. Addresses -- network part, host part -- so routers determine how to get to correct network.
A Survey of Peer-to-Peer Content Distribution Technologies Stephanos Androutsellis-Theotokis and Diomidis Spinellis ACM Computing Surveys, December 2004.
CS 268: Lecture 22 (Peer-to-Peer Networks)
Self Healing and Dynamic Construction Framework:
Enterprise Application Architecture
Dipanjan Chakraborty Anupam Joshi CSEE University of Maryland Baltimore County Anamika: Distributed Service Discovery and Composition Architecture for.
Early Measurements of a Cluster-based Architecture for P2P Systems
CS 162: P2P Networks Computer Science Division
Windows Name Resolution
Mobile IP Neil Tang 11/12/2008 CS440 Computer Networks.
Presentation transcript:

Enabling Peer-to-Peer SDP in an Agent Environment University of Maryland Baltimore County USA

 Introduction  Related Work  Overcoming Limitation of exiting DF  Cluster Based Architecture  Exploiting the Cluster Based Architecture  Implementation  Conclusion

 Success Agents Paradigm Negotiation, Co-operation, Collaboration  Main Challenge - Discovery agents offering them as services  Existing Approach FIPA’s Directory Facilitator (DF) provides Yellow pages service Agents register their services to DF in the Agent Platform Agents in the Platform can query the DF for services and get back the results Limitation – Search is limited to a particular agent platform  Why Global resource discovery ? Increase in deployment of Agent Platform Inter-Platform communication possible because of FIPA’s Standardization  Two Approaches for Global resource discovery Centralized approach Distributed approach

 Centralized Approach Agents register their service to Central Repository ( Global Directory Facilitator) Agents can query the Global DF for services Advantage :– faster query response Disadvantage :– Updating changes in service availability are costly, High maintenance is required, single point of failure.  Distributed Approach Federation between DF Each DF forwards it service discovery query to other DF it federates with Advantage :– Less maintenance with respect to updating service changes Disadvantage :– Poor query response as the query has to propagate through the network.

 Sycara et al. “Discovery of infrastructure in multi-agents Systems” Agents form Gnutella Type distributed networks Gnutella was designed to preserve anonymity in the network  Sycara et al. “A taxonomy of middle agents for the internet” Special agents that provide service to locate the resources in the network Similar to the Centralized approach  Peer-to-Peer Systems Napster Gnutella

 Problem A :- Dynamic Environment Environment is very dynamic, Agents may enter and leave the network Changes incurred due these agents should be reflected in the global searches Solution :- In a centralized model excessive traffic near the central server to reflect these changed Distributed model is ideal for environment because the changes need not be propagated to a central server  Problem B :- Service Registration and De-registration Agents are responsible for service registration and de-registration Stale service registration information can be stored in Directory Facilitator Solution :- Leasing Mechanism :- Agent registers its service for certain time, it also has to renew its registration after the time period Directory Facilitator can deregister the agent’s service registration if the agent fails to renew

 Problem C :- Malicious Agents Directory Facilitator is not responsible for fake services being register Solution :- Reputation Mechanism – DF should be responsible hosting reputation mechanism Each agent after utilizing the service may send feedback to the DF of the agent which provided the service DF will compute the reputation based on the feedback DF will tag the reputation with the search results  Problem D :- Service Description Current Service Description is not sophisticated for inference Solution :- DAML S, initiative by semantic web community, provide core markups for describing services and their capabilities Example of simple inference – services which forms the composite services can also be registered individually

 Problem E :- Directory Facilitator Search Mechanism Current DF search mechanism is syntactic A global service description for each service provided is not possible A syntactic search would lead to poor search results Solution :- Directory Facilitator should implement semantic search mechanism

 Assumption We assume Directory Server where agent platforms register themselves After registration Directory Server doesn’t play any role in resource discovery  Startup A node (agent platform) on entering network registers itself to the Directory Server and gets addresses of other nodes in the network Contacts the nodes in the network and gets the Master address of these nodes Contacts the master nodes Based on the results the node either joins a clusters or starts its own cluster. Directory Server

 Query Routing A node in cluster queries the cluster head Cluster head apart from searching its own index forwards the query to know cluster head Other cluster head on receiving forwarded query searches its index and forwards the query Cluster heads forwards the results to the cluster head that originated query forwarding The cluster head that originated the query then forwards the results back to node that originated the query

 Cluster Maintenance Leader is in charge of updating cluster nodes if any node enter/leaves the network The reason for cluster maintenance is to help in the leader election  Leader Election Cluster nodes keep pinging the cluster head If (cluster head left the cluster) then Leader election process takes place among the cluster nodes New cluster head is selected and announces that it has replaced the previous cluster head

 Advantage of the cluster based architecture Flexible moving the nodes from one cluster to another  Hierarchy  Cluster Formation Clusters can be based network location to localize the traffic due to cluster maintenance and leader election Cluster node to be exchanged to from an idea cluster We can merging and splitting of cluster so that the cluster head works on optimal load One level to multiple level Top level nodes can act as Query Routers instead of hold the DF information

 Caching Caching of global results are not of any use in an one level architecture. Only the cluster head that started the query forwarding will have the results of global results of the query. If similar query is generated in the same cluster then the cluster head could return the cached results If the query is generated in other cluster then even if the cluster head has with global cache result forwards the global results, it is not going to stop the query being flooded in the network. However the caching will be useful in multi-level architecture

 The system was implemented using JADE Agent Platform  Directory Facilitator has been modified to federate between the other Directory Facilitator