Nearest-Neighbor (NN) search is an increasingly important problem in many computer applications, in which high dimensional massive datasets are involved. In this paper, we propose a P2P distributed indexing scheme to ...
详细信息
Nearest-Neighbor (NN) search is an increasingly important problem in many computer applications, in which high dimensional massive datasets are involved. In this paper, we propose a P2P distributed indexing scheme to perform NN search in massive datasets. We consider the locality sensitive hashing (LSH) scheme under lp-metric to support similarity search in high dimensional space and we put forward a novel mapping from the multi-dimensional LSH bucket space to the one dimension DHT key space using nun-uniform Hilbert Curve. We consider the requirements of both similarity search and the maintenance of P2P network. Our indexing scheme preserves the locality sensitive property of LSH indexes and guarantees load balance in DHT networks. We also show how to leverage the LSH indexing scheme to efficiently process NN search in P2P network. Experiments on real world data confirm the effectiveness and efficiency of our approach and show the scalability gains compared to state-of-the-art schemes.
In distributed systems, the server placement problem in which a new server has to compete with existing servers for user requests is important in planning of constructing new business service sites. In addition to min...
详细信息
With widely application of Peer-to-Peer (P2P) file sharing technique, the P2P traffic occupies most of the current Internet bandwidth. Modeling the behaviors of P2P file sharing systems is important for designing and ...
详细信息
Propose an evolution model for Peer-to-Peer (P2P) file-sharing systems, which try to capture the dynamic properties of P2P application networks. The model consists of four events: node joining, node departure, connect...
详细信息
With wider application of P2P-based Media Delivery network (P2P-based MDN), much work has been done to improve the system' performance and efficiency in the process of media contents sharing. In this paper, we fir...
详细信息
ISBN:
(纸本)9787894631046
With wider application of P2P-based Media Delivery network (P2P-based MDN), much work has been done to improve the system' performance and efficiency in the process of media contents sharing. In this paper, we first propose a specific partially observable Markov Decision Process (POMDP) model for admission control of P2P-based MDN. Based on this model, we provide the observation-based randomized policy to conduct admission control and optimize the policy by applying policy-gradient algorithm. Observation-based policy can promote the system's performance in real time aspect and policy optimizing can increase the accuracy of controller's judgments based on partial information. Admission strategy in the paper can save the cost in operating the system for media service providers. Bandwidth allocation policy is designed to reduce service delay and provide high-quality service. The comparison results of system's performances under different policies indicate that, partial service can utilize the system's resource in a better way.
Directed Acyclic Graph (DAG) is a nature way of workflow description. One of the most important and challenging problems in the DAG workflow field is the QoS-constrained scheduling problem with the aim to minimize the...
详细信息
Bandwidth smoothing can increase the utility of network bandwidth by reducing the burstiness of a VBR (variable bit rate) video stream. To guarantee the quality of service of video-on-command service in home network, ...
详细信息
Propose an evolution model for Peer-to-Peer (P2P) file-sharing systems, which try to capture the dynamic properties of P2P application networks. The model consists of four events: node joining, node departure, connect...
详细信息
Propose an evolution model for Peer-to-Peer (P2P) file-sharing systems, which try to capture the dynamic properties of P2P application networks. The model consists of four events: node joining, node departure, connection establishing and connection breaking, which captures the most important events in constructing network topology. The evolution model results in a differential equation about degree distribution, which can be solved analytically. By analyzing the solutions, some interesting results can be got.
With widely application of Peer-to-Peer (P2P) file sharing technique, the P2P traffic occupies most of the current Internet bandwidth. Modeling the behaviors of P2P file sharing systems is important for designing and ...
详细信息
With widely application of Peer-to-Peer (P2P) file sharing technique, the P2P traffic occupies most of the current Internet bandwidth. Modeling the behaviors of P2P file sharing systems is important for designing and evaluating such systems. In this paper, we develop a novel model to character the dynamic behaviors of P2P sharing systems. States in microcosmic view are defined and used to describe the interaction among the peers in systems. Then, a model in general form for P2P sharing systems is proposed. According to common software policies in P2P systems, we embody the model. To verify the validity and reasonability of the proposed model, P2P simulations are conducted.
暂无评论