Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Anna Satsiou

dblp:96/1250 · DBLP profile ↗
← Back
6ranked-venue papers
6as first author
0since 2021 · last 2011
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 4 · 4 first-authorSystems, architecture and hardware · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Network optimization and economics · 91% Content delivery and video streaming · 9%

Topics — the 3 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Network optimization and economics
cooperation stimulation
0.112010
Reputation-Based Resource Allocation in P2P Systems of Rational Users · IEEE Trans. Parallel Distributed Syst. 2010
Network optimization and economics › mechanism design
incentive mechanism
0.112010
Reputation-Based Resource Allocation in P2P Systems of Rational Users · IEEE Trans. Parallel Distributed Syst. 2010
Content delivery and video streaming
peer-to-peer file sharing
0.012010
Reputation-Based Resource Allocation in P2P Systems of Rational Users · IEEE Trans. Parallel Distributed Syst. 2010

Methods — techniques the papers use, named apart from their topics

game-theoretic utility maximization · 0.1distributed reputation system · 0.1
YearPublicationVenuePosition
2011 Trust-based exchange of services to motivate cooperation in P2P networks
Anna Satsiou, Leandros Tassiulas
Peer-to-Peer Netw. Appl.1
2010 Reputation-Based Internet Sharing in Wireless Neighborhood Community Networks
abstract
This paper proposes easily applicable distributed reputation-based policies to motivate users of a wireless community to share their Internet connection in a p2p fashion. The goal is the provision of free and good quality Internet access anytime and anywhere inside the community. We study general systems of users with different contribution and consumption profiles and show via an extensive simulation study that when our reputation-based allocation scheme is applied, mobile users enjoy a QoS Internet connection from their community in proportion to their cooperation level; the more greedy for community resources users are, the more contributive they should be to satisfy their needs.
Anna Satsiou, Leandros Tassiulas
ICC1
2010 Reputation-Based Resource Allocation in P2P Systems of Rational Users
abstract
In this paper, we study p2p systems, where peers have to share their available resources between their own and other peers' needs. One such example is a system of peers who use their capacity-limited access links both for their upstream and downstream connections. In the selfish approach, each peer would like to exploit the full capacity of his access link only for his downloads. However, if all peers acted selfishly, the system would collapse. In order to motivate peers to cooperate, we propose a distributed reputation-based system according to which peers earn reputation analogous to their contributions. In this way, each peer has to trade off the capacity he will dedicate for uploading in order to increase his reputation and therefore his revenue and the capacity he will dedicate for his downloads. All peers act rationally, trying to maximize their utility. Our proposed policies lead rational peers to cooperation while promoting fairness, as peers receive resources in proportion to their contributions. Our policies outperform existing work in this area in which the slowest link becomes the bottleneck of a heterogeneous system of different link capacity peers. On the contrary, no such bottleneck appears when our policies are used, improving the performance of the system. Finally, we apply our reputation-based approach in a BitTorrent-like file sharing system and we highlight the potential performance gains.
Anna Satsiou, Leandros Tassiulas
IEEE Trans. Parallel Distributed Syst.1
2007 A Trust-Based Exchange Framework for Multiple Services in P2P Systems
Anna Satsiou, Leandros Tassiulas
Peer-to-Peer Computing1
2006 Frequency-based cache management policies for collaborative and non-collaborative topologies of segment based video caching proxies
Anna Satsiou, Michael Paterakis
Multim. Syst.1
2004 Impact of Frequency-Based Cache Management Policies on the Performance of Segment Based Video Caching Proxies
Anna Satsiou, Michael Paterakis
NETWORKING1