research-article

Core-Stateless Forwarding With QoS Revisited: Decoupling Delay and Bandwidth Requirements

Authors:

Szilveszter Nádas,

Zoltán Turányi,

Csaba KeszeiAuthors Info & Claims

IEEE/ACM Transactions on Networking, Volume 29, Issue 2

Pages 503 - 516

https://doi.org/10.1109/TNET.2020.3041235

Published: 15 April 2021 Publication History

Abstract

Network QoS, fairness and resource sharing control are not completely solved problems. Available solutions lack scalability due to maintaining flow state, require re-tuning if traffic changes, focus on a limited set of networking scenarios or require complex, centralized controllers and feedback loops. In this paper, we propose a core-stateless solution for closed network domains like access, enterprise and data center networks that handles resource sharing and provides guarantees for per-hop latency, independently. The proposed method enables controlled resource sharing by encoding the utility function of flows to Packet Value markings. This allows expressing resource sharing policies for all possible congestion situations, while operation is completely flow unaware inside the network. In addition, it also satisfies per-hop delay requirements for traffic flows independently. The separation of the delay requirements of the packets from their importance has not generally been possible by existing methods so far. The performance of the proposed method has thoroughly been analyzed by large number of simulations covering both static and dynamic scenarios and was implemented in a cloud-native virtual router implementing all the policies needed for a Broadband Network Gateway, showing good performance and better scalability than existing weighted queuing-based solutions.

References

[1]

I. Stoica, S. Shenker, and H. Zhang, “Core-stateless fair queueing: A scalable architecture to approximate fair bandwidth allocations in high-speed networks,” IEEE/ACM Trans. Netw., vol. 11, no. 1, pp. 33–46, Feb. 2003.

[2]

Z. Cao, E. Zegura, and Z. Wang, “Rainbow fair queueing: Theory and applications,” Comput. Netw., vol. 47, no. 3, pp. 367–392, Feb. 2005.

[3]

M. Menth and N. Zeitler, “Fair resource sharing for stateless-core packet-switched networks with prioritization,” IEEE Access, vol. 6, pp. 42702–42720, 2018.

[4]

K. Nagaraj, D. Bharadia, H. Mao, S. Chinchali, M. Alizadeh, and S. Katti, “NUMFabric: Fast and flexible bandwidth allocation in datacenters,” in Proc. ACM SIGCOMM Conf., New York, NY, USA, 2016, pp. 188–201.

[5]

A. Kumaret al., “BwE: Flexible, hierarchical bandwidth allocation for wan distributed computing,” in Proc. ACM Conf. SIGCOMM. New York, NY, USA, 2015, pp. 1–14.

[6]

O. Bondarenko, K. De Schepper, I.-J. Tsang, B. Briscoe, A. Petlund, and C. Griwodz, “Ultra-low delay for all: Live experience, live analysis,” in Proc. 7th Int. Conf. Multimedia Syst., New York, NY, USA, 2016, pp. 33:1–33:4.

[7]

S. Nádas, Z. R. Turányi, and S. Rácz, “Per packet value: A practical concept for network resource sharing,” in Proc. IEEE Global Commun. Conf. (GLOBECOM), Dec. 2016, pp. 1–7.

[8]

S. Laki, G. Gombos, S. Nádas, and Z. Turányi, “Take your own share of the PIE,” in Proc. Appl. Netw. Res. Workshop (ANRW). New York, NY, USA, 2017, pp. 27–32.

[9]

S. Nádas, G. Gombos, P. Hudoba, and S. Laki, “Towards a congestion control-independent core-stateless AQM,” in Proc. Appl. Netw. Res. Workshop. New York, NY, USA, Jul. 2018, pp. 84–90.

[10]

B. Briscoeet al., “Reducing Internet latency: A survey of techniques and their merits,” IEEE Commun. Surveys Tuts., vol. 18, no. 3, pp. 2149–2196, 3rd Quart. 2016.

[11]

J. S. Mejia and C. E. Rothenberg, “Broadband network gateway implementation using a programmable data plane processor,” in Proc. 10th DCA/FEEC/Univ. Campinas (UNICAMP) Workshop (EADCA), Campinas, Brazil, 2017.

[12]

F. Kelly, “Charging and rate control for elastic traffic,” Eur. Trans. Telecommun., vol. 8, no. 1, pp. 33–37, Jan. 1997.

[13]

Y. Yi and M. Chiang, “Stochastic network utility maximisation—A tribute to Kelly’s paper published in this journal a decade ago,” Eur. Trans. Telecommun., vol. 19, no. 4, pp. 421–442, 2008.

[14]

B. K. Choi and R. Bettati, “Endpoint admission control: Network based approach,” in Proc. 21st Int. Conf. Distrib. Comput. Syst., Apr. 2001, pp. 227–235.

[15]

E. Danna, S. Mandal, and A. Singh, “A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering,” in Proc. IEEE INFOCOM, Mar. 2012, pp. 846–854.

[16]

M. Chowdhury, Y. Zhong, and I. Stoica, “Efficient coflow scheduling with varys,” in Proc. ACM Conf. SIGCOMM. New York, NY, USA, 2014, pp. 443–454.

[17]

M. Carlson, W. Weiss, S. Blake, Z. Wang, D. Black, and E. Davies, An Architecture for Differentiated Services, document RFC 2475, Internet Requests for Comments, Dec. 1998. [Online]. Available: http://www.rfc-editor.org/rfc/rfc2475.txt

[18]

A. Sivaramanet al., “Programmable packet scheduling at line rate,” in Proc. ACM SIGCOMM Conf., New York, NY, USA, 2016, pp. 44–57.

[19]

R. Mittal, R. Agarwal, S. Ratnasamy, and S. Shenker, “Universal packet scheduling,” in Proc. 14th ACM Workshop Hot Topics Netw., New York, NY, USA, 2015, pp. 24:1–24:7.

[20]

B. Zhang, X. Wan, J. Luo, and X. Shen, “A nearly optimal packet scheduling algorithm for input queued switches with deadline guarantees,” IEEE Trans. Comput., vol. 64, no. 6, pp. 1548–1563, Jun. 2015.

[21]

M. Alizadehet al., “pFabric: Minimal near-optimal datacenter transport,” in Proc. ACM SIGCOMM Comput. Commun. Rev., New York, NY, USA, 2013, pp. 435–446.

[22]

R. J. La and V. Anantharam, “Utility-based rate control in the Internet for elastic traffic,” IEEE/ACM Trans. Netw., vol. 10, no. 2, pp. 272–286, Apr. 2002.

[23]

D. Papadimitriou, M. Welzl, M. Scharf, and B. Briscoe, Open Research Issues in Internet Congestion Control, document RFC 6077, RFC Ed., Internet Requests for Comments, Feb. 2011. [Online]. Available: http://www.rfc-editor.org/rfc/rfc6077.txt

[24]

A. Espinal, R. Estrada, and C. Monsalve, “Traffic model using a novel sniffer that ensures the user data privacy,” in Proc. MATEC Web Conf., vol. 292. Les Ulis, France: EDP Sciences, 2019, p. 03002.

[25]

(2020). The Caida Ucsd Statistical Information for the Caida Anonymized Internet Traces. [Online]. Available: https://www.caida.org/data/passive/passive_trace_statistics.xml

[26]

(2018). Data Plane Developement Kit. [Online]. Available: https://dpdk.org

[27]

(2018). Dpdk Quality of Service (QOS) Framework. [Online]. Available: https://dpdk.org/doc/guides/prog_guide/qos_framework.html

[28]

(2016). The ns3 Simulator. [Online]. Available: http://www.nsnam.org/

[29]

T. R. Henderson, M. Lacage, G. F. Riley, C. Dowell, and J. Kopena, “Network simulations with the ns-3 simulator,” SIGCOMM Demonstration, vol. 14, no. 14, p. 527, Aug. 2008.

[30]

S. Ha, I. Rhee, and L. Xu, “Cubic: A new TCP-friendly high-speed TCP variant,” ACM SIGOPS Oper. Syst. Rev., vol. 42, no. 5, pp. 64–74, Jul. 2008.

[31]

H. Tazakiet al., “Direct code execution: Revisiting library OS architecture for reproducible network experiments,” in Proc. 9th ACM Conf. Emerg. Netw. Exp. Technol., New York, NY, USA, 2013, pp. 217–228.

[32]

N. Kuhn, P. Natarajan, N. Khademi, and D. Ros, Characterization Guidelines for Active Queue Management (AQM), document RFC 7928, RFC Ed., Internet Requests for Comments, Jul. 2016. [Online]. Available: http://www.rfc-editor.org/rfc/rfc7928.txt

Cited By

Huang YWang SZhu SPeng GZhang XPan THuang TZhou LCheng ZGuo DLin HZhang LLei JXu LWang WLiu XYou XLiu YSchulzrinne HKohler EMaltz DMisra V(2023)Poster: Programmable Cycle-Specified Queue for Deterministic NetworkingProceedings of the ACM SIGCOMM 2023 Conference10.1145/3603269.3610848(1132-1134)Online publication date: 10-Sep-2023
https://dl.acm.org/doi/10.1145/3603269.3610848
Kis DGombos GLaki SNádas S(2022)Resource sharing beyond FQProceedings of the SIGCOMM '22 Poster and Demo Sessions10.1145/3546037.3546045(1-3)Online publication date: 22-Aug-2022
https://dl.acm.org/doi/10.1145/3546037.3546045
Fejes FNádas SGombos GLaki S(2022)DeepQoS: Core-Stateless Hierarchical QoS in Programmable SwitchesIEEE Transactions on Network and Service Management10.1109/TNSM.2022.315201719:2(1842-1861)Online publication date: 1-Jun-2022
https://dl.acm.org/doi/10.1109/TNSM.2022.3152017

Index Terms

Core-Stateless Forwarding With QoS Revisited: Decoupling Delay and Bandwidth Requirements
1. General and reference
  1. Cross-computing tools and techniques
    1. Performance
2. Networks
  1. Network protocols
    1. Network layer protocols
  2. Network services
    1. Network management

Index terms have been assigned to the content through auto-classification.

Recommendations

Decoupling QoS control from core routers: a novel bandwidth broker architecture for scalable support of guaranteed services

For scalable support of guaranteed services that decouples the QoS control plane from the packet forwarding plane. More specifically, under this architecture, core routers do not maintain any QoS reservation states, whether per-flow or aggregate. ...
Decoupling QoS control from core routers: a novel bandwidth broker architecture for scalable support of guaranteed services
SIGCOMM '00: Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication

For scalable support of guaranteed services that decouples the QoS control plane from the packet forwarding plane. More specifically, under this architecture, core routers do not maintain any QoS reservation states, whether per-flow or aggregate. ...
A Core Stateless Bandwidth Broker Architecture for Scalable Support of Guaranteed Services

Abstract--We present a novel bandwidth broker architecture for scalable support of guaranteed services that decouples the QoS control plane from the packet forwarding plane. More specifically, under this architecture, core routers do not maintain any ...

Comments

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking

IEEE/ACM Transactions on Networking Volume 29, Issue 2

April 2021

475 pages

ISSN:1063-6692

Issue’s Table of Contents

1558-2566 © 2020 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See https://www.ieee.org/publications/rights/index.html for more information.

Publisher

IEEE Press

Publication History

Published: 15 April 2021

Published in TON Volume 29, Issue 2

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
57
Total Downloads

Downloads (Last 12 months)8
Downloads (Last 6 weeks)1

Reflects downloads up to 13 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

Huang YWang SZhu SPeng GZhang XPan THuang TZhou LCheng ZGuo DLin HZhang LLei JXu LWang WLiu XYou XLiu YSchulzrinne HKohler EMaltz DMisra V(2023)Poster: Programmable Cycle-Specified Queue for Deterministic NetworkingProceedings of the ACM SIGCOMM 2023 Conference10.1145/3603269.3610848(1132-1134)Online publication date: 10-Sep-2023
https://dl.acm.org/doi/10.1145/3603269.3610848
Kis DGombos GLaki SNádas S(2022)Resource sharing beyond FQProceedings of the SIGCOMM '22 Poster and Demo Sessions10.1145/3546037.3546045(1-3)Online publication date: 22-Aug-2022
https://dl.acm.org/doi/10.1145/3546037.3546045
Fejes FNádas SGombos GLaki S(2022)DeepQoS: Core-Stateless Hierarchical QoS in Programmable SwitchesIEEE Transactions on Network and Service Management10.1109/TNSM.2022.315201719:2(1842-1861)Online publication date: 1-Jun-2022
https://dl.acm.org/doi/10.1109/TNSM.2022.3152017

View Options

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents