{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:25:33Z","timestamp":1750307133126,"version":"3.41.0"},"reference-count":10,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2011,12,1]],"date-time":"2011-12-01T00:00:00Z","timestamp":1322697600000},"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,12]]},"abstract":"<jats:p>Avionics Full DupleX Switched Ethernet (AFDX) has been developed for modern aircraft such as Airbus 380. Due to the non-determinism of switching mechanism, a worst-case delay analysis of the flows entering the network is a key issue for certification reasons. Up to now most existing approaches (such as Network Calculus) consider that all the flows are asynchronous and they do not take into account the scheduling of flows generated by the same end system. It is then pessimistic to take into account such a synchronous scenario. Each end system can be considered as an offset free system, thus the main objective of this paper is to evaluate existing offset assignments in the context of an industrial AFDX network. Existing offset assignments are adapted to take into account specific characteristics of an AFDX network. Worst-case delay results are obtained according to these offset heuristics. It is shown that some existing heuristics are not efficient while some are near optimal for the studied industrial AFDX network.<\/jats:p>","DOI":"10.1145\/2095256.2095263","type":"journal-article","created":{"date-parts":[[2012,1,17]],"date-time":"2012-01-17T17:21:44Z","timestamp":1326820904000},"page":"49-54","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Existing offset assignments are near optimal for an industrial AFDX network"],"prefix":"10.1145","volume":"8","author":[{"given":"Xiaoting","family":"Li","sequence":"first","affiliation":[{"name":"Universit\u00e9 de Toulouse, Toulouse, France"}]},{"given":"Jean-Luc","family":"Scharbarg","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Toulouse, Toulouse, France"}]},{"given":"Fr\u00e9d\u00e9ric","family":"Ridouard","sequence":"additional","affiliation":[{"name":"University of Poitiers, Futuroscope, France"}]},{"given":"Christian","family":"Fraboul","sequence":"additional","affiliation":[{"name":"Universit\u00e9 de Toulouse, Toulouse, France"}]}],"member":"320","published-online":{"date-parts":[[2011,12]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"Arinc 664 2002-2008.  Arinc 664 2002-2008."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2010.2055877"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-45318-0","volume-title":"Network Calculus: A Theory of Deterministic Queuing Systems for the Internet","author":"Boudec J.-Y. L.","year":"2001","unstructured":"J.-Y. L. Boudec and P. Thiran . Network Calculus: A Theory of Deterministic Queuing Systems for the Internet . Springer-Verlag , Berlin Heidelberg New York, 2001 . J.-Y. L. Boudec and P. Thiran. Network Calculus: A Theory of Deterministic Queuing Systems for the Internet. Springer-Verlag, Berlin Heidelberg New York, 2001."},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2006.15"},{"key":"e_1_2_1_5_1","volume-title":"Proc. 3th European Congress on Embedded Real Time Software (ERTS'06)","author":"Frances F.","year":"2006","unstructured":"F. Frances , C. Fraboul , and J. Grieu . Using network calculus to optimize the AFDX network . In Proc. 3th European Congress on Embedded Real Time Software (ERTS'06) , January 2006 . F. Frances, C. Fraboul, and J. Grieu. Using network calculus to optimize the AFDX network. In Proc. 3th European Congress on Embedded Real Time Software (ERTS'06), January 2006."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1021782503695"},{"key":"e_1_2_1_7_1","first-page":"35","volume-title":"Proc. 14th International Conference on Real Time Network and Systems (RTNS'06)","author":"Grenier M.","year":"2006","unstructured":"M. Grenier , J. Goossens , and N. Navet . Near-optimal fixed priority preemptive scheduling of offset free systems . In Proc. 14th International Conference on Real Time Network and Systems (RTNS'06) , pages 35 -- 42 , May 2006 . M. Grenier, J. Goossens, and N. Navet. Near-optimal fixed priority preemptive scheduling of offset free systems. In Proc. 14th International Conference on Real Time Network and Systems (RTNS'06), pages 35--42, May 2006."},{"key":"e_1_2_1_8_1","volume-title":"Proc. 4th European Congress on Embedded Real Time Software (ERTS'08)","author":"Grenier M.","year":"2008","unstructured":"M. Grenier , L. Havet , and N. Navet . Pushing the limits of CAN - scheduling frames with offsets provides a major performance boost . In Proc. 4th European Congress on Embedded Real Time Software (ERTS'08) , January 2008 . M. Grenier, L. Havet, and N. Navet. Pushing the limits of CAN - scheduling frames with offsets provides a major performance boost. In Proc. 4th European Congress on Embedded Real Time Software (ERTS'08), January 2008."},{"key":"e_1_2_1_9_1","first-page":"1","volume-title":"Proc. IEEE International Conference on Emerging Technologies and Factory Automation (ETFA'10)","author":"Li X.","year":"2010","unstructured":"X. Li , J.-L. Scharbarg , and C. Fraboul . Improving end-to-end delay upper bounds on an AFDX network by integrating offsets in worst-case analysis . In Proc. IEEE International Conference on Emerging Technologies and Factory Automation (ETFA'10) , pages 1 -- 8 . IEEE, September 2010 . X. Li, J.-L. Scharbarg, and C. Fraboul. Improving end-to-end delay upper bounds on an AFDX network by integrating offsets in worst-case analysis. In Proc. IEEE International Conference on Emerging Technologies and Factory Automation (ETFA'10), pages 1--8. IEEE, September 2010."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TII.2009.2016085"}],"container-title":["ACM SIGBED Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2095256.2095263","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2095256.2095263","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:42Z","timestamp":1750240122000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2095256.2095263"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,12]]},"references-count":10,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,12]]}},"alternative-id":["10.1145\/2095256.2095263"],"URL":"https:\/\/doi.org\/10.1145\/2095256.2095263","relation":{},"ISSN":["1551-3688"],"issn-type":[{"type":"electronic","value":"1551-3688"}],"subject":[],"published":{"date-parts":[[2011,12]]},"assertion":[{"value":"2011-12-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}