A Shared-Memory Packet Buffer Management in a Network Interface Card | SpringerLink
Skip to main content
Springer Nature Link
Log in

A Shared-Memory Packet Buffer Management in a Network Interface Card

  • Conference paper
Management of Convergence Networks and Services (APNOMS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 4238))

Included in the following conference series:

  • 578 Accesses

Abstract

This paper proposes a dynamic shared-memory packet buffer management algorithm for a protocol processor in a network terminal. The protocol processor is located in a network interface card (NIC). In general, two types of packet buffer management algorithms, static and dynamic, can be used in a NIC; the dynamic buffer management algorithms work better than the static ones for reducing the packet loss ratio. However, conventional dynamic buffer management algorithms do not provide even packet losses to all the applica-tions. Therefore, we propose an algorithm to enhance even packet losses and the proposed algorithm improves the packet loss ratio by 11.80% to 16.70% compared to other conventional dynamic algorithms.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Henriksson, T., Nordqvist, U., Liu, D.: Embedded Protocol Processor for fast and efficient packet reception. In: IEEE Proceedings on Computer Design: VLSI in Computers and Processors, vol. 2, pp. 414–419 (September 2002)

    Google Scholar 

  2. Nordqvist, U., Liu, D.: Power optimized packet buffering in a protocol processor. In: Proceedings of the 2003 10th IEEE International Conference on Electronics, Circuits and Systems, vol. 3, pp. 1026–1029 (December 2003)

    Google Scholar 

  3. Arpaci, M., Copeland, J.A.: Buffer Management for Shared Memory ATM Switches. IEEE Communication Surveys, First Quarter (2000)

    Google Scholar 

  4. Kamoun, F., Kleinrock, L.: Analysis of Shared Finite Storage in a Computer Network Node Environment under General Traffic Conditions. IEEE Transactions on Communications COM-28, 992–1003 (1980)

    Article  MathSciNet  Google Scholar 

  5. Choudhury, A.K., Hahne, E.L.: Dynamic Queue Length Thresholds for Shared-Memory Packet Switches. IEEE/ACM Transactions on Communications 6(2), 130–140 (1998)

    Article  Google Scholar 

  6. Chu, Y., Rajan, V.: An Enhanced Dynamic Packet Buffer Management. In: The proceedings of the 10th IEEE Symposium on Computers and Communications (ISCC 2005), Cartagena, Spain (June 2005)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Electrical and Computer Engineering Department, Mississippi State University, MS, 39762, USA

    Amit Uppal & Yul Chu

Authors
  1. Amit Uppal
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yul Chu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Information & Communication Engineering, Graduate School, Yeungnam University, 214-1, Dae-Dong, Gyeongsan-Si, 712-749, Gyeongbook, Korea

    Young-Tak Kim

  2. NTT West Corporation, 6-2-82 Shimaya, 554-0024, Konohana-ku Osaka, Japan

    Makoto Takano

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Uppal, A., Chu, Y. (2006). A Shared-Memory Packet Buffer Management in a Network Interface Card. In: Kim, YT., Takano, M. (eds) Management of Convergence Networks and Services. APNOMS 2006. Lecture Notes in Computer Science, vol 4238. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11876601_55

Download citation

  • DOI: https://doi.org/10.1007/11876601_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45776-3

  • Online ISBN: 978-3-540-46233-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics