Lukasz Chrost

Learn More
Queueing systems in which an arriving job is blocked and lost with a probability that depends on the queue size are studied. The study is motivated by the popularity of Active Queue Management (AQM) algorithms proposed for packet queueing in Internet routers. AQM algorithms often exploit the idea of queue-size based packet dropping. The main results include(More)
The paper aims at depicting certain limitations of EDCA queues related to the different traffic classes. Through simulation, we show main flaws of identical, medium size, Drop Tail queues used by default for each class, with reference to different traffic category's requirements. We propose some substitutes such as differentiated, basically smaller buffer(More)
  • 1