Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.23919/WIOPT.2018.8362845 | 2018 16th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt) |
Keywords | Field | DocType |
Speed Scaling,Congestion Control,Queueing | Topology,Speed scaling,Exponential function,Computer science,Network packet,Server,Quality of service,Convex function,Poisson distribution,Bernoulli's principle,Distributed computing | Conference |
ISBN | Citations | PageRank |
978-1-5386-4621-2 | 0 | 0.34 |
References | Authors | |
12 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Parikshit Hegde | 1 | 0 | 0.68 |
| Akshit Kumar | 2 | 1 | 0.70 |
| Rahul Vaze | 3 | 463 | 45.64 |