Sciweavers

2447 search results - page 399 / 490
» Co-Allocating Compute and Network Resources
Sort
View
P2P
2009
IEEE
114views Communications» more  P2P 2009»
16 years 1 months ago
Why Kad Lookup Fails
A Distributed Hash Table (DHT) is a structured overlay network service that provides a decentralized lookup for mapping objects to locations. In this paper, we study the lookup pe...
Hun Jeong Kang, Eric Chan-Tin, Nicholas Hopper, Yo...
WCNC
2008
IEEE
16 years 25 days ago
Modeling an Opportunistic Spectrum Sharing System with a Correlated Arrival Process
— In an opportunistic spectrum sharing (OSS) wireless network there are two types of users: primary users and secondary users. The primary users own the license for the system ba...
Shensheng Tang, Brian L. Mark
CAMP
2005
IEEE
16 years 2 days ago
Reinforcement Learning for P2P Searching
— For a peer-to-peer (P2P) system holding massive amount of data, an efficient and scalable search for resource sharing is a key determinant to its practical usage. Unstructured...
Luca Gatani, Giuseppe Lo Re, Alfonso Urso, Salvato...
ICNP
2005
IEEE
16 years 1 days ago
Intersection Characteristics of End-to-End Internet Paths and Trees
This paper focuses on understanding the scale and the distribution of “state overhead” (briefly load) that is incurred on the routers by various value-added network services,...
Sevcan Bilir, Kamil Saraç, Turgay Korkmaz
ESA
2005
Springer
114views Algorithms» more  ESA 2005»
15 years 12 months ago
Making Chord Robust to Byzantine Attacks
Chord is a distributed hash table (DHT) that requires only O(logn) links per node and performs searches with latency and message cost O(logn), where n is the number of peers in the...
Amos Fiat, Jared Saia, Maxwell Young