Sciweavers

235 search results - page 40 / 47
» Distributed computing using Java: A comparison of two server...
Sort
View
SPAA
2003
ACM
15 years 4 months ago
Novel architectures for P2P applications: the continuous-discrete approach
We propose a new approach for constructing P2P networks based on a dynamic decomposition of a continuous space into cells corresponding to servers. We demonstrate the power of thi...
Moni Naor, Udi Wieder
117
Voted
ICPP
1998
IEEE
15 years 3 months ago
Routing Algorithms for Anycast Messages
Use of anycast service can considerably simplify many communication applications. Two approaches can be used for routing anycast packets. Single-path routing always uses the same ...
Dong Xuan, Weijia Jia, Wei Zhao
PPOPP
1997
ACM
15 years 3 months ago
LoPC: Modeling Contention in Parallel Algorithms
Parallel algorithm designers need computational models that take first order system costs into account, but are also simple enough to use in practice. This paper introduces the L...
Matthew Frank, Anant Agarwal, Mary K. Vernon
MOBIHOC
2009
ACM
16 years 6 days ago
MotionCast: on the capacity and delay tradeoffs
In this paper, we define multicast for ad hoc network through nodes' mobility as MotionCast, and study the capacity and delay tradeoffs for it. Assuming nodes move according ...
Chenhui Hu, Xinbing Wang, Feng Wu
101
Voted
SIGCOMM
2003
ACM
15 years 4 months ago
A measurement-based analysis of multihoming
Multihoming has traditionally been employed by stub networks to enhance the reliability of their network connectivity. With the advent of commercial “intelligent route control...
Aditya Akella, Bruce M. Maggs, Srinivasan Seshan, ...