Filters








2,531 Hits in 3.9 sec

On the topologies formed by selfish peers

Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer
2006 Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing - PODC '06  
By giving tight bounds on the price of anarchy, we show that the resulting topologies can be much worse than if peers collaborated.  ...  However, the selfish behavior of peers has aspects which go beyond resource sharing. This paper studies the effects on the topology of a P2P network if peers selfishly select the peers to connect to.  ...  In order to evaluate the topologies constructed by selfish peersand compare them with the topologies achieved by collaborating peers-, we use the notion of a Nash equilibrium.  ... 
doi:10.1145/1146381.1146403 dblp:conf/podc/MoscibrodaSW06a fatcat:2hsqva6w7jaz5h6djofsosbwbq

Self-optimizing Peer-to-Peer Networks with Selfish Processes

Amlan Bhattacharya, Sukumar Ghosh
2007 First International Conference on Self-Adaptive and Self-Organizing Systems (SASO 2007)  
Request patterns in peer-to-peer networks are not uniform, and the cost of communication depends on the traffic flows among peers.  ...  Compared to this, the altruistic protocols that allow peers to adjust the routing tables based on the needs of other processes, promise a better performance.  ...  Moscibroda, Schmid and Wattenhofer [7] showed that P2P topologies formed by selfish peers under Fabrikant's cost model may not stabilize, even if there is no churn.  ... 
doi:10.1109/saso.2007.51 dblp:conf/saso/BhattacharyaG07 fatcat:k4355l36mnda7iyhotcwyl7omu

Stochastic Modelling of Selfish Mining in Proof-of-Work Protocols

Caspar Schwarz-Schilling, Sheng-Nan Li, Claudio J. Tessone
2022 Journal of Cybersecurity and Privacy  
network topology, (c) positioning of the selfish nodes within the peer to peer network.  ...  The protocol relies on the immediate broadcast of blocks by miners, to earn precedence in peers' local blockchains.  ...  Network Topologies Next, we consider the effect of varying network topologies on relative selfish revenue.  ... 
doi:10.3390/jcp2020016 fatcat:ppi65mxojzegvi47b6wsch5dti

A recall-based cluster formation game in peer-to-peer systems

Georgia Koloniari, Evaggelia Pitoura
2009 Proceedings of the VLDB Endowment  
Peers are guided either by selfish or altruistic motives: selfish peers aim at improving the recall of their own queries, whereas altruistic peers aim at improving the recall of the queries of other peers  ...  In many large-scale content sharing applications, participants or peers are grouped together forming clusters based on their content or interests.  ...  From Corollary 2, the only way a peer pi can change its strategy is by forming a cluster by its own. Case(I.b): Each peer forms a cluster by its own.  ... 
doi:10.14778/1687627.1687679 fatcat:bbarmeivl5c73lp22bjuqfrf4a

Topological Implications of Selfish Neighbor Selection in Unstructured Peer-to-Peer Networks

Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer
2010 Algorithmica  
By giving tight bounds on the price of anarchy, we show that the resulting topologies can be much worse than if peers collaborated.  ...  However, the selfish behavior of peers has aspects which go beyond resource sharing. This paper studies the effects on the topology of a P2P network if peers selfishly select the peers to connect to.  ...  In order to evaluate the topologies constructed by selfish peers-and compare them to the topologies achieved by collaborating peers-we use the notion of a Nash equilibrium.  ... 
doi:10.1007/s00453-010-9398-9 fatcat:26sz7yhcebag5cgcjj3oedpzwq

Swarming on Optimized Graphs for n-Way Broadcast

G. Smaragdakis, N. Laoutaris, P. Michiardi, A. Bestavros, J. W. Byers, M. Roussopoulos
2008 IEEE INFOCOM 2008 - The 27th Conference on Computer Communications  
We present the Max-Min and Max-Sum peer-selection policies used by individual nodes to select their neighbors.  ...  We design a swarming protocol suitable for n-way broadcast and operate it on top of overlay graphs formed by nodes that employ Max-Min or Max-Sum policies.  ...  On the Max-Min overlay the selfish node reduced its maximum upload finish time by 30% when it was the slowest one [23] .  ... 
doi:10.1109/infocom.2008.37 dblp:conf/infocom/SmaragdakisBLBMR08 fatcat:xlldxvjrszgy3paztip7rk6goe

Swarming on Optimized Graphs for n-Way Broadcast

G. Smaragdakis, N. Laoutaris, P. Michiardi, A. Bestavros, J. W. Byers, M. Roussopoulos
2008 2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications  
We present the Max-Min and Max-Sum peer-selection policies used by individual nodes to select their neighbors.  ...  We design a swarming protocol suitable for n-way broadcast and operate it on top of overlay graphs formed by nodes that employ Max-Min or Max-Sum policies.  ...  On the Max-Min overlay the selfish node reduced its maximum upload finish time by 30% when it was the slowest one [23] .  ... 
doi:10.1109/infocom.2007.37 fatcat:vlta55y6vrfqvl7mkltw3koaya

Enhanced Data Sharing over Mobile Ad Hoc Network Based on non-Selfish Exposure

Amrutha b k, Mr.I.Edwin Albert
2014 IOSR Journal of Computer Engineering  
Some nodes does not cooperate with each other nodes and termed as Selfish nodes. Selfish nodes are handled on the basis of replica allocation. Partial nodes are also handled.  ...  In a frequent time interval, replica allocation will perform based on the Self Centered Friendship tree of each node in order to avoid selfishness.  ...  Replica allocation is mainly done on the basis of Self centered friendship tree. SCF tree is constructed from the topology formed by the nodes in the MANET.  ... 
doi:10.9790/0661-16245865 fatcat:72ewj36cz5afrmepgw5pzckzra

Distributed Network Formation for n-Way Broadcast Applications

Georgios Smaragdakis, Nikolaos Laoutais, Pietro Michiardi, Azer Bestavros, John W. Byers, Mema Roussopoulos
2010 IEEE Transactions on Parallel and Distributed Systems  
We present the Max-Min and Max-Sum peer-selection policies used by individual nodes to select their neighbors.  ...  We design a swarming protocol suitable for n-way broadcast and operate it on top of overlay graphs formed by nodes that employ Max-Min or Max-Sum policies.  ...  Our optimized topologies are formed in a distributed fashion and are oblivious to the details of the swarming protocol that runs on top.  ... 
doi:10.1109/tpds.2010.23 fatcat:t7vgq2u6nfa3fcqg4igktvbpy4

Cyclic ranking in single-resource peer-to-peer exchange

Andrei Gurtov, Joakim Koskela, Dmitry Korzun
2017 Peer-to-Peer Networking and Applications  
The initial experiments show improved fairness and download times, compared to the original Bit-Torrent and FairTorrent. The performance of selfish and unstable peers decreases by as much as 50%.  ...  Our simulation model captures the dependence on network bandwidth and the number of seeders as well as selfishness and stability of the participants.  ...  improvement, increasing the completion times for selfish peers by 15..32%.  ... 
doi:10.1007/s12083-017-0578-0 fatcat:bxymcbiodbeubloj3xp6zsrjxi

Peer-to-peer overlay topology control for mobile ad hoc networks

Afzal Mawji, Hossam Hassanein, Xiangyang Zhang
2011 Pervasive and Mobile Computing  
In this paper, we study the construction of P2P overlays by selfish peers in the context of MANETs, and propose a computationally feasible game-theoretic heuristic algorithm.  ...  The enormous popularity of peer-to-peer (P2P) applications and the increased use of mobile devices make running P2P applications on mobile ad hoc networks (MANETs) natural.  ...  This work is supported by a grant from the Natural Sciences and Engineering Research Council of Canada (NSERC).  ... 
doi:10.1016/j.pmcj.2011.04.003 fatcat:ez2jqagaubfbnbsnupvmsvpjxy

Selfish Node Detection in Replica Allocation over MANETs

Kishore Kumar
2013 IOSR Journal of Computer Engineering  
These selfish nodes could then reduce the overall data accessibility in the network.  ...  In this paper, we examine the impact of selfish nodes in a mobile ad hoc network from the perspective of replica allocation. We term this selfish replica allocation.  ...  Although the work considers free riders to host data in mobile peer-to-peer networks, it assumes that all peers are trusted and they do not cheat.  ... 
doi:10.9790/0661-1350713 fatcat:prrk2bmhjrehvcbr36botv57x4

TTEM: An Effective Trust-Based Topology Evolution Mechanism for P2P Networks

Jianli Hu, Quanyuan Wu, Bin Zhou
2008 Journal of Communications  
Analysis and simulations show that, compared with the current topologies, the resulting topology mechanism demonstrates more effectiveness and robustness in combating the selfish or malicious behaviors  ...  Through this mechanism, trusted peers can migrate to the centric position, while untrusted peers to the edge of the topology, guaranteeing fairness during topology evolution.  ...  ACKNOWLEDGMENT The authors acknowledge the useful comments from the anonymous reviewers.  ... 
doi:10.4304/jcm.3.7.3-10 fatcat:4aoistewgraerkfpibady7n6x4

Selfish Caching and Facsimile Allocation over a Mobile Ad Hoc Network

2019 International Journal of Engineering and Advanced Technology  
The selfish vertices ought to then lessen the overall information approachability within the network.  ...  From this work, we try to take a look at the influence of selfish vertices in a mobile ad hoc community in terms of reproduction issuance i.e Selfish nodes are dealt with in replica allocation.  ...  For the benefit of other nodes, a selfish node might not proportion its own memory area to keep duplicate. [11] This can be erect standard peer-to-peer utility.  ... 
doi:10.35940/ijeat.f1377.0986s319 fatcat:v77m7t74wvhwpj5juy2477nti4

Ad Hoc Communication Topology Switching during Disasters from Altruistic to Individualistic and Back

Indushree Banerjee, Martijn Warnier, Frances Brazier
2020 Proceedings of the 5th International Conference on Complexity, Future Information Systems and Risk  
Which one is best for communication needs depends on the context.  ...  Alternative ad hoc communication networks form an adaptive energy-efficient network topology, that is most draining to batteries of phones that have a higher charge, while low-energy phones are spared  ...  To form a mobile ad hoc communication network (MANET) smartphones use their inbuilt WiFi or Bluetooth to connect with other devices in their proximity or transmission range to exchange messages in a peer-to-peer  ... 
doi:10.5220/0009434201030107 dblp:conf/complexis/BanerjeeWB20 fatcat:sk6gjoegdnhdrh6lqvonk7ylii
« Previous Showing results 1 — 15 out of 2,531 results