{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T16:28:06Z","timestamp":1743006486730,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319749464"},{"type":"electronic","value":"9783319749471"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","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":[[2018]]},"DOI":"10.1007\/978-3-319-74947-1_15","type":"book-chapter","created":{"date-parts":[[2018,1,24]],"date-time":"2018-01-24T13:56:04Z","timestamp":1516802164000},"page":"218-233","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Catching Corner Cases in Network Calculus \u2013 Flow Segregation Can Improve Accuracy"],"prefix":"10.1007","author":[{"given":"Steffen","family":"Bondorf","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paul","family":"Nikolaus","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens B.","family":"Schmitt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,25]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"Bondorf, S.: Better bounds by worse assumptions - improving network calculus accuracy by adding pessimism to the network model. In: Proceedings of IEEE ICC (2017)","DOI":"10.1109\/ICC.2017.7996996"},{"issue":"1","key":"15_CR2","first-page":"16:1","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. ACM POMACS 1(1), 16:1\u201316:34 (2017)","journal-title":"ACM POMACS"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Bondorf, S., Schmitt, J.B.: The DiscoDNC v2 - a comprehensive tool for deterministic network calculus. In: Proceedings of EAI ValueTools (2014)","DOI":"10.4108\/icst.valuetools.2014.258167"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Bondorf, S., Schmitt, J.B.: Boosting sensor network calculus by thoroughly bounding cross-traffic. In: Proceedings of IEEE INFOCOM (2015)","DOI":"10.1109\/INFOCOM.2015.7218387"},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"Bondorf, S., Schmitt, J.B.: Calculating accurate end-to-end delay bounds - You better know your cross-traffic. In: Proceedings of EAI ValueTools (2015)","DOI":"10.4108\/eai.14-12-2015.2262565"},{"key":"15_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/978-3-319-31559-1_3","volume-title":"Measurement, Modelling and Evaluation of Dependable Computer and Communication Systems","author":"S Bondorf","year":"2016","unstructured":"Bondorf, S., Schmitt, J.B.: Improving cross-traffic bounds in feed-forward networks \u2013 there is a job for everyone. In: Remke, A., Haverkort, B.R. (eds.) MMB&DFT 2016. LNCS, vol. 9629, pp. 9\u201324. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-31559-1_3"},{"key":"15_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-319-43425-4_15","volume-title":"Quantitative Evaluation of Systems","author":"S Bondorf","year":"2016","unstructured":"Bondorf, S., Schmitt, J.B.: Should network calculus relocate? An assessment of current algebraic and optimization-based analyses. In: Agha, G., Van Houdt, B. (eds.) QEST 2016. LNCS, vol. 9826, pp. 207\u2013223. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-43425-4_15"},{"key":"15_CR8","unstructured":"Bouillard, A.: Algorithms and efficiency of network calculus. Habilitation thesis, \u00c9cole Normale Sup\u00e9rieure (2014)"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Bouillard, A., Jouhet, L., Thierry, E.: Tight performance bounds in the worst-case analysis of feed-forward networks. In: Proceedings of IEEE INFOCOM (2010)","DOI":"10.1109\/INFCOM.2010.5461912"},{"key":"15_CR10","unstructured":"Bu, T., Towsley, D.: On distinguishing between internet power law topology generators. In: Proceedings of IEEE INFOCOM (2002)"},{"key":"15_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-0459-9","volume-title":"Performance Guarantees in Communication Networks","author":"C-S Chang","year":"2000","unstructured":"Chang, C.-S.: Performance Guarantees in Communication Networks. Springer, London (2000). https:\/\/doi.org\/10.1007\/978-1-4471-0459-9"},{"issue":"1","key":"15_CR12","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1109\/18.61109","volume":"37","author":"RL Cruz","year":"1991","unstructured":"Cruz, R.L.: A calculus for network delay, Part I: network elements in isolation. IEEE Trans. Inf. Theory 37(1), 114\u2013131 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"1","key":"15_CR13","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1109\/18.61110","volume":"37","author":"RL Cruz","year":"1991","unstructured":"Cruz, R.L.: A calculus for network delay, Part II: network analysis. IEEE Trans. Inf. Theory 37(1), 132\u2013141 (1991)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"15_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-642-12104-3_18","volume-title":"Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance","author":"A Kiefer","year":"2010","unstructured":"Kiefer, A., Gollan, N., Schmitt, J.B.: Searching for Tight Performance Bounds in Feed-Forward Networks. In: M\u00fcller-Clostermann, B., Echtle, K., Rathgeb, E.P. (eds.) MMB&DFT 2010. LNCS, vol. 5987, pp. 227\u2013241. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-12104-3_18"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45318-0","volume-title":"Network Calculus: A Theory of Deterministic Queuing Systems for the Internet","year":"2001","unstructured":"Le Boudec, J.-Y., Thiran, P. (eds.): Network Calculus: A Theory of Deterministic Queuing Systems for the Internet. LNCS, vol. 2050. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45318-0"},{"key":"15_CR16","doi-asserted-by":"crossref","unstructured":"Schmitt, J.B., Zdarsky, F.A., Fidler, M.: Delay bounds under arbitrary multiplexing: when network calculus leaves you in the lurch ... In: Proceedings of IEEE INFOCOM (2008)","DOI":"10.1109\/INFOCOM.2008.228"},{"key":"15_CR17","unstructured":"Schmitt, J.B., Zdarsky, F.A., Martinovic, I.: Improving performance bounds in feed-forward networks by paying multiplexing only once. In: Proceedings of GI\/ITG MMB (2008)"}],"container-title":["Lecture Notes in Computer Science","Measurement, Modelling and Evaluation of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-74947-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:37:18Z","timestamp":1710344238000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-74947-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319749464","9783319749471"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-74947-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"25 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"MMB","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Measurement, Modelling and Evaluation of Computing Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Erlangen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 February 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 February 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"mmb2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.mmb2018.de\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}