Abstract
We consider the problem of designing access control protocols for servers distributing background data, such as software and database updates, so that they cause the least possible disruption to flows carrying delay-sensitive data. Using a Markov decision process formulation we obtain the optimal policy analytically, which is not easy to implement in practice. A mean-field argument is employed to show that another policy, which is easier to implement and is based on water-filling, converges to the optimal as the number of bottleneck links increases. Using simulations we compare the performance of this policy with the standard case where no control is exercised by the server.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
\(\mathop{\mathrm{sgn}}\nolimits (x) = 1\) is the sign function: it takes the values -1,0,1 if x < 0, x = 0, or x > 0 respectively.
References
Cohen B (2003) Incentives build robustness in BitTorrent, available in http://www.bittorrent.org/bittorrentecon.pdf
Courcoubetis C, Dimakis A (2012) Fair background data transfers of minimal delay impact. INFOCOM, 2012 Proceedings IEEE pp 1053–1061
Deb S, Ganesh A, Key P (2005) Resource allocation between persistent and transient flows. IEEE/ACM Trans Netw 13(2):302–315
Key P, Massoulie L, Vojnovic M (2005) Farsighted users harness network time-diversity. In: INFOCOM, 2005 Proceedings IEEE, vol 4, pp 2383–2394
Shai L, Vojnovic M, Gunawardena D (2007) Competitive and considerate congestion control for bulk data. In: 15th IEEE International Workshop on Quality of Service, pp 1–9
Shaked M, Shanthikumar J (2007) Stochastic Orders. Springer-Verlag New York
Acknowledgements
A. Dimakis was supported by a grant funded and administered by the Research Centre of Athens University of Economics and Business (RC/AUEB).
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Courcoubetis, C., Dimakis, A., Kanakakis, M. (2017). Minimally Intrusive Server Policies for Background Data Transfers. In: Lasaulce, S., Jimenez, T., Solan, E. (eds) Network Games, Control, and Optimization. NETGCOOP 2016. Static & Dynamic Game Theory: Foundations & Applications. Birkhäuser, Cham. https://doi.org/10.1007/978-3-319-51034-7_8
Download citation
DOI: https://doi.org/10.1007/978-3-319-51034-7_8
Published:
Publisher Name: Birkhäuser, Cham
Print ISBN: 978-3-319-51033-0
Online ISBN: 978-3-319-51034-7
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)