Sciweavers

449 search results - page 66 / 90
» Distributed Reasoning in a Peer-to-Peer Setting
Sort
View
INFOCOM
2005
IEEE
15 years 3 months ago
On failure detection algorithms in overlay networks
— One of the key reasons overlay networks are seen as an excellent platform for large scale distributed systems is their resilience in the presence of node failures. This resilie...
Shelley Zhuang, Dennis Geels, Ion Stoica, Randy H....
MOBICOM
2005
ACM
15 years 3 months ago
Assignment of dynamic transmission range based on estimation of vehicle density
Vehicular Ad Hoc Networks (VANET) have several characteristics that distinguish them from other ad hoc networks. Among those is the rapid change in topology due to traffic jams, w...
Maen M. Artimy, William Robertson, William J. Phil...
TARK
2005
Springer
15 years 3 months ago
Unconditional privacy in social choice
The aggregation of conflicting preferences is an important issue in human society and multiagent systems. Due to its universality, voting among a set of alternatives has a centra...
Felix Brandt, Tuomas Sandholm
GI
2003
Springer
15 years 3 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
ICPP
2002
IEEE
15 years 2 months ago
BPA: A Fast Packet Scheduling Algorithm for Real-Time Switched Ethernet Networks
In this paper, we present a MAC-Iayer packet scheduling algorithm called BPA, for real-time switched Ethernet networks. BPA considers a message model where trans-node application-...
Jinggang Wang, Binoy Ravindran