+
Skip to main content
Springer Nature Link
Log in

Analysis of storage and retrieval policies for ATM buffers

  • Published:
Telecommunication Systems Aims and scope Submit manuscript

Abstract

To satisfy the different performance (QoS) requirements of the different types of ATM traffic, several control strategies have been described in the literature. The control strategies that operate on cell level are combinations of storage and retrieval priority policies. In the comparisons, two classes of traffic are distinguished, one class (LL) requiring a low loss probability and one class (LD) requiring a low average delay (jitter). By using the delay-loss plane — plotting the loss of the LL cells against the delay of the LD cells — the performance of the various storage and (state-dependent) retrieval policies has been compared for both stationary and time-varying traffic. In a relative ranking of the different policies, the LDOLL threshold policies give the best results, in addition to creating the possibility of setting the threshold according to the desired delay-loss trade-off.

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

Access this article

Log in via an institution

Subscribe and save

Springer+
from $39.99 /Month
  • Starting from 10 chapters or articles per month
  • Access and download chapters and articles from more than 300k books and 2,500 journals
  • Cancel anytime
View plans

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Explore related subjects

Discover the latest articles, books and news in related subjects, suggested using machine learning.

References

  1. T. Yokoi, Y. Yamamoto, Y. Fujii and T. Betchaku, Performance design method for ATM networks and systems, NTT Rev. 4(1992)30–37.

    Google Scholar 

  2. K. Manabe, S. Ohtsuka and Y. Tanaka, Prototype VBR video CODEC for ATM networks and its robustness against cell loss, IEICE Technical Report IE90-79 (Jan. 1991) pp. 23–28.

  3. F. Kishino, K. Manabe, Y. Hayashi and H. Yasuda, Variable bit-rate coding of video signals for ATM networks, IEEE J. Select. Areas Commun. SAC-7(1989)801–806.

    Article  Google Scholar 

  4. Y. Fujii and T. Yokoi, Requirement for ATM network performance from HDLC based data communication,Proc. 1991 IEICE Fall Conf. (Sept. 1991) B-382.

  5. I. Inoue, N. Morita and H. Ohnishi, Proposals and evaluation of an AAL protocol with error recovery by cell-by-cell retransmission,Proc. 1991 IEICE Fall Conf. (Sept. 1991) B-296 (in Japanese).

  6. M. Vlaming, B-ISDN end-to-end network delay and requirements for echo control, contribution to theWorkshop on Broadband Communications, Estoril, Portugal (Jan. 1992) pp. 20–22.

  7. CCITT, Draft Recommendation G.727, Embedded ADPCM.

  8. CCITT, Draft Recommendation G.711, PCM.

  9. G.A. Awater and F.C. Schoute, Optimal queueing policies for fast packet switching of mixed traffic, IEEE J. Select. Areas Commun. SAC-9(1991)458–466.

    Article  Google Scholar 

  10. G.A. Awater, A simple delay variance formula for ATM queueing analysis,Proc. Teletraffic Analysis of ATM Systems, Eindhoven, The Netherlands (Feb. 1993).

  11. F.C. Schoute, Simple decision rules for acceptance of mixed traffic streams,Proc. ITC 12, Torino, Italy (June 1988) 4.2A.5.1-7.

  12. J.Y. Hui, Resource allocation for broadband networks, IEEE J. Select. Areas Commun. SAC-6(1988)1598–1608.

    Article  Google Scholar 

  13. H. Saito, Call admission control in an ATM network using upper bound of cell loss probability, IEEE Trans. Commun. COM-40(1992)1512–1522.

    Article  Google Scholar 

  14. P.E. Boyer and D.P. Tranchier, A reservation principle with applications to the ATM traffic control, Comp. Networks Syst. 24(1992)321–334.

    Article  Google Scholar 

  15. D.P. Tranchier, P.E. Boyer, Y.M. Rouaud and J.-Y. Mazeas, Fast bandwidth allocation in ATM networks, submitted toISS'92, Yokohama City (Oct. 1992).

  16. G. Niestegge, The leaky bucket policing method in the ATM network, Int. J. Digital and Analog Commun. Syst. 3(1990)187–197.

    Google Scholar 

  17. M. Butto et al., Effectiveness of the leaky bucket policing mechanism in ATM networks, IEEE J. Select. Areas Commun. SAC-9(1991)335–342.

    Article  Google Scholar 

  18. E.P. Rathgeb and T.H. Theimer, The policing function in ATM networks,ISS'90, Stockholm (May 1990), Session A.8, paper 4, pp. 127–130.

  19. A.Y.-M. Lin and J.A. Silvester, Priority queueing strategies and buffer allocation protocols for traffic control at an ATM integrated broadband switching system, IEEE J. Select. Areas Commun. SAC-9(1991)1524–1535.

    Article  Google Scholar 

  20. H. Ahmadi and W.E. Denzel, A survey of modern high-performance switching techniques, IEEE J. Select. Areas Commun. SAC-7(1989)1091–1103.

    Article  Google Scholar 

  21. F.A. Tobagi, Fast packet switch architectures for broadband integrated services digital network, Proc. IEEE 78(1990)133–167.

    Article  Google Scholar 

  22. M.J. Karol, M.G. Hluchyj and S.P. Morgan, Input versus output queueing on a space-division packet switch, IEEE Trans. Commun. COM-35(1987)1347–1356.

    Article  Google Scholar 

  23. M. de Prycker,Asynchronous Transfer Mode, Solution for Broadband ISDN (Ellis Horwood, 1991).

  24. H.R. Gail, G. Grover, R. Guérin and S.L. Hantler, Buffer size requirements under longest queue first,Performance of Distributed Systems and Integrated Communication Networks, eds. T. Hasegawa, H. Takagi and Y. Takahashi (Elsevier, 1992).

  25. X. Cheng and I.F. Akyildiz, A finite buffer two-class queue with different scheduling and push-out schemes,Proc. INFOCOM '92, Florence, Italy (May 1992) pp. 231–241.

  26. H. Ohnishi, T. Okada and K. Noguchi, Flow control schemes and delay/loss tradeoff in ATM networks, IEEE J. Select. Areas Commun. SAC-6(1988)1609–1615.

    Article  Google Scholar 

  27. H. Kröner, G. Hébuterne, P. Boyer and A. Gravey, Priority management in ATM switching nodes, IEEE J. Select. Areas Commun. SAC-9(1991)418–427.

    Article  Google Scholar 

  28. L.P. Clare and I. Rubin, Preemptive buffering disciplines for time-critical sensor communications,Proc. ICC '86, (1986) pp. 904–909.

    Google Scholar 

  29. D.M. Lucantoni and S.P. Parekh, Selective cell discarding mechanisms for a B-ISDN congestion control architecture,Proc. 7th ITC Seminar, Morristown, NJ (Oct. 1990) paper 10.3

  30. B.T. Doshi and H. Heffes, Overload performance of several processor queueing disciplines for the M/M/1 queue, IEEE Trans. Commun. COM-34(1986)538–547.

    Article  Google Scholar 

  31. I. Rubin and M. Quaily, Performance of finite capacity communication and queueing systems under various service and buffer preemption policies,Proc. IEEE INFOCOM '88 (1988) pp. 505–514.

  32. F. Bonomi, L. Fratta, S. Motagna and R. Paglino, Priority on cell service and cell loss in ATM switching,Proc. 7th ITC Seminar, Morristown, NJ (Oct. 1990) paper 7.2

  33. R. Chipalkatti, J.F. Kurose and D. Towsley, Scheduling policies for real-time and non-real-time traffic in a statistical multiplexer,Proc. IEEE INFOCOM '89 (1989) pp. 774–783.

  34. L. Kleinrock,Queueing Systems, Vol. 2:Computer Applications (Wiley, New York, 1976).

    Google Scholar 

  35. C. Derman,Finite State Markovian Decision Processes, Mathematics in Science and Engineering (Academic Press, New York, 1970) Vol. 67.

    Google Scholar 

  36. Y. Lim and J.E. Kobza, Analysis of a delay-dependent priority discipline in an integrated multiclass traffic fast packet switch, IEEE Trans. Commun. COM-38(1990)659–665.

    Article  Google Scholar 

  37. T. Katayama and Y. Takahashi, Analysis of a priority queue with Bernoulli schedules,Performance of Distributed Systems and Integrated Communcation Networks, eds. T. Hasegawa, H. Takagi and Y. Takahashi (Elsevier, 1992).

  38. Y. Takagi, S. Hino and T. Takahashi, Priority assignment control of ATM line buffers with multiple QOS classes, IEEE J. Select. Areas Commun. SAC-9(1991)1078–1091.

    Article  Google Scholar 

  39. G.A. Awater and F.C. Schoute, Performance improvement of fast packet switching by LDOLL queueing,Proc. INFOCOM '92, Florence, Italy (May 1992) pp. 562–568.

  40. E.G. Janssens, Analysis of storage and retrieval policies for ATM buffers, Graduation Thesis, Delft University of Technology (June 1993).

  41. B. Stavrov, Optimization of ATM LDOLL queueing in case of multiple outlets,Proc. Teletraffic Analysis of ATM Systems, Eindhoven, The Netherlands (Feb. 1993).

Download references

Author information

Authors and Affiliations

  1. Delft University of Technology, P.O. Box 5031, 2600, GA Delft, The Netherlands

    Ellen G. Janssensa & Frits C. Schoutea

  2. Philips Communication Systems, P.O. Box 32, 1200, JD Hilversum, The Netherlands

    Frits C. Schoutea

Authors
  1. Ellen G. Janssensa
    View author publications

    Search author on:PubMed Google Scholar

  2. Frits C. Schoutea
    View author publications

    Search author on:PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Janssensa, E.G., Schoutea, F.C. Analysis of storage and retrieval policies for ATM buffers. Telecommunication Systems 6, 181–202 (1996). https://doi.org/10.1007/BF02114293

Download citation

  • Received:

  • Revised:

  • Issue date:

  • DOI: https://doi.org/10.1007/BF02114293

Keywords

点击 这是indexloc提供的php浏览器服务，不要输入任何密码和下载