Abstract
The computation of teletraffic (traffic for short) delay bound is crucial to the guaranteed quality of service in computer communication networks. Traditional non-fractal bounds of traffic delay are loose so that network resources may be over-required for guaranteed quality of service. How to obtain a tighter bound of traffic delay, in fact, is an open problem. This paper gives a solution to that problem by proposing four fractal delay bounds of traffic. We will show that the present fractal delay bounds are tighter than the conventional non-fractal ones.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Physica A: Statistical Mechanics and its Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
