Cost-Effective Replication Schemes for Query Load Balancing in DHT-Based Peer-to-Peer File Searches

@article{Cao2014CostEffectiveRS,
  title={Cost-Effective Replication Schemes for Query Load Balancing in DHT-Based Peer-to-Peer File Searches},
  author={Q. Cao and Satoshi Fujita},
  journal={J. Inf. Process. Syst.},
  year={2014},
  volume={10},
  pages={628}
}
  • Q. CaoS. Fujita
  • Published 1 August 2014
  • Computer Science
  • J. Inf. Process. Syst.
In past few years, distributed hash table (DHT)-based P2P systems have been proven to be a promising way to manage decentralized index information and provide efficient lookup services. However, the skewness oIXVHUV∂� SUHIHUHQFHV� regarding keywords contained in a multi-keyword query causes a query load imbalance that combines both routing and response load. This imbalance means long file retrieval latency that negatively influences the overall system performance. Although index replication has… 

Figures and Tables from this paper

A shareable keyword search over encrypted data in cloud computing

A sharable ID-based encryption with keyword search in cloud computing environment, which enables users to search in data owners’ shared storage while preserving privacy of data is proposed.

A Structured Overlay Network Scheme Based on Multiple Different Time Intervals

This study confirmed that the proposed method reduces the number of messages needed to process interval queries, and established a structured overlay network scheme based on multiple different time intervals in terms of communication load, delay, and maintenance cost.

User Verifiable Multiple Keyword Search Scheme using the Merkle Tree for Outsourced Data in the Cloud

The paper proposes a user verifiable multi-keyword search scheme, which focuses on index and document encryption by HECC, and the search algorithm combined with the hash value verification process by the Merkle tree is strong enough to provide data security, privacy, and integrity.

A Node Virtualization Scheme for Structured Overlay Networks Based on Multiple Different Time Intervals

The proposed enhanced scheme for structured overlay networks based on multiple different time intervals uses node virtualization to equalize the loads of each real (physical) node and can increase the fairness of the number of the assigned data among physical nodes.

Sequential Separation Techniques with Temporal Structure

  • Yongjian ZhaoBin Jiang
  • Computer Science
    2018 3rd International Conference on Smart City and Systems Engineering (ICSCSE)
  • 2018
This work utilizes information theory criterion to develop a signal separation algorithm that aims to separate one or a few interesting signals owning some degree of periodicity.

Prediction Techniques for Signal Separation

  • Yongjian Zhao
  • Computer Science
    2018 3rd International Conference on Smart City and Systems Engineering (ICSCSE)
  • 2018
A new objective function is developed here in terms of linear prediction and a learning algorithm for extraction of only one or a few source signals is deduced based on standard stochastic approximation.

References

SHOWING 1-10 OF 30 REFERENCES

Elastic Routing Table with Provable Performance for Congestion Control in DHT Networks

  • Haiying ShenChengzhong Xu
  • Computer Science
    26th IEEE International Conference on Distributed Computing Systems (ICDCS'06)
  • 2006
An elastic routing table (ERT) mechanism for query load balancing, based on the observation that high degree nodes tend to experience more traffic load, and a 2-way randomized query forwarding policy that leads to an exponential improvement in query processing time over random walking is presented.

An Efficient and Adaptive Decentralized File Replication Algorithm in P2P File Sharing Systems

  • Haiying Shen
  • Computer Science
    IEEE Transactions on Parallel and Distributed Systems
  • 2010
An Efficient and Adaptive Decentralized (EAD) file replication algorithm that achieves high query efficiency and high replica utilization at a significantly low cost and dramatically reduces the overhead of file replication.

Replica Placement for Route Diversity in Tree-Based Routing Distributed Hash Tables

This work defines MaxDisjoint, a replica placement that creates route diversity for tree-based routing DHTs and proves that this placement creates disJoint routes and finds the replication degree necessary to produce a desired number of disjoint routes.

Optimal Resource Placement in Structured Peer-to-Peer Networks

The simulation results as well as a real deployment on Planetlab demonstrate the effectiveness of the proposed resource placement strategy in reducing the average search cost of the whole system.

Databases, Information Systems, and Peer-to-Peer Computing

Design Issues and Challenges for RDF- and Schema-Based Peer-to-Peer Systems and Semantics and Data Integration, and Towards a Unifying Framework for Complex Query Processing over Structured Peer- to-Peers Data Networks.

Power laws, Pareto distributions and Zipf's law

When the probability of measuring a particular value of some quantity varies inversely as a power of that value, the quantity is said to follow a power law, also known variously as Zipf's law or the

I and i

There is, I think, something ethereal about i —the square root of minus one, which seems an odd beast at that time—an intruder hovering on the edge of reality.

DDVKRHNDQG+%DODNULVKQDQ³&KRUGDVFDODEOHSHHU-to-peer lookup service for Internet aSSOLFDWLRQVín Proceedings of the

  • Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM2001)
  • 2001

Peer to Peer

  • J. Cosh
  • Computer Science, Psychology
    Encyclopedia of Algorithms
  • 2008