{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T07:12:04Z","timestamp":1766301124358,"version":"3.41.0"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100006730","name":"Italian Ministry of Education and Research (MUR) in the framework of the FoReLab Project","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100006730","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/access.2025.3573126","type":"journal-article","created":{"date-parts":[[2025,5,23]],"date-time":"2025-05-23T17:05:40Z","timestamp":1748019940000},"page":"92227-92241","source":"Crossref","is-referenced-by-count":1,"title":["Estimating Bandwidth and Analyzing Worst-Case Delay Bounds Using Network Calculus"],"prefix":"10.1109","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-6036-3726","authenticated-orcid":false,"given":"Md Amirul","family":"Islam","sequence":"first","affiliation":[{"name":"Dipartimento di Ingegneria dell’Informazione, University of Pisa, Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5310-6763","authenticated-orcid":false,"given":"Giovanni","family":"Stea","sequence":"additional","affiliation":[{"name":"Dipartimento di Ingegneria dell’Informazione, University of Pisa, Pisa, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.896235"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.899014"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2003.814505"},{"key":"ref4","first-page":"14","article-title":"Pathload: A measurement tool for end-to-end available bandwidth","volume-title":"Proc. Passive Act. Meas. (PAM) Workshop","author":"Jain"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.815304"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2000.892039"},{"key":"ref7","first-page":"1","article-title":"Pathchirp: Efficient available bandwidth estimation for network paths","volume-title":"Proc. Passive Act. Meas. Workshop","volume":"4","author":"Ribeiro"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/844128.844152"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/948205.948211"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12365-8_13"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2009.08.010"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2003.1248658"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31966-5_24"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/18.61109"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/49.400660"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02742-0_11"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2035115"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-018-9312-0"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2017.7927055"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/SIES.2015.7185041"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2729283"},{"key":"ref22","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":"Le Boudec","year":"2001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2008.10.023"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2010.05.008"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1232919.1232922"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1002\/ett.4460120413"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/6046.909595"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/VETECF.2002.1040804"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30573-6_4"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/NGI.2005.1431683"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/LCSYS.2021.3128152"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/2.191995"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2007.4378780"},{"volume-title":"Omnet++, Version: 6.0.2","year":"2022","key":"ref34"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.softx.2022.101178"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.2478\/v10177-011-0037-4"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2006.880019"},{"key":"ref38","first-page":"11","article-title":"Estimation of statistical bandwidth through backlog measurement","volume-title":"Proc. WoNeCa","author":"She"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2010.020110.00019"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10820123\/11014097.pdf?arnumber=11014097","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T18:02:37Z","timestamp":1748887357000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11014097\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":39,"URL":"https:\/\/doi.org\/10.1109\/access.2025.3573126","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2025]]}}}