OPTIMIZATION OF THE PATH OF CONNECTING TWO POINTS OF A WIRED TELECOMMUNICATION NETWORK WITH INTERVAL UNCERTAINTY OF DATA

Authors

  • I. V. Grebennik Kharkiv National University of Radio Electronics, Ukraine
  • A. Y. Khabarov Production and commercial company "RiKo", Feodosia, Ukraine
  • Yu. A. Gritsenko Kharkiv National University of Radio Electronics, Ukraine
  • D. V. Ivanov Kharkiv National University of Radio Electronics, Ukraine

DOI:

https://doi.org/10.15588/1607-3274-2009-2-10

Abstract

The problem of selection of the best connection between two points of the communication network by the set of criteria under uncertainty is analyzed. The multi-criterion interval model of the problem is constructed; the method of its solving is given.

Author Biographies

I. V. Grebennik, Kharkiv National University of Radio Electronics

Doctor of Engineering Sciences, Professor

A. Y. Khabarov, Production and commercial company "RiKo", Feodosia

Ph.D., research fellow

Yu. A. Gritsenko, Kharkiv National University of Radio Electronics

Master's student

D. V. Ivanov, Kharkiv National University of Radio Electronics

Student

References

Grebennik I. V. Optimizatsiya puti soyedineniya dvukh tochek provodnoy seti elektrosvyazi / Grebennik I. V., Khabarov A. YU. // ASU i pribory avtomatiki. – 2002. – № 120. – S. 38–44.

Dramashko I. A. Aktual'nyye problemy avtomatizatsii tekhnicheskogo ucheta / Dramashko I. A., Krizhevskiy V. S., Kokorin A. B. // Zv’yazok. – 1998. – № 3. – S. 43–46.

Vorobíênko P. P. Formuvannya tekhníchnikh vimog do mís'kikh merezh / Vorobíênko P. P., Leybzon A. YA., Nechiporuk O. L., Chumak M. O. // Zv’yazok. – 2002. – № 2. – S. 16–21.

Stoyan YU. G. Metricheskoye prostranstvo tsentrirovannykh intervalov / Stoyan YU. G. // Dokl. NAN Ukrainy. Ser. A. – 1996. – № 7. – S. 23–25.

Grebennik I. V. Interval'noye otsenivaniye al'ternativ v zadachakh prinyatiya resheniy / Grebennik I. V., Romanova T. Ye., Shekhovtsov S. B. // Kibernetika i sistemnyy analiz. – 2009. – № 2. – S. 106–115.

Ovezgel'dyyev A. O. Sintez i identifikatsiya modeley mnogofaktornogo otsenivaniya i optimizatsii / Ovezgel'dyyev A. O., Petrov E. G., Petrov K. E. – Kiyev : Nauk. dumka, 2002.–164 s.

Algoritmy i programmy resheniya zadach na grafakh i setyakh / Pod red. M. I. Nechepurenko. – Novosibirsk : Nauka, Sib. otd., 1990. – 520 s.

Downloads

Published

2024-10-02

How to Cite

Grebennik, I. V., Khabarov, A. Y., Gritsenko, Y. A., & Ivanov, D. V. (2024). OPTIMIZATION OF THE PATH OF CONNECTING TWO POINTS OF A WIRED TELECOMMUNICATION NETWORK WITH INTERVAL UNCERTAINTY OF DATA. Radio Electronics, Computer Science, Control, (2), 57. https://doi.org/10.15588/1607-3274-2009-2-10

Issue

No. 2 (2009): Radio Electronics, Computer Science, Control

Section

Mathematical and computer modelling

License

Copyright (c) 2014 I. V. Grebennik, A. Y. Khabarov, Yu. A. Gritsenko, D. V. Ivanov

Creative Commons License

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

Creative Commons Licensing Notifications in the Copyright Notices

The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.

The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.

The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.