Abstract
AbstractRecent studies indicate that out‐of‐order arrival of data packets during downloads of resources is not pathological network behaviour (ACM/IEEE Trans. Networking 1999; 7(6):789). Though this situation is most intuitive when packets of the same resource arrive in parallel from several sources, it turns out that this phenomenon may also occur in the single source scenario. Knowledge regarding the expected reordering needed is important both for being able to decide on the size of the resequencing buffer needed, and to estimate the burstiness in arrival of data to the application. In this study we present a method to calculate the resequencing buffer occupancy probabilities for the single source scenario, and a study of the resequencing buffer occupancy for the two source scenario, where arrival from each of the sources is in order. Copyright © 2003 John Wiley & Sons, Ltd.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
