M ONASH U NIVERSITY D EPARTMENT OF E LECTRICAL & C OMPUTER S YSTEMS E NGINEERING ECE4414/ECE5414 Performance of Telecommunication Networks Final Examination, 2nd

Semester, 2006

(Please give your answers briey, and in point or tabular form wherever possible. None of your answers to any of the questions should exceed one page.) 1. (10 marks) Answer the following questions on cell switches. (a) Consider an N N cell switch that operates in a time-slotted manner. Assume that in a slot all the N inputs get a cell. Also assume that a cell has output j as 1 its destination, with probability N for j = 1, . . . , N and that the destination of a cell is independent of the other cells. What is the probability that there will be no destination conict that is, that each cell will choose a different destination? Explain. (b) Consider the same case as above except that a cell arrives at an input with probability . Among the cells that arrived in the same time-slot, what is the probability that there is no destination conict? Explain. 2. (10 marks) Draw a timeline diagram for the sliding window algorithm with send window size (SWS) = receive window size (RWS) = 4 frames for the following two situations. Assume the receiver sends a duplicate acknowledgment if it does not receive the expected frame. For example, it sends DUPACK(2) when it expects to see FRAME(2) (the frame with sequence number 2) but receives FRAME(3) instead. Also, the receiver sends a cumulative acknowledgment after it receives all the outstanding frames. For example, its sends ACK(5) when it receives the lost frame FRAME(2) after it already received FRAME(3), FRAME(4), and FRAME(5). Use a timeout interval of about 2 RTT (round trip time). (a) Frame 2 is lost. Retransmission takes place upon timeout (as usual). (b) Frame 2 is lost. Retransmission takes place either upon receipt of the rst DUPACK or upon timeout. Does this scheme reduce the transaction time? 3. (20 marks) For an M/M/1 queue, arrival rate is items per unit time and service rate is items per unit time. Let n be the number of items in the system, and pn be the steady-state probability of nding n items in the system (waiting and being served). (a) Draw the state diagram for this system and obtain the balance equation. (b) Show that p0 = 1 (where = / ), and obtain a general expression for pn . (c) Show that the average number of items in the system is /(1 ). 1

(d) State Littles formula, and use it to obtain an expression for the average residence time. 4. (10 marks) Consider the following network topology:

In the diagram above, vertices represent routers and edges (arcs) represent links between routers. The numerical annotation on the links represents link costs (higher costs indicate worse links). Answer the following questions: (a) Use Dijkstras link-state algorithm to nd the set of shortest paths from router D to other routers in the network. You need to show the step-by-step progression of the link-state routing algorithm at router D and explain the activity in each step. (b) Give the nal routing table at router D. 5. (10 marks) Compare and contrast the link-state and distance-vector algorithms. Give your answer in tabular format. 6. (10 marks) Answer the following questions on routing in the global Internet and autonomous systems. (a) What is an autonomous system? (b) What is an interior routing protocol? What is an exterior routing protocol? (c) What do BGP-4, OSPF and RIP stand for? (d) Compare BGP-4, OSPF and RIP by using a table similar to the following: P ROTOCOL BGP-4 OSPF RIP I NTRA -AS
OR I NTER -AS?

T RANSPORT P ROTOCOL U SED

(End of paper, total 70 marks)