Distributed Network (Distance Vector Routing Algorithm) C programming .

*** İmplement a distributed enviroment using this([login to view URL]) map. *** *** Use the buffer pool data managament method (send,receive) for storage , and use the interprocess communication ("producer,consumer" ; read_fifo,write_fifo, FIFO message queues) nodes of the distributed system to communicate with each other. *** *** Run the bellman ford algorithm on this perimeter. Each node will run independently of the other and send its neighborhood vector to its neighbors. After getting the neighborhood vector, they will apply the algorithm to determine which node they are closer to. Our adjency matrix will be held in a global place. Each node will scan the row in the adjency matrix within the for loop and save 1.*** ***There is a one thread. This thread is algorithm that work on the map. ***Each node will run indepently of the others.*** ***There will be the same number of fifo message queues as the number of nodes.*** ***Nodes will be use the pointer(*me) of that thread (Plan of [login to view URL] T is thread). I think help of this pointer(*me), nodes will work like threads. **** ***Use the unix c language on linux platform. (putty or any linux platform ).**** * Use the Adjacency Matrix for the neighbours matrix. * You must to use this map for network simulation.([login to view URL]) ***You can use this code for ipc(interprocess communication module) module*** ****-kernel.c, Here you can examine the buffer pool structure, this is a working code.*** ***-You can help from this book.(Distributed Algortihms)*** ***-You can check details of project in Plan of [login to view URL]***