Sciweavers

805 search results - page 102 / 161
» Modeling and Analyzing Periodic Distributed Computations
Sort
View
ISPAN
1999
IEEE
14 years 1 months ago
Location Updates and Probabilistic Tracking Algorithms for Mobile Cellular Networks
In this work, we develop a novel mathematical model to analyze di erent location update protocols for mobile cellular network. Our model can capture many important features of use...
John C. S. Lui, Cedric C. F. Fong, H. W. Chan
CONEXT
2007
ACM
14 years 1 months ago
On the cost of caching locator/ID mappings
Very recent activities in the IETF and in the Routing Research Group (RRG) of the IRTG focus on defining a new Internet architecture, in order to solve scalability issues related ...
Luigi Iannone, Olivier Bonaventure
CLUSTER
2008
IEEE
14 years 3 months ago
Divisible load scheduling with improved asymptotic optimality
—Divisible load model allows scheduling algorithms that give nearly optimal makespan with practical computational complexity. Beaumont et al. have shown that their algorithm prod...
Reiji Suda
ICPP
2009
IEEE
14 years 4 months ago
Load Balance in the Phylogenetic Likelihood Kernel
—Recent advances in DNA sequencing techniques have led to an unprecedented accumulation and availability of molecular sequence data that needs to be analyzed. This data explosion...
Alexandros Stamatakis, Michael Ott
GI
2003
Springer
14 years 2 months ago
Byzantine Failures and Security: Arbitrary is not (always) Random
: The Byzantine failure model allows arbitrary behavior of a certain fraction of network nodes in a distributed system. It was introduced to model and analyze the effects of very s...
Felix C. Gärtner