1414 search results - page 76 / 283 » Performance Bounds in Communication Networks with Variable-R... |
DSN
2007
IEEE
14 years 2 months ago
2007
IEEE
When employing a consensus algorithm for state machine replication, should one optimize for the case that all communication links are usually timely, or for fewer timely links? Do...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
— Scheduling algorithms assign contention probability for each link in Wireless Ad Hoc Networks and plays a key role in deciding the system performance. Recently, many lowcost di...
INFOCOM
2005
IEEE
14 years 1 months ago
2005
IEEE
— To proactively defend against intruders from readily jeopardizing single-path data sessions, we propose a distributed secure multipath solution to route data across multiple pa...
ISAAC
2001
Springer
14 years 5 days ago
2001
Springer
We consider the routing for a special type of communication requests, called a multicast, consisting of a fixed source and a multiset of destinations in a wavelength division mult...
INFOCOM
2007
IEEE
14 years 2 months ago
2007
IEEE
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...