Sciweavers

Share
22 search results - page 1 / 5
» Designing incentives for peer-to-peer routing
Sort
View
GLOBECOM
2007
IEEE
9 years 2 months ago
Dynamic Multipath Onion Routing in Anonymous Peer-To-Peer Overlay Networks
— Although recent years provided many protocols for anonymous routing in overlay networks, they commonly rely on the same communication paradigm: Onion Routing. In Onion Routing ...
Olaf Landsiedel, Lexi Pimenidis, Klaus Wehrle, Hei...
SEBD
2008
206views Database» more  SEBD 2008»
8 years 9 months ago
Efficient and Effective Query Answering in a PDMS with SUNRISE
Abstract. Peer Data Management Systems (PDMSs) have been recently proposed as an evolution of Peer-To-Peer (P2P) systems toward a more semantics-based description of peers' co...
Federica Mandreoli, Riccardo Martoglia, Wilma Penz...
INFOCOM
2005
IEEE
9 years 2 months ago
Designing incentives for peer-to-peer routing
Abstract— In a peer-to-peer network, nodes are typically required to route packets for each other. This leads to a problem of “free-loaders,” nodes that use the network but r...
Alberto Blanc, Yi-Kai Liu, Amin Vahdat
INFOCOM
2006
IEEE
9 years 2 months ago
Using Repeated Games to Design Incentive-Based Routing Systems
Abstract— Incorporating pricing information in routing systems has been explored in various contexts and fashions. In this paper we examine certain fundamental properties importa...
Michael Afergan
WINE
2005
Springer
161views Economy» more  WINE 2005»
9 years 1 months ago
Design of Incentive Compatible Mechanisms for Stackelberg Problems
This paper takes the first steps towards designing incentive compatible mechanisms for hierarchical decision making problems involving selfish agents. We call these Stackelberg p...
Dinesh Garg, Yadati Narahari
books