Speed scaling under QoS constraints with finite buffer
| Autor: | Parikshit Hegde, Rahul Vaze, Akshit Kumar |
|---|---|
| Rok vydání: | 2018 |
| Předmět: |
Computer science
Network packet Quality of service 020206 networking & telecommunications 0102 computer and information sciences 02 engineering and technology Poisson distribution 01 natural sciences Buffer (optical fiber) Exponential function Computer Science::Performance symbols.namesake Bernoulli's principle 010201 computation theory & mathematics Server 0202 electrical engineering electronic engineering information engineering symbols Convex function Algorithm |
| Zdroj: | WiOpt |
| DOI: | 10.23919/wiopt.2018.8362845 |
| Popis: | A single server with variable speed and a finite buffer is considered under a maximum packet drop probability constraint. The cost of processing by the server is a convex function of the speed of the server. If a packet arrives when the buffer is full, it is dropped instantaneously. Given the finite server buffer, the objective is to find the optimal dynamic server speed to minimize the overall cost subject to the maximum packet drop probability constraint. Finding the exact optimal solution is known to be hard, and hence algorithms with provable approximation bounds are considered. We show that if the buffer size is large enough, the proposed algorithm achieves the optimal performance. For arbitrary buffer sizes, constant approximation guarantees are derived for a large class of packet arrival distributions such as Bernoulli, Exponential, Poisson etc. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|