Geodesic
Multi-criterial routing of information flows
Problemy fiziki, matematiki i tehniki, no. 2 (2017), pp. 84-90 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

Traditionally, path selection within routing is formulated as the shortest path optimization problem. In this paper, multi-criteria routing based on a mixed weight is considered. It is shown how this approach can be used to develop two heuristic algorithms for searching the optimal path with minimum delay, minimum delay variation, providing the given bandwidth, minimum loss probability and minimum cost of information transmission.
Keywords: multi-criteria routing, mixed weight, delay, delay variation, loss probability, bandwidth, shortest path, Dijkstra's Algorithm
Mots-clés : cost of information transmission. 
@article{PFMT_2017_2_a14,
     author = {N. I. Listopad and Yu. I. Vorotnitsky and V. V. Bortnovsky and A. A. Hayder},
     title = {Multi-criterial routing of information flows},
     journal = {Problemy fiziki, matematiki i tehniki},
     pages = {84--90},
     year = {2017},
     number = {2},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PFMT_2017_2_a14/}
}
TY  - JOUR
AU  - N. I. Listopad
AU  - Yu. I. Vorotnitsky
AU  - V. V. Bortnovsky
AU  - A. A. Hayder
TI  - Multi-criterial routing of information flows
JO  - Problemy fiziki, matematiki i tehniki
PY  - 2017
SP  - 84
EP  - 90
IS  - 2
UR  - http://geodesic.mathdoc.fr/item/PFMT_2017_2_a14/
LA  - ru
ID  - PFMT_2017_2_a14
ER  - 
%0 Journal Article
%A N. I. Listopad
%A Yu. I. Vorotnitsky
%A V. V. Bortnovsky
%A A. A. Hayder
%T Multi-criterial routing of information flows
%J Problemy fiziki, matematiki i tehniki
%D 2017
%P 84-90
%N 2
%U http://geodesic.mathdoc.fr/item/PFMT_2017_2_a14/
%G ru
%F PFMT_2017_2_a14
N. I. Listopad; Yu. I. Vorotnitsky; V. V. Bortnovsky; A. A. Hayder. Multi-criterial routing of information flows. Problemy fiziki, matematiki i tehniki, no. 2 (2017), pp. 84-90. http://geodesic.mathdoc.fr/item/PFMT_2017_2_a14/

[1] N.I. Listopad, Yu.I. Vorotnitskii, A.A. Khaider, “Optimalnaya marshrutizatsiya v multiservisnykh setyakh telekommunikatsii na osnove modifitsirovannogo algoritma Deikstry”, Vestnik BGU. Ceriya 1, 2015, no. 1, 70–76

[2] W.A. Mahmoud, D.J. Kadhim, “A Proposal Algorithm to Solve Delay Constraint Least Cost Optimization Problem”, Journal of Engineering. University of Baghdad, 19:1 (2013), 155–160