{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:58:12Z","timestamp":1740099492389,"version":"3.37.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030296612"},{"type":"electronic","value":"9783030296629"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-29662-9_6","type":"book-chapter","created":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T19:03:06Z","timestamp":1566241386000},"page":"96-113","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Stability and Performance Bounds in Cyclic Networks Using Network Calculus"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3345-4653","authenticated-orcid":false,"given":"Anne","family":"Bouillard","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,13]]},"reference":[{"key":"6_CR1","unstructured":"Amari, A., Mifdaoui, A., Frances, F., Lacan, J., Rambaud, D., Urbain, L.: AeroRing: avionics full duplex ethernet ring with high availability and QoS management. In: ERTS (2016)"},{"key":"6_CR2","doi-asserted-by":"publisher","unstructured":"Amari, A., Mifdaoui, A.: Worst-case timing analysis of ring networks with cyclic dependencies using network calculus. In: RTCSA, pp. 1\u201310 (2017). \n                      https:\/\/doi.org\/10.1109\/RTCSA.2017.8046319","DOI":"10.1109\/RTCSA.2017.8046319"},{"key":"6_CR3","unstructured":"Andrews, M.: Instability of FIFO in session-oriented networks. In: Proceedings of SODA 2000 (2000)"},{"key":"6_CR4","unstructured":"Andrews, M.: Instability of FIFO in the permanent sessions model at arbitrarily small network loads. In: Proceedings of SODA 2007 (2007)"},{"key":"6_CR5","doi-asserted-by":"publisher","unstructured":"Bondorf, S., Nikolaus, P., Schmitt, J.B.: Quality and cost of deterministic network calculus - design and evaluation of an accurate and fast analysis. In: ACM SIGMETRICS (2017). \n                      https:\/\/doi.org\/10.1145\/3078505.3078594","DOI":"10.1145\/3078505.3078594"},{"issue":"1","key":"6_CR6","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1145\/3084453","volume":"1","author":"S Bondorf","year":"2017","unstructured":"Bondorf, S., Nikolaus, P., Schmitt, J.B.: Quality and cost of deterministic network calculus - design and evaluation of an accurate and fast analysis. Proc. ACM Meas. Anal. Comput. Syst. (POMACS) 1(1), 34 (2017). \n                      https:\/\/doi.org\/10.1145\/3084453","journal-title":"Proc. ACM Meas. Anal. Comput. Syst. (POMACS)"},{"key":"6_CR7","doi-asserted-by":"publisher","unstructured":"Bondorf, S., Schmitt, J.B.: Boosting sensor network calculus by thoroughly bounding cross-traffic. In: Proceedings of INFOCOM 2015 (2015). \n                      https:\/\/doi.org\/10.1109\/INFOCOM.2015.7218387","DOI":"10.1109\/INFOCOM.2015.7218387"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Bouillard, A., Boyer, M., Corronc, E.L.: Deterministic Network Calculus: From Theory to Practical Implementation, Wiley-ISTE (2018)","DOI":"10.1002\/9781119440284"},{"issue":"11\u201312","key":"6_CR9","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1016\/j.peva.2008.04.008","volume":"65","author":"A Bouillard","year":"2008","unstructured":"Bouillard, A., Gaujal, B., Lagrange, S., Thierry, E.: Optimal routing for end-to-end guarantees using network calculus. Perform. Eval. 65(11\u201312), 883\u2013906 (2008). \n                      https:\/\/doi.org\/10.1016\/j.peva.2008.04.008","journal-title":"Perform. Eval."},{"key":"6_CR10","doi-asserted-by":"publisher","unstructured":"Bouillard, A., Jouhet, L., Thierry, E.: Tight performance bounds in the worst case analysis of feed forward networks. In: INFOCOM 2010 (2010). \n                      https:\/\/doi.org\/10.1109\/INFCOM.2010.5461912","DOI":"10.1109\/INFCOM.2010.5461912"},{"key":"6_CR11","unstructured":"Bouillard, A.: Python package ncbounds (2019). \n                      https:\/\/github.com\/nokia\/NCBounds"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1016\/j.peva.2015.06.016","volume":"91","author":"A Bouillard","year":"2015","unstructured":"Bouillard, A., Nowak, T.: Fast symbolic computation of the worst-case delay in tandem networks and applications. Perform. Eval. 91, 270\u2013285 (2015). \n                      https:\/\/doi.org\/10.1016\/j.peva.2015.06.016","journal-title":"Perform. Eval."},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/978-3-642-16558-0_13","volume-title":"Lecture Notes in Computer Science","author":"Marc Boyer","year":"2010","unstructured":"Boyer, M., Navet, N., Olive, X., Thierry, E.: The PEGASE project: precise and scalable temporal analysis for aerospace communication systems with network calculus. In: ISOLA 2010 (2010). \n                      https:\/\/doi.org\/10.1007\/978-3-642-16558-0_13"},{"key":"6_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0459-9","volume-title":"Performance Guarantees in Communication Networks","author":"CS Chang","year":"2000","unstructured":"Chang, C.S.: Performance Guarantees in Communication Networks. TNCS. Springer-Verlag, London (2000). \n                      https:\/\/doi.org\/10.1007\/978-1-4471-0459-9"},{"issue":"1","key":"6_CR15","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1109\/18.61110","volume":"37","author":"R Cruz","year":"1991","unstructured":"Cruz, R.: A calculus for network delay, part II: network analysis. IEEE Trans. Inf. Theor. 37(1), 132\u2013141 (1991). \n                      https:\/\/doi.org\/10.1109\/18.61110","journal-title":"IEEE Trans. Inf. Theor."},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"1048","DOI":"10.1109\/49.400660","volume":"13","author":"R Cruz","year":"1995","unstructured":"Cruz, R.: Quality of service guarantees in virtual circuit switched networks. IEEE J. Sel. Areas Commun. 13, 1048\u20131056 (1995). \n                      https:\/\/doi.org\/10.1109\/49.400660","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"6_CR17","doi-asserted-by":"publisher","unstructured":"Geyer, F., Bondorf, S.: DeepTMA: predicting effective contention models for network calculus using graph neural networks. In: (INFOCOM) (2019). \n                      https:\/\/doi.org\/10.1109\/INFOCOM.2019.8737496","DOI":"10.1109\/INFOCOM.2019.8737496"},{"key":"6_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45318-0","volume-title":"Network Calculus","year":"2001","unstructured":"Le Boudec, J.-Y., Thiran, P. (eds.): Network Calculus. LNCS, vol. 2050. Springer, Heidelberg (2001). \n                      https:\/\/doi.org\/10.1007\/3-540-45318-0"},{"issue":"6","key":"6_CR19","doi-asserted-by":"publisher","first-page":"2721","DOI":"10.1109\/TNET.2018.2875191","volume":"26","author":"J Boudec Le","year":"2018","unstructured":"Le Boudec, J.: A theory of traffic regulators for deterministic networks with application to interleaved regulators. IEEE\/ACM Trans. Netw. 26(6), 2721\u20132733 (2018). \n                      https:\/\/doi.org\/10.1109\/TNET.2018.2875191","journal-title":"IEEE\/ACM Trans. Netw."},{"issue":"6","key":"6_CR20","doi-asserted-by":"publisher","first-page":"1087","DOI":"10.1109\/49.508280","volume":"14","author":"JM McManus","year":"1996","unstructured":"McManus, J.M., Ross, K.W.: Video-on-demand over ATM: constant-rate transmission and transport. IEEE J. Sel. A. Commun. 14(6), 1087\u20131098 (1996). \n                      https:\/\/doi.org\/10.1109\/49.508280","journal-title":"IEEE J. Sel. A. Commun."},{"key":"6_CR21","doi-asserted-by":"publisher","unstructured":"Mohammadpour, E., Stai, E., Mohiuddin, M., Boudec, J.L.: Latency and backlog bounds in time-sensitive networking with credit based shapers and asynchronous traffic shaping. In: 30th International Teletraffic Congress, pp. 1\u20136. ITC (2018). \n                      https:\/\/doi.org\/10.1109\/ITC30.2018.10053","DOI":"10.1109\/ITC30.2018.10053"},{"key":"6_CR22","doi-asserted-by":"publisher","unstructured":"Pellegrini, F.D., Starobinski, D., Karpovsky, M.G., Levitin, L.B.: Scalable cycle-breaking algorithms for gigabit ethernet backbones. In: Proceedings IEEE INFOCOM (2004). \n                      https:\/\/doi.org\/10.1109\/INFCOM.2004.1354641","DOI":"10.1109\/INFCOM.2004.1354641"},{"key":"6_CR23","doi-asserted-by":"publisher","unstructured":"Rizzo, G., Boudec, J.Y.L.: Stability and delay bounds in heterogeneous networks of aggregate schedulers. In: Proceedings of INFOCOM 2008 (2008). \n                      https:\/\/doi.org\/10.1109\/INFOCOM.2008.208","DOI":"10.1109\/INFOCOM.2008.208"},{"key":"6_CR24","doi-asserted-by":"publisher","unstructured":"Schmitt, J., Zdarsky, F., Fidler, M.: Delay bounds under arbitrary multiplexing: when network calculus leaves you in the lurch ... In: INFOCOM 2008 (2008). \n                      https:\/\/doi.org\/10.1109\/INFOCOM.2008.228","DOI":"10.1109\/INFOCOM.2008.228"},{"key":"6_CR25","doi-asserted-by":"publisher","unstructured":"Starobinski, D., Karpovsky, M.G., Zakrevski, L.: Application of network calculus to general topologies using turn-prohibition. In: Proceedings IEEE INFOCOM (2002). \n                      https:\/\/doi.org\/10.1109\/INFCOM.2002.1019365","DOI":"10.1109\/INFCOM.2002.1019365"},{"issue":"2","key":"6_CR26","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1109\/INFCOM.1994.337631","volume":"4","author":"L Tassiulas","year":"1996","unstructured":"Tassiulas, L., Georgiadis, L.: Any work-conserving policy stabilizes the ring with spatial re-use. IEEE\/ACM Trans. Netw. 4(2), 205\u2013208 (1996). \n                      https:\/\/doi.org\/10.1109\/INFCOM.1994.337631","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"6_CR27","unstructured":"Time-sensitive networking task group. \n                      http:\/\/www.ieee802.org\/1\/pages\/tsn.html"}],"container-title":["Lecture Notes in Computer Science","Formal Modeling and Analysis of Timed Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-29662-9_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T19:03:33Z","timestamp":1566241413000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-29662-9_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030296612","9783030296629"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-29662-9_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"13 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FORMATS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Formal Modeling and Analysis of Timed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"formats2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lipn.univ-paris13.fr\/formats2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"42","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"15","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.1","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}