Cite

Worst, best and average number of messages and running time of leader election algorithms of different distributed systems are analyzed. Among others the known characterizations of the expected number of messages for LCR algorithm and of the worst number of messages of Hirschberg-Sinclair algorithm are improved

eISSN:
2066-7752
Idioma:
Inglés
Calendario de la edición:
2 veces al año
Temas de la revista:
Mathematics, General Mathematics