Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
Englert, M. and Westermann, M. (2008) Lower and Upper Bounds on FIFO Buffer Management in QoS Switches. In: Algorithmica. Lecture Notes in Computer Science, 53 (4). Springer Science+Business Media, LLC 2008, pp. 523-548.
Restricted to Repository staff only
Official URL: http://dx.doi.org/10.1007/s00453-008-9236-5
We consider the management of FIFO buffers for network switches providing differentiated services. In each time step, an arbitrary number of packets arrive and only one packet can be sent. The buffer can store a limited number of packets and, due to the FIFO property, the sequence of sent packets has to be a subsequence of the arriving packets. The differentiated service model is abstracted by attributing each packet with a value according to its service level. A buffer management strategy can drop packets, and the goal is to maximize the sum of the values of sent packets.
For only two different packet values, we introduce the account strategy and prove that this strategy achieves an optimal competitive ratio of if the buffer size tends to infinity and an optimal competitive ratio of for arbitrary buffer sizes. For general packet values, the simple preemptive greedy strategy (PG) is studied. We show that PG achieves a competitive ratio of which is the best known upper bound on the competitive ratio of this problem. In addition, we give a lower bound of on the competitive ratio of PG which improves the previously known lower bound. As a consequence, the competitive ratio of PG cannot be further improved significantly.
|Item Type:||Book Section|
|Uncontrolled Keywords:||focs online algorithms buffer management computer networks quality of service|
|Subjects:||Q Science > QA Mathematics > QA75 Electronic computers. Computer science|
|Divisions:||Faculty of Science > Computer Science|
|Depositing User:||Ms Saima Arif|
|Date Deposited:||04 Jan 2011 09:37|
|Last Modified:||26 Jul 2011 11:15|
Actions (login required)