Informatics and Applications
2018, Volume 12, Issue 4, pp 25-32
OPTIMIZATION OF BUFFER MEMORY SIZE OF SWITCHING NODE IN MODE OF FULL MEMORY SHARING
Abstract
The problem of optimizing the volume of the buffer memory of the network switching node with the CP (Complete Partitioning) is considered, which uses a scheme for the complete memory sharing between the output transmission lines, taking into account packet loss due to memory overflow and average packet delays. The properties of the solution of the problem are obtained, and an algorithm for searching for the optimal volume is developed for the switching node model with Poisson incoming flows, common service time distributions, and single-channel output transmission lines. Within the given model, an algorithm for finding the optimal buffer memory allocation plan for a given volume is developed. The results of computational experiments using the developed algorithms are presented. The applicability of the proposed algorithms and approaches is obtained in the framework of the switching node model with recurrent incoming flows, exponential service times, and single-channel transmission lines.
[+] References (14)
- Kleinrock, L. 1976. Queueing systems. Vol. II: Computer applications. New York, NY: Wiley. 549 p.
- Davies, D.W, D. L.A. Barber, W. L. Price, and C. M. Solomonides. 1979. Computer networks and their protocols. New York, NY: Wiley. 487 p.
- Irland, M. 1978. Buffer management in a packet switch. IEEE T. Commun. 26(3):328-337.
- Kamoun, F, and L. Kleinrock. 1980. Analysis of shared finite storage in a computer networks node environment under general traffic conditions. IEEE Trans. Commun. 28(7):992-1003.
- Basharin, G. P., and K. E. Samuilov. 1982. Ob optimal'noy strukture bufernoy pamyati v setyakh peredachi dannykh s kommutatsiey paketov [On the optimal structure of BP in data transmission networks with packet commutation]. - Moscow. 70 p.
- Mikheev, P. A. 2014. Analyzing sharing strategies for finite buffer memory in a router among outgoing channels. Automat. Rem. Contr. 75(10):1814-1825.
- Forschini, G., and B. Gopinath. 1983. Sharing memory optimally IEEE T. Commun. 31(3): 352-359.
- Agalarov, Ya. M. 2003. Dvukhstupenchatoe adaptivnoe upravlenie potokami v uzle kommutatsii telekommunikatsionnoy seti [Two-level flow control for a switching node of communication network]. Vestnik RUDN. Ser. Prik- ladnaya matematika i informatika [PFUR Bull., Applied Mathematics and Computer Science] 1:134-141.
- Linets, G. I. 2010. Upravlenie ob"emombufernoy pamyati i propusknoy sposobnost'yu kanalov v mul'tiservisnykh
setyakh [Volume management of buffer memory and throughput of channels in multiservice networks]. In- fokommunikatsionnye tekhnologii [Information Commu-nication Technologies] 6(2):62-64.
- Zhernovyy, Ju. V. 2010. Reshenie zadach optimal'nogo sinteza dlya nekotorykh markovskikh modeley ob- sluzhivaniya [Solution of optimum synthesis problem for some Markov models of service]. Informatsionnye protsessy [Information Processes] 10(3):257-274.
- Agalarov, Ya.M., M. Ya. Agalarov, andV. S. Shorgin. 2016. Ob optimal'nom porogovom znachenii dliny ochere- di v odnoy zadache maksimizatsii dokhoda SMO tipa M/G/1 [About the optimal threshold of queue length in particular problem of profit maximization in M/G/1 queueing system]. Informatika iee Primeneniya - Inform. Appl. 10(2):70-79.
- Agalarov, Ya.M. 2017. Maksimizatsiya srednego statsio- narnogo dokhoda SMO tipa M/G/1 [Maximization of average stationary profit in M/G/1 queuing system]. Informatika i ee Primeneniya - Inform. Appl. 11(2):25-32.
- Agalarov, Ya.M., and V. S. Shorgin. 2016. Ob odnoy zadache maksimizatsii dokhoda sistemy massovogo ob- sluzhivaniya tipa G/M/1 s porogovym upravleniem ochered'yu [Profit maximization in G/M/1 queuing system on a set of threshold strategies with two switch points]. Informatika i ee Primeneniya - Inform. Appl. 11(4): 55-64.
- Bocharov, P.P., and A.V. Pechinkin. 1995. Teoriya massovogo obsluzhivaniya [Queueing theory]. Moscow: RUDN. 529 p.
[+] About this article
Title
OPTIMIZATION OF BUFFER MEMORY SIZE OF SWITCHING NODE IN MODE OF FULL MEMORY SHARING
Journal
Informatics and Applications
2018, Volume 12, Issue 4, pp 25-32
Cover Date
2018-12-30
DOI
10.14357/19922264180404
Print ISSN
1992-2264
Publisher
Institute of Informatics Problems, Russian Academy of Sciences
Additional Links
Key words
switching node; flow management; buffer memory allocation; optimal buffer memory capacity
Authors
Yà. M. Agalarov 
Author Affiliations
Institute of Informatics Problems, Federal Research Center "Computer Science and Control" of the Russian Academy of Sciences, 44-2 Vavilov Str., Moscow 119333, Russian Federation
|