{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,23]],"date-time":"2026-04-23T14:55:06Z","timestamp":1776956106092,"version":"3.51.4"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"1","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"German-French Academy"},{"name":"Carl-Zeiss Foundation Fellowship"},{"DOI":"10.13039\/501100003579","name":"University of Toronto","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003579","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Netw. Sci. Eng."],"published-print":{"date-parts":[[2021,1,1]]},"DOI":"10.1109\/tnse.2020.3025806","type":"journal-article","created":{"date-parts":[[2020,9,22]],"date-time":"2020-09-22T23:16:48Z","timestamp":1600816608000},"page":"75-88","source":"Crossref","is-referenced-by-count":10,"title":["Graph-Based Deep Learning for Fast and Tight Network Calculus Analyses"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6522-4385","authenticated-orcid":false,"given":"Fabien","family":"Geyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0483-5107","authenticated-orcid":false,"given":"Steffen","family":"Bondorf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.23919\/IFIPNetworking.2018.8697023"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8056981"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848183"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2014.6848129"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1064212.1064251"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0459-9"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOTS.2016.9"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2013.40"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2000.858698"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218532"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"key":"ref62","first-page":"2826","article-title":"Scikit-learn: Machine learning in Python","volume":"12","author":"pedregosa","year":"2011","journal-title":"J Mach Learn Res"},{"key":"ref61","first-page":"1","article-title":"All models are wrong, but many are useful: Learning a variable’s importance by studying an entire class of prediction models simultaneously","volume":"20","author":"fisher","year":"2019"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ETFA.2016.7733565"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1561\/1300000059"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/1629335.1629351"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2013.6831269"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.7402269"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2005.1555942"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/3150928.3150941"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.4108\/icst.valuetools.2014.258167"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC50000.2020.9219693"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/CAMAD.2018.8514938"},{"key":"ref26","first-page":"1833","article-title":"A (min, ×) network calculus for multi-hop fading channels","author":"zubaidy","year":"0","journal-title":"Proc IEEE InfoCom"},{"key":"ref25","first-page":"108561","article-title":"Survey on learning-based formal methods: Taxonomy, applications and possible future directions","volume":"8","year":"2020"},{"key":"ref50","first-page":"274","article-title":"Message-passing neural networks learn Little’s law","volume":"23","author":"rusek","year":"0"},{"key":"ref51","first-page":"1","article-title":"DeepComNet: Performance evaluation of network topologies using graph-based deep learning","volume":"130","author":"geyer","year":"2018","journal-title":"Elsevier Perform Eval"},{"key":"ref59","doi-asserted-by":"crossref","first-page":"290","DOI":"10.5486\/PMD.1959.6.3-4.12","article-title":"On random graphs. i","volume":"6","author":"erd?s","year":"1959","journal-title":"Publicationes Mathematicae"},{"key":"ref58","first-page":"8024","article-title":"PyTorch: An imperative style, high-performance deep learning library","author":"paszke","year":"0","journal-title":"Proc Adv Conf Neural Inf Process Syst 32"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.4108\/eai.14-12-2015.2262565"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16558-0_14"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.813040"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/ITC30.2018.10060"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/ICOIN48656.2020.9016603"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3000405"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-39939-9_1"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737496"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TNSE.2018.2876918"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/18.61109"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/18.61110"},{"key":"ref14","author":"boudec","year":"2001","journal-title":"Network Calculus A Theory of Deterministic Queuing Systems for the Internet"},{"key":"ref15","first-page":"1","article-title":"Improving performance bounds in feed-forward networks by paying multiplexing only once","author":"schmitt","year":"0","journal-title":"Proc Conf Meas Modell Eval Comput Commun Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.228"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5461912"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2332071"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/3084453"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2017.2755769"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1155\/2015\/851608"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.4108\/icst.valuetools.2011.245735"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2015.7218387"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566740"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2670979.2671008"},{"key":"ref49","first-page":"1","article-title":"Learning a SAT solver from single-bit supervision","author":"selsam","year":"0"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787479"},{"key":"ref46","article-title":"Relational inductive biases, deep learning, and graph networks","author":"battaglia","year":"0","journal-title":"arXiv 1806 01261"},{"key":"ref45","first-page":"1","article-title":"Graph attention networks","author":"veli?kovi?","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014731"},{"key":"ref47","first-page":"2224","article-title":"Convolutional networks on graphs for learning molecular fingerprints","author":"duvenaud","year":"0","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref42","first-page":"1","article-title":"Gated graph sequence neural networks","author":"li","year":"0","journal-title":"Proc Int Conf Learn Representations"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref44","first-page":"1263","article-title":"Neural message passing for quantum chemistry","author":"gilmer","year":"0","journal-title":"Proc Neural Inf Process Syst"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.3115\/v1\/D14-1179"}],"container-title":["IEEE Transactions on Network Science and Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6488902\/9380808\/09204456.pdf?arnumber=9204456","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,8]],"date-time":"2023-10-08T00:04:54Z","timestamp":1696723494000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9204456\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,1,1]]},"references-count":62,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.1109\/tnse.2020.3025806","relation":{},"ISSN":["2327-4697","2334-329X"],"issn-type":[{"value":"2327-4697","type":"electronic"},{"value":"2334-329X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,1,1]]}}}