Hello,

Please support providing a solution for the below-mentioned question for understanding the concepts.

Q1. (a) Explain, briefly, what is meant by the term "store \& forward" in relation to communication networks and write down an alternative paradigm for conveying information. (b) In a communication network, routing and forwarding are actually quite distinct (although linked) actions. Explain what is meant by routing and discuss how routing protocols support the forwarding actions within a network node. Define what is meant by the acronym OSPF and explain its role in the routing process. How does Dijkstra's algorithm support OSPF? 25% (c) A communication network consisting of 150 nodes interconnected using 225 links is supported by OSPF. When the network is stable, routing updates at each node take around 60S to complete. If the network was to increase in size to 400 nodes and 550 links, estimate the time now required to complete routing table updates. Assume that the network has stabilised at its revised dimensions. 10% (d) Figure Qul shows the topology of a packet network where all nodes are interconnected by a number of links, each with an effective capacity of 8.64Mb/s. The mean load presented at each node is equivalent to 900 packets every second while each link is found to carry 1200 packets per second with an average total packet size of 600 bytes. Each link supports a buffer equivalent to 1 Mbyte and packet losses are recorded less than 105. i) Calculate the mean number of links traversed by a packet. ii) Calculate mean nodal buffer occupancy. iii) Estimate the mean delay associated with a packet traversing the network if all links carry the same load. iv) Comment upon the values obtained in parts i), ii) and iii) if you are told that traffic presented to each node is evenly distributed across all possible destination nodes. v) After a period of the time, the load on each link has reduced to 800 packets per second while the nodal load remains at 900 packets per second. Determine the revised mean number of links traversed by a packet and nodal occupancy. What does this figure suggest about the traffic load and the routing mechanism? Figure Oul