User-priority guided Min-Min scheduling algorithm for load balancing in cloud computing
Cloud computing is emerging as a new paradigm of large-scale distributed computing. In
order to utilize the power of cloud computing completely, we need an efficient task …
order to utilize the power of cloud computing completely, we need an efficient task …
[HTML][HTML] Survey of research towards robust peer-to-peer networks: Search methods
J Risson, T Moors - 2007 - rfc-editor.org
RFC 4981: Survey of Research towards Robust Peer-to-Peer Networks: Search Methods [RFC
Home] [TEXT|PDF|HTML] [Tracker] [IPR] [Info page] INFORMATIONAL Network Working Group …
Home] [TEXT|PDF|HTML] [Tracker] [IPR] [Info page] INFORMATIONAL Network Working Group …
Efficient Routing for Peer-to-Peer Overlays.
A Gupta, B Liskov, R Rodrigues - NSDI, 2004 - usenix.org
Most current peer-to-peer lookup schemes keep a small amount of routing state per node,
typically logarithmic in the number of overlay nodes. This design assumes that routing …
typically logarithmic in the number of overlay nodes. This design assumes that routing …
Design considerations for a network of information
The existing Internet ecosystem is a result of decades of evolution. It has managed to scale
well beyond the original aspirations. Evolution, though, highlighted a certain degree of …
well beyond the original aspirations. Evolution, though, highlighted a certain degree of …
MDHT: A hierarchical name resolution service for information-centric networks
M D'Ambrosio, C Dannewitz, H Karl… - Proceedings of the ACM …, 2011 - dl.acm.org
Information-centric network architectures are an increasingly important approach for future
Internet architectures. Several approaches are based on a non-hierarchical identifier (ID) …
Internet architectures. Several approaches are based on a non-hierarchical identifier (ID) …
[图书][B] Peer-to-peer computing: Principles and applications
Peer-to-peer (P2P) technology, or peer computing, is a paradigm that is viewed as a
potential technology for redesigning distributed architectures and, consequently, distributed …
potential technology for redesigning distributed architectures and, consequently, distributed …
[PDF][PDF] Netinf: An information-centric design for the future internet
C Dannewitz - Proc. 3rd GI/ITG KuVS Workshop on The Future …, 2009 - Citeseer
The current Internet architecture has been very successful and has scaled well beyond the
original aspirations. Nevertheless, the architecture suffers from multiple well documented …
original aspirations. Nevertheless, the architecture suffers from multiple well documented …
Heterogeneity and load balance in distributed hash tables
PB Godfrey, I Stoica - … IEEE 24th Annual Joint Conference of …, 2005 - ieeexplore.ieee.org
Existing solutions to balance load in DHTs incur a high overhead either in terms of routing
state or in terms of load movement generated by nodes arriving or departing the system. In …
state or in terms of load movement generated by nodes arriving or departing the system. In …
Epichord: Parallelizing the chord lookup algorithm with reactive routing state management
B Leong, B Liskov, ED Demaine - Computer Communications, 2006 - Elsevier
EpiChord is a DHT lookup algorithm that demonstrates that we can remove the O (log n)-
state-per-node restriction on existing DHT topologies to achieve significantly better lookup …
state-per-node restriction on existing DHT topologies to achieve significantly better lookup …
[PDF][PDF] Corona: A High Performance Publish-Subscribe System for the World Wide Web.
V Ramasubramanian, R Peterson, EG Sirer - NSDI, 2006 - usenix.org
Despite the abundance of frequently changing information, the Web lacks a publish-
subscribe interface for delivering updates to clients. The use of naıve polling for detecting …
subscribe interface for delivering updates to clients. The use of naıve polling for detecting …