Skip to content

Routing: Toueg's Algorithm and Frederickson Algorithm

Created by: SaimSUNEL

Toueg's Algorithm and Frederickson's Algorithm have been implemented as AHC components. For demonstrating their basic operations two sample projects have been designed. Moreover, two experimentation code samples for assessing the message and execution time requirements of the algorithms on randomly generated graphs have been provided. As a more realistic scenario, by employing these methods we have implemented a distributed machine learning application where machine learning models are distributed over the network. One of the nodes is assigned to be a server node that initiates queries to the models and gathers responses via message exchanges.

Merge request reports