Skip to main content
Erschienen in: Journal of Network and Systems Management 4/2022

01.10.2022

High Capacity and Resilient Large-Scale Deterministic IP Networks

verfasst von: Vincent Angilella, Filip Krasniqi, Paolo Medagliani, Sebastien Martin, Jérémie Leguay, Ren Shoushou, Liu Xuan

Erschienen in: Journal of Network and Systems Management | Ausgabe 4/2022

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config
loading …

Abstract

With 5G networking, deterministic guarantees are emerging as a key enabler. In this context, we present a scalable architecture for Large-scale Deterministic IP Networks (LDN) that meets end-to-end latency and jitter bounds. This work extends the original LDN (Liu et al. in IFIP Networking, 2021) architecture, where flows are shaped at ingress gateways and scheduled for transmission at each link using an asynchronous and cyclic opening of gate-controlled queues. To further optimize the utilization of bandwidth and accept more traffic, our Advanced-LDN (A-LDN) architecture introduces a new shaping mechanism based on transmission patterns. To protect flows against failures, we also implement Frame Replication and Elimination for Reliability (FRER). To do so, we leverage on the A-LDN mechanism for traffic scheduling and activate it at core nodes, i.e., adding the possibility for additional shifts inside core nodes, so that replicas can arrive at destination at the same time. In any case, the network remains stateless (no per-flow states at core nodes), ensuring scalability over large-scale networks. For the control plane, we present variants of a column generation algorithm to quickly take admission control decisions and maximize traffic acceptance. For a set of flows, it determines acceptance and selects the best shaping parameters, routing policy, transmission patterns, and scheduling. Through numerical results and packet level simulations in OMNeT++, we demonstrate that our A-LDN architecture with transmission patterns improves traffic acceptance by up to 67% compared to the original LDN architecture. We also demonstrate that FRER can be efficiently supported at the cost of some extra bandwidth utilization.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Fußnoten
1
We manually set the simulation duration to achieve a 95% confidence interval of having a maximum error of 0.001 when estimating the packet error rate in the random scenario.
 
Literatur
1.
Zurück zum Zitat Liu, B., Ren, S., Wang, C., Angilella, V., Medagliani, P., Martin, S., Leguay, J.: Towards Large-Scale Deterministic IP Networks. In: IFIP Networking (2021) Liu, B., Ren, S., Wang, C., Angilella, V., Medagliani, P., Martin, S., Leguay, J.: Towards Large-Scale Deterministic IP Networks. In: IFIP Networking (2021)
2.
Zurück zum Zitat Parvez, I., Rahmati, A., Guvenc, I., Sarwat, A.I., Dai, H.: A survey on low latency towards 5G: RAN, core network and caching solutions. IEEE Commun. Surv. Tutor. 20, 4 (2018)CrossRef Parvez, I., Rahmati, A., Guvenc, I., Sarwat, A.I., Dai, H.: A survey on low latency towards 5G: RAN, core network and caching solutions. IEEE Commun. Surv. Tutor. 20, 4 (2018)CrossRef
4.
Zurück zum Zitat Li, R.: Towards a New Internet for the Year 2030 and Beyond. Proc. 3rd Annual ITU IMT-2020/5G Workshop Demo Day (2018) Li, R.: Towards a New Internet for the Year 2030 and Beyond. Proc. 3rd Annual ITU IMT-2020/5G Workshop Demo Day (2018)
5.
Zurück zum Zitat Nasrallah, A., Balasubramanian, V., Thyagaturu, A.S., Reisslein, M., Elbakoury, H.: Cyclic Queuing and Forwarding for Large Scale Deterministic Networks: A Survey. ArXiv abs/1905.08478 (2019) Nasrallah, A., Balasubramanian, V., Thyagaturu, A.S., Reisslein, M., Elbakoury, H.: Cyclic Queuing and Forwarding for Large Scale Deterministic Networks: A Survey. ArXiv abs/1905.08478 (2019)
6.
Zurück zum Zitat Deterministic Networking Architecture. RFC 8655 (2019) Deterministic Networking Architecture. RFC 8655 (2019)
7.
Zurück zum Zitat Qiang, L., Geng, X., Liu, B., Eckert, T., Geng, L., Li, G.: Large-Scale Deterministic IP Network. IETF Draft draft-qiang-detnet-large-scale-detnet-05 (September 2019) Qiang, L., Geng, X., Liu, B., Eckert, T., Geng, L., Li, G.: Large-Scale Deterministic IP Network. IETF Draft draft-qiang-detnet-large-scale-detnet-05 (September 2019)
9.
Zurück zum Zitat Varga, A., Hornig, R.: An overview of the omnet++ simulation environment. In: Proc. Simutools (2008) Varga, A., Hornig, R.: An overview of the omnet++ simulation environment. In: Proc. Simutools (2008)
10.
Zurück zum Zitat Quan, W., Yan, J., Jiang, X., Sun, Z.: On-line traffic scheduling optimization in ieee 802.1 qch based time-sensitive networks. In: Prox. IEEE HPCC (2020) Quan, W., Yan, J., Jiang, X., Sun, Z.: On-line traffic scheduling optimization in ieee 802.1 qch based time-sensitive networks. In: Prox. IEEE HPCC (2020)
13.
Zurück zum Zitat Chen, M., Geng, X., Li, Z.: Segment Routing (SR) Based Bounded Latency. Internet-Draft draft-chen-detnet-sr-based-bounded-latency-00, Internet Engineering Task Force (October 2018) Chen, M., Geng, X., Li, Z.: Segment Routing (SR) Based Bounded Latency. Internet-Draft draft-chen-detnet-sr-based-bounded-latency-00, Internet Engineering Task Force (October 2018)
14.
Zurück zum Zitat Krolikowski, J., Martin, S., Medagliani, P., Leguay, J., Chen, S., Chang, X., Geng, X.: Joint routing and scheduling for large-scale deterministic ip networks. Comput. Commun. 165, 33–42 (2021)CrossRef Krolikowski, J., Martin, S., Medagliani, P., Leguay, J., Chen, S., Chang, X., Geng, X.: Joint routing and scheduling for large-scale deterministic ip networks. Comput. Commun. 165, 33–42 (2021)CrossRef
15.
Zurück zum Zitat Huang, Y., Wang, S., Feng, T., Wang, J., Huang, T., Huo, R., Liu, Y.: Towards network-wide scheduling for cyclic traffic in ip-based deterministic networks. In: 2021 4th International Conference on Hot Information-Centric Networking (HotICN), pp. 117–122 (2021). IEEE Huang, Y., Wang, S., Feng, T., Wang, J., Huang, T., Huo, R., Liu, Y.: Towards network-wide scheduling for cyclic traffic in ip-based deterministic networks. In: 2021 4th International Conference on Hot Information-Centric Networking (HotICN), pp. 117–122 (2021). IEEE
17.
Zurück zum Zitat Casazza, M., Ceselli, A.: Optimization algorithms for resilient path selection in networks. Comput. Oper. Res. 128, 105191 (2021)MathSciNetCrossRef Casazza, M., Ceselli, A.: Optimization algorithms for resilient path selection in networks. Comput. Oper. Res. 128, 105191 (2021)MathSciNetCrossRef
18.
Zurück zum Zitat Oki, E., Matsuura, N., Shiomoto, K., Yamanaka, N.: A disjoint path selection scheme with shared risk link groups in gmpls networks. IEEE Commun. Lett. 6(9), 406–408 (2002)CrossRef Oki, E., Matsuura, N., Shiomoto, K., Yamanaka, N.: A disjoint path selection scheme with shared risk link groups in gmpls networks. IEEE Commun. Lett. 6(9), 406–408 (2002)CrossRef
19.
Zurück zum Zitat Silva, J., Gomes, T., Fernandes, L., Simoes, C., Craveirinha, J.: An heuristic for maximally srlg-disjoint path pairs calculation. In: 2011 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), pp. 1–8 (2011). IEEE Silva, J., Gomes, T., Fernandes, L., Simoes, C., Craveirinha, J.: An heuristic for maximally srlg-disjoint path pairs calculation. In: 2011 3rd International Congress on Ultra Modern Telecommunications and Control Systems and Workshops (ICUMT), pp. 1–8 (2011). IEEE
20.
Zurück zum Zitat Nasrallah, A., Balasubramanian, V., Thyagaturu, A., Reisslein, M., ElBakoury, H.: Large scale deterministic networking: A simulation evaluation. arXiv preprint arXiv:1910.00162 (2019) Nasrallah, A., Balasubramanian, V., Thyagaturu, A., Reisslein, M., ElBakoury, H.: Large scale deterministic networking: A simulation evaluation. arXiv preprint arXiv:​1910.​00162 (2019)
21.
Zurück zum Zitat Addanki, V., Iannone, L.: Moving a step forward in the quest for deterministic networks (detnet). In: IEEE/IFIP Networking (2020) Addanki, V., Iannone, L.: Moving a step forward in the quest for deterministic networks (detnet). In: IEEE/IFIP Networking (2020)
22.
Zurück zum Zitat Ergenç, D., Fischer, M.: Implementation and orchestration of ieee 802.1 cb frer in omnet++. In: 2021 IEEE International Conference on Communications Workshops (ICC Workshops), pp. 1–6 (2021). IEEE Ergenç, D., Fischer, M.: Implementation and orchestration of ieee 802.1 cb frer in omnet++. In: 2021 IEEE International Conference on Communications Workshops (ICC Workshops), pp. 1–6 (2021). IEEE
23.
Zurück zum Zitat Le Boudec, J.-Y., Thiran, P. (eds.): Network Calculus, pp. 3–81. Springer, Berlin (2001) Le Boudec, J.-Y., Thiran, P. (eds.): Network Calculus, pp. 3–81. Springer, Berlin (2001)
24.
Zurück zum Zitat Eckert, T., Bryant, S., Malis, A.G.: Deterministic Networking (DetNet) Data Plane - MPLS TC Tagging for Cyclic Queuing and Forwarding (MPLS-TC TCQF). Internet-Draft draft-eckert-detnet-mpls-tc-tcqf-01, Internet Engineering Task Force (October 2021) Eckert, T., Bryant, S., Malis, A.G.: Deterministic Networking (DetNet) Data Plane - MPLS TC Tagging for Cyclic Queuing and Forwarding (MPLS-TC TCQF). Internet-Draft draft-eckert-detnet-mpls-tc-tcqf-01, Internet Engineering Task Force (October 2021)
29.
Zurück zum Zitat Finn, N.: Failure rates and P802.1CB (2013) Finn, N.: Failure rates and P802.1CB (2013)
30.
Zurück zum Zitat Desaulniers, G., Desrosiers, J., Solomon, M.M.: Column Generation. Cahiers du GERAD. Springer, Berlin (2005) Desaulniers, G., Desrosiers, J., Solomon, M.M.: Column Generation. Cahiers du GERAD. Springer, Berlin (2005)
31.
Zurück zum Zitat Wilhelm, W.E.: A technical review of column generation in integer programming. Optim. Eng. 2(2), 159–200 (2001)MathSciNetCrossRef Wilhelm, W.E.: A technical review of column generation in integer programming. Optim. Eng. 2(2), 159–200 (2001)MathSciNetCrossRef
32.
Zurück zum Zitat Juttner, A., Szviatovski, B., Mecs, I., Rajko, Z.: Lagrange relaxation based method for the qos routing problem. In: Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society, vol. 2, pp. 859–8682 (2001). https://doi.org/10.1109/INFCOM.2001.916277 Juttner, A., Szviatovski, B., Mecs, I., Rajko, Z.: Lagrange relaxation based method for the qos routing problem. In: Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society, vol. 2, pp. 859–8682 (2001). https://​doi.​org/​10.​1109/​INFCOM.​2001.​916277
33.
Zurück zum Zitat Yen, J.Y.: An algorithm for finding the shortest routes from all source nodes to a given destination in general networks. Q. Appl. Math. 27(4), 526–530 (1970)MathSciNetCrossRef Yen, J.Y.: An algorithm for finding the shortest routes from all source nodes to a given destination in general networks. Q. Appl. Math. 27(4), 526–530 (1970)MathSciNetCrossRef
34.
Zurück zum Zitat Mészáros, L., Varga, A., Kirsche, M.: In: Virdis, A., Kirsche, M. (eds.) INET Framework, pp. 55–106. Springer, Cham (2019) Mészáros, L., Varga, A., Kirsche, M.: In: Virdis, A., Kirsche, M. (eds.) INET Framework, pp. 55–106. Springer, Cham (2019)
Metadaten
Titel
High Capacity and Resilient Large-Scale Deterministic IP Networks
verfasst von
Vincent Angilella
Filip Krasniqi
Paolo Medagliani
Sebastien Martin
Jérémie Leguay
Ren Shoushou
Liu Xuan
Publikationsdatum
01.10.2022
Verlag
Springer US
Erschienen in
Journal of Network and Systems Management / Ausgabe 4/2022
Print ISSN: 1064-7570
Elektronische ISSN: 1573-7705
DOI
https://doi.org/10.1007/s10922-022-09683-3

Weitere Artikel der Ausgabe 4/2022

Journal of Network and Systems Management 4/2022 Zur Ausgabe

Premium Partner