Sciweavers

5 search results - page 1 / 1
» Lower and Upper Bounds on FIFO Buffer Management in QoS Swit...
Sort
View
ESA
2006
Springer
108views Algorithms» more  ESA 2006»
13 years 9 months ago
Lower and Upper Bounds on FIFO Buffer Management in QoS Switches
We consider FIFO buffer management for switches providing differentiated services. In each time step, an arbitrary number of packets arrive, and only one packet can be sent. The bu...
Matthias Englert, Matthias Westermann
SODA
2003
ACM
157views Algorithms» more  SODA 2003»
13 years 6 months ago
Competitive queueing policies for QoS switches
We consider packet scheduling in a network providing differentiated services, where each packet is assigned a value. We study various queueing models for supporting QoS (Quality ...
Nir Andelman, Yishay Mansour, An Zhu
STOC
2001
ACM
151views Algorithms» more  STOC 2001»
14 years 5 months ago
Buffer overflow management in QoS switches
Abstract. We consider two types of buffering policies that are used in network switches supporting Quality of Service (QoS). In the FIFO type, packets must be transmitted in the or...
Alexander Kesselman, Zvi Lotker, Yishay Mansour, B...
CORR
2010
Springer
104views Education» more  CORR 2010»
13 years 5 months ago
An Optimal Lower Bound for Buffer Management in Multi-Queue Switches
In the online packet buffering problem (also known as the unweighted FIFO variant of buffer management), we focus on a single network packet switching device with several input po...
Marcin Bienkowski
IPPS
2009
IEEE
14 years 3 days ago
Competitive buffer management with packet dependencies
We introduce the problem of managing a FIFO buffer of bounded space, where arriving packets have dependencies among them. Our model is motivated by the scenario where large data f...
Alexander Kesselman, Boaz Patt-Shamir, Gabriel Sca...