{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T11:30:12Z","timestamp":1780054212975,"version":"3.54.0"},"reference-count":35,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T00:00:00Z","timestamp":1661212800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T00:00:00Z","timestamp":1661212800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Netw Syst Manage"],"published-print":{"date-parts":[[2022,10]]},"DOI":"10.1007\/s10922-022-09683-3","type":"journal-article","created":{"date-parts":[[2022,8,23]],"date-time":"2022-08-23T08:03:15Z","timestamp":1661241795000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["High Capacity and Resilient Large-Scale Deterministic IP Networks"],"prefix":"10.1007","volume":"30","author":[{"given":"Vincent","family":"Angilella","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Filip","family":"Krasniqi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paolo","family":"Medagliani","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sebastien","family":"Martin","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J\u00e9r\u00e9mie","family":"Leguay","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ren","family":"Shoushou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Liu","family":"Xuan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2022,8,23]]},"reference":[{"key":"9683_CR1","doi-asserted-by":"crossref","unstructured":"Liu, B., Ren, S., Wang, C., Angilella, V., Medagliani, P., Martin, S., Leguay, J.: Towards Large-Scale Deterministic IP Networks. In: IFIP Networking (2021)","DOI":"10.23919\/IFIPNetworking52078.2021.9472798"},{"key":"9683_CR2","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1109\/COMST.2018.2841349","volume":"20","author":"I Parvez","year":"2018","unstructured":"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)","journal-title":"IEEE Commun. Surv. Tutor."},{"key":"9683_CR3","doi-asserted-by":"publisher","unstructured":"Grossman, E.: Deterministic Networking Use Cases. RFC Editor (2019). https:\/\/doi.org\/10.17487\/RFC8578. https:\/\/rfc-editor.org\/rfc\/rfc8578.txt","DOI":"10.17487\/RFC8578"},{"key":"9683_CR4","unstructured":"Li, R.: Towards a New Internet for the Year 2030 and Beyond. Proc. 3rd Annual ITU IMT-2020\/5G Workshop Demo Day (2018)"},{"key":"9683_CR5","unstructured":"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)"},{"key":"9683_CR6","unstructured":"Deterministic Networking Architecture. RFC 8655 (2019)"},{"key":"9683_CR7","unstructured":"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)"},{"key":"9683_CR8","doi-asserted-by":"publisher","unstructured":"IEEE Standard for Local and metropolitan area networks\u2013Frame Replication and Elimination for Reliability. IEEE Std 802.1CB-2017, 1\u2013102 (2017). https:\/\/doi.org\/10.1109\/IEEESTD.2017.8091139","DOI":"10.1109\/IEEESTD.2017.8091139"},{"key":"9683_CR9","doi-asserted-by":"crossref","unstructured":"Varga, A., Hornig, R.: An overview of the omnet++ simulation environment. In: Proc. Simutools (2008)","DOI":"10.4108\/ICST.SIMUTOOLS2008.3027"},{"key":"9683_CR10","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1109\/HPCC-SmartCity-DSS50907.2020.00045"},{"key":"9683_CR11","doi-asserted-by":"publisher","unstructured":"M\u00e1t\u00e9, M., Simon, C., Maliosz, M.: Asynchronous Time-Aware Shaper for Time-Sensitive Networking. In: 2021 17th International Conference on Network and Service Management (CNSM), pp. 565\u2013571 (2021). https:\/\/doi.org\/10.23919\/CNSM52442.2021.9615545","DOI":"10.23919\/CNSM52442.2021.9615545"},{"issue":"2","key":"9683_CR12","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/MCOMSTD.2018.1700076","volume":"2","author":"N Finn","year":"2018","unstructured":"Finn, N.: Introduction to time-sensitive networking. IEEE Commun. Stand. Mag. 2(2), 22\u201328 (2018). https:\/\/doi.org\/10.1109\/MCOMSTD.2018.1700076","journal-title":"IEEE Commun. Stand. Mag."},{"key":"9683_CR13","unstructured":"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)"},{"key":"9683_CR14","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1016\/j.comcom.2020.10.016","volume":"165","author":"J Krolikowski","year":"2021","unstructured":"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\u201342 (2021)","journal-title":"Comput. Commun."},{"key":"9683_CR15","doi-asserted-by":"crossref","unstructured":"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\u2013122 (2021). IEEE","DOI":"10.1109\/HotICN53262.2021.9680843"},{"key":"9683_CR16","doi-asserted-by":"publisher","unstructured":"Ergen\u00e7, D., Fischer, M.: On the reliability of ieee 802.1cb frer. In: IEEE INFOCOM 2021 - IEEE Conference on Computer Communications, pp. 1\u201310 (2021). https:\/\/doi.org\/10.1109\/INFOCOM42981.2021.9488750","DOI":"10.1109\/INFOCOM42981.2021.9488750"},{"key":"9683_CR17","doi-asserted-by":"publisher","first-page":"105191","DOI":"10.1016\/j.cor.2020.105191","volume":"128","author":"M Casazza","year":"2021","unstructured":"Casazza, M., Ceselli, A.: Optimization algorithms for resilient path selection in networks. Comput. Oper. Res. 128, 105191 (2021)","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"9683_CR18","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1109\/LCOMM.2002.803477","volume":"6","author":"E Oki","year":"2002","unstructured":"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\u2013408 (2002)","journal-title":"IEEE Commun. Lett."},{"key":"9683_CR19","unstructured":"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\u20138 (2011). IEEE"},{"key":"9683_CR20","unstructured":"Nasrallah, A., Balasubramanian, V., Thyagaturu, A., Reisslein, M., ElBakoury, H.: Large scale deterministic networking: A simulation evaluation. arXiv preprint arXiv:1910.00162 (2019)"},{"key":"9683_CR21","unstructured":"Addanki, V., Iannone, L.: Moving a step forward in the quest for deterministic networks (detnet). In: IEEE\/IFIP Networking (2020)"},{"key":"9683_CR22","doi-asserted-by":"crossref","unstructured":"Ergen\u00e7, 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\u20136 (2021). IEEE","DOI":"10.1109\/ICCWorkshops50388.2021.9473722"},{"key":"9683_CR23","first-page":"3","volume-title":"Network Calculus","year":"2001","unstructured":"Le Boudec, J.-Y., Thiran, P. (eds.): Network Calculus, pp. 3\u201381. Springer, Berlin (2001)"},{"key":"9683_CR24","unstructured":"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)"},{"issue":"5","key":"9683_CR25","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1109\/TNET.2005.857117","volume":"13","author":"S Siachalou","year":"2005","unstructured":"Siachalou, S., Georgiadis, L.: Algorithms for precomputing constrained widest paths and multicast trees. IEEE\/ACM Trans. Netw. 13(5), 1174\u20131187 (2005). https:\/\/doi.org\/10.1109\/TNET.2005.857117","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"9683_CR26","doi-asserted-by":"publisher","unstructured":"Acharya, S., Chang, Y.J., Gupta, B., Risbood, P., Srivastava, A.: Precomputing high quality routes for bandwidth guaranteed traffic. In: IEEE Global Telecommunications Conference, 2004. GLOBECOM \u201904., vol. 2, pp. 1202\u201312072 (2004). https:\/\/doi.org\/10.1109\/GLOCOM.2004.1378146","DOI":"10.1109\/GLOCOM.2004.1378146"},{"key":"9683_CR27","doi-asserted-by":"publisher","unstructured":"Shand, M., Bryant, S.: IP Fast Reroute Framework. RFC Editor (2010). https:\/\/doi.org\/10.17487\/RFC5714. https:\/\/www.rfc-editor.org\/info\/rfc5714","DOI":"10.17487\/RFC5714"},{"key":"9683_CR28","unstructured":"Litkowski, S., Bashandy, A., Filsfils, C., Francois, P., Decraene, B., Voyer, D.: Topology Independent Fast Reroute using Segment Routing. Internet-Draft draft-ietf-rtgwg-segment-routing-ti-lfa-08, Internet Engineering Task Force (January 2022). Work in Progress. https:\/\/datatracker.ietf.org\/doc\/draft-ietf-rtgwg-segment-routing-ti-lfa\/08\/"},{"key":"9683_CR29","unstructured":"Finn, N.: Failure rates and P802.1CB (2013)"},{"key":"9683_CR30","doi-asserted-by":"crossref","unstructured":"Desaulniers, G., Desrosiers, J., Solomon, M.M.: Column Generation. Cahiers du GERAD. Springer, Berlin (2005)","DOI":"10.1007\/b135457"},{"issue":"2","key":"9683_CR31","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1023\/A:1013141227104","volume":"2","author":"WE Wilhelm","year":"2001","unstructured":"Wilhelm, W.E.: A technical review of column generation in integer programming. Optim. Eng. 2(2), 159\u2013200 (2001)","journal-title":"Optim. Eng."},{"key":"9683_CR32","doi-asserted-by":"publisher","unstructured":"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\u20138682 (2001). https:\/\/doi.org\/10.1109\/INFCOM.2001.916277","DOI":"10.1109\/INFCOM.2001.916277"},{"issue":"4","key":"9683_CR33","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1090\/qam\/253822","volume":"27","author":"JY Yen","year":"1970","unstructured":"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\u2013530 (1970)","journal-title":"Q. Appl. Math."},{"key":"9683_CR34","doi-asserted-by":"crossref","unstructured":"M\u00e9sz\u00e1ros, L., Varga, A., Kirsche, M.: In: Virdis, A., Kirsche, M. (eds.) INET Framework, pp. 55\u2013106. Springer, Cham (2019)","DOI":"10.1007\/978-3-030-12842-5_2"},{"key":"9683_CR35","unstructured":"https:\/\/research.cs.washington.edu\/networking\/rocketfuel\/"}],"container-title":["Journal of Network and Systems Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10922-022-09683-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10922-022-09683-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10922-022-09683-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,30]],"date-time":"2022-09-30T04:13:30Z","timestamp":1664511210000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10922-022-09683-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,23]]},"references-count":35,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["9683"],"URL":"https:\/\/doi.org\/10.1007\/s10922-022-09683-3","relation":{},"ISSN":["1064-7570","1573-7705"],"issn-type":[{"value":"1064-7570","type":"print"},{"value":"1573-7705","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,8,23]]},"assertion":[{"value":"1 March 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 August 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 August 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"71"}}