Scribd
Upload
218 views3 pages

Network Planning, Midterm 2023 Exam Solution

The document contains two questions. Question 1 asks to calculate the expected number of subscriber lines required in the year 2035 and provides notes on virtual circuits, datagram switching, and international telephone numbers. Question 2 asks to calculate end-to-end delays for circuit switching and datagram packet switching networks between 4 nodes.

Uploaded by

Basel wesam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
218 views3 pages

Network Planning, Midterm 2023 Exam Solution

The document contains two questions. Question 1 asks to calculate the expected number of subscriber lines required in the year 2035 and provides notes on virtual circuits, datagram switching, and international telephone numbers. Question 2 asks to calculate end-to-end delays for circuit switching and datagram packet switching networks between 4 nodes.

Uploaded by

Basel wesam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Menoufia University Telecomm.

Network Planning
Faculty of Electronic Engineering mid 2nd term B. SC Exam.
Dept. of Electronics & Electrical Comm. Time Allowed: 1 Hour
Date: 30 - 4 - 2023 Total marks: 30
Answer the following questions:
Question No. 1: [15]
a- The number of subscriber lines put in service in certain Exchange area during the interval
2015-to-2021 was registered in the following table.
Year 2015 2016 2017 2018 2019 2020 2021
3 100 110 121 133.1 146.41 161.05 177.16
Number of lines x 10
Calculate the expected number of lines required to be connected at year 2035.
b- Write short notes about:
i- Difference between Virtual circuit, and Datagram packet switching technique,
ii- Structure of the international telephone number,
iii- Drawbacks of the Common-Channel Signaling technique.
Question 2: [15]
A communication network with 4 nodes between the source and the destination transferring
messages with length 3400 bit. The data rate on all links is 9600 bps, with packet size 440 bits
and 30 bit overhead address, 10 trailer bits. The set-up time is 0.25 sec., while the average delay
time at each node is 0.3 sec. The processing time at each node is 0.18 sec. The data speed over a
link is 200 m/µ sec., and the link length is 50 km. Calculate the end-to-end delay for the following:
a- Circuit switching network,
b- Datagram packet switching network without delivery guarantee.
Solution:
Question No. 1:
a- The number of subscriber lines put in service in certain Exchange area during the interval
2015-to-2021 was registered in the following table.
Year 2015 2016 2017 2018 2019 2020 2021
3 100 110 121 133.1 146.41 161.05 177.16
Number of lines x 10
Calculate the expected number of lines required to be connected at year 2035. (5 marks)

110−100 121−110 11 133.1−121 12.1


∆1 = = 0.1, ∆2 = = = 0.1, ∆3 = = = 0.1,
100 110 110 121 121
146.41−133.1 13.31 161.05−146.41 14.64
∆4 = = = 0.1, ∆5 = = = 0.0999 ≈ 0.1,
133.1 133.1 146.41 146.41
177.16−161.05 16.11
∆6 = = = 0.1,
161.05 161.05
So, the annual percentage growth is constant = 0.1, then, the exponential forecasting model
should be used:
So, 1 / T1 = 0.1.
 M = Mo exp (t / T1)
t = (2035 – 2015) + 1 = 21
∴ M = 100 exp (0.1 x 21) = 100 exp (2.1) = 816.616 x 1000 = 816616 ≈ 817 x 103 line.
b- Write short notes about:
i- Difference between Virtual circuit, and Datagram packet switching technique,
ii- Structure of the international telephone number,
iii- Drawbacks of the Common-Channel Signaling technique.
b-i-1- Virtual Circuit (2.5 marks)
A particular route is set up when a session is initiated for all packets exchanged during the
session life between users using a path finder packet, where each packet travels the same path
through the network. Packets arrive in the order in which they are sent, such as delivery of
packets in proper sequence with no errors is guaranteed.
Routing decision is not required at each node, it is made only once for each connection, but
a packet still buffered and queued. Logical connection is established (call request, call accept,
clear request). It is like circuit switching as it appears to be as a dedicated physical circuit
between source and destination although the circuit is shared among multiple users. It is virtual
in the sense that transmission capability is only used as needed (on demand). It has set-up time
and delay time.
b-i-2- Datagram (2.5 marks)
dynamic routing is used, each packet is treated independently with no prior route
determination, where routing decision is required for each packet at each node through the
network. Packets travel along any available path to the destination and are delivered in the
sequence they arrive at the receiving terminal, and delivery may be guaranteed. Packets may
arrive out of sequence or be lost or duplicated.

b-ii- Structure of the international telephone number: (2.5 marks)


international significant number
00 XX X XX XXX XXXX
international prefix Country code Trunk Prefix Area code Exchange code Sub's number
a-International Prefix (International Access Code, 00, or +)
The combination of digits to be dialed by a calling subscriber making an international call to
a subscriber in another country to obtain access to the automatic outgoing international
equipment (international gateway).
b- Country Code
The combination of one, two or three digits characterizing the called subscriber country.
For example, "20": digit "2” is the zone code of Africa, and digit ''0" is that code assigned to
Egypt within Africa zone.
c- Trunk Prefix
It is a digit (usually '0') or combination of digits to be dialed by a calling subscriber making a call
to a called subscriber in his own country but outside his own numbering area. It is used to inform
the local exchange that the requested call is not a local call and therefore get access to the
automatic outgoing trunk equipment (trunk exchange).
d- Area Code
The trunk code of the called subscriber which is the code of Menoufia numbering area.
e- Local exchange number
Two or three digits define called subscriber Exchange.
f- Called subscriber number
Last three, four, …. digits (depending on the local Exchange capacity) define the number of the
called subscribe in the local exchange.

b-iii- Drawbacks of the Common-Channel Signaling technique. (2.5 marks)


The complexity of the technique. However, the dropping cost of digital hardware and the
increasingly digital nature of telecommunication networks makes CCS the appropriate technology.
Even in a network that is completely controlled by CCS, in-channel signaling is needed for at least
some of the communication with the subscriber. For example, dial tone, ring back, and busy signals
must be in channel to reach the user.

Question 2:
A communication network with 4 nodes between the source and the destination transferring
messages with length 3400 bit. The data rate on all links is 9600 bps, with packet size 440 bits
and 30 bit overhead address, 10 trailer bits. The set-up time is 0.25 sec., while the average delay
time at each node is 0.3 sec. The processing time at each node is 0.18 sec. The data speed over a
link is 200 m/µ sec., and the link length is 50 km. Calculate the end-to-end delay for the following:
a- Circuit switching network,
b- Datagram packet switching network without delivery guarantee.
Solution: L = 3400 bit, D = 50 km, N = 4, C = 9.6 kbps, S = 200 m/µ sec.,
Total pkt size = P + h + T = 440 + 30 + 10 = 480 bit, Tset-up = 0.25 sec.,
Tdelay./node = 0.3 sec, TProcessing./node = 0.18 sec.,
a- For circuit switching: (7 marks)
Tend-to-end, CS = Tset-up + (Tproc./ node) (1) + Ttr.(1) + Tprop.(N +1)
= 0.25 + 0.18 (1) + (L/C) x 1 + (D/S)(N+1)
= 0.25 + 0.18 (1) + (3400 / 9600) (1) + ((50 x 103) / (200 / 10-6)) x 5
= 0.43 + 0.354 + ((50 x 103) / (200 x 106)) x 5 = 0.784 + 1.25 x 10-3 = 0.7853 sec.
b- For datagram, consider Pipelining: (8 marks)
Tend-to-end, DG = (Tdelay./ node) (N+1) + (Tproc./ node) (N+1) + Ttr.+ Tprop.(N+1)
Ttr. = Ttr. of 1st packet (N+1) + Ttr. of the rest of the message (1)
Ttr = {[(P+h+T)(N+1) + ((L+H) – (P+h+T))(1)] / C}= {[(480x5) + (3400)
H = Summation of header sizes for all packets = number of packets x h = (L / P) x h
H = (3400 / 440) x 30 = 231.82 bit ≈ 232 bit.
H can be assumed any value > h
Ttr. = {[(480x5) + ((3400+232) – (480))] /9600} = {[(2400) + ((3632) – (480))] /9600}
= {[(2400) + (3152)] /9600}= 0.5783 sec.,
∴ Tend-to-end, DG = 0.3x5 + 0.18x5 + 0.5783 + 1.25 x 10-3 = 1.5 + 0.9 + 0.5783 + 1.25 x 10-3
= 2.98 second.

You might also like