Strategies for Enhanced Dual Failure Restorability with Static or Reconfigurable p-cycle Networks

Size: px
Start display at page:

Download "Strategies for Enhanced Dual Failure Restorability with Static or Reconfigurable p-cycle Networks"

Transcription

1 Reprnt of paper to appear at the 2004 Internatonal Conference on Communcatons (ICC 2004), Pars, France, June Strateges for Enhanced Dual Falure Restorablty wth Statc or Reconfgurable p-cycle Networs Domnc A. Schupe * Semens AG, Corporate Technology Informaton and Communcatons Otto-Hahn-Rng 6, Munch, Germany E-mal: <frstname>.<lastname>@semens.com Wayne D. Grover, Mattheu Clouqueur TRLabs and Unversty of Alberta 7 th Floor, St NW Edmonton, Alberta, Canada T6G 2V4 E-mal: {grover, clouqueur}@trlabs.ca Abstract We suggest methods for achevng hgh dual-falure restorablty n p-cycle networs that are optmally desgned only to wthstand all sngle falures, or have mnmzed amounts of addtonal capacty for dual falure consderatons. In one set of crcumstances we consder statc p-cycles (that cannot be rearranged once establshed) and propose strateges to enhance the dual-falure restorablty based on concepts of falure spreadng and lmtng the mamum number of protecton relatonshps of any p-cycle. We then consder the case of reconfgurable p-cycles, n whch the spare capacty can be reconfgured dynamcally, creatng a new set of p-cycles that are optmzed to wthstand possble second falures. Results show sgnfcant mprovements of the dual-falure restorablty obtaned by lmtng the number of protecton relatonshps n statc desgn. For 100% dual-falure restorablty, p-cycle reconfguraton reusng most of the estng p-cycles and addng some new ones appears to be the most promsng approach. Keywords- p-cycle, Protecton, Dual Falures, Reconfguraton. I. BACKGROUND The concept of p-cycle protecton fnds applcaton n many nds of networs [1]. Hgh capacty-effcency and fast protecton swtchng tmes are acheved for span-protecton n transport networs [1][2]. Le a shared-protecton rng, a p-cycle protects worng capacty on the spans t covers ( oncycle spans ) by provdng loop-bac protecton paths. But unle rngs, a p-cycle can also protect worng capacty of offcycle spans whch have ther end-ponts on the p-cycle ( straddlng spans ). Moreover, a p-cycle offers two protecton paths for each straddlng span, and, thus, protects twce as much worng capacty on these spans as on the on-cycle spans. For a detaled descrpton of the p-cycle concept see [1] or [3]. Most of the wor on p-cycle networ desgn to date has focused on effcently provdng a guarantee of 100% restorablty aganst any sngle span falure. Ths R 1 = 1 condton remans the most cost-effectve sngle step that networ operators can tae to enhance the avalablty of all servces n ther networs. Once ths s n place, however, t s reasonable to consder how the nvestment n redundant * Ths wor orgnated durng a research stay of D. Schupe at TRLabs, Edmonton, Canada and s part of the wor when he has been wth the Insttute of Communcaton Networs at Technsche Unverstät München, Munch, Germany. capacty to acheve R 1 = 1 mght be further leveraged or optmzed to also wthstand dual falures as well as possble. Especally n large networs [4][5], or where mantenance actvtes reduce the avalable spare capacty, dual falures may become the domnant factor n determnng the ultmate servce avalablty of those networs. We therefore nvestgate several deas for provdng networs, based on p-cycles, whch have assured survvablty to any sngle falure, but also have an enhanced or optmzed level of dual-falure restorablty, denoted R 2. These strateges may nvolve usng only the spare capacty already nvested for R 1 = 1, or addng addtonal capacty to acheve specfc goals for R 2. Restorablty s defned as the fracton of demands that are affected by a falure scenaro, but whch survve by vrtue of recovery mechansms usng spare capacty of the networ. For sngle span falure scenaros, p-cycles guarantee (by the usual desgn default condton) restorablty R 1 of 100%. Some ntal analyses of dual-falure restorablty wth statc p-cycles have already been publshed [6][7]. Ths paper further etends and refnes the methods for statc p-cycle networs wth enhanced dual-falure restorablty and ncludes completely new methods for reconfgurable p-cycle networs that acheve 100% dualfalure restorablty. In general, we can dentfy three reasons to trgger dynamc p-cycle reconfguraton [8]: 1. The demand changes: p-cycles adapt to protect newly arrved demands [9][10]. 2. A (frst) falure occurs: Immedate p-cycle reconfguraton can mamze the potental for protecton aganst a subsequent falure. 3. Operator/protocol-ntaton: p-cycles are reoptmzed, e.g., after falure-repar or n a mantenance wndow. The paper focuses on case 2; the related aspects of case 3, however, wll be dscussed. For smplcty, we assume that n a dual falure scenaro, the second falure always occurs after the frst falure has been fully responded to by p-cycle protecton. In other words any second falure s assumed to occur on a networ n whch the frst falure and any reconfguratons n response to t have been completed. The nvestgatons on statc p-cycles [6] show that the dual-falure restorablty can be mproved by ncreasng the 1/6

2 D. A. Schupe, W. D. Grover, M. Clouqueur, Strateges for enhanced dual falure restorablty wth statc or reconfgurable p-cycle networs dversty of cycles used n the desgn and by desgnng so as to manage the number of protecton relatonshps each p-cycle may have through a susceptblty measure. In ths paper, we nvestgate these and other methods for both statc and reconfgurable p-cycles, to acheve the hghest state of readness after a frst falure should a second falure occur. In partcular, statc and reconfgurable p-cycles are compared wth respect to capacty requrements and we consder whether the number of reconfguraton actons followng a frst falure can be mnmzed whle stll achevng goals for R 2. In Secton II we classfy the desgn cases arsng when dual falures are taen nto account and formulate correspondng optmzaton models. Secton III dscusses restorablty and capactyeffcency results for networ case studes desgned usng the proposals of Secton II. Secton IV concludes and gves an outloo on further research. II. P-CYCLE DESIGN MODELS TO ACHIEVE DUAL-FAILURE RESTORABILITY Fgure 1 gves a logcal classfcaton of desgn and operatonal approaches that can be consdered from a standpont of R 2 consderatons. The optons depend on the networ operaton (e.g., f reconfguraton s supported or not) and on desgn preferences (e.g., desgn for sngle or dual-falure restorablty). Dual-falure optmzaton (R 2 optmzaton) means that the desgn ams to acheve hgh dual-falure restorablty, wth respect to the average case (or, alternatvely the worst case). No R 2 optmzaton Statc p-cycles R 2 optmzaton Protect vulnerable worng capacty only p-cycle desgn Protect vulnerable protecton capacty only Reconfgurable p-cycles No R 2 optmzaton R 2 optmzaton Protect any vulnerable capacty After frst falure Fgure 1. Possbltes n the p-cycle networ desgn when dual falures are taen nto account. Let us now dscuss desgn formulatons correspondng to the dfferent optons n Fgure 1. A. Basc Models for p-cycles Wthout R 2 Optmzaton Ths formulaton, frst gven n [9] and employed n [1][2], serves as the benchmar for R 1 desgn (sngle falure restorable) at mnmum spare capacty cost and s also the startng pont for the new models developed here. It assumes WDM networs wth full (or suffcent) wavelength converson, or networs wth equvalent characterstcs. The topology s descrbed by the set of spans S, ndeed by for faled spans and by for non-faled spans. A set of elgble and smple 1 cycles X s pre-computed, ncludng the protecton capacty matr, ( π ), ndcatng on whch spans S each canddate p-cycle X les, and the worng capacty coverage matr, or matr of protecton relatonshps, ( ρ ), 1 A smple cycle passes through a node or a span at most once. ndcatng how many worng capacty unts on span S can be protected by a sngle p-cycle on cycle X (1 for on-cycle spans, 2 for straddlng spans, 0 otherwse). For a span S, the cost of one unt of capacty s denoted by C. The desgn soluton s descrbed by varables n for the number of unt copes of p-cycles selected on cycle X, and by aulary varables s for the number of unts of protecton (or spare ) capacty on span. We assume the worng capactes w are gven nput parameters. s w Mnmze: C s (1) = π n X X S ρ n n,, S (2), S (3) X The objectve functon (1) mnmzes the total costweghted protecton capacty, constrants (2) determne the protecton capacty needed to form the p-cycles and constrants (3) ensure that there are enough p-cycles to protect the worng capacty. B. Models for Statc p-cycles wth R 2 Optmzaton 1) Reduce Susceptblty to Dual Falures Reference [6] proposes the followng etenson to the basc model. It ams to reduce the susceptblty 2 by eepng the worng capacty coverage (or protecton relatonshps) of the cycles low. New varables t ndcate whether a cycle s used n the desgn,.e., t s 1 f n s greater than 0, otherwse t s 0: n t n N, { 0,1} t, X (4) X The constant N s a large number. The addtonal (mnma) varable ρ ma s mnmzed (ths can be ncluded n the objectve, see [6]): ρ ma ρ t, S X (5) By mnmzng ρ ma we lmt the mamum number of untcapacty protecton relatonshps provded by any sngle p- cycle. Ths mproves the dual-falure restorablty by reducng the propensty for any sngle p-cycle to be smultaneously affected by two falures. New results here, show that a dfferent susceptblty measure,, relatng to the number of protected spans nstead of capacty unts, allows an even better control of the dual-falure restorablty. 2 A p-cycle s sad to be susceptble to a specfc dual falure combnaton f t bears protecton relatonshps to worng capacty on two or more spans whch are both faled smultaneously n the falure scenaro. 2/6

3 D. A. Schupe, W. D. Grover, M. Clouqueur, Strateges for enhanced dual falure restorablty wth statc or reconfgurable p-cycle networs We defne as: And (5) s replaced by: ma ρ + π = (6) 2 S t, X (7) B C Fgure 2. Eample of the fault-sharng concept. A The matr entry ndcates that cycle can protect capacty on span,.e., = 1, f span bears an on-cycle or a straddlng span logcal relatonshp to cycle, 0 otherwse. Ths s wthout consderaton of the actual amount of worng capacty that cycle may protect on span. Hence, a cycle s susceptble to 1 dual falures. S S Now, nstead of ncludng the susceptblty n the objectve, we can tae t drectly nto account durng the selecton of the elgble p-cycles. We thereby ncorporate susceptblty as a restrcton,.e., a canddate p-cycle n X s responsble for at most ma spans. 2) Falure Dspersal or Fault Sharng Another prncple s to desgn so that the total protecton of worng capacty on any gven span s dversfed or dspersed over multple p-cycles. The ntent s to avod the stuaton where a dual falure taes down the entre worng demand gong through a span because they have all been protected by the same p-cycle whch may be fully utlzed by the frst falure or otherwse overwhelmed by the partcular dual falure combnaton. A frst approach s to requre that at least µ dverse cycles share the protecton relatonshps on a span (ths s smlar to the multplcty or sharng factor concept for a dfferent nd of shared bacup cycles n [11] where a multple protecton cycles per span are requred) 3 : t µ X, S (8) For nstance, wth reference to Fgure 2, f µ s 2, then the span 7-2 can be protected by p-cycle combnatons A/B, A/C, B/C, or A/B/C. Note that after a frst falure of ths span, the combnaton A/B s better than A/C, snce the cycles A and B are dsjont ecept for ths span. If the two correspondng cycles each cover half of the worng capacty of span 2-7, then the worst case second falure for combnaton A/B (e.g., 2-3) causes loss of at most half of the worng capacty, whle the worst case second falure for combnaton A/C (e.g., 2-3) causes the full worng capacty to be lost. 3 Ths constrant can only hold for spans that are members of at least µ cycles. Although we can reformulate to t µ X, S : X µ, for smplcty we assume µ to be low enough, such that every span s member of at least µ cycles. C. Models for Reconfgurable p-cycles wth R 2 Optmzaton After a frst falure, p-cycles that are used for restoraton of affected worng lns are no longer avalable to protect other unaffected worng lns that they normally protect. In addton, the protecton path(s) of p-cycles whch are n an actve restoral state are themselves eposed, should a second falure ht them drectly. For nstance, the falure of span 2-7 n Fgure 3 maes worng capacty on spans 2-3, 3-4, 4-5, 5-6, 6-7, and 3-6 vulnerable to a second falure, f p-cycle A protects some worng capacty on these spans. Also the protecton path (2-3, 3-4, 4-5, 5-6, and 6-7) s vulnerable D Fgure 3. Eample of the p-cycle reconfguraton concept. p-cycle reconfguraton can hedge aganst ths vulnerablty by ntroducng, for eample, cycle D after the falure. To fully protect the worng capacty and the protecton path, two copes of cycle D are needed. If the p-cycle s not perfectly loaded, t may not be necessary for t to be able to protect all spans wthn tself. In the eample, p-cycle A may be responsble only to protect span 2-7; then, p-cycle D n the reconfguraton needs (for dualfalure protecton) the same capacty as cycle A only, snce t protects the protecton path only. To avod mang the reconfguraton models that generalze these deas overly comple, we mae the followng assumptons for a survvng span after a frst falure on span : 1. Reconfguraton should protect an upper bound on the unprotected worng capacty followng the frst falure,.e., t should protect ' w, = ρ n A X, ρ > 0 unts on span. Ths term sums the total number of worng capacty unts on span that have potentally lost ther protecton because that protecton was guaranteed by p-cycles also protectng span. Ths number s therefore greater than or equal to the worng capacty that s actually left unprotected after falure of span. Equalty holds only for perfectly loaded p-cycles on span. Overall, ths assumpton can result n more capacty consumpton than needed, because reconfguraton protects the vulnerable 3/6

4 D. A. Schupe, W. D. Grover, M. Clouqueur, Strateges for enhanced dual falure restorablty wth statc or reconfgurable p-cycle networs worng capacty of perfectly loaded p-cycles. If, however, the p-cycles are well loaded, lttle addtonal capacty wll be epected. 2. Reconfguraton should protect an upper bound on the capacty of the unprotected protecton paths that are actvated by the frst falure,.e., t should protect ' s, = π n unts on span. Ths term sums X, ρ > 0 the total protecton capacty on span of all p-cycles affected by the frst falure on span. Note that, agan, ths assumpton can result n more capacty consumpton than needed, because reconfguraton wll protect a p-cycle s protecton capacty even f t s not actually used after a frst falure on one of ts oncycle or straddlng spans (.e., the frst faled span could have been but was not actually protected by the p-cycle). Note that a perfectly loaded p-cycle protects all ts on-cycle and straddlng spans (.e., the upper bound s reached). So far we have also consdered that both the eposed (but not faled) worng capacty followng the frst falure, and the protecton path(s) themselves should be consdered for reestablshng protecton coverage durng reconfguraton n response to a second falure. Ether of them, however, can n prncple also be consdered alone. If a worng path s guaranteed to survve a sngle falure only, t may be suffcent to regard the am of the post-falure reconfguraton as beng to acheve protecton of the remanng unfaled worng capacty only. In other words, the phlosophy would be to protect normal worng capacty from dual falures, but not to reprotect protecton paths themselves. Ths ponts out that there can actually be two slghtly dfferent meanngs to what one has n mnd when we say dual-falure survvablty. The central dstncton s whether: Every worng demand should be protected from both falures. Every worng demand should be protected from any one falure that hts t drectly, even f the networ as a whole has already sustaned a pror falure. These two contets are consdered n our results as R 2 = 100% and R 2 = 100% only for worng capacty, respectvely. As ponted out n [7], certan dual falures can be survved wth falure sgnallng on the cycle or under certan falure crcumstances, but for the reasons gven ths s not consdered n ths secton. In addton, we assume that estng worng capacty and the routes of worng demands that are unaffected by a frst (or second) falure are not re-arranged. 1) Complete Cycle Reconfguraton After Frst Falure Complete reconfguraton can be thought of as meanng that for each sngle falure state n the networ we have a predetermned optmzed set of alternate p-cycles to swtch to, to mamze the protecton aganst a subsequent falure. In addton the no-falure state has a specfc confguraton of p- cycles that s nown to support 100% restorablty to any frstfalure. To model ths we ntroduce an addtonal set of varables denotng whch p-cycles are to be formed after falure of span : n, X, S : π = 0 Note that for certan dual falures (e.g., n a rng-le p- cycle wthout straddlng spans) reconfguraton cannot acheve 100% dual-falure survvablty. Then, for these dual falures n s not defned by default (.e., by π = 0 ). Constrants (2) are replaced by constrants determnng the upper lmt of spare capacty requred for each falure case: s s X π n π n X, π = 0, S (9),, S, (10) These addtonal constrants determne the set of cycles after falure of span : w + π n ρ n X, ρ > 0 X, π = 0,, S, (11) The second term n (11) sums the capacty of the protecton paths after the frst falure. Overall, the soluton specfes the set of p-cycles to use to fully wthstand any second falure after each frst-falure state has been entered. It also generates enough spare capacty on each span so that all of the varous p- cycle confguratons are feasble to confgure. Reconfguraton can be done n practce usng crossconnect nodes (XC) wth pre-planned nformaton: once the falure-span dentty s dssemnated networ-wde, each XC ndependently mplements ts local set of spare capacty connectons that effects the net requred p-cycle set networ wde. Snce the p-cycle confguraton s pre-planned, ts computaton can be done offlne, and thus, s not a tme-crtcal factor. Alternately, networs wth the dstrbuted cycle preconfguraton (DCPC) protocol [9] can re-actvate the protocol to autonomously self-organze the requred new set of p-cycles after any sngle-falure state s entered (and dssolvng any p- cycles not used n the frst falure protecton response). 2) Incremental Confguraton After a Frst Falure Another approach s to ncrement the estng confguraton n each sngle-falure state. In other words, after a frst falure, we want the p-cycles, whch are ntally found and whch are partally actve n recoverng the frst falure, to stay. Therefore, to protect aganst second falures, we deploy addtonal p- cycles and, as an opton, assgn more (prevously unused) protecton relatonshps to the estng p-cycles. The most straghtforward ncremental approach nvolves ntroducng only an addtonal set of p-cycles. These addtonal varables denote how many addtonal cycles are employed n the reconfgured state after falure of span : n, X, S : π = 0 4/6

5 D. A. Schupe, W. D. Grover, M. Clouqueur, Strateges for enhanced dual falure restorablty wth statc or reconfgurable p-cycle networs The constrants (2) are replaced by constrants determnng spare capacty needed n the non-falure case plus the upper lmt of spare capacty for each falure case: s π n + π n X X, π = 0,, S, (12) The followng addtonal constrants determne the set of addtonal cycles after falure of span : ρ n + π n ρ n, X, ρ > 0 X, ρ > 0 X, π = 0, S, (13) Wth ths modfcaton of the model, addtonal p-cycles are found and the ntal p-cycles reman untouched n ther confguraton (they do not even get new protecton relatonshps). As the ntal p-cycle set and thus a large part of the networ confguraton s ept autonomous, ths may ease admnstraton of the protecton confguraton. However, to realze better capacty effcency, we can also eplot the ntal set of cycles to protect aganst secondary falures. In ths approach, besdes deployng new p-cycles, estng p-cycles get new protecton relatonshps. In ths case we can use the complete cycle reconfguraton approach of the prevous subsecton plus the followng constrants: n n, X, S : π = 0 (14) 3) Mnmzng Reconfguraton Actons The number of cross-connectons to effect these reconfguratons could be a concern. Theoretcally a complete update of protecton confguraton may be needed. Dependng on technology and control assumptons ths may or may not be an ssue. Reconfguraton s assumed to happen after the frst falure s fully protected and before a second falure has occurred. It can therefore be a relatvely slow process (mnutes) and stll be very short relatve to the repar tme of the frst falure or the mean tme to a second falure. If the nodes are able to do parallel operatons (e.g., parallel cross-connectng nstructons over the connecton control nterface), such concerns may also not be of mportance. If relevant, however, one approach to mnmze the reconfguraton worload s to eep the number of ntally confgured cycles n place to the β 0,1 ): etent possble (controlled by [ ] β, X, S : π = 0 (15) n n Whle we epress the problem as one of mnmzng the number of reconfgured p-cycle unts, the concept can easly be enhanced to epress the reconfguratons n terms of reconfgured nodes or reconfgured p-cycles (havng one or more unts). III. CASE STUDIES We now present results of a study networ (wth the COST239 topology as studed n [2]) wth 11 nodes, 26 spans, and 3531 possble cycles (the average nodal degree d s 4.7). COST239 s three-connected therefore t s topologcally feasble for double falures to be survved f adequate spare capacty s present. A. Statc p-cycles Fgure 4 shows how R 2 can be mproved usng the fault sharng approach and the susceptblty approach both of whch are based on statc p-cycles and shows the assocated capacty cost penalty. For the fault sharng approach, factor µ s vared from 1 to 10 (a µ of 1 has no effect, and a µ hgher than 10 means that the protecton of any span has to be shared by more than ten cycles, whch seems to be mpractcal). For the susceptblty restrcton approach, ma s vared from 4 to 26 (a ma of 3 s nfeasble, and a ma of 26 means no effect). Fgure 4 also ncludes the comparson value for R 2 reconfgurable networs. Addtonal Relatve Spare Capacty Cost Fault Sharng Susceptblty Reconfguraton (global) ma =9 0.1 ma= Dual-falure Restorablty ma=4 smaller ma Fgure 4. Cost over dual-falure restorablty R 2 for three p-cycle desgn approaches. The capacty optmal desgn wthout R 2 optmzaton results n a reference cost C ref of and an R 2 of 61 percent. As we can see, the fault sharng approach does not brng any sgnfcant mprovement of R 2. As t turns out, the fault sharng approach can only mprove worst cases, but not the average case. The susceptblty restrcton, however, s a tool to mprove R 2 : wth every decrement n the mamum number of allowed protecton relatonshps per cycle we get a sgnfcant gan n restorablty. Smlar to the results of [6], mnmzng the mamum susceptblty such that the cost C ref are preserved, however, yelds only n very small restorablty devatons (about 1% only). Both for the span sharng factor and the mamum susceptblty, the hgher the value, the more cycles wll be selected for the optmal soluton. But for all the correspondng nstances of Fgure 4, the number of cycles s at most 15 only. We get smlar results for three other test networs. B. Reconfgurable p-cycle Desgns for 100% Dual-Falure Restorablty Fgure 5 shows a comparson of the cost of the desgns for statc, non-r 2 -optmzed p-cycles (1 st bar) and reconfgurable p- cycles (bars 2 to 7). All desgns whch ensure R 2 = 100% (bars 3 to 5, and bar 7) requre at least 70% more capacty than the reference R 1 desgn. An ntermedate value s reached for the case where only the worng capacty s protected aganst dual falures (see Secton II.C), wth 60% addtonal cost (2 nd bar). Only a margnal cost ncrease for the global reconfguraton 5/6

6 D. A. Schupe, W. D. Grover, M. Clouqueur, Strateges for enhanced dual falure restorablty wth statc or reconfgurable p-cycle networs desgn s nvolved, f at most 5% of the p-cycles can change (4 th bar). Compared wth the global reconfguraton output (3 rd bar), 47% more cost s needed for eepng p-cycles untouched and addng new ones (7 th bar). If estng p-cycles are eploted, the cost ncrease s only 2% (5 th bar). Wth a cost ncrease of 27%, agan an ntermedate value s reached for the case where only the worng capacty s protected aganst dual falures and estng p-cycles are untouched (6 th bar). Relatve Spare Capacty Cost Statc, R1=100% (acheves R2=61%) Reconfguraton, R1=100%, R2=100% only for w orng capacty, global reconfguraton Reconfguraton, R1=R2=100%, global reconfguraton Reconfguraton, R1=R2=100%, reconfguraton w th at most 5% p-cycles changed Reconfguraton, R1=R2=100%, reconfguraton w th no p-cycles changed Reconfguraton, R1=100%, R2=100% only for w orng capacty, reconfguraton w th addtonal p-cycles Reconfguraton, R1=R2=100%, reconfguraton w th addtonal p-cycles Fgure 5. Cost comparson between desgns for statc and reconfgurable p-cycles (for bars 4 to 7 only appromate solutons, the ntervals ndcate the LP relaaton bounds). Although a capacty cost ncrease of 70% for an R 2 desgn relatve to the R 1 desgn sounds hgh, ths value may be epected. In addton, gven the low ntal redundancy of the R 1 reference p-cycle desgn, ths stll represents R 2 restorable networs that typcally wll have less capacty than rng or 1+1 APS-protected R 1 networs. From the capacty pont-of-vew, an effcent R 1 desgn for COST239 could acheve a spare to worng capacty rato of 1/(d-1) = 27% (see for eample [12] for the dervaton of ths formula). For an effcent R 2 desgn, however, the estmaton clmbs to 2/(d-2) = 74% (durng a double span falure ncdent at a node, the worng capacty of the 2 spans s best spread evenly on the node s survvng d-2 spans). Therefore, f we relate these capacty estmatons for the two desgns, we epect appromately 2.7 tmes more spare capacty needed for R 2 = 1 compared wth R 1 = 1. For the test networ, however, as we deal wth cost weghted spare capacty n (1) and we do not deal wth an estmator value for a pure-optmal R 1 desgn, the cost dfference between R 2 = 1 and R 1 = 1 can be lower. IV. OUTLOOK In ths paper, we presented capacty desgn methods for mproved or complete dual-falure restorablty usng ether statc p-cycles or p-cycles that can be reorganzed after the event of a frst falure. Test case studes show that usng reconfgurable p-cycles allows one to offer a dual-falure restorablty guarantee at a sgnfcantly lower capacty cost, although ths cost s stll 70% hgher than the cost of desgn for sngle falure restorablty only. Another approach that could be of nterest for a p-cycle networ that s optmally desgned to protect aganst sngle falures, would be to consder how much the ablty to reconfgure p-cycles can enhance the dual-falure restorablty (wthout addng any new capacty.) Although ths approach may not offer a hgh gan for the statc case [6], reconfgurable networs may tae advantage of the common pool of protecton capacty to acheve hgher average or mnmal dualfalure restorablty. The approach can be used n complete p- cycle reconfguraton and for statc p-cycles wth new protecton relatonshps n the reconfguraton and s for further study. Future wor on the present topc could also nvestgate the possblty of desgnng a p-cycle networ for multple protecton classes (R 1 and R 2 ) as presented n [13] n the contet of span-restorable networs. The authors than M. C. Scheffel for hs helpful comments on the paper. REFERENCES [1] W. D. Grover and D. Stamatelas, Brdgng the rng-mesh dchotomy wth p-cycles, n Proc. of DRCN 2000, pp [2] D. A. Schupe, C. Gruber, and A. Autenreth, Optmal confguraton of p-cycles n WDM networs, n Proc. of ICC 2002, pp [3] W. D. Grover, p-cycles, Chapter 10 n Mesh-based Survvable Networs: Optons for Optcal, MPLS, SONET and ATM Networng, Prentce-Hall, Aug [4] M. Clouqueur and W. D. Grover, Avalablty analyss of span restorable mesh networs, IEEE JSAC, May 2002, pp [5] D. A. Schupe, A. Autenreth, and T. Fscher, Survvablty of multple fber duct falures, n Proc. of DRCN 2001, pp [6] D. A. Schupe, The tradeoff between the number of deployed p-cycles and the survvablty to dual fber duct falures, n Proc. of ICC 2003, pp [7] D. A. Schupe, Multple falure survvablty n WDM networs wth p-cycles, n Proc. of ISCAS 2003, vol. 3, pp. III/ [8] C. G. Gruber and D. A. Schupe, Capacty-effcent plannng of reslent networs wth p-cycles, n Proc. of Networs 2002, pp [9] W. D. Grover and D. Stamatelas, Cycle-orented dstrbuted preconfguraton: rng-le speed wth mesh-le capacty for selfplannng networ restoraton, n Proc. ICC 1998, pp [10] D. A. Schupe, M. Jaeger, and R. Huelsermann, Comparson of reslence mechansms for dynamc servces n ntellgent optcal Networs, n Proc. of DRCN 2003, pp [11] H. Hwang, S. Ahn, Y. Yoo, and C. S. Km, Multple shared bacup cycles for survvable optcal mesh networs, n Proc. of ICCCN 2001, pp [12] J. Doucette, W. D. Grover, Comparson of mesh protecton and restoraton schemes and the dependency on graph connectvty, n Proc. of DRCN 2001, pp [13] M. Clouqueur, W. D. Grover, Mesh-restorable networs wth complete dual falure restorablty and wth selectvely enhanced dual-falure restorablty propertes, n Proc. of OptComm 2002, pp /6

MAINTENANCE-IMMUNE DESIGN OF SPAN-RESTORABLE MESH NETWORKS

MAINTENANCE-IMMUNE DESIGN OF SPAN-RESTORABLE MESH NETWORKS MAINTENANCE-IMMUNE DESIGN OF SPAN-RESTORABLE MESH NETWORKS John Doucette, Wayne D. Grover TRLabs, #800 06-98 th Avenue, Edmonton, Alberta, Canada T5K 2P7 and Department of Electrcal & Computer Engneerng,

More information

Dynamic Optimization. Assignment 1. Sasanka Nagavalli January 29, 2013 Robotics Institute Carnegie Mellon University

Dynamic Optimization. Assignment 1. Sasanka Nagavalli January 29, 2013 Robotics Institute Carnegie Mellon University Dynamc Optmzaton Assgnment 1 Sasanka Nagavall snagaval@andrew.cmu.edu 16-745 January 29, 213 Robotcs Insttute Carnege Mellon Unversty Table of Contents 1. Problem and Approach... 1 2. Optmzaton wthout

More information

PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht

PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht 68 Internatonal Journal "Informaton Theores & Applcatons" Vol.11 PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION Evgeny Artyomov and Orly

More information

Calculation of the received voltage due to the radiation from multiple co-frequency sources

Calculation of the received voltage due to the radiation from multiple co-frequency sources Rec. ITU-R SM.1271-0 1 RECOMMENDATION ITU-R SM.1271-0 * EFFICIENT SPECTRUM UTILIZATION USING PROBABILISTIC METHODS Rec. ITU-R SM.1271 (1997) The ITU Radocommuncaton Assembly, consderng a) that communcatons

More information

Decision aid methodologies in transportation

Decision aid methodologies in transportation Decson ad methodologes n transportaton Lecture 7: More Applcatons Prem Kumar prem.vswanathan@epfl.ch Transport and Moblty Laboratory Summary We learnt about the dfferent schedulng models We also learnt

More information

Network Reconfiguration in Distribution Systems Using a Modified TS Algorithm

Network Reconfiguration in Distribution Systems Using a Modified TS Algorithm Network Reconfguraton n Dstrbuton Systems Usng a Modfed TS Algorthm ZHANG DONG,FU ZHENGCAI,ZHANG LIUCHUN,SONG ZHENGQIANG School of Electroncs, Informaton and Electrcal Engneerng Shangha Jaotong Unversty

More information

High Speed ADC Sampling Transients

High Speed ADC Sampling Transients Hgh Speed ADC Samplng Transents Doug Stuetzle Hgh speed analog to dgtal converters (ADCs) are, at the analog sgnal nterface, track and hold devces. As such, they nclude samplng capactors and samplng swtches.

More information

NATIONAL RADIO ASTRONOMY OBSERVATORY Green Bank, West Virginia SPECTRAL PROCESSOR MEMO NO. 25. MEMORANDUM February 13, 1985

NATIONAL RADIO ASTRONOMY OBSERVATORY Green Bank, West Virginia SPECTRAL PROCESSOR MEMO NO. 25. MEMORANDUM February 13, 1985 NATONAL RADO ASTRONOMY OBSERVATORY Green Bank, West Vrgna SPECTRAL PROCESSOR MEMO NO. 25 MEMORANDUM February 13, 1985 To: Spectral Processor Group From: R. Fsher Subj: Some Experments wth an nteger FFT

More information

A NSGA-II algorithm to solve a bi-objective optimization of the redundancy allocation problem for series-parallel systems

A NSGA-II algorithm to solve a bi-objective optimization of the redundancy allocation problem for series-parallel systems 0 nd Internatonal Conference on Industral Technology and Management (ICITM 0) IPCSIT vol. 49 (0) (0) IACSIT Press, Sngapore DOI: 0.776/IPCSIT.0.V49.8 A NSGA-II algorthm to solve a b-obectve optmzaton of

More information

Resource Allocation Optimization for Device-to- Device Communication Underlaying Cellular Networks

Resource Allocation Optimization for Device-to- Device Communication Underlaying Cellular Networks Resource Allocaton Optmzaton for Devce-to- Devce Communcaton Underlayng Cellular Networks Bn Wang, L Chen, Xaohang Chen, Xn Zhang, and Dacheng Yang Wreless Theores and Technologes (WT&T) Bejng Unversty

More information

Exploiting Dynamic Workload Variation in Low Energy Preemptive Task Scheduling

Exploiting Dynamic Workload Variation in Low Energy Preemptive Task Scheduling Explotng Dynamc Worload Varaton n Low Energy Preemptve Tas Schedulng Lap-Fa Leung, Ch-Yng Tsu Department of Electrcal and Electronc Engneerng Hong Kong Unversty of Scence and Technology Clear Water Bay,

More information

A Preliminary Study on Targets Association Algorithm of Radar and AIS Using BP Neural Network

A Preliminary Study on Targets Association Algorithm of Radar and AIS Using BP Neural Network Avalable onlne at www.scencedrect.com Proceda Engneerng 5 (2 44 445 A Prelmnary Study on Targets Assocaton Algorthm of Radar and AIS Usng BP Neural Networ Hu Xaoru a, Ln Changchuan a a Navgaton Insttute

More information

High Speed, Low Power And Area Efficient Carry-Select Adder

High Speed, Low Power And Area Efficient Carry-Select Adder Internatonal Journal of Scence, Engneerng and Technology Research (IJSETR), Volume 5, Issue 3, March 2016 Hgh Speed, Low Power And Area Effcent Carry-Select Adder Nelant Harsh M.tech.VLSI Desgn Electroncs

More information

A Comparison of Two Equivalent Real Formulations for Complex-Valued Linear Systems Part 2: Results

A Comparison of Two Equivalent Real Formulations for Complex-Valued Linear Systems Part 2: Results AMERICAN JOURNAL OF UNDERGRADUATE RESEARCH VOL. 1 NO. () A Comparson of Two Equvalent Real Formulatons for Complex-Valued Lnear Systems Part : Results Abnta Munankarmy and Mchael A. Heroux Department of

More information

Optimal Sizing and Allocation of Residential Photovoltaic Panels in a Distribution Network for Ancillary Services Application

Optimal Sizing and Allocation of Residential Photovoltaic Panels in a Distribution Network for Ancillary Services Application Optmal Szng and Allocaton of Resdental Photovoltac Panels n a Dstrbuton Networ for Ancllary Servces Applcaton Reza Ahmad Kordhel, Student Member, IEEE, S. Al Pourmousav, Student Member, IEEE, Jayarshnan

More information

Optimal Placement of PMU and RTU by Hybrid Genetic Algorithm and Simulated Annealing for Multiarea Power System State Estimation

Optimal Placement of PMU and RTU by Hybrid Genetic Algorithm and Simulated Annealing for Multiarea Power System State Estimation T. Kerdchuen and W. Ongsakul / GMSARN Internatonal Journal (09) - Optmal Placement of and by Hybrd Genetc Algorthm and Smulated Annealng for Multarea Power System State Estmaton Thawatch Kerdchuen and

More information

TECHNICAL NOTE TERMINATION FOR POINT- TO-POINT SYSTEMS TN TERMINATON FOR POINT-TO-POINT SYSTEMS. Zo = L C. ω - angular frequency = 2πf

TECHNICAL NOTE TERMINATION FOR POINT- TO-POINT SYSTEMS TN TERMINATON FOR POINT-TO-POINT SYSTEMS. Zo = L C. ω - angular frequency = 2πf TECHNICAL NOTE TERMINATION FOR POINT- TO-POINT SYSTEMS INTRODUCTION Because dgtal sgnal rates n computng systems are ncreasng at an astonshng rate, sgnal ntegrty ssues have become far more mportant to

More information

Comparative Analysis of Reuse 1 and 3 in Cellular Network Based On SIR Distribution and Rate

Comparative Analysis of Reuse 1 and 3 in Cellular Network Based On SIR Distribution and Rate Comparatve Analyss of Reuse and 3 n ular Network Based On IR Dstrbuton and Rate Chandra Thapa M.Tech. II, DEC V College of Engneerng & Technology R.V.. Nagar, Chttoor-5727, A.P. Inda Emal: chandra2thapa@gmal.com

More information

Dynamic Lightpath Protection in WDM Mesh Networks under Wavelength Continuity Constraint

Dynamic Lightpath Protection in WDM Mesh Networks under Wavelength Continuity Constraint Dynamc Lghtpath Protecton n WDM Mesh etworks under Wavelength Contnuty Constrant Shengl Yuan* and Jason P. Jue *Department of Computer and Mathematcal Scences, Unversty of Houston Downtown One Man Street,

More information

Figure 1. DC-DC Boost Converter

Figure 1. DC-DC Boost Converter EE46, Power Electroncs, DC-DC Boost Converter Verson Oct. 3, 11 Overvew Boost converters make t possble to effcently convert a DC voltage from a lower level to a hgher level. Theory of Operaton Relaton

More information

Research of Dispatching Method in Elevator Group Control System Based on Fuzzy Neural Network. Yufeng Dai a, Yun Du b

Research of Dispatching Method in Elevator Group Control System Based on Fuzzy Neural Network. Yufeng Dai a, Yun Du b 2nd Internatonal Conference on Computer Engneerng, Informaton Scence & Applcaton Technology (ICCIA 207) Research of Dspatchng Method n Elevator Group Control System Based on Fuzzy Neural Network Yufeng

More information

Test 2. ECON3161, Game Theory. Tuesday, November 6 th

Test 2. ECON3161, Game Theory. Tuesday, November 6 th Test 2 ECON36, Game Theory Tuesday, November 6 th Drectons: Answer each queston completely. If you cannot determne the answer, explanng how you would arrve at the answer may earn you some ponts.. (20 ponts)

More information

NETWORK 2001 Transportation Planning Under Multiple Objectives

NETWORK 2001 Transportation Planning Under Multiple Objectives NETWORK 200 Transportaton Plannng Under Multple Objectves Woodam Chung Graduate Research Assstant, Department of Forest Engneerng, Oregon State Unversty, Corvalls, OR9733, Tel: (54) 737-4952, Fax: (54)

More information

Guidelines for CCPR and RMO Bilateral Key Comparisons CCPR Working Group on Key Comparison CCPR-G5 October 10 th, 2014

Guidelines for CCPR and RMO Bilateral Key Comparisons CCPR Working Group on Key Comparison CCPR-G5 October 10 th, 2014 Gudelnes for CCPR and RMO Blateral Key Comparsons CCPR Workng Group on Key Comparson CCPR-G5 October 10 th, 2014 These gudelnes are prepared by CCPR WG-KC and RMO P&R representatves, and approved by CCPR,

More information

Weighted Penalty Model for Content Balancing in CATS

Weighted Penalty Model for Content Balancing in CATS Weghted Penalty Model for Content Balancng n CATS Chngwe Davd Shn Yuehme Chen Walter Denny Way Len Swanson Aprl 2009 Usng assessment and research to promote learnng WPM for CAT Content Balancng 2 Abstract

More information

Uncertainty in measurements of power and energy on power networks

Uncertainty in measurements of power and energy on power networks Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:

More information

Electricity Network Reliability Optimization

Electricity Network Reliability Optimization Electrcty Network Relablty Optmzaton Kavnesh Sngh Department of Engneerng Scence Unversty of Auckland New Zealand kav@hug.co.nz Abstract Electrcty dstrbuton networks are subject to random faults. On occurrence

More information

Ergodic Capacity of Block-Fading Gaussian Broadcast and Multi-access Channels for Single-User-Selection and Constant-Power

Ergodic Capacity of Block-Fading Gaussian Broadcast and Multi-access Channels for Single-User-Selection and Constant-Power 7th European Sgnal Processng Conference EUSIPCO 29 Glasgow, Scotland, August 24-28, 29 Ergodc Capacty of Block-Fadng Gaussan Broadcast and Mult-access Channels for Sngle-User-Selecton and Constant-Power

More information

A Novel Optimization of the Distance Source Routing (DSR) Protocol for the Mobile Ad Hoc Networks (MANET)

A Novel Optimization of the Distance Source Routing (DSR) Protocol for the Mobile Ad Hoc Networks (MANET) A Novel Optmzaton of the Dstance Source Routng (DSR) Protocol for the Moble Ad Hoc Networs (MANET) Syed S. Rzv 1, Majd A. Jafr, and Khaled Ellethy Computer Scence and Engneerng Department Unversty of Brdgeport

More information

A MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION

A MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION A MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION Vncent A. Nguyen Peng-Jun Wan Ophr Freder Computer Scence Department Illnos Insttute of Technology Chcago, Illnos vnguyen@t.edu,

More information

Saidi minimization of a remote distribution feeder

Saidi minimization of a remote distribution feeder Unversty of Wollongong Research nlne Faculty of Informatcs - Papers (Archve) Faculty of Engneerng and Informaton Scences 2007 Sad mnmzaton of a remote dstrbuton feeder Ka Zou Unversty of Wollongong, kz965@uow.edu.au

More information

Topology Control for C-RAN Architecture Based on Complex Network

Topology Control for C-RAN Architecture Based on Complex Network Topology Control for C-RAN Archtecture Based on Complex Network Zhanun Lu, Yung He, Yunpeng L, Zhaoy L, Ka Dng Chongqng key laboratory of moble communcatons technology Chongqng unversty of post and telecommuncaton

More information

Figure 1. DC-DC Boost Converter

Figure 1. DC-DC Boost Converter EE36L, Power Electroncs, DC-DC Boost Converter Verson Feb. 8, 9 Overvew Boost converters make t possble to effcently convert a DC voltage from a lower level to a hgher level. Theory of Operaton Relaton

More information

Integer Programming. P.H.S. Torr Lecture 5. Integer Programming

Integer Programming. P.H.S. Torr Lecture 5. Integer Programming Integer Programmng P.H.S. Torr Lecture 5 Integer Programmng Outlne Mathematcal programmng paradgm Lnear Programmng Integer Programmng Integer Programmng Eample Unmodularty LP -> IP Theorem Concluson Specal

More information

Define Y = # of mobiles from M total mobiles that have an adequate link. Measure of average portion of mobiles allocated a link of adequate quality.

Define Y = # of mobiles from M total mobiles that have an adequate link. Measure of average portion of mobiles allocated a link of adequate quality. Wreless Communcatons Technologes 6::559 (Advanced Topcs n Communcatons) Lecture 5 (Aprl th ) and Lecture 6 (May st ) Instructor: Professor Narayan Mandayam Summarzed by: Steve Leung (leungs@ece.rutgers.edu)

More information

Graph Method for Solving Switched Capacitors Circuits

Graph Method for Solving Switched Capacitors Circuits Recent Advances n rcuts, ystems, gnal and Telecommuncatons Graph Method for olvng wtched apactors rcuts BHUMIL BRTNÍ Department of lectroncs and Informatcs ollege of Polytechncs Jhlava Tolstého 6, 586

More information

Figure.1. Basic model of an impedance source converter JCHPS Special Issue 12: August Page 13

Figure.1. Basic model of an impedance source converter JCHPS Special Issue 12: August Page 13 A Hgh Gan DC - DC Converter wth Soft Swtchng and Power actor Correcton for Renewable Energy Applcaton T. Selvakumaran* and. Svachdambaranathan Department of EEE, Sathyabama Unversty, Chenna, Inda. *Correspondng

More information

Comparison of Two Measurement Devices I. Fundamental Ideas.

Comparison of Two Measurement Devices I. Fundamental Ideas. Comparson of Two Measurement Devces I. Fundamental Ideas. ASQ-RS Qualty Conference March 16, 005 Joseph G. Voelkel, COE, RIT Bruce Sskowsk Rechert, Inc. Topcs The Problem, Eample, Mathematcal Model One

More information

Learning Ensembles of Convolutional Neural Networks

Learning Ensembles of Convolutional Neural Networks Learnng Ensembles of Convolutonal Neural Networks Lran Chen The Unversty of Chcago Faculty Mentor: Greg Shakhnarovch Toyota Technologcal Insttute at Chcago 1 Introducton Convolutonal Neural Networks (CNN)

More information

Priority based Dynamic Multiple Robot Path Planning

Priority based Dynamic Multiple Robot Path Planning 2nd Internatonal Conference on Autonomous obots and Agents Prorty based Dynamc Multple obot Path Plannng Abstract Taxong Zheng Department of Automaton Chongqng Unversty of Post and Telecommuncaton, Chna

More information

MTBF PREDICTION REPORT

MTBF PREDICTION REPORT MTBF PREDICTION REPORT PRODUCT NAME: BLE112-A-V2 Issued date: 01-23-2015 Rev:1.0 Copyrght@2015 Bluegga Technologes. All rghts reserved. 1 MTBF PREDICTION REPORT... 1 PRODUCT NAME: BLE112-A-V2... 1 1.0

More information

The Impact of Spectrum Sensing Frequency and Packet- Loading Scheme on Multimedia Transmission over Cognitive Radio Networks

The Impact of Spectrum Sensing Frequency and Packet- Loading Scheme on Multimedia Transmission over Cognitive Radio Networks Ths artcle has been accepted for publcaton n a future ssue of ths journal, but has not been fully edted. Content may change pror to fnal publcaton. The Impact of Spectrum Sensng Frequency and Pacet- Loadng

More information

Analysis of Time Delays in Synchronous and. Asynchronous Control Loops. Bj rn Wittenmark, Ben Bastian, and Johan Nilsson

Analysis of Time Delays in Synchronous and. Asynchronous Control Loops. Bj rn Wittenmark, Ben Bastian, and Johan Nilsson 37th CDC, Tampa, December 1998 Analyss of Delays n Synchronous and Asynchronous Control Loops Bj rn Wttenmark, Ben Bastan, and Johan Nlsson emal: bjorn@control.lth.se, ben@control.lth.se, and johan@control.lth.se

More information

A TWO-PLAYER MODEL FOR THE SIMULTANEOUS LOCATION OF FRANCHISING SERVICES WITH PREFERENTIAL RIGHTS

A TWO-PLAYER MODEL FOR THE SIMULTANEOUS LOCATION OF FRANCHISING SERVICES WITH PREFERENTIAL RIGHTS A TWO-PLAYER MODEL FOR THE SIMULTANEOUS LOCATION OF FRANCHISING SERVICES WITH PREFERENTIAL RIGHTS Pedro Godnho and oana Das Faculdade de Economa and GEMF Unversdade de Combra Av. Das da Slva 65 3004-5

More information

Digital Transmission

Digital Transmission Dgtal Transmsson Most modern communcaton systems are dgtal, meanng that the transmtted normaton sgnal carres bts and symbols rather than an analog sgnal. The eect o C/N rato ncrease or decrease on dgtal

More information

A Predictive QoS Control Strategy for Wireless Sensor Networks

A Predictive QoS Control Strategy for Wireless Sensor Networks The 1st Worshop on Resource Provsonng and Management n Sensor Networs (RPMSN '5) n conjuncton wth the 2nd IEEE MASS, Washngton, DC, Nov. 25 A Predctve QoS Control Strategy for Wreless Sensor Networs Byu

More information

UNIT 11 TWO-PERSON ZERO-SUM GAMES WITH SADDLE POINT

UNIT 11 TWO-PERSON ZERO-SUM GAMES WITH SADDLE POINT UNIT TWO-PERSON ZERO-SUM GAMES WITH SADDLE POINT Structure. Introducton Obectves. Key Terms Used n Game Theory.3 The Maxmn-Mnmax Prncple.4 Summary.5 Solutons/Answers. INTRODUCTION In Game Theory, the word

More information

Prevention of Sequential Message Loss in CAN Systems

Prevention of Sequential Message Loss in CAN Systems Preventon of Sequental Message Loss n CAN Systems Shengbng Jang Electrcal & Controls Integraton Lab GM R&D Center, MC: 480-106-390 30500 Mound Road, Warren, MI 48090 shengbng.jang@gm.com Ratnesh Kumar

More information

antenna antenna (4.139)

antenna antenna (4.139) .6.6 The Lmts of Usable Input Levels for LNAs The sgnal voltage level delvered to the nput of an LNA from the antenna may vary n a very wde nterval, from very weak sgnals comparable to the nose level,

More information

Passive Filters. References: Barbow (pp ), Hayes & Horowitz (pp 32-60), Rizzoni (Chap. 6)

Passive Filters. References: Barbow (pp ), Hayes & Horowitz (pp 32-60), Rizzoni (Chap. 6) Passve Flters eferences: Barbow (pp 6575), Hayes & Horowtz (pp 360), zzon (Chap. 6) Frequencyselectve or flter crcuts pass to the output only those nput sgnals that are n a desred range of frequences (called

More information

Dynamic Lightpath Protection in WDM Mesh Networks under Risk-Disjoint Constraint

Dynamic Lightpath Protection in WDM Mesh Networks under Risk-Disjoint Constraint Dynamc Lghtpath Protecton n D esh Netors under Rs-Dsont Constrant Shengl Yuan* and Jason P. Jue *Department of Computer and athematcal Scences, Unversty of Houston Donton One an Street, Houston, TX 7700,

More information

LITECOM. Self-contained emergency luminaires

LITECOM. Self-contained emergency luminaires LITECOM Self-contaned emergency lumnares Legal nformaton Copyrght Copyrght Zumtobel Lghtng GmbH All rghts reserved. Manufacturer Zumtobel Lghtng GmbH Schwezerstrasse 30 6850 Dornbrn AUSTRIA Tel. +43-(0)5572-390-0

More information

Networks. Backpropagation. Backpropagation. Introduction to. Backpropagation Network training. Backpropagation Learning Details 1.04.

Networks. Backpropagation. Backpropagation. Introduction to. Backpropagation Network training. Backpropagation Learning Details 1.04. Networs Introducton to - In 1986 a method for learnng n mult-layer wor,, was nvented by Rumelhart Paper Why are what and where processed by separate cortcal vsual systems? - The algorthm s a sensble approach

More information

An Optimization Approach for Airport Slot Allocation under IATA Guidelines

An Optimization Approach for Airport Slot Allocation under IATA Guidelines An Optmzaton Approach for Arport Slot Allocaton under IATA Gudelnes Abstract Ar traffc demand has grown to exceed avalable capacty durng extended parts of each day at many of the busest arports worldwde.

More information

To: Professor Avitabile Date: February 4, 2003 From: Mechanical Student Subject: Experiment #1 Numerical Methods Using Excel

To: Professor Avitabile Date: February 4, 2003 From: Mechanical Student Subject: Experiment #1 Numerical Methods Using Excel To: Professor Avtable Date: February 4, 3 From: Mechancal Student Subject:.3 Experment # Numercal Methods Usng Excel Introducton Mcrosoft Excel s a spreadsheet program that can be used for data analyss,

More information

Adaptive Modulation for Multiple Antenna Channels

Adaptive Modulation for Multiple Antenna Channels Adaptve Modulaton for Multple Antenna Channels June Chul Roh and Bhaskar D. Rao Department of Electrcal and Computer Engneerng Unversty of Calforna, San Dego La Jolla, CA 993-7 E-mal: jroh@ece.ucsd.edu,

More information

OPTIMAL GUARANTEED SERVICES TIMED TOKEN (OGSTT) MEDIA ACCESS CONTROL (MAC) PROTOCOL FOR NETWORKS THAT

OPTIMAL GUARANTEED SERVICES TIMED TOKEN (OGSTT) MEDIA ACCESS CONTROL (MAC) PROTOCOL FOR NETWORKS THAT OPTIMAL GUARANTEED SERVICES TIMED TOKEN (OGSTT) MEDIA ACCESS CONTROL () PROTOCOL FOR NETWORKS THAT SUPPORT HARD R AND NON R S. Ozuomba 1, C. O. Amaefule 2, J. J. Afolayan 3 1, 3DEPT. OF ELECTRICAL/ELECTRONIC

More information

Space Time Equalization-space time codes System Model for STCM

Space Time Equalization-space time codes System Model for STCM Space Tme Eualzaton-space tme codes System Model for STCM The system under consderaton conssts of ST encoder, fadng channel model wth AWGN, two transmt antennas, one receve antenna, Vterb eualzer wth deal

More information

VRT014 User s guide V0.8. Address: Saltoniškių g. 10c, Vilnius LT-08105, Phone: (370-5) , Fax: (370-5) ,

VRT014 User s guide V0.8. Address: Saltoniškių g. 10c, Vilnius LT-08105, Phone: (370-5) , Fax: (370-5) , VRT014 User s gude V0.8 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual

More information

Micro-grid Inverter Parallel Droop Control Method for Improving Dynamic Properties and the Effect of Power Sharing

Micro-grid Inverter Parallel Droop Control Method for Improving Dynamic Properties and the Effect of Power Sharing 2015 AASRI Internatonal Conference on Industral Electroncs and Applcatons (IEA 2015) Mcro-grd Inverter Parallel Droop Control Method for Improvng Dynamc Propertes and the Effect of Power Sharng aohong

More information

Performance Analysis of Multi User MIMO System with Block-Diagonalization Precoding Scheme

Performance Analysis of Multi User MIMO System with Block-Diagonalization Precoding Scheme Performance Analyss of Mult User MIMO System wth Block-Dagonalzaton Precodng Scheme Yoon Hyun m and Jn Young m, wanwoon Unversty, Department of Electroncs Convergence Engneerng, Wolgye-Dong, Nowon-Gu,

More information

Control Chart. Control Chart - history. Process in control. Developed in 1920 s. By Dr. Walter A. Shewhart

Control Chart. Control Chart - history. Process in control. Developed in 1920 s. By Dr. Walter A. Shewhart Control Chart - hstory Control Chart Developed n 920 s By Dr. Walter A. Shewhart 2 Process n control A phenomenon s sad to be controlled when, through the use of past experence, we can predct, at least

More information

TODAY S wireless networks are characterized as a static

TODAY S wireless networks are characterized as a static IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 10, NO. 2, FEBRUARY 2011 161 A Spectrum Decson Framework for Cogntve Rado Networks Won-Yeol Lee, Student Member, IEEE, and Ian F. Akyldz, Fellow, IEEE Abstract

More information

Joint Adaptive Modulation and Power Allocation in Cognitive Radio Networks

Joint Adaptive Modulation and Power Allocation in Cognitive Radio Networks I. J. Communcatons, etwork and System Scences, 8, 3, 7-83 Publshed Onlne August 8 n ScRes (http://www.scrp.org/journal/jcns/). Jont Adaptve Modulaton and Power Allocaton n Cogntve Rado etworks Dong LI,

More information

White Paper. OptiRamp Model-Based Multivariable Predictive Control. Advanced Methodology for Intelligent Control Actions

White Paper. OptiRamp Model-Based Multivariable Predictive Control. Advanced Methodology for Intelligent Control Actions Whte Paper OptRamp Model-Based Multvarable Predctve Control Advanced Methodology for Intellgent Control Actons Vadm Shapro Dmtry Khots, Ph.D. Statstcs & Control, Inc., (S&C) propretary nformaton. All rghts

More information

Chapter 2 Two-Degree-of-Freedom PID Controllers Structures

Chapter 2 Two-Degree-of-Freedom PID Controllers Structures Chapter 2 Two-Degree-of-Freedom PID Controllers Structures As n most of the exstng ndustral process control applcatons, the desred value of the controlled varable, or set-pont, normally remans constant

More information

RC Filters TEP Related Topics Principle Equipment

RC Filters TEP Related Topics Principle Equipment RC Flters TEP Related Topcs Hgh-pass, low-pass, Wen-Robnson brdge, parallel-t flters, dfferentatng network, ntegratng network, step response, square wave, transfer functon. Prncple Resstor-Capactor (RC)

More information

Automatic Voltage Controllers for South Korean Power System

Automatic Voltage Controllers for South Korean Power System Automatc Voltage lers for South Korean Power System Xng Lu Vathanathan Man Venkatasubramanan Tae-Kyun Km Washngton State Unversty Korea Electrc Power Research nsttute Pullman, WA 9964-2752 Seoul, South

More information

Multi-Robot Map-Merging-Free Connectivity-Based Positioning and Tethering in Unknown Environments

Multi-Robot Map-Merging-Free Connectivity-Based Positioning and Tethering in Unknown Environments Mult-Robot Map-Mergng-Free Connectvty-Based Postonng and Tetherng n Unknown Envronments Somchaya Lemhetcharat and Manuela Veloso February 16, 2012 Abstract We consder a set of statc towers out of communcaton

More information

Algorithms Airline Scheduling. Airline Scheduling. Design and Analysis of Algorithms Andrei Bulatov

Algorithms Airline Scheduling. Airline Scheduling. Design and Analysis of Algorithms Andrei Bulatov Algorthms Arlne Schedulng Arlne Schedulng Desgn and Analyss of Algorthms Andre Bulatov Algorthms Arlne Schedulng 11-2 The Problem An arlne carrer wants to serve certan set of flghts Example: Boston (6

More information

An Adaptive Over-current Protection Scheme for MV Distribution Networks Including DG

An Adaptive Over-current Protection Scheme for MV Distribution Networks Including DG An Adaptve Over-current Protecton Scheme for MV Dstrbuton Networks Includng DG S.A.M. Javadan Islamc Azad Unversty s.a.m.javadan@gmal.com M.-R. Haghfam Tarbat Modares Unversty haghfam@modares.ac.r P. Barazandeh

More information

Non-Cooperative Design of Translucent Networks

Non-Cooperative Design of Translucent Networks Non-Cooperatve Desgn of Translucent Networs Benoît Châtelan, She Mannor, Franços Gagnon, Davd V. Plant McGll Unversty, Electrcal and Computer Engneerng, 3480 Unversty, Montreal, Canada, H3A A7 École de

More information

Uplink User Selection Scheme for Multiuser MIMO Systems in a Multicell Environment

Uplink User Selection Scheme for Multiuser MIMO Systems in a Multicell Environment Uplnk User Selecton Scheme for Multuser MIMO Systems n a Multcell Envronment Byong Ok Lee School of Electrcal Engneerng and Computer Scence and INMC Seoul Natonal Unversty leebo@moble.snu.ac.kr Oh-Soon

More information

MODEL ORDER REDUCTION AND CONTROLLER DESIGN OF DISCRETE SYSTEM EMPLOYING REAL CODED GENETIC ALGORITHM J. S. Yadav, N. P. Patidar, J.

MODEL ORDER REDUCTION AND CONTROLLER DESIGN OF DISCRETE SYSTEM EMPLOYING REAL CODED GENETIC ALGORITHM J. S. Yadav, N. P. Patidar, J. ABSTRACT Research Artcle MODEL ORDER REDUCTION AND CONTROLLER DESIGN OF DISCRETE SYSTEM EMPLOYING REAL CODED GENETIC ALGORITHM J. S. Yadav, N. P. Patdar, J. Sngha Address for Correspondence Maulana Azad

More information

Throughput Maximization by Adaptive Threshold Adjustment for AMC Systems

Throughput Maximization by Adaptive Threshold Adjustment for AMC Systems APSIPA ASC 2011 X an Throughput Maxmzaton by Adaptve Threshold Adjustment for AMC Systems We-Shun Lao and Hsuan-Jung Su Graduate Insttute of Communcaton Engneerng Department of Electrcal Engneerng Natonal

More information

A study of turbo codes for multilevel modulations in Gaussian and mobile channels

A study of turbo codes for multilevel modulations in Gaussian and mobile channels A study of turbo codes for multlevel modulatons n Gaussan and moble channels Lamne Sylla and Paul Forter (sylla, forter)@gel.ulaval.ca Department of Electrcal and Computer Engneerng Laval Unversty, Ste-Foy,

More information

The Spectrum Sharing in Cognitive Radio Networks Based on Competitive Price Game

The Spectrum Sharing in Cognitive Radio Networks Based on Competitive Price Game 8 Y. B. LI, R. YAG, Y. LI, F. YE, THE SPECTRUM SHARIG I COGITIVE RADIO ETWORKS BASED O COMPETITIVE The Spectrum Sharng n Cogntve Rado etworks Based on Compettve Prce Game Y-bng LI, Ru YAG., Yun LI, Fang

More information

The Effect Of Phase-Shifting Transformer On Total Consumers Payments

The Effect Of Phase-Shifting Transformer On Total Consumers Payments Australan Journal of Basc and Appled Scences 5(: 854-85 0 ISSN -88 The Effect Of Phase-Shftng Transformer On Total Consumers Payments R. Jahan Mostafa Nck 3 H. Chahkand Nejad Islamc Azad Unversty Brjand

More information

problems palette of David Rock and Mary K. Porter 6. A local musician comes to your school to give a performance

problems palette of David Rock and Mary K. Porter 6. A local musician comes to your school to give a performance palette of problems Davd Rock and Mary K. Porter 1. If n represents an nteger, whch of the followng expressons yelds the greatest value? n,, n, n, n n. A 60-watt lghtbulb s used for 95 hours before t burns

More information

Review: Our Approach 2. CSC310 Information Theory

Review: Our Approach 2. CSC310 Information Theory CSC30 Informaton Theory Sam Rowes Lecture 3: Provng the Kraft-McMllan Inequaltes September 8, 6 Revew: Our Approach The study of both compresson and transmsson requres that we abstract data and messages

More information

ELECTRONIC WAVELENGTH TRANSLATION IN OPTICAL NETWORKS. Milan Kovacevic and Anthony Acampora. Center for Telecommunications Research

ELECTRONIC WAVELENGTH TRANSLATION IN OPTICAL NETWORKS. Milan Kovacevic and Anthony Acampora. Center for Telecommunications Research ELECTRONIC WAVELENGTH TRANSLATION IN OPTICAL NETWORKS Mlan Kovacevc Anthony Acampora Department of Electrcal Engneerng Center for Telecommuncatons Research Columba Unversty, New York, NY 0027-6699 Abstract

More information

@IJMTER-2015, All rights Reserved 383

@IJMTER-2015, All rights Reserved 383 SIL of a Safety Fuzzy Logc Controller 1oo usng Fault Tree Analyss (FAT and realablty Block agram (RB r.-ing Mohammed Bsss 1, Fatma Ezzahra Nadr, Prof. Amam Benassa 3 1,,3 Faculty of Scence and Technology,

More information

Voltage security constrained reactive power optimization incorporating wind generation

Voltage security constrained reactive power optimization incorporating wind generation Unversty of Wollongong Research Onlne Faculty of Engneerng and Informaton Scences - Papers: Part A Faculty of Engneerng and Informaton Scences 2012 Voltage securty constraned reactve power optmzaton ncorporatng

More information

Webinar Series TMIP VISION

Webinar Series TMIP VISION Webnar Seres TMIP VISION TMIP provdes techncal support and promotes knowledge and nformaton exchange n the transportaton plannng and modelng communty. DISCLAIMER The vews and opnons expressed durng ths

More information

Application of Intelligent Voltage Control System to Korean Power Systems

Application of Intelligent Voltage Control System to Korean Power Systems Applcaton of Intellgent Voltage Control System to Korean Power Systems WonKun Yu a,1 and HeungJae Lee b, *,2 a Department of Power System, Seol Unversty, South Korea. b Department of Power System, Kwangwoon

More information

MIMO Precoding Using Rotating Codebooks

MIMO Precoding Using Rotating Codebooks 1 MIMO Precodng Usng Rotatng Codebooks C Jang, M Wang, C Yang Abstract Next generaton wreless communcatons rely on multple nput multple output (MIMO) technques to acheve hgh data rates. eedback of channel

More information

Discussion on How to Express a Regional GPS Solution in the ITRF

Discussion on How to Express a Regional GPS Solution in the ITRF 162 Dscusson on How to Express a Regonal GPS Soluton n the ITRF Z. ALTAMIMI 1 Abstract The usefulness of the densfcaton of the Internatonal Terrestral Reference Frame (ITRF) s to facltate ts access as

More information

Achieving Transparent Coexistence in a Multi-hop Secondary Network Through Distributed Computation

Achieving Transparent Coexistence in a Multi-hop Secondary Network Through Distributed Computation Achevng Transparent Coexstence n a Mult-hop econdary Network Through Dstrbuted Computaton Xu Yuan Y h Y. Thomas Hou Wenng Lou cott F. Mdkff astry Kompella Vrgna olytechnc Insttute and tate Unversty, UA

More information

Optimal Design of High Density WLANs

Optimal Design of High Density WLANs Optmal Desgn of Hgh Densty 8. WLANs Vvek P. Mhatre Thomson Research Lab, Pars, France mhatre@gmal.com Konstantna Papagannak Intel Research Cambrdge, UK dna.papagannak@ntel.com Abstract: The provsonng of

More information

Tile Values of Information in Some Nonzero Sum Games

Tile Values of Information in Some Nonzero Sum Games lnt. ournal of Game Theory, Vot. 6, ssue 4, page 221-229. Physca- Verlag, Venna. Tle Values of Informaton n Some Nonzero Sum Games By P. Levne, Pars I ), and ZP, Ponssard, Pars 2 ) Abstract: The paper

More information

Walsh Function Based Synthesis Method of PWM Pattern for Full-Bridge Inverter

Walsh Function Based Synthesis Method of PWM Pattern for Full-Bridge Inverter Walsh Functon Based Synthess Method of PWM Pattern for Full-Brdge Inverter Sej Kondo and Krt Choesa Nagaoka Unversty of Technology 63-, Kamtomoka-cho, Nagaoka 9-, JAPAN Fax: +8-58-7-95, Phone: +8-58-7-957

More information

MASTER TIMING AND TOF MODULE-

MASTER TIMING AND TOF MODULE- MASTER TMNG AND TOF MODULE- G. Mazaher Stanford Lnear Accelerator Center, Stanford Unversty, Stanford, CA 9409 USA SLAC-PUB-66 November 99 (/E) Abstract n conjuncton wth the development of a Beam Sze Montor

More information

Resource Control for Elastic Traffic in CDMA Networks

Resource Control for Elastic Traffic in CDMA Networks Resource Control for Elastc Traffc n CDMA Networks Vaslos A. Srs Insttute of Computer Scence, FORTH Crete, Greece vsrs@cs.forth.gr ACM MobCom 2002 Sep. 23-28, 2002, Atlanta, U.S.A. Funded n part by BTexact

More information

A Fuzzy-based Routing Strategy for Multihop Cognitive Radio Networks

A Fuzzy-based Routing Strategy for Multihop Cognitive Radio Networks 74 Internatonal Journal of Communcaton Networks and Informaton Securty (IJCNIS) Vol. 3, No., Aprl 0 A Fuzzy-based Routng Strategy for Multhop Cogntve Rado Networks Al El Masr, Naceur Malouch and Hcham

More information

IEE Electronics Letters, vol 34, no 17, August 1998, pp ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES

IEE Electronics Letters, vol 34, no 17, August 1998, pp ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES IEE Electroncs Letters, vol 34, no 17, August 1998, pp. 1622-1624. ESTIMATING STARTING POINT OF CONDUCTION OF CMOS GATES A. Chatzgeorgou, S. Nkolads 1 and I. Tsoukalas Computer Scence Department, 1 Department

More information

HUAWEI TECHNOLOGIES CO., LTD. Huawei Proprietary Page 1

HUAWEI TECHNOLOGIES CO., LTD. Huawei Proprietary Page 1 Project Ttle Date Submtted IEEE 802.16 Broadband Wreless Access Workng Group Double-Stage DL MU-MIMO Scheme 2008-05-05 Source(s) Yang Tang, Young Hoon Kwon, Yajun Kou, Shahab Sanaye,

More information

Channel Alternation and Rotation in Narrow Beam Trisector Cellular Systems

Channel Alternation and Rotation in Narrow Beam Trisector Cellular Systems Channel Alternaton and Rotaton n Narrow Beam Trsector Cellular Systems Vncent A. Nguyen, Peng-Jun Wan, Ophr Freder Illnos Insttute of Technology-Communcaton Laboratory Research Computer Scence Department-Chcago,

More information

Network Reconfiguration of Distribution System Using Artificial Bee Colony Algorithm

Network Reconfiguration of Distribution System Using Artificial Bee Colony Algorithm World Academy of Scence, Engneerng and Technology Internatonal Journal of Electrcal and Computer Engneerng ol:8, No:, 014 Network Reconfguraton of Dstrbuton System Usng Artfcal Bee Colony Algorthm S. Ganesh

More information

Low Switching Frequency Active Harmonic Elimination in Multilevel Converters with Unequal DC Voltages

Low Switching Frequency Active Harmonic Elimination in Multilevel Converters with Unequal DC Voltages Low Swtchng Frequency Actve Harmonc Elmnaton n Multlevel Converters wth Unequal DC Voltages Zhong Du,, Leon M. Tolbert, John N. Chasson, Hu L The Unversty of Tennessee Electrcal and Computer Engneerng

More information

Fall 2018 #11 Games and Nimbers. A. Game. 0.5 seconds, 64 megabytes

Fall 2018 #11 Games and Nimbers. A. Game. 0.5 seconds, 64 megabytes 5-95 Fall 08 # Games and Nmbers A. Game 0.5 seconds, 64 megabytes There s a legend n the IT Cty college. A student that faled to answer all questons on the game theory exam s gven one more chance by hs

More information