Return to Question

I have encountered the following sequence of words: 'routing table formed on the basis of network history information'. I know that initially, routers discover neighbor nodes and therby the possible ways to reach every other destination in the network, based on distance.

1. So, I conclude using network history means the tables are dynamic?
2. But then for e.g., if path quality (SNR) is a metric then how often the routers would update their table?
3. And when they do, do they just update the table for links connected to neighbors?

Background: Actually, I saw papers where tabular Q-learning is applied to find a route from a given source to a destination node. The learning process took into account the network metric. And I later found the above-said bolded terms that confused me as to what advantage would table Q-learning routing would offer if we already have some routing based on network history. That led to the above 3 questions.

I have encountered the following sequence of words: 'routing table formed on the basis of network history information'. I know that initially, routers discover neighbor nodes and therby the possible ways to reach every other destination in the network, based on distance.

1. So, I conclude using network history means the tables are dynamic?

2. But then for e.g., if path quality (SNR) is a metric then how often the routers would update their table?

3. And when they do, do they just update the table for links connected to neighbors?

Background: Actually, I saw papers where tabular Q-learning is applied to find a route from a given source to destination node assuming a centralized SDN. The Q-learning process took into account the network metric. And I later found the above-said bolded terms that confused me as to what advantage would table Q-learning routing would offer if we already have some routing based on network history. That led to the above 3 questions.

I have encountered the following sequence of words: 'routing table formed on the basis of network history information'. I know that initially, routers discover neighbor nodes and therby the possible ways to reach every other destination in the network, based on distance.

1. So, I conclude using network history means the tables are dynamic?
2. But then for e.g., if path quality (SNR) is a metric then how often the routers would update their table?
3. And when they do, do they just update the table for links connected to neighbors?

I saw papers where tabular Q-learning is applied to find a route from a given source to a destination node. The learning process took into account the network metric. And I later found the above-said bolded terms that confused me as to what advantage would table Q-learning routing would offer if we already have some routing based on network history. That led to the above 3 questions.

I have encountered the following sequence of words: 'routing table formed on the basis of network history information'. I know that initially, routers discover neighbor nodes and therby the possible ways to reach every other destination in the network, based on distance.

1. So, I conclude using network history means the tables are dynamic?
2. But then for e.g., if path quality (SNR) is a metric then how often the routers would update their table?
3. And when they do, do they just update the table for links connected to neighbors?

Background: Actually, I saw papers where tabular Q-learning is applied to find a route from a given source to a destination node. The learning process took into account the network metric. And I later found the above-said bolded terms that confused me as to what advantage would table Q-learning routing would offer if we already have some routing based on network history. That led to the above 3 questions.

I have encountered the following sequence of words: 'routing table formed on the basis of network history information'. I know that initially, routers discover neighbor nodes and therby the possible ways to reach every other destination in the network, based on distance.

1. So, I conclude using network history means the tables are dynamic?
2. But then for e.g., if path quality (SNR) is a metric then how often the routers would update their table?
3. And when they do, do they just update the table for links connected to neighbors?

I saw papers where tabular Q-learning is applied to find a route from a given source to a destination node. The learning process took into account the network metric. And I later found the above-said bolded terms that confused me as to what advantage would table Q-learning routing would offer if we already have some routing based on network history. That led to the above 3 questions.

I have encountered the following sequence of words: 'routing table formed on the basis of network history information'. I know that initially, routers discover neighbor nodes and therby the possible ways to reach every other destination in the network, based on distance.

1. So, I conclude using network history means the tables are dynamic?
2. But then for e.g., if path quality (SNR) is a metric then how often the routers would update their table?
3. And when they do, do they just update the table for links connected to neighbors?

I saw papers where tabular Q-learning is applied to find a route from a given source to a destination node. The learning process took into account the network metric. And I later found the above-said bolded terms that confused me as to what advantage would table Q-learning routing would offer if we already have some routing based on network history. That led to the above 3 questions.