On the Protection of Multicast Trees in All Optical Networks Using the NEPC Strategy

Size: px
Start display at page:

Download "On the Protection of Multicast Trees in All Optical Networks Using the NEPC Strategy"

Transcription

1 On th rottion of Multist Trs in All Optil Ntworks Using th NEC Strtgy Miklós Molnár To it this vrsion: Miklós Molnár. On th rottion of Multist Trs in All Optil Ntworks Using th NEC Strtgy. RR-11022, <lirmm > HAL I: lirmm Sumitt on 27 Jul 2011 HAL is multi-isiplinry opn ss rhiv for th posit n issmintion of sintifi rsrh oumnts, whthr thy r pulish or not. Th oumnts my om from thing n rsrh institutions in Frn or ro, or from puli or privt rsrh ntrs. L rhiv ouvrt pluriisiplinir HAL, st stiné u épôt t à l iffusion oumnts sintifiqus nivu rhrh, puliés ou non, émnnt s étlissmnts nsignmnt t rhrh frnçis ou étrngrs, s lortoirs pulis ou privés.

2 On th rottion of Multist Trs in All Optil Ntworks Using th NEC Strtgy Miklós Molnár Univrsity Montpllir 2, IUT, Dp. of Comp. Si., Lortory LIRMM - UMR CC 477, 161, ru A Montpllir Cx 5, Frn molnr@lirmm.fr Astrt. Du to th hug volum of th rri t in ll optil ntworks, th ility of ths ntworks to op with filurs oms ruil. On of th propos mhnism is th prottion of th routs (lightpths n light trs) with th hlp of promput ns rsrv kup routs prmitting to rpily hng th routs in th s of filurs. Th prottion with p-yls is n ffiint mtho, whih ws originlly propos to prott on-yl n strling links. Rntly th yli prottion ws xtn to prott nos in lightpths n in light trs. As light trs n ontin som rnhing nos whr th inoming light is spitt to svrl outgoing su trs, th prottion of ths kin of trs is mor lit. In opqu ntworks whr th swiths my virtul sours, ffiint yl-s prottion shms n omput sin h no n th sour of nwly insrt light rnhs on n ritrry promput yl. Contrrily, with th pprition of optil swiths n ll optil solutions in or ntworks, th prottion shm shoul orrspon to stringnt optil onstrints. Nmly, th rnhing nos of prottion shm must orrspon to vill splittrs. Tht is, th prottion of multist trs is limit in ll optil omins. Our ppr ims with th formultion of th potntil prottion possiilitis n giv th onitions to pply NEC s prottion. Kywors: ll optil ntwork, multisting, fult-tolrnt routing, p- yl, optil onstrint 1 Introution On th on hn, u to thy hug pity n roustnss, ll optil ntworks r oming inrsingly importnt in or ntworks. On th othr hn, in rnt multimi pplitions, th ommunitions shoul not intrrupt for long tim y filur of link or swith. A filur n implit importnt pkt losss. Sin th uplition of

3 ommunitions using inpnnt routs is xpnsiv, shr ol prottion mhnism is oftn propos s solution. With rout rstortion, whn filur is tt, nw rout to th stintion is rqust, omput n onfigur in rtiv mnnr [12]. This solution my orrspon to high rovry ly. In th s of promput prottions, th routrs n swiths rrout th ommunitions to th prplnn kup routs in s of filur [11]. So, this solution is fstr. To sussfully rirt th fft trffi, suffiint pity shoul llot to promput kup routs. rottion n it to prott som privilg trgts (links n/or nos) n n orrspon to shr prottion shm, whr sm kup possiility my prott ginst iffrnt filurs. Oftn, givn kup rsour my prott svrl primry trgt ut only on trgt t tim. In [13]th uthors stt tht shr prottion provis signifint svings ovr it prottion ut shr prottion is mor susptil to multipl link filurs thn it prottion. Oftn, to hrtriz th qulity of prottion, two msurs of solution r onsir: th rovry ly n th numr of filurs mng [4]. Morovr, th ffiiny of prottion shm n givn y th rtio of th prott primry ommunition pity n th n kup pity. It is thrfor ritil to ru th rovry ly s fr s possil. A goo nit for this rution is prottion shm s on smll yls prmitting fst lol rovris in th s of filurs. Trivilly, singl yl n not prott ginst multipl filurs ut st of yls n. Grovr n Stmtlkis propos in [7] prottion mthos s on pr-onfigur prottion yls (or p-yls) for WDM ntworks. Th p-yls offr th vntgs of oth ring n msh prottion shms. Nmly, rstortion tim n fst s in ring prottion, n prottion ffiiny n high s in msh-prottion shms. p-yls my prott not only on-yl links ut lso strling links of th yl. Morovr, yls n ppli to prform n ffiint shr prottion. To prott trffi pttrn, st of p-yls shoul omput. Sin th optiml p-yl st sign is N-hr [7], svrl huristi sign lgorithms wr propos [6] [3]. Oftn th sign of pr-onfigur prottion yl n m t th sm tim tht th primry rout sign n th optimiztion n onrn oth th primry n th kup rout sign. In ths ss th optimiztions r insprl n w tlk out joint optimiztion of th 2

4 (prott) routing shm. Consquntly if th optimiztion of th prottion shm follows th primry rout omputtion, th optimiztion is non-joint optimiztion. Link filurs r mor frqunt, ut gnrlly no filurs impt svrl ommunitions trvrsing th fil no. A no filur n quivlnt to svrl link filurs. Dit prottion shms whih offr sprt solutions for link n no filur rovry r xpnsiv. Aoringly, solutions proposing omin link n no filur rovry r mor intrsting. A goo prottion shm offrs solutions ginst oth link n no filurs. Th xtnsion of p-yl s shms for no filur prottion is on of th is proviing omin prottion. If n on-yl no is fil, thn th yl my trivilly us to prott th ommunitions trvrsing it. Th p-yl onpt ws xtn to pth sgmnt prottion ginst possil no filurs in [14] whr pity optimiztion mol ws lso vlop. Th uthors foun tht using p-yls only smll itionl spr pity is n to hiv goo no-filur prottion. No-nirling p-yls (NECs) my prott no filurs s it is xplin in first mol of th ppr [2]. A singl st of NECs ws propos for omin no n spn prottion. NECs n shr y svrl nos, n h no my us s mny iffrnt NECs s n for pity-ffiint usg of th kup pitis. A iffrnt, filur-inpnnt pth-protting p-yl shm (FI) ws propos in [9], tht xtns th p-yl onpt into pth-orint prottion. In this mnnr, FI p-yls om similr in pity ffiiny to shr-kup pth prottion (SB, f. [8]), supporting filur-inpnnt n-no tivtion n ontrol ginst ithr spn or no filur with fully pr-onnt prottion pths. Our stuy fouss on th ppliility of th NEC strtgy to prott multist light trs. 2 rottion of Multist Trs Multist prottion shms r lssifi in [25] into fiv mjor shms: tr-s, ring-s, pth-s n sgmnt-s prottions. A trivil solution for th prottion of multist tr (originlly in ATM ntworks) hs n propos in [17] s on th xtrtion of ll th pths from th root to h stintion in th multist tr n thn prott h pths with unist prottion shm. This solution 3

5 is sy to rliz in optil ntworks ut is vry xpnsiv sin th shr prottion of th ommon prt of th pths is not rsolv. A prottion shm of multist sssion ginst ny singl link filur in n optil ntwork hs n propos in [16]. A pth-pir (isjoint primry n kup pths) is omput to h stintion y th optiml pth-pir-s shr isjoint pths (O-SD) lgorithm. Th pths n shr gs with lry-xisting pth pirs n lso with othr gs on th primry tr. An improv vrsion ll ross-shring hs n propos in [15] whih improvs th kup shring. It llows to shr vill kup pitis of multipl multist sssions. ortions of kup pths of givn multist sssion not only slf-shrs with its primry tr ut lso ross-shrs with th portions of kup tr of othr sssions. A iffrnt solution for tr prottion is to omplt th primry tr y links prouing runnis n yls n protting ll links n nos in th primry tr. In [5], ul-tr shm for multist fult-tolrnt is propos. In this prottion thniqu, th primry tr lfs r intronnt without th us of ny link or innr no of th primry tr. Th otin runnt shm ontins spnning tr whih n us vn if thr r filurs. Th omputtion of g-isjoint spnning trs for primry n kup routs is lso nturl i [18]. In this s, th kup spnning tr rmins unfft vn if th primry tr is fil. Th topologil onstrint for this prottion shm is vry hr n nssitts th four-onntnss of th topologil grph. Morovr, th g-isjoint pproh os not gurnt vrtx-isjoint trs. ITo filitt th runnt multist routing th uthors in [10] propos to sign two irt r-isjoint trs ( multitr ). In this shm, if ny vrtx or g in th grph lvs, h stintion vrtx rmins to onnt to th sour y t lst on of th irt trs. Dspit th vntgs n th simpliity of this proposition, thr r som isvntgs: th kup pity is qusi-quivlnt with th primry pity n th rirtion prour my omplit n my go k to th sour. Oftn, to formult prottion propositions for optil multisting, it is suppos tht vry swith is of full wvlngth onvrsion pility n optil multisting pility (f. th onition in [20]). Ths onitions r lwys tru in opqu optil ntworks whr vry no my virtul sour. It n hoos th wvlngth ritrry to ontinu th multist forwring in vry outgoing fir. Ths onitions r 4

6 not tru in ll optil ntworks. W isuss th spifiitis of ll optil ntworks in Stion 4. As it is til in th nxt stion, p-yls n lso us with suss for multist tr prottion. 3 Cyl Bs Link/No rottion of Optil Multist Trs Th multist tr prottion y yls is s on th ft tht if link or no in th tr fils, th nighor nos of th fil lmnt my inform th ntwork ontrol pln n this lttr n initit to swith to kup pr-onfigur yls. Th prour must ronnt th isonnt prts of th fil trs y forming nw multist trs (or n quivlnt multist rout, f. ltr). Th most signifint rfrns on yl s solutions r prsnt in th following. F. Zhng n W. D. Zhong propos th pplition of p-yls to ynmi provisioning for multist sssions in WDM ntworks in [19]. Th sign of p-yl s prottion for stti survivl multist sssions ws isuss in [25] whr svrl joint n non-joint optimiztions n huristi lgorithms r ompr. In ths works, only link filurs wr onsir. In [25] n [23] Intgr Linr rogrmming (IL) s mthos n IL s huristis wr formult for optiml n qusi-optiml p-yl prottion shms rsptivly n oth in joint optimiztion n non-joint optimiztion ss. Th no nirling p-yl thniqu my ppli with suss vn if th no is rnhing no of multist light tr. Th ppr [23] propos p-yl s solution for omin no n link filur rovry whih n ppli to prott light trs. Furthr no n link filur prottion shms for multist trffi prottion using th p-yl onpt wr propos n nlyz in [21]. An ffiint huristi lgorithm for p-yl s multist tr prottion hs n propos in [20]. In this propos vrsion, p-yls prott light trs on n n-to-n sis, inst of protting h link n no. In th s of link filur, trs whih r r-isjoint with th yl, hving th sour n th stintion nos on th yl n prott. Th solution prmits th rovry ginst intrmit no filurs. Th uthors lso isuss th onitions how th fft trs n shr th prottion yls. Sin th n-to-n prottion of lrg trs ns lrg p-yls, n it my iffiult to fin this kin of p-yls, 5

7 th ppr propos tr prtition lgorithm to solv th prottion of su trs inst of th whol tr. In th prsnt p-yl s prottion shms it is lwys ssum tht vry no is of full wvlngth onvrsion pility n optil multisting pility. Morovr th light trs r irt n th yls shoul omplt th trs in th s of filur y irt pths. Th most snsil n omplit s orrspons to th filur of rnhing no of light tr. Th si i of th propositions s on no nirling n rsum s follows (suh sitution is shown in Figur 1). Th yl nirls th no whih is rnhing no in th irt tr T: thr is n nstor no of in th tr whih is lso on th yl (it is th no ) n ll of th su trs of r root y n on-yl no (th nos, n in our xmpl). Whn filur of is ourr, nw onnt light tr n otin using th rovry pity of th yl s it is init in th figur (n ritrry irt pth on th yl spnning th sussor nos of is prsnt in th xmpl). Noti tht th ntwork is n opqu ntwork n th nos, n hv multisting pility n n virtul sours of th orrsponing su trs. Fig.1. A yl my prott ginst th filur of rnhing no in multist tr in n opqu optil ntwork Originlly, th no nirling p-yl (NEC) onpts ws propos in [2]. Th yl prsnt in Figur 1 is onsir s simpl NEC. Th uthors stt if th ntwork grph is t lst two-onnt, 6

8 it is lwys possil to rw t lst on logilly nirling non-simpl yl whih n prott no filur. Suh non-simpl yl = (,,,,,f,) is prsnt in Figur 2. This kin of non-simpl NEC ws propos for no prottion in light-pths, ut th shm n pt for light trs s it is illustrt y th son prt of th figur. This figur shows th us of irt non-simpl wlk (,f,,,) longing to th non-simpl yl to stlish th prottion ginst th filur of no. Evn if th sm wvlngth is us in th multist tr n in th kup multist rout, this wvlngth n ross swith from iffrnt inoming ports to iffrnt outgoing ports, n th illustrt non-trivil multist rout n stlish ftr th rovry. Th finlly otin kup strutur is not light tr ut light hirrhy whih hs n propos in [26]. f f Fig.2. A non-simpl NEC whih my prott ginst th filur of rnhing no Trivilly, in n opqu ntwork p-yl my rovr th filur of rnhing no, vn if th fil no is on th yl. Th onition of th rovry is tht ll su trs of th fil no must ontin ommon no (sussor of th prott rnhing no) on th yl. Suh sitution is illustrt y Figur 3 (th yl in ott lin psss through th no ). roprty 1. A yl is n NEC (simpl or not) n n us to rovr th filur of th nirl no iff ll th nighor nos of r in th yl. 7

9 Fig.3. In n opqu optil ntwork, yl my prott ginst th filur of n on-yl rnhing no Noti tht th sgmnts (,), (,), (,), (,),... n ontin intrnl nos whih r not stintions nor rnhing nos. To simplify, w suppos tht thy r simpl links. To otin mor lrg prott prts, p-yl n offr th prottion ginst th filur of nos n links of n nirl su tr s it is init in Figur 4 (in this s, th yl is not n NEC nirling only on no). Noti tht th nirl su tr must fr of stintions. If thr is stintion in th su tr, th rovry s on th yl n rgring th irtion of th links in th su tr n not ssum th onntion to this stintion no. If th wist, th yl s prottion n ppli from th sour no n n onrn th stintions on th yl s it is th s of th filur inpnnt pth-protting (FI) p-yl pprohs ppli for multist trs [21]. In ll ss, th nirl su tr n not ontin ny stintion, only th on-yl stintions n th stintions tht r outsi th yl n simply prott. Oviously, mor th prott prt n th yl r wi, mor th ronfigurtion is omplit n slow. Morovr, only th intrmit no filurs n rovr y th yl n sour n stintion no filurs nnot rstor y ny prottion lgorithm. Th sour no prottion nssitts th uplition of th sour s it is xplin in [22]. For th prviously prsnt yl-s prottions, opqu ntworks with multist pl nos wr suppos. In th following, w nlyz 8

10 f Fig.4. A yl my prott ginst th filur of ny link n no of su tr limit y it th light tr prottion possiilitis y NECs in ll optil ntworks whr th optil swiths o not oligtory ontin splittrs. 4 rottion of Brnhing Nos of Light Trs unr Optil Constrints In trnsprnt ll optil ntworks, whr th nos r optil swiths n th O/E/O onvrsion in ths swiths is not sirl, th multist routing must stisfy itionl optil onstrints. All of th optil swiths n not split th inoming light. To prform th multist routing with light tr, th rnhing nos of th tr must oini with swiths hving spil light splittrs. In ition to th uniqunss of th wvlngth in th firs, th sm wvlngth shoul us long th light-pths n light trs. Th wvlngth n only hng if thr is wvlngth onvrtr in th trvrs optil swith. Sin our nlyz prolm fouss on th sprs splitting onstrints for th multist routing, without loss of gnrlity, w suppos tht thr r no onvrtrs in th ntwork (in th rnt stuy, th onflits on th wvlngth ssignmnt r not nlyz). Hr, w fous on th first, strong onstrint orrsponing to th splitting pity of th optil swiths. In ll optil ntworks, no 9

11 pl to split th inoming light is ll s Multist Cpl (MC) no, othrwis it is Multist Inpl (MI) no [24]. On n suppos tht ny no (lso n MI no) t lst hs th Tp n Continu ility to tp into th inoming signl for lol usg n forwr it to only on output [1]. So, ny no n n intrmit stintion on light tr ut only th MC nos n rnhing nos. Svrl propositions hv n formult to omput light trs orrsponing to ths onstrints (f. Rrout-to-Sour, Rrout-to-Any, Mmr-First n Mmr-Only lgorithms in [24]). Typilly, if thr is not singl light tr stisfying th onstrints, st of trs ( lightforst ) is omput orrsponing to thm. As rsult of th onstrints, not only th primry light trs ut lso th kup routs otin ftr th rovry must stisfy th mntion onitions. Tht is, ftr th rovry, th vntul rnhing nos of th nw light tr must orrspon to splittrs (to simplify, t first tim, w suppos tht th nw optil rout ftr th rovry lso orrspons to light tr). Unfortuntly, th splittrs my sprs in n ll optil ntwork. In som ss, pning on th ntwork topology, on th vilility of th splittrs n on th lotion of th primry light trs, som of th lttr n not prott y th NEC thniqu s it is illustrt y Figur 5. In th figurs, th MI nos r rprsnt y squrs n th MC nos r irls. Sin th nos, n r MI nos, nw optil multist rout ovring ll of th su trs of th no n rspting th onstrints on th splittrs n not uilt whn th no is fil. Figur 6 prsnts two iffrnt rprtitions of th multist pl nos in th sm ntwork n for th sm light tr. In ths nw situtions, th prottion with th hlp of th ylginst th filur of no is possil u to th onnt MC nos. Our prinipl qustion is th following: Whn is it possil th prottion of rnhing no of light tr using th pity of n no nirling p-yl? Th following proposition givs nssry n suffiint onition for this prottion. Rmmr, thr is no wvlngth onvrsion in th ntwork n th sm wvlngth shoul us ftr th rovry. Lt G = (V,E) n unirt grph rprsnting th ll optil ntwork topology with two typ of nos. Lt T = (W,F) light tr n rnhing no in th tr. Lt n NEC nirling in th topology grph. To simplify w not lso y th st of nos on th yl. Lt S = W \{} th st of nos in th intrstion of th tr 10

12 MI no MC no Fig.5. A onfigurtion of MC n MI typ nos on th yl whih os not prmit th prottion ginst th filur of th rnhing no of multist tr Fig.6. A yl whih my prott ginst th filur of rnhing no in multist tr ppli in n ll optil ntwork n th yl xpt (s is n NEC, S orrspons to th nighor nos of in th tr T). Noti tht th p-yl my ontin svrl nos whih r not in S. Ths nos r only rly nos in th s of filur rovry n so thy r not rlvnt for us. Our nlysis fouss on th nos in S. At first, w giv th onition to prott rnhing no with simpl NEC ginst filur. 11

13 roposition 1. A simpl NEC n prott ginst th filur of th no, iff it ontins pth ovring th no st S suh tht os not ontins ny intrnl no of typ MI longing to S. roof. Lt us suppos tht to prott th tr T ginst th filur of, su-pth of th yl is us ftr th rovry. In th nw optil multist rout (in th nw light tr), trivilly, th xtrmitis of th pth hv gr 2 (n so ths nos n MI or MC nos) ut th intrnl nos longing to S shoul rnhing nos hving on or mor su trs whih shoul onnt to th sour). Th onition is nssry. Lt us suppos tht ll pths in n ovring th no st S ontin n MI typ intrnl no. Without loss of gnrlity, lt suh pth n lt v S th MI typ intrnl no in this pth. v sprts th nos of S into two non mpty no sts n th pth into two su pths. To otin th onntivity of th two su pths n lso th su trs root in v, v shoul hv gr 3 or mor ftr th rovry, ut v is of MI. Th onition is suffiint. If thr is pth suh tht h intrnl no of longing to S is n MC no, thn ths nos n th nw rnhing nos of th kup multist strutur. A non-simpl NEC n xtn th prottion ginst rnhing no filur of multist tr. Th iffrn twn simpl n nonsimpl yls is tht non-simpl yls MAY ontin svrl tims sm no ( sm no n hv svrl ourrns in th yl). So, th onnt susts of th non-simpl yl r not oligtory pths ut my wlks rturning svrl tims t sm no. To stisfy th onstrints on th vilility of splittrs, ll th no ourrns in th wlks shoul onsir. Figur 7 illustrts two ss, whr nonsimpl NEC n us for th prottion. In th first xmpl, th non-simpl NEC = (,,,,,f,) n prott th rnhing no (ll of th nighor nos of r on this non-simpl yl). In this yl, two firs twn th nos n r rsrv. Th nos n r MI nos. Thr is no simpl pth in th yl stisfying th prvious onition (f. roposition 1). Th figur init how th wlk (,,,,) in this yl n us to rt kup light hirrhy to rovr th filur. As it ws shown in th simpl s, th xtrmitis of th wlk (th nos n ) hv gr 2. Th prtiulrity of this prottion is tht th no is prsnt twi in th wlk. Byon th ourrn orrsponing to n xtrmity of th ppli wlk, th 12

14 othr ourrn of this no is simpl rly no in th otin light hirrhy. Th gr 2 of h ourrn orrspons to th ft tht it is n MI no. Aftr th filur rovry, th optil swith is trvrs twi: t first from to n sonly from to its singl xisting su tr. Of ours, s is n MI no, it n hv only on su tr in th primry tr. Finlly, th gr of h no ourrn orrspons to th typ of th givn no (MC or MI). Th son xmpl in th figur proposs n othr non-simpl NEC = (,,,f,,,,) using two firs twn th nos n n lso twn n f. To rovr th filur of th no in th init tr ( hs four sussors in th tr:,, n f), for instn, th wlk (,,,f,,,) n propos. Th wlk rturns thr tims to th no n h ourrn of in th rsult light hirrhy hs gr 2. Ths rturns using th wlk r lso illustrt in Figur 8. Th gnrliztion of th rsults is summriz y th following. f f Fig. 7. Non-simpl NECs prmit th prottion ginst th filur of th rnhing no using wlks on th NEC roposition 2. A non-simpl NEC n prott ginst th filur of th nirl rnhing no, if it ontins wlk ovring th nighor no st S of suh tht th intrnl MI nos longing to S in hv lso n xtrmity ourrn of. In othr worl: n MI typ no n rpt in th wlk svrl tims, if it lso hs n xtrmity ourrn in th wlk. 13

15 su tr f su tr su tr su tr Fig.8. Th til wlk of th son xmpl roof. Lt us suppos tht to prott th tr T ginst th filur of, wlk in th non-simpl yl is ppli. Rmmr tht in wlk, no my ppr svrl tims (svrl ourrns of th no my long to th wlk). In th nw optil multist rout (in th nw otin light hirrhy), trivilly, th xtrmitis of th wlk hv gr 2. Th intrnl nos of longing to S r ithr rnhing MC nos hving on or mor su trs or thy r simpl rly nos. Lt s i ns n intrnl rly no, n lt T s its su tr in th originl multist tr. Lt us suppos tht s hs rly no ourrn in pth. Thr is two ss: 1. This no s hs n ourrn in th wlk lot t th xtrmity of th wlk. This xtrmity no ourrn n onnt th su tr T s to th nw multist rout. 2. Thr is no xtrmity no ourrn orrsponing to s. In this s, th su tr T s n not onnt to th nw multist rout. Th onition is nssry (f. 2). Th onition is suffiint. If it is tru, ll of th su trs longing to th nos in S n onnt to th nw multist rout. Trivilly, s wlk hs two xtrmitis, only ourrns of ths two nos (if thy r MI nos) n rpt in th wlk us to rovr th no filur. 14

16 5 A rtiulr rottion Shm Using Non-Simpl Cyls Non-simpl yls xtn th prottion possiilitis of rnhing nos in ll optil light trs. In th prviously prsnt yl-s prottion shms, th yl (simpl or not) is us to th filur rovry in th following mnnr. If no filur ours, thn squn of som onsutiv nos in th yl (i.. wlk) is us to r-onnt th su trs of th fil optil multist tr. Lt = (x 1,x 2,x 3,...,x n,x 1 ) yl (rprsnt y irulr list of nos) with n no ourrns (if th yl is non-simpl yl, thn svrl ourrns orrspon to sm no of th topology grph). Th wlk us for th prottion n n ritrry squn of ths no ourrns of th irulr list stisfying th prviously mntion onitions. Evntul rturns to som nos in th yl prmit iffrnt n mor flxil (ut mor omplit) prottion of th nirl rnhing no. In th following, w prsnt spil s s on prtiulr non-simpl yl. This xmpl lso illustrts th prottion pilitis of th non-simpl yls. A prtiulr prottion shm n propos whn non-simpl NEC is ompos using two firs (on in oth irtions) twn th onnt no pirs in th yl. Figur 9 shows suh n NEC n its propos utiliztion for th filur rovry. Thr r multipl MI nos in th yl, ut MC n MI typ nos ltrnt whih prmit th prottion using th prsnt NEC in prtiulr mnnr. In th following proposition, w suppos tht th links longing to p-yl n us ritrrily for th prottion. Tht is, n ritrry onnt sust of th links (n not only pth or wlk) n srv th prottion. roposition 3. Lt non-simpl NEC systmtilly ompos from two firs twn th onrn (nighor) nos. It n prott ginst th filur of th nirl no if it ontins pth ovring th no st S of nighors suh tht th pth os not ontin squn of thr sussiv intrnl MI nos longing to S. roof. Eh no s in S hs t lst on su tr T s root in s whih must r-onnt to th sour ftr th filur rovry. Trivilly, if s is n MI no, it hs only on su tr in th originl multist tr. Morovr, h no ourrn of n MI no n hv gr 2 in th rovry strutur. Contrrily, th MC nos n rnhing nos ftr th rovry. 15

17 f f Fig. 9. A prtiulr non-simpl NEC n its usg for th prottion ginst th filur of th rnhing no using prtiulr wlk on th NEC Th pitis in th mntion NEC n llot to th filur rovry s follows. From th sour, th visit MC nos longing to S r rnhing nos. Lt us suppos tht n intrnl MI typ no s is rly no in th NEC. Rmmr tht th uniqu su tr T s n not onnt to th kup strutur y this no ourrn of s. To this, th kup strutur must rturn to s from n othr visit no. If ontins thr sussiv intrnl MI nos longing to S, n thr is no MC no twn thm, th rturn to th mil MI no in S is not possil using th yl. Lt s 1, s 2 n s 3 th thr sussiv MI nos in th yl (f. Figur 10). In th st s, th su trs of s 1 n s 3 r onnt to th rovry strutur using inoming links (l 01 n l 43 ) s it is illustrt. Morovr, pth from s 1 to s 3 must us to onnt th two prts of th multist routs. Sin s 1, s 2 n s 3 r MI nos, th mil no s 2 n rly no in this pth ut n not rnhing no. Its su tr n not onnt to th multist rout using th in-yl links. If thr is t lst on MC no (nm t) ithr from s i to th nxt MI no in S or for s i, thn this no t oms rnhing no n th not yt us pth from t to s i n onnt th su tr of s i to th kup strutur. Figur 11 illustrts two yls: on with fsil n nothr with not fsil squn of nos. 16

18 l 01 l 12 l 23 l 34 l 10 s 1 l 21 S2 l 32 S3 l 43 su tr su tr su tr Fig.10. Th su tr of th mil MI no n not onnt to th rovry strutur Th prtiulrity of this prottion is tht it uss not only pth or wlk in th yl ut lso othr rlt links whih r onnt to th si pth. So, th onfigurtion of th prottion onrns not only th onfigurtion of th nos following th wlk or th pth shm ut it is omplt with som itionl onfigurtions. Th otin kup strutur is light hirrhy using th pitis of iffrnt in-yl links. f g f g?? Fig.11. A fsil n not fsil squn of nos in n NEC using kup hirrhy on th yl 6 rsptivs In this stuy, w prsnt th onitions how NEC n us to prott light trs ginst rnhing no filurs in ll optil WDM ntworks. Th most importnt ontriution of this work is simpl: th kup multist rout must orrspon to th wll known optil onstrints. W nlyz th onstrint impos y spr splitting pitis in th ntwork. Th rnhing nos of th kup rout must MC nos. 17

19 WlsoprsnthownonsimplNECsnpplitothfilur rovry. Oftn, this pplition lvs to th formultion of kup light hirrhis. Thy xtn th prottion possiilitis ut th onfigurtion of ths hirrhis is mor omplit. Th nlysis of th prottion of multist routs in ll optil ntworks ns intnsiv futur works. In rl ll optil ntworks, ll of th fsil light trs n not prott ginst rnhing no filurs. A p nlysis of ntwork topologis from th point of viw of th no prottion is n. Th prottion strtgy n iffrnt from th NEC s prottion. Diffrnt strtgis shoul nlyz. Rfrns 1. M. Ali n J. Dogun. Cost-fftiv implmnttion of multisting in wvlngthrout ntworks. IEEE J. Lightwv Thnol., Spil Issu on Optil Ntworks, vol. 18(12):pp , J. Doutt,. A. Gis, n W. D. Grovr. Comin No n Spn rottion Strtgis with No-Enirling p-cyls. In Intrntionl Workshop on Dsign of Rlil Communition Ntworks (DRCN), pp J. Doutt, D. H, W. D. Grovr, n O. Yng. Algorithmi Approhs for Effiint Enumrtion of Cnit p-cyls n Cpitt p-cyl Ntwork Dsign. In Fourth Intrntionl Workshop on th Dsign of Rlil Communition Ntworks (DRCN), pp J. Duto. A Thory of Fult-Tolrnt Routing in Wormhol Ntworks. IEEE Trns. rlll Distri. Syst., vol. 8:pp , A. Fi, J. Cui, M. Grl, n D. Cvnish. A Dul-Tr Shm for Fult- Tolrnt Multist. In IEEE Intrntionl Confrn on Communitions W. D. Grovr n J. Doutt. Avns in optil ntwork sign with p-yls: Joint optimiztion n pr-sltion of nit p-yls. In IEEE-LEOS Summr Topil Mting on All Optil Ntworking, pp. WA2 49 WA W. D. Grovr n D. Stmtlkis. Cyl-Orint Distriut ronfigurtion: Ring-lik Sp with Msh-lik Cpity for Slf-plnning Ntwork Rstortion. In ICC 98. Intrntionl Confrn on Communitions., pp IEEE, S. Kini, M. Koilm, T. V. Lkshm, S. Sngupt, n C. Villmizr. Shr kup ll swith pth rstortion. rft-kini-rstortion-shr-kup-01, IETF, A. Koin n W. D. Grovr. Filur-Inpnnt th-rotting p-cyls: Effiint n Simpl Fully ronnt Optil-th rottion. J. Lightwv Thnol., vol. 23(10):p. 3241, M. Mr, S. G. Finn, R. A. Brry, n R. G. Gllgr. Runnt trs for prplnn rovry in ritrry vrtx-runnt or g-runnt grphs. IEEE/ACM Trnstions on Ntworking, vol. 7:pp , S. Rmmurthy n B. Mukhrj. Survivl WDM Msh Ntworks, rt I- rottion. In INFOCOM 99. Eightnth Annul Joint Confrn of th IEEE Computr n Communitions Soitis. roings., vol. 2, pp IEEE,

20 12. S. Rmmurthy n B. Mukhrj. Survivl WDM Msh Ntworks, rt II- Rstortion. In ICC 99. Intrntionl Confrn on Communitions., vol. 3, pp IEEE, S. Rmmurthy, L. Shsruh, n B. Mukhrj. Survivl WDM Msh Ntworks. J. Lightwv Thnol., vol. 21(4):pp , G. X. Shn n W. D. Grovr. Extning th p-yl onpt to pth sgmnt prottion for spn n no filur rovry. IEEE J. Sl. Ars. Commun., vol. 21(8):pp , N. K. Singhl, C. Ou, n B. Mukhrj. Cross-shring vs. slf-shring trs for protting multist sssions in msh ntworks. Computr Ntworks, vol. 50(2):pp , N. K. Singhl, L. H. Shsruh, n B. Mukhrj. rovisioning of Survivl Multist Sssions Aginst Singl Link Filurs in Optil WDM Msh Ntworks. J. Lightwv Thnol., vol. 21(11):pp , C.-S. Wu n S.-W. L. Bkup V plnning for multist onntions in ATM ntworks. Computr Communitions, vol. 22(10):pp , B. Ynr, Y. Offk, n M. Yung. Dsign n prformn of onvrgn routing on multipl spnning trs. In IEEE GLOBECOM 94, vol. 1, pp F. Zhng n W.-D. Zhong. Applying p-cyls in Dynmi rovisioning of Survivl Multist Sssions in Optil WDM Ntworks. In Confrn on Optil Fir Communition n th Ntionl Fir Opti Enginrs Confrn, OFC/NFOEC 2007., pp IEEE Computr Soity, Wshington, DC, USA, F. Zhng n W.-D. Zhong. p-yl s tr prottion of optil multist trffi for omin link n no filur rovry in WDM msh ntworks. Comm. Lttrs., vol. 13:pp , F. Zhng n W.-D. Zhong. rformn Evlution of Optil Multist rottion Approhs for Comin No n Link Filur Rovry. J. Lightwv Thnol., vol. 27(18):pp , F. Zhng n W.-D. Zhong. Extning p-yls to Sour Filur Rovry for Optil Multist Mi Trffi. J. Opt. Commun. Ntw., vol. 2(10):pp , F. Zhng, W.-D. Zhong, n Y. Jin. Optimiztions of $p$-cyl-bs rottion of Optil Multist Sssions. J. Lightwv Thnol., vol. 26(19):pp , X. Zhng, J. Wi, n C. Qio. Constrin Multist Routing in WDM Ntworks with Sprs Light Splitting. IEEE J. Lightwv Thnol., vol. 18(12):pp , W.-D. Zhong, F. Zhng, n Y. Jin. Optimiz Dsigns of p-cyls for Survivl Multist Sssions in Optil WDM Ntworks. In Son Intrntionl Confrn on Communitions n Ntworking in Chin, CHINACOM 07, pp IEEE Computr Soity, Wshington, DC, USA, F. Zhou, M. Molnr, n B. Cousin. Light-Hirrhy: Th Optiml Strutur for Multist Routing in WDM Msh Ntworks. In Computrs n Communitions (ISCC), 2010 IEEE Symposium on Th 15th IEEE Symposium on Computrs n Communitions (ISCC2010), 2010, pp Riion Itli,

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura Moul grph.py CS 231 Nomi Nishimur 1 Introution Just lik th Python list n th Python itionry provi wys of storing, ssing, n moifying t, grph n viw s wy of storing, ssing, n moifying t. Bus Python os not

More information

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018 CSE 373: Mor on grphs; DFS n BFS Mihl L Wnsy, F 14, 2018 1 Wrmup Wrmup: Disuss with your nighor: Rmin your nighor: wht is simpl grph? Suppos w hv simpl, irt grph with x nos. Wht is th mximum numr of gs

More information

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph Intrntionl J.Mth. Comin. Vol.1(2014), 80-86 Algorithmi n NP-Compltnss Aspts of Totl Lit Domintion Numr of Grph Girish.V.R. (PES Institut of Thnology(South Cmpus), Bnglor, Krntk Stt, Ini) P.Ush (Dprtmnt

More information

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs. Pths.. Eulr n Hmilton Pths.. Pth D. A pth rom s to t is squn o gs {x 0, x 1 }, {x 1, x 2 },... {x n 1, x n }, whr x 0 = s, n x n = t. D. Th lngth o pth is th numr o gs in it. {, } {, } {, } {, } {, } {,

More information

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

CSC Design and Analysis of Algorithms. Example: Change-Making Problem CSC 801- Dsign n Anlysis of Algorithms Ltur 11 Gry Thniqu Exmpl: Chng-Mking Prolm Givn unlimit mounts of oins of nomintions 1 > > m, giv hng for mount n with th lst numr of oins Exmpl: 1 = 25, 2 =10, =

More information

Present state Next state Q + M N

Present state Next state Q + M N Qustion 1. An M-N lip-lop works s ollows: I MN=00, th nxt stt o th lip lop is 0. I MN=01, th nxt stt o th lip-lop is th sm s th prsnt stt I MN=10, th nxt stt o th lip-lop is th omplmnt o th prsnt stt I

More information

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem) 12/3/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 Ciruits Cyl 2 Eulr

More information

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs Prt 10. Grphs CS 200 Algorithms n Dt Struturs 1 Introution Trminology Implmnting Grphs Outlin Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 2 Ciruits Cyl A spil yl

More information

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari Grphs CSC 1300 Disrt Struturs Villnov Univrsity Grphs Grphs r isrt struturs onsis?ng of vr?s n gs tht onnt ths vr?s. Grphs n us to mol: omputr systms/ntworks mthm?l rl?ons logi iruit lyout jos/prosss f

More information

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} s s of s Computr Sin & Enginring 423/823 Dsign n Anlysis of Ltur 03 (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) s of s s r strt t typs tht r pplil to numrous prolms Cn ptur ntitis, rltionships twn

More information

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)} Introution Computr Sin & Enginring 423/823 Dsign n Anlysis of Algorithms Ltur 03 Elmntry Grph Algorithms (Chptr 22) Stphn Sott (Apt from Vinohnrn N. Vriym) I Grphs r strt t typs tht r pplil to numrous

More information

0.1. Exercise 1: the distances between four points in a graph

0.1. Exercise 1: the distances between four points in a graph Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 pg 1 Mth 707 Spring 2017 (Drij Grinrg): mitrm 3 u: W, 3 My 2017, in lss or y mil (grinr@umn.u) or lss S th wsit or rlvnt mtril. Rsults provn in th nots, or in

More information

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1. Why th Juntion Tr lgorithm? Th Juntion Tr lgorithm hris Willims 1 Shool of Informtis, Univrsity of Einurgh Otor 2009 Th JT is gnrl-purpos lgorithm for omputing (onitionl) mrginls on grphs. It os this y

More information

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology! Outlin Computr Sin 331, Spnnin, n Surphs Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #30 1 Introution 2 3 Dinition 4 Spnnin 5 6 Mik Joson (Univrsity o Clry) Computr Sin 331 Ltur #30 1 / 20 Mik

More information

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem) 4/25/12 Outlin Prt 10. Grphs CS 200 Algorithms n Dt Struturs Introution Trminology Implmnting Grphs Grph Trvrsls Topologil Sorting Shortst Pths Spnning Trs Minimum Spnning Trs Ciruits 1 2 Eulr s rig prolm

More information

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1 CSC 00 Disrt Struturs : Introuon to Grph Thory Grphs Grphs CSC 00 Disrt Struturs Villnov Univrsity Grphs r isrt struturs onsisng o vrs n gs tht onnt ths vrs. Grphs n us to mol: omputr systms/ntworks mthml

More information

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12 Aministrivi: CS61B Ltur #33 Autogrr will run this vning. Toy s Rings: Grph Struturs: DSIJ, Chptr 12 Lst moifi: W Nov 8 00:39:28 2017 CS61B: Ltur #33 1 Why Grphs? For xprssing non-hirrhilly rlt itms Exmpls:

More information

12. Traffic engineering

12. Traffic engineering lt2.ppt S-38. Introution to Tltrffi Thory Spring 200 2 Topology Pths A tlommunition ntwork onsists of nos n links Lt N not th st of nos in with n Lt J not th st of nos in with j N = {,,,,} J = {,2,3,,2}

More information

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management nrl tr T is init st o on or mor nos suh tht thr is on sint no r, ll th root o T, n th rminin nos r prtition into n isjoint susts T, T,, T n, h o whih is tr, n whos roots r, r,, r n, rsptivly, r hilrn o

More information

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2

Graph Isomorphism. Graphs - II. Cayley s Formula. Planar Graphs. Outline. Is K 5 planar? The number of labeled trees on n nodes is n n-2 Grt Thortil Is In Computr Sin Vitor Amhik CS 15-251 Ltur 9 Grphs - II Crngi Mllon Univrsity Grph Isomorphism finition. Two simpl grphs G n H r isomorphi G H if thr is vrtx ijtion V H ->V G tht prsrvs jny

More information

Constructive Geometric Constraint Solving

Constructive Geometric Constraint Solving Construtiv Gomtri Constrint Solving Antoni Soto i Rir Dprtmnt Llngutgs i Sistms Inormàtis Univrsitt Politèni Ctluny Brlon, Sptmr 2002 CGCS p.1/37 Prliminris CGCS p.2/37 Gomtri onstrint prolm C 2 D L BC

More information

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes. Nm: UCA ID Numr: Stion lttr: th 61 : Disrt Struturs Finl Exm Instrutor: Ciprin nolsu You hv 180 minuts. No ooks, nots or lultors r llow. Do not us your own srth ppr. 1. (2 points h) Tru/Fls: Cirl th right

More information

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013 CS Avn Dt Struturs n Algorithms Exm Solution Jon Turnr //. ( points) Suppos you r givn grph G=(V,E) with g wights w() n minimum spnning tr T o G. Now, suppos nw g {u,v} is to G. Dsri (in wors) mtho or

More information

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality: CS2: Grphs Prihr Ch. 4 Rosn Ch. Grphs A olltion of nos n gs Wht n this rprsnt? n A omputr ntwork n Astrtion of mp n Soil ntwork CS2 - Hsh Tls 2 Dirt Grphs Grphs/Ntworks Aroun Us A olltion of nos n irt

More information

Register Allocation. Register Allocation. Principle Phases. Principle Phases. Example: Build. Spills 11/14/2012

Register Allocation. Register Allocation. Principle Phases. Principle Phases. Example: Build. Spills 11/14/2012 Rgistr Allotion W now r l to o rgistr llotion on our intrfrn grph. W wnt to l with two typs of onstrints: 1. Two vlus r liv t ovrlpping points (intrfrn grph) 2. A vlu must or must not in prtiulr rhitturl

More information

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V Unirt Grphs An unirt grph G = (V, E) V st o vrtis E st o unorr gs (v,w) whr v, w in V USE: to mol symmtri rltionships twn ntitis vrtis v n w r jnt i thr is n g (v,w) [or (w,v)] th g (v,w) is inint upon

More information

Multipoint Alternate Marking method for passive and hybrid performance monitoring

Multipoint Alternate Marking method for passive and hybrid performance monitoring Multipoint Altrnt Mrkin mtho or pssiv n hyri prormn monitorin rt-iool-ippm-multipoint-lt-mrk-00 Pru, Jul 2017, IETF 99 Giuspp Fiool (Tlom Itli) Muro Coilio (Tlom Itli) Amo Spio (Politnio i Torino) Riro

More information

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS OMPLXITY O OUNTING PLNR TILINGS Y TWO RS KYL MYR strt. W show tht th prolm o trmining th numr o wys o tiling plnr igur with horizontl n vrtil r is #P-omplt. W uil o o th rsults o uquir, Nivt, Rmil, n Roson

More information

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim's Alorithm Introution Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #33 3 Alorithm Gnrl Constrution Mik Joson (Univrsity o Clry)

More information

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review rmup CSE 7: AVL trs rmup: ht is n invrint? Mihl L Friy, Jn 9, 0 ht r th AVL tr invrints, xtly? Disuss with your nighor. AVL Trs: Invrints Intrlu: Exploring th ln invrint Cor i: xtr invrint to BSTs tht

More information

COMP108 Algorithmic Foundations

COMP108 Algorithmic Foundations Grdy mthods Prudn Wong http://www.s.liv..uk/~pwong/thing/omp108/01617 Coin Chng Prolm Suppos w hv 3 typs of oins 10p 0p 50p Minimum numr of oins to mk 0.8, 1.0, 1.? Grdy mthod Lrning outoms Undrstnd wht

More information

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp CSE 373 Grphs 1: Conpts, Dpth/Brth-First Srh ring: Wiss Ch. 9 slis rt y Mrty Stpp http://www.s.wshington.u/373/ Univrsity o Wshington, ll rights rsrv. 1 Wht is grph? 56 Tokyo Sttl Soul 128 16 30 181 140

More information

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s? MATH 3012 Finl Exm, My 4, 2006, WTT Stunt Nm n ID Numr 1. All our prts o this prolm r onrn with trnry strings o lngth n, i.., wors o lngth n with lttrs rom th lpht {0, 1, 2}.. How mny trnry wors o lngth

More information

CS 241 Analysis of Algorithms

CS 241 Analysis of Algorithms CS 241 Anlysis o Algorithms Prossor Eri Aron Ltur T Th 9:00m Ltur Mting Lotion: OLB 205 Businss HW6 u lry HW7 out tr Thnksgiving Ring: Ch. 22.1-22.3 1 Grphs (S S. B.4) Grphs ommonly rprsnt onntions mong

More information

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs Outlin Computr Sin 33 Computtion o Minimum-Cost Spnnin Trs Prim s Mik Joson Dprtmnt o Computr Sin Univrsity o Clry Ltur #34 Introution Min-Cost Spnnin Trs 3 Gnrl Constrution 4 5 Trmintion n Eiiny 6 Aitionl

More information

CS 461, Lecture 17. Today s Outline. Example Run

CS 461, Lecture 17. Today s Outline. Example Run Prim s Algorithm CS 461, Ltur 17 Jr Si Univrsity o Nw Mxio In Prim s lgorithm, th st A mintin y th lgorithm orms singl tr. Th tr strts rom n ritrry root vrtx n grows until it spns ll th vrtis in V At h

More information

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008 Th Univrsity o Syny MATH2969/2069 Grph Thory Tutoril 5 (Wk 12) Solutions 2008 1. (i) Lt G th isonnt plnr grph shown. Drw its ul G, n th ul o th ul (G ). (ii) Show tht i G is isonnt plnr grph, thn G is

More information

Efficient Broadcast in MANETs Using Network Coding and Directional Antennas

Efficient Broadcast in MANETs Using Network Coding and Directional Antennas Effiint Brost in MANETs Using Ntwork Coing n Dirtionl Antnns Shuhui Yng Dprtmnt of Computr Sin Rnsslr Polythni Institut Troy, NY 28 Ji Wu n Mihl Cri Dprtmnt of Computr Sin n Enginring Flori Atlnti Univrsity

More information

Announcements. Not graphs. These are Graphs. Applications of Graphs. Graph Definitions. Graphs & Graph Algorithms. A6 released today: Risk

Announcements. Not graphs. These are Graphs. Applications of Graphs. Graph Definitions. Graphs & Graph Algorithms. A6 released today: Risk Grphs & Grph Algorithms Ltur CS Spring 6 Announmnts A6 rls toy: Risk Strt signing with your prtnr sp Prlim usy Not grphs hs r Grphs K 5 K, =...not th kin w mn, nywy Applitions o Grphs Communition ntworks

More information

Planar Upward Drawings

Planar Upward Drawings C.S. 252 Pro. Rorto Tmssi Computtionl Gomtry Sm. II, 1992 1993 Dt: My 3, 1993 Sri: Shmsi Moussvi Plnr Upwr Drwings 1 Thorm: G is yli i n only i it hs upwr rwing. Proo: 1. An upwr rwing is yli. Follow th

More information

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1 Solutions for HW Exris. () Us th rurrn rltion t(g) = t(g ) + t(g/) to ount th numr of spnning trs of v v v u u u Rmmr to kp multipl gs!! First rrw G so tht non of th gs ross: v u v Rursing on = (v, u ):

More information

1 Introduction to Modulo 7 Arithmetic

1 Introduction to Modulo 7 Arithmetic 1 Introution to Moulo 7 Arithmti Bor w try our hn t solvin som hr Moulr KnKns, lt s tk los look t on moulr rithmti, mo 7 rithmti. You ll s in this sminr tht rithmti moulo prim is quit irnt rom th ons w

More information

Section 10.4 Connectivity (up to paths and isomorphism, not including)

Section 10.4 Connectivity (up to paths and isomorphism, not including) Toy w will isuss two stions: Stion 10.3 Rprsnting Grphs n Grph Isomorphism Stion 10.4 Conntivity (up to pths n isomorphism, not inluing) 1 10.3 Rprsnting Grphs n Grph Isomorphism Whn w r working on n lgorithm

More information

Analysis for Balloon Modeling Structure based on Graph Theory

Analysis for Balloon Modeling Structure based on Graph Theory Anlysis for lloon Moling Strutur bs on Grph Thory Abstrt Mshiro Ur* Msshi Ym** Mmoru no** Shiny Miyzki** Tkmi Ysu* *Grut Shool of Informtion Sin, Ngoy Univrsity **Shool of Informtion Sin n Thnology, hukyo

More information

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely . DETERMINANT.. Dtrminnt. Introution:I you think row vtor o mtrix s oorint o vtors in sp, thn th gomtri mning o th rnk o th mtrix is th imnsion o th prlllppi spnn y thm. But w r not only r out th imnsion,

More information

Garnir Polynomial and their Properties

Garnir Polynomial and their Properties Univrsity of Cliforni, Dvis Dprtmnt of Mthmtis Grnir Polynomil n thir Proprtis Author: Yu Wng Suprvisor: Prof. Gorsky Eugny My 8, 07 Grnir Polynomil n thir Proprtis Yu Wng mil: uywng@uvis.u. In this ppr,

More information

Numbering Boundary Nodes

Numbering Boundary Nodes Numring Bounry Nos Lh MBri Empori Stt Univrsity August 10, 2001 1 Introution Th purpos of this ppr is to xplor how numring ltril rsistor ntworks ffts thir rspons mtrix, Λ. Morovr, wht n lrn from Λ out

More information

Trees as operads. Lecture A formalism of trees

Trees as operads. Lecture A formalism of trees Ltur 2 rs s oprs In this ltur, w introu onvnint tgoris o trs tht will us or th inition o nroil sts. hs tgoris r gnrliztions o th simpliil tgory us to in simpliil sts. First w onsir th s o plnr trs n thn

More information

A Low Noise and Reliable CMOS I/O Buffer for Mixed Low Voltage Applications

A Low Noise and Reliable CMOS I/O Buffer for Mixed Low Voltage Applications Proings of th 6th WSEAS Intrntionl Confrn on Miroltronis, Nnoltronis, Optoltronis, Istnul, Turky, My 27-29, 27 32 A Low Nois n Rlil CMOS I/O Buffr for Mix Low Voltg Applitions HWANG-CHERNG CHOW n YOU-GANG

More information

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms rp loritms lrnin ojtivs loritms your sotwr systm sotwr rwr lrn wt rps r in mtmtil trms lrn ow to rprsnt rps in omputrs lrn out typil rp loritms wy rps? intuitivly, rp is orm y vrtis n s twn vrtis rps r

More information

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE! Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt of Computr n Informtion Sins CSCI 710 (Trnoff) Disrt Struturs TEST for Fll Smstr, 00 R this for strtin! This tst is los ook

More information

Computational Biology, Phylogenetic Trees. Consensus methods

Computational Biology, Phylogenetic Trees. Consensus methods Computtionl Biology, Phylognti Trs Consnsus mthos Asgr Bruun & Bo Simonsn Th 16th of Jnury 2008 Dprtmnt of Computr Sin Th univrsity of Copnhgn 0 Motivtion Givn olltion of Trs Τ = { T 0,..., T n } W wnt

More information

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas SnNCutCnvs Using th Printl Stikr Funtion On-o--kin stikrs n sily rt y using your inkjt printr n th Dirt Cut untion o th SnNCut mhin. For inormtion on si oprtions o th SnNCutCnvs, rr to th Hlp. To viw th

More information

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation

A Simple Code Generator. Code generation Algorithm. Register and Address Descriptors. Example 3/31/2008. Code Generation A Simpl Co Gnrtor Co Gnrtion Chptr 8 II Gnrt o for singl si lok How to us rgistrs? In most mhin rhitturs, som or ll of th oprnsmust in rgistrs Rgistrs mk goo tmporris Hol vlus tht r omput in on si lok

More information

(a) v 1. v a. v i. v s. (b)

(a) v 1. v a. v i. v s. (b) Outlin RETIMING Struturl optimiztion mthods. Gionni D Mihli Stnford Unirsity Rtiming. { Modling. { Rtiming for minimum dly. { Rtiming for minimum r. Synhronous Logi Ntwork Synhronous Logi Ntwork Synhronous

More information

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

Similarity Search. The Binary Branch Distance. Nikolaus Augsten. Similrity Srh Th Binry Brnh Distn Nikolus Augstn nikolus.ugstn@sg..t Dpt. of Computr Sins Univrsity of Slzurg http://rsrh.uni-slzurg.t Vrsion Jnury 11, 2017 Wintrsmstr 2016/2017 Augstn (Univ. Slzurg) Similrity

More information

Chapter 9. Graphs. 9.1 Graphs

Chapter 9. Graphs. 9.1 Graphs Chptr 9 Grphs Grphs r vry gnrl lss of ojt, us to formliz wi vrity of prtil prolms in omputr sin. In this hptr, w ll s th sis of (finit) unirt grphs, inluing grph isomorphism, onntivity, n grph oloring.

More information

Aquauno Video 6 Plus Page 1

Aquauno Video 6 Plus Page 1 Connt th timr to th tp. Aquuno Vio 6 Plus Pg 1 Usr mnul 3 lik! For Aquuno Vio 6 (p/n): 8456 For Aquuno Vio 6 Plus (p/n): 8413 Opn th timr unit y prssing th two uttons on th sis, n fit 9V lklin ttry. Whn

More information

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS C 24 - COMBINATIONAL BUILDING BLOCKS - INVST 3 DCODS AND NCODS FALL 23 AP FLZ To o "wll" on this invstition you must not only t th riht nswrs ut must lso o nt, omplt n onis writups tht mk ovious wht h

More information

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations Mr Funtins Grphs, Pruts, & Rltins Unirt Grphs An unirt grph is pir f 1. A st f ns 2. A st f gs (whr n g is st f tw ns*) Friy, Sptmr 2, 2011 Ring: Sipsr 0.2 ginning f 0.4; Stughtn 1.1.5 ({,,,,}, {{,}, {,},

More information

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski

DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Leslie Rogalski Dut with Dimons Brlt DUET WITH DIAMONDS COLOR SHIFTING BRACELET By Lsli Roglski Photo y Anrw Wirth Supruo DUETS TM from BSmith rt olor shifting fft tht mks your work tk on lif of its own s you mov! This

More information

Seven-Segment Display Driver

Seven-Segment Display Driver 7-Smnt Disply Drivr, Ron s in 7-Smnt Disply Drivr, Ron s in Prolm 62. 00 0 0 00 0000 000 00 000 0 000 00 0 00 00 0 0 0 000 00 0 00 BCD Diits in inry Dsin Drivr Loi 4 inputs, 7 outputs 7 mps, h with 6 on

More information

The Plan. Honey, I Shrunk the Data. Why Compress. Data Compression Concepts. Braille Example. Braille. x y xˆ

The Plan. Honey, I Shrunk the Data. Why Compress. Data Compression Concepts. Braille Example. Braille. x y xˆ h ln ony, hrunk th t ihr nr omputr in n nginring nivrsity of shington t omprssion onpts ossy t omprssion osslss t omprssion rfix os uffmn os th y 24 2 t omprssion onpts originl omprss o x y xˆ nor or omprss

More information

Problem solving by search

Problem solving by search Prolm solving y srh Tomáš voo Dprtmnt o Cyrntis, Vision or Roots n Autonomous ystms Mrh 5, 208 / 3 Outlin rh prolm. tt sp grphs. rh trs. trtgis, whih tr rnhs to hoos? trtgy/algorithm proprtis? Progrmming

More information

Designing A Concrete Arch Bridge

Designing A Concrete Arch Bridge This is th mous Shwnh ri in Switzrln, sin y Rort Millrt in 1933. It spns 37.4 mtrs (122 t) n ws sin usin th sm rphil mths tht will monstrt in this lsson. To pro with this lsson, lik on th Nxt utton hr

More information

QUESTIONS BEGIN HERE!

QUESTIONS BEGIN HERE! Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt o Computr n Inormtion Sins CSCI 2710 (Trno) Disrt Struturs TEST or Sprin Smstr, 2005 R this or strtin! This tst is los ook

More information

A comparison of routing sets for robust network design

A comparison of routing sets for robust network design A omprison of routing sts for roust ntwork sign Mihl Poss Astrt Dsigning ntwork l to rout st of non-simultnous mn vtors is n importnt prolm rising in tlommunitions. Th prolm n sn two-stg roust progrm whr

More information

EE1000 Project 4 Digital Volt Meter

EE1000 Project 4 Digital Volt Meter Ovrviw EE1000 Projt 4 Diitl Volt Mtr In this projt, w mk vi tht n msur volts in th rn o 0 to 4 Volts with on iit o ury. Th input is n nlo volt n th output is sinl 7-smnt iit tht tlls us wht tht input s

More information

Announcements. These are Graphs. This is not a Graph. Graph Definitions. Applications of Graphs. Graphs & Graph Algorithms

Announcements. These are Graphs. This is not a Graph. Graph Definitions. Applications of Graphs. Graphs & Graph Algorithms Grphs & Grph Algorithms Ltur CS Fll 5 Announmnts Upoming tlk h Mny Crrs o Computr Sintist Or how Computr Sin gr mpowrs you to o muh mor thn o Dn Huttnlohr, Prossor in th Dprtmnt o Computr Sin n Johnson

More information

CS September 2018

CS September 2018 Loil los Distriut Systms 06. Loil los Assin squn numrs to msss All ooprtin prosss n r on orr o vnts vs. physil los: rport tim o y Assum no ntrl tim sour Eh systm mintins its own lol lo No totl orrin o

More information

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths. How os it work? Pl vlu o imls rprsnt prts o whol numr or ojt # 0 000 Tns o thousns # 000 # 00 Thousns Hunrs Tns Ons # 0 Diml point st iml pl: ' 0 # 0 on tnth n iml pl: ' 0 # 00 on hunrth r iml pl: ' 0

More information

arxiv: v1 [cs.ds] 20 Feb 2008

arxiv: v1 [cs.ds] 20 Feb 2008 Symposium on Thortil Aspts of Computr Sin 2008 (Borux), pp. 361-372 www.sts-onf.org rxiv:0802.2867v1 [s.ds] 20 F 2008 FIXED PARAMETER POLYNOMIAL TIME ALGORITHMS FOR MAXIMUM AGREEMENT AND COMPATIBLE SUPERTREES

More information

temporally share the same FPGA Large circuit PI s micro-cycle one user cycle PO s

temporally share the same FPGA Large circuit PI s micro-cycle one user cycle PO s Ciruit Prtitioning for Dynmilly Rongurl FPGAs Huiqun Liu n D. F. Wong Dprtmnt of Computr Sins Unirsity of Txs t Austin Austin, T 787 Emil: fhqliu, wongg@s.utxs.u Astrt Dynmilly rongurl FPGAs h th potntil

More information

Design Optimization Based on Diagnosis Techniques

Design Optimization Based on Diagnosis Techniques Dsign Optimiztion Bs on Dignosis Thniqus Anrs Vnris Mgy S. Air Irhim N. Hjj Univrsity of Toronto Motorol Univrsity of Illinois ECE Dprtmnt 77 W. Prmr ECE Dprtmnt n CSL Toronto, ON M5S 34 Austin, T 78729

More information

XML and Databases. Outline. Recall: Top-Down Evaluation of Simple Paths. Recall: Top-Down Evaluation of Simple Paths. Sebastian Maneth NICTA and UNSW

XML and Databases. Outline. Recall: Top-Down Evaluation of Simple Paths. Recall: Top-Down Evaluation of Simple Paths. Sebastian Maneth NICTA and UNSW Smll Pth Quiz ML n Dtss Cn you giv n xprssion tht rturns th lst / irst ourrn o h istint pri lmnt? Ltur 8 Strming Evlution: how muh mmory o you n? Sstin Mnth NICTA n UNSW

More information

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued... Progrssiv Printing T.M. CPITLS g 4½+ Th sy, fun (n FR!) wy to tch cpitl lttrs. ook : C o - For Kinrgrtn or First Gr (not for pr-school). - Tchs tht cpitl lttrs mk th sm souns s th littl lttrs. - Tchs th

More information

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths

Weighted graphs -- reminder. Data Structures LECTURE 15. Shortest paths algorithms. Example: weighted graph. Two basic properties of shortest paths Dt Strutur LECTURE Shortt pth lgorithm Proprti of hortt pth Bllmn-For lgorithm Dijktr lgorithm Chptr in th txtook (pp ). Wight grph -- rminr A wight grph i grph in whih g hv wight (ot) w(v i, v j ) >.

More information

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S.

Page 1. Question 19.1b Electric Charge II Question 19.2a Conductors I. ConcepTest Clicker Questions Chapter 19. Physics, 4 th Edition James S. ConTst Clikr ustions Chtr 19 Physis, 4 th Eition Jms S. Wlkr ustion 19.1 Two hrg blls r rlling h othr s thy hng from th iling. Wht n you sy bout thir hrgs? Eltri Chrg I on is ositiv, th othr is ngtiv both

More information

Sybil Attacks and Defenses

Sybil Attacks and Defenses CPSC 426/526 Syil Attks n Dfnss Ennn Zhi Computr Sin Dprtmnt Yl Univrsity Rll: L-5 Rputtion systms: - Why w n rputtion/trust systms - Wht is glol rputtion mol - Wht is prsonliz rputtion mol - Cs stuis:

More information

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017 MAT3707/201/1/2017 Tutoril lttr 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS MAT3707 Smstr 1 Dprtmnt o Mtmtil Sins SOLUTIONS TO ASSIGNMENT 01 BARCODE Din tomorrow. univrsity o sout ri SOLUTIONS TO ASSIGNMENT

More information

Register Allocation. How to assign variables to finitely many registers? What to do when it can t be done? How to do so efficiently?

Register Allocation. How to assign variables to finitely many registers? What to do when it can t be done? How to do so efficiently? Rgistr Allotion Rgistr Allotion How to ssign vrils to initly mny rgistrs? Wht to o whn it n t on? How to o so iintly? Mony, Jun 3, 13 Mmory Wll Disprity twn CPU sp n mmory ss sp improvmnt Mony, Jun 3,

More information

N=4 L=4. Our first non-linear data structure! A graph G consists of two sets G = {V, E} A set of V vertices, or nodes f

N=4 L=4. Our first non-linear data structure! A graph G consists of two sets G = {V, E} A set of V vertices, or nodes f lulu jwtt pnlton sin towr ounrs hpl lpp lu Our irst non-linr t strutur! rph G onsists o two sts G = {V, E} st o V vrtis, or nos st o E s, rltionships twn nos surph G onsists o sust o th vrtis n s o G jnt

More information

ECE 407 Computer Aided Design for Electronic Systems. Circuit Modeling and Basic Graph Concepts/Algorithms. Instructor: Maria K. Michael.

ECE 407 Computer Aided Design for Electronic Systems. Circuit Modeling and Basic Graph Concepts/Algorithms. Instructor: Maria K. Michael. 0 Computr i Dsign or Eltroni Systms Ciruit Moling n si Grph Conptslgorithms Instrutor: Mri K. Mihl MKM - Ovrviw hviorl vs. Struturl mols Extrnl vs. Intrnl rprsnttions Funtionl moling t Logi lvl Struturl

More information

Section 3: Antiderivatives of Formulas

Section 3: Antiderivatives of Formulas Chptr Th Intgrl Appli Clculus 96 Sction : Antirivtivs of Formuls Now w cn put th is of rs n ntirivtivs togthr to gt wy of vluting finit intgrls tht is ct n oftn sy. To vlut finit intgrl f(t) t, w cn fin

More information

a b v a v b v c v = a d + bd +c d +ae r = p + a 0 s = r + b 0 4 ac + ad + bc + bd + e 5 = a + b = q 0 c + qc 0 + qc (a) s v (b)

a b v a v b v c v = a d + bd +c d +ae r = p + a 0 s = r + b 0 4 ac + ad + bc + bd + e 5 = a + b = q 0 c + qc 0 + qc (a) s v (b) Outlin MULTIPLE-LEVEL LOGIC OPTIMIZATION Gionni D Mihli Stnfor Unirsit Rprsnttions. Tonom of optimition mthos: { Gols: r/l. { Algorithms: lgri/booln. { Rul-s mthos. Empls of trnsformtions. Booln n lgri

More information

Multi-criteria p-cycle network design

Multi-criteria p-cycle network design Multi-ritri p-yl ntwork sin Hmz Dri, Brnr Cousin, Smr Lou, Miklos Molnr To it tis vrsion: Hmz Dri, Brnr Cousin, Smr Lou, Miklos Molnr. Multi-ritri p-yl ntwork sin. r IEEE Conrn on Lol Computr Ntworks (LCN

More information

A 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata

A 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata A 4-stt solution to th Firing Squ Synhroniztion Prolm s on hyri rul 60 n 102 llulr utomt LI Ning 1, LIANG Shi-li 1*, CUI Shung 1, XU Mi-ling 1, ZHANG Ling 2 (1. Dprtmnt o Physis, Northst Norml Univrsity,

More information

5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem

5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem Thorm 10-1: Th Hnshkin Thorm Lt G=(V,E) n unirt rph. Thn Prt 10. Grphs CS 200 Alorithms n Dt Struturs v V (v) = 2 E How mny s r thr in rph with 10 vrtis h of r six? 10 * 6 /2= 30 1 Thorm 10-2 An unirt

More information

MULTIPLE-LEVEL LOGIC OPTIMIZATION II

MULTIPLE-LEVEL LOGIC OPTIMIZATION II MUTIPE-EVE OGIC OPTIMIZATION II Booln mthos Eploit Booln proprtis Giovnni D Mihli Don t r onitions Stnfor Univrsit Minimition of th lol funtions Slowr lgorithms, ttr qulit rsults Etrnl on t r onitions

More information

Minimum Spanning Trees

Minimum Spanning Trees Minimum Spnning Trs Minimum Spnning Trs Problm A town hs st of houss nd st of rods A rod conncts nd only houss A rod conncting houss u nd v hs rpir cost w(u, v) Gol: Rpir nough (nd no mor) rods such tht:

More information

Walk Like a Mathematician Learning Task:

Walk Like a Mathematician Learning Task: Gori Dprtmnt of Euction Wlk Lik Mthmticin Lrnin Tsk: Mtrics llow us to prform mny usful mthmticl tsks which orinrily rquir lr numbr of computtions. Som typs of problms which cn b on fficintly with mtrics

More information

Quartets and unrooted level-k networks

Quartets and unrooted level-k networks Phylogntis Workshop, Is Nwton Institut or Mthmtil Sins Cmrig 21/06/2011 Qurtts n unroot lvl-k ntworks Philipp Gmtt Outlin Astrt n xpliit phylognti ntworks Lvl-k ntworks Unroot lvl-1 ntworks n irulr split

More information

This chapter covers special properties of planar graphs.

This chapter covers special properties of planar graphs. Chptr 21 Plnr Grphs This hptr ovrs spil proprtis of plnr grphs. 21.1 Plnr grphs A plnr grph is grph whih n b rwn in th pln without ny gs rossing. Som piturs of plnr grph might hv rossing gs, but it s possibl

More information

THE evolutionary history of a set of species is usually

THE evolutionary history of a set of species is usually COMPUTATION OF HYBRIDIZATION NETWORKS FOR REALISTIC PHYLOGENETIC TREES 1 Autumn Algorithm Computtion of Hyriiztion Ntworks for Rlisti Phylognti Trs Dnil H. Huson n Simon Linz Astrt A minimum hyriiztion

More information

1. Determine whether or not the following binary relations are equivalence relations. Be sure to justify your answers.

1. Determine whether or not the following binary relations are equivalence relations. Be sure to justify your answers. Mth 0 Exm - Prti Prolm Solutions. Dtrmin whthr or not th ollowing inry rltions r quivln rltions. B sur to justiy your nswrs. () {(0,0),(0,),(0,),(,),(,),(,),(,),(,0),(,),(,),(,0),(,),(.)} on th st A =

More information

IEEE TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. TK, NO. TK, MONTHTK YEARTK 1. Hamiltonian Walks of Phylogenetic Treespaces

IEEE TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. TK, NO. TK, MONTHTK YEARTK 1. Hamiltonian Walks of Phylogenetic Treespaces IEEE TRNSTIONS ON OMPUTTIONL IOLOGY ND IOINFORMTIS, VOL. TK, NO. TK, MONTHTK YERTK Hmiltonin Wlks of Phylognti Trsps Kvughn Goron, Eri For, n Kthrin St. John strt W nswr rynt s omintoril hllng on miniml

More information

In order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions.

In order to learn which questions have been answered correctly: 1. Print these pages. 2. Answer the questions. Crystl Rports for Visul Stuio.NET In orr to lrn whih qustions hv n nswr orrtly: 1. Print ths pgs. 2. Answr th qustions. 3. Sn this ssssmnt with th nswrs vi:. FAX to (212) 967-3498. Or. Mil th nswrs to

More information

Journal of Solid Mechanics and Materials Engineering

Journal of Solid Mechanics and Materials Engineering n Mtrils Enginring Strss ntnsit tor of n ntrf Crk in Bon Plt unr Uni-Axil Tnsion No-Aki NODA, Yu ZHANG, Xin LAN, Ysushi TAKASE n Kzuhiro ODA Dprtmnt of Mhnil n Control Enginring, Kushu nstitut of Thnolog,

More information

CS553 Lecture Register Allocation I 3

CS553 Lecture Register Allocation I 3 Low-Lvl Issus Last ltur Intrproural analysis Toay Start low-lvl issus Rgistr alloation Latr Mor rgistr alloation Instrution shuling CS553 Ltur Rgistr Alloation I 2 Rgistr Alloation Prolm Assign an unoun

More information

New challenges on Independent Gate FinFET Transistor Network Generation

New challenges on Independent Gate FinFET Transistor Network Generation Nw hllngs on Inpnnt Gt FinFET Trnsistor Ntwork Gnrtion Viniius N. Possni, Anré I. Ris, Rnto P. Ris, Flip S. Mrqus, Lomr S. Ros Junior Thnology Dvlopmnt Cntr, Frl Univrsity o Plots, Plots, Brzil Institut

More information