Block loss reduction in ATM networks

  • Vijay Srinivasan
  • Anoop Ghanwani
  • Erol Gelenbe
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 919)


Traditional approaches to guaranteeing Quality-of-Service (QoS) in ATM networks have focused on performance metrics such as cell loss probability, end-to-end cell delay and delay jitter. However, the block loss rate is a more meaningful metric for applications such as medical imaging and real-time video, and to high-level protocols such as IP which will use ATM as the transport mechanism. A block is defined as a group of consecutive ATM cells. For instance, a block may correspond to an IP datagram or to a macroblock within a medical image. A block loss occurs when a single cell from a block is lost. Consequently, we propose a technique for reducing block loss in ATM networks. Our method combines two well-studied approaches for minimizing the impact of information loss during transport over ATM networks which have been considered independently of each other in the past: priority-based cell discarding and forward error correction (FEC). We present analysis which shows that our scheme reduces the block loss rate by several orders of magnitude for many cases of interest.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Biersack, E. W., “Performance Evaluation of Forward Error Correction in an ATM Environment,” IEEE Journal on Selected Areas in Communications, Vol. 11, No. 4, May 1993, pp. 631–640, 1993.Google Scholar
  2. 2.
    CCITT Draft Recommendation I.321: “B-ISDN Protocol Reference Model and its Application,” COM XVIIII-R 34-E, Geneva 1990.Google Scholar
  3. 3.
    CCITT Draft Recommendation I.361: “B-ISDN ATM Layer Specification,” COM XVIIII-R 34-E, Geneva 1990.Google Scholar
  4. 4.
    Cidon, I., Khamisy, A., and Sidi, M., “Analysis of Packet Loss Processes in High-Speed Networks,” IEEE Transactions on Information Theory„ Vol. 39, Jan. 1993, pp. 98–108, 1993.Google Scholar
  5. 5.
    Hebuterne, G., and Gravey, A., “A Space Priority Queueing Mechanism for Multiplexing Channels,” Computer Networks and ISDN Systems, 20, pp. 37–43, 1990.CrossRefGoogle Scholar
  6. 6.
    McAuley, A.J., Reliable broadband communication using a burst erasure correcting code. In Proc. of ACM SIGCOMM'90, Sep 1990.Google Scholar
  7. 7.
    Srinivasan, V., Ghanwani, A., and Gelenbe E., “Block Loss Reduction in ATM Networks,” Duke University Technical Report, 1995.Google Scholar
  8. 8.
    Trivedi, K. S., “Probability and Statistics with Reliability, Queueing, and Computer Science Applications,” Prentice-Hall, Inc., Englewood Cliffs, NJ, USA, 1982.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Vijay Srinivasan
    • 1
  • Anoop Ghanwani
    • 2
  • Erol Gelenbe
    • 2
  1. 1.Department of Computer ScienceDuke UniversityDurhamUSA
  2. 2.Department of Electrical EngineeringDuke UniversityDurhamUSA

Personalised recommendations