

Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Main points of this past exam are: Attack Types, Mechanisms, Different Approaches, Provide Reliable Data, Perspective, Control Signalling, Routing and Processing
Typology: Exams
1 / 3
This page cannot be seen from the preview
Don't miss anything!


Answer any three questions for full marks Maximum available marks is 100.
NOTE: The exam is Open Book and you may use all of your lecture notes
Examiners: Dr. S. McGrath Mr. P. French Mr. A. Murphy Mr. A. McDonald Dr. D. Pesch
(a) Explain two mechanisms that SS7 uses to provide reliable data transfer between network elements. Discuss the need for the two different approaches. [7.33 marks]
(b) Explain from a routing and control signalling perspective how a call to an 1850 number is established through an SS7 network. As part of your answer list the functional elements of an SS7 network that are involved in the routing and processing. [10 marks] (c) Explain with the help of a diagram how, based on the SIP signalling protocol, a VoIP call is setup via a proxy between two terminals on the Internet. [9 marks]
(d) Explain briefly the motivation for the major telecommunication service providers in offering telecommunication services over the Internet Protocol. As part of your answer also list and briefly discuss the different approaches that are currently standardised for managing and controlling such services. [7 marks] [Total: 33.33]
(a) Given is a small network of four routers modelled by a queuing network as shown in the figure below. The parameters of the model are given as follows: r 1 = 2/sec, all other r (^) i = 0. p 12 = 1.0, p 32 = 0.5, p 34 = 0.5, p 43 = 1.0, all other pij = 0. Calculate the arrival rates λi, i = 1, 2, 3, 4, into each router and then determine the service rates μi , i = 1, 2, 3, 4, such that the average waiting time in each queue does not exceed Wi = 1.0sec and throughput is maximised.
μ 1 μ (^2)
μ 3 μ (^4)
r 1 p^12
p 34
p^32 p (^43)
[18 marks] (b) Using the Ford-Fulkerson algorithm, calculate the maximum flow f between source node s = 1, and destination node d = 4 for the network of 7 nodes shown in the figure below. Link capacities and flow direction are shown with each link.
20
10 5
7
5
(^3 )
(^15 )
20
7
[15.33 marks] [Total: 33.33 marks]