{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T23:06:27Z","timestamp":1729638387174,"version":"3.28.0"},"reference-count":22,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1109\/camad.2018.8514938","type":"proceedings-article","created":{"date-parts":[[2018,12,4]],"date-time":"2018-12-04T00:41:51Z","timestamp":1543884111000},"page":"1-6","source":"Crossref","is-referenced-by-count":6,"title":["The Deterministic Network Calculus Analysis: Reliability Insights and Performance Improvements"],"prefix":"10.1109","author":[{"given":"Alexander","family":"Scheffler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"Fogen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Steffen","family":"Bondorf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8056981"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1561\/1300000059"},{"key":"ref12","article-title":"Enabling rapid construction of arrival curves from execution traces","author":"carvajal","year":"2017","journal-title":"IEEE Design & Test"},{"key":"ref13","article-title":"Fast min-plus convolu- tion and deconvolution on GPUs","author":"luangsomboon","year":"2017","journal-title":"Proc of EAI ValueTools"},{"key":"ref14","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-39939-9_1","article-title":"Delay bounds in a network with aggregate scheduling","author":"charny","year":"2000","journal-title":"Proceedings of Quality of Future Internet Services"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2017.2755769"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/90.720877"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/90.836483"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12104-3_18"},{"key":"ref19","article-title":"The DiscoDNC v2 – a comprehensive tool for deterministic network calculus","author":"bondorf","year":"2014","journal-title":"Proc of EAI ValueTools"},{"key":"ref4","first-page":"16:1","article-title":"Quality and cost of deterministic network calculus - design and evaluation of an accurate and fast analysis","volume":"1","author":"bondorf","year":"2017","journal-title":"Proceedings of the ACM on Measurement and Analysis of Computing Systems (POMACS)"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2010.5461912"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1145\/2670979.2671008","article-title":"PriorityMeister: Tail latency QoS for shared networked storage","author":"zhu","year":"2014","journal-title":"Proceedings of ACM Symposium on Cloud Computing (SOCC)"},{"key":"ref5","article-title":"Catching corner cases in network calculus - flow segregation can improve accuracy","author":"bondorf","year":"2018","journal-title":"Proc GI\/ITG MMB"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10626-007-0028-x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787479"},{"journal-title":"Network Calculus A Theory of Deter- Ministic Queuing Systems for the Internet","year":"2001","author":"le boudec","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/DASC.2017.8102106"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MASCOTS.2016.9"},{"journal-title":"Real-Time Calculus (RTC) Toolbox","year":"2006","author":"wandeler","key":"ref20"},{"key":"ref22","article-title":"WOPANets: A tool for worst case perfor- mance analysis of embedded networks","author":"mifdaoui","year":"2010","journal-title":"Proc IEEE CAMAD Workshop"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.4271\/2011-01-2711","article-title":"PEGASE - a robust and efficient tool for worst-case network traversal time evaluation on AFDX","author":"boyer","year":"2011","journal-title":"SAE Technical Paper"}],"event":{"name":"2018 IEEE 23rd International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)","start":{"date-parts":[[2018,9,17]]},"location":"Barcelona","end":{"date-parts":[[2018,9,19]]}},"container-title":["2018 IEEE 23rd International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8500732\/8514932\/08514938.pdf?arnumber=8514938","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T23:55:26Z","timestamp":1720828526000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8514938\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/camad.2018.8514938","relation":{},"subject":[],"published":{"date-parts":[[2018,9]]}}}