{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,16]],"date-time":"2026-02-16T10:09:39Z","timestamp":1771236579428,"version":"3.50.1"},"reference-count":59,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2024,11,18]],"date-time":"2024-11-18T00:00:00Z","timestamp":1731888000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2024,11,30]]},"abstract":"<jats:p>\n            Network Function Virtualization (NFV) is a promising technology that can transform how internet service providers deliver their services. However, recent studies have identified several challenges in adopting NFV. Two key challenges are central to the operation and capacity planning of NFV Data Centers (DCs): (i)\n            <jats:italic>Service Function Chain (SFC) realization<\/jats:italic>\n            \u2014determining if a new request with a known profile can be accommodated\u2014and (ii)\n            <jats:italic>Network Function Virtualization (NFV) traffic bounds estimation<\/jats:italic>\n            \u2014estimating the total traffic that a data center can handle considering all service requests and their performance constraints. To address these challenges, we propose a model that leverages stochastic network calculus to effectively dimension an NFV DC while ensuring delay and availability bounds for all service requests. Our theoretical model provides a mathematical framework to assess the realization of a single SFC request without delving into the specifics of the realization process. We utilize established availability-aware Virtual Network Function (VNF) placement patterns to obtain traffic bounds essential to planning data center capacity. We analyze NFV data center traffic under various scenarios over a Fat-tree DC topology. The results demonstrate that data center capacity is significantly influenced by the VNF placement strategy. Additionally, for data centers hosting latency-sensitive services, Service Level Objective (SLO) constraints on availability and delay are crucial in determining the number of such requests that can be accommodated.\n          <\/jats:p>","DOI":"10.1145\/3700440","type":"journal-article","created":{"date-parts":[[2024,10,11]],"date-time":"2024-10-11T11:36:11Z","timestamp":1728646571000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["A Network Calculus Model for SFC Realization and Traffic Bounds Estimation in Data Centers"],"prefix":"10.1145","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0344-4937","authenticated-orcid":false,"given":"Sidharth","family":"Sharma","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology Indore, Indore, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4434-6340","authenticated-orcid":false,"given":"Admela","family":"Jukan","sequence":"additional","affiliation":[{"name":"Institute of Computer and Network Engineering, Technische Universit\u00e4t Braunschweig, Braunschweig, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-7272-2773","authenticated-orcid":false,"given":"Aashi","family":"Malik","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5180-5202","authenticated-orcid":false,"given":"Ashwin","family":"Gumaste","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology Bombay, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,11,18]]},"reference":[{"key":"e_1_3_5_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402967"},{"key":"e_1_3_5_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2023.3280944"},{"key":"e_1_3_5_4_2","unstructured":"Bartosz Bogdanski. 2015. System and Method for Providing Deadlock Free Routing between Switches in a Fat-tree Topology (April 21 2015). US Patent 9 014 201."},{"key":"e_1_3_5_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2906874"},{"key":"e_1_3_5_6_2","volume-title":"Performance Guarantees in Communication Networks","author":"Chang Cheng-Shang","year":"2012","unstructured":"Cheng-Shang Chang. 2012. Performance Guarantees in Communication Networks. Springer Science & Business Media."},{"key":"e_1_3_5_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2020.3038783"},{"key":"e_1_3_5_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2020.3048033"},{"key":"e_1_3_5_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/TGCN.2023.3317927"},{"key":"e_1_3_5_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935003"},{"key":"e_1_3_5_11_2","doi-asserted-by":"publisher","DOI":"10.1201\/9781315208787"},{"key":"e_1_3_5_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/NETSOFT.2018.8460068"},{"key":"e_1_3_5_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3477046"},{"key":"e_1_3_5_14_2","article-title":"ETSI NFV management and orchestration-An overview","volume":"88","author":"Ersue Mehmet","year":"2013","unstructured":"Mehmet Ersue. 2013. ETSI NFV management and orchestration-An overview. Present. IETF 88 (2013).","journal-title":"Present. IETF"},{"key":"e_1_3_5_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3095935"},{"key":"e_1_3_5_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/IWQOS.2006.250477"},{"key":"e_1_3_5_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/COMST.2014.2337060"},{"key":"e_1_3_5_18_2","doi-asserted-by":"publisher","DOI":"10.1016\/0166-5316(93)90035-S"},{"key":"e_1_3_5_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/OJCOMS.2020.2966689"},{"key":"e_1_3_5_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/2382553.2382556"},{"key":"e_1_3_5_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2017.2685084"},{"key":"e_1_3_5_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2895226"},{"key":"e_1_3_5_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.1986.1146393"},{"key":"e_1_3_5_24_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.820252"},{"key":"e_1_3_5_25_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2800400"},{"key":"e_1_3_5_26_2","doi-asserted-by":"publisher","DOI":"10.1145\/1151659.1159929"},{"key":"e_1_3_5_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485832"},{"key":"e_1_3_5_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2019.2936505"},{"key":"e_1_3_5_29_2","doi-asserted-by":"publisher","DOI":"10.1145\/3565483"},{"key":"e_1_3_5_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.2970048"},{"key":"e_1_3_5_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2023.3282156"},{"key":"e_1_3_5_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/WCNC57260.2024.10570618"},{"key":"e_1_3_5_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2019.2945127"},{"key":"e_1_3_5_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2022.3148006"},{"key":"e_1_3_5_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2019.2894304"},{"key":"e_1_3_5_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/TMC.2024.3356443"},{"key":"e_1_3_5_37_2","volume-title":"1st IEEE Conference on Network Softwarization (NetSoft\u201915)","year":"2015","unstructured":"Rashid Mijumbi, Joan Serrat, Juan-Luis Gorricho, Niels Bouten, Filip De Turck, and Steven Davy. 2015. Design and evaluation of algorithms for mapping and scheduling of virtual network functions. In 1st IEEE Conference on Network Softwarization (NetSoft\u201915)."},{"key":"e_1_3_5_38_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2022.3147146"},{"key":"e_1_3_5_39_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.7588276"},{"key":"e_1_3_5_40_2","article-title":"RIFT: Routing in fat trees","author":"Przygienda Tony","year":"2018","unstructured":"Tony Przygienda, Alankar Sharma, Pascal Thubert, Bruno Rijsman, and Dmitry Afanasiev. 2018. RIFT: Routing in fat trees. Draft-przygienda-rift-05 (2018).","journal-title":"Draft-przygienda-rift-05"},{"key":"e_1_3_5_41_2","doi-asserted-by":"crossref","unstructured":"Jens B. Schmitt Frank A. Zdarsky and Markus Fidler. 2008. Delay bounds under arbitrary multiplexing: When network calculus leaves you in the lurch.... In IEEE INFOCOM 2008-The 27th Conference on Computer Communications. IEEE 1669\u20131677.","DOI":"10.1109\/INFOCOM.2008.228"},{"key":"e_1_3_5_42_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3005287"},{"key":"e_1_3_5_43_2","doi-asserted-by":"publisher","DOI":"10.1109\/NFV-SDN50289.2020.9289877"},{"key":"e_1_3_5_44_2","doi-asserted-by":"publisher","DOI":"10.1109\/DRCN48652.2020.1570611001"},{"key":"e_1_3_5_45_2","doi-asserted-by":"publisher","DOI":"10.1145\/2829988.2787508"},{"key":"e_1_3_5_46_2","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098826"},{"key":"e_1_3_5_47_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2023.06.007"},{"key":"e_1_3_5_48_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2019.2948725"},{"key":"e_1_3_5_49_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3137418"},{"key":"e_1_3_5_50_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2023.3265127"},{"key":"e_1_3_5_51_2","doi-asserted-by":"publisher","DOI":"10.4108\/valuetools.2012.250347"},{"key":"e_1_3_5_52_2","first-page":"240","volume-title":"IEEE Conference on Network Function Virtualization and Software Defined Networks","author":"Wang Hao","year":"2016","unstructured":"Hao Wang and Jens Schmitt. 2016. Load balancing\u2014Towards balanced delay guarantees in NFV\/SDN. In IEEE Conference on Network Function Virtualization and Software Defined Networks. 240\u2013245."},{"key":"e_1_3_5_53_2","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2018.8624130"},{"key":"e_1_3_5_54_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2020.2978910"},{"key":"e_1_3_5_55_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2021.3051903"},{"key":"e_1_3_5_56_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2017.233"},{"key":"e_1_3_5_57_2","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2021.3065147"},{"key":"e_1_3_5_58_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2018.2874524"},{"key":"e_1_3_5_59_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2019.2927339"},{"key":"e_1_3_5_60_2","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2023.3242321"}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3700440","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3700440","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:38Z","timestamp":1750295858000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3700440"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,11,18]]},"references-count":59,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,11,30]]}},"alternative-id":["10.1145\/3700440"],"URL":"https:\/\/doi.org\/10.1145\/3700440","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"value":"1533-5399","type":"print"},{"value":"1557-6051","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,11,18]]},"assertion":[{"value":"2024-05-19","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-09-22","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-11-18","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}