Skip to main content
SpringerLink
Log in

Systems with Losses

  • Chapter
  • First Online:
Network Calculus

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2050))

  • 1283 Accesses

Abstract

All chapters have dealt up to now with lossless systems. This chapter shows that network calculus can also be applied to lossy systems, if we model them as a lossless system preceded by a ‘clipper’ [15, 16], which is a controller dropping some data when a buffer is full, or when a delay constraint would otherwise be violated. By applying once again Theorem 4.3.1, we obtain a representation formula for losses. We use this formula to compute various bounds. The first one is a bound on the loss rate in an element when both an arrival curve of the incoming traffic and a minimum service curve of the element are known.We use it next to bound losses in a complex with a complex service curve (e.g., VBR shapers) by means of losses with simpler service curves (e.g., CBR shapers). Finally, we extend the clipper, which models data drops due to buffer overflow, to a ‘compensator’, which models data accrual to prevent buffer underflow, and use it to compute explicit solutions to Skorokhod reflection mapping problem with two boundaries.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliography

  1. R. Agrawal, R. L. Cruz, C. Okino, and R. Rajan. A framework for adapative service guarantees. In Proc. Allerton Conf on Comm, Control and Comp, Monticello, IL, Sept 1998.

    Google Scholar 

  2. R. Agrawal, R. L. Cruz, C. Okino, and R. Rajan. Performance bounds for flow control protocols. IEEE/ACM Transactions on Networking (7)3, pages 310–323, June 1999.

    Article  Google Scholar 

  3. M. Andrews. Instability of fifo in session-oriented networks. In Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2000), January 2000.

    Google Scholar 

  4. J. C. R. Bennett, Benson K., Charny A., Courtney W. F., and J.-Y. Le Boudec. Delay jitter bounds and packet scale rate guarantee for expedited forwarding. In Proceedings of Infocom, April 2001.

    Google Scholar 

  5. J.C.R. Bennett and H. Zhang. Wf2q:Worst-case fair weighted fair queuing. In Proceedings of Infocom, Mar 1996.

    Google Scholar 

  6. S. Blake, D. Black, M. Carlson, E. Davies, Z. Wang, and W. Weiss. An architecture for differentiated services, December 1998. RFC 2475, IETF.

    Google Scholar 

  7. C. S. Chang. Stability, queue length and delay, part i: Deterministic queuing networks. Technical Report Technical Report RC 17708, IBM, 1992.

    Google Scholar 

  8. C.-S. Chang, W.-J. Chen, and H.-Y. Hunag. On service guarantees for input buffered crossbar switches: A capacity decomposition approach by birkhoff and von neumann. In Proc of IWQOS 99, March 1999.

    Google Scholar 

  9. C.S. Chang. On deterministic traffic regulation and service guarantee: A systematic approach by filtering. IEEE Transactions on Information Theory, 44:1096–1107, August 1998.

    Google Scholar 

  10. C.S. Chang. Performance Guarantees in Communication Networks. Springer-Verlag, New York, 2000.

    MATH  Google Scholar 

  11. C.S. Chang and R. L. Cruz. A time varying filtering theory for constrained traffic regulation and dynamic service guarantees. In Preprint, July 1998.

    Google Scholar 

  12. A. Charny and J.-Y. Le Boudec. Delay bounds in a network with aggregate scheduling. In First International Workshop on Quality of future Internet Services, Berlin, Germany, September 2000.

    Google Scholar 

  13. I. Chlamtac, A. Faragó, H. Zhang, and A. Fumagalli. A deterministic approach to the end-to-end analysis of packet flows in connection oriented networks. IEEE/ACM transactions on networking, (6) 4:422–431, 08 1998.

    Google Scholar 

  14. J.-F. Chuang, C.-M. and Chang. Deterministic loss ratio quality of service guarantees for high speed networks. IEEE Communications Letters, 4:236–238, July 2000.

    Google Scholar 

  15. R. Cruz, C.-S. Chang, J.-Y. Le Boudec, and P. Thiran. A min-plus system theory for constrained traffic regulation and dynamic service guarantees. Technical Report SSC/1999/024, EPFL, July 1999.

    Google Scholar 

  16. R. Cruz and M. Taneja. An analysis of traffic clipping. In Proc 1998 Conf on Information Science & Systems, Princeton University, 1998.

    Google Scholar 

  17. R. L. Cruz. Sced+: Efficient management of quality of service guarantees. In IEEE Infocom’98, San Francisco, March 1998.

    Google Scholar 

  18. R.L. Cruz. A calculus for network delay, part i: Network elements in isolation. IEEE Trans. Inform. Theory, vol 37-1, pages 114–131, January 1991.

    Article  MathSciNet  Google Scholar 

  19. R.L. Cruz. A calculus for network delay, part ii: Network analysis. IEEE Trans. Inform. Theory, vol 37-1, pages 132–141, January 1991.

    Article  MathSciNet  Google Scholar 

  20. G. De Veciana, July 1996. Private Communication.

    Google Scholar 

  21. A. Demers, S. Keshav, and S. Shenker. Analysis and simulation of a fair queuing algorithm. Journal of Internetworking Research and Experience, pages 3–26, Oct 1990.

    Google Scholar 

  22. N. G. Duffield, K. K. Ramakrishan, and A. R. Reibman. Save: An algorithm for smoothed adaptative video over explicit rate networks. IEEE/ACM Transactions on Networking, 6:717–728, Dec 1998.

    Article  Google Scholar 

  23. A. Elwalid, Mitra D., and R. Wenworth. A new approach for allocating buffers and bandwidth to heterogeneous, regulated traffic in ATMnode. IEEE Journal of Selected Areas in Communications, 13:1048–1056, August 1995.

    Article  Google Scholar 

  24. Baccelli F., Cohen G., Olsder G. J.,, and Quadrat J.-P. Synchronization and Linearity, An Algebra for Discrete Event Systems. John Wiley and Sons, 1992.

    Google Scholar 

  25. W.-C. Feng and J. Rexford. Performance evaluation of smoothing algorithms for transmitting variable-bit-rate video. IEEE Transactions on Multimedia, 1:302–312, Sept 1999.

    Article  Google Scholar 

  26. L. Georgiadis, R. Guérin, V. Peris, and R. Rajan. Efficient support of delay and rate guarantees in an internet. In Proceedings of Sigcomm’96, pages 106–116, August 1996.

    Google Scholar 

  27. P. Goyal, S. S. Lam, and H. Vin. Determining end-to-end delay bounds in heterogeneous networks. In 5th Int Workshop on Network and Op. Sys support for Digital Audio and Video, Durham NH, April 1995.

    Google Scholar 

  28. R. Guérin and V. Peris. Quality-of-service in packet networks–basic mechanisms and directions. Computer Networks and ISDN, Special issue on multimedia communications over packet-based networks, 1998.

    Google Scholar 

  29. R. Guérin and V. Pla. Aggregation and conformance in differentiated service networks–a case study. Technical Report Research Report, U Penn, http://www.seas.upenn.edu:8080/ guerin/publications/aggreg.pdf, August 2000.

  30. Jeremy Gunawardena. From max-plus algebra to nonexpansive mappings: a nonlinear theory for discrete event systems. pre-print, 1999.

    Google Scholar 

  31. Sariowan H., Cruz R. L., and Polyzos G. C. Scheduling for quality of service guarantees via service curves. In Proceedings ICCCN’95, pages 512–520, Sept 1995.

    Google Scholar 

  32. B. Hajek. Large bursts do not cause instability. IEEE Trans on Aut Control, 45:116–118, Jan 2000.

    Article  MATH  MathSciNet  Google Scholar 

  33. J. M. Harrison. Brownian Motion and Stochastic Flow Systems. Wiley, New-York, 1985.

    MATH  Google Scholar 

  34. J. Heinanen, F. Baker, W. Weiss, and J. Wroclawski. Assured forwarding phb group, June 1999. RFC 2597, IETF.

    Google Scholar 

  35. Golestani S. J. A self clocked fair queuing scheme for high speed applications. In Proceedings of Infocom’ 94, 1994.

    Google Scholar 

  36. F. Farkas J. Y. Le Boudec. A delay bound for a network with aggregate scheduling. In Proceedings of the Sixteenth UK Teletraffic Symposium on Management of Quality of Service, page 5, Harlow, UK, May 2000.

    Google Scholar 

  37. V. Jacobson, K. Nichols, and K. Poduri. An expedited forwarding phb, June 1999. RFC 2598, IETF.

    Google Scholar 

  38. C Kalmanek, H. Kanakia, and R. Restrick. Rate controlled servers for very high speed networks. In IEEE Globecom’90, vol 1, pages 12–20, 1990.

    Google Scholar 

  39. Keshav. Computer Networking: An Engineering Approach. Prentice Hall, Englewood Cliffs, New Jersey 07632, 1996.

    Google Scholar 

  40. T. Konstantopoulos and V. Anantharam. Optimal flow control schemes that regulate the burstiness of traffic. IEEE/ACM Transactions on Networking, 3:423–432, August 1995.

    Article  Google Scholar 

  41. Cruz R. L. and Okino C. M. Service guarantees for window flow control. In 34th Allerton Conf of Comm., Cont., and Comp. Monticello, IL, Oct 1996.

    Google Scholar 

  42. Gun L. and R. Gu’erin. Bandwidth management and congestion control framework of the broadband network architecture. Bandwidth management and congestion control framework of the broadband network architecture, vol 26, pages 61–78, 1993.

    Google Scholar 

  43. Zhang L. A new traffic control algorithm for packet switching networks. In Proceedings of ACM Sigcomm’ 90, 1990.

    Google Scholar 

  44. J.-Y. Le Boudec. Application of network calculus to guaranteed service networks. IEEE Transactions on Information Theory, 44:1087–1096, May 1998.

    Article  MATH  Google Scholar 

  45. J.-Y. Le Boudec. Some properties of variable length packet shapers. In Proc ACM Sigmetrics / Performance’ 01, 2001.

    Google Scholar 

  46. J.-Y. Le Boudec and G. Hebuterne. Comment on a deterministic approach to the end-to-end analysis of packet flows in connection oriented network. IEEE/ACM Transactions on Networking, February 2000.

    Google Scholar 

  47. J.-Y. Le Boudec and P. Thiran. Network calculus viewed as a min-plus system theory applied to communication networks. Technical Report SSC/1998/016, EPFL, April 1998.

    Google Scholar 

  48. J.-Y. Le Boudec and O. Verscheure. Optimal smoothing for guaranteed service. Technical Report DSC2000/014, EPFL, March 2000.

    Google Scholar 

  49. J. Liebeherr, D.E. Wrege, and Ferrari D. Exact admission control for networks with bounded delay services. ACM/IEEE transactions on networking, 4:885–901, 1996.

    Article  Google Scholar 

  50. F. Lo Presti, Z.-L. Zhang, D. Towsley, and J. Kurose. Source time scale and optimal buffer/bandwidth trade-off for regulated traffic in a traffic node. IEEE/ACM Transactions on Networking, 7:490–501, August 1999.

    Article  Google Scholar 

  51. S. H. Low and P. P. Varaiya. A simple theory of traffic and resource allocation in atm. In Globecom’91, pages 1633–1637, December 1991.

    Google Scholar 

  52. J. M. McManus and K.W. Ross. Video-on-demand over ATM: Constant-rate transmission and transport. IEEE Journal on Selected Areas in Communications, 7:1087–1098, Aug 1996.

    Article  Google Scholar 

  53. J. Naudts. A Scheme for Multiplexing ATM Sources. Chapman Hill, 1996.

    Google Scholar 

  54. J. Naudts. Towards real-time measurement of traffic control parameters. Computer networks, 34:157–167, 2000.

    Article  Google Scholar 

  55. Clayton M. Okino. A framework for performance guarantees in communication networks, 1998. Ph.D. Dissertation, UCSD.

    Google Scholar 

  56. A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: The single node case. IEEE/ACM Trans. Networking, vol 1-3, pages 344–357, June 1993.

    Article  Google Scholar 

  57. A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control in integrated services networks: The multiple node case. IEEE/ACM Trans. Networking, vol 2-2, pages 137–150, April 1994.

    Article  Google Scholar 

  58. Vinod Peris. Architecture for guaranteed delay service in high speed networks, 1997. Ph.D. Dissertation, University of Maryland, http://www.isr.umd.edu.

  59. Fabrice P. Guillemin Pierre E. Boyer, Michel J. Servel. The spacer-controller: an efficient upc/npc for atm networks. In ISS’ 92, Session A9.3, volume 2, October 1992.

    Google Scholar 

  60. Agrawal R. and Rajan R. Performance bounds for guaranteed and adaptive services, December 1996. IBM Technical Report RC 20649.

    Google Scholar 

  61. J. Rexford and D. Towsley. Smoothing variable-bit-rate video in an internetwork. IEEE/ACM Transactions on Networking, 7:202–215, April 1999.

    Article  Google Scholar 

  62. H. L. Royden. Real Analysis. Mc-Millan, New-York, 2 edition, 1968.

    Google Scholar 

  63. J. Y. Le Boudec S. Giordano. On a class of time varying shapers with application to the renegotiable variable bit rate service. Journal on High Speed Networks.

    Google Scholar 

  64. J. D. Salehi, Z.-L. Zhang, J. F. Kurose, and D. Towsley. Supporting stored video: Reducing rate variability and end-to-end resource requirements through optimal smoothing. IEEE/ACM Transactions on Networking, 6:397–410, Dec 1998.

    Article  Google Scholar 

  65. H. Sariowan. A service curve approach to performance guarantees in integrated service networks, 1996. Ph.D. Dissertation, UCSD.

    Google Scholar 

  66. A. Skorokhod. Stochastic equations for diffusion processes in a bounded region. Theory of Probability and its Applications, 6:264–274, 1961.

    Article  Google Scholar 

  67. D. Stiliadis and A. Varma. Rate latency servers: a general model for analysis of traffic scheduling algorithms. In IEEE Infocom’ 96, pages 647–654, 1991.

    Google Scholar 

  68. Rockafellar R. T. Convex Analysis. Princeton University Press, Princeton, 1970.

    MATH  Google Scholar 

  69. L. Tassiulas and L. Georgiadis. Any work conserving policy stabilizes the ring with spatial reuse. IEEE/ACM Transactions on Networking, pages 205–208, April 1996.

    Google Scholar 

  70. Lothar Thiele, Samarjit Chakraborty, and Martin Naedele. Real-time calculus for scheduling hard real-time systems. In ISCAS, Geneva, May 2000.

    Google Scholar 

  71. P. Thiran, J.-Y. Le Boudec, and F. Worm. Network calculus applied to optimal multimedia smoothing. In Proc of Infocom 2001, April 2001.

    Google Scholar 

  72. D Verma, H. Zhang, and D. Ferrari. Guaranteeing delay jitter bounds in packet switching networks. In Proceedings of Tricomm’ 91, Chapel Hill, pages 35–46, April 1991.

    Google Scholar 

  73. H. Zhang. Service disciplines for guaranteed performance service in packet switching networks. Proceedings of the IEEE, 1996.

    Google Scholar 

  74. H. Zhang and D. Ferrari. Rate controlled service disciplines. Journal of High Speed Networks, 3No 4:389–412, August 1994.

    Google Scholar 

  75. Hongbiao Zhang. A note on deterministic end-to-end delay analysis in connection oriented networks. In Proc of IEEE ICC’99, Vancouver, pp 1223–1227, 1999.

    Google Scholar 

Download references

Editor information

Editors and Affiliations

  1. INN Ecublens, EPFL, 1015, Lausanne, Switzerland

    Jean-Yves Le Boudec  & Patrick Thiran  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

(2001). Systems with Losses. In: Le Boudec, JY., Thiran, P. (eds) Network Calculus. Lecture Notes in Computer Science, vol 2050. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45318-0_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-45318-0_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42184-9

  • Online ISBN: 978-3-540-45318-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation