Dynamic Wavelength Routing in WDM Networks under Multiple Signal Quality Constraints
|
|
- Lizbeth Lloyd
- 5 years ago
- Views:
Transcription
1 Dynamc Wavelength Routng n WDM Networks under Multple Sgnal Qualty Constrants Wey Zhang, Guolang Xue, Senor Member, IEEE, Jan Tang, Krshnayan Thulasraman, Fellow, IEEE Abstract Most research works n routng and desgn of optcal networks assume that the optcal medum can carry sgnals wthout any bt error. However, the physcal mparments on the optcal sgnal qualty ntroduced by optcal components, such as erbum-doped fber amplfers (EDFA) and optcal cross connects (OXCs), must be consdered n the routng and desgn problems of WDM networks n practce. In ths paper, we studed the dynamc connecton provsonng problem n WDM networks under multple sgnal qualty constrants. We present a polynomal tme optmal algorthm that fnds an actve path for an ncomng connecton request wth mnmum network resource consumpton. Smulaton results show that our soluton outperforms the prevously best soluton to the problem. Keywords: WDM networks, lghtpath, routng algorthm, OEO modules, path provsonng. INTRODUCTION Fber optcs have replaced copper to be the prmary transmsson medum. Wavelength Dvson Multplexng (WDM) networks effectvely ncrease sngle-lnk bandwdth from Mbps to over 6Gbps, consequently have been consdered as a promsng canddate for the next-generaton backbone network by researchers n the feld. There have been many prevous works on routng and wavelength assgnment (RWA) problem [2], [7], [8]. Most prevous works have nvestgated the problems under the assumpton that the optcal medum s an deal one whch can carry data sgnals wthout any bt error. Under ths assumpton, the effects of transmsson mparments on the sgnal qualty of a connecton do not need to be consdered. However, at the present tme, a wavelength-routed network faces several techncal dffcultes n overcomng the physcal mparments ntroduced by optcal components such as erbum-doped fber amplfers (EDFA) and optcal cross connects (OXCs). Physcal mparments, e.g., power loss, noses, and dspersons, mpose fundamental constrants on the qualty of sgnals n WDM optcal networks [5], [], [4]. Therefore, at the destnaton node, the receved sgnal qualty may be so poor that the bt-error rate (BER) could be too hgh to be acceptable, thereby makng the lghtpath unusable [], [5], [9], []. In [9], the authors analyzed the mpact of transmsson performance n WDM networks under dfferent routng strateges. In [5], the authors consdered the mpact of transmsson mparments on the teletraffc performance n WDM networks. Huang et al. [4] proposed a physcal layer herarchcal RWA Wey Zhang s wth the Department of Computer Scence, North Dakota State Unversty, Fargo, ND 585. Emal: wey.zhang@ndsu.edu. Guolang Xue s wth the Department of Computer Scence and Engneerng, Arzona State Unversty, Tempe, AZ Emal: xue@asu.edu. Jan Tang s wth the Department of Computer Scence, Montana State Unversty, Bozeman, MT Emal: tang@cs.montana.edu. Krshnayan Thulasraman s wth the School of Computer Scence, Unversty of Oklahoma, Norman, OK 739. Emal: thulas@ou.edu. model to evaluate optcal sgnal-to-nose rato (OSNR) and polarzaton mode dsperson (PMD) on a canddate lghtpath, and decde whether to set up the lghtpath on network layer. However, the aforementoned works cannot recover the optcal sgnal n a lghtpath. Wth current technology, only OEO (optcal-electrcal-optcal) converson can solve such a problem [4], [3], [4]. The concept of translucent networks was proposed n [6]. In a translucent WDM mesh network, a small number of OEO modules are placed sparsely. Wth sparse OEO regeneraton, an optcal sgnal can travel as long as possble before ts sgnal qualty falls below a threshold. How to provde lghtpaths wth sparse OEO converson n translucent WDM mesh networks has been studed recently. In [], consderng a sngle sgnal constrant, a new 2-D Djkstra s algorthm was provded to fnd a connecton. In [4], consderng the OSNR constrant, the authors provded several smple heurstcs to fnd paths for connecton requests. We note that both works consdered only one sgnal constrant and both used a smple regeneraton model. They also assumed that there s at most one regenerator on each node, and do not consder the regenerator shareablty ssue [3]. In [2], the authors provded a practcal network model. Wth the consderaton of multple lnear sgnal constrants, the authors proposed several heurstcs to fnd paths for connecton requests. None of the prevous works guarantees a feasble actve path for an ncomng connecton request even when feasble paths exst. In ths paper, we use the sophstcated network model proposed n [2], and propose a novel algorthm whch can fnd workng paths for ncomng requests f feasble paths exst. Moreover, our algorthm can fnd an optmal soluton whch uses the mnmum number of OEO modules. The rest of the paper s organzed as follows. In Secton 2, we ntroduce the transmsson mparments n optcal networks, and descrbe the network model used and the problem we study. Ths s followed by Secton 3 wth a study of the dynamc path provsonng problem. Performance evaluaton of our algorthms s presented n Secton 4. We conclude our work n Secton 5, summarzng our contrbutons. 2. PROBLEM FORMULATION A. Transmsson Imparments n Optcal Networks Two lnear mparments are consdered n ths paper: Amplfer Spontaneous Emsson (ASE) and Polarzaton Mode Dsperson (PMD), whch are regarded as the two key lnear mparments that can be practcally used to constran optcal layer routng []. These two mparments have been extensvely dscussed n many prevous works [4], [6], [], [3]. ) Polarzaton Mode Dsperson: PMD management requres that the tme-average dfferental tme delay between /8/$ IEEE. Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the IEEE "GLOBECOM" 28 proceedngs.
2 two orthogonal states of polarzatons, [Δ t ], be less than a fracton α of the bt duraton, T = /B, where B s the bt rate. A typcal value for α s. []. Assume that a transparent segment conssts of M fber spans, where the kth span has length L(k) and fber PMD parameter D PMD (k). The average dfferental delay s expressed as: B M D PMD (k) 2 L(k) α () k= Assume that the length of a fber span s nteger, and all fber spans have the same PMD parameters,.e., D PMD (k) = D PMD, PMD gves the constrant on the length of a lghtpath wth acceptable BER: M α 2 L = L(k) B 2 D 2 = C PMD (2) k= PMD 2) Amplfer Spontaneous Emsson: ASE s the domnant nose n optcal networks, and degrades the sgnal to nose rato. An acceptable optcal SNR level (SNR mn ) whch depends on the bt rate and transmtter-recever technology needs to be mantaned at the recever. The upper bound on M, the maxmum number of spans, s obtaned usng the OSNR constrant n []: M P L n sp(k)(g(k) ) (3) 2hvB k= osnr mn where P L s the average optcal power at the transmtter, G(k) and n sp (k) are the amplfer gan and excess nose factor, respectvely, on the kth span, h = J/Hz s the Planck s constant, v s the carrer frequency, and B o s the optcal bandwdth. Assume the M optcal spans ntroducng the same nose power and that each optcal amplfer has the same power gan G. Then P L M = C 2SNR mn n sp hv(g )B ASE (4) o ASE can be understood as the constrant for the maxmum number of lnks a lghtpath may have. B. Network Model In ths paper, we consder a translucent network, whch s a wavelength-routed mesh network wth the capablty of sparse OEO regeneraton [3]. Such a network conssts of a number of wavelength-routng nodes wth optonal OEO modules and nterconnected by optcal fber lnks. We assume that each lnk has a sngle fber n each drecton, whle each fber has a fxed number of wavelengths that are used to carry data. Each node has a fxed number of add and drop ports, through whch the user data can access the network. The node has nherent regeneraton resources because t provdes the basc regeneraton resource of Tx/Rx pars. 3R (regenerate, reshape and retme) regenerators can be attached between a Tx-Rx par to mplement sgnal regeneraton n the electronc doman. The combnaton of a transmtter, a recever and an electronc 3R regenerator s called an OEO module [3]. Such a node model allows all-optcal swtchng, by WRS swtchng, as well as OEO regeneraton by usng an OEO module on the node. The path from the source node to the destnaton node s dvded nto several segments by OEO regeneratons at ntermedate nodes, whch are named regeneraton nodes. Each segment s defned as a regeneraton segment [3]. C. Problem Statement We study a dynamc WDM routng problem of great nterest to network servce provders. A wavelength on a fber s called as a channel. Terms OEO module and regenerator are used nterchangeably n ths paper. Throughout ths paper, W, m, n denote the number of wavelengths per fber, the number of lnks and the number of nodes of a network, respectvely. Defnton 2.: An r-node s a node wth OEO modules equpped. R-nodes s the set of all r-nodes. Defnton 2.2 (Dynamc Relable WDM Routng Problem): Gven the followng nformaton of a translucent network: ) New connecton requests that arrve dynamcally; 2) The network topology and the number of wavelengths W on each fber; 3) The R-nodes n the network, and the number of OEO modules on each r-node; 4) Current network accommodaton status. In other words, we know whether a channel s free or used. The objectve of the problems s to satsfy each comng connecton request wth an actve path, on whch the sgnal qualty receved at each node must be recognzable. A path whch satsfes the sgnal qualty constrants s a feasble soluton. An optmal soluton to ths problem s a feasble path whch uses the mnmum number of regenerators, and consumes the mnmum number of free wavelengths among all paths that use the mnmum number of regenerators. 3. DYNAMIC RELIABLE WDM ROUTING SCHEME In ths secton, we propose a novel scheme to fnd an optmal soluton to the Dynamc Relable WDM Routng problem f there exsts any feasble path. The request wll be dropped by our scheme f there s no feasble soluton. A. Novel Graph Transformaton PMD and ASE constrants are bounded by C PMD and C ASE, whch are both ntegers. In our algorthms, we use C and C2 to represent C ASE and C PMD, respectvely. ASE u and PMD u denote the ASE and PMD cost on node u for the comng connecton request. ASE(u, v) and PMD(u, v) are the ASE and PMD costs on edge (u, v). Our algorthm uses a novel graph transformaton to combne all nformaton; OEO and channel usage, PMD and ASE cost, nto a sngle auxlary graph. We frst present Algorthm to construct an auxlary graph G aux from the orgnal graph G. In Lne 2 and 3, on each wavelength plane, we splt each node u n G nto W (C+) (C2+) copes n the form u λ (c,c2), where (c,c2) s a possble (ASE, PMD) combnaton. For each node u G, we process t accordng to two cases. CASE : f u s NOT a r-node: From Lne 4 through Lne, for each edge (u, v) n the orgnal graph, a group of edges, from u λ (ASE to vλ u,pmd u) (ASE, are added nto Gaux v,pmd v). Each of these edges means that, gven a path from s to node u wth sgnal costs ASE u and PMD u on node u, f we extend the path by usng (u, v) for the connecton (s, d), then t has sgnal costs ASE v and PMD v when reachng node v, where ASE v =ASE u +ASE(u, v) and PMD v =PMD u +PMD(u, v) because no regeneraton can be appled on node u. The cost of such an edge s, whch s the cost of consumng a new channel /8/$ IEEE. Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the IEEE "GLOBECOM" 28 proceedngs.
3 Algorthm Setup Aux Graph(G, G aux, R-nodes) : for (each wavelength ) do 2: From the wavelength graph G λ of G, set up a wavelength graph G aux wth node set 3: Vλ Gaux =V G {,,...,C} {,,...,C2} and edge set Eλ Gaux : 4: for (each node u/ R-nodes) do 5: for (each undrected edge (u, v) n G λ do 6: Add drected edges from u v nto EGaux (ASE u,pmd u) ff: (ASE v,pmd v) 7: ASE v=ase u+ase(u,v) C and PMD v=pmd u+pmd(u,v) C2; 8: Assgn cost to ths edge; 9: end for : end for : for (each node u R-nodes) do 2: f (there s free Tx-Rx par on node u) then 3: Add a drected edge nto E Gaux from vertex u (ASE to vertex u,pmd u u) (,) ; 4: Assgn cost to the edge; 5: end f 6: for (each undrected edge (u, v) n E G ) do 7: Add drected edges from u (ASE u,pmd u) v nto EGaux (ASE v,pmd v) such that: 8: ASE v=ase u+ase(u,v) C and PMD v=pmd u+pmd(u,v) C2; 9: Assgn cost to ths edge; 2: end for 2: end for 22: end for 23: for (each par of wavelengths and λ j) do 24: for (each node u R-nodes) do 25: Connectng u, and uλ j, wth a new edge; 26: Assgn cost to ths edge; 27: end for 28: end for 29: The constructed auxlary graph G aux s composed by node set V Gaux = Vλ Gaux, and edge set E Gaux = W W E Gaux We do not add an edge f ASE v >C ASE or PMD v >C PMD because obvously such an edge s not on any feasble path. CASE 2: f u s a r-node: From Lne through Lne 2, f there s a free Tx-Rx par on node u, t can apply regeneraton. Thus, new edges are added from u λ (ASE to uλ u,pmd u) (,), whch represents that the sgnal s cleared and restored. The cost of such an edge s (>> ), whch means usng a regenerator has cost. Meanwhle, node u can choose not to apply regeneraton, Ths case s handled the same as the case that node u s not a r-node (Lnes 6-2). In the FOR-loop n Lnes 23-28, for each r-node u, we connect u λ, and uλj, for any two wavelength and λ j. Such an edge represents that a wavelength converson, together wth regeneraton, s appled at node u. The cost of such an edge s because we do not allow the wavelength converson n ths work. Let us use an example to llustrate Algorthm. The orgnal network s shown n Fg. (a), whch conssts of 4 nodes and 4 edges. Assume that only node x s a r-node. There are 2 to to wavelengths on each edge, and the costs of ASE and PMD are shown as the edge label for each edge. Both C and C2 are set to be n the example. s (,) (,) x y (,) (2,) d d y y y s s s s x x x x d d d Wavelength plane y y y y y d s s s s x x x x d d d Wavelength plane 2 (a) Network G (b) The constructed auxlary graph G aux Fg.. Novel Graph Transformaton There are 2 wavelength planes n G aux. Intally, all channels are free. We use wavelength plane G λ for llustraton snce the operatons are the same on both planes. For each node n the orgnal network G, t s spltted nto (C+) (C2 +) copes. Each of them represents a possble (ASE, PMD) combnaton on the node. For example, node y means that the ASE cost at node y s, and the PMD cost s. Then we need to add edges nto G aux. Edges from s λ, to xλ, and y λ,, as well as edge (xλ,, dλ, ) are added. The edge (sλ,, x λ, ) mples that by takng edge (s, x) n G from source s, the ASE and PMD wll both be on node x. Each such edge has cost, whch means that we consume one free channel by utlzng ths edge for the connecton. But no other edges can be added because ether bound C or C2 would be volated. For the r-node x, we add edges from x λ (ASE x,pmd x) to xλ (,) wth cost, where M and N are the number of edges and nodes n G aux, respectvely. Usng such an edge represents that a regenerator on node x wll be used wth a large cost, whch mples that we would take all free channels for a connecton f possble rather than use a regenerator. Next,we connect x λ (,) to xλ2 (,) by a -cost edge because wavelength converson s not allowed n our algorthm. The constructed auxlary graph G aux s shown n Fg. (b). B. Optmal Soluton for Actve Path Provsonng After the auxlary graph constructon, Algorthm 2 s presented to fnd an optmal soluton for actve path provsonng. To fnd an actve path for request (s, d), we frst need to have the auxlary graph (Lnes - 3). Then from Lne 4 through Lne, we add some new edges whch are partcularly used for the ncomng request. On each wavelength plane, we have new edges from d λ ASE d,pmd d to d λ C,C2. Such an edge means that f we can fnd a path to node d wth sgnal costs less than threshold, we can reach the destnaton node n G aux, wth no more cost. Moreover, from Lne to Lne d λ C,C2 4, vertcally we connect s λ, to sλ+, and d λ C,C2 to dλ+ C,C2. These edges represent that we can start from source node s at any wavelength plane, and stop at destnaton node d at any wavelength plane too. Once we fnsh addng the new edges, n Lne 5 we use Algorthm 3 to fnd an optmal path for the request from s λ, to dλw (C,C2). Wth the found path AP n Gaux from Algorthm 3, Algorthm 2 can get the path actvep and OEO utlzaton n orgnal graph G (Lnes 6-8), or there s no feasble soluton and the request s dropped n Lne 2. In Lne 8 of Algorthm 2, all edges added for ths specfc request (s, d) wll be removed, and G aux s changed back to ts orgnal verson for future connecton requests /8/$ IEEE. Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the IEEE "GLOBECOM" 28 proceedngs.
4 Algorthm 2 Actve Path Provson(G, s, d, R-nodes) : f (auxlary graph G aux has not been constructed) then 2: Setup Aux Graph(G, G aux, R-nodes); 3: end f 4: for (each wavelength ) do 5: for (ASE d =; ASE d < C; ASE d ++) do 6: for (PMD d =; PMD d < C2; PMD d ++) do 7: Add zero-cost edges from node d to d ASE d,pmd C,C2 ; d 8: end for 9: end for : end for : for ( =;< W; ++) do 2: Add a zero-cost edge from node s, to node s+, ; 3: Add a zero-cost edge from node d C,C2 to node d+ C,C2 ; 4: end for 5: QualfedWorkngLP(G, G aux, s λ,, dλ W (C,C2) ); 6: f (an actve path AP s found) then 7: return AP; 8: Change the orgnal G aux back by removng edges added from Lne 4 to Lne 4; 9: else 2: Drop the connecton request (s, d); 2: end f Algorthm 3 QualfedWorkngLP(G, G aux, s λ,, dλw (C,C2) ) : for (each lnk e n G aux ) do 2: f (the channel on e s not free) then 3: remove e from G aux ; 4: end f 5: end for 6: for (each node u R-nodes) do 7: f (u has no more free OEO module) then 8: remove all ncomng edges to node u, and ts all nterlayer edges; 9: end f : end for : Compute the shortest path actvep from source s λ, to destnaton d λ W (C,C2) n auxlary graph Gaux ; 2: f (there does not exst such a path actvep) then 3: block the connecton request; 4: else 5: Return the path AP correspondng to actvep n G as workng path canddate; 6: end f In Algorthm 3, at frst all used channels are removed because actve paths cannot share channels (Lnes -5). Then n the FOR-loop startng from Lne 6, f a r-node u has no more free OEO module, we remove all edges to u λ, because no regeneraton can be appled, and u λ, can not be reached. After updatng the network, n Lne, shortest path algorthm, say Djkstra algorthm, can be used to fnd a shortest path from s λ, to dλw (C,C2) n Gaux. We return the found path as an actve path for the request (Lne 5). Let us use Fg. 2 for llustraton of our approach on the network shown n Fg. (a). Once we have the auxlary graph n Fg. (b), we add some new edges, whch are marked by the dashed edges n Fg. 2. For example, we add an edge from d to d on each wavelength plane, and connect s λ to sλ2. Then, a shortest path actvep ((s λ,xλ,xλ,dλ,dλ2 ))s found from node s λ (,) to node dλ2 (,) n ths graph, whch s marked by the thck red edges n Fg. 2. The path AP n G Fg. 2. y y y y s s s s x x x x d d d d Wavelength plane y y y y s s s s x x x x d d d d Fndng actve path for connecton (s, d). Wavelength plane 2 for ths example s (s, x, d) wth cost +2. We know that one OEO module needs to be utlzed on node x wth cost, and the number of the consumed free channels s two. Theorem 3.: For any connecton request, Algorthm 2 can correctly fnd a connecton n O(W C C2 m) tme f a feasble path exsts. In addton, the connecton uses the mnmum number of regenerators. Among all possble connectons whch use the mnmum number of regenerators, the computed path uses the mnmum number of free wavelengths. PROOF. Followng the constructon of G aux n Algorthm, we observe that G aux has a path actvep from s λ (,) to dλw (C,C2) f and only f there s a correspondng feasble path AP from s to d n graph G. In addton, because n G aux we remove all edges whch would brng the volaton to sgnal constrants, any path must reach a node d λ (pmd,ase) where pmd C and ase C2. Ths proves the correctness of the algorthm. To construct an auxlary graph (Lne 2 of Algorthm 2), each wavelength plane of the auxlary graph has O(n C C2) nodes, and O(C C2 (m+n)) edges. Totally G aux has O(W n C C2) nodes and O(W C C2 (m + n)+w 2 ) edges. In next two FOR-loops (Lne 4-4), we add O(W C C2) more edges. Then Algorthm 3 s called n Lne 5 to fnd a path. In Algorthm 3, frst t takes O(W C C2 m) tme to remove the used edges (Lnes 2-4). Then O(W C C2 n) tme s spent to update the edges ncdent wth the regeneraton nodes. In Lne of Algorthm 3, t takes O(W C C2 (m + n)) tme to fnd a shortest path n the acyclc graph G aux [3]. Fnally we use O(n) tme to fnd the path AP and return. Thus, Lne 5 of Algorthm 2 takes O(W C C2 (m + n)) tme. In total, we can fnd that the tme complexty of Algorthm 2 s O(W C C2 m) because m s larger than n snce the network G s connected. In our approach, the cost of usng a free channel s, and the cost of usng a free OEO module s. Hence for a connecton, we would use as many as free channels nstead of one free OEO module (note that there are at most N free channels can be used on a path). Therefore our algorthm can fnd a soluton wth the mnmum usage of regenerators, and the mnmum consumpton of channels whle usng the mnmum number of OEO modules. 4. PERFORMANCE EVALUATION We mplemented our algorthm of ths paper (denoted by AP-OPT n the fgures), and compared t wth the prevously best heurstc n [2] (denoted by HW-SPF+Trace-back n the fgures). A well-known network s used to study the routng capablty of the algorthms. Thus, connecton blockng probablty s the man performance crtera. Dfferent numbers of wavelengths (W ) on each fber and dfferent numbers of r-nodes are tested. For each test case, we generated dfferent /8/$ IEEE. Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the IEEE "GLOBECOM" 28 proceedngs.
5 random connecton requests. A connecton request s generated at each tme unt wth random source and destnaton, and has a lfe tme whch s set to a random nteger unformly dstrbuted n [,]. The network used for our tests s the Pacfc Bell network (5 nodes and 2 lnks), shown n Fg. 3. Each lnk s labeled by ts length n klometers. The system parameters are set to typcal values as n [] Fg. 3. The 5-node/2-lnk Pacfc Bell network. When a connecton request arrves, we use both algorthms to compute a path. If we can fnd a feasble path, we reserve the correspondng network resources, ncludng regenerators and free channels. Otherwse the connecton request s dropped. Once a connecton s expred, all resources used by t are released. Our numercal results are presented n Fg. 4, where each fgure shows the average of runs. It s worth notng that we have also tested both algorthms on some randomly generated network topologes. The results are smlar. Therefore we only present the results for Pacfc Bell Network here due to the page lmt. In Fg. 4(a) and 4(b), we compared Blockng probablty (%) HW SPF,W=8,R node=25% AP OPT,W=8,R node=25% HW SPF,W=6,R node=25% AP OPT,W=6,R node=25% Number of connecton requests Blockng probablty (%) HW SPF,W=8,R node=33% AP OPT,W=8,R node=33% HW SPF,W=6,R node=33% AP OPT,W=6,R node=33% Number of connecton requests (a) Wth 25% r-nodes (b) Wth 33% r-nodes Fg. 4. Performance comparsons between AP-OPT and HW-SPF the routng capablty between two algorthms wth randomly generated r-nodes whch consttutes 25% and 33% of all nodes, respectvely. On each r-node, as n [3], the number of OEO modules s assumed the same as the number of wavelengths on a fber. 4 to connectons were generated and njected nto the network one by one. We can observe that AP-OPT has notceable lower blockng probablty than HW- SPF+trace-back heurstc for all scenaros. For example, wth the settng of W=6, R-nodes consttutng 25% of all nodes, and the number of connecton requests beng 7, AP-OPT acheved the blockng probablty of 2%. Note that a blockng probablty obtaned by HW-SPF+Trace-back heurstc s about 22%. Another nterestng observaton s that the number of r-nodes has more sgnfcant effect than the number of wavelengths per fber at reducng the blockng probablty. For example, gven 33% R-nodes and W=8, HW-SPF+Traceback has better performance than t has wth more wavelength (W =6) but less R-nodes (25%). Smlar property can also be observed from the results of our algorthm. In Fg. 5, we compare the consumptons of OEO modules and free channels between two algorthms, whch s represented by the y-axle. And x-axle represents the rato of the number of r-nodes n the network. Dynamc connecton requests are kept beng nserted nto the network untl both algorthms accommodated Fg Wavelength and OEO consumpton Wavelength by HW SPF Wavelength by AP OPT OEO by HW SPF OEO by AP OPT r node rato (%) Network resource consumpton wth satsfed connectons connectons. From the Fg. 5, t shows that AP-OPT uses less number of OEO modules and free channels than HW- SPF+Trace-back does n all testng cases. Ths confrms our analyss at the end of Secton CONCLUSIONS In ths paper we consdered the dynamc relable routng problem n WDM networks under multple sgnal qualty constrants. We proposed a novel algorthm that can return a lghtpath for a connecton request f one exsts. The connecton uses the mnmum number of OEO regenerators. Also the computed path consumes the mnmum number of free wavelengths, among all connectons whch use the mnmum number of regenerators. Smulaton results demonstrated that our algorthm outperforms the prevously best heurstc n [2]. REFERENCES [] I. Cerutt, A. Fumagall, M. J. Potasek, Effect of chromatc dsperson and self-phase modulaton n multhop multrate WDM rngs, IEEE Photon. Technol. Lett., vol. 4, no. 3, pp. 4 43, Mar. 22. [2] I. Chlamtac, A. Ganz, G. Karm, Lghtpath Communcatons A Novel Approach to Hgh Speed Optcal WANs, IEEE Trans. on Commun., Vol. 4 No.7 July 992, pp [3] T. Cormen, C. Leserson, R. Rvest, C. Sten, Introducton to Algorthms, MIT Press; 2nd edton, 2. [4] Y. Huang, J. P. Herttage, B. Mukherjee, Connectons provsonng wth transmsson mparment consderaton n optcal WDM networks wth hgh-speed channels, Journal of Lghtwave Technology, vol. 23, no. 3, pp , Mar. 25. [5] B. Ramamurthy, D. Datta, H. Feng, J. P. Hertage, B. Mukherjee, Impact of transmsson mparments on the teletraffc performance of wavelength-routed optcal networks, Journal. Lghtw. Technol., vol. 7, no., pp , Oct [6] B. Ramamurthy, S. Yaragorla, X. Yang, Translucent optcal WDM networks for the next-generaton backbone networks,ieee GLOBECOM 2, San Antono, TX, Nov. 2. [7] R. Ramaswam, K. Svarajan, Routng and wavelength assgnment n all-optcal networks, IEEE/ACM Trans. Networks., vol. 3, pp , Jun [8] S. Ramamurthy, B. Mukherjee, Survvable WDM mesh networks. Part I-Protecton IEEE INFOCOM999, pp [9] R. Sabella, E. Iannone, M. Lstant, M. Berdusco, S. Bnett, Impact of transmsson performance on path routng n all-optcal transport networks, J. Lghtw. Technology., vol. 6, no., pp , Nov [] G. Shen, W. D. Grover, T. H. Cheng, S. K. Bose, Sparse placement of electronc swtchng nodes for low blockng n translucent optcal networks, Journal of Optcal Networkng, vol., pp , Dec 22. [] J. Strand, A. L. Chu, R. Tkach, Issues for routng n the optcal layer, IEEE Commun. Mag., vol. 39, no. 2, pp. 8 87, Feb. 2. [2] X. Yang, B. Ramamurthy, Sparse Regeneraton n translucent wavelength-routed optcal networks: archtecture, network desgn and wavelength routng, Sprnger Journal of Photonc Network Communcatons, vol., no., pp , Jul. 25. [3] X. Yang, L. Shen, B. Ramamurthy, Survvable lghtpath provsonng n WDM mesh networks under shared path protecton and sgnal qualty constrants, Journal of Lghtwave Technology, vol. 23, no. 4, pp , Apr. 25 [4] H. Zang, R. Huang, J. Pan, Methodologes on desgnng a hybrd sharedmesh-protected WDM network wth sparse wavelength converson and regeneraton, Proc. SPIE, vol. 49, pp , Sep /8/$ IEEE. Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the IEEE "GLOBECOM" 28 proceedngs.
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 informationELECTRONIC 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 informationAlgorithms 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 informationNon-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 informationDefine 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 informationDigital 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 informationDynamic 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 informationReview: 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 informationA 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 informationRouting in all-optical DWDM Networks with Sparse Wavelength Conversion Capabilities
Routng n all-optcal DWDM Networks wth Sparse Wavelength Converson Capabltes Ala I. Al-Fuqaha LAMBDA Optcal Systems 200 Sunset Hlls Rd. Reston, Vrgna U.S.A ala@eee.org Ghulam M. Chaudhry SCE-CSEE Unversty
More informationUncertainty 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 informationCalculation 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 informationEfficient Large Integers Arithmetic by Adopting Squaring and Complement Recoding Techniques
The th Worshop on Combnatoral Mathematcs and Computaton Theory Effcent Large Integers Arthmetc by Adoptng Squarng and Complement Recodng Technques Cha-Long Wu*, Der-Chyuan Lou, and Te-Jen Chang *Department
More informationAdaptive 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 informationEvaluate the Effective of Annular Aperture on the OTF for Fractal Optical Modulator
Global Advanced Research Journal of Management and Busness Studes (ISSN: 2315-5086) Vol. 4(3) pp. 082-086, March, 2015 Avalable onlne http://garj.org/garjmbs/ndex.htm Copyrght 2015 Global Advanced Research
More informationUnderstanding the Spike Algorithm
Understandng the Spke Algorthm Vctor Ejkhout and Robert van de Gejn May, ntroducton The parallel soluton of lnear systems has a long hstory, spannng both drect and teratve methods Whle drect methods exst
More informationJoint 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 informationTopology 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 informationLower-Bound on Blocking Probability of A Class of Crosstalkfree Optical Cross-connects (OXCs)
Lower-Bound on Blockng Probablty of A Class of Crosstalkfree Optcal Cross-connects (OXCs) Chen Yu, Xaohong Jang and Susumu Horguch Graduate School of Informaton Scences, Tohoku Unversty, Senda, Japan Emal:
More informationPlanning of Relay Station Locations in IEEE (WiMAX) Networks
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the WCNC 010 proceedngs. Plannng of Relay Staton Locatons n IEEE 0.16 (WMAX) Networks
More informationComparative 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 informationDynamic 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 informationThe Performance Improvement of BASK System for Giga-Bit MODEM Using the Fuzzy System
Int. J. Communcatons, Network and System Scences, 10, 3, 1-5 do:10.36/jcns.10.358 Publshed Onlne May 10 (http://www.scrp.org/journal/jcns/) The Performance Improvement of BASK System for Gga-Bt MODEM Usng
More informationA 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 informationantenna 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 informationResource 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 informationRational Secret Sharing without Broadcast
Ratonal Secret Sharng wthout Broadcast Amjed Shareef, Department of Computer Scence and Engneerng, Indan Insttute of Technology Madras, Chenna, Inda. Emal: amjedshareef@gmal.com Abstract We use the concept
More informationNETWORK 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 informationHigh 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 informationSpace 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 informationA 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 informationFull-duplex Relaying for D2D Communication in mmwave based 5G Networks
Full-duplex Relayng for D2D Communcaton n mmwave based 5G Networks Boang Ma Hamed Shah-Mansour Member IEEE and Vncent W.S. Wong Fellow IEEE Abstract Devce-to-devce D2D communcaton whch can offload data
More informationHigh 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 informationMultiband Jamming Strategies with Minimum Rate Constraints
Multband Jammng Strateges wth Mnmum Rate Constrants Karm Banawan, Sennur Ulukus, Peng Wang, and Bran Henz Department of Electrcal and Computer Engneerng, Unversty of Maryland, College Park, MD 7 US Army
More informationGraph 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 informationParameter Free Iterative Decoding Metrics for Non-Coherent Orthogonal Modulation
1 Parameter Free Iteratve Decodng Metrcs for Non-Coherent Orthogonal Modulaton Albert Gullén Fàbregas and Alex Grant Abstract We study decoder metrcs suted for teratve decodng of non-coherently detected
More informationPerformance 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 informationWalsh 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 informationTECHNICAL 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 informationEE 508 Lecture 6. Degrees of Freedom The Approximation Problem
EE 508 Lecture 6 Degrees of Freedom The Approxmaton Problem Revew from Last Tme Desgn Strategy Theorem: A crcut wth transfer functon T(s) can be obtaned from a crcut wth normalzed transfer functon T n
More informationCOMPUTER networks nowadays rely on various middleboxes,
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, VOL. 14, NO. 3, SEPTEMBER 2017 631 Effcent Algorthms for Throughput Maxmzaton n Software-Defned Networks Wth Consoldated Mddleboxes Metan Huang, Wefa
More informationA High-Sensitivity Oversampling Digital Signal Detection Technique for CMOS Image Sensors Using Non-destructive Intermediate High-Speed Readout Mode
A Hgh-Senstvty Oversamplng Dgtal Sgnal Detecton Technque for CMOS Image Sensors Usng Non-destructve Intermedate Hgh-Speed Readout Mode Shoj Kawahto*, Nobuhro Kawa** and Yoshak Tadokoro** *Research Insttute
More informationTo: 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 informationOptical Amplifiers Placement in WDM Mesh Networks for Optical Multicasting Service Support
1 Optcal Amplfers Placement n WDM Mesh Networks for Optcal Multcastng Servce Support Ashraf M. Hamad and Ahmed E. Kamal Abstract The problem of placng the optcal amplfers (OAs) n wavelength-routng mesh
More informationSubcarrier allocation for OFDMA wireless channels using lagrangian relaxation methods
Unversty of Wollongong Research Onlne Faculty of Informatcs - Papers (Archve) Faculty of Engneerng and Informaton Scences 2006 Subcarrer allocaton for OFDMA wreless channels usng lagrangan relaxaton methods
More informationEnhancing Throughput in Wireless Multi-Hop Network with Multiple Packet Reception
Enhancng Throughput n Wreless Mult-Hop Network wth Multple Packet Recepton Ja-lang Lu, Paulne Vandenhove, We Shu, Mn-You Wu Dept. of Computer Scence & Engneerng, Shangha JaoTong Unversty, Shangha, Chna
More informationPassive 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 informationPriority 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 informationFigure.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 informationLearning 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 informationThroughput 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 informationNetwork 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 informationPower Allocation in Wireless Relay Networks: A Geometric Programming-Based Approach
ower Allocaton n Wreless Relay Networks: A Geometrc rogrammng-based Approach Khoa T. han, Tho Le-Ngoc, Sergy A. Vorobyov, and Chntha Telambura Department of Electrcal and Computer Engneerng, Unversty of
More informationVoltage 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 informationUtility-based Routing
Utlty-based Routng Je Wu Dept. of Computer and Informaton Scences Temple Unversty Roadmap Introducton Why Another Routng Scheme Utlty-Based Routng Implementatons Extensons Some Fnal Thoughts 2 . Introducton
More informationMaximizing Lifetime of Sensor-Target Surveillance in Wireless Sensor Networks
Maxmzng Lfetme of Sensor-Target Survellance n Wreless Sensor Networks Ha Lu, Xaowen Chu, Yu-Wng Leung Computer Scence, Hong Kong Baptst Unversty Xaohua Ja, Peng-Jun Wan Computer Scence, Cty Unversty of
More informationOptimal 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 informationLow 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 informationOn Interference Alignment for Multi-hop MIMO Networks
013 Proceedngs IEEE INFOCOM On Interference Algnment for Mult-hop MIMO Networks Huacheng Zeng Y Sh Y. Thomas Hou Wenng Lou Sastry Kompella Scott F. Mdkff Vrgna Polytechnc Insttute and State Unversty, USA
More informationGuidelines 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 informationMAINTENANCE-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 informationPrevention 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 informationHardware Design of Filter Bank-Based Narrowband/Wideband Interference Canceler for Overlaid TDMA/CDMA Systems
Hardware Desgn of Flter anased arrowband/deband Interference Canceler for Overlad TDMA/CDMA Systems Toyoau Ktano Kaunor Hayash Htosh Masutan and Shnsue Hara Graduate School of Engneerng Osaa Unversty YamadaOa
More informationA 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 informationResearch 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 informationOptimal Transmission Scheduling of Cooperative Communications with A Full-duplex Relay
1 Optmal Transmsson Schedulng of Cooperatve Communcatons wth A Full-duplex Relay Peng L Member IEEE Song Guo Senor Member IEEE Wehua Zhuang Fellow IEEE Abstract Most exstng research studes n cooperatve
More informationIEE 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 informationJoint Power Control and Scheduling for Two-Cell Energy Efficient Broadcasting with Network Coding
Communcatons and Network, 2013, 5, 312-318 http://dx.do.org/10.4236/cn.2013.53b2058 Publshed Onlne September 2013 (http://www.scrp.org/journal/cn) Jont Power Control and Schedulng for Two-Cell Energy Effcent
More informationCharacterization and Analysis of Multi-Hop Wireless MIMO Network Throughput
Characterzaton and Analyss of Mult-Hop Wreless MIMO Network Throughput Bechr Hamdaou EECS Dept., Unversty of Mchgan 226 Hayward Ave, Ann Arbor, Mchgan, USA hamdaou@eecs.umch.edu Kang G. Shn EECS Dept.,
More informationA 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 informationA MODIFIED DIFFERENTIAL EVOLUTION ALGORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS
A MODIFIED DIFFERENTIAL EVOLUTION ALORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS Kaml Dmller Department of Electrcal-Electroncs Engneerng rne Amercan Unversty North Cyprus, Mersn TURKEY kdmller@gau.edu.tr
More informationThe Synthesis of Dependable Communication Networks for Automotive Systems
06AE-258 The Synthess of Dependable Communcaton Networks for Automotve Systems Copyrght 2005 SAE Internatonal Nagarajan Kandasamy Drexel Unversty, Phladelpha, USA Fad Aloul Amercan Unversty of Sharjah,
More informationDecision 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 informationThe 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 informationWideband Gain Flattened Hybrid Erbium-doped Fiber Amplifier/Fiber Raman Amplifier
Journal of the Optcal Socety of Korea Vol. 14, No. 4, December 2010, pp. 342-350 DOI: 10.3807/JOSK.2010.14.4.342 Wdeband Gan Flattened Hybrd Erbum-doped Fber Amplfer/Fber Raman Amplfer Hossen Afkham Islamc
More informationResearch on Controller of Micro-hydro Power System Nan XIE 1,a, Dezhi QI 2,b,Weimin CHEN 2,c, Wei WANG 2,d
Advanced Materals Research Submtted: 2014-05-13 ISSN: 1662-8985, Vols. 986-987, pp 1121-1124 Accepted: 2014-05-19 do:10.4028/www.scentfc.net/amr.986-987.1121 Onlne: 2014-07-18 2014 Trans Tech Publcatons,
More informationNOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION
NOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION Phaneendra R.Venkata, Nathan A. Goodman Department of Electrcal and Computer Engneerng, Unversty of Arzona, 30 E. Speedway Blvd, Tucson, Arzona
More informationRejection of PSK Interference in DS-SS/PSK System Using Adaptive Transversal Filter with Conditional Response Recalculation
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol., No., November 23, 3-9 Rejecton of PSK Interference n DS-SS/PSK System Usng Adaptve Transversal Flter wth Condtonal Response Recalculaton Zorca Nkolć, Bojan
More informationRESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING
RESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING Vaslos A. Srs Insttute of Computer Scence (ICS), FORTH and Department of Computer Scence, Unversty of Crete P.O. Box 385, GR 7 Heraklon, Crete,
More informationThe 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 informationMedium Access Control for Multi-Channel Parallel Transmission in Cognitive Radio Networks
Medum ccess Control for Mult-Channel Parallel Transmsson n Cogntve Rado Networs Tao Shu, Shuguang Cu, and Marwan Krunz Department of Electrcal and Computer Engneerng Unversty of rzona Tucson, Z 85721 {tshu,
More informationDistributed Channel Allocation Algorithm with Power Control
Dstrbuted Channel Allocaton Algorthm wth Power Control Shaoj N Helsnk Unversty of Technology, Insttute of Rado Communcatons, Communcatons Laboratory, Otakaar 5, 0150 Espoo, Fnland. E-mal: n@tltu.hut.f
More informationAnalysis 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 informationResource 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 informationTODAY 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 informationHUAWEI 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熊本大学学術リポジトリ. Kumamoto University Repositor
熊本大学学術リポジトリ Kumamoto Unversty Repostor Ttle Wreless LAN Based Indoor Poston and Its Smulaton Author(s) Ktasuka, Teruak; Nakansh, Tsune CtatonIEEE Pacfc RIM Conference on Comm Computers, and Sgnal Processng
More informationMIMO-OFDM Systems. Team Telecommunication and Computer Networks, FSSM, University Cadi Ayyad, P.O. Box 2390, Marrakech, Morocco.
IJCSI Internatonal Journal of Computer Scence Issues, Vol. 8, Issue 3, ay 2011 ISSN (Onlne: 1694-0814 A Low-complexty Power and Bt Allocaton Algorthm for ultuser IO-OFD Systems Ayad Habb 1, Khald El Baamran
More informationMTBF 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 informationMulti-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@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 informationSecure Transmission of Sensitive data using multiple channels
Secure Transmsson of Senstve data usng multple channels Ahmed A. Belal, Ph.D. Department of computer scence and automatc control Faculty of Engneerng Unversty of Alexandra Alexandra, Egypt. aabelal@hotmal.com
More informationPower-Constrained Test Scheduling for Multi-Clock Domain SoCs
Power-Constraned Test Schedulng for Mult-Clock Doman SoCs Tomokazu Yoneda, Kmhko Masuda and Hdeo Fujwara Graduate School of Informaton Scence, Nara Insttute of Scence and Technology Kansa Scence Cty, 63-192,
More informationPRACTICAL, 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 informationChaotic Filter Bank for Computer Cryptography
Chaotc Flter Bank for Computer Cryptography Bngo Wng-uen Lng Telephone: 44 () 784894 Fax: 44 () 784893 Emal: HTwng-kuen.lng@kcl.ac.ukTH Department of Electronc Engneerng, Dvson of Engneerng, ng s College
More informationarxiv: v1 [cs.it] 30 Sep 2008
A CODED BIT-LOADING LINEAR PRECODED DISCRETE MULTITONE SOLUTION FOR POWER LINE COMMUNICATION Fahad Syed Muhammmad*, Jean-Yves Baudas, Jean-Franços Hélard, and Mattheu Crussère Insttute of Electroncs and
More informationOptimal 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 information4492 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 65, NO. 10, OCTOBER 2017
4492 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 65, NO. 10, OCTOBER 2017 OFDM-Based Interference Algnment n Sngle-Antenna Cellular Wreless Networks Huacheng Zeng, Member, IEEE, YSh,Senor Member, IEEE, Y.
More informationStrategies for Enhanced Dual Failure Restorability with Static or Reconfigurable p-cycle Networks
Reprnt of paper to appear at the 2004 Internatonal Conference on Communcatons (ICC 2004), Pars, France, June 2004. Strateges for Enhanced Dual Falure Restorablty wth Statc or Reconfgurable p-cycle Networs
More informationThe Dynamic Utilization of Substation Measurements to Maintain Power System Observability
1 The Dynamc Utlzaton of Substaton Measurements to Mantan Power System Observablty Y. Wu, Student Member, IEEE, M. Kezunovc, Fellow, IEEE and T. Kostc, Member, IEEE Abstract-- In a power system State Estmator
More information