Sciweavers

851 search results - page 156 / 171
» Random constructions and density results
Sort
View
LCN
2006
IEEE
14 years 1 months ago
Computing Real Time Jobs in P2P Networks
— In this paper, we present a distributed computing framework designed to support higher quality of service and fault tolerance for processing deadline-driven tasks in a P2P envi...
Jingnan Yao, Jian Zhou, Laxmi N. Bhuyan
MIDDLEWARE
2004
Springer
14 years 22 days ago
A Content Model for Evaluating Peer-to-Peer Searching Techniques
Simulation studies are frequently used to evaluate new peer-to-peer searching techniques as well as existing techniques on new applications. Unless these studies are accurate in th...
Brian F. Cooper
INFOCOM
2002
IEEE
14 years 9 days ago
Design of Wavelength Converting Switches for Optical Burst Switching
— Optical Burst Switching (OBS) is an experimental network technology that enables the construction of very high capacity routers, using optical data paths and electronic control...
Jeyashankher Ramamirtham, Jonathan S. Turner
SIGMOD
1998
ACM
97views Database» more  SIGMOD 1998»
13 years 11 months ago
Cost Based Query Scrambling for Initial Delays
Remote data access from disparate sources across a widearea network such as the Internet is problematic due to the unpredictable nature of the communications medium and the lack o...
Tolga Urhan, Michael J. Franklin, Laurent Amsaleg
ICDCS
2010
IEEE
13 years 11 months ago
Practical Robust Communication in DHTs Tolerating a Byzantine Adversary
—There are several analytical results on distributed hash tables (DHTs) that can tolerate Byzantine faults. Unfortunately, in such systems, operations such as data retrieval and ...
Maxwell Young, Aniket Kate, Ian Goldberg, Martin K...