PODC
1997
ACM
1997
ACM
Leap Forward Virtual Clock: A New Fair Queuing Scheme with Guaranteed Delays and Throughput Fairness
13 years 9 months ago
We describe an ejjicient fair queuing scheme, Leap Forward Virtual Clock, that provides end-to-end delay bounds simdar to WFQ, along with throughput fairness. Our scheme can be im...
PODC
1997
ACM
13 years 9 months ago
1997
ACM
Conditions on a shared object type T are given that are both necessary and sufficient for wait-free n-process consensus to be solvable using objects of type T and registers. The co...
PODC
1997
ACM
13 years 9 months ago
1997
ACM
Replicated services accessed via quorums enable each access to be performed at only a subset (quorum) of the servers and achieve consistency across accesses by requiring any two qu...
PODC
1997
ACM
13 years 9 months ago
1997
ACM
Systems that store objects at a large number of sites require fault-tolerant and timely garbage collection. A popular technique is to trace each site independently using inter-sit...
PODC
1997
ACM
13 years 9 months ago
1997
ACM
PODC
1997
ACM
13 years 9 months ago
1997
ACM
This paper proposes algorithms for allocation of wavelengths to connections (lightpaths) in optical wavelength division multiplexed networks, predominantly for ring topologies. Th...
PODC
1997
ACM
13 years 9 months ago
1997
ACM
PODC
1997
ACM
13 years 9 months ago
1997
ACM
In an anonymous network processors have no distinct identifiers. For any class of anonymous networks, we characterize effectively the vector functions f : n → n which are compu...
PODC
1997
ACM
13 years 9 months ago
1997
ACM
PODC
1997
ACM
13 years 9 months ago
1997
ACM
Wait-free objects are often implemented through the use of a \helping scheme", whereby one process \helps" one or more other processes to complete an operation. This pap...