Sudan University of Science &Technology College of Graduated Studies

Effect of the Interior Gateway Routing Protocols in the Multiprotocol Label Switching Networks

A thesis submitted as partial fulfillment for the requirement of the MSC Degree in Electronic Engineering (Telecommunications Engineering)

Submitted by:
Suhail Bada i Abdel!arim ahmed

Supervised by:
Dr" Sara Mustafa El#ac!
$ctober %&'%

! ( # %&' * ( 7 # 0 * % ! 9 : # &8 ! 6 # / ! * 2%" ! ! 2&5 * ! 4# '( # ) ! 1 '2% +, # ) # 0 # " # 3 # # -. ! " # $ # ? 7 # C 1 2%" 3 # * 2% 3 2@) # >2 #;@D # "; < , # E # " * ! =* 8! J @( # I 3 * ! 4! FH G# 8! -/ * -B # A # ! =5 # ! ( M 7 # &' * #L # K
105 NOP% NI&=2% C6&5

To the man who gave me faith, power and organized my life to My Father.And to our continuou ource of love My Mother

QRSNTULEVGEMENW
!t wa a great honor and e"tremely great opportunity that Allah gave to me to #e under upervi ed and one of tudent of great teacher li$e Dr. Sara Mustafa Eljack he wa very helpful ,with unlimited $indne and he gave me her #e t effort to ma$e thi wo$ true. Than$ you very much.

%pecial than$ to my #e t friend Eng.Waleed Mohammed Elhassan for hi upport and valua#le advi e . And ! would li$e to give my than$ to Eng.Mohammed Foad Mekki from &apital 'ne co. for hi upport and ugge tion . And of cour e my limitle than$ and wonderful feeling to my fianc(e Gamer for her upport, patient and under tanding.

Abstract
Traditional () based net or!s* +rame ,ela- and ATM net or!s ha.e mandisad.antages in the management operation of large net or!s li!e cost* securit-* scalabilit- and fle/ibilit-" To sol.e this* an M)0S1based 2)3 net or!ing is introduced that can or! ith e/isting deplo-ed bac!bones and allo or!ers through organi4ations to interconnect the dispersed sites and remote secure lin!s b- using public internet" This thesis tries to pro.ide a better understand of the operation of ser.ice pro.iders large net or!s management operation through focusing in the M)0S 2)3 technolog-" (t offers a detailed description of the ma#or operation of the M)0S 2)3 net or!s to met a customer requirement in the content deli.ermission" To get better understand of the beha.ior of the M)0S 2)3 net or!s* the interaction bet een routing protocols 2)3 net or!s performance" This thesis as chosen as a case stud- of the M)0S or! is mainl- focusing in stud-ing the

effect of the interior gate a- routing protocols in the M)0S 2)3 net or!s" T o famous protocols chose to be in.estigated ($S)+ and (S1(S) and t o proposed designs are introduced to be simulated ith $)3ET Modeler then an in depth anal-ses of the net or! performance ill be pro.ide "

Keywords: IP, MPLS, VPN, MPLS VPN, OSPF,IS-IS

"!
, + ! )* &) $ ) ( "' "& "#$%87 ( " 6 4% 5$ 4 12"3 0 /$ % &. D)C B A@) "& ?4 , + > ( =< - ;9 : " "" :$"E$ < IJH%D 10 G "& 3% :&) F& F ';6 ; :#<) "' ENM " 9 L( H) K74 % P L"74 9 L% O%0.( ( = F<7 S1 EN74 FR Q;""( 6( , + "0 F 1 > F4 3 W"N J". ?4 N4 V4 TU% % P " < IJH%D 1 G"! 0 F16;N X$%- P ?$R )* 4 3 % "C *"( 4&)7 $8 Z Y$( " 6 B'"

)% TAB0E $+ C$3TE3TS DED(CAT($3 AC53$60ED7EME3T ABST,ACT ! TAB0E $+ C$3TE3TS 0(ST $+ +(78,ES 0(ST $+ TAB0ES CHAPT ! "# 'Bac!ground '"%)roblem Statement '":)roposed Solution '";$b#ecti.es '"<E/pected result ).*+elated wor$ ).,+e earch outline RXQPWER WUT %" -ac$ground ..)Traditonal +outing and /ac$et witching %"% Multiprotocol 0abel S itching (M)0S) %"%"' M)0S Architecture %"%"'"' M)0S 3ode %"%"'": +or ard Equi.alence Class (+EC) %"%"'": 0abel %"%"'"; Shim %"%"'"< 0abeled )ac!et %"%"'"= 0abel S itch ,outer (0S,) %"%"'"@0abel S apping %"%"'">0abel S itched )ath (0S)) %"%"'"?+or ard Equi.alence Class (+EC) %"%"% 0abels and 0abel Bindings %"%"%"' 7eneric 0abel +ormat %"%"%"% 0abel Creation %"%"%": 0abel Distribution

( (( ((( (2 2 2( (9 9(( ' : : ; < < = > > ? '& '' '' '' '' '% '% '% ': ': ': '; '< '=

$%$%$ Signaling Mechanisms %"%"; Tunneling in M)0S %"%"< M)0S effects in () 3et or! %":2irtual )ri.ate 3et or!s (2)3) %":"% 2)3 Approaches %"; M)0S 2)3 CHAPT ! TH! :"' Autonmous s-stem :"'"' (nterior 7ate a- )rotocols :"'"% Eterior 7ate a- )rotocols :"% ,outing :"%"' ,outer :"%"% ,outing classification

'> '? %' %% %; %@ %? %? :& :& &' ::

()ST "* *)GU! S

Title *igure #umber Con.ergence in M)0S net or!s +igure '"' Traditional 0a-er % Bac!bone 3et or! +igure %"' +igure %"% M)0S net or! Basic Architecture of an M)0S 3ode )erforming () +igure %": ,outing 0abel S itched ,outer +igure %"; +igure %"< 0abel S itched )ath +igure %"= +igure %"@ +igure %"> +igure %"? +igure %"'& +igure %"''" +igure %"'% +igure %"': +igure %"'; +igure %"'< +igure %"'= +igure :"' +igure:"% +igure :": +igure :"; +igure :"< +igure :"= 7eneric label format ATM as a data lin! la-er frame rela- as a data lin! la-er Basic M)0S $peration signaling in M)0S Tunneling in M)0S Traditional () net or! M)0S 3et or! Connection1oriented 2)3 Connectionless 2)3 2irtual ,outing Table in )E routers Autonomous S-stem ,outing operation e/ample +unctional diagram of router Static route ,outer (nformation 8pdate Aello pac!ets Page % ? '& '' '% ': '< '< '< '@ '? %& %' %% %< %< %= %? :' :: :; :< ;&

+igure :"@ +igure :"> +igure :"?" +igure :"'& +igure :"'' +igure :"'% +igure :"': +igure :"'; +igure :"'< +igure :"'= +igure :"'@ +igure :"'> +igure :"'? +igure ;"' +igure ;"% +igure ;": +igure ;"; +igure ;"@ +igure ;"> +igure ;"? +igure ;"'& +igure ;"'' +igure ;"'% +igure ;"': +igure ;"'; +igure ;"'< +igure ;"'= +igure ;"'@ +igure ;"'> +igure ;"'? +igure ;"%& +igure ;"%'

A ell1meshed net or! poses challenges for flooding" Di#!straBs algorithm The lin! state database S)+ routing $S)+ bac!bone and lo 1le.el areas $S)+ neighbors relationship 0in! state ad.ertisements $S)+ Common Aeader MD< message data flo in (S1(S (S1(S Bac!bone (S1(S Areas $S)+ Areas medium ser.ice pro.ider net or! Enterprise 2)3 large ser.ice pro.ider net or! 2)3Cs 0S) bet een )E routers () traffic configurations Dela- measurement message format End to end dela- in medium $S)+ net or! Medium M)0S 2)3 ith $S)+ load Medium M)0S 2)3 ith $S)+ throughput Con.ergence duration for $S)+ End to end dela- in medium (S1(S net or! Medium M)0S 2)3 ith (S1(S load Medium M)0S 2)3 ith (S1(S throughput Con.ergence duration for (S1(S End to end dela- in 0ege $S)+ net or! (,edD2)3) end to end dela- in 0arge $S)+ net or! Eello 2)3s dela- comparison 0oad in 0arge $S)+ net or! (,edD2)3)

;' ;= ;> <& <% << <@ <> <? =' =: =; =; @; @< @= @@ >& >' >; >@ >> >? ?& ?& ?' ?% ?: ?; ?; ?< ?=

+igure ;"%: +igure ;"%: +igure ;"%; +igure ;"%< +igure ;"%= +igure ;"%@ +igure ;"%> +igure ;"%? +igure ;":& +igure ;"%' +igure ;"%: +igure ;":: +igure ;":; +igure ;":< +igure ;":= +igure %":@

0oad in 0arge $S)+ net or! (Eello D2)3) 2)3s load comparison Throughput in 0arge $S)+ net or! (,edD2)3) Throughput in 0arge $S)+ net or! (Eello D2)3) 2)3s Throuput comparison Con.ergence duration of $S)+ End to end dela- in 0arge (S1(S net or! (,edD2)3) end to end dela- in 0arge (S1(S net or! (Eello D2)3) 2)3s dela- comparison 0oad in 0arge (S1(S net or! (,edD2)3) 0oad in 0arge $S)+ net or! (Eello D2)3) 2)3s load comparison Throughput in 0arge (S1(S net or! (,edD2)3) Throughput in 0arge (S1(S net or! (Eello D2)3) 2)3s Throughput comparison con.ergence duration of (S1(S

?= ?@ ?> ?> ?? '&& '&& '&' '&' '&% '&: '&: '&; '&< '&< '&=

()ST "* TA+( S

Table #umber Table :"' Authentication t-pes Table ;"' Dela- Message Table ;"% Table ;": Table ;"; Table ;"< Table ;"= Table ;"@ Table ;"> Table ;"? Table ;"'& Table ;"'' Table ;"'% Table ;"': Table ;"'; Table ;"'< Table ;"'= Table ;"'@ Table ;"'> Table ;"'? Table ;"%&

Title

(T81T ,ec" 7"'&'& )erformance Targets for Sensiti.e Applications 2alues of end to end dela- in medium $S)+ load F throughput for M)0S 2)3 ith $S)+ 2alues of end to end dela- in medium (S1(S net or! load F throughput for M)0S 2)3 ith (S1(S Comparison bet een Red_VPN F Yellow_VPN according to the delaComparison bet een Red_VPN F Yellow_VPN according to the load Comparison bet een Red_VPN F Yellow_VPN according to the throughput Comparison bet een Red_VPN F Yellow_VPN according to the delaComparison bet een Red_VPN F Yellow_VPN according to the load Comparison bet een Red_VPN F Yellow_VPN according to the throughput Dela- $S)+ .s (S1(S in medium S) Dela- $S)+ .s (S1(S in large S) 0oad $S)+ .s (S1(S in medium S) 0oad $S)+ .s (S1(S in large S) Throughput $S)+ .s (S1(S in medium S) throughput $S)+ .s (S1(S in large S) con.ergence in medium net or! con.ergence in large net or!

Page <? >;1>< >< >@ >? ?' ?% ?< ?@ ?? '&% '&; '&= '&@ '&> '&> '&? '&? '&? ''& ''&

CHAPT ! "#

INWRTVYRWITN

'%'

+ac,ground
6ith the emergence of con.erged () ser.ices* medium1to1large businesses are

demanding greater performance from their enterprise net or!s than e.er before" To meet the e.ol.ing needs of these fi.e to <&1site companies and their media rich

applications* enterprise net or!s are challenged to e.ol.e in loc!step ith those demands" There is a solution for toda-Cs enterprise net or!s hich has gro n fast and got the confidence and trust of &!' and !T Manager around the world to #e the #e t choice in very large networ$ing0 it i a Multiprotocol La el Switc!i"# (M)0S) technolog-G@H" M)0S has no reached a le.el of maturit- in the mar!et that positions it fa.orabl- against legac- technologies" Based fundamentall- on (nternet )rotocol (())* M)0S technolog- deli.ers the e/traordinar- fle/ibilit- of an () ser.ice ith the essential ser.ice qualitpre.iousl- a.ailable onl- ith legac- technologies" +or businesses ith multiple locations* M)0S1enabled () 2)3 is an ideal solution for enterprise connecti.it-" (t offers cost1effecti.e securit-* an-1to1anconnecti.it-* qualit- of ser.ice* scalable band idth* and a platform for con.ergence one that eliminates net or! redundancies and supports enterprise *2oice o.er (nternet )rotocol (2o()) and man- other great ser.ices offered b- it +igure '"' sho s an e/ample of M)0S multi ser.ices net or!"

+igure '"' Con.ergence in M)0S net or!s

This technolog-*

or! focuses in one of the most important ser.ices offered b- the M)0S hich is The M)0S 2)3" That offered b- ser.ice pro.iders to compete ants to connect its

ith +rame ,ela- and ATM net or!s" 6hen a compan-

geographicall- different sites the- donCt ha.e to purchase a +rame ,ela- circuit* or purchase an ATM circuit* or lease a dedicated telecommunication line" The- can no go to their (nternet ser.ice pro.ider and purchase a M)0S 2)3 to connect their geographicall- different sites"

'%$

Problem Statement:

M)0S 2)3 net or!s replaced man- of traditional technologies and ma!e a huge numbers of ser.ices to guarantee a full end1to1end content deli.er- to the customer" The as achie.ed b- perform a .er- complicated processes because it deal ith man- technolog- and ser.ices to get in one unified platforms" To get an optimum design of this net or!s and ma!e successful deli.er- of customerCs applications ser.ice pro.ider engineer ha.e to face man- complicated issues such li!e traffic engineering and interaction bet een different parts and technologies used in the net or!" The aim of this thesis is to gi.e a better understanding of the beha.ior of M)0S 2)3 net or!s* b- gi.e a detailed stud- of the s-stem and its related routing protocols" ,outing protocols go.ern the performance of the hole net or!s because routers are the heart of the M)0S 2)3 net or!s" There are man- (7)s that can be used in M)0S 2)3 so to ma!e the right choice* this and the e/terior gate a-s protocols" or! pro.ides a detailed stud- of routing protocols according to the interaction bet een in (nterior gate a-s protocols

'%& Proposed Solution:

To gi.e a good anal-ses of the effect of the interior gate a- protocols in the M)0S 2)3 net or!* t o famous routing protocols ere chosen and e/amine these are $S)+ and (S1(S" And then decision about the best interior gate a-s protocols can be made" Comparison bet een these routing protocols achie.ed b- suggest t o deferent scenarios* and gi.e a detailed anal-ses of the beha.ior of M)0S 2)3 net or!s

hen using each interior gate a- routing protocol considering deferent parameters hich can effect the net or! performance" The follo ing point ill be considered: Anal-4e the beha.ior of the interior routing protocol ($S)+*(S1(S) in different scenarios and net or! en.ironment" Anal-4e the beha.ior of the e/terior routing protocol (B7)) in the efficienc- of the net or!" (nfluence of dela- on M)0S 2)3 net or! according to the interior routing protocols" (n depth stud- of $S)+ interior routing protocol and (S1(S protocol to decide the point of po er and ea!ness in them" Search and stud- to decide if the M)0S 2)3 is the best solution for the net or! according to the result of the throughput and point to point del-"

'%-

"b.ectives:
The aim from this research is to help 3et or! designers and engineer to ma!e hen ma!ing a M)0S 2)3 net or!"Main ob#ecti.es from this

the right decision research can be:

Designing t o deferent ser.ice pro.iders net or!s and then anal-sis the net or! performance according to deferent parameters" To find the effect of the interior routing protocol 2)3 net or!s" hen designing M)0S1B7)

 Enhancement of the performance for the M)0S IB7) 2)3 net or!s" To increase the throughput of the M)0S1B7) 2)3 net or!s" To decrease the dela- in traffic for M)0S1B7) 2)3 net or!s" To find the optimum design of M)0S1B7) 2)3 net or! according to deferent parameters"

'%/ 0pected !esults:

This or! is mainl- describes the relationship bet een the interior gate a-

protocols and the performance of the M)0S 2)3 net or!s" The main e/pected result is to ha.e a clear .ie of the best routing protocols can be used in the M)0S 2)3 net or!" This can be getting from the simulation results obtained from $)3ET* hich sho s the performance parameters such as throughput* load* end1 to1end dela- and protocols con.ergence time for the M)0S 2)M net or!s" The simulation results also pro.ide graphical comparison of the net or!s"

'%1 !elated 2or,s:

(n G'H* the authors presented an efficient JoS configuration scheme for M)0S based 2)3s ser.ices" +rom their stud- the- pro.ed the efficienc- of the JoS scheme proposed for M)0S 2)3" Their goal as to gi.e customers the possibilitto e/ceed their contracted band idth if residual band idth is a.ailable in the lin! or if the other 2)3s donCt use their contacted band idth"

(n G%H* the paper mainl- comprehensi.el- presented an o.er.ie of M)0S*B7) and* both la-er % and la-er : 2)3s" (n particular* () 2)3s issues such as speed* scalabilit- and securit- are discussed in detail" And* the- ha.e proposed a ne design scheme for M)0SKB7)2)3s b- merging the features of la-er1: (such as scalabilit- and intelligence) ith the features of la-er1% (such as efficienc- and simplicit-)* to deal ith the toda-Cs e.ol.ing demands of net or! speed* qualit- of ser.ice* scalabilit- and securit-" (n G:H* the authors present a detailed descriptions of M)0S 2)3 net or!s and suggest a M)0S 2)3 net or! for a 2o() ser.ices design then the- pro.ide a performance anal-ses of the proposed design according to the interior gate aprotocols (,()* $S)+)" (n G;H*this paper mainl- focused in the interactions bet een B7) and $S)+ in large scale net or!s* the- used the design of e/periments tool in ,$SS"3et to characteri4e $S)+ and B7) beha.ior in combination as ell as their interactions" Based on the ,oc!etfuel data repositor-* The- ha.e de.eloped a Lmore realisticM large1scale simulation of these t o dominant inter1 and intra1domain routing protocols"

'%3 !esearch outlines:

This research thesis ill consist of fi.e chapters: Chapter ': )ntroduction: a general introduction to e/pected results" hat the thesis is all about* or!s and the

problem statement* proposed solution* aims and ob#ecti.es related

 Chapter $: (iterature revie4: in this chapter bac!ground of the M)0S * 2)3 and M)0S 2)3 technolog- is pro.ided" Chapter &: !outing in 5P(S: this chapters gi.es a detailed e/plain and discussions about the routing and deferent t-pes of routing protocols" Chapter -: mpirical Study 6"P# T Analysis7: The anal-sis and simulation model is presented in this chapters Chapter / : Conclusion: this chapter presents the conclusion of this thesis and the future or!"

CHAPT ! T2"

LERIWQR REZIEU

$% +ac,ground:
Se.eral research papers* articles* #ournals and boo!s bac!ground of the theor- part related to this thesis ere studied to get a solid or!" 0iterature re.ie s of

technologies discussed in this or! are presented in this chapter"

$%' Traditional !outing and Pac,et S4itching

The initial deplo-ment of the (nternet addressed the requirements of data transfer o.er the net or!" This net or! catered to simple applications such as file transfer and remote login" To carr- out these requirements* a simple soft are1 based router platform* ith net or! interfaces to support the e/isting T'KE'I or as sufficient" As the demand for higher T:KE:Ibased bac!bones +igure %"'* de.ices

speed and the abilit- to support higher1band idth transmission rates emerged* ith capabilities to s itch at the 0e.el1% (data lin!) and the 0e.el1: ithin the subnets of a local1area net or! (net or! la-er) in hard are had to be deplo-ed" 0a-er1% s itching de.ices addressed the s itching bottlenec!s (0A3) en.ironment" 0a-er1: s itching de.ices helped alle.iate the bottlenec! in 0a-er1: routing b- mo.ing the route loo!up for 0a-er1: for arding to high1speed s itching hard are" These earl- solutions addressed the need for ire1speed transfer of pac!ets as the- tra.ersed the net or!* but the- did not address the ser.ice requirements of the information contained in the pac!ets" Also* most of the routing protocols deplo-ed toda- are based on algorithms designed to obtain the

shortest path in the net or! for pac!et tra.ersal and do not ta!e into account additional metrics (such as dela-* #itter* and traffic congestion)* managers"G = H hich can further diminish net or! performance" Traffic engineering is a challenge for net or!

+igure %"' Traditional 0a-er % Bac!bone 3et or!

$%$ 5ultiprotocol (abel S4itching 65P(S7:

M/1% i an improved method for forwarding pac$et through a networ$ u ing information contained in la#el attached to !/ pac$et . The la#el are in erted #etween the 1ayer 2 header and the 1ayer . header in the ca e of frame3#a ed 1ayer . technologie , and they are contained in the virtual path identifier 45/!6 and virtual channel identifier 45&!6 field in the ca e of cell3 #a ed technologie uch a ATM.

M/1% com#ine 1ayer . witching technologie with 1ayer 2 routing technologie . The primary o#7ective of M/1% i to create a fle"i#le include networ$ing fa#ric that provide increa ed performance and ta#ility. Thi traffic engineering and 5/8 capa#ilitie , which offer e of ervice 4&o%6. !n are a igned a are forwarded olely on the 9uality of ervice 4:o%6 with multiple cla

an M/1% networ$ ;igure ..) incoming pac$et la#el #y an <dge 1a#el3%witched +outer. /ac$et along a Label-Switched #outer !LS#" ma$e forwarding deci ion

ath !LS " where each Label-Switched #a ed

la#el= content . At each hop, the 1%+ trip off the e"i ting la#el and apply a new la#el, which tell the ne"t hop how to forward the pac$et. The la#el i tripped at the egre <dge 1%+, and the pac$et i forwarded to it de tination.>?@

+igure %"% M)0S net or!

$%$%' 5P(S Architecture: The architecture is split into t o separate components: the $orwardi"# component (data plane) and the control component (control plan)" The for arding component uses a label1for arding database maintained b- a label s itch to perform the for arding of data pac!ets based on labels carried b- pac!ets" The control component is responsible for creating and maintaining label1for arding information (referred to as routing"G'&H i"di"#s) among a group of interconnected label s itches" +igure %"% sho s the basic architecture of an M)0S node performing ()

*igure $%&% +asic Architecture of an 5P(S #ode Performing )P !outing

$%$%'%' 5P(S #ode:

A node

hich is running M)0S" (t is a are of M)0S control protocols and is

capable of for arding pac!ets based on labels" $%$%'%$ 5P(S 8omain A contiguous set of nodes hich operate M)0S routing and for arding* and hich are under one administrati.e domain" $%$%'%& *or4ard 9uivalence Class 6* C7: A group of () pac!ets that are for arded in the same manner (e"g"* for arded to the same ne/t hop* treated ith the same priorit-) " $%$%'%& (abel: A short fi/ed length identifier* $%$%/%' Shim: A space in a pac!et bet een the la-er% and la-er : headers" A label is encoded in the shim" $%$%/%$ (abeled Pac,et A pac!et into hich a label has been encoded" $%$%'%/ (abel S4itch !outer 6(S!7: An M)0S node hich is capable of for arding la-er : pac!ets" A 0S, can be at the ingress(!no n as )ro.ider edge router) or egress (0E,) of the M)0S domain* or at The core of the domain(!no n as )ro.ider router" (f a 0S, is in the core of the M)0S Domain" (t routes the pac!et based on the label and s ap the 0abel before the pac!et is sent to the output port of the node" (f a 0S, is at the ingress or egress of the M)0S domain" (t generates A label in the ingress* and remo.es the label at the egress +igure %"; "G=H hich is carried b- a pac!et and is used to identif- a +EC* usuall- of local significance"

+igure %"; 0S,

$%$%'%1 (abel S4apping: The operation consisting of loo!ing up an incoming label to Determine the $uting label* encapsulation* output port* and other Data handling information" $%$%'%3 (abel S4itched Path 6(SP7: An 0S) consists of a sequence of 0S,s that s itch a labeled pac!et through an M)0S net or!" (n M)0S net or!* the first 0S, of an 0S) is the ingress 0S, for that 0S)* and the last 0S, of the 0S) is the egress 0S," The intermediate 0S,s are or!ing in bet een the ingress and egress 0S,s +igure %"<" G=HG'>H

+igure %"<0S)

%"%"'"> *or4ard 9uivalence Class 6* C7: A group of pac!ets that has the same transmission path and for arding mechanism is !no n as +EC" The pac!ets belonging to the same +EC ha.e the same label" But some pac!ets do not belong to same +EC and for arding mechanism due to a different E9) .alue" (ngress 0S,s decides hich pac!et belongs to hich +EC and this is done onl- once in M)0S net or! G=H"

$%$%$ (abels and (abel +indings: A label* in its simplest form* identifies the path that a pac!et should tra.erse" A label is carried or encapsulated in a 0a-er % header along ith the pac!et" The recei.ing router e/amines the pac!et for its label content to determine the ne/t hop" After a pac!et has been labeled* the rest of the #ourne- of the pac!et through the bac!bone is based on label s itching" The label .alues are of local significance onl-* meaning that the- pertain onl- to hops bet een 0S,s" After a pac!et has been classified as a ne or e/isting +EC* a label is assigned to the pac!et" The label .alues are deri.ed from the underl-ing data lin! la-er" These data lin! la-er identifiers* such as +rame ,ela- D0C(s or ATM 2)(K2C(s* can be used directl- as labels" The pac!ets are then for arded based on their label .alue" 0abels are bound to an +EC as a result of some e.ent or polic- that indicates a need for such binding" These e.ents can be either data1dri.en bindings or control1 dri.en bindings" The latter is preferable because of its ad.anced scaling properties that can be used in M)0S"

0abel assignment decisions can be based on for arding criteria such as the follo ing: Destination unicast routing" Traffic engineering (TE)" Multicast" 2irtual pri.ate net or! (2)3)" Jualit- of Ser.ice (JoS)"

%"%"%"' Generic (abel *ormat: 7eneric label format is illustrated in +igure %"= "The label can be embedded in the header of the data lin! la-er(the ATM 2C(K2)( is sho n in +igure %"@ and frame1rela- D0C( in +igure %">) or in the shim (bet een la-er % and la-er : net or! header as sho n in +igure %"?" G=H

+igure %"= 7eneric label format

+igure %"@ ATM as a data lin! la-er

+igure %"> frame rela- as a data lin! la-er

$%$%$%$ (abel Creation: Topology:based method I uses normal processing of routing protocols (such as $S)+ and B7))" !e9uest:based method I uses processing of request1based control traffic (such as ,S2))" Traffic:based method I uses the reception of a pac!et to trigger the assignment and distribution of a label" The topolog-1 and request1based methods are e/amples of control1dri.en label bindings* hile the traffic1based method is an e/ample of data1dri.en binding" $%$%$%& (abel 8istribution

M)0S architecture dose not mandate a single method of signaling for label distribution" E/isting routing protocols* such as the border gate a- protocol (B7))* ha.e been enhanced to pigg-bac! the label information e/change of labels" The (ET+ has also defined a ne space" A summar- of the .arious schemes for label e/change is as follo s: '" (8P I maps unicast () destination into labels %" !S;P<C!:(8P I used for traffic engineering and resource reser.ation" :" Protocol:independent multicast 6P)57 I used for multicast states label mapping" ;" +GP 6+order Gate4ay Protocol7 I e/ternal labels (2)3)"G=H /% (abel:S4itched Paths 6(SPs7 A collection of M)0S1enabled de.ices represents an M)0S domain" 6ithin an M)0S domain* a path is set up for a gi.en pac!et to tra.el based on an +EC" The 0S) is set up prior to data transmission" M)0S pro.ides t o options to set up an 0S): Hop:by:hop routing each 0S, independentl- selects the ne/t hop for a gi.en +EC" This methodolog- is similar to that currentl- used in () net or!s" The 0S,s support an- a.ailable routing protocols ($S)+* ATM N)" 0plicit routing E/plicit routing is similar to source routing" The ingress 0S, (i"e"* the 0S, here the data flo to the net or! first starts) specifies the list of ithin the contents of the protocol" The ,S2) has been e/tended to support pigg-bac!ed protocol !no n as the label distribution protocol (0D)) for e/plicit signaling and management of the label

nodes through optimal* as

hich the pac!et tra.erses" The path specified could be non1

ell" Along the path* the resources ma- be reser.ed to ensure JoS to

the data traffic" This eases traffic engineering through out the net or!* and differentiated ser.ices can be pro.ided using flo s based on policies or net or! management methods" The 0S) setup for an +EC is unidirectional" The return traffic must ta!e another 0S)" +igure %"? sho s a basic operation for the and interaction bet een the M)0S net or! elements"G=H*G?H"

+igure %"? Basic M)0S $peration

The follo ing steps must be ta!en for a data pac!et to tra.el through an M)0S domain: label creation and distribution" Table creation at each router" label1s itched path creation" 0abel insertionKtable loo!up" )ac!et for arding" The source sends its data to the destination" (n an M)0S domain* not all of the source traffic is necessaril- transported through the same path" Depending on the traffic characteristics* different 0S)s could be created for pac!ets requirements" ith different

$%$%& Signaling 5echanisms

'" label re9uestO8sing this mechanism* an 0S, requests a label from its do nstream neighbor so that it can bind to a specific +EC" This mechanism can be emplo-ed do n the chain of 0S,s up until the egress 0E, (i"e"* the point at hich the pac!et e/its the M)0S domain)" %" label mappingO(n response to a label request* a do nstream 0S, label to the upstream initiator using the label mapping mechanism" Concepts for label request and label mapping are e/plained in +igure %"'&: ill send a

+igure %"'& M)0S signaling

$%$%- Tunneling in 5P(S A unique feature of M)0S is that it can control the entire path of a pac!et ithout e/plicitl- specif-ing the intermediate routers" (t does this b- creating tunnels through the intermediar- routers that can span multiple segments" This concept is used in pro.isioning M)0SIbased 2)3s" Consider the scenario in +igure %"''" 0E,s (0E,'* 0E,%* 0E,:* and 0E,;) all use B7) and create an 0S) bet een them (0S) ')" 0E,' is a are that its ne/t destination is 0E,%* as it is transporting data for the source* destination* and so on" These 0E,s (0E,')"G=H" hich must go through t o segments of the net or!" (n turn* 0E,% is a are that 0E,: is its ne/t ill use the 0D) to recei.e and store labels a- to the ingress 0E, from the egress 0E, (0E,; in this scenario) all the

+igure %"''" Tunneling in M)0S

+or 0E,' to send its data to 0E,%* it must go through se.eral 0S,s" Therefore* a separate 0S) (0S) %) is created bet een the t o 0E,s (0E,' and 0E,%) that spans 0S,'* 0S,%* and 0S,:" This* in effect* represents a tunnel bet een the t o 0E,s" The labels in this path are different from the labels that the 0E,s created for 0S)'" This holds true for 0E,: and 0E,;* as them" 0S) : is created for this segment" To achie.e this* the concept of a label stac! is used 0S) :* it hen transporting the pac!et through t o net or! segments" As a pac!et must tra.el through 0S) '* 0S) %*and ill carr- t o complete labels at a time" The pair used for each segment is (') first segment* label for 0S) ' and 0S) % and (%) second segment* label for 0S) ' and 0S) :" 6hen the pac!et e/its the first net or! and is recei.ed b- 0E,:* it ill remo.e the label for 0S) % and replace it ithin the pac!et ith 0S) : label* hile s apping 0S) ' label ith the ne/t hop label" 0E,; ill remo.e both labels before ell as for the 0S,s in bet een

sending the pac!et to the destination"G=H" $%$%/ 5P(S effects in )P #et4or,: M)0S technolog- pla-s a main rule in the enhancement of the traditional () net or!s this section gi.es a brief discussion about these enhancement" (n traditional () net or!s* pac!ets are routed according to information contained in

the header of each pac!et" As the pac!ets ma!e their

a- across the net or!* the-

are e/amined b- each s itchKrouter the- pass through to determine ho the pac!et should be handled in terms of Jualit- of Ser.ice (JoS) and outbound routing" (n man- cases* each pac!et is encr-pted before it enters the net or! to ensure confidentialit- +igure %"'%

+igure %"'% Traditional () net or!

All of these functions (e"g"* chec!ing for errors* .erif-ing address* repac!aging*re1 transmitting)* .ideo* both of hile necessar-* ta!e time to perform and introduce dela- into the hich are becoming ma#or elements in enterprise () net or!s" equation I an unacceptable fact for dela-1sensiti.e applications li!e .oice and M)0S eliminates this problem* as +igure %"': illustrates" As pac!ets are created for transport in an M)0S net or!* the- are gi.en a LlabelM that identifies not onlthe priorit- of the pa-load the- contain* but also the relati.e priorit- of each pac!et as ell" B- rel-ing on this unique prioriti4ation scheme* traffic deli.ered o.er an ()1based M)0S net or! demonstrates JoS le.els that are identical to those pre.iousl- a.ailable onl- on +rame ,ela-* ATM* and )ri.ate 0ine net or!s" M)0S or!s because it performs t o tas!s .er- ell: (t prioriti%es traffic based on header information* and it s!apes the traffic according to its !no ledge of net or! topolog- and current load (Shaping is simpl- the process of spreading traffic

across all paths in the net or! to guarantee optimal traffic handling b- the resources a.ailable ithin the net or!)"G'?H

+igure %"': M)0S 3et or!

$%& ;irtual Private #et4or,s 6;P#7:

A $irtual %ri$ate network 45/86 i a data networ$ compo ed of private and pu#lic ection that permit over unprotected pu#lic connection ending confidential data without the a ri $ of

compromi e #y eave dropper , thieve , or tho e who would a#otage information. To the u er , a 5/8 appear networ$. The ucce organization over circuit a private of the !nternet ha in pired companie and

to di tri#ute an increa ing amount of information u ing !nternet protocol . !n a format made ea y to and hyperte"t

read #y incorporating the graphical interface

techni9ue of the Ae#, companie and organization are a#le to provide proprietary information to employee and product and information to the pu#lic. To organization erve them, companie

u e the pu#lic !nternet. To

erve their internal

need , companie and organization u e private internet called intranets. At fir t, u er from in ide and out ide the enterpri e were plea ed to communicate with one another and do #u ine together. Bowever, once the u er community had uffered a few epi ode of eave dropping, hac$ing, or theft of information, they ought to achieve privacy without acrificing the fle"i#ility can #e ac9uired from u ing the pu#lic !nternet. To do thi , they created a 5/8. Bowever, it would #e wrong to imagine that 5/8 created range of communication facilitie !%C8, and /'T%. $%&%'Types of ;P#s 2)3s can be di.ided in se.eral a-s" $ne set of configurations is: P Intranet VPN: A 2)3 in hich se.eral enterprise campus net or!s are interconnected b- tunnels o.er (nternet connections (distributed bac!bone)" P Extranet VPN: An intranet 2)3 used b- customers* suppliers* and enders" Tunnels are established o.er (nternet connections to a secure enterprise ser.er" = Remote access VPN: A 2)3 in campus net or!s" hich enterprise emplo-ees on the mo.e can establish a dial1up connection to a remote (S) and create tunnels to enterprise olely from pu#lic !nternet facilitie . They u e the full3 including lea ed telephone

circuit , frame relay or ATM lin$ , communication atellite hop ,

P Intracompany VPN: A single campus net or! or an intranet 2)3* in encr-pted communications are used to protect against securit- breaches enterprise" 8sing an- of these arrangements ensures the o ner has a significant le.el of control o.er ho can read information (i"e"* read onl-)* or!

hich

ithin the

ith information ithin the

(i"e"*do nload)* and contribute or change information (i"e"* author or edit)" +urthermore* the- can restrict electronic mail and other traffic to compan-" (n addition* the net or! uses a popular set of protocols that are familiar to man- persons" Moreo.er* campus net or!s (intranets) can be connected o.er a distributed bac!bone supplied b- the (nternet"G'%H $%&%$ ;P# Approaches: 2)3 technologies ha.e e.ol.ed into t o ma#or approaches to ard implementing 2)3 ser.ices: '" Connection:oriented ;P#O The )E de.ices pro.ide .irtual leased lines bet een the CE de.ices" These .irtual leased lines are called &irtual circuits (2Cs)" The 2Cs can be permanent* established out1of1band b- the ser.ice pro.ider net or! management team (called per'a"e"t &irtual circuits, or PV(s)" The- can also be temporar-* established on demand b- the CE de.ices through a signaling protocol that the )E de.ices understand" (These 2Cs are called switc!ed &irtual circuits, or SV(s)+igure G%"';H"G'&H

+igure %"'; Connection1oriented 2)3

%" Connectionless ;P#O The )E de.ices participate in the connectionless data transport bet een CE de.ices" (t is unnecessar- for the ser.ice pro.ider or the customer to establish 2Cs in these 2)3s* e/cept perhaps bet een the )E and CE routers if the ser.ice pro.ider uses s itched 6A3 as its access net or! technolog- figure G%"'<H"G'&H

+igure %"'< Connectionless 2)3

$%- 5P(S ;P#: M)0S1based 2)3s use a combination of connectionless 2)3s bet een the customers and ser.ice pro.iders (thus minimi4ing the pro.isioning comple/itand cost) ith connection1oriented 2)3s in the net or! core (reducing the

o.erhead on the ) de.ices)" +urthermore* se.eral additional mechanisms ha.e been implemented to allo the customers to use o.erlapping address spaces"(n a t-pical M)0S12)3 net or!* the CE routers and )E routers e/change the customer routes using an- suitable () routing protocol" These routes are inserted into 2,+s on the )E routers* hich guarantees the perfect isolation bet een customers" This process is illustrated in +igure %"'=* hich details the internal structure of a )E router (San Qose) to hich t o 2)3 customers are connected (+ast+ood and EuroBan!) and hich also connects to a ) router"G'&H

+igure %"'= 2irtual ,outing Table in )E routers

6hen customer routes are placed into 2,+s* the )E routers allocate a separate M)0S label that ill be needed for 2)3 data for arding to each customer route" ith The customer routes and associated M)0S labels are transported across the )1 net or! using multiprotocol B7)" The customer () addresses are augmented a =;1bit route distinguisher before being inserted into the pro.iderBs B7) to ensure global uniqueness of potentiall- no unique customer addresses" Additional B7) attributes (e/tended B7) communities) are used to control the e/change of routes

bet een 2,+s to allo

the ser.ice pro.iders to build 2)3 topologies that are

almost impossible to build ith an- other 2)3 technolog-" $%-%' !outing Protocols "ptions: E/tended range of () routing protocols that are supported bet een the )E routers and the CE routers" Enhanced (7,) (E(7,)) and (ntegrated (ntermediate S-stem1to1(ntermediate S-stem ((ntegrated (S1(S) are supported* as routers (s!a' li")s)" +urthermore* it supports () Multicast inside the M)0S 2)3 and per12,+ net or! address translation (3AT) on the )E router G'&H"This thesis is gi.e a detailed discussion in routing protocol in chapter :" $%-%$ 5P(S ;P# as choice for service providers: Man- ser.ice pro.iders that anted to minimi4e their costs of pro.isioning and operations b- offering all their ser.ices (2)3 and public (nternet) o.er a common infrastructure ha.e enthusiasticall- embraced M)0S1based 2)3 net or!s" +urthermore* these ser.ice pro.iders ha.e achie.ed significant cost sa.ings due to the pro.isioning simplicit- offered b- M)0S 2)3Bs integration of both connectionless and connection1oriented 2)3 approaches" An end1to1end M)0S 2)3 solution is* li!e an- other 2)3 solution* di.ided into the central )net or! to hich a large number of customer sites (sites in the C1 net or!) are attached" The customer sites are attached to the )E de.ices ()E routers) through CE de.ices (CE routers)"Each )E router contains se.eral .irtual routing and for arding tables (2,+s)Oat least one per 2)3 customer" These tables are used together ith Multiprotocol B7) run bet een the )E routers to e/change customer routes and to propagate customer datagrams across the M)0S ith the benefits ell as additional $S)+ connecti.it- options* including .irtual $S)+ lin!s bet een )E

2)3 net or!" The )E routers perform the label imposition (ingress )E router) and remo.al (egress )E router)" The central de.ices in the M)0S 2)3 net or! () routers) perform simple label s itching" M)0S1based 2)3s ha.e been significantl- enhanced since their initial rollout" The ne M)0S 2)3 features allo better integration of access technologies* ell as support of ne transport support of additional )E1CE routing protocols* as options across M)0S bac!bones.G'&H

CHAPT ! TH!

RTYWING IN MPLS

&%' Autonomous systems:

The definition of an autonomous s-stem (AS) is integral to understanding the function and scope of a routing protocol" An AS is defined as a logical portion of a larger () net or!" An AS is normall- comprised of an internet or! ithin an

organi4ation" (t is administered b- a single management authorit-" As sho n in +igure :"'* an AS ma- connect to other autonomous s-stems managed b- the same organi4ation" Alternati.el-* it ma- connect to other public or pri.ate net or!s"

+igure :"' Autonomous S-stem

Some routing protocols are used to determine routing paths are used to interconnect a set of autonomous s-stems:

ithin an AS" $thers

&%'%' )nterior Gate4ay Protocols 6)GPs7: (nterior gate a- protocols allo routers to e/change information &%'%$ ithin an AS" E/amples of these protocols are $pen Short )ath +irst ($S)+) and ,outing (nformation )rotocol (,())" 0terior Gate4ay Protocols 6 GPs7: E/terior gate a- protocols allo the e/change of summar- information bet een autonomous s-stems" An e/ample of this t-pe of routing protocol is Border 7ate a- )rotocol (B7))" +igure :"' depicts the interaction bet een interior and e/terior protocols" (t sho s the interior protocols used to maintain routing information ithin each

AS"The figure also sho s the e/terior protocols maintaining the routing information bet een autonomous s-stems" 6ithin an AS* multiple interior routing processes ma- be used" 6hen this occurs* the AS must appear to other autonomous s-stems as ha.ing a single* coherent interior routing plan" The AS must present a consistent .ie destinations"G'<H of the internal

&% $ !outing
,outing is the process of for arding unicast or multicast pac!ets from a sending host to a destination host or hosts" (t emplo-s a node that furnishes the ph-sical and logical connections bet een t o net or!s so that pac!ets are for arded along a path that connects the sending host to the destination host" At each router* for arding is accomplished in the (nternet la-er and ma- require different net or! interface la-ers to match the characteristics of the input and output net or!s" Each router ad&ertises its status and capabilities and disco&ers the status and capabilities of its neighbors" ,outers ma!e for arding decisions based on the contents of their local routing tables" 6hen 6A3s and 0A3s form an internet or!* net or! addresses* segmentation and reassembl-* and other capabilities principle of routing" (f the destination host (3ode %) is on the same net or! as the sender (3ode ')* the sending node resol.es the MAC address of the destination and deli.ers the pac!et(s) directly" (f the destination node (3ode :) is not on a directl- attached net or! segment* the sending node ma!es an i"direct deli.er-" (t for ards the pac!et(s) through a series of routers (,outer ' and ,outer %) to the destination node"G';H ill be required to route frames" These are functions contained in the (nternet la-er" +igure :"% sho s the

+igure :"% routing operation e/ample

&%$%' !outer: +igure :": is a functional diagram of a router" A database of routes is stored and maintained b- all routers" Called a routi"# ta le* it contains information concerning routes bet een the node o ning the table and the potential destination nodes" At a minimum it includes the destination (D* intermediate interface (D(s) and for arding address(es)* and information to distinguish the best route to use hen multiple routes are possible" (t is significantl- more comple/ than the table maintained b- bridging de.ices" Ao e.er* its e/tent is limited to the immediatelreachable nodes that surround it* so that it is significantl- smaller" Searching a routing table is a relati.el- simple tas!" +or each route* a t-pical routing table include the follo ing fields: = Destination address: The () address of the node to hich the source directs the pac!et to be deli.ered" +or direct deli.eries* the destination () address carries the same net or! (D as the router" +or i"direct deli.eries* the destination address does not carr- the same net or! (D as the router* and the datagram is sent to the for arding address contained in the table entr-" ill

= Network mask: A bit mas! is used to determine the net or! (D of the destination () address" An () datagram ith a destination () address that contains the specific net or! (D for this route ill be for arded o.er it" P Forwarding IP address: +or i"direct deli.eries* the () address of a directlreachable router to hich the () datagram is for arded for e.entual deli.er- to the destination () address" The () address to hich the () datagram is to be for arded on its ne/t hop" 6hile the routing table contains information on all routes pur.ie * the router maintains a separate loo)-up table in routes are recorded" (f the- are not used again ithin the routerCs hich all recentl- used

ithin a specified time* the- are

purged" Because it does not ha.e to search the larger routing table for directions* the router can pro.ide rapid ser.ice if the routes are called for again before time runs out" )riorit- routes can be stored permanentl- in the loo! up table"G'%H

+igure :": +unctional diagram of router

&%$%$ !outing classification: ,outing algorithms are used to build and maintain the () routing table on a de.ice" There are t o primar- methods used to build the routing table: &%$%$%' Static routing Static routing is manuall- performed b- the net or! administrator" The administrator is responsible for disco.ering and propagating routes through the net or!" These definitions are manuall- programmed in e.er- routing de.ice in the en.ironment"

$nce a de.ice has been configured* it simpl- for ards pac!ets out the predetermined ports" There is no communication bet een routers regarding the current topolog- of the net or!"G'<H +igure :"; sho s an e/ample of here to place a static route and ho a static route is used" Static routing is not an effecti.e stand1alone solution in a medium1 to large1si4ed net or! because the in +igure :";% (n con#unction s-nerg- or!s ell"G''H or! needed to ma!e the net or! run something is .er- large" The most common use of static routes is in stub net or!s* as sho n ith a d-namic routing protocol such as $S)+* this

+igure :"; Static route &%$%$%$ 8ynamic routing: D-namic routing algorithms allo routers to automaticall- disco.er and maintain a areness of the paths through the net or!" This automatic disco.er- can use a number of currentl- a.ailable d-namic routing protocols" The difference bet een these protocols is the '" Distance .ector protocols" %" 0in! state protocols" a- the- disco.er and calculate ne routes to destination net or!s" The- can be classified into three broad categories:

:" A-brid protocols" '% 8istance vector routing: The principle behind distance .ector routing is simple" Each router in the internet or! maintains the dista"ce or cost from itself to e.er- !no n destination" This .alue represents the o.erall desirabilit- of the path" )aths associated smaller cost .alue are more attracti.e to use than paths associated reach the destination"G'<H To ge it closer to understanding a .ector protocol: 8pdate message A pic!s up route data from router 9 and deposits it in router E" 8pdate message B pic!s up route data from router E and deposits it in router R (+igure :"<7" ith a ith a larger

.alue" The path represented b- the smallest cost becomes the preferred path to

+igure :"<" 8pdate A and 8pdate B are .ectors carriers of information from one router to another"

The route data update message B pic!s up from router E is not the same route data that update message A deposited in router E* e.en though the route data pertains to the same destination" An algorithm modifies the deposited route data in router E in such a a- that the data reflects that routerBs position in the net or! relati.e to the routeBs destination"

(nformation for a particular destination prefi/ originates in some router" The router learns the information in one of three a-s:

The destination prefi/ is associated interfaces"

ith one of the routerBs attached

The router is manuall- configured to originate the destination prefi/" The router learns the destination prefi/ from another routing protocol"

A .ector protocol transmits the destination prefi/ to its directl- connected neighbors" Each neighbor* information in such a hen it recei.es the route information* modifies the a- that the route information indicates the distance from

that router to the originating router" +or e/ample* !)P increases the router hop count b- one" The modified route is then added into the routerBs routing table" $nlthen is the route sent to that routerBs o n directl- connected neighbors* to be modified again b- those neighbors"G':H ,() and B7) are t o popular e/amples of distance .ector routing protocols" $% (in, State 8ynamic !outing: The gro th in the si4e and comple/it- of net or!s in recent -ears has necessitated the de.elopment of more robust routing algorithms" These algorithms address the shortcoming obser.ed in distance .ector protocols" These algorithms use the principle of a link state to determine net or! topolog-" A lin! state is the description of an interface on a router (for e/ample* () address* subnet mas!* t-pe of net or!) and its relationship to neighboring routers" The collection of these lin! states forms a lin! state database"G'<H

The idea behind lin! state routing is simple and can be stated as fi.e parts" Each router must do the follo ing: '" Disco.er its neighbors and learn their net or! addresses" %" Measure the dela- or cost to each of its neighbors" :" Construct a pac!et telling all it has #ust learned" ;" Send this pac!et to all other routers" <" Compute the shortest path to e.er- other router" (n effect* the complete topolog- and all dela-s are e/perimentall- measured and distributed to e.er- router"Then Di#!straBs algorithm can be run to find the shortest path to e.er- other router"G%<H Because the routers use the database to maintain state concerning the lin!s and routers in the net or!* the protocol is called lin, state"

&%& !outing Concepts:

This thesis tries to stud- the effect of t o popular lin! state routing protocol ($S)+ F (S1(S) there is a fundamental concepts of lin! state protocols ha.e to be discussed first" Those concepts are:
'" *d+ace"cies: Ao

t o lin! state routers disco.er each other and agree to

e/change routing information"

%" Floodi"#: Ao

routing information is for arded reliabl- to all routers in a

net or!"
:" ,!e li") state data ase :Ao

routing information is stored and !ept accurate"

;" SPF: calculations Ao

a router actuall- uses the information in the lin! state

database to calculate routes" &%&%' Ad.acencies: Before lin! state routers can begin sending and recei.ing announcements and building their databases* the- must be able to identif- their neighbors" And it is not enough to #ust identif- directl- connected routersS in some net or!s* routers might be spea!ing se.eral routing protocols" A router running a specific lin! state protocol must be able to find #ust those directl- connected routers running the same protocol" And e.en this requirement is not good enough" 6ithin the domain of a single routing protocol* there can be constraints on e/change route information" )rerequisite to the operation of a lin! state protocol is the abilit- for e.er- router to identif- itself" Therefore* each lin! state router has a router (D (,(D)* hich is an address unique to each router ithin a single routing domain" The router (D can be administrati.el- assigned* or it can be automaticall- deri.ed b- some means such as using an interface address" The onl- requirement is that it must be different from the (D used b- an- other router in the domain* and the router cannot identif- itself differentl- to different neighbors" To identif- itself and to disco.er neighbors* a lin! state protocol uses Aello messages" At the least* a Aello message includes the (D of the router that originated the message" The Aello also includes information specific to the routing protocol and rele.ant to the sending router such as timer settings* interface parameters* and authentication information" Such information is used to ensure* before forming an ad#acenc-* that the t o routers are in agreement: hich routers are allo ed to

About ho to e/change information and maintain their ad#acenc-* That the information can be e/changed reliabl-* And that the neighbors can trust each other"

6hen a routing protocol is enabled on a router* there is usuall- some method of specif-ing hich connected lin!s from one lin! to all lin!s are to be included in the protocol operations" 0in! state protocols then transmit Aello messages on these lin!s at some regular inter.al" The messages must be broadcast or multicast* so that an- as1-et1undisco.ered neighbors ill hear them" Because the Aello protocol is hich it is transmitted" The used to disco.er onl- directl- connected neighbors* it is important that no Aello message is e.er for arded be-ond the lin! on originating router can ensure this b- methods such as setting the TT0 of the () pac!et containing the message to ' or using a multicast address that is specificallscoped to a single lin!" Handshaking is an easa- to .erif- t o1 a- communication is for each router hich it has recei.ed

to include in its Aellos on a lin! a list of all routers from

Aellos on that lin!" ,outer A in *igure &%1 has recei.ed a Aello from router B" (n its ne/t Aello* A includes BCs router (D" 6hen router B recei.es this Aello* it sees its (D and !no s that A is a are of it" ,outer B responds in !ind b- including ACs (D in its Aellos" 6hen A sees its (D in BCs Aellos* it !no s B is a are of it" 3o both routers ha.e .erified t o1 a- communication* and are ad#acent" This method of handsha!ing is called three1 a- handsha!ing"

+igure :"= hello pac!ets

After an ad#acenc- is formed* Aellos ser.e as !eepali.es for the ad#acenc-" $ne of the protocol parameters that a router can include in its Aello messages is a specification of ho often it sends Aellos" A recei.ing router then !no s ho often to e/pect Aellos from that neighbor" (f the specified time period elapses ithout the reception of a Aello (allo ing some e/tra time for lost Aellos)* a router can assume that the neighbor is no longer acti.e on the lin! and therefore the ad#acencith that neighbor is in.alid" Depending on the lin! state protocol* the Aello period bet een routers might be predetermined and non1negotiable* the routers might be able to negotiate a Aello period* or the Aello periods of the t o routers might be independent (each router #ust accepts its neighborBs period)"G':H &%&%$ *looding 6ithin a net or! of ad#acent routers* each router originates an announcement of its directl- connected lin!s and neighbors" E.er- router in the net or! must recei.e e.er- announcement and record a cop- in its database" The process of getting the announcement to e.er- router is called flooding" +looding in the

net or! sho n in +igure :"@ is an eas- process: Each router sends its announcement to all of its ad#acent neighbors* and each of these neighbors for ards a cop- of the announcement to each of its o n ad#acent neighbors" (f split hori4on is practiced (no router sends an announcement bac! to the neighbor it recei.ed the announcement from)* e.er- router gets a cop- of e.er- announcement and the flooding then stops" The net or! in +igure :"@ presents more of a challenge for flooding because of all the loops" Qust as split hori4on rules are insufficient to stop the looping of .ector protocol updates in such a topolog-* split hori4on rules are insufficient to control the flooding of lin! state announcements" A better process is needed to stop the flooding of an announcement after all routers ha.e a cop-"

+igure :"@" A ell1meshed net or! poses challenges for flooding"

There are other considerations be-ond #ust !no ing router originates an announcement and then fails* ho announcements from the same router* router detect the corruptionT

hen to stop flooding" (f a do the other routers !no

that its announcement no longer is .alidT (f a router recei.es differing hich announcement should be belie.edT (f can a an announcement becomes corrupted either in transit or in a database* ho

Three mechanisms used to create a more reliable flooding process are aging* sequence numbers* and chec!sums" &%&%$%' Timely *looding: Aging $ne of the essential concepts of a lin! state protocol is that the information in e.er- routerBs database must be the same as the information in e.er- other routerBs database" To guarantee Usameness*U no router can modif- another routerBs announcement" That means that e.er- router is responsible for its o n announcements"6hat happens* then* if a router fails after flooding an announcementT (f the failure is due to a lin! problem* the neighbors on the lin! ill detect the failure through the 0a-er % protocol" (f the failure is a protocol daemon or the router itself* neighbors indicating the change" 0in! state protocols include an age field in each lin! announcement" 6hen a router originates an announcement* it sets a .alue in the age field" This .alue is changed either incremented or decremented ($S)+ increments the age* hereas (S1(S decrements it) b- other routers during flooding* and b- e.er- router as the announcement resides in its database" Some absolute .alue is specified in the protocol at hich* if the age reaches this .alue* the announcement is declared in.alid or Uaged out*U and is deleted from the database" The originating router is responsible for sending a ne cop- of the announcement at some time prior to this age e/piration" The origination of a ne announcement is called a refresh" An age counter can be either up1counting or do n1counting" An up1counting age is less fle/ible because it is set bet een t o absolutes: 4ero and the ma/imum ill detect the failure through the loss of announcements Aello messages" (n either case* the effected neighbors send ne

age specified in the protocol design" $n the other hand* a do n1counting age can start at some arbitrar- .alue* bounded at the upper end onl- b- the si4e of the age field* and counts do n to 4ero" &%&%$%$ Se9uential *looding: Se9uence #umbers 6hene.er a router recei.es a lin! announcement* it sends a cop- out each of its do nstream interfaces" (t is ob.ious in a depicted in +igure :"@ that an announcement during flooding* and as a result some routers ell1meshed net or! such as the one ill be replicated numerous times ill recei.e multiple copies of the

same announcement" (f all announcements arri.e at the same time* anannouncement can be chosen" $f course* dela-s across different net or! paths bac! to the originator are going to .ar-* so in most cases the multiple copies of the same announcement arri.e at different times" (n this case* the router might simplaccept the announcement ith the lo est age* on the grounds that the lo est age indicates the ne est announcement" As ith aging* the design of the sequence counter is important" The simplest sequence numbering scheme is a linear one: A sequence number starts at 4ero* and increments up to some ma/imum" +or e/ample* a :%1bit sequence number (used bboth $S)+ and (S1(S) can range from 4ero to % :%* or about ;": billion" (f a router al a-s starts numbering its announcements at sequence number one* this mana.ailable numbers should last far be-ond the lifetime of the router" E.en if a router produces a ne announcement e.er- second sign of a .er- unstable lin! the ould not be reached for more than ':& -ears" ma/imum sequence number

)resumabl- someone ould repair the instabilit- before then"

:":"%": !eliable *looding: Chec,sums Aa.ing a consistent information in all databases corrupted in manithin a lin! state net or! is

.er- important in routing" Eet in net or!s a lin! state announcement can become a-s" An announcement can be changed due to noise on a lin!* hile it resides in a routerBs database" Because of the or it can be corrupted

possibilit- of the announcement being altered* there should be a mechanism for chec!ing to ensure that the announcement is accurate" The concern o.er information corruption certainl- e/tends be-ond lin! state protocols" Most () pac!ets and messages include error chec!ing* most often in the form of a chec!sum" A chec!sum is performed o.er the entire contents of a lin! state announcement ith the e/ception of the age field" Because the age changes as the announcement passes through routers during flooding* including it in the chec!sum ould mean recalculating the chec!sum e.er- time the age changes"G':H &%&%& Announcement Headers Se.eral !inds of identifiers associated ith a lin! state announcement ere

discussed till no " Some identifiers* such as the router (D* are used to differentiate the announcement from other routersB announcements" $ther identifiers* such as the sequence number* age* and chec!sum* are used to differentiate bet een specific instances of an announcement from the same router" All of these identifiers are included in a header that precedes the actual route information of the announcement" This must be e/amined" a-* none of the information in the announcement itself must be e/amined during the flooding processonl- the header

There is also another benefit to ha.ing such identifiers in a header" 6hen a router must describe to a neighbor hat announcements it has in its database* or hen a router must request a cop- of an announcement from a neighbor* the announcements can be full- described b- sending #ust the header rather than the entire announcement" G':H &%&%- SP* Calculations 6ith a complete database* the router can begin calculating a shortest path to all other routers in the net or!" 6hen a path to all routers is !no n* a path to an- of the routersB connected subnets is also !no n" There is a set of rules comes from graph theor- and as formulated b- -ds#er ./ 0i+)stra" A net or! is .ie ed as a graph of nodes* in nodes" 5eep in mind that to calculate shortest paths* some hich the routers are the a- to assign a cost to

each lin! connecting t o nodes is needed" The sum of the costs across a route is the distance of the route" 6e could* if e anted* #ust use router hops" (n this case* each lin! ould ha.e a cost of one hop" But router hops limits us in the a-s e can define and control traffic patterns in the net or!" A better scheme is to assign a dimensionless number to each lin!* as sho n in +igure :">" Each number then represents the cost of sending a pac!et out the interface connected to the lin!" A shortest path is the one in hich the total cost of all outgoing interfaces from the source to the destination is the lo est (or UcheapestU)"

+igure :">" A lin! cost on each path in the net or!

ill factor into Di#!straBs algorithm for

calculating the shortest1path routing tree in a lin! state net or!"

Construct GaH tree of minimum total length bet een the n nodes" (The tree is a graph ith one and onl- one path bet een e.er- t o nodes") (n the course of the construction that presented here* the branches are di.ided into three sets:
("

The branches definitel- assigned to the tree under construction (the- ill be in a subtree)S The branches from hich the ne/t branch to be added to set (* ill be selectedS

(("

(((" The remaining branches (re#ected or not considered)"

The nodes are di.ided into t o sets:

A" B"

the nodes connected b- the branches of set (* the remaining nodes (one and onl- one branch of set ((( ill lead to each of

these nodes)"

6e start the construction b- choosing an arbitrar- node as the onl- member of set A* and b- placing all branches that end in this node in set ((" To start ith* set ( is empt-" +rom then on ards e perform the follo ing t o steps repeatedl-" Step '% The shortest branch of set (( is remo.ed from this set and added to set (" As a result* one node is transferred from set B to set A" Step $% Consider the branches leading from the node* that has #ust been transferred to set A* to the nodes that are still in set B" (f the branch under construction is longer than the corresponding branch in set ((* it is re#ectedS if it is shorter* it replaces the corresponding branch in set ((* and the latter is re#ected" 6e then return to step ' and repeat the process until sets (( and B are empt-" The branches in set ( form the tree required" 3o e can adapt Di#!straBs rules for routers and net or!s" +irst* e define the

sets" Di#!stra defines three sets of branches: (* ((* and (((" 6e define these three sets as follo s:

Set (: The tree database 0in!s (branches) are added to the shortest1path tree b- adding them to this database" 6hen the algorithm is finished* this database ill contain the shortest1path tree" Set ((: The temporar- database 0in!s are copied from the lin! state database to this list in a prescribed order* finished" here the- become candidates to be added e !no the calculation is to the tree" 6hen this database becomes empt-*

Set (((: The lin! state database This is the complete routing database for the net or!* containing the shortest path to each destination"

Di#!stra also specifies t o sets of nodes* A and B* as follo s:

Set A The routers connected to the lin!s in the tree database" Set B All other routers" 6hen the calculation is finished* this set ill be empt-" (n other ords* all routers ill be accounted for in the tree database"

+igure :"? sho s the net or! of +igure :"> along

ith the lin! state database for

the net or!" Each of the entries is in the form Goriginating router neighbor* cost to neighborH" The a- to read this database is* for instance* that router ,' has sent an announcement indicating t o neighbors: neighbor ,%* at a cost of '* and ,<* at a cost of %" ,% has announced three neighbors: ,' ith a cost of %* ,: ith a cost of '* and ,; ith a cost of %" Comparing the entries in the database ith the diagram of the net or!* -ou can see that all ad#acencies are accounted for from the perspecti.e of all routers"

+igure :"?" The lin! state database includes all router ad#acencies and a cost for each"

Each router then creates a tree database and a candidate database* and performs the follo ing steps: '% The router adds itself to the tree database as the root of the tree" (t sho s itself as its o n neighbor* ith a cost of &" $% All entries in the lin! state database describing lin!s from the root to its neighbors are added to the candidate database" &% The cost from the root to each node in the candidate database is calculated" The lin! in the candidate database ith the lo est cost is mo.ed to the tree database* along ith the cost from the root" (f t o or more lin!s are an equall- lo cost from the root* choose one" (f an- entries are left in the candidate database ith a lin! to the neighbor #ust mo.ed to the tree* those entries are deleted from the candidate database" -% The router (D of the neighbor on the lin! #ust added to the tree is e/amined" Entries originated b- that neighbor are added to the candidate database* e/cept for entries in hich the (D of the neighbor is alread- in the tree database" /% (f entries remain in the candidate database* return to Step :" (f the candidate database is empt-* terminate the calculation" At this time e.er- router in the net or! should be represented as a neighbor on one of the lin!s in the tree database* and e.er- router should be represented #ust once"G'<HG';HG':H" +igure :"'& sho an e/ample of S)+ e/ecuted in router A:

+igure :"'& S)+ routing

&%-

0amples of )nterior Gate4ay !outing Protocols:

This thesis is focusing in the effect of the (7)Cs in the M)0S 2)3 net or! (

ill ta!e $S)+ and (S1(S as e/amples sections:

ith detailed description in the follo ing

&%-%' "pen Shortest Path *irst 6"SP*7:

$S)+ is an (7) that routes pac!ets ithin a single autonomous s-stem (AS)" $S)+ uses lin!1state information to ma!e routing decisions* ma!ing route calculations using the shortest path first (S)+) algorithm ( Di#!stra algorithm)" Each router running $S)+ floods lin!1state ad.ertisements throughout the AS that contain information about that routerCs attached interfaces and routing metrics" Each router ta!es the information in these lin!1state ad.ertisements and creates a complete routing table for the net or!"G%=H $S)+ routes () pac!ets based solel- on the destination () address contained in the () pac!et header" $S)+ quic!l- detects topological changes* such as hen router

interfaces become una.ailable* and calculates ne ith a minimumof routing o.erhead traffic" All $S)+ interfaces ha.e a cost*

loop1free routes quic!l- and

hich is described b- a single dimensionless

metric that is determined using the follo ing formula: cost > reference:band4idth ? interface band4idthNNNNNN"(:"') &%-%'%' #et4or, Hierarchy: $S)+ pro.ides the functionalit- to di.ide an intradomain net or! (an autonomous s-stem) into subdomains* commonl- referred to as areas" E.erintradomain must ha.e a core area* referred to as a backbone areaS this is identified ith Area (D &" Areas are identified through a :%1bit area fieldS thus Area (D & is the same as &"&"&"&" 8suall-* areas (other than the bac!bone) are sequentiall- numbered as Area ' (i"e"* &"&"&"')*Area %* and so on" $S)+ allo s a hierarchical setup area as the top le.el ith the bac!bone hile all other areas* connected to the bac!bone area* are

referred to as lo 1le.el areasS this also means that the bac!bone area is in charge of summari4ing the topolog- of one area to another area* and .ice .ersa" +igure :"'' illustrate net or! hierarch- using lo 1le.el areas" &%-%'%$ !outer Classification 6ith the functionalit- pro.ided to di.ide an $S)+ net or! into areas* the routers are classified into four different t-pes (+igure :"''):

+igure :"'' $S)+ bac!bone and lo 1le.el areas

'" rea!"order Ro#ters: These are the routers that sit on the border bet een the bac!bone and the lo 1le.el areas" Each area1border router must ha.e at least one interface to the bac!boneS it also has at least one interface to each area to hich it is connected" %" Internal Ro#ters: These are the routers in each lo 1le.el area that ha.e interfaces onl- to other internal routers in the same area" :" "ackbone Ro#ters: These are the routers located in Area & considered as bac!bone routers" ;" $ "o#ndary Ro#ters: These routers are located in Area & ith connecti.it- to other ASSthe- must be able to handle more than one routing protocol" +or e/ample* to e/change information bac!bone routers"G';H ith another AS* the- must be able to spea! B7)" These routers also ha.e internal interfaces for connecti.it- to other ith at least one interface to other routers in the bac!bone" Area1border routers can also be

&%-%'%& Physical net4or, types: $S)+ categori4es net or! segments into three t-pes"The frequenc- and t-pes of communication occurring bet een $S)+ de.ices connected to these net or!s is impacted b- the net or! t-pe: = Point:to:point: )oint1to1point net or!s directl- lin! t o routers" P 5ulti:access: Multi1access net or!s support the attachment of more than t o routers" The- are further subdi.ided into t o t-pes: 1 Broadcast net or!s ha.e the capabilit- of simultaneousl- directing a pac!et to all attached routers" This capabilit- uses an address that is recogni4ed b- all de.ices" Ethernet and to!en1ring 0A3s are e/amples of $S)+ broadcast multi1access net or!s" 1 3on1broadcast net or!s do not ha.e broadcasting capabilities" Each pac!et must be specificall- addressed to e.er- router in the net or!" 9"%< and frame rela- net or!s are e/amples of $S)+ non1broadcast multi1access net or!s" P )oint1to1Multipoint: )oint1to1multipoint net or!s are a special case of multi1 access* non1broadcast net or!s" (n a point1to1multipoint net or!* a de.ice is not required to ha.e a direct connection to e.er- other de.ice" This is !no n as a partiall- meshed en.ironment"

&%-%'%- #eighbor routers and ad.acencies: ,outers that share a common net or! segment establish a neighbor relationship on the segment" ,outers must agree on the follo ing information to become neighbors: P Area1id: The routers must belong to the same $S)+ area"

P Authentication: (f authentication is defined* the routers must specif- the same pass ord" P Aello and dead inter.als: The routers must specif- the same timer inter.als used in the Aello protocol" P Stub area flag: The routers must agree that the area is configured as a stub area" $nce t o routers ha.e become neighbors* an ad#acenc- relationship can be formed bet een the de.ices" 3eighboring routers are considered ad#acent state information" hen the- ha.e s-nchroni4ed their topolog- databases" This occurs through the e/change of lin!

&%-%'%/ 8esignated and bac,up designated router: The e/change of lin! state information bet een neighbors can create significant quantities of net or! traffic" To reduce the total band idth required to s-nchroni4e databases and ad.ertise lin! state information* a router does not necessaril- de.elop ad#acencies ith e.er- neighboring de.ice: P Multi1access net or!s: Ad#acencies are formed bet een an indi.idual router and the (bac!up) designated router" P )oint1to1point net or!s: An ad#acenc- is formed bet een both de.ices" Each multi1access net or! elects a designated router (D,) and bac!up designated router (BD,)" The D, performs t o !e- functions on the net or! segment: P (t forms ad#acencies ith all routers on the multi1access net or!" This causes the D, to become the focal point for for arding 0SAs" P (t generates net or! lin! ad.ertisements listing each router connected to the multi1access net or!" The BD, forms the same ad#acencies as the designated router" (t assumes D, functionalit- hen the D, fails"

Each router is assigned an >1bit priorit-* indicating its abilit- to be selected as the D, or BD," A router priorit- of 4ero indicates that the router is not eligible to be selected" The priorit- is configured on each interface in the router" +igure :"'% illustrates the relationship bet een neighbors" 3o ad#acencies are formed bet een routers that are not selected to be the D, or BD,"G';HG'<H

+igure :"'% $S)+ neighbors relationship

&%-%'%1 (in, state database: The lin! state database is also called the topolo#y data ase" (t contains the set of lin! state ad.ertisements describing the $S)+ net or! and an- e/ternal connections" Each router state database" (in, state advertisements and flooding: ithin the area maintains an identical cop- of the lin!

The contents of an 0SA describes an indi.idual net or! component (that is*router* segment* or e/ternal destination)" 0SAs are e/changed bet een ad#acent $S)+ routers" This is done to s-nchroni4e the lin! state database on each de.ice" 6hen a router generates or modifies an 0SA* it must communicate this change throughout the net or!" The router starts this process b- for arding the 0SA to each ad#acent de.ice" 8pon receipt of the 0SA* these neighbors store the information in their lin! state batabase and communicate the 0SA to their neighbors" This store and for ard acti.it- continues until all de.ices recei.e the update" This process is called relia le $loodi"#" T o steps are ta!en to ensure this flooding effecti.el- transmits changes e/cessi.e quantities of 0SA traffic: P Each router stores the 0SA for a period of time before propagating the information to its neighbors" (f* during that time* a ne discarded" P To ensure reliabilit-* each lin! state ad.ertisement must be ac!no ledged" Multiple ac!no ledgements can be grouped together into a single ac!no ledgement pac!et" (f an ac!no ledgement is not recei.ed*the original lin! state update pac!et is retransmitted" 0in! state ad.ertisements contain fi.e t-pes of information" Together these ad.ertisements pro.ide the necessar- information needed to describe the entire $S)+ net or! and an- e/ternal en.ironments: P ,outer 0SAs: This t-pe of ad.ertisement describes the state of the routerBs interfaces (lin!s) ithin the area" The- are generated b- e.er- $S)+ router" The ad.ertisements are flooded throughout the area" cop- of the 0SA arri.es* cop- is outdated* it is the router replaces the stored .ersion" Ao e.er* if the ne ithout o.erloading the net or! ith

P 3et or! 0SAs: This t-pe of ad.ertisement lists the routers connected to a multi1 access net or!" The- are generated b- the D, on a multi1access segment" The ad.ertisements are flooded throughout the area" P Summar- 0SAs (T-pe1: and T-pe1;): This t-pe of ad.ertisement is generated ban AB," There are t o t-pes of summar- lin! ad.ertisements: 1 T-pe1: summar- 0SAs describe routes to destinations in other areas $S)+ net or! (inter1area destinations)" 1 T-pe1; summar- 0SAs describe routes to ASB,s" Summar- 0SAs are used to e/change reachabilit- information bet een areas" 3ormall-* information is announced into the bac!bone area" The bac!bone then in#ects this information into other areas" P AS e/ternal 0SAs: This t-pe of ad.ertisement describes routes to destinations e/ternal to the $S)+ net or!" The- are generated b- an ASB," The ad.ertisements are flooded throughout all areas in the $S)+ net or!"G'<H +igure :"': illustrates the different t-pes of lin! state ad.ertisements" ithin the

+igure :"': 0in! state ad.ertisements

&%-%'%3 "SP* Pac,et *ormat: C$MM$3 AEADE,: The common header has the follo ing !e- fields (*igure &%'-): P Version: This field represents the $S)+ .ersion numberS the current .ersion is %" P %ype: This field specifies the t-pe of pac!et to follo " $S)+ has fi.e pac!et t-pes: hello (')* database description (%)* lin! state request (:)* lin! state update (;)* and 0SA (<)" P Packet &ength: This indicates the length of the $S)+ pac!et" P Ro#ter ID: This field indicates the (D of the originating router" Since a router has multiple interfaces* there is no definiti.e address should be the router (D" (n general* a router (D that is based on a loopbac! interface pro.ides much more fle/ibilit- to net or! operators in terms of management than a ph-sical interfaceIbased address" a- to determine hich interface ()

rea ID: This is the (D of the area

here the $S)+ pac!et originated" 2alue

&"&"&"& is reser.edfor the bac!bone area" 'hecks#m: This is the () chec!sum o.er the entire $S)+ pac!et"

+igure :"'; $S)+ Common Aeader *u,ype and *ut!e"ticatio" Field: AuT-pe for authentication" There are three authentication t-pes:
AuT-pe & ' % Meaning 3o authentication Simple* clear te/t pass ord1based authentication Cr-ptographic MD< chec!sum authentication Table :"' Authentication t-pes Authentication +ield Can be an-thing An >1b-te pass ord >1b-te is di.ided as sho n in +igure :"';

or!s

ith the Authentication field

hen AuT-pe is %* it contains a 5e-(D* an Authentication Data 0ength* and a Cr-ptographic Sequence 3umber" MD< chec!sum is used to produce a '=1b-te message digest that is not part of the $S)+ pac!etS rather* it is appended to the end of the $S)+ pac!et"G';H

+igure :"'< MD< message

&%-%$ )ntermediate System to )ntermediate System 6)S:)S7:

(n recent -ears* the (S1(S routing protocol has become increasingl- popular* ith idespread usage among Ser.ice )ro.iders" (t is a lin! state protocol* hich enables .er- fast con.ergence Traffic Engineering"G'=H A t o1le.el hierarch- is used to support large routing domains" A large domain ma- be administrati.el- di.ided into areas" Each s-stem resides in e/actlith large scalabilit-" (t is also a .er- fle/ible

protocol and has been e/tended to incorporate leading edge features such as M)0S

one area" ,outing ithin an area is referred to as (evel ' routing" ,outing bet een areas is referred to as (evel $ routing" A 0e.el % (ntermediate S-stem ((S) !eeps trac! of the paths to destination areas" A 0e.el ' ((S) !eeps trac! of the routing ithin its o n area" +or a pac!et destined for another area* a 0e.el ' (S sends the pac!et to the nearest 0e.el % (S in its o n area* regardless of hat the destination area is" Then the pac!et tra.els .ia 0e.el % routing to the destination area* here it ma- tra.el .ia 0e.el ' routing to the destination" (t should be noted that selecting an e/it from an area based on 0e.el ' routing to the closest 0e.el % (S might result in suboptimal routing" &%-%$%' )S:)S "perations : From a high le(el) I$!I$ operates as *ollows: P ,outers running (S1(S ill send hello pac!ets out all (S1(S1enabled interfaces to

disco.er neighbors and establish ad#acencies" P ,outers sharing a common data lin! ill become (S1(S neighbors if their hello

pac!ets contain information that meets the criteria for forming an ad#acenc-" The criteria differ slightl- depending on the t-pe of media being used (p%p or broadcast)" P ,outers ma- build a lin,:state pac,et 6(SP7 based upon their local interfaces

that are configured for (S1(S and prefi/es learned from other ad#acent routers" P 7enerall-* routers flood 0S)s to all ad#acent neighbors e/cept the neighbor hich the- recei.ed the same 0S)" Ao e.er* there are different forms of hich the flooding operation ma-

from differ"

flooding and also a number of scenarios in

P P

All routers ill construct their lin!1state database from these 0S)s" A shortest1path tree (S)T) is calculated b- each (S* and from this S)T the

routing table is built.

&%-%$%$ )S:)S 8ata:*lo4 8iagram : The flo of information ithin the (S1(S routing function is represented bhich consists of four processes and a diagram are:

the (S1(S data1flo

diagram 6*igure &%'17*

,outing (nformation Base (,(B)" The ,(B consists of the lin!1state database and the for arding database" The four processes in the (S1(S data1flo recei&e, update, decisio", and $orward/

+igure :"'= data flo in (S1(S

The recei&e process is the entr- point for all data* including user data* error reports* routing information* and control pac!ets" (t passes user data and error reports to the for ard process and passes routing information and control pac!ets (hellos* 0S)s* and sequence number pac!ets) to the update process"

The update process generates local lin! information that is flooded to ad#acent routersS in addition* the update process recei.es* processes* and for ards lin! information recei.ed from ad#acent routers" This process manages the 0e.el ' and 0e.el % lin!1state databases and floods 0e.el ' and 0e.el % 0S)s throughout an area" The decisio" process runs shortest1path1first (S)+) algorithm on the lin!1state database* and creates the for arding database" (t computes ne/t1hop information and computes sets of equal1cost paths* creating an ad#acenc- set that is used for load balancing" $n a Cisco router* (S1(S supports load balancing o.er and up to si/ equal1cost paths" The $orward process gets its input from the recei&e process and uses the for arding database to for ard data pac!ets to ard their destination" (t also redirects load sharing and generates error reports" &%-%$%& Areas and the !outing 8omain An (S1(S routing domain is similar to a B7) autonomous s-stem" A routing domain is a collection of areas under an administration that implements routing policies ithin the domain" +ac,bone (S1(S does not ha.e a bac!bone area li!e the $S)+ area &" The (S1(S bac!bone is a contiguous collection of 0e.el %1capable routers* each of different area (+igure :"'@)" hich can be in a

+igure :"'@ (S1(S Bac!bone

Areas 6ith (S1(S* an indi.idual router is in onl- one area* and the border bet een areas is on the lin! that connects t o routers that are in different areas (+igure :"'>)" This is in contrast to $S)+* in hich the area borders are ithin the Area Border ,outers (AB,s) (+igure :"'?)" The reason for this difference is that an (S1(S router generall- has one net or! ser.ice access point (3SA)) address* and an () router generall- has multiple () addresses"

+igure :"'> (S1(S Areas: Area Borders Are on 0in!s Bet een ,outers

Figure 3.19 OSPF Areas: Area Borders Are Within Routers

(evel ' !outer : A 0e.el ' router !no s the topolog- onl- of its o n area and has 0e.el ' or 0e.el'K0e.el% neighbors in this area" (t has a 0e.el ' lin!1state database the information for intra1area routing" (evel $ !outer : A 0e.el % router ma- ha.e neighbors in the same or in different areas* and it has a 0e.el % lin!1state database its o n area" (n the $S( ith all information for inter1area routing" 0e.el orld* a router must !no the topolog- of its o n hen onl- $S( traffic is % routers !no about other areas but ill not ha.e 0e.el ' information from areaS so a 0e.el % router should not be configured configured as 0e.el %" ith all

being routed" (f the traffic in an area is ()1onl-* all the routers can be

 (evel '?(evel $ !outer : A 0e.el 'K0e.el % router ma- ha.e neighbors in an- area" (t has t o lin!1state databases: a 0e.el ' lin!1state database for intra1area routing and a 0e.el % lin!1 state database for inter1area routing" A 0e.el 'K0e.el % router runs t o S)+s and ma- require more memor- and processing as a result" G%@H" &%-%$%- SH"!T ST PATH CA(CU(AT)"#: Shortest path calculation is based on Di#!straCs algorithm" $nce a router recei.es a ne calculations area" 0in! metric in (S1(S has been originall- limited to = bits and* thus* the .alue ranges from & to =: and the total path cost in an (S1(S domain can ha.e a ma/imum .alue of '&%:" This =1bit metric is !no n as a "arrow 'etric" A wide 'etric e/tension is no a.ailable through traffic engineering e/tensions to (S1(S that permits a %;1bit metric* thus allo ing a range of & to '=*@@@*%'< (V%%; W')"G%@H 0S)* it aits for < sec before running the shortest path calculation" There is a '& sec hold1do n timer bet een t o consecuti.e shortest1path ithin the same area" 0'K0% routers that reside in 0' areas must run separate shortest path calculations* one for the 0' area and the other for the 0%

&%-%$%/ Pac,et Types : There are four general t-pes of pac!ets* and each t-pe can be 0e.el ' or 0e.el %" P (ntermediate S-stem1to1(ntermediate S-stem Aello (((A)O8sed b- routers to hich is an (S1(S hich are End S-stem1to1

detect neighbors and form ad#acencies" (n addition to the ((A* protocol data unit ()D8)* there is an (SA and an ESA* (ntermediate S-stem (ES1(S) )D8s"

0in!1state pac!et (0S))OThere are four t-pes of 0S)s: 0e.el ' pseudonode*

0e.el ' nonpseudonode* 0e.el % pseudonode* and 0e.el % nonpseudonode" P Complete sequence number )D8 (CS3))OCS3)s contain a list of all 0S)s

from the current database" CS3)s are used to inform other routers of 0S)s that ma- be outdated or missing from their o n database" This ensures that all routers ha.e the same information and are s-nchroni4ed" The pac!ets are similar to an $S)+ database description pac!et" P )artial sequence number )D8 ()S3))O)S3)s are used to request an 0S) (or

0S)s) and ac!no ledge receipt of an 0S) (or 0S)s)" The follo ing information is included in ((A )D8s: P P P 6hether the )D8 is a point1to1point (6A3) )D8 or a 0A3 )D8" Source (DOS-stem (D of the sending router" Aolding timeOTime period to ait to hear a hello before declaring the

neighbor dead" Similar to the $S)+ dead inter.al* the default .alue is three times the hello inter.al but can be changed ith the (S1(S hello1multiplier command" P Circuit t-pe indicating hether the interface on hich the )D8 as sent is

0e.el '* 0e.el %* or 0e.el 'K0e.el %" P P P )D8 length" 0ocal circuit (D on the sending interface (in point1to1point hello )D8s)" 0A3 (DOS-stem (D of the D(S plus the pseudonode (D (circuit (D) to

differentiate 0A3 (Ds on the same D(S"

)riorit-OAigher is better" 8sed in D(S election (in 0A3 hello )D8s* there is

no D, (Designated ,outer) election on a point1to1point lin!)" B- default* (S1(S hellos are padded to the full ma/imum transmission unit (MT8) si4e" The benefit of padding ((As to the full MT8 is earl- detection of errors caused btransmission problems interfaces"G'=H ith large frames or MT8 mismatched on ad#acent

&%1 Similarities and 8ifferences +et4een )S:)S and "SP*:

(t is helpful to consider the similarities and differences bet een (S1(S and $S)+" +irst* it should be noted that fundamentall- there is little difference bet een $S)+ and (S1(S" Thus*the differences center more on ho often st-listic differences" +, $I-I& RI%IE$: There are se.eral similarities bet een (S1(S and $S)+: P Both protocols pro.ide net or! hierarch- through t o1le.el areas" P Both protocols use Aello pac!ets to initiall- form ad#acencies and then continue to maintain them" P Both protocols ha.e the abilit- to do address summari4ation bet een areas" P Both protocols maintain a lin! state database* and shortest path computation performed using Di#!straCs algorithm" certain things are done*

P Both protocols ha.e the pro.ision to elect a designated router for representing a broadcast net or!" ., DIFFEREN'E$: 6hile there are similarities as noted abo.e* there are se.eral differences: P 6ith $S)+* an area border router can sit on the boundar- bet een the bac!bone area and a lo 1le.el area ith some interfaces in the area hile other interfaces are in the other area" (n (S1(S* routers are entirelarea borders are on lin!s* not on routers" P 6hile $S)+ pac!ets are encapsulated in () datagrams* (S1(S pac!ets are directlencapsulated in lin! la-er frames" P The $S)+ dimension1less lin! metric .alue is in the range ' to =<*<:<* hile (S1 (S allo s the metric .alue to be in the range & to =: (narro been e/tended to the range & to '=*@@@*%'< ( ide metric)" P (S1(S being run directl- o.er la-er % is relati.el- safer than $S)+ from spoofs or attac!s" P (S1(S !eepali.es can be used for MT8 detection since the- are MT81si4ed T02s that are e/plicitl- chec!summed and need to be .erified as such" P (S1(S allo s o.erload declaration through an o.erload bit b- a router to other routers"This is used* for e/ample* b- other routers to not consider an o.erloaded router in path computation"G';H metric)* hich has ithin one or the other areaOthe

CHAPT ! *"U!

EMPIRIRQL SWYV[

-% mpirical !esearch:
Empirical ,esearch based on e/perimentation or direct obser.ation* i"e" e.idence" This !ind of research often conducted to ans er specific questions or to test h-pothesis" This chapter focus in presenting the result of empirical research and the detailed anal-sis in respect to the research questions"

-%'

Simulation:

The term simulation is used in different a-s b- different people" As used here* simulation is defined as the process of creating a 'odel of an e/isting or proposed syste' in order to identif- and understand those factors hich control the s-stem hich can andKor to predict the future beha.ior of the s-stem" Almost an- s-stem gi.e the abilit- the get a clear .ie the performance of it" about points of

be quantitati.el- described using equations andKor rules can be simulated"G'H This ea!ness and help to impro.e

;"'"' Simulation Tools:

Some of the popular discrete-e&e"t si'ulators (DES) for net or!s -%'%'%'G#S&:

are:

(s a graphical net or! simulator that allo s simulation of comple/ net or!s" To pro.ide complete and accurate simulations* 73S: is strongl- lin!ed ith: D-namips* a Cisco ($S emulator* D-nagen* a te/t1based front end for D-namips* Jemu*a generic and open source machine emulator and .irtuali4er and 2irtualBo/* a free and po erful .irtuali4ation soft are" 73S: is an e/cellent complementar- tool to real labs for net or! engineers and administrators" (t can also be used to e/periment features of Cisco ($S* Quniper Qun$S or to chec! configurations that need to be deplo-ed later on real routers" 73S: pro#ect is an open source* free program that ma- be used on multiple operating s-stems* including 6indo s* 0inu/* and Mac$S 9"G%H -%'%'%$ #et4or, Simulator 6ns:&7: 3s1: is a discrete1e.ent net or! simulator* targeted primaril- for research and educational use" ns1: is free soft are* and is publicl- a.ailable for research* de.elopment* and use" The goal of the ns1: pro#ect is to de.elop a preferred* open simulation en.ironment for net or!ing research: it should be aligned contribution* peer re.ie * and .alidation of the soft are"G:H -%'%'%& "P# T 5odeler: stands for $ptimi4ed 3et or! Engineering Tools* $)3ET Modeler ith the simulation needs of modern net or!ing research and should encourage communit-

accelerates the research and de.elopment process for anal-4ing and designing

communication net or!s* de.ices* protocols* and applications" 8sers can anal-4e simulated net or!s to compare the impact of different technolog- designs on end1 to1end beha.ior" Modeler incorporates a broad suite of protocols and technologies* and includes a de.elopment en.ironment to enable modeling of all net or! t-pes and technologies including: 2o()* TC)K()*8MTS*$S)+*M)0S *().= and manother applications"G;H $)3ET Technologies has also offered free of cost .ersion !no n as (T 7uru for academic use" The eas- to use 78( structure of this modeler enable users to design* simulate and .ie de.ices and the ease of using the results ithout ha.ing good programming !no ledge" The stabilit-* accurate results * large number of .enders ere the main reasons to choose the $)3ET modeler as the simulation tool to be used in this research or!"

-%$ "P# T Simulation:

+ollo ing section include in depth stud- of the $)3ET simulator tool to anal-ses the M)0S 2)3 net or! beha.ior:

-%$%' Tas,:
The main tas! of this empirical stud- is to gi.e in depth anal-sis for the performance of the M)0S 2)3 net or!s b- stud-ing the effect of the interior gate a- protocols ($S)+ and (S1(S) in the net or! performance interaction hen theith e/terior gate a- protocols (B7))" This can be achie.ed b- ta!ing

into stud- the different performance metrics li!e con.ergence time* 2)3 dela-* 2)3 load and throughput (bitKseconds)"The results obtained b- the simulation are anal-4ed to determine the beha.ior of M)0S 2)3 bac!bone"

-%$%$ Assumptions:

(t is .er- hard to predicts the beha.ior of M)0S 2)3 bac!bone because of the different designs and implementation factors are in.ol.ed in the net or! such as configuring the 2)3*M)0S routers* 0S)Cs *() traffic* data lin!s* etc" This or! pro.ide a simulation results for different M)0S 2)3 models b- considering $S)+ or (S1(S as (7) and B7) as E7)" )oint to point S$3ET ($C:) lin!s used to connect each router in the simulation design"

-%$%& Analysis 5ethodology:

(n this section the proposed designs of the M)0S 2)3 net or!s presented connection matri/ and location of net or! de.ices" -%$%&%' #et4or, Scenarios: To get a clear and better understanding of the beha.ior of M)0S 2)3 net or! according to the chosen interior gate a- protocol ($S)+ or (S1(S) used in it* t o net or!s scenario ere pro.ided and implemented in the simulation tool: '" Medium ser.ice pro.ider M)0S 2)3 net or! bac!bone gate a- protocol and e/terior gate a- protocol (B7))" %" 0arge ser.ice pro.ider M)0S 2)3 net or! bac!bone protocol and e/terior gate a- (B7))" Each scenario as implemented for t o times according to the (7) used* one time b- using $S)+ and other time using (S1(S" ith interior gate aith interior ill be

ith it is relati.e configurations and thereb- determining the optimum

-%$%&%$ #et4or, Topology: A ph-sical communication scheme consisting of connected de.ices is !no n as net or! topolog-" T o net or! topologies are simulated in this thesis as mentioned before:

'" +irst topolog-: Medium ser.ice pro.ider M)0S 2)3 net or! bac!bone ith interior gate a- protocol and e/terior gate aprotocol (B7)):
The considered topolog- for medium ser.ice pro.ider net or! in both cases of (7) is sho n in +igure ;"':

+igure ;"' medium ser.ice pro.ider net or!

3et or! component:

As mentioned before this topolog- used for the t o test cases first b- using $S)+ routing protocol as (7) and in the second case b- using (S1(S routing protocols but in both test case the same component and initial confirmation are used" This topolog- constructed from: T o autonomous s-stems: '" Ser.ice pro.ider autonomous s-stem named AS1' contain of: a) T o pro.ider edge ()E) routers for recei.ing and transmitting data from customer sites router through the M)0S 2)3 bac!bone" b) Three pro.ider ()) routers ser.ice pro.ider net or!" %" Costumer autonomous s-stem called AS1' contain an enterprise net or! named S Microsyste's (o'pa"y this comapna- ha.e to sites need to be connecting .ia M)0S 2)3 and each site ha.e: a) Costumer edge router: to transmit and recei.e data for ser.ice pro.ider net or!" b) T o costumer routers" :" To ma!e a communication bet een each compan- site Virtual Pri&ate Networ) through M)0S cloud is used and named VPN red as sho n in +igure ;"%: hich handling the traffic and routing through the the

+igure ;"% enterprise 2)3

As mentioned pre.iousl- lin!s bet een routes are )))DS$3ETD$C: ('<<Mbps) lin!s"

%" Second topolog-: 0arge ser.ice pro.ider M)0S 2)3 net or! bac!bone (B7)):
The considered topolog- for large ser.ice pro.ider net or! in both cases of (7) is sho n in +igure ;"::

ith interior gate a- protocol and e/terior gate a- protocol

+igure ;": large ser.ice pro.ider net or!

3et or! component:

The main reason of suggesting this topolog- is to gi.e more anal-ses for the beha.ior of M)0S 2)3 net or! according to the interaction bet een the interior gate a- protocols and e/terior gate a- protocols under more complicated circumstances" Again this scenario as simulated for t o times b- using $S)+ as (7) ones and second using (S1(S as (7)" This topolog- constructed from: Three autonomous systems: Ser.ice pro.ider autonomous s-stem named AS1' contain of: '" Three pro.ider edge ()E) routers" %" +our pro.ider ()) routers " '" +irst costumer autonomous s-stem named AS1% contain an enterprise belongs to compan- ' 2)3 each site from them ha.e: '" Costumer Edge router (CE)" %" T o customer routers" %" Second costumer autonomous s-stem named AS1: contain an enterprise hich ha.e three sites need to be connected .ia net or!

hich ha.e three sites need to be connected .ia M)0S

net or! belongs to compan- %

M)0S 2)3 each site from them ha.e:

'" Costumer Edge router (CE)" %" T o customer routers" :" To ma!e a communication bet een each compan- site t o 2)3Cs ere made

one for each compan- named ,ed 2)3 and Eello 2)3 as sho n in +igure ;";"

;igure D.D5/8E

;"%":": (nitial configurations:

The )rocess of the initial configuration for M)0S 2)3 compounded from three main steps: '" M)0S routers configuration" %" 2irtual pri.ate net or!s" :" 0abel s itching paths 0S)s"

5P(S routers configuration:

Each router ha.e to be able to enable M)0S on it as sho n in +igure ;";"And the pro.iders edge ()E) routers must be configured ith e/terior gate a- routing ith other pro.ider ()) protocols (B7)) bet een all )Es* i"e" all )Es are B7) neighbors as sho n in +igure ;"< *and (7) ($S)+ or (S1(S) for communicate router" )ro.ider routers need to be configured routers: ith the same (7) used for )Es

+igure ;"; M)0S routers enable

+igure ;"< B7) neighbors

;P# configuration:

2)3s in both scenario ha.e the same configurations settings as mention before the first scenario ha.e #ust one 2)3 named red 2)3 and the second scenario ha.e t o 2)3Cs named red 2)3 and -ello 2)3" +igure ;"= sho s the initial configuration for them:

+igure ;"= 2)3s configurations

0S) configuration: 0S)s ha.e been configured bet een each )E in the t o net or!s as sho n in +igure ;"@"+or e/ample in the medium net or! the label s itch path Site'D)E1to1Site%D)E" as set as

1%/

+igure ;"@ 0S) bet een )E routers

-%$%&%- #et4or, Traffic:

Traffic that used for purpose of the testing the effect of the (7) on the beha.ior of M)0s 2)3 specifications: () traffic flo represented as <&*&&&*&&& bitsKsecond '&& pac!etsKsecond And the t-pe of ser.ice (ToS) of it this traffic started simulation +igure ;">" as interacti.e multimedia" 7eneration of as same traffic for both scenarios and it had the follo ing

ith simulation start time and continued till the end of

+igure ;"> () traffic configurations

-%$%&%/ Test Parameters:

To get a fair #udgment for hich is the best (7) protocol to be used in M)0S

2)3 net or!s* and for better understand of the effect of the (7) in M)0S 2)3 net or!s man- factor ha.e been e/amined and these factors can be classified as: '" )arameters related to the protocol itself: con.ergence time" )arameters related to the 2)3: dela-* load and throughput"

Protocol parameter: Convergence time: (n d-namic routing* routing tables are created d-namicall- b- obtaining the net or! information from other routers" ,outers in the net or! must be constantlupdated to changes in the net or! topolog-" ,outes ma- be added or remo.ed* or routes ma- fail due to a brea! in the ph-sical lin!"6hen a ne lin! is added or a lin! fails or changes* updates are sent b- routers across the net or! that describe changes in the net or! topolog-" $ther routers in the net or! then runs a routing algorithm to recalculate routes and build ne .ie routing tables based on the update means all the information" After recalculation* all the routing tables ha.e arri.ed at a common of the net or! topolog-" A con.erged net or! topolog- .ie

routers agree on hich lin!s are up* hich lin!s are do n* hich lin!s are running fastest etc" 'on(ergence time is the time* G%'H ;P# parameters: To stud- the effect of the (7)s in the M)0S 2)3 some parameters related to the 2)3 ha.e to be considered: '% nd to nd delay: This parameters as used to get the time elapsed bet een traffic entering the hich a group of routers reach the state of con.ergence" $ptimall- the routing protocols must ha.e fast con.ergence time"

U)ro.iderBs 3et or!U through (ngress )E and traffic lea.ing the U)ro.iderBs 3et or!U through Egress )E" The end to end dela- measurement usuall- is a hard operation according to it is relationship formula: dend:end> #@ dtransAdpropAdprocBNNNNN(;"')
here: dend1endV end1to1end deladtransV transmission deladpropV propagation deladprocV processing dela3V number of lin!s (3umber of routers X ')

ith man- other factors " 7enerall- the

total end to end dela- is sum of man- t-pes of dela- as describes b- the follo ing

3ote: queuing dela-s are neglected"

(nternet Engineering Tas! +orce ((ET+) has set a standard for measure the one a- and t o 1 a- dela- in M)0S net or! ((ET+ =:@;) hich describes as follo ing: The- specifies a closel- related protocol for pac!et dela- measurement (DM)"This protocol ha.e the follo ing characteristics and capabilities: The DM protocol is intended to be simple and to support efficient hard are processing" The DM protocol operate o.er the M)0S 7eneric Associated Channel (71Ache) G,+C<<>=H and support measurement of loss* dela-* and related metrics o.er 0abel S itched )aths (0S)s)* pseudo ires* and M)0S sections (lin!s)" The DM protocol is applicable to the 0S)s* pseudo ires* and sections of

net or!s based on the M)0S Transport )rofile (M)0S1T))* because the M)0S1T) is based on a standard M)0S data plane" The M)0S1T) is defined and described in G,+C<?%'H* and M)0S1T) 0S)s* pseudo ires* and sections are discussed in detail in G,+C<?=&H"G<H

8elay 5easurement: Suppose a bidirectional channel e/ists bet een the nodes A and B" A measurement is accomplished b- sending a Dela- Measurement (DM) quermessage o.er the channel to B that contains the follo ing timestamp:

T': the time the DM quer- message is transmitted from A" T$: the time the DM quer- message is recei.ed at B" T&: the time the DM response message is transmitted from B" T-: the time the DM response message is recei.ed bac! at A" At this point* A can compute the t o1 a- channel dela- associated channel as: T4o:4ay channel delay > 6T- : T'7 : 6T& : T$7 !ound:trip delay > T- C T'
(;"%) (;":)

ith the

(f the cloc!s of A and B are !no n at A to be s-nchroni4ed* then both one1 adela- .alues* as ell as the t o1 a- channel dela-* can be computed at A as: *or4ard one:4ay delay > T$ : T' !everse one:4ay delay > T- : T& t o1 a- channel dela- V for ard dela- X re.erse dela-"G%%H 8elay 5easurement 5essage *ormat: The format of a Dela- Measurement message* Channel Aeader (ACA)* is as sho n in *igure -%D: hich follo s the Associated

The meanings of the fields are summari4ed in the follo ing table:
Table ;"': Dela- Message *ield 2ersion +lags Control codes Message 0ength JT+ ,T+ ,)T+ ,eser.ed Session (dentifier Differentiated Ser.ices(DS) +ield Timestamp '1; T02 Bloc! +ields 5eaning )rotocol .ersion Message control flags Code identif-ing the quer- or response t-pe Total length of this message in b-tes Juerier timestamp format ,esponder timestamp format ,esponderCs preferred timestamp format ,eser.ed for future specification Set arbitraril- b- the querier

+igure ;"? Dela- measurement message format

Differentiated Ser.ices Code )oint (DSC)) being measured =;1bit timestamp .alues $ptional bloc! of T-pe10ength12alue fields

7enerall- the (T8 recommended .alues listed in table ;"% To met the JoS requirement for the M)0S net or!sG%:H:
Table ;"% (T81T ,ec" 7"'&'& )erformance Targets for Sensiti.e Applications Application (atency Eitter (oss Y:Z Y'Z &Z &Z &Z

Con.ersational .oice Y'<& ms preferred* Y;&& ms limit Y' ms 2ideophone CommandKcontrol (nteracti.e games Telnet Y'<& ms preferred*Y;&& ms limit Y%<& ms Y%&& ms Y%&& ms

$% ;P# (oad: Second parameter related to the 2)3 as the load of the 2)3 hich represented

as the amount of 2)31traffic entering the U)ro.iderBs 3et or!U through (ngress )E this statistic is measured in bits per second"

:" ;P# Throughput: Third parameter related to the 2)3 as the throughput hich is t!e "u' er o$ its per seco"d success$ully deli&ered $ro' source to desti"atio" $or a" i"di&idual data $low" G%;H"(n case of the M)0S 2)3 the throughput can be defined as is the amount of 2)31traffic lea.ing the U)ro.iderBs 3et or!U through Egress )E" This statistic is measured in bits per second" The effecti.e throughput can be calculated from the follo ing formula:

(;"<)

6here
ETV Effecti.e Throughput (bitsKsec) B V Band idth (slo est lin!) (bitsKsec) 6 V TC) 6indo si4e (b-tes) D V ,ound trip dela- (,TT) (sec) 0 V )ac!et loss ([&) (fraction) MSS V Ma/imum Segment Si4e (';=& b-tes)

-%$%- Simulation !esults Analyses:

After ten hour of running $)3ET Modeler ';"< simulator in each scenario follo ing results ere collected:

-%$%-%' 5edium Service Provider 5P(S ;P# #et4or, !esults: +irst this scenario ha.e been simulated b- using $S)+ as interior gate a- routing protocol starting ith the 2)3 performance parameters this results ere found: nd to nd delay: 2alues of the end to end dela- for the Red_VPN and table ;":: ere as sho n in +igure ;"'&

5a0 ;alue &"&:>:<@ sec

5inimum ;alue &"&'<><? sec

Sample 5ean &"&%%:? sec

Standard 8eviation &"&&:=%= sec

+igure ;"'& end to end dela- in medium $S)+ net or!

Table ;": 2alues of end to end dela- in medium $S)+

+igure ;"'& sho s the end to end dela- graph in the medium M)0S 2)3 net or! hen $S)+ as (7) the range of that dela- is bet een &"&'<><? sec to &"&:>:<@ sec as table ;": sho s" (oad and throughput:

2alue of the load and throughput for the medium ser.ice pro.ider M)0S 2)3 ith $S)+ are sho s in +igures ;"''*;"'% respecti.el- and the statistic estimated form the figures are in the table ;";:

+igure ;"'' medium M)0S 2)3 ith $S)+ load

+igure ;"'% medium M)0S 2)3 ith $S)+ throughput

Table ;"; load F throughput for M)0S 2)3 ith $S)+ 5a0imum 5inimum ;alue bit?sec ;alue bit?sec (oad <'*'>;*;@&"?& %=*@&=*@:?"> Throughput <'":>;"&?% %=*=>@*>:&";; Sample 5ean
bit?sec

;?*=?;*;:% ;?*>:=*&>?

Standard daviation %*::?*?@%"%> %*:=:*?<&">

As sho ed in the graphs and the table ;"; the 2)3 load and throughput .alues changes during the simulation period and the sample mean .alue of it ;?*=?;*;:% bitKsec and ;?*>:=*&>?bitKsec" As mentioned before a parameter related to the (7) simulation process the con.ergence duration for the $S)+ result is sho n in +igure ;"':: as considered in the as e/amined and the the sample mean .alue of the throughput as as

+igure ;"': con.ergence duration for $S)+

As sho n in the figure ;"': the the time elapsed to e.er- router to get the con.ergence state: $3%&F seconds

%" Medium Ser.ice )ro.ider 3et or! using (S1(S as (7): 2)3 )erformance Measurements: nd to nd delay: ere as sho n in +igure ;"'; and

2alues of the end to end dela- for the Red_VPN table ;"<:

+igure ;"'; end to end dela- in medium (S1(S net or! Table ;"< 2alues of end to end dela- in medium (S1(S net or! 5a0 ;alue &"&:;&@> 5inimum ;alue &"&'<@'< Sample 5ean &"&%%<% sec Standard 8eviation &"&&:@

+igure ;"'; sho s the end to end dela- graph in the medium M)0S 2)3 net or! hen (S1(S as (7) the range of that dela- is bet een &"&'<@'< sec to &"&:;&@> sec as table ;"< sho s"

(oad and throughput:

2alue of the load and throughput for the medium ser.ice pro.ider M)0S 2)3 ith (S1(S are sho s in +igures ;"'<*;"'= respecti.el- and the statistic estimated form the figures are in the table ;"=:

+igure ;"'< medium M)0S 2)3 ith (S1(S load

+igure ;"'= medium M)0S 2)3 ith (S1(S throughput

Table ;"= load F throughput for M)0S 2)3 ith (S1(S 5a0imum ;alue bit?sec (oad Throughput <&*>='*?<:">? <&*>?;*&?@">' ' 5inimum ;alue bit?sec %=*:=%*=?%*@ %=*<:&*':; Sample 5ean
bit?sec

Standard daviation %*:>%*><<";= %*:=>*:>&"<'

;?*@<@*>%'"=> ;?*@:<*<:'

As sho ed in the graphs and the table ;"= the 2)3 load and throughput .alues changes during the simulation period and the sample mean .alue of load ;?*@<@*>%'"=> bitKsec and ;?*@:<*<:'" As mentioned before a parameter related to the (7) simulation process the con.ergence duration for the (S1(S result is sho n in +igure ;"'@: as considered in the as e/amined and the the sample mean .alue of the throughput as as

+igure ;"'@ con.ergence duration for (S1(S

As sho n in the figure ;"'@ the the time elapsed to e.er- router to get the con.ergence state: G%- second

-%$%-%$ (arge Service Provider 5P(S ;P# #et4or, !esults: As mentioned before in this scenario there is t o 2)3s 1Red_VPN 2 YellowVPN3 each 2)3 results sho n separatel- then a comparison bet een them is made"

'" +irst this scenario ha.e been simulated b- using $S)+ as interior gate arouting protocol starting found: ith the 2)3 performance parameters this results ere

nd to nd delay: ere as sho n in +igure ;"'>

2alues of the end to end dela- for the Red_VPN and table ;"@:

+igure ;"'> end to end dela- in 0ege $S)+ net or! (,edD2)3)

2alues of the end to end dela- for the Yellow_VPN table ;"@:

ere as sho n in +igure ;"'?

+igure ;"'? end to end dela- in 0arge $S)+ net or! (Eello D2)3)

To ma!e a good understand of the $S)+ performance according to the t o 2)3s a simple comparison graph is sho n in +igure ;"%&:

+igure ;"%& 2)3s dela- comparison Table ;"@ Comparison bet een Red_VPN F Yellow_VPN according to the dela2)3 ,edD2)3 Eello D2)3 Minimum 2alue &"&:'?>;: &"&:<%%>? Ma/imum 2alue &"&=?:>?< &"'&'@=:' Sample Mean &"&;@;:'< &"&;>'<<; Standard De.iation &"&&@=%== &"&&?%%>>

+igures ;"'? and ;"%& sho s the end to end dela- graphs in the large M)0S 2)3 net or! hen $S)+ used as (7) the range of that dela- for the ,edD2)3 is bet een &"&:'?>;: sec to &"&=?:>?< sec and that dela- as for the Eello D2)3 bet een &"&:<%%>? to &"'&'@=:'"A brief comparison ere sho n in Table ;"@"

 ;P#s (oad: 2alues of the load for the Red_VPN

ere as sho n in +igure ;"%' and table ;">:

+igure ;"%' 0oad in 0arge $S)+ net or! (,edD2)3)

2alues of the l for the load Yellow_VPN ;">:

ere as sho n in +igure ;"%% table

+igure ;"%: 0oad in 0arge $S)+ net or! (Eello D2)3)

To ma!e a good understand of the $S)+ performance according to the t o 2)3s a simple comparison graph is sho n in +igure ;"%::

+igure ;"%: 2)3s load comparison Table ;"> Comparison bet een Red_VPN F Yellow_VPN according to the load 2)3 ,edD2)3 Eello D2)3 Minimum 2alue bitsKsec %@*?%=*@?;"'& %=*=>;*=>>"&< Ma/imum 2alue bitsKsec <'*&%=*%>&"'; <'*&:@*<?@">: Sample Mean bitsKsec ;?*=<=*<<;";< ;?*@@&*&<;">' Standard De.iation %*%%'*==&"<& %*:<?*:<:":&

+igures ;"%' and ;"%% sho s the load graphs in the large M)0S 2)3 net or! hen $S)+ used as (7) "The range of the load for the ,edD2)3 as bet een %@*?%=*@?;"'& bitsKsec to <'*&%=*%>&"'; bitsKsec and the load for the Eello D2)3

ranged bet een %=*=>;*=>>"&< bitsKsec to <'*&:@*<?@">: bitsKsec* a brief comparison ere sho n in Table ;">"

;P#s Throughput: 2alues of the throughput for the Red_VPN table ;"?:

ere as sho n in +igure ;"%; and

+igure ;"%; Throughput in 0arge $S)+ net or! (,edD2)3)

2alues of the throughput for the Yellow_VPN ;"?:

ere as sho n in +igure ;"%< table

+igure ;"%< Throughput in 0arge $S)+ net or! (Eello D2)3)

To ma!e a good understand of the $S)+ performance according to the t o 2)3s a simple comparison for the throughput is sho n in +igure ;"%=:

+igure ;"%= 2)3s Throuput comparison Table ;"? Comparison bet een Red_VPN F Yellow_VPN according to the throughput 2)3 ,edD2)3 Eello D2)3 Minimum 2alue bitsKsec %@*==>*'>'"<& %=*<<?*:<'"%;? Ma/imum 2alue bitsKsec <&*?%:*:;<"?: <'*%>'*:%'"=; Sample Mean bitsKsec ;?*>%&*@;:"&= ;?*@?<*>&="=< Standard De.iation %*%<=*'<?";; %*:>&*<>="'>

+igures ;"%; and ;"%< sho s the throughput graphs in the large M)0S 2)3 net or! hen $S)+ used as (7) "The range of the throughput for the ,edD2)3 as bet een %@*==>*'>'"<&bitsKsec to <&*?%:*:;<"?:bitsKsec and the throughput for the Eello D2)3 ranged bet een %=*<<?*:<'"%;? bitsKsec to <'*%>'*:%'"=; bitsKsec* a brief comparison ere sho n in Table ;"?"

 Convergence duration: +igure ;"%@ sho state: a graph tha represent the time needed to get the con.ergence

+igure ;"%@ con.ergence duration of $S)+

As sho n in the graph the con.ergence duration for the $S)+ routing protocols in this scenario as: &'%G$1 seconds" $% (arge provider 5P(S ;P# net4or, using )S:)S as )GP: nd to nd delay: ere as sho n in +igure ;"%>

2alues of the end to end dela- for the Red_VPN and table ;"'&:

+igure ;"%> End to end dela- in 0arge (S1(S net or! (,edD2)3)

2alues of the end to end dela- for the Yellow_VPN ;"%? table ;"'&:

ere as sho n in +igure

+igure ;"%? end to end dela- in 0arge (S1(S net or! (Eello D2)3)

+igure ;":& pro.ide a small comparison bet een end to end dela-s according to using of (S1(S as (7) that can be helpful in the anal-sis of the M)0S 2)3 beha.ior:

+igure ;":& 2)3s dela- comparison Table ;"'& Comparison bet een Red_VPN F Yellow_VPN according to the dela2)3 ,edD2)3 Eello D2)3 Minimum 2alue seconds &"&:%=>= &"&:;><& Ma/imum 2alue seconds &"&@@'<: &"&=<=>% Sample Mean seconds &"&;@&?; &"&;=@'; Standard De.iation &"&&>%;> &"&&=;<<

+igures ;"%> and ;"%? sho s the end to end dela- graphs in the large M)0S 2)3 net or! hen (S1(S used as (7) the range of that dela- for the ,edD2)3 is as for the Eello D2)3 ere sho n in Table bet een &"&:%=>= sec to &"&@@'<: sec and that dela'&" ;P#s (oad: 2alues of the load for the Red_VPN

bet een &"&:;><& sec to &"&=<=>% sec" A brief comparison

ere as sho n in +igure ;":' and table ;"'':

+igure ;"%' 0oad in 0arge (S1(S net or! (,edD2)3)

2alues of the l for the load Yellow_VPN ;"'':

ere as sho n in +igure ;":% table

+igure ;"%: 0oad in 0arge $S)+ net or! (Eello D2)3)

To ma!e a good understand of the (S1(S performance according to the t o 2)3s a simple comparison graph for the load is sho n in +igure ;":::

+igure ;":: 2)3s load comparison Table ;"'' Comparison bet een Red_VPN F Yellow_VPN according to the load 2)3 ,edD2)3 Eello D2)3 Minimum 2alue bitsKsec %@*=&@*?%;"&% %@*&>>*%?:"<: Ma/imum 2alue bitsKsec <'*'<&*<:="@: <&*>'&*&%;">& Sample Mean bitsKsec ;?*>%?*&@="=< ;?*@?<*=<:">> Standard De.iation %*%@&*'?="=% %*:'&*?>%"<=

+igures ;":' and ;":% sho s the load graphs in the large M)0S 2)3 net or! hen (S1(S used as (7) "The range of the load for the ,edD2)3 as bet een %@*=&@*?%;"&%bitsKsec to <'*'<&*<:="@:bitsKsec and the load for the Eello D2)3 ranged bet een %@*&>>*%?:"<:bitsKsec to %*:'&*?>%"<= bitsKsec* a brief comparison ere sho n in Table ;"?" ;P#s Throughput: 2alues of the throughput for the Red_VPN table ;"'':

ere as sho n in +igure ;":; and

+igure ;":; Throughput in 0arge (S1(S net or! (,edD2)3)

2alues of the throughput for the Yellow_VPN table ;"'':

ere as sho n in +igure ;":< and

+igure ;":< Throughput in 0arge (S1(S net or! (Eello D2)3)

+igure ;":= sho a comparison graph hich represent the .ariant of the throughput for both 2)3s during the simulation time:

+igure ;":= 2)3s Throughput comparison Table ;"'% Comparison bet een Red_VPN F Yellow_VPN according to the throughput ((S1(S) 2)3 ,edD2)3 Eello D2)3 Minimum 2alue bitsKsec %@*=@&*:?>":% %@*':'*;>'":= Ma/imum 2alue bitsKsec <'*&'=*=:?":: <&*?@'*>&="?> Sample Mean bitsKsec ;?*@>?*?;=">: ;?*>&&*>=@">' Standard De.iation %*%==*:?:";& %*:':*:;'":<

+igures ;":; and ;":< sho s the throughput graphs in the large M)0S 2)3 net or! hen (S1(S used as (7) "The sample mean .alue of the throughput for as ;?*@>?*?;=">: bitsKsec and it as ;?*>&&*>=@">' bitsKsec for the the ,edD2)3

Eello D2)3* a brief comparison ere sho n in Table ;"''"

Convergence duration: +igure ;":@ sho duration: a graph that represent the (S1(S routing protocols con.ergence

+igure %":@ con.ergence duration of (S1(S

As sho n in the graph the con.ergence duration for the $S)+ routing protocols in this scenario as: /%- seconds%

-%&!esults 8iscussion:
The main goal of this thesis or! is to ma!e a right decision hen choosing the interior gate a- protocols for M)0S 2)3 bac!bone net or!s to reach that point man- e.idences can be ta!en from collected results that presented in this chapter pre.iousl-" (n this section some comparison bet een these results sho n according to both protocol under deferent test parameters:

nd to nd 8elay:

'" End to End dela- comparison bet een $S)+ and (S1(S for the medium ser.ice pro.ider M)0S 2)3 net or!:

Table ;"': dela- $S)+ .s (S1(S in medium S)

Protocol $S)+ (S1(S

Sample 5ean 6seconds7 &"&%%:> &"&%%<%

%" End to End dela- comparison bet een $S)+ and (S1(S for the large ser.ice pro.ider M)0S 2)3 net or!:

Table ;"'; dela- $S)+ .s (S1(S in large S)

Protocol $S)+ (S1(S

Sample 5ean 6seconds7 &"&;@;:' &"&;@&?;

Tables ;"'% and Tables ;"': sho s that

hen the case is medium si4e net or! ith M)0S enabled (0arge S)

hich fe er number of routers used in the (S1(S routing protocol ha.e more delatime than the $S)+ but in case of more routers net or!) the (S1(S ha.e fe er dela- time than the $S)+ routing protocol"

;P# (oad: '" 2)3 load comparison bet een $S)+ and (S1(S for the medium ser.ice pro.ider M)0S 2)3 net or!:

Table ;"'< 0oad $S)+ .s (S1(S in medium S)

Protocol $S)+ (S1(S

Sample 5ean 6bits?sec7 ;?*=?;*;:%"%? ;?*@<@*>%'"=>

%" 2)3 load comparison bet een $S)+ and (S1(S for the large ser.ice pro.ider M)0S 2)3 net or!:

Table ;"'= 0oad $S)+ .s (S1(S in large S)

Protocol $S)+ (S1(S

Sample 5ean 6seconds7 ;?*=<=*<<;";< ;?*>%?*&@="=<

As sho n from tables ;"';* ;"'< (S1(S is more sensiti.e in load traffic recei.ed in the 2)3 increased" than $S)+ speciallhen the number of routers ser.ed b- it is

;P# Throughput: '" 2)3 throughput comparison bet een $S)+ and (S1(S for the medium ser.ice pro.ider M)0S 2)3 net or!:

Table ;"'@ Throughput $S)+ .s (S1(S in medium S)

Protocol $S)+ (S1(S

Sample 5ean 6bits?sec7 ;?*>:=*&>?"=' ;?*@:<*<:'"%;

%" 2)3 throughput comparison bet een $S)+ and (S1(S for the large ser.ice pro.ider M)0S 2)3 net or!:

Table ;"'> Throughput $S)+ .s (S1(S in large S)

Protocol $S)+ (S1(S

Sample 5ean 6seconds7 ;?*@>?*?;=">: ;?*>%&*@;:"&=

Convergence 8uration: '" +or the Medium ser.ice pro.ider net or! the follo ing comparison as made:
Table ;"'? con.ergence in medium net or!

)rotocol $S)+ (S1(S

Con.ergence Duration $3%&F seconds G%- seconds

'" +or the 0arge ser.ice pro.ider net or! the follo ing comparison as made:
Table ;"%& con.ergence in large net or!

)rotocol $S)+ (S1(S

Con.ergence Duration &'%G$ seconds /%- seconds

The con.ergence duration result sho s that the (S1(S ha.e much better results than $S)+ because the all routers reached the con.ergence statue and much fe er time than in the $S)+" Main reason for that is the (S1(S uses #ust one 0in! State )ac!et (0S)) per le.el for e/changing the routing information" This 0S) contains man- T02s* each of hich represents a piece of routing information" $S)+ on the other hand* needs to originate multiple 0SAs* one for each t-pe and thus is a lot more chatt- and thus not suitable for large flat net or!s"

CHAPT ! *);

RTNLRYSITN \ ]YWYRE UTRS

/% Conclusion:
This thesis can be an initial foot step in the .er- long road to ards the interesting ser.ice pro.iders net or!s management orld" This or! started ith a literature re.ie in the M)0S* 2)3 and M)0S 2)3 or!

technolog- to get a better understating for the concepts related to the this discussion in deferent routing concept

area" To stud- the effect of interior gate a-s routing protocols a detailed ere introduced in chapter three then the ere presented" specifications of the t o routing protocols chosen in this thesis

Based on the simulation results it can be concluded that M)0S 2)3 pro.ides best solution in implementing the ser.ice pro.iders net or!s compared to traditional () net or!s and ith respect to the t o stud- cases the follo ing results ere found: ,esults from t o scenarios respect to the protocols ($S)+*(S1(S) sho s that both protocols acts ill in the (T8 recommendation for JoS requirements"(n large ith respect to the dela-* because (S1 as noticed clearlnet or!s (S1(S get better results than $S)+

(S pac!ets are directl- encapsulated in lin! la-er frames 6hile $S)+ pac!ets are encapsulated in () datagrams" +rom the simulation results that the (S1(S ha.e much faster con.ergence time than $S)+" Both protocols support multiple instances* traffic engineering and multi1 topolog-"(S1(S pro.ide the abilit- to design large net or!s b- building a single large 0e.el ' (0') area ithout an- hierarchies in (S1(S * something that difficult ould be ith $S)+" Also (S1(S is supports USingle Topolog-U mode for ().=

routing" This means that ().; and ().= net or! uses the same S)+ calculation"

This reduces the comple/it- and resources needed to run both protocols" 6ith $S)+ to support ().; and ().= both $S)+.% and $S)+.: ha.e to be configured separatel-"

Although the $S)+ routing protocol or!s ell in M)0S 2)3 and it is results ere .er- acceptable but still (S1(S ha.e ad.antages that ma!e ser.ice pro.iders engineers prefer it rather than $)S+"

/%$ *uture 2or,s:

To get the ma/imum benefit from the gorgeous M)0S 2)3 technolog- and to reach the optimum design to met the costumer JoS requirement lots of to be done and man- testing circumstances ha.e to be anal-4ed #ust li!e: (mplement t o scenarios introduced in this thesis b- using (p.=" Stud- the effect of the (7)s in real ser.ice pro.iders net or!s" Stud- the interaction bet een (7) and B7) ser.ices" ith respect to .ideo and .oice or! ha.e

RE]ERENRES

,eferences:
G'H M" El Aachimi* M" Breton* and M" Bennani* LEfficient JoS (mplementation for M)0S 2)3*M in *d&a"ced I"$or'atio" Networ)i"# a"d *pplicatio"s .or)s!ops, *IN*.,44"d I"ter"atio"al (o"$ere"ce o"* %&&> G%H Mohammad QunaidArshad * Tauqir Ahmad* Am#ad+arooq UData 3et or!sC Design and $ptimi4ation through M)0S 2)3s using B7)U*Qournal of American Science*%&'&" G:H Shahid Ali* Bilal Rahid ,ana L$)3ET Anal-sis of 2o() o.er M)0S 2)3 ith () JoSM* Ble!inge (nstitute of Technolog-*Se den*%&'' G;H Da.id Bauer-* Murat Eu!sel4* Christopher Carothers-and* Shi.!umar 5al-anaraman4U A Case Stud- in 8nderstanding $S)+ and B7) (nteractions 8sing Efficient E/periment DesignU* (EEE computer societ-*%&&= G<H (brahim S" (" Alsu!a-ti*Timoth- Q" Dennis* U)erformance Anal-sis of 2o() o.er B7)KM)0S 2)3Technolog-U* )73et conference*%&''" G=HTrillium*M Multiprotocol 0abel S itching( M)0S)M*The (nternation Engineering ConsertiumM"%&&' G@H (" )epeln#a!* Q" 7uichard* and Q" Apcar* MPLS a"d VPN *rc!itectures* CC(E edition* 8S Cisco )ress* %&&:" G>H 2i.e!Al in*U Ad.anced M)0S Design and (mplementationU* cisco press*%&&% G?H Monique Qeanne Morro * Christophe Masiero*U M)0S and 3e/t17eneration 3et or!sU *cisco press %&&="

G'&H (" )epeln#a!* Q" 7uichard* and Q" Apcar* MPLS a"d VPN *rc!itectures * % .ols" 8SACisco )ress* %&&:"

G''H Thomas M" Thomas ((* $S)+ 3et or! Design Solutions* Second Edition* Cisco )ress*%&&: G'%HE" Br-an Carne*A )rofessionalCs 7uide to Data Communication in a TC)K() 6orld* A,TECA A$8SE*%&&; G':HQeff Do-le* $S)+ and (S1(S: Choosing an (7) for 0arge1Scale 3et or!s* Addison 6esle- )rofessional*%&&< G';HDeepan!ar Medhi* 5arthi!e-an ,amasam-* 3et or! ,outing Algorithms* )rotocols* and Architectures* Else.ier*%&&@ G'<H Adolfo ,odrigue4* Qohn 7atrell* Qohn 5aras * ,oland )esch!e *MTC)K() Tutorial and Technical $.er.ie M* )rentice AallS @ edition *%&&' G'=HAannes 7redler and 6alter 7orals!i* The Complete (S1(S ,outing )rotocol* Springer*%&&< G'@ H (T81T ,ec" 7"'&'& G'>H $)3ET Technologies* (nc"* L$)3ET Modeler: 3et or! Simulation*M %&'&" G$nlineH"A.ailable: http:KK 6ads orth )ublishing* %&&:" G%&H0" D" 7hein* MPLS Fu"da'e"tals" 8SA: Cisco )ress* %&&= G%'H Ste.en Shepard*MM)0S 2)3s: +i.e Critical +actors for Medium1to10arge BusinessesM* Shepard Communications 7roup*%&&? G%%H6i!ipedia eb site*MCon.ergenceM* " i!ipedia"com" "opnet"com G'?H S" S" Care-* * 5e#i""er6s 7uide to Scie"ti$ic Met!od* :rd ed" 8SA:

G%:H D" +rost* S" Br-ant*M )ac!et 0oss and Dela- Measurement for M)0S 3et or!sM* (nternet Engineering Tas! +orce ((ET+)*%&'' G%;H Santiago Al .are4*M JoS for ()KM)0S 3et or!sM* Cisco )ress*%&&= G%<H )eter Se.ci! and ,ebecca 6et4el* (mpro.ing Effecti.e 6A3 Throughput for 0arge Data +lo s*3etfrocast*%&&> G%=H Andre S" Tanenbaum*M Computer 3et or!sM* +ourth Edition* )rentice Aall*%&&: G%@H Quniper 3et or!s*M $S)+ ,outing )rotocolsM*%&'' G%>H Cisco 0earining 3et or!*M(S1SM*Cisco"com*%&''

Appendi/:
Some parameters used in the $pnet simulation:
(n each design the same node lin! ere used using:
)))DS$3ETD$C: (';>"=' Mbps)

,outers hich used in the simulation ere ha.e the follo ing specifications: Ethernet%Dslip>Dlsr node model hich represents an ()1based gate a- running M)0S and supporting up to t o Ethernet interface and up to > serial line interface at a selectable data rate"() pac!ets arri.ing on an- interface are routed to the appropriate output interface based on their destination () address" Traffic engineering: bgp 2irtual )ri.ate 3et or!s: T o 2)3s ere used in the simulation: Eello D2)3: ,oute Distinguisher: '&&:' ,oute Target: '&&:' both ,edD2)3: ,d: '&&:% ,oute target: '&&:% both Traffic +lo : (pDtrafficDflo : T-pe of se.ice: ToS: interacti.e multimedia (<)

Trafic: <&&&&&&& bitsKsecond Traffic: '&& pac!etsKsecond Traffic Mi/: '"&Z E/plicit

0abel S itched )ath: Model: M)0SDE10S)DD-namic Announce (7) shortcuts: Enabled ,e.ert Timer: =& B7) parameters: Status: Enabled Start time: constant('=&) 3eighbor )roperties: '?%"&"%="' AS:' '?%"&"%;"' AS:' '?%"&"'"% AS:%

'?%"&"%&&"'' AS::