FRINK Linked Data Fragments server

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

• W2490012899 abstract "Currently, Peer-to-Peer overlays can be classified into two main categories: unstructured and structured ones. Unstructured overlays are simple, robust, and powerful in keyword search. Structured ones can scale to very large systems in terms of node number and geography, and guarantee to locate an object within O(LogN) hops. However, both of them face difficulties in efficiency and security of overlays. For unstructured ones, the efficiency problem presented is poor scalability. For structured ones, it is long routing latency and enormous overhead on handling system churn. Moreover, both of them are vulnerable to malicious attacks. Peer-to-Peer overlays belong to application-level network. To a great extension, overlay network designs ignore physical characteristics. As the result, their structures are far from underlying physical network or the distribution pattern of overlay peers. These inconsistencies induce system common operations costly, such as routing and lookup. On the other hand, most peers are assumed to have uniform resources and similar behaviors. Thus, Peer-to-Peer protocols were designed to be symmetric. However, in the realistic environment, peers’ resources and behaviors are highly skewed. Symmetric protocols actually compromise system performance. Frequently joining and leaving of peers generates enormous traffic. The significant fraction of peers with high latency/low bandwidth links increase lookup latency. Moreover, under the environment without mutual trust, Peer-to-Peer systems are very vulnerable for varied attacks because they lack a practical authentication mechanism. From a different perspective, this dissertation proposes to construct a highly efficient and secure Peer-to-Peer overlay based on the physical network structure of the Internet and network locality of overlay peers. By naturally integrating different network-aware techniques into the Peer-to-Peer overlay, a novel SNSA (Scalable Network Structure Aware) technique has been developed. It can provide accurate information of network locality of overlay peers and sufficient physical network structure of the Internet. Based on the valuable information, a unique Peer-to-Peer overlay, which can reflect network structure and locality of overlay peers, is constructed. Also, peers are assigned different roles by their resources and behaviors. Minor capable peers are involved in overlay core operations, such as routing and lookup. Major normal ones are organized into highly dependable teams, and assigned usual tasks, such as storing objects. Not only can this overlay support both structured and unstructured systems, but also the systems are highly efficient in routing and consuming much less bandwidth. As the observation that every peer must subject to the network configuration and administration imposed by ISPs, we propose to identify each peer by its physical network characteristic, net-print. Based on the SNSA technique and the net-print, a distributed authentication and secure routing mechanisms are developed under Peer-to-Peer environment. Beware of the fact that every overlay network maintains its own network proximity system. This dissertation proposes to build a common layer to provide such information for all overlays. By deeply analyzing requirements of current overlays, three kinds of primitives are designed to provide valued knowledge of physical network and overlay peers. Not only dose this method save network resource by eliminating duplicated probes, but it also provides an efficient way to share information between overlays. Keywords. Peer-to-Peer, Overlay Network, Overlay Routing, Overlay Structure, Distributed Hash Table (DHT), Network Topology, Network Aware, Network Locality, Network Proximity, Network Security, Secure Routing, System Churn" @default.
• W2490012899 created "2016-08-23" @default.
• W2490012899 creator A5034686090 @default.
• W2490012899 creator A5058668850 @default.
• W2490012899 date "2008-01-01" @default.
• W2490012899 modified "2023-09-23" @default.
• W2490012899 title "An efficient and secure overlay network for general peer-to-peer systems" @default.
• W2490012899 hasPublicationYear "2008" @default.
• W2490012899 type Work @default.
• W2490012899 sameAs 2490012899 @default.
• W2490012899 citedByCount "0" @default.
• W2490012899 crossrefType "journal-article" @default.
• W2490012899 hasAuthorship W2490012899A5034686090 @default.
• W2490012899 hasAuthorship W2490012899A5058668850 @default.
• W2490012899 hasConcept C110875604 @default.
• W2490012899 hasConcept C120314980 @default.
• W2490012899 hasConcept C136085584 @default.
• W2490012899 hasConcept C136764020 @default.
• W2490012899 hasConcept C169851745 @default.
• W2490012899 hasConcept C199360897 @default.
• W2490012899 hasConcept C31258907 @default.
• W2490012899 hasConcept C38652104 @default.
• W2490012899 hasConcept C41008148 @default.
• W2490012899 hasConcept C48044578 @default.
• W2490012899 hasConcept C534932454 @default.
• W2490012899 hasConcept C76155785 @default.
• W2490012899 hasConcept C77088390 @default.
• W2490012899 hasConcept C82876162 @default.
• W2490012899 hasConceptScore W2490012899C110875604 @default.
• W2490012899 hasConceptScore W2490012899C120314980 @default.
• W2490012899 hasConceptScore W2490012899C136085584 @default.
• W2490012899 hasConceptScore W2490012899C136764020 @default.
• W2490012899 hasConceptScore W2490012899C169851745 @default.
• W2490012899 hasConceptScore W2490012899C199360897 @default.
• W2490012899 hasConceptScore W2490012899C31258907 @default.
• W2490012899 hasConceptScore W2490012899C38652104 @default.
• W2490012899 hasConceptScore W2490012899C41008148 @default.
• W2490012899 hasConceptScore W2490012899C48044578 @default.
• W2490012899 hasConceptScore W2490012899C534932454 @default.
• W2490012899 hasConceptScore W2490012899C76155785 @default.
• W2490012899 hasConceptScore W2490012899C77088390 @default.
• W2490012899 hasConceptScore W2490012899C82876162 @default.
• W2490012899 hasLocation W24900128991 @default.
• W2490012899 hasOpenAccess W2490012899 @default.
• W2490012899 hasPrimaryLocation W24900128991 @default.
• W2490012899 hasRelatedWork W1480139651 @default.
• W2490012899 hasRelatedWork W1552661533 @default.
• W2490012899 hasRelatedWork W1559751093 @default.
• W2490012899 hasRelatedWork W1575266214 @default.
• W2490012899 hasRelatedWork W1804511062 @default.
• W2490012899 hasRelatedWork W1984508178 @default.
• W2490012899 hasRelatedWork W2108927029 @default.
• W2490012899 hasRelatedWork W2121531691 @default.
• W2490012899 hasRelatedWork W2164892724 @default.
• W2490012899 hasRelatedWork W2168286577 @default.
• W2490012899 hasRelatedWork W2170455791 @default.
• W2490012899 hasRelatedWork W2182042056 @default.
• W2490012899 hasRelatedWork W2197161875 @default.
• W2490012899 hasRelatedWork W2291244569 @default.
• W2490012899 hasRelatedWork W2339601113 @default.
• W2490012899 hasRelatedWork W2344017644 @default.
• W2490012899 hasRelatedWork W2750131292 @default.
• W2490012899 hasRelatedWork W278534886 @default.
• W2490012899 hasRelatedWork W583112127 @default.
• W2490012899 hasRelatedWork W2090845534 @default.
• W2490012899 isParatext "false" @default.
• W2490012899 isRetracted "false" @default.
• W2490012899 magId "2490012899" @default.
• W2490012899 workType "article" @default.