I want to know if my text is grammatically correct;
Can anyone help with that?
Introduction
The seminar is about a routing protocol based on the well-known link-state routing protocol and OSPF packet structure.
A routing protocol is to include the router should be able to communicate with each other. A routing protocol always shares information with their neighbors. by those spreads information has the ability to choose routes between two nodes in a computer network.
Link-state routing is that every node constructs a map of the connectivity to the network, in the form of a graph. The graph showing the nodes that are connected to each other.
OSPF packet structure is the most used routing protocols for Internet routers.
OSPF is able to identify the appropriate path for the packet when they pass through a set of connected networks.
Main problems and solutions
The hardest part of the seminar is to understand the task. I had to read it several times to understand it.
It was also hard to get started programming with Erlang but I used the following Erlang files(keyfind/3, keydelete/2, map/2 and foldl/3) and It became easier to get started.
\\
One of the causes may be that we have a complete table that does not allow more entries in the sorted list. This can make you know that the routing table is complete and includes all reachable cities.
Another thing is that we can have nodes in the map that have an infinity length set which is not reached and don't need to be part of the final table. \\
The main problem with implementation the task is that we can have the cyclic paths, which means that a message can be resand forever.
We can avoid the cyclic paths by two ways, we can remove old messages, or message with a lower number than other messages from the same country. Another solution is to set a counter on each message and decrement the counter in each hop. The first solution is better as it allowed us to change the view of the network.
Evaluation
We will have a running route which should be able to receive a message and determine which the fitted gateway is best to deliver a message. At the seminar we will connect the routers together.
\\
To obtain the results, we have implemented the following Erlang files;
\\
Map Erlang file, is like a directional map which should enable to return the list of nodes.
Dijkstra file, is to compute a routing table. This table says that if we want to send something to country, it will be sent through a specified country. The table is represented by a list with one entry per node which hold inter alia the gateway that we should use to reach the node.
Interfaces file, is to add and remove an entry, find the process identifier and send the message to all interface processes.
Hist file, is to be able to return a new history, check if message number N from the node is old or new.
Routy file, should be able to route messages through a network of connected nodes, maintain view of the network and construct optimal routing tables. The router process register should be under a unique name.
\\
I have tested the program using the code found in the assignment. I started by having different Erlang nodes, then I have decided to have three nodes with names Lund, Stockholm, Gothenburg. I started the routers, make the connections between them and broadcast a message from Gothenburg to Stockholm. Gothenburg has received the messages which mean the nodes could identify their neighbors.
Can anyone help with that?
Introduction
The seminar is about a routing protocol based on the well-known link-state routing protocol and OSPF packet structure.
A routing protocol is to include the router should be able to communicate with each other. A routing protocol always shares information with their neighbors. by those spreads information has the ability to choose routes between two nodes in a computer network.
Link-state routing is that every node constructs a map of the connectivity to the network, in the form of a graph. The graph showing the nodes that are connected to each other.
OSPF packet structure is the most used routing protocols for Internet routers.
OSPF is able to identify the appropriate path for the packet when they pass through a set of connected networks.
Main problems and solutions
The hardest part of the seminar is to understand the task. I had to read it several times to understand it.
It was also hard to get started programming with Erlang but I used the following Erlang files(keyfind/3, keydelete/2, map/2 and foldl/3) and It became easier to get started.
\\
One of the causes may be that we have a complete table that does not allow more entries in the sorted list. This can make you know that the routing table is complete and includes all reachable cities.
Another thing is that we can have nodes in the map that have an infinity length set which is not reached and don't need to be part of the final table. \\
The main problem with implementation the task is that we can have the cyclic paths, which means that a message can be resand forever.
We can avoid the cyclic paths by two ways, we can remove old messages, or message with a lower number than other messages from the same country. Another solution is to set a counter on each message and decrement the counter in each hop. The first solution is better as it allowed us to change the view of the network.
Evaluation
We will have a running route which should be able to receive a message and determine which the fitted gateway is best to deliver a message. At the seminar we will connect the routers together.
\\
To obtain the results, we have implemented the following Erlang files;
\\
Map Erlang file, is like a directional map which should enable to return the list of nodes.
Dijkstra file, is to compute a routing table. This table says that if we want to send something to country, it will be sent through a specified country. The table is represented by a list with one entry per node which hold inter alia the gateway that we should use to reach the node.
Interfaces file, is to add and remove an entry, find the process identifier and send the message to all interface processes.
Hist file, is to be able to return a new history, check if message number N from the node is old or new.
Routy file, should be able to route messages through a network of connected nodes, maintain view of the network and construct optimal routing tables. The router process register should be under a unique name.
\\
I have tested the program using the code found in the assignment. I started by having different Erlang nodes, then I have decided to have three nodes with names Lund, Stockholm, Gothenburg. I started the routers, make the connections between them and broadcast a message from Gothenburg to Stockholm. Gothenburg has received the messages which mean the nodes could identify their neighbors.
