Avoiding greediness in cooperative peer-to-peer networks

DOI10.1007/978-3-642-03354-4_27MaRDI QIDQ3407322zbMATHOpenAlexFDO

Authors Matthias R. Brust, Carlos H. C. Ribeiro, Jaruwan Mesit

Publication date 4 March 2010

Published in Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-03354-4_27

zbMATH Keywords

cooperationpeer-to-peer networkstopology control

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Recommendations

• A Network Formation Game Approach to Study BitTorrent Tit-for-Tat
• On the topologies formed by selfish peers
• Topological implications of selfish neighbor selection in unstructured peer-to-peer networks
• scientific article; zbMATH DE number 5061965
• scientific article; zbMATH DE number 2080497

Cites work

• scientific article; zbMATH DE number 1950482 (Why is no real title available?)
• Collective dynamics of `small-world' networks
• Random Geometric Graphs

Cited in

(2)

• scientific article; zbMATH DE number 2089339 (Why is no real title available?)
• Node and network resistance to bribery in multi-agent systems

This page was built for publication: Avoiding greediness in cooperative peer-to-peer networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3407322)