Мақаланы E-mail арқылы жіберу Improving System Survivability by Path Duplication
- Авторлар: Burdonov I.B.1, Yevtushenko N.V.1,2, Kossatchev A.S.1
-
Мекемелер:
- Institute for System Programming of the Russian Academy of Sciences
- National Research University Higher School of Economics
- Шығарылым: № 4 (2025)
- Беттер: 11-32
- Бөлім: PARALLEL AND DISTRIBUTED SOFTWARE
- URL: https://journal-vniispk.ru/0132-3474/article/view/349250
- DOI: https://doi.org/10.7868/S3034584725040027
- ID: 349250
Дәйексөз келтіру
Ашық рұқсат
Рұқсат берілді
Тек жазылушылар үшін
Аннотация
In this paper, the problem of the distributed network survivability is investigated. A distributed system is modeled by a finite connected undirected graph whose nodes are divided into two types: hosts and switches. Hosts perform computational functions, while switches are utilized for providing the message delivery between hosts. The system survivability is considered as the system ability to perform the main functions of message transmission after graph edges’ failures. The solution for the system survivability is provided by duplicating the paths for message transmitting. The main condition for the correct solution is the absence of message looping in the network for any set of selected paths. The four-path theorem is proved for the case of two recipient hosts: if for each recipient host there are two paths from the sending host and the edge sets traversed by these paths are disjoint, then there is no message looping for this set of the paths.
Авторлар туралы
I. Burdonov
Institute for System Programming of the Russian Academy of Sciences
Email: igor@ispras.ru
25 Alexander Solzhenitsyn st., Moscow, 109004, Russia
N. Yevtushenko
Institute for System Programming of the Russian Academy of Sciences; National Research University Higher School of Economics
Email: evtushenko@ispras.ru
25 Alexander Solzhenitsyn st., Moscow, 109004, Russia; 20 Myasnitskaya st., Moscow, 101000, Russia
A. Kossatchev
Institute for System Programming of the Russian Academy of Sciences
Email: kos@ispras.ru
25 Alexander Solzhenitsyn st., Moscow, 109004, Russia
Әдебиет тізімі
- Голуб Б.В., Кузнецов Е.М., Максимов Р.В. Методика оценки живучести распределенных информационных систем // Вестник СамГУ. 2014. № 7(118). https://cyberleninka.ru / article / n / metodika-otsenki-zhivuchesti-raspredelennyh-informatsionnyh-sistem (дата обращения: 09.10.2024)
- Харари Ф. Теория графов. М.: Мир, 1973. 300 с.
- Бурдонов И.Б., Евтушенко Н.В., Косачев А.С. Тестирование правил настройки сетевого коммутатора программно-конфигурируемой сети. Труды Института системного программирования РАН. 2018. Т. 30. № 6. С. 69–88.
- Burdonov I.B., Kossachev A., Yevtushenko N., López J., Kushik N., Zeghlache D. Verifying SDN Data Path Requests. CoRR abs / 1906.03101 (2019).
- Burdonov I., Yevtushenko N., Kossachev A. Implementing a Virtual Network on the SDN Data Plane. Proceedings 2020 IEEE East-West Design & Test Symposium (EWDTS). Varna, Bulgaria, September 4–7. 2020. Р. 279–283. ISBN: 978-1-7281-9898-9.
- Burdonov I., Kossachev A., Yevtushenko N., López J., Kushik N., Zeghlache D. (2021). Preventive Model-based Verification and Repairing for SDN Requests. In Proceedings of the 16th International Conference on Evaluation of Novel Approaches to Software Engineering – ENASE. ISBN 978-989-758-508-1. ISSN 2184-4895. P. 421–428. DOI: 10.5220 / 0010494504210428.
- Nash-Williams C.St.J.A. Edge-disjoint spanning trees of finite graphs // J. London Math. Soc. 1961. P. 445–450.
Қосымша файлдар
