A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
Filters
WOW: Self-organizing Wide Area Overlay Networks of Virtual Workstations
2007
Journal of Grid Computing
Preserved Fulltext
Experiments show that the latency in joining a WOW network is of the order of seconds: in a set of 300 trials, 90% of the nodes self-configured P2P routes within 10 seconds, and more than 99% established ...
The system is architected to: facilitate the addition of nodes to a pool of resources through the use of system virtual machines (VMs) and self-organizing virtual network links; to maintain IP connectivity ...
. (2)
Fig. 8 . 8 Distributions of PBS/MEME job wall clock times when the overlay network self-organizing shortcuts are enabled (left) and disabled (right). ...
doi:10.1007/s10723-007-9076-6
fatcat:dp75dnfycbg4hddzsr4sttyham
SOON: A Scalable Self-organized Overlay Network for Distributed Information Retrieval
[chapter]
2008
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf.
In this paper, we propose Self-Organized Overlay Network (SOON), an unstructured P2P overlay architecture, to facilitate sharing and searching semantically heterogeneous contents. ...
In particular, we have proposed a semantics-aware topology construction method to group nodes sharing similar semantics together to create small-worlds. ...
Conclusion In this paper, we propose a self-organized semantic overlay network, SOON. It uses an ontology-based representation of the information metadata. ...
doi:10.1007/978-3-540-87353-2_1
fatcat:gc5o7mouwfbhfmkidxrchfd56y
P2P-based Network and Service Operation for the Emerging Future Internet
2007
PIK - Praxis der Informationsverarbeitung und Kommunikation
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
The ubiquity and availability of networked application in today's wired and wireless networks combined with an increasing commercial significance has led to a demand for highly dependable networks and ...
Due to the increased application of abstraction layers, like the Internet Protocol (IP) or overlay techniques, services can be consumed now in a variety of wireless and wireline networks such as ADSL, ...
Thus, self-organizing mechanisms and self-* procedures have been suggested [11] . ...
doi:10.1515/piko.2007.68
fatcat:4sgxllu3k5h4tkdomjxuijh7da
Information retrieval in schema-based P2P systems using one-dimensional semantic space
2007
Computer Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Peers in this overlay are grouped based on the semantics of their data which are extracted according to a set of schemas, and self-organized as a semantic overlay network. ...
In this paper, we present Dynamic Semantic Space, a schema-based peer-to-peer overlay network that facilitates efficient lookup for RDF-based information in dynamic environments. ...
Overview In DSS, a large number of nodes are self-organized into a semantic overlay network, in accordance with their semantics. A user or an application can act as a producer, a consumer or both. ...
doi:10.1016/j.comnet.2007.06.019
fatcat:6ehlnhpz5bbo3ggsbpr6bofz4e
Finding Routing Shortcuts Using an Internet Coordinate System
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we design the basis of a lightweight self-organising one-hop overlay routing mechanism improving the latencies: we define criteria that rely on the information provided by an Internet Coordinate ...
Our best criterion does not guarantee to find the best shortcut for any given path in a network but, even in networks with hundreds or thousands of nodes, it will restrict the search for potential shortcuts ...
[7] proposed to use an ICS to detect one-hop shortcuts in a network. ...
doi:10.1007/978-3-642-19167-1_6
fatcat:3vjfhheoxjf6rggeiwzkv5zx2u
Scaling Group Communication Services with Self-adaptive and Utility-driven Message Routing
2012
Journal on spesial topics in mobile networks and applications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2012; you can also visit the original URL.
The file type is application/pdf.
In this paper, we identify the inefficiency of geo-distance based routing protocols in many existing multicast overlay networks in terms of both resource utilization and group communication efficiency. ...
To address this issue, we develop a utilitybased routing scheme (UDR) that can provide efficient group communication services in a decentralized geographical overlay network. ...
Membership protocol GeoCast system uses this protocol to organize the widely distributed end system nodes into an overlay network that provides group communications services. ...
doi:10.1007/s11036-011-0348-9
fatcat:4glmbnjj7vgbzilwqkmkyeyeem
InstantLeap
2009
Proceedings of the 18th international workshop on Network and operating systems support for digital audio and video - NOSSDAV '09
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To avoid overloading the servers and achieve instant neighbor discovery over the self-organizing P2P overlay, we design a novel method of organizing peers watching the same video, that constitutes a light-weighted ...
Peer-to-peer network, video-on-demand, indexing overlay, neighbor discovery ⊲ We show an O(1) neighbor discovery efficiency upon peer joins and playback leaps across the video stream. ⊲ We show an O(m) ...
The remainder of this paper is organized as follows. In Sec. 2, we present our network model and the design rationale. ...
doi:10.1145/1542245.1542251
dblp:conf/nossdav/QiuWLL09
fatcat:gzz3z7kk7rd2hjvjb6nc5osplm
Towards Social Profile Based Overlays
[article]
2010
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Peer-to-peer (P2P) overlays provide an environment that can return ownership of information, trust, and control to the users, away from centralized third-party social networks. ...
As social networks evolve, they encourage users to share more information, requiring the users, in turn, to place more trust into social networks. ...
In general, structured systems are able to make these guarantees by self-organizing a structured topology, such as a 2D ring or a hypercube. ...
arXiv:1002.0865v1
fatcat:qu6yotvfxjh7xjbcm6vkrvf5eu
Scalable and Reliable Location Services through Decentralized Replication
2009
2009 IEEE International Conference on Web Services
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Our replica management operates on a network of heterogeneous nodes and utilizes a shortcut-based optimization to increase the resilience of the system against node failures and network failures. ...
This paper presents Reliable GeoGrid, a decentralized service computing architecture based on geographical location aware overlay network for supporting reliable and scalable mobile information delivery ...
For an overlay network with 36 network partitions or higher, the random replication approach performs only slightly better than the neighbor-shortcut replication approach in terms of service lost rate. ...
doi:10.1109/icws.2009.57
dblp:conf/icws/ZhangLSBW09
fatcat:ykkyr7ssbvft3fmb3xw7gjyarm
A peer-to-peer architecture for context lookup
2005
The Second Annual International Conference on Mobile and Ubiquitous Systems: Networking and Services
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Peers are grouped based on the semantics of their local data which are extracted according to a set of schemas and are self-organized as a semantic overlay network. ...
Such a trend necessitates efficient search for context information in wide-area networks. In this paper, we propose a semantic P2P context lookup system. ...
The ContextPeers within the same ContextBus are interconnected and organized using an overlay network. ...
doi:10.1109/mobiquitous.2005.5
dblp:conf/mobiquitous/GuTPZ05
fatcat:fpkwhwe5vzeozgyysyeepjxhm4
Structured Overlay Networks as an Enabler for Future Internet ServicesStrukturierte Overlay Netze als Wegbereiter für NGI Dienste
2009
it - Information Technology
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this work we summarize the fundamentals of structured overlay networks, describe their inherent problems, and present an overview of our solutions. ...
There are many different approaches to realize structured overlay networks which in their core functions share the same basic principles. ...
Self-Organization In order for a structured overlay network to efficiently operate in practice, one has to adjust pa-rameters like the number of overlay connections to other peers or the frequency at which ...
doi:10.1524/itit.2008.0509
fatcat:vzydb7s56jh2fmg4e3t5xchlga
InstantLeap: an architecture for fast neighbor discovery in large-scale P2P VoD streaming
2010
Multimedia Systems
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
To avoid overloading the servers and achieve instant neighbor discovery over the self-organizing P2P overlay, we design a novel method of organizing peers watching a video. ...
Our analysis shows that InstantLeap achieves an O(1) neighbor discovery efficiency upon any playback "leap" across the media stream in streaming overlays of any size, and low messaging costs for overlay ...
In Sect. 3, we present our network model and the architecture of InstantLeap overlay. In Sect. 4 , we discuss the detailed protocols in InstantLeap. ...
doi:10.1007/s00530-010-0185-x
fatcat:nawbf7vd7zajfkzob32djymtnu
Finding and evaluating the community structure in semantic peer-to-peer overlay networks
2011
Science China Information Sciences
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is application/pdf.
In this paper we identify a natural property of semantic overlay networks, the community structure. ...
Recently much attention has been paid to semantic overlay networks for information retrieval in large scale peer-to-peer networks, and much research work on semantic overlay protocols and searching algorithms ...
Based on the principle of interest-based locality, a self-organizing protocol, interest-based shortcuts, is proposed and implemented on top of Gnutella. ...
doi:10.1007/s11432-011-4296-6
fatcat:ijjghf22onhdflfpyyxgm2xok4
Using Two-tier Bitwise Interest Oriented QRP Data Structure for High Clustering through Interest Similarity in SWB P2P Systems
2012
2012 Ninth International Conference on Information Technology - New Generations
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
In this research, we propose an enhanced hierarchical overlay network by incorporating the concept of Small world into the base hierarchical architecture. ...
This research adopts the Query Routing Protocol (QRP) data structure of a hierarchical P2P network by storing the interest information of files in the leaf peers in the network. ...
i=1..X and X is the total number of peers in an P2P overlay network. ...
doi:10.1109/itng.2012.32
dblp:conf/itng/LimCH12
fatcat:op3plwn7dzcxbgvm3sjovhrbbi
X-Vine: Secure and Pseudonymous Routing Using Social Networks
[article]
2011
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
Existing social network-based solutions to mitigate the Sybil attacks in DHT routing have a high state requirement and do not provide an adequate level of privacy. ...
Moreover, our algorithms are efficient, maintain low stretch, and avoid hot spots in the network. We validate our design with a PlanetLab implementation and a Facebook plugin. ...
In the second case, there is no shortcutting, and the lookup proceeds towards the next overlay hop node 1. ...
arXiv:1109.0971v1
fatcat:2u7gtcensnag7gqtuj35p6qguy
« Previous
Showing results 1 — 15 out of 1,351 results