{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:25:14Z","timestamp":1750307114957,"version":"3.41.0"},"reference-count":8,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2011,9,1]],"date-time":"2011-09-01T00:00:00Z","timestamp":1314835200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGBED Rev."],"published-print":{"date-parts":[[2011,9]]},"abstract":"<jats:p>The SpaceWire network standard is promoted by the ESA and is scheduled to be used as the sole on-board network for future satellites. This network uses a wormhole routing mechanism that can lead to packet blocking in routers and consequently to variable end-to-end delays. As the network will be shared by real-time and non real-time traffic, network designers require a tool to check that temporal constraints are verified for all the critical messages.<\/jats:p>\n          <jats:p>Network Calculus can be used for evaluating worst-case end-to-end delays. However, we first have to model SpaceWire components through the definition of service curves. In this paper, we propose a new Network Calculus element that we call the Wormhole Section. This element allows us to better model a wormhole network than the usual multiplexer and demultiplexer elements used in the context of usual Store-and-Forward networks.<\/jats:p>","DOI":"10.1145\/2038617.2038627","type":"journal-article","created":{"date-parts":[[2011,10,4]],"date-time":"2011-10-04T13:24:18Z","timestamp":1317734658000},"page":"44-47","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":21,"title":["Using Network Calculus to compute end-to-end delays in SpaceWire networks"],"prefix":"10.1145","volume":"8","author":[{"given":"Thomas","family":"Ferrandiz","sequence":"first","affiliation":[{"name":"Univ. de Toulouse, ISAE"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabrice","family":"Frances","sequence":"additional","affiliation":[{"name":"Univ. de Toulouse, ISAE"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Fraboul","sequence":"additional","affiliation":[{"name":"Univ. de Toulouse, IRIT\/ENSEEIHT-INPT"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,9]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Spacewire: A spacecraft onboard network for real-time communications,\" IEEE-NPSS Real Time Conference, no","author":"Parkes S. M.","year":"2005","unstructured":"S. M. Parkes and P. Armbruster , \" Spacewire: A spacecraft onboard network for real-time communications,\" IEEE-NPSS Real Time Conference, no . 14, Feb 2005 . S. M. Parkes and P. Armbruster, \"Spacewire: A spacecraft onboard network for real-time communications,\" IEEE-NPSS Real Time Conference, no. 14, Feb 2005."},{"volume-title":"nodes, routers and networks","year":"2008","key":"e_1_2_1_2_1","unstructured":"ECSS, \"Spacewire -- links , nodes, routers and networks .\" Aug 2008 . ECSS, \"Spacewire -- links, nodes, routers and networks.\" Aug 2008."},{"key":"e_1_2_1_3_1","volume-title":"A method of computation for worst-case delay analysis on spacewire networks,\" SIES '09","author":"Ferrandiz T.","year":"2009","unstructured":"T. Ferrandiz , F. Frances , and C. Fraboul , \" A method of computation for worst-case delay analysis on spacewire networks,\" SIES '09 , 2009 . T. Ferrandiz, F. Frances, and C. Fraboul, \"A method of computation for worst-case delay analysis on spacewire networks,\" SIES '09, 2009."},{"key":"e_1_2_1_4_1","volume-title":"LNCS 2050","author":"LeBoudec J.","year":"2004","unstructured":"J. LeBoudec and P. Thiran , \" Network calculus a theory of deterministic queuing systems for the internet,\" Springer Verlag, no . LNCS 2050 , Apr 2004 . J. LeBoudec and P. Thiran, \"Network calculus a theory of deterministic queuing systems for the internet,\" Springer Verlag, no. LNCS 2050, Apr 2004."},{"key":"e_1_2_1_5_1","volume-title":"Using network calculus to optimize the afdx network,\" ERTS","author":"Frances F.","year":"2006","unstructured":"F. Frances and C. Fraboul , \" Using network calculus to optimize the afdx network,\" ERTS 2006 , Jan 2006. F. Frances and C. Fraboul, \"Using network calculus to optimize the afdx network,\" ERTS 2006, Jan 2006."},{"key":"e_1_2_1_6_1","volume-title":"A short tutorial on network calculus. i. fundamental bounds in communication networks,\" ISCAS","author":"Boudec J. L.","year":"2000","unstructured":"J. L. Boudec and P. Thiran , \" A short tutorial on network calculus. i. fundamental bounds in communication networks,\" ISCAS 2000 . J. L. Boudec and P. Thiran, \"A short tutorial on network calculus. i. fundamental bounds in communication networks,\" ISCAS 2000."},{"issue":"1","key":"e_1_2_1_7_1","volume":"37","author":"Cruz R. L.","year":"1991","unstructured":"R. L. Cruz , \" A calculus for network delay, part i: Network elements in isolation,\" IEEE Transactions on Information Theory , vol. 37 , no. 1 , Jan 1991 . R. L. Cruz, \"A calculus for network delay, part i: Network elements in isolation,\" IEEE Transactions on Information Theory, vol. 37, no. 1, Jan 1991.","journal-title":"IEEE Transactions on Information Theory"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/NOCS.2009.5071444"}],"container-title":["ACM SIGBED Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2038617.2038627","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2038617.2038627","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:14Z","timestamp":1750240094000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2038617.2038627"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,9]]},"references-count":8,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,9]]}},"alternative-id":["10.1145\/2038617.2038627"],"URL":"https:\/\/doi.org\/10.1145\/2038617.2038627","relation":{},"ISSN":["1551-3688"],"issn-type":[{"type":"electronic","value":"1551-3688"}],"subject":[],"published":{"date-parts":[[2011,9]]},"assertion":[{"value":"2011-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}