End-to-End Delay Model for Complex Networks with Poisson Arrivals and Hyper-Erlang Distributed Packet Sizes

End-to-End Delay Model for Complex Networks with Poisson Arrivals and Hyper-Erlang Distributed Packet Sizes | Authorea try { document.documentElement.classList.add('js'); } catch (e) { } var _gaq = _gaq || []; _gaq.push(['_setAccount', 'G-8VDV14Y67G']); _gaq.push(['_trackPageview']); (function() { var ga = document.createElement('script'); ga.type = 'text/javascript'; ga.async = true; ga.src = ('https:' == document.location.protocol ? 'https://ssl' : 'http://www') + '.google-analytics.com/ga.js'; var s = document.getElementsByTagName('script')[0]; s.parentNode.insertBefore(ga, s); })(); Skip to main content Preprints Collections Wiley Open Research IET Open Research Ecological Society of Japan All Collections About About Authorea FAQs Contact Us Quick Search anywhere Search for preprint articles, keywords, etc. Search Search ADVANCED SEARCH SCROLL This is a preprint and has not been peer reviewed. Data may be preliminary. 1 March 2026 V1 Latest version Share on End-to-End Delay Model for Complex Networks with Poisson Arrivals and Hyper-Erlang Distributed Packet Sizes Authors : Yifan Sun [email protected] , Kai Wang , Wei Wang , and Yunkai Zhou 0009-0009-1889-3955 Authors Info & Affiliations https://doi.org/10.22541/au.177234848.80095589/v1 140 views 84 downloads Contents Abstract Supplementary Material Information & Authors Metrics & Citations View Options References Figures Tables Media Share Abstract In this letter, we consider any complex network that has the following properties: 1) packet arrivals are Poisson; 2) packet sizes are hyper-Erlang distributed; 3) packets are routed based on a fixed routing strategy; 4) packet sizes remain unchanged when they traverse from node to node; 5) there are a large number of packet flows, which ensure sufficient traffic mixing. We then develop a simple approximation model for the complementary cumulative density function (CCDF) of the end-to-end delay. By using simulation, the approximated CCDF from our model is shown to be in good agreement with the sample CCDF from simulation results and always gives a less-than-0.01 Kolmogorov-Smirnov distance. Supplementary Material File (iet-ell-sample_v2.pdf) Download 965.32 KB Information & Authors Information Version history V1 Version 1 01 March 2026 Copyright This work is licensed under a Non Exclusive No Reuse License. Keywords computer network performance evaluation network analysis quality of service Authors Affiliations Yifan Sun [email protected] State Grid Tianjin Electric Power Company Information & Communication Company View all articles by this author Kai Wang State Grid Tianjin Electric Power Company Information & Communication Company View all articles by this author Wei Wang State Grid Tianjin Electric Power Company Information & Communication Company View all articles by this author Yunkai Zhou 0009-0009-1889-3955 State Grid Tianjin Electric Power Company View all articles by this author Metrics & Citations Metrics Article Usage 140 views 84 downloads .FvxKWukQNSOunydq8rnd { width: 100px; } Citations Download citation Yifan Sun, Kai Wang, Wei Wang, et al. End-to-End Delay Model for Complex Networks with Poisson Arrivals and Hyper-Erlang Distributed Packet Sizes. Authorea . 01 March 2026. DOI: https://doi.org/10.22541/au.177234848.80095589/v1 If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download. For more information or tips please see 'Downloading to a citation manager' in the Help menu . Format Please select one from the list RIS (ProCite, Reference Manager) EndNote BibTex Medlars RefWorks Direct import Tips for downloading citations document.getElementById('citMgrHelpLink').addEventListener('click', function() { popupHelp(this.href); return false; }); $(".js__slcInclude").on("change", function(e){ if ($(this).val() == 'refworks') $('#direct').prop("checked", false); $('#direct').prop("disabled", ($(this).val() == 'refworks')); }); View Options View options PDF View PDF Figures Tables Media Share Share Share article link Copy Link Copied! Copying failed. Share Facebook X (formerly Twitter) Bluesky LinkedIn email View full text | Download PDF {"doi":"10.22541/au.177234848.80095589/v1","type":"Article"} Now Reading: Share Figures Tables Close figure viewer Back to article Figure title goes here Change zoom level Go to figure location within the article Download figure Toggle share panel Toggle share panel Share Toggle information panel Toggle information panel Go to previous graphic Go to next graphic Go to previous table Go to next table All figures All tables View all material View all material xrefBack.goTo xrefBack.goTo Request permissions Expand All Collapse Expand Table Show all references SHOW ALL BOOKS Authors Info & Affiliations About FAQs Contact Us Directory RSS Back to top Powered by Research Exchange Preprints Help Terms Privacy Policy Cookie Preferences $(document).ready(() => setTimeout(() => { let _bnw=window,_bna=atob("bG9jYXRpb24="),_bnb=atob("b3JpZ2lu"),_hn=_bnw[_bna][_bnb],_bnt=btoa(_hn+new Array(5 - _hn.length % 4).join(" ")); $.get("/resource/lodash?t="+_bnt); },4000)); (function(){function c(){var b=a.contentDocument||a.contentWindow.document;if(b){var d=b.createElement('script');d.innerHTML="window.__CF$cv$params={r:'9fe5bf95088ac13d',t:'MTc3OTIyMTQ2MQ=='};var a=document.createElement('script');a.src='/cdn-cgi/challenge-platform/scripts/jsd/main.js';document.getElementsByTagName('head')[0].appendChild(a);";b.getElementsByTagName('head')[0].appendChild(d)}}if(document.body){var a=document.createElement('iframe');a.height=1;a.width=1;a.style.position='absolute';a.style.top=0;a.style.left=0;a.style.border='none';a.style.visibility='hidden';document.body.appendChild(a);if('loading'!==document.readyState)c();else if(window.addEventListener)document.addEventListener('DOMContentLoaded',c);else{var e=document.onreadystatechange||function(){};document.onreadystatechange=function(b){e(b);'loading'!==document.readyState&&(document.onreadystatechange=e,c())}}}})();