Explain relation between amount of load being rejected and throughput
The higher the load rejected, the lower the throughput
How can we increase throughput
By making routing more efficient resulting in less delays
Draw an schematic of routing in data networks (L6 2)
draw in paper
Draw the curve of throughput vs delay in data networks, include poor routing and efficient routing (L6 3)
write on paper
Explain ideas of broadcasting
- Origin node sends data to all nodes in the network
- Used when we need to transmit data to all network nodes
- needed when network topology changes
Explain ideas of flooding
- Origin node sends data to neighbouring nodes
- neighboring nodes relay data to the next nodes except the father node
- nodes will send the data only once
draw a schematic of broadcasting and flooding (L6 4)
write on paper
draw a schematic of spanning-tree algorithm (L6 5)
write on paper
explain main ideas of spanning-tree algorithm
- spanning-tree is a connected subgraph of the network that includes all nodes without cycles
- requires less packet transmissions
- no cycles in the network
- N-1 transmissions required for N nodes
- needs to maintain and update spanning tree when topology changes
Draw a schematic of a graph and its subgraphs (L6 10)
write on paper
ideas of minimum weight spanning-tree (MWST)
- communication between nodes has a cost
- MWST is the spanning tree with a minimum sum of arc weights
- Krustal’s algorithm can be used to find the spanning tree
Give an example of Kruskal’s algorithm (L6 13)
write on paper
Definition of digraph and draw schematic (L6 19)
- Is a directed graph with N nodes
Define routing in a communication network
- Routing is the process of selecting a path for traffic in a network or between or across multiple networks.
- In packet switching networks, routing is the higher-level decision making that directs network packets from their source toward their destination through intermediate network nodes by specific packet forwarding mechanisms.
