{SmartCuckoo}: A Fast and {Cost-Efficient} Hashing Index Scheme for Cloud Storage Systems
Fast query services are important to improve overall per-formance of large-scale storage
systems when handling a large number of files. Open-addressing cuckoo hash schemes …
systems when handling a large number of files. Open-addressing cuckoo hash schemes …
Instability of FIFO at arbitrarily low rates in the adversarial queueing model
We study the stability of the commonly used packet forwarding protocol, FIFO (first in first
out), in the adversarial queueing model. We prove that FIFO can become unstable, ie, lead …
out), in the adversarial queueing model. We prove that FIFO can become unstable, ie, lead …
New stability results for adversarial queuing
Z Lotker, B Patt-Shamir, A Rosén - Proceedings of the Fourteenth …, 2002 - dl.acm.org
We consider the model of" adversarial queuing theory" for packet networks introduced by
Borodin et al. 6. We show that the scheduling protocol First-In-First-Out (FIFO) can be …
Borodin et al. 6. We show that the scheduling protocol First-In-First-Out (FIFO) can be …
Mitigating asymmetric read and write costs in cuckoo hashing for storage systems
In storage systems, cuckoo hash tables have been widely used to support fast query
services. For a read, the cuckoo hashing delivers real-time access with $ O (1) $ lookup …
services. For a read, the cuckoo hashing delivers real-time access with $ O (1) $ lookup …
All Tests for a Fault are Not Eyually Valuable for Defect Detection
R Kapur, J Park, MR Mercer - Proceedings International Test …, 1992 - computer.org
We study the stability of the commonly used packet forwarding protocol, FIFO (First In First
Out), in the adversarial queueing model. We prove that FIFO can become unstable, ie, lead …
Out), in the adversarial queueing model. We prove that FIFO can become unstable, ie, lead …
The impact of network structure on the stability of greedy protocols
A packet-switching network is stable if the number of packets in the network remains
bounded at all times. A very natural question that arises in the context of stability properties …
bounded at all times. A very natural question that arises in the context of stability properties …
The increase of the instability of networks due to quasi-static link capacities
In this work, we study the impact of the dynamic changing of the network link capacities on
the stability properties of packet-switched networks. Especially, we consider the Adversarial …
the stability properties of packet-switched networks. Especially, we consider the Adversarial …
On delivery times in packet networks under adversarial traffic
A Rosén, MS Tsirkin - Proceedings of the sixteenth annual ACM …, 2004 - dl.acm.org
We consider packet networks and make use of the" adversarial queuing theory" model [10].
We are interested in the question of guaranteeing that all packets are actually delivered to …
We are interested in the question of guaranteeing that all packets are actually delivered to …
The complexity of deciding stability under FFS in the Adversarial Queueing model
We address the problem of deciding whether a given network is stable in the Adversarial
Queueing Model when considering farthest-from-source (ffs) as the queueing policy to …
Queueing Model when considering farthest-from-source (ffs) as the queueing policy to …
[PDF][PDF] FIFO is unstable at arbitrarily low rates
In this work, we study the stability of the FIFO (First-In-First-Out) protocol in the context of
Adversarial Queueing Theory. As an important intermediate step, we consider dynamic …
Adversarial Queueing Theory. As an important intermediate step, we consider dynamic …