2015 IEEE 35th International Conference on Distributed Computing Systems 2015
DOI: 10.1109/icdcs.2015.25
|View full text |Cite
|
Sign up to set email alerts
|

T-Chain: A General Incentive Scheme for Cooperative Computing

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
20
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
4
3
2

Relationship

0
9

Authors

Journals

citations
Cited by 14 publications
(20 citation statements)
references
References 21 publications
0
20
0
Order By: Relevance
“…Existing schemes to prevent free-riders (who try to enjoy benefits of the good/service without contributing to it) mainly focus on node behavior modeling [53], cryptographic mechanism [115], contribution certification [116], and blockchain [117]. For example, Li et al [53] design a fluid model for non-freeriders and free-riders in peer-to-peer (P2P) file sharing systems to capture free-riding effects in designing optimal bandwidth allocation strategies.…”
Section: E Open and Decentralized Creator Economymentioning
confidence: 99%
“…Existing schemes to prevent free-riders (who try to enjoy benefits of the good/service without contributing to it) mainly focus on node behavior modeling [53], cryptographic mechanism [115], contribution certification [116], and blockchain [117]. For example, Li et al [53] design a fluid model for non-freeriders and free-riders in peer-to-peer (P2P) file sharing systems to capture free-riding effects in designing optimal bandwidth allocation strategies.…”
Section: E Open and Decentralized Creator Economymentioning
confidence: 99%
“…For example, Li et al [53] design a fluid model for non-freeriders and free-riders in peer-to-peer (P2P) file sharing systems to capture free-riding effects in designing optimal bandwidth allocation strategies. Based on symmetric key cryptography, Shin et al [115] design a lightweight and almost-fair exchange algorithm to prevent free-riders under cooperative computing scenarios. Ma et al [116] propose a differentiated service framework with free-rider prevention in P2P networks, where the differentiation is based on prior contribution levels of individuals.…”
Section: E Open and Decentralized Creator Economymentioning
confidence: 99%
“…Caching Optimization. There is considerable recent literature on a variety of caching optimization problems, including proactive caching [21,22], optimal caching under queuing models [23,24], optimal caching under unknown content popularities [25,26], distributed adaptive algorithms for optimal caching [8][9][10]27], caching at the edges [28][29][30][31][32], TTL (timeto-live) caches [33,34], optimal caching in evolving networks [35], joint caching and routing optimization [36][37][38], optimal cache partitioning [39], and collaborative caching [40][41][42][43][44][45]. All the above work assumes that all cache nodes aim to maximize the social welfare.…”
Section: Related Workmentioning
confidence: 99%