1/18 Philipp Obreiter 1, Birgitta König-Ries 2, Georgios Papadopoulos 1 Engineering Incentive Schemes for Ad Hoc.

Slides:



Advertisements
Similar presentations
An Alternative to Short Lived Certificates By Vipul Goyal Department of Computer Science & Engineering Institute of Technology Banaras Hindu University.
Advertisements

1 ICS-FORTH Dimitris Plexousakis, Pisa, February 2001 The CYCLADES Mediator Service Dimitris Plexousakis Computer Science Department, University.
Research Issues in Web Services CS 4244 Lecture Zaki Malik Department of Computer Science Virginia Tech
FIPA Interaction Protocol. Request Interaction Protocol Summary –Request Interaction Protocol allows one agent to request another to perform some action.
Conceptual Framework for Dynamic Trust Monitoring and Prediction Olufunmilola Onolaja Rami Bahsoon Georgios Theodoropoulos School of Computer Science The.
Peer-to-Peer Systems Chapter 25. What is Peer-to-Peer (P2P)? Napster? Gnutella? Most people think of P2P as music sharing.
Some questions o What are the appropriate control philosophies for Complex Manufacturing systems? Why????Holonic Manufacturing system o Is Object -Oriented.
Incentive Based Routing Protocols In Ad Hoc Networks Vinay Shah CSE 620.
1/19 DIANE Project Philipp Obreiter, Birgitta König-Ries, Michael Klein Stimulating Cooperative Behavior of Autonomous.
On the Economics of P2P Systems Speaker Coby Fernandess.
PROVIDING ROBUST AND UBIQUITOUS SECURITY SUPPORT FOR MOBILE AD- HOC NETWORKS Georgios Georgiadis 6/5/2008.
Samsara: Honor Among Thieves in Peer-to-Peer Storage Landon P. Cox and Brian D. Noble University of Michigan.
TrustMe: Anonymous Management of Trust Relationships in Decentralized P2P Systems Aameek Singh and Ling Liu Presented by: Korporn Panyim.
Experience with an Object Reputation System for Peer-to-Peer File Sharing NSDI’06(3th USENIX Symposium on Networked Systems Design & Implementation) Kevin.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Some contributions to the management of data in grids Lionel Brunie National Institute of Applied Science (INSA) LIRIS Laboratory/DRIM Team – UMR CNRS.
Small-world Overlay P2P Network
Cooperative Brokerage Integration for Transaction Capacity Sharing: A Case Study in Hong Kong Dickson K. W. CHIU Senior Member, IEEE Dickson Computer Systems.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Open Problems in Data- Sharing Peer-to-Peer Systems Neil Daswani, Hector Garcia-Molina, Beverly Yang.
Peer-to-peer archival data trading Brian Cooper Joint work with Hector Garcia-Molina (and others) Stanford University.
1/12 Project DIANE: Project KRASH: A Taxonomy of Incentive Patterns - The Design.
The Buddy System : A Distributed Reputation System Based on Social Structure Universität Karlsruhe Stefan Fähnrich 1, Philipp Obreiter 1, Birgitta König-Ries.
Dept. of Computer Science & Engineering, CUHK1 Trust- and Clustering-Based Authentication Services in Mobile Ad Hoc Networks Edith Ngai and Michael R.
Mitigating routing misbehavior in ad hoc networks Mary Baker Departments of Computer Science and.
1/16 DIANE Project Philipp Obreiter, Michael Klein Vertical Integration of Incentives for Cooperation Universität.
A Trust Based Assess Control Framework for P2P File-Sharing System Speaker : Jia-Hui Huang Adviser : Kai-Wei Ke Date : 2004 / 3 / 15.
First Year Talk: Self-Enforcing Automatic Rational Contracts between Computers Brian Shand Supervisor: Dr Jean Bacon.
Improving Robustness in Distributed Systems Jeremy Russell Software Engineering Honours Project.
An Authentication Service Against Dishonest Users in Mobile Ad Hoc Networks Edith Ngai, Michael R. Lyu, and Roland T. Chin IEEE Aerospace Conference, Big.
Kemal AkkayaWireless & Network Security 1 Department of Computer Science Southern Illinois University Carbondale CS 591 – Wireless & Network Security Lecture.
RETSINA: A Distributed Multi-Agent Infrastructure for Information Gathering and Decision Support The Robotics Institute Carnegie Mellon University PI:
1 --Ioana Nistoreanu-- Betreuer: Philipp Obreiter Transaction protocols in self organizing systems Projektarbeit :
An Agent-Oriented Approach to the Integration of Information Sources Michael Christoffel Institute for Program Structures and Data Organization, University.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
1 Michael Klein et al., Universität Karlsruhe, Germany Stepwise Refinable Service Descriptions: Adapting DAML-S to Staged Service Trading 1st International.
E-Government Security and necessary Infrastructures Dimitrios Lekkas Dept. of Systems and Products Design Engineering University of the Aegean
A Framework for Cost-Effective Peer-to- Peer Content Distribution Mohamed Hefeeda and Bharat Bhargava Department of Computer Sciences Purdue University.
1/16 DIANE Project Philipp Obreiter A Case for Evidence-Aware Distributed Reputation Systems Overcoming the Limitations.
Peer-to-peer archival data trading Brian Cooper and Hector Garcia-Molina Stanford University.
Chapter 8 Web Security.
Peer-to-peer file-sharing over mobile ad hoc networks Gang Ding and Bharat Bhargava Department of Computer Sciences Purdue University Pervasive Computing.
Pay As You Go – Associating Costs with Jini Leases By: Peer Hasselmeyer and Markus Schumacher Presented By: Nathan Balon.
Chris Olston, cs294-7, Spring Atomicity in Electronic Commerce J. D. Tygar -- UCB presented by Chris Olston.
MOBILE AD-HOC NETWORK(MANET) SECURITY VAMSI KRISHNA KANURI NAGA SWETHA DASARI RESHMA ARAVAPALLI.
Ad Hoc Networks Curtis Bolser Miguel Turner Kiel Murray.
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.
04/18/2005Yan Huang - CSCI5330 Database Implementation – Distributed Database Systems Distributed Database Systems.
Slide 1 Estimating Performance Below the National Level Applying Simulation Methods to TIMSS Fourth Annual IES Research Conference Dan Sherman, Ph.D. American.
Cryptography and Network Security (CS435) Part Fourteen (Web Security)
Cracow Grid Workshop, October 27 – 29, 2003 Institute of Computer Science AGH Design of Distributed Grid Workflow Composition System Marian Bubak, Tomasz.
Trust- and Clustering-Based Authentication Service in Mobile Ad Hoc Networks Presented by Edith Ngai 28 October 2003.
Objectives Functionalities and services Architecture and software technologies Potential Applications –Link to research problems.
Peer-to-Peer Network Tzu-Wei Kuo. Outline What is Peer-to-Peer(P2P)? P2P Architecture Applications Advantages and Weaknesses Security Controversy.
Peer-to-Peer and Collective Intelligence A platform for collaboration Andrew Roczniak Collective Intelligence Lab Multimedia Communications Research Lab.
Freenet “…an adaptive peer-to-peer network application that permits the publication, replication, and retrieval of data while protecting the anonymity.
Plethora: Infrastructure and System Design. Introduction Peer-to-Peer (P2P) networks: –Self-organizing distributed systems –Nodes receive and provide.
Local Distributed Agent Matchmaking Elth Ogston and Stamatis Vassiliadis Computer Engineering Laboratory TU Delft.
A Security Framework with Trust Management for Sensor Networks Zhiying Yao, Daeyoung Kim, Insun Lee Information and Communication University (ICU) Kiyoung.
Daniel A. G. Manzato and Nelson L. S. da Fonseca Institute of Computing, State University of Campinas Campinas, Brazil speaker: 吳麟佑.
Computer Science and Engineering 1 Mobile Computing and Security.
1/8 Project DIANE: How Social Structure Improves Distributed Reputation Systems Three Hypotheses Universität Karlsruhe.
School of Electrical Engineering &Telecommunications UNSW Cost-effective Broadcast for Fully Decentralized Peer-to-peer Networks Marius Portmann & Aruna.
Fall 2006CS 395: Computer Security1 Key Management.
An Evolutional Cooperative Computation Based on Adaptation to Environment Naoyasu UBAYASHI and Tetsuo TAMAI Graduate School of Arts and Sciences University.
Delegation of Intent via Conversation David E. Ellis.
Data Management on Opportunistic Grids
Giannis F. Marias, Vassileios Tsetsos,
Paraskevi Raftopoulou, Euripides G.M. Petrakis
Interdisciplinary Program in Cognitive Science Lee, Jung-Woo
Presentation transcript:

1/18 Philipp Obreiter 1, Birgitta König-Ries 2, Georgios Papadopoulos 1 Engineering Incentive Schemes for Ad Hoc Networks A Case Study for the Lanes Overlay 1 Universität Karlsruhe Institute for Program Structures and Data Organization Universität Karlsruhe GERMANY The First International Workshop on Pervasive Information Management March 18, 2004 – Heraklion, Crete, Greece 2 Technische Universität München Faculty of Computer Science

2/18 Motivation and Case Study: Lanes Service Announcement Service Search any cast any cast Why should you store and forward service advertisements? Why should you forward service requests? Why should you match service requests and advertisements? Why should you refrain from lavishly searching services?

3/18 General Approach: Incentive Schemes Incentive Scheme: A distributed scheme that offers incentives for cooperation How to develop an incentive scheme?  The size of the design space is large  Existing incentive schemes for ad hoc networks  have been developed in an art-like manner  are virtually not reusable since they are  bound to specific cooperation protocols  monolithic  not evaluated according to comparable criteria  A systematic procedure is needed (Development of incentive schemes as an engineering discipline)

4/18 Overview Engineering Steps (exemplified for Lanes) 1.The Cooperation Protocol a.Analysis b.Adjustment 2.Choice of Appropriate Incentives a.Definition of Commitments b.Incentives for Entering into Them c.Incentives for Adhering to Them 3.Evaluation of the Incentive Scheme a.Objective and Key Quantities b.Simulation Parameters

5/ The Cooperation Protocol: Analysis (1) Evaluation Choice of Incentives Cooperation Protocol Cooperation Protocol 1. Kinds of Cooperation: What kinds of inter-entity cooperation exist? any cast any cast (a) Service Advertisement Protocol (c) Intra-lane Maintenance Protocol (d) Inter-lane Maintenance Protocol (b) Service Search Protocol

6/18 The Cooperation Protocol: Analysis (2) Evaluation Choice of Incentives Cooperation Protocol Cooperation Protocol 2. Non-beneficial Steps: Which steps of the cooperation protocol are not beneficial? (a) Service Announcement:  Storing and forwarding announcements (b) Service Search:  Matching and forwarding searches (d) Inter-lance Maintenance:  Participating in split/merge of lanes (c) Intra-lane Maintenance:  Admitting newcomers, sending status information

7/18 The Cooperation Protocol: Analysis (3) Evaluation Choice of Incentives Cooperation Protocol Cooperation Protocol 3. Perceptibility of Misbehavior: Is behavior perceptible? If yes, how reliable is such perceptibility? (a) Service Announcement:  Storing and forwarding announcements (b) Service Search:  Matching and forwarding searches (d) Inter-lance Maintenance:  Participating in split/merge of lanes (c) Intra-lane Maintenance:  Admitting newcomers, sending status information partially no partially no partially no partially

8/18 The Cooperation Protocol: Adjustment (1) Evaluation Choice of Incentives Cooperation Protocol Cooperation Protocol Omission of non-beneficial protocol steps  impossible in Lanes Application of perception mechanisms  digital signatures  assert non-repudiability  Lanes: appended to service advertisements/requests  redundancy  invasive adjustment of the protocol, e.g., receipts  Lanes: receipts for partially perceptible behavior  overhearing  probing

9/18 The Cooperation Protocol: Adjustment (2) Evaluation Choice of Incentives Cooperation Protocol Cooperation Protocol Lane 1Lane 2Lane 3 Searching Entity (SE)Matching Entity 1 (ME1) verifies signature matching unsuccessful verifies signature matching successful signs search message signs receipt signs response verifies signature Matching Entity 2 (ME2)

10/18 Choice of Appropriate Incentives (1) Evaluation Choice of Incentives Cooperation Protocol Choice of Incentives 1. Definition of Commitments: Is failure to execute a non-beneficial step punished?  requires perceptibility of such failure  Lanes: failure to forward is perceptible and should be punished  Incentives for Adhering to Commitments Is the execution of a non-beneficial step remunerated?  only requires perceptibility of successful execution  Lanes: successful matching should be remunerated since it implies  storage of the service advertisement  processing of the service search  Incentives for Entering into Commitments

11/18 Choice of Appropriate Incentives (2) Evaluation Choice of Incentives Cooperation Protocol Choice of Incentives 2. Incentives for Entering into Commitments Incentive Pattern Properties trust basedtrade based collective pattern community pattern barter trade bond based patterns (e.g., note pattern) Rolesasymmetricsymmetricasymmetric Remuneration type none reputation service in return note Enforcement of remuneration −+o Overheadsmallmediumsmallhigh Scalability− −+o Philipp Obreiter, Jens Nimis A Taxonomy of Incentive Patterns - The Design Space of Incentives for Cooperation 2nd Workshop on Agents and Peer-to-Peer Computing (AP2PC'03), Melbourne most appropriate for matching

12/18 Choice of Appropriate Incentives (3) Evaluation Choice of Incentives Cooperation Protocol Choice of Incentives 3. Adhering to Commitments: Exchange Protocols  couple degree of adherence of mutual commitments  Lanes: number of outstanding notes (note credit) is limited Distributed Reputation Systems  provide a means for punishment by keeping track of the trustworthiness of an entity  Lanes: application of the Buddy System

13/18 Choice of Appropriate Incentives (4): Example Evaluation Choice of Incentives Cooperation Protocol Choice of Incentives checks SE‘s note credit Lane 1Lane 2Lane 3 Searching Entity (SE)Matching Entity 1 (ME1) verifies signature queries SE‘s reputation matching unsuccessful verifies signature queries SE‘s reputation matching successful signs search message signs receipt signs response adjusts trust in ME2 verifies signature issues note adjusts trust in SE adjusts trust in ME1 adjust trust in ME1/2 Matching Entity 2 (ME2) checks SE‘s note credit

14/18 Evaluation of the Incentive Scheme (1) Evaluation Choice of Incentives Cooperation Protocol Evaluation Objective of the Evaluation  fairness: high correlation of individual costs/utility  an entity must cooperate if it wants to profit Modelling of the Entities’ Behavior  altruists always cooperate, uncooperative entities never cooperate  cooperative entities: cooperate if peer trustworthy  definition of the note credit Simulation Parameters  cooperation protocol  the original Lanes protocol versus the engineered S-Lanes protocol  simulation environment  composition of the population and number of cooperations Key Quantities  coefficient of correlation between individual costs/utility  slope b of the regression line

15/18 Evaluation of the Incentive Scheme (2) Evaluation Choice of Incentives Cooperation Protocol Evaluation 10 notes credit 4400 searches 15 cooperative entities 5 uncooperative entities Key Quantities  coefficient of correlation: 0.69  slope b of the regression line: 0.54 Key Quantities  coefficient of correlation: -0.21

16/18 Evaluation of the Incentive Scheme (3) Evaluation Choice of Incentives Cooperation Protocol Evaluation 4400 searches 10 coop. 10 uncoop. 10 note credit 4400 searches 10 note credit 10 coop. 10 uncoop.  S-Lanes guarantees fairness for different parameterizations

17/18 Related Work Incentive Engineering:  A systematic procedure for the engineering of appropriate incentives in economics  Inappropriate for the development of incentive schemes in ad hoc networks 1.Adjustment of the cooperation protocol is not considered 2.The choice of incentives  assumes adherence to commitments  assumes “perfect” incentive pattern  is exogenous (which contradicts autonomy) 3.Analytical approach, hence evaluation unsupported

18/18 Summary and Future Work Summary  autonomous entities require incentives in order to stick to the cooperation protocol,  incentive schemes are difficult to develop,  we propose a systematic procedure for their engineering:  analysis and adjustment of the cooperation protocol,  choice of incentives for  entering into commitments: incentive patterns  adherence: exchange protocols, reputation systems  evaluation with multi-variant simulation Future Work  engineering of incentive schemes for other cooperation protocols,  better guidance for the choice of exchange protocols and reputation systems