Abstract
Many new and old applications have to split the information into smaller units while transmitted through a network. If not the whole packet is able to get through to the destination the fraction transmitted is of no value. Several areas within the tele- and data communication field where this applies are pointed out. Further a discrete time model with bursty arrivals is introduced and analyzed. The result shows the advantage of the‘All or Nothing Policy’ for the burst loss probability and the waiting time.
Chapter PDF
Similar content being viewed by others
References
Anagnostou, M. E., Sykas, E. D. and Protonotarios, E. D. (1984), Steady-state and transient delay analysis of ARQ protocols, Computer Communications, 7, No. 1.
CCITT (1988), CCITT Recommendation, H and J series, November.
Chao, H. J., Ghosal, D., Saha D. and Tripathi, S. K. (1994), IP on ATM Local Area Networks, IEEE Communications Magazine, August.
Corner, D.E. (1991), Internetworking with TCP/IP, vol.I,Prentice-Hall.
Little, J. D. C. (1961), A Proof of the Queueing Formula L = AW, Operations Research 9.
Yamashita, H. (1994), Numerical analysis of a discrete-time finite capacity queue with a burst arrival, Annals of Operations Research, 49.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1996 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Karlsson, J.M., Yamashita, H. (1996). Discrete-time analysis of a finite capacity queue with an ’all or nothing policy’ to reduce burst loss. In: Fdida, S., Onvural, R.O. (eds) Data Communications and their Performance. IFIP — The International Federation for Information Processing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-34942-8_12
Download citation
DOI: https://doi.org/10.1007/978-0-387-34942-8_12
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4757-4908-3
Online ISBN: 978-0-387-34942-8
eBook Packages: Springer Book Archive