Give-and-take based peer-to-peer content distribution networks

DOI10.1007/S12046-014-0266-1zbMath1339.68014OpenAlexW2086065627MaRDI QIDQ301622

Joy Kuri, Saurabh Aggarwal, Chandan Saha

Publication date: 1 July 2016

Published in: Sādhanā (Search for Journal in Brave)

Full work available at URL: https://www.ias.ac.in/describe/article/sadh/039/04/0843-0858

zbMATH Keywords

peer-to-peer networks

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Network design and communication in computer systems (68M10) Distributed systems (68M14)

Cites Work

• Counteracting free riding in Peer-to-Peer networks
• Algorithmic construction of sets for k -restrictions
• A threshold of ln n for approximating set cover
• A Greedy Heuristic for the Set-Covering Problem
• Algorithms for the set covering problem

This page was built for publication: Give-and-take based peer-to-peer content distribution networks