{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T14:48:13Z","timestamp":1758638893057,"version":"3.28.0"},"reference-count":52,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,7,1]],"date-time":"2020-07-01T00:00:00Z","timestamp":1593561600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020,7]]},"DOI":"10.1109\/iscc50000.2020.9219693","type":"proceedings-article","created":{"date-parts":[[2020,10,12]],"date-time":"2020-10-12T21:03:51Z","timestamp":1602536631000},"page":"1-7","source":"Crossref","is-referenced-by-count":5,"title":["On the Robustness of Deep Learning-predicted Contention Models for Network Calculus"],"prefix":"10.1109","author":[{"given":"Fabien","family":"Geyer","sequence":"first","affiliation":[]},{"given":"Steffen","family":"Bondorf","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","article-title":"Message-passing neural networks learn little’s law","author":"rusek","year":"2018","journal-title":"IEEE Communications Letters"},{"key":"ref38","article-title":"Gated graph sequence neural networks","author":"li","year":"2016","journal-title":"Proc of ICLR"},{"key":"ref33","article-title":"Graph attention networks","author":"veli?kovi?","year":"2018","journal-title":"Proc of ICLR"},{"key":"ref32","article-title":"Neural message passing for quantum chemistry","author":"gilmer","year":"2017","journal-title":"Proc of NIPS"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TNN.2008.2005605"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/IJCNN.2005.1555942"},{"key":"ref37","article-title":"Learning a SAT solver from single-bit supervision","author":"selsam","year":"2018","journal-title":"arxiv 1802 03685"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014731"},{"key":"ref35","article-title":"Convolutional networks on graphs for learning molecular fingerprints","author":"duvenaud","year":"2015","journal-title":"Proc of NIPS"},{"key":"ref34","article-title":"Relational inductive biases, deep learning, and graph networks","author":"battaglia","year":"2018","journal-title":"arXiv 1806 01261"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737496"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/3084453"},{"key":"ref29","article-title":"ML + FV = ?? A survey on the application of machine learning to formal verification","author":"amrani","year":"2018","journal-title":"arxiv 1806 03600"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/WFCS.2016.7496501"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2016.7402269"},{"key":"ref20","article-title":"Improving performance bounds in feed-forward networks by paying multiplexing only once","author":"schmitt","year":"2008","journal-title":"Proc GI\/ITG MMB"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-43425-4_15"},{"key":"ref21","article-title":"Optimal routing for end-to-end guarantees using network calculus","author":"bouillard","year":"2015","journal-title":"Performance Evaluation"},{"key":"ref24","article-title":"Improving cross-traffic bounds in feedforward networks – there is a job for everyone","author":"bondorf","year":"2016","journal-title":"Proc GI\/ITG MMB & DFT"},{"key":"ref23","article-title":"Worst-case timing analysis of ring networks with cyclic dependencies using network calculus","author":"amari","year":"2016","journal-title":"Proc of IEEE RTCSA"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5461912"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-74947-1_15"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1023\/A:1010933404324"},{"article-title":"Model class reliance: Variable importance measures for any machine learning model class, from the ”rashomon\" perspective","year":"2018","author":"fisher","key":"ref51"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2008.228"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2011.5935002"},{"journal-title":"Network Calculus A Theory of Deterministic Queuing Systems for the Internet","year":"2001","author":"le boudec","key":"ref11"},{"key":"ref40","article-title":"Performance evaluation of network topologies using graphbased deep learning","author":"geyer","year":"2017","journal-title":"Proc of EAI ValueTools"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ICVES.2012.6294261"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/2659787.2659810"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2018.2875191"},{"article-title":"Modelling in network calculus a TSN architecture mixing time-triggered, credit based shaper and besteffort queues","year":"2018","author":"daigmorte","key":"ref15"},{"key":"ref16","article-title":"The DiscoDNC v2 – a comprehensive tool for deterministic network calculus","author":"bondorf","year":"2014","journal-title":"Proc of EAI ValueTools"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/DASC.2017.8102106"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2699865"},{"key":"ref19","article-title":"Pay-burst-only-once in realtime calculus","author":"tang","year":"2019","journal-title":"Proc of IEEE RTCSA"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ETFA.2019.8869365"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/WFCS.2018.8402346"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-36480-3_2"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/ETFA.2019.8869053"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2014.2332071"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-012-9153-1"},{"key":"ref49","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":"erdos","year":"1959","journal-title":"Publicationes Mathematicae"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.peva.2005.07.004"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3356401.3356409"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/WFCS.2019.8757948"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s10626-007-0028-x"},{"key":"ref47","article-title":"Gnnexplainer: Generating explanations for graph neural networks","author":"ying","year":"2019","journal-title":"Proc NeurIPS"},{"article-title":"RouteNet: Leveraging Graph Neural Networks for network modeling and optimization in SDN","year":"2019","author":"rusek","key":"ref42"},{"key":"ref41","article-title":"DeepComNet: Performance evaluation of network topologies using graph-based deep learning","author":"geyer","year":"2018","journal-title":"Performance Evaluation"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ITC30.2018.10060"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3229607.3229610"}],"event":{"name":"2020 IEEE Symposium on Computers and Communications (ISCC)","start":{"date-parts":[[2020,7,7]]},"location":"Rennes, France","end":{"date-parts":[[2020,7,10]]}},"container-title":["2020 IEEE Symposium on Computers and Communications (ISCC)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9213178\/9219543\/09219693.pdf?arnumber=9219693","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,11,23]],"date-time":"2022-11-23T01:47:14Z","timestamp":1669168034000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9219693\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,7]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/iscc50000.2020.9219693","relation":{},"subject":[],"published":{"date-parts":[[2020,7]]}}}