✦ LIBER ✦

Improving lookup reliability in Kad

✍ Scribed by Liu, Bingshuang; Wei, Tao; Zhang, Chao; Li, Jun; Zhang, Jianyu

Book ID: 121614746
Publisher: Springer US
Year: 2013
Tongue: English
Weight: 996 KB
Volume: 8
Category: Article
ISSN: 1936-6442
DOI: 10.1007/s12083-013-0240-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Evaluating and improving the content acc

Evaluating and improving the content access in KAD

✍ Moritz Steiner; Damiano Carra; Ernst W. Biersack 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 834 KB

Incrementally improving lookup latency i

Incrementally improving lookup latency in distributed hash table systems

✍ Zhang, Hui; Goel, Ashish; Govindan, Ramesh 📂 Article 📅 2003 🏛 Association for Computing Machinery 🌐 English ⚖ 392 KB

Improving lookup latency in distributed

Improving lookup latency in distributed hash table systems using random sampling

✍ Hui Zhang; A. Goel; R. Govindan 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 500 KB

Optimization limits in improving system

Optimization limits in improving system reliability

✍ Xu, Z.; Kuo, W.; Lin, H.-H. 📂 Article 📅 1990 🏛 IEEE 🌐 English ⚖ 759 KB

Improving performance reliability in sur

Improving performance reliability in surgical systems

✍ J. Benn; A. N. Healey; E. Hollnagel 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 253 KB

Improving reliability bounds in computer

Improving reliability bounds in computer networks

✍ Timothy B. Brecht; Charles J. Colbourn 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 538 KB

The probability that a computer network is operational in an environment of statistically independent link failures has been widely studied. Three natural problems arise, when all nodes are to be connected (all-terminal reliability), when two nodes are to communicate (2-terminal reliability), and wh