Can I read Competitive Buffer Management for Shared-memory Switches on EtoBox?

Competitive Buffer Management for Shared-memory Switches by William Aiello; Alex Kesselman; Yishay Mansour is a Computer Science article available to read on EtoBox.

What is Competitive Buffer Management for Shared-memory Switches about?

We consider buffer management policies for shared memory switches. We study the case of overloads resulting in packet loss, where the constraint is the limited shared memory capacity. The goal of the buffer management policy is that of maximizing the number of packets transmitted. The problem is online in nature, and thus we use competitive analysis to measure the performance of the buffer management policies. Our main result is to show that the well-known preemptive Longest Queue Drop ( __LQD__ ) policy is at most 2-competitive and at least √2-competitive. We also demonstrate a general lower bound of 4/3 on the performance of any deterministic online policy. Finally, we consider some other popular non-preemptive policies including Complete Partition, Complete Sharing, Static Threshold and Dynamic Threshold and derive almost tight bounds on their performance.

Who reads Competitive Buffer Management for Shared-memory Switches?

Author

William Aiello; Alex Kesselman; Yishay Mansour

Publisher

ACM

Published

2008

Language

EN

Field

Computer Science (Physical Sciences)