Open 1n4r1 opened 5 years ago
As I see it - we need a routing table, which is a graph with ford-bellmann to tell the best path
Actually. this does not have to be a graph. if we have info of a number of node, path and distance, its enough.
After connected to the network, we need following procedures to get info of neighbors
In this situation, for the full table request of A, B should reply following JSON
nodes =
{"A": ["B","C"],
"B": ["A", "B", "D"],
"C": ["A", "D"],
"D": ["B", "E"],
"E": ["B"]
}
for binding neighbor id and IP address, we can have another dictinoary
neighbors = {
"B": "xxx.xxx.xxx.xxx",
"C": "yyy.yyy.yyy.yyy"
}
this is because we don't need IP/ports of other nodes which are not neighbors Anyway, at least we have to agree on this in our team This also I expect some other opinions, so if something is wrong, tell me
Let's specify and agree on what is "Routing part"