We consider bandwidth-sharing networks, and show how the SRPT (Shortest Remaining Processing Time) discipline can be used in order to improve the delay performance of the system. Our main idea is not to use SRPT globally between the traffic classes, which has been shown to induce instability, but rather deploy SRPT only locally within each traffic class. We show that with this approach, the per...

We analyze the impact of size-based scheduling on the flow level performance of elastic traffic in wireless downlink data channels. The impact is assessed by comparing the flow level delay of the simple RR scheduler to two optimized non-anticipating schedulers (FB and FB◦) and SRPT. The optimized distance-aware scheduler FB◦ is derived by applying the Gittins index approach. Our results show th...

For the GGGG1 queue with First-Come First-Served, it is well known that the tail of the sojourn time distribution is heavier than the tail of the service requirement distribution when the latter has a regularly varying tail. In contrast, for the MMGG1 queue with Processor Sharing, Zwart and Boxma 26 showed that under the same assumptions on the service requirement distribution, the two tails ar...

Storing data on an external server with information-theoretic security, while using a key shorter than the itself, is impossible. As alternative, we propose scheme that achieves information-theoretically secure tamper evidence: The able to obtain information about stored data, but not staying undetected. Moreover, client only needs remember whose length much data. We provide security proof for ...