Source string Source string

33/10000 · 33
English Actions
Same question as above, but the network is modified as shown in the figure below.
Routing protocols used in data networks only use positive link weights. What would happen with a distance vector routing protocol in the network below that contains a negative link weight ?
When a network specialist designs a network, one of the problems that he needs to solve is to set the metrics the links in his network. In the USA, the Abilene network interconnects most of the research labs and universities. The figure below shows the topology of this network in 2009.
The Abilene network
In this network, assume that all the link weights are set to 1. What is the paths followed by a packet sent by the router located in `Los Angeles` to reach :
the router located in `New York`
the router located in `Washington` ?
Is it possible to configure the link metrics so that the packets sent by the router located in `Los Angeles` to the routers located in respectively `New York` and `Washington` do not follow the same path ?
Is it possible to configure the link weights so that the packets sent by the router located in `Los Angeles` to router located in `New York` follow one path while the packets sent by the router located in `New York` to the router located in `Los Angeles` follow a completely different path ?
Assume that the routers located in `Denver` and `Kansas City` need to exchange lots of packets. Can you configure the link metrics such that the link between these two routers does not carry any packet sent by another router in the network ?
In the five nodes network shown below, can you configure the link metrics so that the packets sent by router `R5` to router `R1` use link `R3->R1` while the packets sent by router `R3` use links `R3->R2` and `R2->R1`?
In the five nodes network shown above, can you configure the link weights so that the packets sent by router `R5` (resp. `R4`) follow the `R5->R3->R1` path (resp. `R4->R2->R3->R1`) ?
Consider the network shown in the figure below.
Assuming that the network uses source routing, what are the possible paths from `R1` to `R4` ?
The network operator uses would like to have the following paths in this network :
`R3->R2->R4->R5` and `R1->R2->R5`
Is it possible to achieve these paths and if so what are the required forwarding tables ?
Same question with virtual circuits.
The network operator would like to use the following paths :
`R1->R2->R4` and `R3->R2->R5->R4`
Are these paths possible with link-state or distance vector routing ? If so, how do you configure the link weights? If not, explain your answer.
`R1->R5->R4` and `R3->R2->R4`
Discussion questions
The network below uses port forwarding tables. It has been running for several hours and all hosts have exchanged packets. What is the content of the port forwarding tables ?
At this point, a new link is added between `R1` and `R3`. What happens for the forwarding of packets ?
The network below uses port forwarding tables. What happens if host `A` moves by removing its link with `R1` and replacing it with a link with `R3`? How should networks using port forwarding deal with such mobile hosts ?
Some hosts need to be multihomed, i.e. attached to two different network nodes as shown in the figure below.
Would this network work correctly with port-forwarding tables if :
Host `A` uses the same flat address for both links.
Host `A` uses a different flat address on each of its links

Loading…

No matching activity found.
Browse all component changes

Glossary

English English
No related strings found in the glossary.

String information

Flags
read-only
Source string location
../../exercises/network.rst:187
String age
4 years ago
Source string age
4 years ago
Translation file
locale/pot/exercises/network.pot, string 22