Skip to main content
SpringerLink
Log in

Analyzing sharing strategies for finite buffer memory in a router among outgoing channels

  • Computer-Aided Information Control Systems, Process Control Systems
  • Published:
Automation and Remote Control Aims and scope Submit manuscript

Abstract

We propose a model for a transit node in a data transmission network that distributes the incoming flow over several outgoing directions. We study the influence of the quality of communication channels, distribution of the shares of incoming traffic over outgoing directions, and strategies for dividing a limited buffer memory in the transit node among queues to outgoing communication channels on the throughput of the network fragment with incoming and outgoing interfaces of varying performance.

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

Access this article

Log in via an institution

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

References

  1. Froom, R., Sivasubramanian, B., and Frahim, E., Implementing Cisco IP Switched Networks (SWITCH) Foundation Learning Guide, Indianapolis: Cisco Press, 2010.

    Google Scholar 

  2. Teare, D., Implementing Cisco IP Routing (ROUTE) Foundation Learning Guide, Indianapolis: Cisco Press, 2010.

    Google Scholar 

  3. Basharin, G.P., Bocharov, P.P., and Kogan, Ya.A., Analiz ocheredei v vychislitel’nykh setyakh. Teoriya i metody rascheta (Analyzing Queues in Computational Networks. Theory and Methods of Computation), Moscow: Nauka, 1989.

    Google Scholar 

  4. Empson, S., CCNA Routing and Switching Portable Command Guide, Indianapolis: Cisco Press, 2013.

    Google Scholar 

  5. Oppenheimer, P., Top-Down Network Design, Indianapolis: Cisco Press, 2012, 3rd ed.

    Google Scholar 

  6. Wilkins, S.R., Designing for Cisco Internetwork Solutions (DESGN) Foundation Learning Guide, Indianapolis: Cisco Press, 2012, 3rd ed.

    Google Scholar 

  7. Irland, M., Buffer Management in a Packet Switch, IEEE Trans. Commun., 1978, vol. 26, no. 3, pp. 328–337.

    Article  MATH  Google Scholar 

  8. Kamoun, F. and Kleinrock, L., Analysis of Shared Finite Storage in a Computer Network Node Environment under General Traffic Conditions, IEEE Trans. Commun., 1980, vol. 28, no. 7, pp. 992–1003.

    Article  MathSciNet  MATH  Google Scholar 

  9. Basharin, G.P., Boguslavskii, L.B., and Samuilov, K.E., On the Methods of Computing the Throughput in Computer Communication Networks, Itogi Nauki Tekhn., Ser. Elektrosvyaz’, 1983, vol. 13, pp. 32–106.

    Google Scholar 

  10. Basharin, G.P. and Samuilov, K.E., On the Optimal Structure of BP in Data Transmission Networks with Packet Commutation, Preprint of NSK “Kibernetika,” AN SSSR, 1982.

    Google Scholar 

  11. Basharin, G.P., Lektsii po matematicheskoi teorii teletrafika. Uch. posobie (Lectures in the Mathematical Theory of Teletraffic: Textbook), Moscow: Ross. Univ. Druzhby Narodov, 2009, 3rd ed.

    Google Scholar 

  12. Zhozhikashvili, V.A. and Vishnevskii, V.M., Seti massovogo obsluzhivaniya. Teoriya i primenenie k setyam EVM (Queueing Networks. Theory and Application to Computer Networks), Moscow: Radio i Svyaz’, 1988.

    Google Scholar 

  13. Boguslavskii, L.B., Upravlenie potokami dannykh v setyakh EVM (Controlling Data Flows in Computer Networks), Moscow: Energoatomizdat, 1984.

    Google Scholar 

  14. Ivanovskii, V.B., Properties of Output Flows in Discrete Queuinge Systems, Autom. Remote Control, 1984, vol. 45, no. 11, part 1, pp. 1413–1419.

    MathSciNet  Google Scholar 

  15. Kleinrock, L., Queueing Systems, vol. 1: Theory, New York: Wiley, 1975. Translated under the title Vychislitel’nye sistemy s ocheredyami, Moscow: Mir, 1979.

    Google Scholar 

  16. Sushchenko, S.P., On the Influence of Buffer Memory Overfilling on the Operational Characteristics of a Data Transmission Link, Avtom. Vychisl. Tekh., 1985, no. 6, pp. 27–34.

    Google Scholar 

  17. Sushchenko, S.P., The Influence of Buffer Overfilling on the Speed of Synchronous Data-Transmission Control Procedures, Autom. Remote Control, 1999, vol. 60, no. 10, part 2, pp. 1460–1468.

    MATH  Google Scholar 

  18. Mikheev, P.A. and Sushchenko, S.P., Analiz setei abonentskogo dostupa (Analysis of User Access Networks), LAP LAMBERT Acad. Publ., 2012.

    Google Scholar 

  19. Kleinrock, L., Queueing Systems, New York: Wiley, 1976. Translated under the title Teoriya massovogo obsluzhivaniya, Moscow: Mashinostroenie, 1979.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Tomsk State University, Tomsk, Russia

    P. A. Mikheev

Authors
  1. P. A. Mikheev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to P. A. Mikheev.

Additional information

Original Russian Text © P.A. Mikheev, 2014, published in Avtomatika i Telemekhanika, 2014, No. 10, pp. 125–138.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mikheev, P.A. Analyzing sharing strategies for finite buffer memory in a router among outgoing channels. Autom Remote Control 75, 1814–1825 (2014). https://doi.org/10.1134/S0005117914100087

Download citation

  • Received:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1134/S0005117914100087

Keywords

Search

Navigation