Resilience in Multilayer Networks

Size: px
Start display at page:

Download "Resilience in Multilayer Networks"

Transcription

1 Resiliene in Multilyer Networks Piet emeester n Mihel Gryseels, University of Gent-IM Ahim Autenrieth, Tehnil University of Munih rlo rinz, Itltel Lur stgn n Giulio Signorelli, SIRTI Roberto lemente n Muro Rver, SLT Anrzej Jjszzyk n riusz Jnukowiz, ITTI Kristof Vn oorselere, elgom Yohnosuke Hr, NTT ASTRAT T The integrtion of ifferent tehnologies suh s ATM, SH, n WM in multilyer trnsport networks rises mny questions regring the oorintion of the iniviul network lyers. speilly in the re of network survivbility, muh n be gine by better lignment of the heling tions tken by ifferent network lyers in se of outges. Survivbility issues enountere in multilyer environment inlue, mong others: how to ientify the originl filure use, how to ppoint for eh filure lyer responsible for its heling, how to let ifferent lyers interwork, n how to provie spre resoures in n effiient wy. he resiliene of teleommunition networks gets intense ttention of ll mjor plyers in the teleom worl. The option of wvelength-ivision multiplexing (WM), synhronous igitl hierrhy (SH), n synhronous trnsfer moe (ATM) tehnologies in trnsport networks hs resulte in n ever-inresing onentrtion of more trffi on fewer network elements. For instne, the filure of 40-wvelength WM system rrying 2.5 Gb/s SH signls n ffet up to 1,200,000 telephone lls. onsequently, outges use more burens thn ever before, prtiulrly to ustomers whose ommunitions re of vitl importne. Network survivbility, whih is the bility of network to reover trffi ffete by filures, hs gine ritil role in the esign of teleommunitions networks. A gret el of reserh hs been one on the esign of survivble network rhitetures n reovery shemes for the ifferent trnsport tehnologies (see [1, 2] for surveys). Sine the survivbility tehniques implemente toy minly ress iniviul tehnologies, the stuy of solutions onsiering n integrte system is prmount for further evelopment in this fiel. Some objetives for n integrte pproh to multilyer survivbility inlue: Avoiing ontention between the ifferent single-lyer reovery shemes Promoting oopertion n shring of spre pity Inresing the overll vilbility tht n be obtine for ertin investment buget eresing investment osts require to ensure ertin survivbility trget This rtile presents results from the uropen reserh projet PANL, 1 whih stuie the oorintion of reovery shemes present in ifferent lyers of trnsport network. Note tht this rtile oes not inlue the iruit-swithe lyers; see [3]. 1 Protetion Aross Network Lyers, Projets/PANL A FRAMWORK FOR MULTILAYR SURVIVAILITY STRATGIS Multilyer survivbility strts from the viewpoint tht multitehnology network onsists of stk of singlelyer networks. A lient/server funtionl reltionship hols between jent lyers of the multilyer stk. h lower network lyer provies trnsport funtionlity to higher lient lyers. In eh network lyer with the neessry flexibility for rerouting, single-lyer reovery sheme my be eploye. The presene of reovery mehnisms in multiple lyers of ATM-over-SH-over-WM networks hs severl rivers: Reovery shemes resiing in lower lyers (e.g., SH) often enble more effetive reovery from burensome filures like ble uts, while filures of higher-lyer equipment (e.g., n ATM swith) requires itionl resiliene in the higher lyer. The nee for ifferentition of servie relibility (e.g., ifferent gres for istint ustomers or prouts) my result in the instlltion of reovery shemes loser to the network lyer where trffi is tully injete in the network. The nturl evolution of teleommunitions networks my result in ing new survivble lyers to the existing ones (e.g., optil lyer survivbility). Pst reserh [1, 2, 4, 5] reognize the importne of proviing synergy between the heling tions of the ifferent network lyers. PANL worke out frmework for multilyer survivbility (Fig. 1), whih ompiles iretions tht n be tken by teleommunitions network proviers. The omponents of the frmework n be lssifie in options pertining to the single-lyer reovery systems n options pertining to multilyer intertions. The reovery options of iniviul tehnologies hve been stuie extensively in the sope of single-lyer survivbility [1, 2]. In the next setions we illustrte some of the multilyer options of our frmework in the ontext of ATM-over-SH trnsport networks. Nevertheless, mny of the esribe survivbility onepts re generi n pplible to other types of multilyer networks s well. MULTILAYR ROVRY APPROAHS To efine multilyer reovery pproh, the following question is rise: For eh filure, whih network lyers re responsible for its reovery? We will illustrte some /99/$ I I ommunitions Mgzine August 1999

2 pprohes with the exmple in Fig. 2 representing two-lyer network, where the SH lyer supports ntive SH pths (e.g., A--) n lient ATM lyer. For instne, ATM pth -b- (set up between ATM noes n ) utilizes ATM link pity supporte by SH pths A- n -. Reovery interworking strtegies Reovery t the Lowest Lyer A first reovery pproh, enote s reovery t the lowest lyer, is to reover the ffete servies in the lowest possible lyer. As suh, the survivbility is provie s lose s possible to the origin lyer of the filure. For exmple, ble ut A- (Fig. 2.) ffeting ATM pth - is resolve t the SH lyer. When ATM noe b fils, the ATM reovery sheme nees to be tivte to restore ffete trffi. euse of the orser swithing grnulrity of lower lyers, this reovery pproh is simpler in the number of ffete pths to reroute (ompre to reovery t the highest lyer, see below). ue to the oexistene of multiple shemes, some interworking funtionlity nees to be provie to orretly ssign n oorinte the reovery responsibilities of eh reovery sheme. The brek of ble A- will result in loss of the signl t SH noe, but t the sme time ATM noe will not reeive vli ATM ells nymore. After 4 ms, the ATM noe goes into n lrm stte ue to loss of ell elinetion. In the mentime, it my lso hve reeive lrms from the SH lyer, initing tht the fult use is in the SH lyer. Inee, in the event of n SH lyer filure, subsequent lrm messges will be psse through eh upper lyer fter they re generte [6]. However, it my hppen tht the lrm signl from the SH lyer oes not rrive fst enough (e.g., intermeite SH network elements ely the lrm signl propgtion, n the ATM lyer efet my be etete first). As result, Link <> pth-bse Multilyer reovery pproh Reovery t lowest lyer Reovery t highest lyer Reovery t multiple lyers entrlize <> istribute ontrol Single-lyer reovery options Preplnne <> ynmi route lultion Interworking strtegy Sequentil tivtion - bottom-up - top-own - ignosti Prllel tivtion Figure 1. The PANL frmework for multilyer survivbility. eite <> shre bkup filities ommon pool Protetion seletivity Tritionl pproh Multilyer spre pity esign the ATM lyer woul flsely onlue tht the filure hppene in its own lyer n my inorretly trigger the ATM lyer reovery mehnism. However, the network resoures re imensione to resolve SH lyer filures t the lowest lyer. This my rete sitution for ATM lyer resoure ompetition, leing to network ongestion n other unwnte behvior of the network. Reovery interworking is require to overome this problem. With reovery t the lowest lyer, every survivble lyer reserves some resoures for the rerouting of ffete pths. A single-lyer reovery mehnism nnot quire resoures in other lyers in rel time without brehing the inepenent opertion of ifferent lyers. This mens tht spre pity in one lyer nees to be supporte t ll times by lower lyers. In our exmple, ATM lyer pity provie by SH pths hs to be reserve to reroute virtul pths (VPs) roun filing ATM noe. In ition, some SH lyer pity hs to be reserve for SH lyer rerouting. The result is tht eh survivble lyer ereses the tul utiliztion of the pity, n the lowest lyer my thus be poorly use with this reovery pproh. This problem is further isusse lter. Restore ATM (protete in SH) SH onnetion SH bkup (protetion route) ATM bkup (protete in ATM) ATM lyer b ATM lyer b A A SH lyer SH lyer ) Reovery t the lowest lyer b) Reovery t the highest lyer Figure 2. Multilyer reovery pprohes. I ommunitions Mgzine August

3 Reovery t the Highest Lyer A seon multilyer reovery pproh, enote reovery t the highest lyer, onsists of reovering isrupte trffi in network lyer loser to the origin of the trffi. A higher-lyer reovery sheme n resolve filures hppening in lyers below. The exmple in Fig. 2b illustrtes tht n ffete SH pth rrying SH servies is reovere by SH network elements, while n ffete ATM pth (rrie over ifferent SH pths) is reovere in the ATM lyer. Proviing resiliene t the highest possible lyer hs the following vntges: A trnsport network often rries severl servie lsses with ifferent relibility requirements. It is generlly esier to provie multiple relibility gres when the survivbility shemes resie in higher lyers. Sine single reovery sheme suffies to protet the servie ginst filures ourring in every (lower) lyer, the implementtion omplexity of interworking between ifferent shemes n be voie. In this se, interworking merely involves tivting the responsible reovery sheme s fst s possible t the pproprite network lyer. On the other hn, the finer swithing grnulrity of the higher lyers omplites rerouting in the event of lower-lyer filures, beuse mny entities re then ffete t the sme time. For instne, 2.5 Gb/s SH ble brek my ffet mny thousns of VPs in the ATM lyer, eh of whih woul hve to be reroute iniviully in this pproh. This woul probbly slow own the reovery proess. Seon, when the server lyer pths supporting the higher network lyer re rther long, the reovery proess my involve reonfigurtion in network elements fr wy from the originl filure use. Most probbly, speil preutions will hve to be tken to pt the survivbility sheme of the higher lyer (to resolve the lower-lyer filure senrios). For exmple, with restortion t the ATM lyer it is envisge to ssemble VPs shring physil routes into VP groups s tehnique to reue the reovery efforts in se of physil filures. Reovery Interworking/sltion In multilyer networks, severl reovery shemes my be involve to resolve ertin filures. An interworking strtegy (lso lle esltion strtegy [5]) onsists of set of rules esribing when to strt n stop, n how to oorinte, the tivities of the ifferent reovery shemes. Two options were ientifie onerning the tivtion: strting two or more reovery shemes in prllel or strting them sequentilly. The prllel strtegy is fst n requires no ommunition or oorintion between shemes. The sequentil strtegy my result in longer overll reovery times thn prllel tivtion but is generlly esier to ontrol. A sequentil strtegy etermines the orer of tivtion of the shemes n oorintes the shemes, ensuring tht they re tivte t n pproprite moment. Two further questions nee to be nswere in se of sequentil interworking: t whih lyer to strt the reovery n when to eslte to the next lyer. The question of where to strt results in three pprohes: bottom-up, top-own, n in-between (ignosti). ottom-up interworking strts t the network lyer losest to the filure, ensuring very quik tivtion of the reovery mehnism. The upwr esltion tkes ple upon expirtion of holoff timer, reeption of reovery token [7, 8], or intervention of the mngement system. Top-own interworking lwys strts t the highest-lyer network n esltes ownwr. For exmple, fst protetion sheme in the highest lyer n be ombine with slower but more ost-effetive restortion sheme in lower lyer. The ltter sheme is use to restore the higher network lyer to its originl stte, enbling it to ope with ertin ouble filure senrios. The eision to strt t speifi lyer epens on ignosti interworking, mong others, on reeive lrms n gthere survivbility sttistis. A QUANTITATIV OMPARISON OF ROVRY APPROAHS In orer to ompre reovery pprohes in quntittive wy, the PANL projet rrie out reovery simultion n plnning se stuies on vriety of ATM-over-SH network n trffi moels. A omprison of multilyer reovery pprohes is epenent lso on the single-lyer reovery options. Sine our im is to illustrte the multilyer spet of the reovery pprohes, the following se stuies ssume similr mehnisms to be eploye in the iniviul lyers. We onentrte on pth protetion shemes (i.e., en-to-en reovery with eite bkup pths) in both lyers. Suh shemes re often use for the resiliene of premium-level trffi. The onsiere filure senrio inlue single ble uts, single SH noe filures, n single ATM noe filures. Reovery Performne omprison Figure 3 ompres the performne of reovery t the lowest lyer with holoff time interworking n the reovery t the highest lyer Men reovery rtio (%) Lowest lyer reovery 0.2 Highest lyer reovery Reovery time (s) ATM TOR SAV AL GN MIL2 SH only offie MIL PIS SH & ATM offie R PIA VI VR OL FIR ROM VN AN Figure 3. ) Performne omprison; b) 16-noe exmple network. 72 I ommunitions Mgzine August 1999

4 (1) (2) (3) (4) pproh for smple network with 16 SH noes, six ATM noes, n 36 links (Fig. 3b). The grphs show the verge reovery rtio of ATM lyer onnetions for ll omplete site filures (mesure t the ATM lyer). Suh performne vlues were obtine by simulting the reovery proeure for every site filure one fter the other using istribute, event-oriente multilyer simultion environment evelope within PANL [8]. The performne t of the simultion runs re ollete n the men reovery rtio is lulte from ll results. The most notieble hrteristi of the grphs is the twostep urve in reovery t the lowest lyer. The mjority of ffete s re reovere by the SH protetion, whih tkes up to 50 ms n rehes n verge reovery rtio of bout 78 perent for the given network. ATM pths trnsiting the file ATM n SH site must be reovere t the ATM lyer, sine the SH pth supporting them is terminte t the file noe. Suh multihop ATM pths re reovere by the ATM protetion sheme. This sheme is triggere fter expirtion of the holoff timer (100 ms). It nees 30 ms to setup the (preonfigure) trnsltion tble. Aitionlly, few milliseons signling time re neee for eh file pth ue to the proessing time of the reovery protool. With reovery t the lowest lyer, ll ATM servies were reovere fter pproximtely 250 ms. euse fst reovery of single SH onnetion reovers very lrge number of ATM pths jointly, the performne of the reovery t the lowest lyer interworking strtegy is generlly better thn tht of reovery t the highest lyer. Single ble uts, whih re the most probble filures in network, n be resolve ompletely in the SH lyer. The ATM lyer only protets multihop ATM pths ginst trnsit noe filures. In reovery t the highest lyer, ll ffete ATM pths re reovere in the ATM lyer. No holoff time is neee now, but the reovery is slower sine muh higher number of ATM pths hve to be reovere iniviully. The min influene on the ATM reovery rtio is not the number of noes, but the number of ffete ATM pths. In the exmple bove with low ATM emn, ll ffete servies were reovere fter 900 ms. uring simultions with more emns, this vlue inrese to 3.5 s. 2 More etils bout this plnning se stuy n be foun in [6]. ATM equipment ost ,553 SH equipment ost ,488 rrier ost ,031 ATM servie ost ,478 16,298 47,072 Tble 1. Investment osts for reovery t the highest lyer. (1) (2) (3) (4) ATM equipment ost SH equipment ost ,792 rrier ost ,301 ATM servie ost ,613 14,090 39,093 Tble 2. Investment osts for reovery t the lowest lyer. ost omprison 2 The reovery ost in the ifferent ses ws evlute by ssessing the mount of SH n ATM equipment n fiber systems require by eh reovery pproh. The mount of resoures ws etermine through network imensioning proess, using network plnning tools vilble within the onsortium [6]. The network ost origintes from ATM equipment (bkbone ATM X VP n its STM-1 interfe rs), SH equipment (X 4/4, STM-1 interfes, 2.5 Gb/s line systems), n rrier ost, whih inlues the ost of fiber n regenertors. Atul equipment osts obtine from survey of ifferent ATM n SH equipment mnuftures were use [6]. All osts in this rtile re expresse in normlize unit, orresponing to the ost of one eletril STM-1 port on n SH line system. In Tble 1 (n Tble 2), the investment osts relte to the ATM emns re liste for reovery t the highest lyer (n lowest lyer, respetively) for set of network n trffi senrios (1) (4). In ll ses, reovery t the highest lyer requires lrger investment buget (up to 20 perent more) thn reovery t the lowest lyer. There re severl explntions for this outome. First of ll, with reovery t the lowest lyer, only multihop VPs require itionl ATM lyer protetion (n subsequent ATM lyer spre pity). This results in lower ATM spre pity requirement. Seon, the pprohes iffer in the onstrints tht must be stisfie in fining working n bkup VP routes. With reovery t the highest lyer, the min n bkup routes of VP must be isjoint in both physil links n noes. With reovery t the lowest lyer, the only requirement is to hve no trnsit ATM noe in ommon. Hene, the reovery t the lowest lyer pproh les to looser VP routing onstrints n more room for optimiztion. Furthermore, the SH network lyer supports both working n spre ATM pity. With reovery t the highest lyer, no SH spre resoures hve to be provie for ATM emns, but the extr eployment of the ATM spre pity results in higher ouption of SH filities by the ATM lyer. In ft, the totl SH pity require for the ATM emns is bout the sme for both reovery pprohes. With reovery t the lowest lyer, prt of the spre pity for ATM servie resiliene is only put in the SH network lyer, n only hs n impt on the neee equipment (n instlltion osts) of one network lyer inste of two. onluing, it seems heper to resolve physil n SH filures using reovery t the SH lyer inste of eiting expensive ATM pity for this tsk. OMMON POOL SURVIVAILITY Sine trnsmission n swithing resoures re very expensive, optimiztion of spre resoures is very importnt for opertors (n iniretly for ustomers s well), beuse it results in ontinment of the osts n onsequently lso of the servie triffs. As expline before, multilyer survivbility implies proviing multiple spre pity pools, eh eite to prtiulr network lyer. Sine pity of eh survivble lyer is rrie by its server lyers, this results in reservtion of resoures in ll lyers below. With tritionl pity plnning, this results in poor utiliztion of the lowest lyer. Moreover, the server lyer potentilly lso protets the spre pity of the lient lyer, whih oes not lwys result in n equl inrese of servie vilbility. Suh reunnt protetion n be voie by supporting working n spre lient lyer pity through ifferent server pths, n treting them ifferently in the server lyer. For exmple, when protetion seletivity is vilble in the server lyer, pths rrying lient lyer spre pity n be left unprotete. Nevertheless, the server lyer then still eites some I ommunitions Mgzine August

5 A ATM lyer SH lyer b Figure 4. ommon pool survivbility n ATM filure senrio. ATM bkup (protete in ATM, extr trffi in SH) Working SH ring hnnel Protetion ring hnnel In summry, the spre pity require for ATM lyer resiliene is trete s unprotete preemptible trffi in the SH network lyer. As suh, the SH spre resoures re reuse for extr resiliene t the ATM lyer. A tritionl pproh eploys two spre pity pools, eh eite to speifi lyer (i.e., ATM or SH). The ifferene in relibility is tht with ommon pool it is no longer possible to provie resiliene ginst ommon filure of n ATM noe n ble ut. Sine suh filure senrios hppen rrely, the effet on servie vilbility is very smll. In ontrst, the svings in SH equipment hieve with ommon pool pproh n be quite substntil [10]. MULTIPART SURVIVAILITY IN SH-OVR-WM NTWORKS urrently, WM tehnology is minly use on point-topoint bsis to inrese the vilble trnsmission pity on existing fibers. The throughput growth possible with WM tehnology inreses the impt of filures, sine mny more onnetions fil simultneously. In the future, when optil AMs n ross-onnets beome vilble, there will be opportunities for full optil pths between offies fr from eh other. A ble ut then results in omplex filure senrio in the SH lyer. If reovery is left to SH, single ble ut my require mny swithing tions t ifferent lotions. Proviing survivbility t the WM lyers beomes inherently ttrtive s network throughput inreses [8, 11]. Optil reovery shemes reover multiple ffete SH links t one n entil less oorintion thn SH reovery. In the lst few yers, the reserh on WM reovery shemes hs therefore intensifie, n optil protetion swithing hs beome topi of interest in the stnriztion boies [9]. euse of the funtionl similrity of SH n WM networks, the survivble rhitetures in the WM lyer re likely to operte in similr wy to the stnrize SH rhitetures [9]. In relity, optil networking (n optil reovery shemes) will not be eploye t one in ll prts of the network. Suh WM islns my then be interonnete by pure SH trnsmission links (or links with point-to-point WM). The en-to-en survivbility of n SH onnetion thus nnot be ensure by WM protetion only. In ition, it is resoures to rrying the lient lyer spre pity. The utiliztion of the server lyer resoures n be further improve by shring spre pity ross network lyers s esribe in [10]. The bsi ie of ommon pool survivbility is to tret the spre pity of the lient lyer s extr trffi (i.e., rrie on unprotete preemptible pths) in the server lyer. The spre pity t the server lyer is plnne to protet the server lyer pths rrying the tul trffi. With ommon pool survivbility, the server lyer spre pity is reuse by higher-lyer reovery sheme. Little or no itionl server lyer resoures re thus require to support the lient spre pity, whih is now rrie in the reserve pity provisione for server lyer survivbility. The utiliztion of network resoures is better thn with ny other pproh. The onept of ommon pool survivbility is illustrte with simple network exmple shown in Figs. 4 n 5, onsiering network with meshe ATM lyer on top of SH biiretionl rings. Although the figure onsiers, for the ske of rebility, single SH ring, it hs lso been verifie for network onsisting of interonnete rings. In ft, it shoul be stresse tht the ommon pool survivbility onept is generi n n be pplie to other types of multilyer networks s well. A working ATM VP, -, route vi ATM noe b, is trnsporte vi the working SH pths A-- n -, s shown in Fig. 4. To protet this working VP ginst trnsit ATM noe brekowns, bkup ATM VP - route vi ATM noe is preestblishe. This bkup VP is trnsporte vi the SH pths A- n -. However, these SH pths re not route long working SH ring hnnels but s extr trffi long the protetion hnnels of the ring. If the ATM X b fils (Fig. 4), the working ATM VP - is reroute vi its pressigne bkup VP. This involves simple reservtion n reonfigurtion proess t the ATM network lyer only. After reovery ompletion, ATM VP - is trnsporte over SH pro- ATM lyer b tetion hnnels without requiring reonfigurtion of ny of the SH -rop multiplexers (AMs). On the other hn, when ble ut (Fig. 5) ours, the SH AMs ess the protetion hnnels to reroute the isrupte working SH pths. Hene, the SH pths supporting the ATM spre pity my be preempte in orer to free resoures for the ring protetion protool. This implies the temporl unvilbility of A some prt of the ATM spre pity until the filure is repire. There is no nee for tivtion of the ATM reovery, sine the SH pro- SH lyer tetion restores ll ffete VPs. Figure 5. ommon pool survivbility n SH filure senrio. ATM bkup route (unvilble) Working SH ring hnnel xtr trffi preempte 74 I ommunitions Mgzine August 1999

6 very iffiult to etet ertin filures (e.g., those using slow signl egrtion) t the WM lyer. Aitionl SH lyer survivbility will thus remin neessry in the network. se on the bove rtionle, severl protetion strtegies n be propose. The first option is to hve protete SH lyer over n unprotete WM lyer. For instne, in the urrent networks where WM is use for point-topoint systems in well-efine res, it is resonble to leve the protetion to SH, sine protetion mehnisms n mngement systems of the SH lyer re very mture. A seon option is to hve n unprotete SH over protete WM lyer. Whenever WM is not yet eploye in ll prts of the trnsmission network, this option uses WM protetion whenever possible n SH protetion in other prts of the network. As suh, this strtegy prtitions the network into ifferent survivble subnetworks, n filures re resolve within their subnetwork. Although suh prtitioning enbles survivl of filures hppening in ifferent subnetworks, it requires speil preutions t the gtewys, whih n be expensive to implement. Also, SH lyer filures within the WM islns re not overe. These ltter issues re not present with protete SH lyer supporte by protete WM lyer. However, if ombintion of the two protetion shemes is plnne without ny preutions, the spre pity of the SH lyer results in higher mount of wvelengths. Moreover, these wvelengths (prtly rrying spre SH pity) re protete in the WM lyer. This option my be too ostly sine WM lyer protetion of SH spre pity is not lwys useful. Reunnt protetion n be voie when working n spre SH pities re supporte by seprte wvelengths, using protetion seletivity t the WM lyer. Nevertheless, supporting SH spre pity by unprotete WM wvelengths still results in poorer utiliztion of the WM lyer thn in the other options. A ommon pool onfigurtion, where SH spre pity is supporte on preemptible wvelengths in the WM lyer, obtins optiml utiliztion. ONLUSIONS This rtile presents outomes of the PANL reserh projet, whih stuie survivbility in multilyer trnsport networks. The mjor hllenges for telo in multilyer environment re to etermine whih lyer(s) is responsible for eh filure (reovery pproh), to oorinte single-lyer reovery tions (esltion strtegy), n to pln multiple spre pity pools in n pproprite wy. In orer to provie overll servie resiliene in ost-effetive wy, servie proviers n etermine suitble strtegy bse on the PANL guielines (see box). PANL GUILINS Reovery t the highest lyer is the reommene pproh when: Multiple relibility gres nee to be provie with fine grnulrity Reovery interworking n not be implemente; (e.g., beuse of equipment limittions or when lient n server network lyer re owne by ifferent opertors) The survivbility shemes in the highest lyer re more mture thn in the lowest lyer Reovery t the lowest lyer is the reommene pproh when: The number of entities to reover hs to be limite/reue When the lowest lyer supports multiple lient lyers n it is pproprite to provie survivbility to ll servies in homogeneous wy The survivbility shemes in the lowest lyer re more mture thn in the highest lyer When it is iffiult to ensure the physil iversity of working n bkup pths in the higher lyers (e.g., when lient n server lyer re provie by ifferent opertors, the server network opertor my not wnt to iffuse informtion on his network topology) Reovery t the lowest lyer my require expliit oorintion between reovery shemes; the hol-off time bse interworking mehnism is the best ompromise between reovery performnes n implementtion omplexity. With reovery t the lowest lyer, multiple spre pity pools re present in the network for resiliene of higher lyer trffi. When higher lyer spre pity requirements re reltively lrge, the tul utiliztion of the lower lyers n beome poor. In tht se, using unprotete or preemptible server lyer pths (i.e., ommon pool) to rry the lient spre pity is reommene to llevite reunnt protetion n remin ost-effetive. In SH-over-WM networks, where WM reovery shemes re only vilble in prts of the network (evolutionry senrio): The isvntge of leving the protetion ompletely in the SH lyer is tht it is iffiult to exploit the full potentils of optil networking The isvntge of shifting the protetion ompletely to the WM lyer (without ny SH protetion in WM prts) is tht the SH pths re protete in segmente wy SH protetion over WM protetion offers the highest egree of relibility, but osteffetive implementtion my only be hieve if working n spre SH pity re trete ifferently in the WM lyer (protetion seletivity or better ommon pool). AKNOWLGMNT This work hs been supporte by the uropen ommission through the ATS projet A205/PANL n by the Flemish Government through IWT projet ITA/950214/INT. RFRNS [1] T.-H. Wu, merging Tehnologies for Fiber Network Survivbility, I ommun. Mg., vol. 33, no. 2, 1995, pp [2] ANSI T1, A Tehnil Report on Network Survivbility Performne, rep. no. 24, Ot [3] K. R. Krishnn, R.. overspike n.. Pk, Improve Survivbility with multi-lyer ynmi routing, I ommun. Mg., July 1995, pp [4]. Johnson, Survivbility Strtegies for robn Networks, Pro. I GLOOM 96, Lonon, U.K., [5] L. Neerlof et l., n-to-en Survivble robn Networks, I ommun. Mg., vol. 33, no. 9, 1995, pp [6] M. Gryseels et l., Optiml esign for Servie Resiliene in ATM on SH kbone Networks, Pro. I ATM 98 Wksp., Firfx, VA, My [7] J. Mnhester, Fult etetion n Propgtion in Trnsport Networks, Pro. 1st Int l. Wksp. esign of Relible ommun. Networks, rugge, elgium, [8] A. Autenrieth et l., Simultion n vlution of Multilyer robn Networks, Pro. 1st Int l. Wksp. esign of Relible ommun. Networks, rugge, elgium, [9] A. MGuire n P. onenfnt, Stnrs: The lueprints for Optil Networking, I ommun. Mg. vol. 36, 1998, pp [10] M. Gryseels et l., ommon Pool Survivbility for ATM over SH Ring Networks, Pro. 8th Int l. Symp. Network Plnning, Sorrento, Itly, Ot [11] O. Gerstel, Opportunities for Optil Protetion n Restortion, Pro. OF 98, Sn Jose, A, IOGRAPHIS PIT MSTR (piet.emeester@inte.rug..be) reeive his Ph egree from the University of Gent t the eprtment of Informtion Tehnology (INT) in He worke for the Interuniversity Miro letronis enter (IM) n beme professor t the University of Gent in 1993 where he is urrently tehing teleommunition networks n where he is responsible for the reserh on ommunition networks. He is senior member of I n he ws or is member of severl tehnil progrm ommittees. He I ommunitions Mgzine August

7 ws involve in bout 15 uropen SPRIT, RA n ATS projets. He ws o-eitor of the speil issue of the I ommunitions Mgzine: Optil Networks Reserh in urope, He ws hirmn of the First Interntionl Workshop on the esign of Relible ommunition Networks in 1998 (RN98) n he is member of the eitoril bor of the journls: OPTIAL NTWORKS MAGAZIN n JOURNAL PHOTONI NTWORK OMMUNIATIONS. He publishe over 300 publitions in the fiel of optoeletronis n brobn networks. His urrent interests re relte to brobn ommunition networks (IP, ATM, SH, WM, ess) n inlue network plnning, network n servie mngement, teleom softwre, internetworking, et. MIHAL GRYSLS (mihel.gryseels@inte.rug..be) reeive n M.S. egree in eletril engineering in 1996 from the University of Gent, elgium. Sine 1996 he hs been working s reserher for the Fun for Sientifi Reserh of Flners (F.W.O.) t the eprtment of Informtion Tehnology (INT), University of Gent, where he is stuying multilyer networks. urrently, he is visiting reserher with Telstr orportion, Austrli. His min reserh interests inlue moeling, plnning, n evlution of multitehnology network rhitetures. AHIM AUTNRITH (him@lkn.e-tehnik.tu-muenhen.e) reeive his ipl.-ing. egree t the Munih University of Tehnology, Germny, in Sine then he hs been member of the reserh stff t the Institute of ommunition Networks t the Munih University of Tehnology, where he ws responsible for the ATS Projet PANL from 1996 to He is urrently working on his Ph.. in the re of multitehnology resiliene, inluing IP. ARLO RIANZA (rlo.brinz@itltel.it) reeive his r. ng. egree in eletronis t Politenio i Milno n Mster s in informtion tehnology t the efriel reserh institute in Miln in He joine Itltel S.p.A. entrl R& in 1994 n ws responsible for Itltel prtiiption in both the PANL n MISA ATS projets. At the en of 1998 he joine the Opertions n Support Systems ivision of INFOSTRAA S.p.A. His working experiene enompsses ll TMN lyers. LAURA ASTAGNA (L.stgn@sirti.it) reeive otorte egree in eletroni engineering from Politenio i Milno in She joine the Sirti R& ept. in 1996 s stger to stuy new methoologies to pln n ATM multiservie network. Sine 1997 she hs worke in the R& eprtment of Sirti;she is engge in plnning ATM, SH, n WM networks, in interworking between IP n WM, n s elegte to ATM-Forum n ITU-T SG 12/13/15. GIULIO SIGNORLLI (G.Signorelli@sirti.it) grute in eletroni engineering, speiliztion teleommunitions, from University of Pvi, Itly, in He worke in the eletrooptis lbortories of this university. In 1995 he joine the R& ivision of Sirti. He ws involve in the trnsport network re eling with SH n WM network plnning. He prtiipte in Teleom Itli SH plnning projets n severl turnkey network projets for other opertors. He is member of ITU n TSI stuy groups involve in optil networking. He hs reently jointe Infostr, the new Itlin telo opertor, where he is involve in the SH n WM network strtup phse. RORTO LMNT (roberto.lemente@selt.it) reeive his egree in eletroni engineering from Politenio of Torino in uring the next yer he joine SLT, the orporte teleommunition reserh enter of Teleom Itli, n strte working in the Network Plnning n Mngement ivision. His interests re in the imensioning of trnsport SH/WM networks, ressing both the long istne n regionl network shres. He ws involve in severl URSOM n ATS projets n hs been o-uthor of ppers regring trnsport network plnning n single- n multilyer reovery shemes in severl onferenes for the lst three yers. MAURO RAVRA (muro.rver@selt.it) reeive egree in eletroni engineering from the Politenio of Torino in 1988; uring the sme yer he joine SLT, the orporte teleommunitions reserh enter of the Teleom Itli group. Sine 1992 he hs worke in the Network Plnning n Mngement eprtment, where he hs been responsible for projet whih ontribute to the funmentl plns of the ess n trnsport network of Teleom Itli. ANRZJ JAJSZZYK [F 99] (Anrzej.Jjszzyk@itti.om.pl) reeive his M.S. egree in eletril engineering in 1974, n his Ph.. egree in ommunitions in He is professor t the University of Tehnology n Agriulture, ygoszz, Poln. His reserh interests inlue high-spee networking s well s network n servie mngement. He hs publishe over 150 ppers n six books, n hols 19 ptents. He ws n eitor of I Trnstions on ommunitions n founing eitor of I Globl ommunitions Newsletter. He is itor-in-hief of I ommunitions Mgzine. He hs orgnize severl symposi, n serve on numerous progrm n orgnizing ommittees. ARIUSZ JANUKOWIZ (jnukow@unitel.om.pl) finishe his Mster s stuies t the University of Tehnologies in He worke on mngement of ommunition networks t the Institute of ommunition n Informtion Tehnologies. He ws involve in the PANL projet in the mngement-relte prt. Sine 1999 he is involve in the evelopment of Internet ess networks n swithing mngement t the Teleommunition Stuies n esign ureu UNITL Lt., Poznn, Poln. KRISTOF VAN OORSLAR (kristof.vn.oorselere@is.belgom.be) grute s n engineer from the University of Gent in In tht yer he joine the reserh group of Prof. Piet emeester t the University of Gent n stuie there the fult mngement n survivbility in WM/SH/ATM trnsport networks. In 1998 he left for elgom n is working there on the long-term lese line rhiteture. YOHNOSUK HARAA (hr@netsrg.tnl.ntt.o.jp) grute from the Kyoto University Fulty of ngineering, n his mjor is on utomti ontrol. After finishing his Mster s egree, he entere NTT letril ommunition Lbortories. He hs been working on teletrffi stuy, network plnning lgorithms, network plnning tools, ynmi routing lgorithms, evelopment of network opertion systems, seurity rhiteture, ATM stnriztion, n overses ATM pplition trils with AT&T, T, n K. He is urrently prtiipting in multimei pplitions evelopment in soil siene. 76 I ommunitions Mgzine August 1999

Distance vector protocol

Distance vector protocol istne vetor protool Irene Finohi finohi@i.unirom.it Routing Routing protool Gol: etermine goo pth (sequene of routers) thru network from soure to Grph strtion for routing lgorithms: grph noes re routers

More information

Internet Routing. Reminder: Routing. CPSC Network Programming

Internet Routing. Reminder: Routing. CPSC Network Programming PS 360 - Network Progrmming Internet Routing Mihele Weigle eprtment of omputer Siene lemson University mweigle@s.lemson.eu pril, 00 http://www.s.lemson.eu/~mweigle/ourses/ps360 Reminer: Routing Internet

More information

UTMC APPLICATION NOTE UT1553B BCRT TO INTERFACE PSEUDO-DUAL-PORT RAM ARCHITECTURE INTRODUCTION ARBITRATION DETAILS DESIGN SELECTIONS

UTMC APPLICATION NOTE UT1553B BCRT TO INTERFACE PSEUDO-DUAL-PORT RAM ARCHITECTURE INTRODUCTION ARBITRATION DETAILS DESIGN SELECTIONS UTMC APPLICATION NOTE UT1553B BCRT TO 80186 INTERFACE INTRODUCTION The UTMC UT1553B BCRT is monolithi CMOS integrte iruit tht provies omprehensive Bus Controller n Remote Terminl funtions for MIL-STD-

More information

COMPUTER EDUCATION TECHNIQUES, INC. (WEBLOGIC_SVR_ADM ) SA:

COMPUTER EDUCATION TECHNIQUES, INC. (WEBLOGIC_SVR_ADM ) SA: In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the nswers to the following

More information

Cooperative Routing in Multi-Source Multi-Destination Multi-hop Wireless Networks

Cooperative Routing in Multi-Source Multi-Destination Multi-hop Wireless Networks oopertive Routing in Multi-Soure Multi-estintion Multi-hop Wireless Networks Jin Zhng Qin Zhng eprtment of omputer Siene n ngineering Hong Kong University of Siene n Tehnology, HongKong {zjzj, qinzh}@se.ust.hk

More information

Three planes in networks

Three planes in networks Three plnes in networks Prof. Mlthi eerrghvn Ele. & Comp. Engg. Dept/CATT Polytehni University mv@poly.eu M. eerrghvn 1 Polytehni University User plne, ontrol plne, n mngement plne Mngement plne: onsists

More information

10.2 Graph Terminology and Special Types of Graphs

10.2 Graph Terminology and Special Types of Graphs 10.2 Grph Terminology n Speil Types of Grphs Definition 1. Two verties u n v in n unirete grph G re lle jent (or neighors) in G iff u n v re enpoints of n ege e of G. Suh n ege e is lle inient with the

More information

CICS Application Design

CICS Application Design CICS Applition Design In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the

More information

Inter-domain Routing

Inter-domain Routing COMP 631: NETWORKED & DISTRIBUTED SYSTEMS Inter-domin Routing Jsleen Kur Fll 2016 1 Internet-sle Routing: Approhes DV nd link-stte protools do not sle to glol Internet How to mke routing slle? Exploit

More information

A decision support system prototype for fuzzy multiple objective optimization

A decision support system prototype for fuzzy multiple objective optimization EUSFLAT - LFA A eision support system prototype for fuzzy multiple ojetive optimiztion Fengjie Wu Jie Lu n Gungqun Zhng Fulty of Informtion Tehnology University of Tehnology Syney Austrli E-mil: {fengjiewjieluzhngg}@it.uts.eu.u

More information

Greedy Algorithm. Algorithm Fall Semester

Greedy Algorithm. Algorithm Fall Semester Greey Algorithm Algorithm 0 Fll Semester Optimiztion prolems An optimiztion prolem is one in whih you wnt to fin, not just solution, ut the est solution A greey lgorithm sometimes works well for optimiztion

More information

FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE

FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE 1 M.JothiLkshmi, M.S., M.Phil. 2 C.Theeendr, M.S., M.Phil. 3 M.K.Pvithr,

More information

Internet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014.

Internet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014. omputer Networks 9/29/2014 IP Pket Formt Internet Routing Ki Shen IP protool version numer heder length (words) for qulity of servie mx numer remining hops (deremented t eh router) upper lyer protool to

More information

Chapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved.

Chapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved. Chpter 9 Greey Tehnique Copyright 2007 Person Aison-Wesley. All rights reserve. Greey Tehnique Construts solution to n optimiztion prolem piee y piee through sequene of hoies tht re: fesile lolly optiml

More information

Table-driven look-ahead lexical analysis

Table-driven look-ahead lexical analysis Tle-riven look-he lexil nlysis WUU YANG Computer n Informtion Siene Deprtment Ntionl Chio-Tung University, HsinChu, Tiwn, R.O.C. Astrt. Moern progrmming lnguges use regulr expressions to efine vli tokens.

More information

CS 241 Week 4 Tutorial Solutions

CS 241 Week 4 Tutorial Solutions CS 4 Week 4 Tutoril Solutions Writing n Assemler, Prt & Regulr Lnguges Prt Winter 8 Assemling instrutions utomtilly. slt $d, $s, $t. Solution: $d, $s, nd $t ll fit in -it signed integers sine they re 5-it

More information

V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V)

V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V) Definitions G = (V, E) V = set of verties (vertex / noe) E = set of eges (v, w) (v, w in V) (v, w) orere => irete grph (igrph) (v, w) non-orere => unirete grph igrph: w is jent to v if there is n ege from

More information

Graph Contraction and Connectivity

Graph Contraction and Connectivity Chpter 14 Grph Contrtion n Connetivity So fr we hve mostly overe tehniques for solving problems on grphs tht were evelope in the ontext of sequentil lgorithms. Some of them re esy to prllelize while others

More information

Class Overview. Database Design. Database Design Process. Database Design. Introduction to Data Management CSE 414

Class Overview. Database Design. Database Design Process. Database Design. Introduction to Data Management CSE 414 Introution to Dt Mngement CSE 44 Unit 6: Coneptul Design E/R Digrms Integrity Constrints BCNF Introution to Dt Mngement CSE 44 E/R Digrms ( letures) CSE 44 Autumn 08 Clss Overview Dtse Design Unit : Intro

More information

Hash-based Subgraph Query Processing Method for Graph-structured XML Documents

Hash-based Subgraph Query Processing Method for Graph-structured XML Documents Hsh-bse Subgrph Query Proessing Metho for Grph-struture XML Douments Hongzhi Wng Hrbin Institute of Teh. wngzh@hit.eu.n Jinzhong Li Hrbin Institute of Teh. lijzh@hit.eu.n Jizhou Luo Hrbin Institute of

More information

COMMON FRACTIONS. or a / b = a b. , a is called the numerator, and b is called the denominator.

COMMON FRACTIONS. or a / b = a b. , a is called the numerator, and b is called the denominator. COMMON FRACTIONS BASIC DEFINITIONS * A frtion is n inite ivision. or / * In the frtion is lle the numertor n is lle the enomintor. * The whole is seprte into "" equl prts n we re onsiering "" of those

More information

McAfee Web Gateway

McAfee Web Gateway Relese Notes Revision C MAfee We Gtewy 7.6.2.11 Contents Aout this relese Enhnement Resolved issues Instlltion instrutions Known issues Additionl informtion Find produt doumenttion Aout this relese This

More information

The Network Layer: Routing in the Internet. The Network Layer: Routing & Addressing Outline

The Network Layer: Routing in the Internet. The Network Layer: Routing & Addressing Outline CPSC 852 Internetworking The Network Lyer: Routing in the Internet Mihele Weigle Deprtment of Computer Siene Clemson University mweigle@s.lemson.edu http://www.s.lemson.edu/~mweigle/ourses/ps852 1 The

More information

CS453 INTRODUCTION TO DATAFLOW ANALYSIS

CS453 INTRODUCTION TO DATAFLOW ANALYSIS CS453 INTRODUCTION TO DATAFLOW ANALYSIS CS453 Leture Register llotion using liveness nlysis 1 Introdution to Dt-flow nlysis Lst Time Register llotion for expression trees nd lol nd prm vrs Tody Register

More information

MITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam

MITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam Cmrige, Msshusetts Introution to Mtrois n Applitions Srikumr Rmlingm MERL mm//yy Liner Alger (,0,0) (0,,0) Liner inepenene in vetors: v, v2,..., For ll non-trivil we hve s v s v n s, s2,..., s n 2v2...

More information

FEEDBACK: The standard error of a regression is not an unbiased estimator for the standard deviation of the error in a multiple regression model.

FEEDBACK: The standard error of a regression is not an unbiased estimator for the standard deviation of the error in a multiple regression model. Introutory Eonometris: A Moern Approh 6th Eition Woolrige Test Bnk Solutions Complete ownlo: https://testbnkre.om/ownlo/introutory-eonometris-moern-pproh-6th-eition-jeffreym-woolrige-test-bnk/ Solutions

More information

Error Numbers of the Standard Function Block

Error Numbers of the Standard Function Block A.2.2 Numers of the Stndrd Funtion Blok evlution The result of the logi opertion RLO is set if n error ours while the stndrd funtion lok is eing proessed. This llows you to rnh to your own error evlution

More information

The Droplet Virtual Brush for Chinese Calligraphic Character Modeling

The Droplet Virtual Brush for Chinese Calligraphic Character Modeling The Droplet Virtul Brush for Chinese Clligrphi Chrter Moeling Xiofeng Mi Jie Xu Min Tng Jinxing Dong CAD & CG Stte Key L of Chin, Zhejing University, Hngzhou, Chin Artifiil Intelligene Institute, Zhejing

More information

Introduction. Example

Introduction. Example OMS0 Introution isjoint sets n minimum spnning trees In this leture we will strt by isussing t struture use for mintining isjoint subsets of some bigger set. This hs number of pplitions, inluing to mintining

More information

Resource and Memory Management Techniques for the High-Level Synthesis of Software Threads into Parallel FPGA Hardware

Resource and Memory Management Techniques for the High-Level Synthesis of Software Threads into Parallel FPGA Hardware Resoure n Memory Mngement Tehniques for the High-Level Synthesis of Softwre Thres into Prllel FPGA Hrwre Jongsok Choi, Stephen Brown, n Json Anerson ECE Deprtment, University of Toronto, Toronto, ON, Cn

More information

Distributed Systems Principles and Paradigms

Distributed Systems Principles and Paradigms Distriuted Systems Priniples nd Prdigms Christoph Dorn Distriuted Systems Group, Vienn University of Tehnology.dorn@infosys.tuwien..t http://www.infosys.tuwien..t/stff/dorn Slides dpted from Mrten vn Steen,

More information

Distributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems

Distributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems Distriuted Systems Priniples nd Prdigms Mrten vn Steen VU Amsterdm, Dept. Computer Siene steen@s.vu.nl Chpter 11: Distriuted File Systems Version: Deemer 10, 2012 2 / 14 Distriuted File Systems Distriuted

More information

Lesson 4.4. Euler Circuits and Paths. Explore This

Lesson 4.4. Euler Circuits and Paths. Explore This Lesson 4.4 Euler Ciruits nd Pths Now tht you re fmilir with some of the onepts of grphs nd the wy grphs onvey onnetions nd reltionships, it s time to egin exploring how they n e used to model mny different

More information

This Unit: Processor Design. What Is Control? Example: Control for sw. Example: Control for add

This Unit: Processor Design. What Is Control? Example: Control for sw. Example: Control for add This Unit: rocessor Design Appliction O ompiler U ory Firmwre I/O Digitl ircuits Gtes & Trnsistors pth components n timing s n register files ories (RAMs) locking strtegies Mpping n IA to tpth ontrol Exceptions

More information

A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications $

A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications $ Informtion Systems 29 (2004) 23 46 A mthing lgorithm for mesuring the struturl similrity etween n XML oument n DTD n its pplitions $ Elis Bertino, Giovnn Guerrini, Mro Mesiti, * Diprtimento i Informti

More information

Parallelization Optimization of System-Level Specification

Parallelization Optimization of System-Level Specification Prlleliztion Optimiztion of System-Level Speifition Luki i niel. Gjski enter for Emedded omputer Systems University of liforni Irvine, 92697, US {li, gjski} @es.ui.edu strt This pper introdues the prlleliztion

More information

Robust internal multiple prediction algorithm Zhiming James Wu, Sonika, Bill Dragoset*, WesternGeco

Robust internal multiple prediction algorithm Zhiming James Wu, Sonika, Bill Dragoset*, WesternGeco Roust internl multiple preition lgorithm Zhiming Jmes Wu, Sonik, Bill Drgoset*, WesternGeo Summry Multiple ttenution is n importnt t proessing step for oth mrine n ln t. Tehniques for surfe- rpily in the

More information

Cellular-based Population to Enhance Genetic Algorithm for Assignment Problems

Cellular-based Population to Enhance Genetic Algorithm for Assignment Problems Amerin Journl of Intelligent Systems. 0; (): -5 DOI: 0. 593/j.jis.000.0 Cellulr-se Popultion to Enhne Geneti Algorithm for Assignment Prolems Hossein Rjlipour Cheshmehgz *, Hiollh Hron, Mohmm Rez Myoi

More information

Duality in linear interval equations

Duality in linear interval equations Aville online t http://ijim.sriu..ir Int. J. Industril Mthemtis Vol. 1, No. 1 (2009) 41-45 Dulity in liner intervl equtions M. Movhedin, S. Slhshour, S. Hji Ghsemi, S. Khezerloo, M. Khezerloo, S. M. Khorsny

More information

Security Issues in the Optimized Link State Routing Protocol version 2 (OLSRv2)

Security Issues in the Optimized Link State Routing Protocol version 2 (OLSRv2) Seurity Issues in the Optimize Link Stte Routing Protool version 2 (OLSRv2) Thoms Heie Clusen, Ulrih Hererg To ite this version: Thoms Heie Clusen, Ulrih Hererg. Seurity Issues in the Optimize Link Stte

More information

An Efficient Algorithm for the Physical Mapping of Clustered Task Graphs onto Multiprocessor Architectures

An Efficient Algorithm for the Physical Mapping of Clustered Task Graphs onto Multiprocessor Architectures An Effiient Algorithm for the Physil Mpping of Clustere Tsk Grphs onto Multiproessor Arhitetures Netrios Koziris Pnyiotis Tsnks Mihel Romesis George Ppkonstntinou Ntionl Tehnil University of Athens Dept.

More information

CS553 Lecture Introduction to Data-flow Analysis 1

CS553 Lecture Introduction to Data-flow Analysis 1 ! Ide Introdution to Dt-flow nlysis!lst Time! Implementing Mrk nd Sweep GC!Tody! Control flow grphs! Liveness nlysis! Register llotion CS553 Leture Introdution to Dt-flow Anlysis 1 Dt-flow Anlysis! Dt-flow

More information

Containers: Queue and List

Containers: Queue and List Continers: Queue n List Queue A ontiner in whih insertion is one t one en (the til) n eletion is one t the other en (the he). Also lle FIFO (First-In, First-Out) Jori Cortell n Jori Petit Deprtment of

More information

Performance characterization of CSMA/CA adapted multi-user MIMO aware MAC in WLANs

Performance characterization of CSMA/CA adapted multi-user MIMO aware MAC in WLANs Thp et l. EURASIP Journl on Wireless Communitions n Networking, :4 http://jwn.eursipjournls.om/ontent///4 RESEARCH Open Aess Performne hrteriztion of CSMA/CA pte multi-user MIMO wre MAC in WLANs Anup Thp,

More information

Paradigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms

Paradigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms Prdigm. Dt Struture Known exmples: link tble, hep, Our leture: suffix tree Will involve mortize method tht will be stressed shortly in this ourse Suffix trees Wht is suffix tree? Simple pplitions History

More information

Graph theory Route problems

Graph theory Route problems Bhelors thesis Grph theory Route prolems Author: Aolphe Nikwigize Dte: 986 - -5 Sujet: Mthemtis Level: First level (Bhelor) Course oe: MAE Astrt In this thesis we will review some route prolems whih re

More information

- Image preview time 25 to 60 Sec. (For large image)

- Image preview time 25 to 60 Sec. (For large image) Sr. No. 1 2 NIT-136 Item No. 1 CR SYSTEM-SINGLE PLATE, READER TYPE FOR DIGITAL, RADIOGRAPHY Quntity-10 Desription of Tehnil Speifition Digitizer CR system shoul hve pity to proess 60 or more ssettes per

More information

To access your mailbox from inside your organization. For assistance, call:

To access your mailbox from inside your organization. For assistance, call: 2001 Ative Voie, In. All rights reserved. First edition 2001. Proteted y one or more of the following United Sttes ptents:,070,2;,3,90;,88,0;,33,102;,8,0;,81,0;,2,7;,1,0;,90,88;,01,11. Additionl U.S. nd

More information

Declarative Routing: Extensible Routing with Declarative Queries

Declarative Routing: Extensible Routing with Declarative Queries elrtive Routing: Extensile Routing with elrtive Queries Boon Thu Loo 1 Joseph M. Hellerstein 1,2, Ion toi 1, Rghu Rmkrishnn3, 1 University of Cliforni t Berkeley, 2 Intel Reserh Berkeley, 3 University

More information

COMPUTATION AND VISUALIZATION OF REACHABLE DISTRIBUTION NETWORK SUBSTATION VOLTAGE

COMPUTATION AND VISUALIZATION OF REACHABLE DISTRIBUTION NETWORK SUBSTATION VOLTAGE 24 th Interntionl Conferene on Eletriity Distriution Glsgow, 12-15 June 2017 Pper 0615 COMPUTATION AND VISUALIZATION OF REACHABLE DISTRIBUTION NETWORK SUBSTATION VOLTAGE Mihel SANKUR Dniel ARNOLD Lun SCHECTOR

More information

IMAGE COMPRESSION USING HIRARCHICAL LINEAR POLYNOMIAL CODING

IMAGE COMPRESSION USING HIRARCHICAL LINEAR POLYNOMIAL CODING Rsh Al-Tmimi et l, Interntionl Journl of Computer Siene nd Mobile Computing, Vol.4 Issue.1, Jnury- 015, pg. 11-119 Avilble Online t www.ijsm.om Interntionl Journl of Computer Siene nd Mobile Computing

More information

WORKSHOP 9 HEX MESH USING SWEEP VECTOR

WORKSHOP 9 HEX MESH USING SWEEP VECTOR WORKSHOP 9 HEX MESH USING SWEEP VECTOR WS9-1 WS9-2 Prolem Desription This exerise involves importing urve geometry from n IGES file. The urves re use to rete other urves. From the urves trimme surfes re

More information

Partitioning for Parallelization Using Graph Parsing

Partitioning for Parallelization Using Graph Parsing Prtitioning for Prlleliztion Using Grph Prsing C. L. MCrery Deprtment of Computer Siene n Engineering Auurn University, Al 36849 e-mil: mrery@eng.uurn.eu (205) 844-6307 List of Figures Figure 3.1 Figure

More information

Using Red-Eye to improve face detection in low quality video images

Using Red-Eye to improve face detection in low quality video images Using Re-Eye to improve fe etetion in low qulity vieo imges Rihr Youmrn Shool of Informtion Tehnology University of Ottw, Cn youmrn@site.uottw. Any Aler Shool of Informtion Tehnology University of Ottw,

More information

Accurate Indirect Branch Prediction

Accurate Indirect Branch Prediction Aurte Indiret Brnh Predition Krel Driesen nd Urs Hölzle Deprtment of Computer Siene University of Cliforni Snt Brbr, CA 9 Abstrt Indiret brnh predition is likely to beome inresingly importnt in the future

More information

Evaluating Regular Expression Matching Engines on Network and General Purpose Processors

Evaluating Regular Expression Matching Engines on Network and General Purpose Processors Evluting Regulr Expression Mthing Engines on Network n Generl Purpose Proessors Mihel Behi Wshington University Computer Siene n Engineering St. Louis, MO 63130-4899 mehi@se.wustl.eu Chrlie Wisemn Wshington

More information

Architecture and Data Flows Reference Guide

Architecture and Data Flows Reference Guide Arhiteture nd Dt Flows Referene Guide BES12 Version 12.5 Pulished: 2016-06-29 SWD-20160620150844487 Contents Aout this guide... 5 Arhiteture: BES12 EMM solution... 6 BES12 omponents...8 Components used

More information

Solids. Solids. Curriculum Ready.

Solids. Solids. Curriculum Ready. Curriulum Rey www.mthletis.om This ooklet is ll out ientifying, rwing n mesuring solis n prisms. SOM CUES The Som Cue ws invente y Dnish sientist who went y the nme of Piet Hein. It is simple 3 # 3 #

More information

Using a User-Level Memory Thread for Correlation Prefetching

Using a User-Level Memory Thread for Correlation Prefetching Using User-Level Memory Thre for Correltion Prefething Yn Solihin Jejin Lee Josep Torrells University of Illinois t Urn-Chmpign Mihign Stte University http://iom.s.uiu.eu http://www.se.msu.eu/ jlee Astrt

More information

Bruce McCarl's GAMS Newsletter Number 37

Bruce McCarl's GAMS Newsletter Number 37 Bruce McCrl's GAMS Newsletter Number 37 This newsletter covers 1 Uptes to Expne GAMS User Guie by McCrl et l.... 1 2 YouTube vieos... 1 3 Explntory text for tuple set elements... 1 4 Reing sets using GDXXRW...

More information

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li

Complete Coverage Path Planning of Mobile Robot Based on Dynamic Programming Algorithm Peng Zhou, Zhong-min Wang, Zhen-nan Li, Yang Li 2nd Interntionl Conference on Electronic & Mechnicl Engineering nd Informtion Technology (EMEIT-212) Complete Coverge Pth Plnning of Mobile Robot Bsed on Dynmic Progrmming Algorithm Peng Zhou, Zhong-min

More information

Bayesian Networks: Directed Markov Properties (Cont d) and Markov Equivalent DAGs

Bayesian Networks: Directed Markov Properties (Cont d) and Markov Equivalent DAGs Byesin Networks: Direte Mrkov Properties (Cont ) n Mrkov Equivlent DAGs Huizhen Yu jney.yu@s.helsinki.fi Dept. Computer Siene, Univ. of Helsinki Proilisti Moels, Spring, 2010 Huizhen Yu (U.H.) Byesin Networks:

More information

Research Article Distributed Dynamic Memetic Algorithm Based Coding Aware Routing for Wireless Mesh Sensor Networks

Research Article Distributed Dynamic Memetic Algorithm Based Coding Aware Routing for Wireless Mesh Sensor Networks Hinwi Pulishing Corportion Interntionl Journl of Distriute Sensor Networks Volume 26, Artile ID 542933, 7 pges http://x.oi.org/.55/26/542933 Reserh Artile Distriute Dynmi Memeti Algorithm Bse Coing Awre

More information

Adaptive Pixel Interpolation for Spatial Error Concealment

Adaptive Pixel Interpolation for Spatial Error Concealment J Sign Proess Syst (2010) 60:291 303 DOI 10.1007/s11265-009-0367-y Aptive Pixel Interpoltion for Sptil Error Conelment Li Song & Xin M Reeive: 9 Novemer 2008 / Revise: 23 Mrh 2009 /Aepte: 30 Mrh 2009 /Pulishe

More information

Vulnerability Analysis of Electric Power Communication Network. Yucong Wu

Vulnerability Analysis of Electric Power Communication Network. Yucong Wu 2nd Interntionl Conference on Advnces in Mechnicl Engineering nd Industril Informtics (AMEII 2016 Vulnerbility Anlysis of Electric Power Communiction Network Yucong Wu Deprtment of Telecommunictions Engineering,

More information

3D Physical Design: Challenges and Solutions

3D Physical Design: Challenges and Solutions 3D Phsil Design: Chllenges n Solutions Roert Fishh, Jens Lienig, Tilo Meister Dresen Universit of Tehnolog Institute of Eletromehnil n Eletroni Design, Dresen, Germn www.ifte.e Emil: {fishh, lienig, meister}@ifte.e

More information

SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS

SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS Progress In Eletromgnetis Reserh C, Vol. 3, 195 22, 28 SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS W.-L. Chen nd G.-M. Wng Rdr Engineering Deprtment Missile Institute of Air Fore Engineering

More information

Generating Editors for Direct Manipulation of Diagrams

Generating Editors for Direct Manipulation of Diagrams Generting Eitors for Diret Mnipultion of Digrms Gerhr Viehstet n Mrk Mins Lehrstuhl für Progrmmiersprhen Universität Erlngen-Nürnerg Mrtensstr. 3, 91058 Erlngen, Germny E-mil: fviehste,minsg@informtik.uni-erlngen.e

More information

A new way to evaluate steel sheet surfaces

A new way to evaluate steel sheet surfaces A new wy to evlute steel sheet surfes L. Blunt X. ing W. Zeng T. Asim Centre for Preision Tehnologies (CPT) University of Huersfiel Queensgte Huersfiel UK HD1 3DH Tel.: + 44-1484-473634 E-mil: x.ing@hu..uk

More information

Outline. CS38 Introduction to Algorithms. Graphs. Graphs. Graphs. Graph traversals

Outline. CS38 Introduction to Algorithms. Graphs. Graphs. Graphs. Graph traversals Outline CS38 Introution to Algorithms Leture 2 April 3, 2014 grph trversls (BFS, DFS) onnetivity topologil sort strongly onnete omponents heps n hepsort greey lgorithms April 3, 2014 CS38 Leture 2 2 Grphs

More information

McAfee Data Loss Prevention Prevent

McAfee Data Loss Prevention Prevent Quik Strt Guide Revision B MAfee Dt Loss Prevention Prevent version 10.x This quik strt guide provides high-level instrutions for setting up MAfee Dt Loss Prevention Prevent (MAfee DLP Prevent) hrdwre

More information

Architecture and Data Flows Reference Guide

Architecture and Data Flows Reference Guide Arhiteture nd Dt Flows Referene Guide BlkBerry UEM Version 12.7 Pulished: 2017-07-12 SWD-20170627140413745 Contents Aout this guide... 5 Arhiteture: BlkBerry UEM solution... 6 BlkBerry UEM omponents...

More information

Scalable Spatio-temporal Continuous Query Processing for Location-aware Services

Scalable Spatio-temporal Continuous Query Processing for Location-aware Services Slle Sptio-temporl Continuous uery Proessing for Lotion-wre Servies iopeng iong Mohme F. Mokel Wli G. Aref Susnne E. Hmrush Sunil Prhkr Deprtment of Computer Sienes, Purue University, West Lfyette, IN

More information

Pipeline Example: Cycle 1. Pipeline Example: Cycle 2. Pipeline Example: Cycle 4. Pipeline Example: Cycle 3. 3 instructions. 3 instructions.

Pipeline Example: Cycle 1. Pipeline Example: Cycle 2. Pipeline Example: Cycle 4. Pipeline Example: Cycle 3. 3 instructions. 3 instructions. ipeline Exmple: Cycle 1 ipeline Exmple: Cycle X X/ /W X X/ /W $3,$,$1 lw $,0($5) $3,$,$1 3 instructions 8 9 ipeline Exmple: Cycle 3 ipeline Exmple: Cycle X X/ /W X X/ /W sw $6,($7) lw $,0($5) $3,$,$1 sw

More information

PROBLEM OF APOLLONIUS

PROBLEM OF APOLLONIUS PROBLEM OF APOLLONIUS In the Jnury 010 issue of Amerin Sientist D. Mkenzie isusses the Apollonin Gsket whih involves fining the rius of the lrgest irle whih just fits into the spe etween three tngent irles

More information

CMPUT101 Introduction to Computing - Summer 2002

CMPUT101 Introduction to Computing - Summer 2002 CMPUT Introdution to Computing - Summer 22 %XLOGLQJ&RPSXWHU&LUFXLWV Chpter 4.4 3XUSRVH We hve looked t so fr how to uild logi gtes from trnsistors. Next we will look t how to uild iruits from logi gtes,

More information

ORGANIZER QUICK START GUIDE

ORGANIZER QUICK START GUIDE NOTES ON USING GOTOWEBINAR GoToWeinr Orgnizers my hol Weinrs for up to 1,000 ttenees. The Weinr proess n e roken into three stges: Weinr Plnning, Weinr Presenttion n Weinr Follow-up. Orgnizers nee to first

More information

Comparison-based Choices

Comparison-based Choices Comprison-se Choies John Ugner Mngement Siene & Engineering Stnfor University Joint work with: Jon Kleinerg (Cornell) Senhil Mullinthn (Hrvr) EC 17 Boston June 28, 2017 Preiting isrete hoies Clssi prolem:

More information

Package Contents. Wireless-G USB Network Adapter with SpeedBooster USB Cable Setup CD-ROM with User Guide (English only) Quick Installation

Package Contents. Wireless-G USB Network Adapter with SpeedBooster USB Cable Setup CD-ROM with User Guide (English only) Quick Installation A Division of Ciso Systems, In. Pkge Contents Wireless-G USB Network Adpter with SpeedBooster USB Cle Setup CD-ROM with User Guide (English only) Quik Instlltion 2,4 GHz 802.11g Wireless Model No. Model

More information

Troubleshooting. Verify the Cisco Prime Collaboration Provisioning Installation (for Advanced or Standard Mode), page

Troubleshooting. Verify the Cisco Prime Collaboration Provisioning Installation (for Advanced or Standard Mode), page Trouleshooting This setion explins the following: Verify the Ciso Prime Collortion Provisioning Instlltion (for Advned or Stndrd Mode), pge 1 Upgrde the Ciso Prime Collortion Provisioning from Smll to

More information

Using SIMD Registers and Instructions to Enable Instruction-Level Parallelism in Sorting Algorithms

Using SIMD Registers and Instructions to Enable Instruction-Level Parallelism in Sorting Algorithms Using SIMD Registers n Instrutions to Enle Instrution-Level Prllelism in Sorting Algorithms Timothy Furtk furtk@s.ulert. José Nelson Amrl mrl@s.ulert. Roert Niewiomski niewio@s.ulert. Deprtment of Computing

More information

Shared Memory Architectures. Programming and Synchronization. Today s Outline. Page 1. Message passing review Cosmic Cube discussion

Shared Memory Architectures. Programming and Synchronization. Today s Outline. Page 1. Message passing review Cosmic Cube discussion Tody s Outline Arhitetures Progrmming nd Synhroniztion Disuss pper on Cosmi Cube (messge pssing) Messge pssing review Cosmi Cube disussion > Messge pssing mhine Shred memory model > Communition > Synhroniztion

More information

Asurveyofpractical algorithms for suffix tree construction in external memory

Asurveyofpractical algorithms for suffix tree construction in external memory Asurveyofprtil lgorithms for suffix tree onstrution in externl memory M. Brsky,, U. Stege n A. Thomo University of Vitori, PO Box, STN CSC Vitori, BC, VW P, Cn SUMMAY The onstrution of suffix trees in

More information

Comparing Hierarchical Data in External Memory

Comparing Hierarchical Data in External Memory Compring Hierrhil Dt in Externl Memory Surshn S. Chwthe Deprtment of Computer Siene University of Mryln College Prk, MD 090 hw@s.um.eu Astrt We present n externl-memory lgorithm for omputing minimum-ost

More information

Loop Shifting and Compaction for the High-Level Synthesis of Designs with Complex Control Flow

Loop Shifting and Compaction for the High-Level Synthesis of Designs with Complex Control Flow Shifting n Comption for the High-Level Synthesis of Designs with Complex Control low Sumit Gupt Nikil Dutt Rjesh Gupt Alexnru Niolu Center for Emee Computer Systems Shool of Informtion n Computer Siene

More information

Honors Thesis: Investigating the Algebraic Properties of Cayley Digraphs

Honors Thesis: Investigating the Algebraic Properties of Cayley Digraphs Honors Thesis: Investigting the Algebri Properties of Cyley Digrphs Alexis Byers, Wittenberg University Mthemtis Deprtment April 30, 2014 This pper utilizes Grph Theory to gin insight into the lgebri struture

More information

Advanced Programming Handout 5. Enter Okasaki. Persistent vs. Ephemeral. Functional Queues. Simple Example. Persistent vs.

Advanced Programming Handout 5. Enter Okasaki. Persistent vs. Ephemeral. Functional Queues. Simple Example. Persistent vs. Avne Progrmming Hnout 5 Purel Funtionl Dt Strutures: A Cse Stu in Funtionl Progrmming Persistent vs. Ephemerl An ephemerl t struture is one for whih onl one version is ville t time: fter n upte opertion,

More information

Enterprise Digital Signage Create a New Sign

Enterprise Digital Signage Create a New Sign Enterprise Digitl Signge Crete New Sign Intended Audiene: Content dministrtors of Enterprise Digitl Signge inluding stff with remote ess to sign.pitt.edu nd the Content Mnger softwre pplition for their

More information

Line The set of points extending in two directions without end uniquely determined by two points. The set of points on a line between two points

Line The set of points extending in two directions without end uniquely determined by two points. The set of points on a line between two points Lines Line Line segment Perpendiulr Lines Prllel Lines Opposite Angles The set of points extending in two diretions without end uniquely determined by two points. The set of points on line between two

More information

Midterm Exam CSC October 2001

Midterm Exam CSC October 2001 Midterm Exm CSC 173 23 Otoer 2001 Diretions This exm hs 8 questions, severl of whih hve suprts. Eh question indites its point vlue. The totl is 100 points. Questions 5() nd 6() re optionl; they re not

More information

Prefetching in an Intelligent Memory Architecture Using a Helper Thread

Prefetching in an Intelligent Memory Architecture Using a Helper Thread Prefething in n Intelligent Memory Arhiteture Using Helper Thre Yn Solihin, Jejin Lee, n Josep Torrells University of Illinois t Urn-Chmpign Mihign Stte University solihin,torrells @s.uiu.eu jlee@se.msu.eu

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

COSC 6374 Parallel Computation. Non-blocking Collective Operations. Edgar Gabriel Fall Overview

COSC 6374 Parallel Computation. Non-blocking Collective Operations. Edgar Gabriel Fall Overview COSC 6374 Prllel Computtion Non-loking Colletive Opertions Edgr Griel Fll 2014 Overview Impt of olletive ommunition opertions Impt of ommunition osts on Speedup Crtesin stenil ommunition All-to-ll ommunition

More information

Minimal Memory Abstractions

Minimal Memory Abstractions Miniml Memory Astrtions (As implemented for BioWre Corp ) Nthn Sturtevnt University of Alert GAMES Group Ferury, 7 Tlk Overview Prt I: Building Astrtions Minimizing memory requirements Performnes mesures

More information

GENG2140 Modelling and Computer Analysis for Engineers

GENG2140 Modelling and Computer Analysis for Engineers GENG4 Moelling n Computer Anlysis or Engineers Letures 9 & : Gussin qurture Crete y Grn Romn Joles, PhD Shool o Mehnil Engineering, UWA GENG4 Content Deinition o Gussin qurture Computtion o weights n points

More information

LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION

LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION Overview LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION 4.4.1.0 Due to the omplex nture of this updte, plese fmilirize yourself with these instrutions nd then ontt RGB Spetrum Tehnil

More information

Many analog implementations of CPG exist, typically using operational amplifier or

Many analog implementations of CPG exist, typically using operational amplifier or FPGA Implementtion of Centrl Pttern Genertor By Jmes J Lin Introuction: Mny nlog implementtions of CPG exist, typiclly using opertionl mplifier or trnsistor level circuits. These types of circuits hve

More information

3.5.1 Single slit diffraction

3.5.1 Single slit diffraction 3..1 Single slit diffrction ves pssing through single slit will lso diffrct nd produce n interference pttern. The reson for this is to do with the finite width of the slit. e will consider this lter. Tke

More information

Introduction to Algebra

Introduction to Algebra INTRODUCTORY ALGEBRA Mini-Leture 1.1 Introdution to Alger Evlute lgeri expressions y sustitution. Trnslte phrses to lgeri expressions. 1. Evlute the expressions when =, =, nd = 6. ) d) 5 10. Trnslte eh

More information