Мақаланы E-mail арқылы жіберу Fast protocols for leader election and spanning tree construction in a distributed network
- Авторлар: Vyalyi M.N.1,2,3, Khuziev I.M.3
-
Мекемелер:
- Dorodnitsyn Computing Center of the Russian Academy of Sciences
- National Research University—Higher School of Economics
- Moscow Institute of Physics and Technology (State University)
- Шығарылым: Том 53, № 2 (2017)
- Беттер: 183-201
- Бөлім: Communication Network Theory
- URL: https://journal-vniispk.ru/0032-9460/article/view/166388
- DOI: https://doi.org/10.1134/S0032946017020065
- ID: 166388
Дәйексөз келтіру
Ашық рұқсат
Рұқсат берілді
Тек жазылушылар үшін
Аннотация
We consider leader election and spanning tree construction problems in a synchronous network. Protocols are designed under the assumption that nodes in the network have identifiers but the size of an identifier is unlimited. We present fast protocols with runtime O(D log L+L), where L is the size of the minimal identifier and D is the network diameter.
Авторлар туралы
M. Vyalyi
Dorodnitsyn Computing Center of the Russian Academy of Sciences; National Research University—Higher School of Economics; Moscow Institute of Physics and Technology (State University)
Хат алмасуға жауапты Автор.
Email: vyalyi@gmail.com
Ресей, Moscow; Moscow; Moscow
I. Khuziev
Moscow Institute of Physics and Technology (State University)
Email: vyalyi@gmail.com
Ресей, Moscow
Қосымша файлдар
