Методи багатокритеріальної маршрутизації в елекомунікаційних мережах
Вантажиться...
Файли
Дата
2018
Автори
Стецюк, В.І.
Любчик, В.Р.
Семенюк, А.С.
Stetsyuk, V.I.
Lubchik, V.R.
Semenyuk, A.S.
Назва журналу
Номер ISSN
Назва тому
Видавець
Хмельницький національний університет
Анотація
В роботі розглянуто алгоритми маршрутизації, основані на графовому описі мережі зв’язку, проведено їх
аналіз, вказано на переваги та недоліки кожного методу. Проаналізовані недоліки алгоритмів пошуку
найкоротшого єдиного шляху між кожною парою вузлів у мережі, пов’язані з обмеженими можливостями
забезпечення збалансованого завантаження мережі та якості обслуговування одночасно за декількома
показниками, оскільки кожному тракту передачі мережі ставилося у відповідність усього одне число (довжина,
метрика), пов’язане з тим або іншим одним показником якості обслуговування. До обмежень, що накладаються на
маршрут, відносяться пропускна здатність і часова затримка передачі даних в каналі. Відзначені недоліки мають
послужили поштовхом до досить інтенсивних розробок у напрямку вдосконалення розглянутих алгоритмів та
розробки оптимальних маршрутів практично для будь-якого типу сервісу телекомунікаційних мереж (звук, відео,
дані тощо).
Modern society is unthinkable without the use of telecommunication technologies, which allow the use of communication networks not only for the regular browsing of web pages and the sending of e-mails, but for the transmission of voice and video. Given the low cost of telecommunication services, this process can be considered a revolution of communication, because in a fraction of a second you can see a subscriber from another country or even another continent. At the same time, the technically competent organization of this process is a serious task for both telecommunication specialists and software engineers. Until recently, television, telephone and internet services were provided to users on various access networks. However, in telecommunications, a new stage in the development of the industry began, namely the convergence of traffic. Now, on the same access networks, users can receive the full spectrum of information and communication services. However, routing methods that were used for traffic of a single type of service became ineffective for packet traffic of various services. In this paper, routing algorithms based on the graph description of the communication network are considered as the most optimal and visually perceptive method of analysis. A detailed analysis of the most promising algorithms is carried out, the advantages and disadvantages of each method are indicated. The disadvantages of algorithms for finding the shortest (that is, the only) path between each pair of nodes in the network are due to the limited ability to ensure a balanced load of the network and the quality of service at the same time for several indicators, since each network path of transmission was put in correspondence with only one number (length, metric), related to one or another QoS Quality Score. The restrictions imposed on the route include: bandwidth and time delay data transmission in the channel. The noted disadvantages have served as a stimulus to rather intensive developments in the direction of improving the considered algorithms and the development of optimal routes for virtually any type of service in telecommunication networks.
Modern society is unthinkable without the use of telecommunication technologies, which allow the use of communication networks not only for the regular browsing of web pages and the sending of e-mails, but for the transmission of voice and video. Given the low cost of telecommunication services, this process can be considered a revolution of communication, because in a fraction of a second you can see a subscriber from another country or even another continent. At the same time, the technically competent organization of this process is a serious task for both telecommunication specialists and software engineers. Until recently, television, telephone and internet services were provided to users on various access networks. However, in telecommunications, a new stage in the development of the industry began, namely the convergence of traffic. Now, on the same access networks, users can receive the full spectrum of information and communication services. However, routing methods that were used for traffic of a single type of service became ineffective for packet traffic of various services. In this paper, routing algorithms based on the graph description of the communication network are considered as the most optimal and visually perceptive method of analysis. A detailed analysis of the most promising algorithms is carried out, the advantages and disadvantages of each method are indicated. The disadvantages of algorithms for finding the shortest (that is, the only) path between each pair of nodes in the network are due to the limited ability to ensure a balanced load of the network and the quality of service at the same time for several indicators, since each network path of transmission was put in correspondence with only one number (length, metric), related to one or another QoS Quality Score. The restrictions imposed on the route include: bandwidth and time delay data transmission in the channel. The noted disadvantages have served as a stimulus to rather intensive developments in the direction of improving the considered algorithms and the development of optimal routes for virtually any type of service in telecommunication networks.
Опис
Ключові слова
мережа, телекомунікації, алгоритм, тракт, зв’язок, пропускна здатність, маршрут, сервіс, network, telecommunications, algorithm, path, communication, bandwidth, route, service
Бібліографічний опис
Стецюк, В.І. Методи багатокритеріальної маршрутизації в телекомунікаційних мережах [Текст] / В. І. Стецюк, В. Р. Любчик, А. С. Семенюк // Вісник Хмельницького національного університету. Технічні науки. – 2018. – № 6, т. 2. – С. 198-201.