Skip to main content

Loss Rate Aware Preferential Treamtment Scheme at the Congested Router

  • Conference paper
  • 754 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3758))

Abstract

One weakness of the RED algorithm typical of routers is that at any given time, it imposes the same loss probability on all flows, regardless of their QoS. In this paper, we propose an improved packet discard algorithm based on RED for real-time multimedia service, which does its endeavor to avoid dropping packets from the same flow continuously in terms of instantaneous loss rate and short-time average loss rate. It traces the concerned flow’s state whenever every packet’s arrival and then dynamically adjusts the packet drops to achieve a given loss rate. When network is congested, it drops all packets of certain invalid flows mandatorily to avoid a majority of applications being invalidated simultaneously because of packet loss. Our evaluation results indicate that the proposed algorithm provides better QoS for real-time multimedia service, whether network is congested or not.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Braden, B., Clark, D., Crowcroft, J., et al.: Recommendations on Queue Management and Congestion Avoidance in the Internet. RFC 2309 (April 1998)

    Google Scholar 

  2. Floyd, S., Jacobson, V.: Random Early Detection Gateways for Congestion Avoidance. IEEE/ACM Transactions on Networking 1(4), 397–413 (1993)

    Article  Google Scholar 

  3. Mankin, A., Ramakrishnan, K.: Gateway Congestion Control Survey, RFC 1254 (August 1991)

    Google Scholar 

  4. May, M., Bolot, J., Diot, C., Lyles, B.: Reasons not to Deploy RED. In: IWQoS 1999, London, U.K, pp. 260–262 (June 1999)

    Google Scholar 

  5. Christiansen, M., Jeffay, K., Ott, D., Donelson Smith, F.: Tuning RED for Web Traffic. In: ACM/SIGCOMM, Stockholm, Sweden, pp. 139–150 (2000)

    Google Scholar 

  6. Iannaccone, G., Brandauet, C., Ziegler, T., et al.: Comparison of Tail Drop and Active Queue Management Performance for Bulk-data and Web-like Internet Traffic. In: IEEE ISCC, July 2001, pp. 122–129 (2001)

    Google Scholar 

  7. Lin, D., Morris, R.: Dynamics of Random Early Detection. In: ACM/SIGCOMM, Cannes, France, September 1997, pp. 127–137 (1997)

    Google Scholar 

  8. Feng, W., Kandlur, D.D., Saha, D., Shin, K.G.: A Self-configuring RED Gateway. In: IEEE INFOCOM 1999, New York, USA, March 1999, vol. 3, pp. 1320–1328 (1999)

    Google Scholar 

  9. Sun, J., Ko, K.-T., Chen, G., Chan, S., Zukerman, M.: PD-RED: to Improve the Performance of RED. IEEE Communications Letters 7(8), 406–408 (2003)

    Article  Google Scholar 

  10. Ott, T.J., Lakshman, T.V., Wong, L.H.: SRED: Stabilized RED. In: IEEE INFOCOM 1999, New York, USA, March 1999, vol. 3, pp. 1346–1355 (1999)

    Google Scholar 

  11. Pan, R., Prabhakar, B., Psounis, K.: CHOKe: A Stateless Active Queue Management Scheme for Approximating Fair Bandwidth Allocation. In: IEEE INFOCOM 2000, Tel Aviv, Israel, March 2000, pp. 942–951 (2000)

    Google Scholar 

  12. Anjum, F.M., Tassiulas, L.: Fair Bandwidth Sharing Among Adaptive and Non-Adaptive Flows in the Internet. In: IEEE INFOCOM, New York, USA, March 1999, vol. 3, pp. 1412–1420 (1999)

    Google Scholar 

  13. Cisco Systems Inc. Weighted Random Early Detection on the Cisco 12000 Series Router (March 2002)

    Google Scholar 

  14. Mahajan, R., Floyd, S., Wetherall, D.: Controlling High-bandwidth Flows at the Congested Router. In: IEEE/ACM 9th ICNP, Riverside, CA, November 2001, pp. 192–201 (2001)

    Google Scholar 

  15. Wen, S., Li, L., Sun, H.: An Algorithm to Protect TCP Bandwidth Based on Packet-drop History in RED. In: IEEE CCS/WSE 2002, June 2002, vol. 1, pp. 700–704 (2002)

    Google Scholar 

  16. Teijeiro-Ruiz, D., et al.: On fair bandwidth sharing with RED. In: Yazıcı, A., Şener, C. (eds.) ISCIS 2003. LNCS, vol. 2869, pp. 892–899. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  17. Tao, L., Subramanian, K.R., Feng, H., Deng, X.F.: Weighted Fair Discard Scheme for Buffer Management in the Presence of Network Congestion. Computer Communications 25(10), 944–953 (2002)

    Article  Google Scholar 

  18. McCanne, S., Floyd, S.: Ns2 Network Simulator, http://www.isi.edu/nsnam/ns

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zhao, D., Zhang, D., Cao, J., Zheng, W., An, Z. (2005). Loss Rate Aware Preferential Treamtment Scheme at the Congested Router. In: Pan, Y., Chen, D., Guo, M., Cao, J., Dongarra, J. (eds) Parallel and Distributed Processing and Applications. ISPA 2005. Lecture Notes in Computer Science, vol 3758. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11576235_35

Download citation

  • DOI: https://doi.org/10.1007/11576235_35

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29769-7

  • Online ISBN: 978-3-540-32100-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics