SULIT

UNIVERSITI MALAYSIA PERLIS

Peperiksaan Semester PertaIn a

Sidang Akademik 201312014

II Januari 2014

EKT 335 - Principles of Compnter Network

[Prinsip Rangkaian Kompnter]

Masa: 3 jam

Please make sure that this paper has SIXTEEN (16) printed pages including this front
page before you start the examination.
[Sila pa3lilran kartas soa/an ini mengandungi UMABELAS (15) mulra sural yang bercelak lermasuk mulra
hadapan sebe/um anda memulalran peperiksaan ini.]

This question paper has SIX (6) questions. Answer FIVE (5) questions.
[Kertas .oaIan jnj mengandungi ENAM (6) soa/an. Jawab UMA (5) soa/an.]

Section A : This section has FOUR (4) questions. Answer ALL questions. (80 marks)
[Bahagian A: Bahagian jn; ada EMPAT (4) soalan. Jawab SEMUA soa/an. (80 marlrah)]
Section B : Answer any ONE (1) question. (20 marks)
[Bahagian B: Jawab mana- mana SATU (1) soalan. (20 marirah)]

SULIT

Di",,"'" okh Unit Peperikloan <I P."gijazoha.. Bahogian PengomtSa1J Akademik, Jahalon Pendaj/ar,
SULIT
(EKT335)
.2-

Section A (80 marks)

[Bllifapu. A (111 IIf4I'IrIIif)J

This section has FOUR (4) questions. Answer ALL questions.

[Balwgian ini ada EMPAT (4) soalan. Jawah SEMUA soalan.]

Question 1
SoIillUll
(C4, COl, C02, P02, P04 and PH)
(a) Networks are divided into several domain.
[Rongkoian terbaJrlJgi kepoda beberapa domaill.]

(i) Distinguish the network domain classification for Telecom Networks and
Enterprise Networks.
[Bezalran diantara klasijikosi domain rangkoian un/uk Rongkaian Telekam don
Rongkalan Enterprise';
[2 MarkslMarkah]
(ii) Summarize the functionaJities, operation and network topologies between
core networks and metro networks.
[lUngkoskan fimgsi, operasi don topologi rangkoian di Amara rangkoian teras don
rangkoian melro.]
[4 MarkslMarkah]

(C6, C02, C03, P02, P03 and PH)

(b) Consider an application layer entity need to transmit an L-byte message to its peer
process, using a legacy TCP connection. The TCP segment comprises of the
message added with overhead of 16 bytes. The segment is encapsulated into an IP
packet that has an extra 20 bytes of header. The IP packet in turn goes inside an
Ethernet frame that has 18 bytes of header and trailer. Evaluate the percentage of
transmitted bits in the physical layer corresponds to message information if L =
200 bytes and 1300 bytes?
{Pertimbangkan satu entili /apisan pengguna perlu untulc menghanlar mesej L-byte kepada prases
peer, menggunakan perhubungon sediada TCP. Segmen TCP ada/ah lerdiri dtJrlpada mesej
dengon penambahan overhead 16 byte. Segmen i,,; dikapsulkan dolam satu poket IP Y"ng
mempunyal tambahan 20 byte di heatkr. Paket IP pula seterusnya beroda doIam rangka Ethernet
)lQng mempunyai 18 byte heatkr don Ireler. Nilalkan peratusan bll Y"ng dihantar doIam lap/Ban
fizilcal sepodon dengan maklumal mesejjika L = ZOO byte don BOO bytes?]
[4 MarkslMarkah]

••• 2I1S

SULIT
 SULIT
(EKTDS)
.J-
(C6, C02, C03, P02, P03 and PH)
(c) Suppose a point-to-point link Telecom core networks with data rate of 10 Gbps is
being setup from Alor Setar to Seremban as shown in Figure 1. A time required to
establish the link (circuit switching or virtual circuit) between a pair of source to
destination nodes is I3ms. Each link introduces a propagation delay of 0.002
seconds. However, a node at Alor Setar begin to transmitting a message length of
2600 bits through core networks with fixed packet size of 1024 bits. Then,
overhead resulting from datagram header is 16 bits per packet. Assume that there
are no acknowledgements and neglect the processing delay at the nodes.
[Katalwr perhubungan titik-ke-titik rangkaian teras Telecom dengan kiJdar data 10 Gbps sedang
disambung ("setup 'J dari Alor Setar ke Seremban seperti yang ditunjukkan pada Rqjah 1. Satu
masa yang diperlukan untuk mewujudkan pautan (pensuisan /itar atau litar maya) antara
sepasang nod sumber ke destinasi adaIah 13ms. Setiap pautan memperkenallwr lengah
perambatan sebanyak 0.002 saat. Walau bagaimanapun, nod di Alor Setar mula menghantar
mesej panjang 2600 bit melalui rangkaian teras dengan saiz poket tetap 1024 bit. Kemudian,
overked aldbat tandukan datagram adalah 16 bit per poket. Menganggap bahawa tidak ada
perakuan dan mengabailwr lengah pemprosesan pada nod]

(i) Evaluate the end-to-end delay for circuit switching, virtual circuit packet
switching, and datagram packet switching.
[Nilailwr lengah Jn4ung-ke-hujung untuk litar suis, litar pensuisan maya paket, dan
datagram pensuisan packet.]
[5 MarksiMarkah]

(ii) Deduce general expressions for the three techniques of part (i), taken two
at a time (three expressions in all), showing the conditions under which
the delays are equal.
[Deduksikan ungkapan wnum bag; tiga tekai/t daripada bahag;an (i), ambil duo
daripada satu masa (tiga ungkapall dalam semua), tunjukkan bahawa keadaan di mana
kelewatall adalah sama.]
[5 MarksiMarkah]

Core Network

Alor Alam

lpoh
Figure 1: Telecom Core networks.
[Rqjah 1: RangkaUur Teras Telecrmr.J
...3/15

SULIT

Dicetak ohth Unit Peper/wan .l PengUazohan. /Jahaglon PBngrvullOf/ A_.. ,l<, Jabalan Pendajlm.
 SULIT
(EKT33S)

Question 2
SoaIa" :z

(C5, COl, C02, P02, P04 and PH)

(a) The Open Systems Interconnection (OSI) divides the basic communication
functions required for computer networks.
[Sistem Salinl'>hubungan Terbulw (OSI) membahagilwn jimgsi Iromunllwsi asas yang diperlulwn
untuk rang/r.aian Iromputer..}

(i) Construct and illustrate their OSI reference model in term of layer
functionalities and operation.
[Bina dan gambarlwn model rujulwn OSJ darl segi jimlffii lap/san dan operasi.
[2 MarkslMarlwhj

(ii) Relate and compare the layer functionalities between TCPlIP and OSI
reference models.
[Kaitlwn dan bandinglwnjimlffii lapisan di antara TCP /IP dan rujulwn model OS!.}
[3 MarkslMarkahj

(C6, C02, C03, P02, P03 and PH)

(b) The Kuala Lumpur International Airport authority plan to deploy network
infrastructure and its operation layout as shown in Figure 2. The Airport needs IP
addresses for 150 hosts and assign 116 prefIX address block on several airport
operation subsystems: Airfield Ground Lighting (AGL), Air Traffic Management
System (ATMS), Apron Services Management System (ASMS), Passenger
Check-In Processing System (PCPS), Flight InformationlBaggage Display System
(FIDS), Baggage Handling System (BHS), Gate Allocation System (GAS),
Meteorological System (MEl), Point of Sales (POS), Management Information
System (MIS), Immigration System (IS), Custom System (CS), Facilities
Management System (FMS), Airport Operation Centre 1 Crisis Control Centre
(AOC/CCC), Trunk Radio System (TRS) and Network Management Centre
(NMC). All subsystems are assign to appropriate Virtual LAN (VLAN).
[PiluJJc Berkuosa Lapangan Terbang Antarabanlffia Kwla Lumpur _rancang untuk
menggunalwn i11frastruktur rang/r.aion dan SUSIIII aJur operasi ada/ah seperti yang ditultiuk/wn
da/am Rajah 2. Lapangan terbang memerlulwn aJamat IP untuk ksgunaan 150 hos dan
mene/aplwn / 16 awalan blok alamat kspada beberapa s"Nis/em operasi lapangan terbang:
Pencahayaan Panglrolan Terbang (Landasan) Darat (AGL). Sis/em Pengurusan Trafik Udara
(ATMS). Sistem Perkhidmatan Pengurusan Apron (ASMS). Sistem Pemprosesan Dqftar MasuA:
Penumpang (PCPS). Sis/em Paparan MaJduma/ Penerbangan dan Bagasi (FIDS). Sistem
Pengendalian BagtMi (BHS). Sistem Pengagihan Get (GAS). Sistem Meteorologi (MEl). TIt/A:
PenjuaJan (POS). Sistem Maklumat Pengurusan (MIS). Sistem Im/gresen (IS). Sistem Kastam
(CS). Sistem Pengurusan Kemudahan (FMS). Pusat Operasi Lapangan Terbang / Pusat Kawalan
Krisis (AOC / CCC). Sistem Trunk Radio (rRS) dan Pusat Pengurusan Ranglwian (NMC). Semw
subsistem ada/ah dikhususlwn pada Virtual LAN yang bers....alan (VLAN).}

..•4/15

SULIT

Dlcetolc oIeh U.il Peperibaan <l Pengijazaltan./Johogian Pengunuan Akadomik, Jabalan Pertdqf/ar.
 SULIT
(EKT33S)

(i) Design the possible arrangement of subnet addressing scheme and

recommend subsystems to suitable VLANs.
(Reka bentuk jangkaan susunan bagi skim pengalamatan subnet dan cadangkan
suhaistem untuk nAN yang bersesuaian.1
[7 MarkslMarkah)

(ii) Evaluate and deduce an appropriate CIDR addressing scheme.

(Nilai dan simpu/kan skim pengalamatan CIDR yang benesuaian.1
[6 MarkslMarkah)

(iii) Critique the efficient methods to reduce depletion use of IP address space.
Justify your answer.
[Kritilr. terhadap Ir.aedah berkesan untuk mengurangkan penggulUJJlll susutan ruang
alamat [P. Jelaskan jawapon anda.]
[2 MarkslMarkah)

••• 5/15

SULIT

Dice/ale o/eh U/lit Peperi/rsorm <1 Pe.gijazahrm, Sahagian Pe"ll"rwa. Akademli, JabOlan Pendqflar.
 SULlT
(EKT33S)

. 1 .._ .
-'1- . ......... - '
;.: .......... ~

- .' ...'-

-
,-... , ,' '* ..... ,........,-.. : : - .~

';", ,;"1- _ . - _ -_ - •

Figure 2: KLIA Airport InCrastrudure and Operation Layout.

[Rajah 2: In/rtlStrIlktur LopaItgan TerlHmg KUA dan susultlltur pmgendaJillll./

••• 6/15

suur

Dfatalc oleh Unit Peper/baQJI ol Pengfjt1zD/ra1t. BahagiQJI Pengurustm A_mi/r. Jabatan Pendaftar.
SULIT
(EKTJJS)
-7-
Question 3
StHIJ." J
(CS, COl, COJ, P03 and P04)
(a) The presentation layer is intended to provide the application layer with the
independence from differences in the representation of data.
{Lopisan pe/l)lampaian bertujuan untulc memberi lapisan penggunaan bebas dari segi perbezaan
dalam perwakilan data.]

(i) Consider a situation in which cyberterrorist makes all the DNS servers in
the world crash simultaneously. Predict how does this change one's
ability to use the Internet?
{Pertimbangkan Ia!adaan di mana cyberterrorist _nblll1lkan somua pe/ayan DNS
.eluruh dania ber/aga secara serentalc. J/Qmalkan bagaimana uupayaan untuk
mengubah penguna Internet?.]
[3 MarksiMarkah]

(ii) Summarize the advantages and drawbacks of credits with compare to

sliding window protocols.
[&ngkaskan ubaikan dan uburukan kredit berbanding dengan protokal gelongsor
tingkap.]
[3 MarksiMorkah]

(C6, C02, C03, POl, P03 and PH)

(b) Computer X and Y are communicating over a rcp connection. All bytes up
through byte 112 received to Computer Y from Computer X. Suppose Computer X
then sends loopback two segments to Computer Y. Subsequently, first and second
segments contain 40 and 20 bytes of data, respectively. In the first segments, the
sequence number is 113, the source port number is 443 and the destination port
number is 80. Computer Y transmits an acknowledgement whenever it receives a
segment from Computer X.
{Komputer X dan Y berkomunikasi melalui sambtmgan TCP. Se""", byte menerusi byte 112
diterima upada kamputer Y dari Komputer X Katatan umudian/l)la Komputer X _nghanJar
loopback daa segmen upada Komputer Y. Seterusnya, masing-masing segmen pertama dan udaa
mengandullgi 40 dan 20 balt data. Dalam segmen pertama, nombar urutan adalah 113, nombar
port sumber adaJah 443 dan nambor port destinasi ialah 80. Komputer Y menghantar perakuan
apabila ia menerima satu segmen dari Komputer X.l

(i) In the second segment sent from Computer X to Y, appraise what are the
sequence number, source port number, and destination port number?
{Dalam .egmen udaa dihantar dari kamputer X u Y, nilaikan nombor undan, nombor
part .umber, dan nambor port destinasi?.]
[2 MarksiMarkah]

...7115

SULIT
 SULrr
(EKT335)
-8-
(ii) Decide the acknowledgement number, the source port number, and the
destination port number, presuming that the first segment arrives before
the second segment, in the acknowledgement of the first arriving segment.
[TenJukmr nombor pengaJaum. nombar port .umber, dan nombor port destinasi,
menganggap bahawa .egmen pertama tiba sebelum .egmen keduo, dalam pengakuan
.egmen pertama tiba.}
[2 MarkslMarkah]
(iii) Recommend the acknowledgement number presuming that the second
segment arrives before the first segment, in the acknowledgement of the
first arriving segment.
{Cadangkon nombor perafwan dengan menganggap bahawa segmen kedua tiba sebelum
segmen pertama, dalam pengafwan .egmen pertama tiba.}
[2 MarkslMarkah]

(iv) Suppose the two segments sent by Computer X arrive in order at Computer
Y. The first acknowledgement is lost and the second acknowledgement
arrives after the first timeout interval. Construct a timing diagram,
showing these segments and alI other segments and acknowledgements
sent (Assume there is no additional packet loss).
{Katakon duo segmen yang diJranlar aleh kompuler X tiba menurut /urutan ke Komputer
Y. Pengafwan pertama telah hilang dan pengafwan keduo tiba selepas tempoh tamal
masa pertama. Bina gambar rajah pemasaan, dengan menyatakon .egmen Ini dan .emua
segmen yang lain dan penrafwan yang telah dihantar (Anggapkon tiada kehilangan poket
tambahan).}
[4 MarkslMarkah]

••• 8115

SULrr

Dlcet.k .leh Unit Peperlk4aan & Pengljazaha.. Bahagtan Pe_n ,4lrD1kmllc. J.batan P<ndqfIar.
 SULIT
(EKT33S)
-9-
(C6, COl, C02, POl, P04 and PH)
(c) Consider a TCP connection has a window size of eight segments and an RTT of
500ms, the sender sends segments at a regular rate of every 150ms, and the sends
ACKs back at the same rate without delay. A segment is lost, and the loss is
detected by the fast retransmits segment finally arrives.
{Pertimbangkan saIU sambungan rr;p mempunyai so/z tingkap iaiIU lapan segmen dan R1T
adalah jOOms, penghanlar menghanlar segmen pada kadar lelap pada aetiap JSOms, dan
menghanlar ACKs kembali pada kadar yang sama iaiIU lanpa masa lengah. Segmen lelah hilang,
dan kehilangan lelah dikeson oleh segmen penghanlaran cepal akhimya ,elah sampai.]

(i) Evaluate the total time has sender lost assuming that the sender waits for
the ACK from the retransmitted lost packet before sliding the window
forward again?
{Nilaikan jumlah masa yang Idah penghantar hUang dengan menganggapkan bahawa
penghantar lelah menunggu ACK daripada pakel yang clihantar .emula lelah hi/ang
sebelum gelongsor tingkap Ire dihanlar lagi?}
[2 MarksiMarkah]

(ii) Rate the total time has sender lost presuming that the sender uses the
continued arrival of each duplicate ACK as an indication it may slide the
window forward one segment.
{KDdar jumlah masa lelah penghantar hllang menganggap bahawa penghantar
menggunakan lrelibaan berterusan setiap ACK salinan sebagai pe/unjuk ia boleh .Iaid
tingkap hadapan .aIU aegmen..}
[2 MarksiMarkah]

••• 9/15

SULIT

Dicelilk oIeh Unit Peperiboan & Pengyaza!ran, Bahagian PertglmUQn Alcademik. Jabaran Pendajlar.
SULlT
(EKT33S)
-10-
Question 4
Soaltln -I
(C5, COl, COl, P03 and P04)
(a) The classification of networking techniques can be divided into networking mode
and switching mode.
{Penglrelasan teknik rangkaimr boleh dlbahag/kan lrepada beberapa mod rangkaimr dan mod
pensuisan.]

(i) Distinguish the networking techniques in term of mode attributes.

{Bezakan tekniA>-teknik rangkaian dari seg/ slfat-slfat mod]
[2 MarkslMarkah]

(ii) Summarize a classification of optical networks.

{Ringkas/cQtJ kJasijikasi rangkaian optit]
[3 MarkslMarkah]

(C6, COl, C03, P03, P04 and PH)

(b) Consider a core router that intemetworking with four subnets: subnet domain I,
subnet domain 2, subnet domain 3 and Subnet domain 4. Suppose all of the
interfaces in each of these four subnets are required to have the prefix
193.2.12124. Also suppose that subnet domain I is required to support up to 96
interfaces, Subnet domain 2 is to support up to 150 interfaces, Subnet domain 3 is
to support up to 18 interfaces and Subnet domain 4 is to support up to 200
interfaces. Choose four network address that satisfy these constraints.
{Pertimbangkan router teras riengan peranglraian empat subnet: subnet damain I, subnet domain
2, sub".t domain 3 dan Subnet domain 4. Kata/cQtJ semua antaramuka pada .etlap sa/u daripada
empat subnet perlu mempunyai awakm 193.2.12124. Juga menganggap bahawa sub,..t damain1
diperlu/cQtJ untuk menyokang seh/ngga 96 antramuka. Subnet domain 2 adaIaIr untuk menyokong
seh/ngga 150 antoramuJra, Subnet damain 3 adaIaIr untuk menyokong seh/ngga 18 antaramuJra
dan Subnet domain -I adalah untuk menyokong sehingga 200 antaramuka. Pillh empat alamat
rangkaian yang memenuhi lre/cQtJgan im.}
[7 MarkslMarkah]

... 10/15

SULiT
 SULIT
(EKT335)
-11-
(C6, cOt, C02, P02, P04 and P11)
(c) Consider a store-and-forward packet network in which a message of size q bits is to
be sent over an N-hop path as a series of J consecutive packets. Providing that
each containing p data bits and h header bits. Assume that q ?: p + h. The
transmission rate of each link is R bits/seconds. Propagation and queuing delays
are negligible.
[Perlimbangkan ranglraian paJrel Slor-dan-hadapan di mana mesej saiz q bil akan dihanlar
melalui laluan N-hop sebagai siri J palrel secara berturul-turut. Dengan memberi yang masing-
mOOing mengandungi p bit data dan h bil header. Dengan menganggop bahawa q ~ p + h. Kadar
penghantaran seliap sambungon ada/ah R bit / saat. Perambatan dan baris-gilir lengah ada/ah
diabailran.}

(i) Rate the total number of bits that must be transmitted?

{Kodarkan jumlah bit yang perlu dihantar?}
[2 Marks!Marlrah]

(ii) Deduce the total delay experienced by the message.

{Deduksilran jumlah lengah yang dialami oleh mesej.}
[3 Marks!Marlrah]

(iii) Evaluate the value ofp minimizes the total delay?

{Nilaikan k dengan meminimumkanjumlah lrelewatan?}
[3 Marks!Marlrah}

.. _11/15

SULIT

Dlcdak oIeh Urrit Peperiboon & PengIJazahon, Bahag/tm PerrgJl1'lWUl Akademlt, JabaJan Pendqftar.
 SULIT
(EKT335)
-12-

Section B(20 marks)

IBahagian B(20 IlUll'kah)1

This section has TWO (2) questions. Answer any ONE (\) question.
[Bahagiall ini ada DUA (2) soalan. Jawab mana-mana SATU (/) soalan.)

Question 5
Soa/an5

(C6, COl, C03, P03 and P04)

(a) The MPLS specification allows an LSR to use a technique known as penultimate
hop popping. With this technique, the next-to-Iast LSR in an LSP is allowed to
remove the label from a packet and send it without the label to the last LSR in that
LSP.
[Spesifikas/ MPLS membolehkan LSR untuk menggunakan teknikyang dikellali sebaga/
"penultimate hop popping ". Dengan teknlk ini, LSR seterusnya-kepada-terakhir doIam LSP
yang dibenarkan unluk mengeluarkalliabel daripada paket dall menghantar tanpa label unluk
LSR terakhir dalam LSP berkenaan.}

(i) Recommend why this action is possible.

[Cadangkan mengapa tindakall im boleh dilakukan.}
[3 MarkslMarkah]
(ii) Summarize the advantages of penultimate hop popping.
[Ringkaskan keleb/han "penulJimate hop popping ".]
[3 MarkslMarkah]

(C6, COl, C03, POl and P04)

(b) Consider the following telecom network in Figure 3.
[Pertimballgkan rangkaian tekkam berikut seperti di dalam Rajah 3.}

(i) Evaluate the Bellman-Ford algorithm to find the set of shortest-paths

from all nodes to destination Node Johor Baharu.
{Ntlalkan algoriJma Bellman-Ford untuk mencari set-laJuan terpendek dari ke semua
nod ke !lest/nasi Nod Johor Baharu•.]
[4 MarkslMarkah]

(ii) Choose to continue the Bellman-Ford algorithm after the link between
Node Johor Bahru and Node Melaka goes down.
[Memilik un!Uk meneruskan algoriJma Bellman-Ford sefepas hubungan aniara nod
Johor Bahru dan Nod Melaka terputus.]
[4 MarkslMarkah]

(iii) Select the Dijkstra algorithm to eompare the set of shortest-paths from
Nodes Cyberjaya to other nodes.
[Pilih algoritma Dijkstra un!Uk membandingkan set laluan-terpendek dart Nod
Cyberjaya ke nod lain.]
[4 MarkslMarkah]
••• 1211S

SULIT

Dicetak oIeh Unit P.".rlksatm & Pengifozolran. Bahagian Peflgtlnl8Q" Akademil; Jaba/an Pendaj/ar.
 SULIT
(EIcrJJ5)
-13-
(iv) Summarize the Dijkstra algorithm set of associated routing table
entries.
[Ringkaskan algorilma Dijkstra set keluaran berkoi/an masulran perjaJananjadual.j
[2 MarkslMarkah]

Cyberjaya Seremban Kuantan

3 4

1 1
Kota BhilJru

2 4

Johor Baharu Me/aka Bangsar

Figure 3: Telecom-Dode Detwork.
/Rajah 3: R/IIIgkaJan nod Tdekom.J

... 13ns

SULIT

Diak1lc oIeh Unl' Peperiluoan <l PMgljazahan. Bahogfan P<ngvnJ8a1f AkademIJr. .JaboJmr Pendoj/DT.
 SULIT
(EKT33S)
-14-
Question 6
Soaiall 6
(C6, COl, CO2, POl, P04 and POll)
(a) Consider the OSPF protocol.
(PertimlHmgkan protokol OSPF.)

(i) Conclude how OSPF operates in an autonomous system that has no

defmed areas.
{Simpulkan bagaimana OSPF beroperasi dalam sistem autonomi yang tidak
mempunyal kawasan yang ditetapkan.}
[2 MarkslMarkah]

(ii) Critique how the notion of area reduces the amount of routing traffic
exchanged.
{Kritikan terhodap bagaimana tanggapan kawasOll boleh menukar pengurangOll
jumlah trqfik perjalOllan.1
[2 MarkslMarkah]

(iii) Relate the notion of area related to subnetting? Compare what happens
if all address in an area have the same prefix.
[Kaitkan kansep Ir.awasan yang berkaltan dengan Subnetting? Bandingkan apa yang
akan berlaku jika semua pengaiamatan di kawtJSl»l yang mempunyat awalan yang
sama.}
[2 MarkslMarkah]

(C6, C02, C03, POl, P03 and PH)

(b) Consider the MPLS network with six-node as shown in Figure 4. Suppose that
MPLS enabled routers are configure at Node R5 and Node R6. Assuming that
Traffic Engineering is implemented throughout the network. Subsequently, the
packets from Node R6 destined for Host A are switched to Host A via Node R6 -
Node R4 - Node R3 - Node RI, and packets from Node R5 destined for Host A are
switched via Node R5 - Node R4 - Node R2 - Node RI.
(PertimbOllgkan rangkaian MPLS dengan enam nod seperti yang dituiUukkan dalam Rajoh 4.
Kotakan MPLS router te/oh dikotr!lguraai pada Node R5 dan Node R6. Dengan mengandaikan
bahawa Kejuruteraan Trajik telah dilaksOllakan ke seluruh rangkalan. Kemudi0ll1lya, poket dart
Nod R6 dilJ!iukan ke Host A akan bertukar kepada Hos A melalul Nod R6 - Nod R4 - Nod RJ -
Nod RI, dall poket dari Nod: R5 dilJ!iukan ke Host A yang dituJrarkan me/a/ui Nod R5 - Nod R4 -
Nod R2 - Nod RI.)

(i) Summarize how the MPLS tables in Node R5 and Node R6, as well as
modified table in Node R4, which would make this possible.
{Ringkaskan baga/mana kemungkinanjadual MPLS pada Nod R5 dan Node R6, sena
jadua/ diubahsuai pada Nod R4.}
[5 MarkslMarkah]

••• 14/15

SULIT

Dlatalc old UOi/ P<pe,lbatm ct Peng/J"tlrilhtm, Bahagiao P.ngul"Ultlll Akotitlllik, Jabakln POItdqfku.
 SULIT
(EKT33S)
-15-
(ii) Suppose that packets from Node R6 destined for Host D are switched
via Node R6 - Node R4 - Node R3, while packets from Node R5
destined to Host D are switched via Node R4 - Node R2 - Node RI -
Node R3. Summarize the MPLS tables in all routers that would make
this possible.
{Katalran poket dari Nod R6 ditujulran ke Hos D hertulrar melalui Nod R6 - Nod R4 -
Nod RJ. manalrala paket dari Nad R5 ditujulran ke Hos D ditukar melalui Nod R4 -
Nad R2 - Nod R3 - Node RI. IUnglraslran kemungkinanjadual MPLS untuA: ke semua
router.}
[5 MarkslMarlrah]

(iii) R~mmend when Traffic Engineering is preferable to increase

network performance and survivability.
{Codanglran bila Kejuruteraan TrqfiA: adaIah pilihan terbaiA: untuA: meninglratlran
prestasi ranglrakm dan kemandirian.}
[4 MarkslMarlrah]

in out out
label label dest interface
10 A 0 in out out
12 0 0 label label dest interface
8 A 1 10 6 A 1
12 9 o o

0
D
1

R5
0 0
A
R2 in out out
label label dest interface
6 A 0

Figure 4: Six-node network.

{Rajah 4: Rangkalan enam-notL]

-000000-

SULIT

DiCittok oIeh Unit Pepe,iksaatr & Pengyozalran. Bahagian PetrgrH'Usan Akademik. Jabatan Pendqfla,.
 SULIT -16- EKT335

APPENDIX
{LAMPIRANI

COURSE OUTCOMES
Ability to analyze and apply the application layer program over the
COl
Internet.
Ability to develop and implement the transport layer protocol which
CO2
set up the Internet Networlc.
Ability to design and develop the IPs which are needed to transfer
C03
data from the sender to the receiver

PROGRAM OUTCOMES
P02 Ability to identifY, [onnulate and solve complex engineering problems.
Ability to design solutions for complex engineering problems and systems,
P03
components or processes to meet desired needs.
Ability to conduct investigation into complex problems as well as to
P04 analyze and interpret data.
POll A recognition of the need for, and an ability to engage in Iife>-Iong
learning.

SULIT

DfcelDk oleh Unit Peperllaaan Ii Pengijarahan. Bahoglon P.",.,.."." A_,.flr, Jabakm Pendijflar.