Abstract
We propose a throughput value function (TVF) based solution for providing multi time-scale (MTS) fairness for broadband traffic in access-aggregation networks. The primary goal of MTS fairness is a dynamic control of resource sharing that considers the usage history of the broadband connection. We present a flow level description of the multi time-scale throughput value function (MTS-TVF) based resource sharing. We provide dimensioning guidelines in traffic aggregation scenarios and present its simulation-based performance analysis.
In the performance analysis, our focus is on overloaded systems involving both low load users (with temporally active traffic) and high load users (with heavy traffic, e.g. continuous multiple downloads). We find that the Quality of Experience (QoE) of low load users significantly increases when using MTS-TVF and it becomes similar to that of a lightly loaded system, while the change in the QoE is minimal for high load users.
Partially supported by the OTKA K123914 and the TUDFO/51757/2019-ITM grants.
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
Similar content being viewed by others
References
Abbas, G., Halim, Z., Abbas, Z.H.: Fairness-driven queue management: a survey and taxonomy. IEEE Commun. Surv. Tutor. 18(1), 324–367 (2016)
Briscoe, B.: Per-flow scheduling and the end-to-end argument. Technical report (2019). http://bobbriscoe.net/projects/latency/per-flow_tr.pdf
Nádas, S., Varga, B., Horváth, I., Mészáros, A., Telek, M.: Multi timescale bandwidth profile and its application for burst-aware fairness. In: IEEE Wireless Communications and Networking Conference (WCNC 2020) (2020)
Nadas, S., Turanyi, Z.R., Racz, S.: Per packet value: a practical concept for network resource sharing. In: 2016 IEEE Global Communications Conference (GLOBECOM), pp. 1–7 (2016)
Nádas, S., Gombos, G., Fejes, F., Laki, S.: Towards core-stateless fairness on multiple timescales. In: Proceedings of the Applied Networking Research Workshop, pp. 30–36 (2019)
Cao, Z., Zegura, E., Wang, Z.: Rainbow fair queueing: theory and applications. Comput. Netw. 47(3), 367–392 (2005)
Stoica, I., Shenker, S., Zhang, H.: Core-stateless fair queueing: a scalable architecture to approximate fair bandwidth allocations in high-speed networks. IEEE Trans. Netw. 11(1), 33–46 (2003)
Laki, S., Gombos, G., Nádas, S., Turányi, Z.: Take your own share of the pie. In: Proceedings of the Applied Networking Research Workshop, ANRW 2017, pp. 27–32. ACM (2017)
Figueiredo, D., Liu, B., Guo, Y., Kurose, J., Towsley, D.: On the efficiency of fluid simulation of networks. Comput. Netw. 50, 1974–1994 (2006)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Nádas, S., Varga, B., Horváth, I., Mészáros, A., Telek, M. (2021). Multi-timescale Fairness for Heterogeneous Broadband Traffic in Access-Aggregation Networks. In: Ballarini, P., Castel, H., Dimitriou, I., Iacono, M., Phung-Duc, T., Walraevens, J. (eds) Performance Engineering and Stochastic Modeling. EPEW ASMTA 2021 2021. Lecture Notes in Computer Science(), vol 13104. Springer, Cham. https://doi.org/10.1007/978-3-030-91825-5_4
Download citation
DOI: https://doi.org/10.1007/978-3-030-91825-5_4
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-91824-8
Online ISBN: 978-3-030-91825-5
eBook Packages: Computer ScienceComputer Science (R0)