Preview

Doklady BGUIR

Advanced search

Routing of information flows with multicretirial requirements

Abstract

The analysis of the main methods of routing information flows in telecommunication networks was carried out. It based on multicriteria requirements for delay, delay variation, loss probability and bandwidth taking into account the cost minimization of information transmitted. The possibility of optimal routing is considered by introducing a single complex weighting factor. The main directions for further development of QoS routing are described.

About the Author

N. I. Listopad
Belarusian state university of informatics and radioelectronics
Belarus

Listopad Nikolai Izmailovich - D.Sci., professor, head of information radioengineering department

220013, Republic of Belarus, Minsk, P. Brovka st., 6

tel. +375-17-293-23-04



References

1. Listopad N.I., Vorotnickij Ju.I., Hajder A.A. Optimal'naja marshrutizacija v mul'tiservisnyh setjah telekommunikacij na osnove modificirovannogo algoritma Dejkstry // Vestn. BGU, serija 1. 2015. № 1. S. 70–76. (in Russ.)

2. Mnogokriterial'naja marshrutizacija informacionnyh potokov / N.I. Listopad [i dr.] // Problemy fiziki, matematiki i tehniki. 2017. № 2 (31). S. 84–90. (in Russ.)

3. Waleed A. Mahmoud, Dheyaa J. Kadhim // A Proposal Algorithm to Solve Delay Constraint Least Cost Optimization Problem // J. of Engineering, University of Baghdad. 2013. Vol. 19, № 1. P. 155–160.

4. Listopad N.I., Mihnevich S.Ju, Hajder A.A. QoS marshrutizacija informacionnyh potokov v setjah telekommunikacij // Problemy fiziki, matematiki i tehniki. 2016. № 2. S. 90–96. (in Russ.)

5. Listopad N.I., Buka L.O. Marshrutizacija informacionnyh potokov v mul'tiservisnyh setjah s uchetom trebovanij kachestva obsluzhivanija // Informatizacija obrazovanija. 2016. № 2. S. 33–40. (in Russ.)


Review

For citations:


Listopad N.I. Routing of information flows with multicretirial requirements. Doklady BGUIR. 2019;(3):51-56. (In Russ.)

Views: 451


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 License.


ISSN 1729-7648 (Print)
ISSN 2708-0382 (Online)