FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2150084018> ?p ?o ?g. }

• W2150084018 abstract "The Peer-to-Peer network paradigm is drawing the attention of both final usersand researchers for its features. P2P networks shift from the classic client-serverapproach to a high level of decentralization where there is no central control andall the nodes should be able not only to require services, but to provide them toother peers as well. While on one hand such high level of decentralization mightlead to interesting properties like scalability and fault tolerance, on the other handit implies many new problems to deal with.A key feature of many P2P systems is openness, meaning that everybody ispotentially able to join a network with no need for subscription or payment systems.The combination of openness and lack of central control makes it feasible for a userto free-ride, that is to increase its own benefit by using services without allocatingresources to satisfy other peers’ requests. One of the main goals when designinga P2P system is therefore to achieve cooperation between users. Given the natureof P2P systems based on simple local interactions of many peers having partialknowledge of the whole system, an interesting way to achieve desired properties ona system scale might consist in obtaining them as emergent properties of the manyinteractions occurring at local node level.Two methods are typically used to face the problem of cooperation in P2P networks:1) engineering emergent properties when designing the protocol; 2) studythe system as a game and apply Game Theory techniques, especially to find NashEquilibria in the game and to reach them making the system stable against possibledeviant behaviors. In this work we present an evolutionary framework to enforcecooperative behaviour in P2P networks that is alternative to both the methodsmentioned above. Our approach is based on an evolutionary algorithm inspired bycomputational sociology and evolutionary game theory, consisting in having eachpeer periodically trying to copy another peer which is performing better.The proposed algorithms, called SLAC and SLACER, draw inspiration from tagsystems originated in computational sociology, the main idea behind the algorithmconsists in having low performance nodes copying high performance ones. Thealgorithm is run locally by every node and leads to an evolution of the network bothfrom the topology and from the nodes’ strategy point of view. Initial tests with asimple Prisoners’ Dilemma application show how SLAC is able to bring the networkto a state of high cooperation independently from the initial network conditions.Interesting results are obtained when studying the effect of cheating nodes onSLAC algorithm. In fact in some cases selfish nodes rationally exploiting the systemfor their own benefit can actually improve system performance from the cooperationformation point of view.The final step is to apply our results to more realistic scenarios. We put ourefforts in studying and improving the BitTorrent protocol. BitTorrent was chosennot only for its popularity but because it has many points in common with SLAC andSLACER algorithms, ranging from the game theoretical inspiration (tit-for-tat-likemechanism) to the swarms topology.We discovered fairness, meant as ratio between uploaded and downloaded data,to be a weakness of the original BitTorrent protocol and we drew inspiration from theknowledge of cooperation formation and maintenance mechanism derived from thedevelopment and analysis of SLAC and SLACER, to improve fairness and tackle freeridingand cheating in BitTorrent. We produced an extension of BitTorrent calledBitFair that has been evaluated through simulation and has shown the abilities ofenforcing fairness and tackling free-riding and cheating nodes." @default.
• W2150084018 created "2016-06-24" @default.
• W2150084018 creator A5077283425 @default.
• W2150084018 date "2008-04-28" @default.
• W2150084018 modified "2023-09-27" @default.
• W2150084018 title "Evolutionary methods for self-organizing cooperation in peer-to-peer networks" @default.
• W2150084018 cites W125948722 @default.
• W2150084018 cites W1494181753 @default.
• W2150084018 cites W1501752725 @default.
• W2150084018 cites W1513557409 @default.
• W2150084018 cites W1520914943 @default.
• W2150084018 cites W1523200180 @default.
• W2150084018 cites W1582877588 @default.
• W2150084018 cites W1659842140 @default.
• W2150084018 cites W1967829443 @default.
• W2150084018 cites W1977578104 @default.
• W2150084018 cites W1980096296 @default.
• W2150084018 cites W1990892118 @default.
• W2150084018 cites W1992169270 @default.
• W2150084018 cites W1994673994 @default.
• W2150084018 cites W1994680605 @default.
• W2150084018 cites W2009481751 @default.
• W2150084018 cites W2012634103 @default.
• W2150084018 cites W2014426346 @default.
• W2150084018 cites W2020183851 @default.
• W2150084018 cites W2020507987 @default.
• W2150084018 cites W2021331014 @default.
• W2150084018 cites W2035128111 @default.
• W2150084018 cites W2036027002 @default.
• W2150084018 cites W2040301417 @default.
• W2150084018 cites W2054054964 @default.
• W2150084018 cites W2056990020 @default.
• W2150084018 cites W2062663664 @default.
• W2150084018 cites W2066636486 @default.
• W2150084018 cites W2067050450 @default.
• W2150084018 cites W2071793248 @default.
• W2150084018 cites W2097280910 @default.
• W2150084018 cites W2097452701 @default.
• W2150084018 cites W2097681874 @default.
• W2150084018 cites W2098189907 @default.
• W2150084018 cites W2100642498 @default.
• W2150084018 cites W2101890615 @default.
• W2150084018 cites W2105096404 @default.
• W2150084018 cites W2109076767 @default.
• W2150084018 cites W2111600644 @default.
• W2150084018 cites W2112090702 @default.
• W2150084018 cites W2113429352 @default.
• W2150084018 cites W2114360400 @default.
• W2150084018 cites W2118428193 @default.
• W2150084018 cites W2119245106 @default.
• W2150084018 cites W2123820820 @default.
• W2150084018 cites W2124990234 @default.
• W2150084018 cites W2126996160 @default.
• W2150084018 cites W2127494222 @default.
• W2150084018 cites W2128060919 @default.
• W2150084018 cites W2138830906 @default.
• W2150084018 cites W2141299790 @default.
• W2150084018 cites W2142927219 @default.
• W2150084018 cites W2144381381 @default.
• W2150084018 cites W2147491767 @default.
• W2150084018 cites W2148042433 @default.
• W2150084018 cites W2151107368 @default.
• W2150084018 cites W2152910510 @default.
• W2150084018 cites W2156523427 @default.
• W2150084018 cites W2162733677 @default.
• W2150084018 cites W2163059190 @default.
• W2150084018 cites W2166263646 @default.
• W2150084018 cites W2167898414 @default.
• W2150084018 cites W2169253990 @default.
• W2150084018 cites W2170325731 @default.
• W2150084018 cites W2171957559 @default.
• W2150084018 cites W2178270886 @default.
• W2150084018 cites W2296427920 @default.
• W2150084018 cites W239964209 @default.
• W2150084018 cites W2400709559 @default.
• W2150084018 cites W2500523540 @default.
• W2150084018 cites W2753514269 @default.
• W2150084018 cites W2799817539 @default.
• W2150084018 cites W2138732318 @default.
• W2150084018 cites W2977721004 @default.
• W2150084018 hasPublicationYear "2008" @default.
• W2150084018 type Work @default.
• W2150084018 sameAs 2150084018 @default.
• W2150084018 citedByCount "1" @default.
• W2150084018 crossrefType "dissertation" @default.
• W2150084018 hasAuthorship W2150084018A5077283425 @default.
• W2150084018 hasConcept C111472728 @default.
• W2150084018 hasConcept C120314980 @default.
• W2150084018 hasConcept C127413603 @default.
• W2150084018 hasConcept C136810230 @default.
• W2150084018 hasConcept C138885662 @default.
• W2150084018 hasConcept C142724271 @default.
• W2150084018 hasConcept C15744967 @default.
• W2150084018 hasConcept C17744445 @default.
• W2150084018 hasConcept C199539241 @default.
• W2150084018 hasConcept C204787440 @default.
• W2150084018 hasConcept C2780385302 @default.
• W2150084018 hasConcept C2780586882 @default.
• W2150084018 hasConcept C41008148 @default.
• W2150084018 hasConcept C48044578 @default.

• next