FRINK Linked Data Fragments server

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

• W2796132685 abstract "Peer-to-peer (P2P) networks attract attentions worldwide with its great success in file sharing networks (such as Napster, Gnutella, Freenet, BitTorren, Kazaa, and JXTA). As a major design pattern for future systems opposite to the traditional client-server paradigm, research on P2P networks is extremely important and could possibly radically alter the way of day-to-day use of computer systems. Efficient resource discovery remains a fundamental problem for large-scale P2P networks. In contrast to P2P networks, people in social networks can directly contact some acquaintances that potentially have knowledge about the resources they are looking for. Similarly to social networks where people are connected by their social relationships, two autonomous peer nodes can be connected in unstructured P2P networks if users in those nodes are interested in each other's data. The similarity between P2P networks and social networks, where peer nodes can be considered as people and connections can be considered as relationships, leads us to believe that theories of social networks are useful for improving the performance of resource discovery in P2P networks. In this thesis, we present Small World Architecture for peer-to-peer Networks (SWAN) and Efficient Social-Like Peer-to-peer (ESLP) model for resource discovery in P2P networks by organising peer nodes into a social peer-to-peer network either intentionally or spontaneously. SWAN is first presented in this thesis. In SWAN, each node keeps a list of neighbouring nodes in the same peer group, and peer groups are connected by a small number of inter-group links. Not every peer node needs to be connected to remote groups, but every peer node can easily find out which peer nodes have external connections to a specific peer group in SWAN. However, similarly to previous community-based P2P file-sharing systems, SWAN is based on the same concept of clustering peer nodes intentionally into peer groups, which needs extra communication overhead to maintain a hierarchical group structure in a highly dynamic and distributed environment. Addressing this issue, an Efficient Social-Like Peer-to-peer (ESLP) model is presented in this thesis to self-organise autonomous peer nodes on unstructured P2P networks by mimicking different human behaviours in social networks. In the ESLP model, queries are preferentially forwarded to the peer nodes that are more likely to have the requested resources or potentially have the knowledge on whom has the requested resources. Unlike community-based P2P models, we do not intend to create and maintain peer groups or communities consciously. In contrast, each peer node connects to other peer nodes with the same interests spontaneously by the results of daily searches. ESLP has been simulated in a dynamic environment with a growing number of peer nodes. From the experimental results, ESLP achieves better performance than existing methods, such as NeuroGrid." @default.
• W2796132685 created "2018-04-13" @default.
• W2796132685 creator A5084733299 @default.
• W2796132685 date "2007-01-01" @default.
• W2796132685 modified "2023-09-26" @default.
• W2796132685 title "A social model for efficient resource discovery in peer-to-peer networks." @default.
• W2796132685 hasPublicationYear "2007" @default.
• W2796132685 type Work @default.
• W2796132685 sameAs 2796132685 @default.
• W2796132685 citedByCount "0" @default.
• W2796132685 crossrefType "dissertation" @default.
• W2796132685 hasAuthorship W2796132685A5084733299 @default.
• W2796132685 hasConcept C110875604 @default.
• W2796132685 hasConcept C120314980 @default.
• W2796132685 hasConcept C127413603 @default.
• W2796132685 hasConcept C136764020 @default.
• W2796132685 hasConcept C206345919 @default.
• W2796132685 hasConcept C2522767166 @default.
• W2796132685 hasConcept C31258907 @default.
• W2796132685 hasConcept C34947359 @default.
• W2796132685 hasConcept C36647736 @default.
• W2796132685 hasConcept C41008148 @default.
• W2796132685 hasConcept C4727928 @default.
• W2796132685 hasConcept C51332947 @default.
• W2796132685 hasConcept C518677369 @default.
• W2796132685 hasConcept C534932454 @default.
• W2796132685 hasConcept C551386961 @default.
• W2796132685 hasConcept C62611344 @default.
• W2796132685 hasConcept C66938386 @default.
• W2796132685 hasConceptScore W2796132685C110875604 @default.
• W2796132685 hasConceptScore W2796132685C120314980 @default.
• W2796132685 hasConceptScore W2796132685C127413603 @default.
• W2796132685 hasConceptScore W2796132685C136764020 @default.
• W2796132685 hasConceptScore W2796132685C206345919 @default.
• W2796132685 hasConceptScore W2796132685C2522767166 @default.
• W2796132685 hasConceptScore W2796132685C31258907 @default.
• W2796132685 hasConceptScore W2796132685C34947359 @default.
• W2796132685 hasConceptScore W2796132685C36647736 @default.
• W2796132685 hasConceptScore W2796132685C41008148 @default.
• W2796132685 hasConceptScore W2796132685C4727928 @default.
• W2796132685 hasConceptScore W2796132685C51332947 @default.
• W2796132685 hasConceptScore W2796132685C518677369 @default.
• W2796132685 hasConceptScore W2796132685C534932454 @default.
• W2796132685 hasConceptScore W2796132685C551386961 @default.
• W2796132685 hasConceptScore W2796132685C62611344 @default.
• W2796132685 hasConceptScore W2796132685C66938386 @default.
• W2796132685 hasLocation W27961326851 @default.
• W2796132685 hasOpenAccess W2796132685 @default.
• W2796132685 hasPrimaryLocation W27961326851 @default.
• W2796132685 hasRelatedWork W1521273090 @default.
• W2796132685 hasRelatedWork W1570672868 @default.
• W2796132685 hasRelatedWork W1584630535 @default.
• W2796132685 hasRelatedWork W1648010770 @default.
• W2796132685 hasRelatedWork W2030544494 @default.
• W2796132685 hasRelatedWork W2066460177 @default.
• W2796132685 hasRelatedWork W2073888272 @default.
• W2796132685 hasRelatedWork W2101154456 @default.
• W2796132685 hasRelatedWork W2131750863 @default.
• W2796132685 hasRelatedWork W2165627578 @default.
• W2796132685 hasRelatedWork W2181637470 @default.
• W2796132685 hasRelatedWork W2555493999 @default.
• W2796132685 hasRelatedWork W2584953651 @default.
• W2796132685 hasRelatedWork W2593389045 @default.
• W2796132685 hasRelatedWork W2986560668 @default.
• W2796132685 hasRelatedWork W1497965833 @default.
• W2796132685 hasRelatedWork W2120349153 @default.
• W2796132685 hasRelatedWork W2300440669 @default.
• W2796132685 hasRelatedWork W2743993499 @default.
• W2796132685 hasRelatedWork W3151084849 @default.
• W2796132685 isParatext "false" @default.
• W2796132685 isRetracted "false" @default.
• W2796132685 magId "2796132685" @default.
• W2796132685 workType "dissertation" @default.