Dynamic Lightpath Protection in WDM Mesh Networks under Wavelength Continuity Constraint

Size: px
Start display at page:

Download "Dynamic Lightpath Protection in WDM Mesh Networks under Wavelength Continuity Constraint"

Transcription

1 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, Houston, TX 7700, yuans@uhd.edu Department of Computer Scence, Unversty of Texas at Dallas, Rchardson, TX 75083, ue@utdallas.edu Abstract-- Path protecton requres fndng a workng path and a protecton path that are lnk dsont. In ths paper, we consder the dynamc lghtpath protecton problem n WDM mesh networks under the wavelength contnuty constrant. Exstng polynomal tme algorthms can be appled to fnd a par of lnk-dsont lghtpaths on a sngle wavelength; however, such algorthms fal f the workng and protecton lghtpaths are on two dfferent wavelengths. We prove the problem s P-complete for both dedcated protecton and shared protecton. We develop an ILP formulaton and heurstc solutons for the problem. Computer smulatons are conducted to evaluate the performance of the heurstc algorthms. Index terms-- Lghtpath protecton, wavelength contnuty constrant, optcal network, nteger lnear program (ILP) I. ITRODUCTIO In wavelength dvson multplexng (WDM) networks, end users can communcate wth one another va all-optcal WDM channels called lghtpaths [][]. Because of the hgh data rate on lghtpaths, t s mperatve to develop approprate protecton and restoraton schemes [3] [4] to prevent or reduce data loss. In protecton schemes, backup resources are pre-computed and reserved for each connecton before a falure occurs [5][6]. In restoraton schemes, an alternate route s dscovered dynamcally for each nterrupted connecton after a falure occurs [7][8]. Compared to restoraton schemes, protecton schemes have faster recovery tme and provde guaranteed recovery ablty but requre more network resources. Protecton schemes can be dvded nto path protecton and lnk protecton based on the level of network resources nvolved n the protecton. In path protecton, a workng path and a dsont protecton path are establshed for each connecton. In lnk protecton, separate backup resources are reserved for each ndvdual lnk on the workng path. Path protecton usually has lower resource requrements and lower end-to-end propagaton delay for the recovered route [5][7]. Protecton schemes can be further dvded nto dedcated protecton and shared protecton based on whether backup resources are shared by more than one connecton. In dedcated protecton, each lnk or node can be reserved as a backup resource for at most one connecton. In shared protecton, a lnk or node can be reserved as a backup resource for multple connectons, as long as those connectons do not fal smultaneously. Dedcated protecton requres more network resources but s smpler to mplement, whle shared protecton s more resource effcent but requres more complex sgnalng and network management []. The path protecton problem can be consdered under ether statc or dynamc traffc. Under statc traffc, the entre set of connecton requests s known. The routes and the wavelengths for the workng and protecton lghtpaths of all connecton requests must be determned[5][9][0][][]. Under dynamc traffc, connecton requests arrve one at a tme and each connecton exsts for only a fnte duraton. Routes and wavelengths must be determned ndvdually for the workng and protecton lghtpaths of each connecton request. In an optcal network wthout wavelength converson capablty [3][4], the establshment of a lghtpath s subect to the wavelength contnuty constrant,.e., a lghtpath s requred to be on the same wavelength channel throughout ts entre path n the network. Under ths constrant, the workng lghtpath and ts protecton lghtpath may both be on the same wavelength, or each may be on a dfferent wavelength. A network falure may be caused by ether a lnk falure or a node falure. Most modern node devces have bult-n redundancy whch greatly mproves ther relablty. Therefore lnk falure s more of a concern than node falure, and we only consder lnk falure n ths paper. In order to fnd the two lnk-dsont lghtpaths, we may ntutvely use a smple two-step soluton,.e., we fnd one shortest path on one wavelength frst, then remove all lnks on that path and fnd the second shortest path on the same wavelength or on a dfferent wavelength. These two paths are guaranteed to be lnk dsont. However, ths soluton fals n so-called trap topologes (Fg. ). s e a b Fgure. A sngle-wavelength WDM network. The numbers ndcate lnk costs. For sngle-wavelength networks, a feasble soluton can be found usng Suurballe's algorthm and ts varatons [5][6]. The total cost of the resultng two lnk-dsont lghtpaths s mnmal among all such path pars. The algorthm runs n O(n log n) tme, where n s the number of nodes. For networks wth multple wavelengths, we can apply ths algorthm on every wavelength n order to fnd the two lghtpaths on the same wavelength. However, f such paths do not exst, the problem s to fnd two lnk-dsont lghtpaths on two dfferent wavelengths. In [7], t s proven that, for the f d IEEE Communcatons Socety Globecom /04/$ IEEE

2 specal case n whch the total cost of the two lghtpaths s to be mnmal, the problem s P-complete. In ths paper, we prove that n a more general case, the problem s stll Pcomplete for both dedcated protecton and shared protecton, regardless of the total path costs. To solve the Routng and Wavelength Assgnment (RWA) problem of lghtpath protecton, fxed alternate paths heurstcs have been proposed n [8] and [9]. Wth these heurstcs, alternate routes are predefned for each sourcedestnaton par. When a connecton request arrves, the predefned routes are searched to fnd a workng path and a protecton path wth free bandwdth on the entre route. In ths paper, we develop heurstc algorthms that select routes and wavelengths based on the real-tme network status. The rest of the paper s organzed as follows. Secton II proves that, under the wavelength contnuty constrant, the problem of fndng a workng lghtpath and ts protecton lghtpath, each on a dfferent wavelength, s P-complete, regardless of the lghtpaths total cost. Secton III formulates the problem as an ILP and gves heurstc solutons. Secton IV presents computer smulatons results for the heurstc solutons and compares the performance of the heurstcs. Secton V concludes the paper. II. P-COMPLETEESS OF THE DYAMIC LIGHTPATH PROTECTIO PROBLEM UDER THE WAVELEGTH COTIUITY COSTRAIT For dedcated protecton, the problem s formally defned as follows. Gven optcal network G = (, L), where s the set of optcal swtchng nodes and L s the set of fber lnks, and gven the number of wavelengths on each fber lnk, fnd two lnk dsont lghtpaths from source node s to destnaton node d such that each lghtpath s on a dfferent wavelength. A. Proof of P-Completeness for Dedcated Protecton We reduce the 3SAT problem, whch s known to be Pcomplete [0], to the target problem. The 3SAT problem s stated as follows. Gven a collecton C = C, C,, C M of clauses on a fnte set V = v, v,, v of varables such that C = 3 for M, where clause C s the boolean or of three lterals (a lteral s ether a varable or the boolean not of a varable) and s satsfed by a truth assgnment f and only f at least one of the three lterals s true, s there a truth assgnment for V that satsfes all the clauses n C? We construct a graph G for an arbtrary nstance of 3SAT C, such that the graph contans two lnk-dsont lghtpaths, P on wavelength λ and P on wavelength λ, from node s to node d f and only f there s a truth assgnment satsfyng all clauses n C. In ths proof, the graph contans only two wavelengths, λ and λ, but t can easly be expanded to the case of more wavelengths. Followng are the steps for the graph constructon:. Create source node s and destnaton node d.. Correspondng to the varables n V, create + nodes z, 0. There s a lnk from s to z 0 and from z to d. Between z - and z, there are nodes x, y, x, y,, x M, y M, and x, M M, whch correspond to the M clauses n C. There are lnks z - x, x y, y x, x y,, x M y M, y M z and lnks z - x y x, M M M x y z. Lnks x y and x y each contan two wavelengths, λ and λ. All other lnks created n ths step contan only wavelength λ. 3. Correspondng to each clause C, create nodes u and w, M. There s a lnk from s to u and from w M to d. There s also a lnk from w to u +. Other lnks are formed accordng to the followng rules: a. A lnk from u to x exsts, and a lnk from y to w exsts, f and only f varable v s n clause C. b. A lnk from u to exsts, f and only f varable x exsts, and a lnk from y to w v s n clause C. All lnks constructed n ths step only contan wavelength λ. An example s gven n Fg. In ths example, we construct graph G for a 3SAT nstance C = C, C, V = v, v, v 3, C = v v v v v 3, C = v v v v v 3. The dotted lnks contan wavelength λ and the dashed lnks contan wavelength λ. The sold lnks contan both wavelengths λ and λ. For a truth assgnment v =, v =, v 3 =, the correspondng dsont paths are: p (s-z 0 - z - z - x z 3 3 -d) on wavelength λ and p (s -u - x - y - w - u - x -y -w -d) on wavelength λ. s x y x y x y x y y 3 y 3 z 0 z z z 3 x y x y x y x y x3 y 3 x 3 y 3 u w u w Fgure. A graph constructed from a 3SAT nstance. Lemma : If C s satsfable, then there exst two lnk-dsont lghtpaths of dfferent wavelengths from node s to node d n graph G. Proof: Let boolean values be assgned to v, v,, v that satsfy C. The two paths should be routed as follows: P s on wavelength λ. It traverses all z nodes for 0. Between node z - and z, the path s routed va nodes x and y ( M) f and only f v = 0. Otherwse t s routed va nodes x and y. P s on wavelength λ. It traverses all u, w nodes for M. Between node u and w, the path s routed as follows. By constructon, lnk u w corresponds to clause C whch has three lterals. Each of the lterals corresponds to a path from u to w that goes ether through nodes x and y f the lteral s n the form of v, or through nodes x and y f the lteral s n the negaton form, v. Because C s satsfed, at least one of the three lterals n C must be. Let the varable n that true lteral be v. Then d IEEE Communcatons Socety Globecom /04/$ IEEE

3 f the lteral s n the form of v, then v =, and route P passes through nodes x, y ; f the lteral s n the form of v, then v = 0, and route P passes through nodes y. If more than one lteral s true, then randomly pck one of the true lterals and route P accordngly. Thus, P doesn t traverse any of the nodes u, w for M, and P doesn t traverse any of the nodes z for 0. Furthermore, f P traverses node x, y, then P traverses and vce versa. Therefore P and P are lnk dsont, and each s on a dfferent wavelength. Lemma :If there exst two lnk-dsont lghtpaths of dfferent wavelengths from s to d n the constructed graph G, then C can be satsfed. Proof:. Snce there are only two lnks orgnatng from the source node s, the two lnks must each belong to a separate path. Let sz 0 be part of P and su be part of P.. Snce P s already on wavelength λ, P must not traverse any of the nodes u, w for M, otherwse t would also be on wavelength λ and volate the wavelength contnuty constrant. Therefore, f P traverses x for, then t must also traverse y, x, y,, x M, y M, z. Smlarly f P traverses x for, then t must M M also traverse, z. 3. Snce P s already on wavelength λ, P must not traverse any of the nodes z for 0, otherwse t would also be on wavelength λ and volate the wavelength contnuty constrant. Furthermore, f P traverses node u ( M) and x ( ), t must also traverse y and then back to w. Smlarly, f P traverses node u and t must also traverse y and then back to w. 4. Loops are not allowed. Therefore once P reaches w ( M), t must go to u + f < M, or to d f = M. 5. If P traverses nodes x, y, M,, t must not also traverse nodes k x and k k, and vce versa; otherwse P s blocked and cannot reach the destnaton node d wthout volatng the lnk dsont constrant. 6. If P traverses nodes x, y, M,, then P must traverses nodes traverses x for, then t must also traverse y M,. Smlarly f P traverses nodes, M then P must traverses nodes x, y, x, y,, x, y,, x M, y M. 7. Assgn values to v, v,, v as follows: If P traverses nodes x, y, M,, then assgn v =, makng clause C to be true. If P traverses nodes M,, then assgn v = 0, makng clause C to be true. Varables that are not assgned a value n the frst two steps are randomly assgned ether or 0. Ths assgnment satsfes C. Combnng Lemma and Lemma, we see that the 3SAT problem s reducble to the problem of fndng dsont lghtpaths on dfferent wavelengths. Therefore ths problem s P-complete, regardless of the paths costs. B. Proof of P-Completeness for Shared Protecton Wth shared protecton, one or more protecton lghtpaths may traverse a common wavelength on a fber lnk. If the problem wth shared protecton s solvable, then the problem wth dedcated protecton can also be solved snce t s a specal case of that wth shared protecton. III. ILP FORMULATIO AD HEURISTIC ALGORITHMS We now develop ILP formulaton and heurstc solutons for the P-complete problem of fndng lnk-dsont lghtpaths on dfferent wavelengths. A. ILP Formulaton The ILP formulaton should be solved for each ncomng connecton request. The obectve s to fnd any two lnkdsont lghtpaths. An alternatve obectve s to mnmze the total hop count of the two lnk-dsont lghtpaths. The followng are gven as nputs to the problem. : number of nodes n the network L: collecton of all fber lnks n the network. Λ : collecton of all free wavelengths on fber lnk L. s, d: source node and destnaton node. The ILP solves for the followng varables: α : f wavelength w on lnk s taken by the workng lghtpath from source s to destnaton d; 0 otherwse. β : f wavelength w on lnk s taken by the protecton lghtpath from source s to destnaton d; 0 otherwse. Obectve: Fnd a workng lghtpath and a protecton lghtpath that satsfy the wavelength contnuty constrant. L α + L Constrants: Flow-conservaton constrant: = l α - = = Lnk dsont constrant: βl - = α = l l β = 0, β > 0 (), f l = d -, f l = s otherwse l, w W, (), f l = d -, f l = s 0, otherwse l, w W, (3) IEEE Communcatons Socety Globecom /04/$ IEEE

4 α + B. Heurstc Algorthms β, L (4) In ths secton we ntroduce heurstc algorthms for fndng lnk-dsont lghtpaths n WDM networks. The frst algorthm s named the Route-Frst Algorthm. In ths algorthm, we use a standard routng and wavelength assgnment (RWA) approach. We frst try to fnd two dsont routes, and then assgn free wavelengths to them. The second algorthm s named the Wavelength-Scan Algorthm. In ths algorthm, we frst scan through each wavelength for a par of lnk-dsont lghtpaths usng Suurballe s algorthm. If Suurballe s algorthm fals, we search through each par of wavelengths for a par of lnk-dsont lghtpaths on dfferent wavelength usng a two-step approach. At the begnnng of both algorthms, we scan all fber lnks and ncrease the cost of a lnk lnearly to the number of wavelengths already n use on the lnk. Ths step ncreases the lkelhood of fndng free wavelengths on selected routes. It also balances traffc load among the network lnks, thus mproves the blockng probablty. For the Route-Frst Algorthm, the runnng tme s O(n log n + Wn), where n s the number of nodes and W s the number of wavelengths n the network. The pseudo code s gven n Fg 3. Intalze c l on every lnk to the cost of the lnk; for ( all network lnks) ncrease c l on lnk l accordng to the number of wavelengths n use on l; f ( Suurballe s algorthm(s, d) succeeds and fnds two routes r and r ) for ( all wavelengths λ and λ n the network and λ λ ) f ( a wavelength λ s avalable on route r and a wavelength λ s avalable on route r ) assgn λ to r and make t the workng lghtpath p ; assgn λ to r and make t the protecton lghtpath p ; return( p and p ); return(failure); Fgure 3. Route-Frst Algorthm For the Wavelength-Scan Algorthm, the runnng tme s O(W n log n), where n s the number of nodes and W s the number of wavelengths n the network.. The pseudo code s gven n Fg 4. Comparng the two algorthms, the Route-Frst Algorthm obtans the routes frst before t assgns free wavelengths to the routes. If the algorthm returns successfully, the total cost of the two lghtpaths s mnmal among all lnk-dsont paths from s to d. On the other hand, the Wavelength-Scan Algorthm scans through all avalable wavelengths, searchng for the two lnk-dsont paths, frst on a sngle wavelength then on dfferent wavelengths. Thus the runnng tme of ths algorthm s hgher. When the traffc load s low, the Route- Frst Algorthm should have lower blockng probabltes because free wavelengths are readly avalable and the routes are optmal n total cost. When the traffc load s hgh, the Wavelength-Scan Algorthm should have lower blockng probablty because t searches through all avalable wavelengths. Intalze c l on every lnk to the cost of the lnk; for ( all network lnks) ncrease c l on lnk l accordng to the number of wavelengths n use on l; for ( all the wavelengths ) run Suurballe s algorthm and return the two dsont paths wth the mnmum total cost f they are found; //If the prevous step fals for ( all wavelength λ n the network ) f ( Dkstra s algorthm(s, d) on λ succeeds and fnds the frst shortest path p from s to d) for ( all λ n the network and λ λ ) remove lnks on the frst shortest path p ; f ( Dkstra s algorthm(s, d) on λ succeeds and fnds the second shortest path p from s to d) return( p and p ); //Return the lghtpaths return(failure); Fgure 4. Wavelength-Scan Algorthm To ncrease resource utlzaton and thus reduce blockng probablty, we can modfy these two algorthms to support shared protecton []. The tradeoffs are complex network management and addtonal sgnalng protocol. IV. SIMULATIOS We have dscussed two heurstc algorthms for the dynamc path protecton problems under the wavelength contnuty constrant,.e., the Route-Frst Algorthm and the Wavelength-Scan Algorthm. We can also develop shared protecton support for each of the algorthms. Computer smulatons were developed to evaluate the performance of these four algorthms. In these smulatons, the prmary performance metrc s the blockng probablty. We use the 6-node, 5-lnk SFET backbone topology (Fg. 5) for the smulatons. Other network topologes are also used and yeld smlar results. The cost of every lnk s assumed to be, and the capacty on each lnk s 8 unts. Workng paths and protecton paths each takes one unt of capacty. Connecton requests arrve accordng to a Posson process, and holdng tmes are exponentally dstrbuted. In the smulaton, we compare the blockng probabltes of the Route-Frst Algorthm and the Wavelength-Scan Algorthm. For each of the algorthms, we run the smulaton IEEE Communcatons Socety Globecom /04/$ IEEE

5 for an extended perod of tme, under varous traffc loads, and compare ther blockng probabltes. The results are obtaned wth confdence level between 90% to 95% and confdence nterval around 5%. The results are depcted n Fg.6. protecton. One possble area of future work would be to further mprove the performance of the Wavelength-Scan Algorthm at hgher load. In addton to traffc balancng, we may also adust the lnk costs based on other factors such as the number of free wavelengths on a lnk that are reachable to the destnaton. Ths type of adustments may have a postve mpact on the algorthm s performance. Blockng Probabltes Fgure 5. 6-node SFET backbone network..00e-0.00e-0.00e-03.00e-04.00e-05.00e-06.00e-07.00e-08 Traffc Load (Erlang) Route-Frst Algorthm Route-Frst Algorthm wth Shared Protecton Wavelength-Scan Algorthm Wavelength-Scan Algorthm wth Shared Protecton Fgure 6. Blockng probablty versus load. The trends contnue for traffc load hgher than 0 Erlangs. The smulaton results confrm our analyss n Secton III. From the smulaton, we frst observe that shared protecton sgnfcantly mproves blockng probablty, regardless of the traffc load. Secondly, when the traffc load s very low, the Route-Frst Algorthms perform better than the Wavelength- Scan Algorthms. Whle the traffc load ncreases, the Wavelength-Scan Algorthms become better than the Route- Frst Algorthms. V. COCLUSIO In ths paper we consdered the problem of dynamc lghtpath protecton n optcal networks under the wavelength contnuty constrant. We proved that the problem s Pcomplete. We then developed an ILP formulaton and heurstc algorthms to solve the problem. We conducted computer smulatons to evaluate the heurstc algorthms and compared ther blockng probabltes under varous traffc loads. The smulaton reveals that, when network load s low, the Route-Frst Algorthm performs better. When network load s hgher, the Wavelength-Scan Algorthm performs better. The smulatons also confrmed that shared protecton sgnfcantly mproves blockng probablty over dedcated REFERECES [] B. Mukheree, Optcal Communcaton etworks. ew York: McGraw Hll, 997. [] R. Ramaswam and K.. Svaraan, Optcal etworks: A Practcal Perspectve. San Francsco, Morgan Kaufmann, 998. [3] O. Gerstel, Opportuntes for optcal protecton and restoraton, OFC, Techncal Dgest, pp , February 998. [4] T. Wu, Fber etwork Survvablty. MA: Artech House, 99. [5] S. Ramamurthy and B. Mukheree, Survvable WDM mesh networks, part I protecton, Proceedngs, IEEE IFOCOM, vol., pp , March 999. [6] A. Fumagall, et al. Survvable networks based on optmal routng and WDM self-healng rngs, Proceedngs, IEEE IFOCOM, vol., pp , March 999. [7] S. Ramamurthy and B. Mukheree, Survvable WDM mesh networks, part II restoraton, Proceedngs, IEEE ICC, vol. 3, pp , June 999. [8] R. R. Iraschko and W. D. Grover, A hghly effcent pathrestoraton protocol for management of optcal network transport ntegrty, IEEE Journal on Selected Areas n Communcatons, vol. 8, no. 5, pp , May 000. [9] R. M. Karp, On the computatonal complexty of combnatoral problems, etworks, vol. 5, pp , 975. [0] [] Andrea Dacomo, et al. Desgn of statc reslent WDM mesh networks wth multple heurstc crtera, Proceedngs, IEEE IFOCOM, vol. 3, June 00. [] Hu Zang, et al., Path-protecton routng and wavelength assgnment (RWA) n WDM mesh networks under duct-layer constrants, IEEE/ACM Transacton on etworkng, vol., no., Aprl 003. [3] R. A. Barry and P. A. Humblet, Models of blockng probablty n all-optcal networks wth and wthout wavelength changers, IEEE Journal on Selected Areas n Communcatons, vol. 4, no. 5, pp , June 996. [4] S. Subramanam, et al. All-optcal network wth sparse wavelength converson, IEEE/ACM Transactons on etworkng, vol. 4, no. 4, pp , August 996. [5] J. W. Suurballe and R. E. Taran, A quck method for fndng shortest pars of dsont paths, etworks, vol. 4, pp , 984. [6] Remesh Bhandar, Survvable etworks Algorthms for Dverse Routng. Kluwer Academc Publshers. [7] Wefa Lang, Robust routng n wde-area WDM networks, Parallel and Dstrbuted Processng Symposum, Proceedngs, 5th Internatonal, Aprl 00. [8] G Mohan, et al. Effcent algorthms for routng dependable connectons n WDM optcal networks, etworkng, IEEE/ACM Transactons on, vol. 9, no. 5, October 00. [9] V. Anand and C. Qao, Dynamc establshment of protecton paths n WDM networks. Part I, Proceedngs, 9th Intl. Conference on Computer Communcatons and etworks, pp , October 000. [0] M. R. Garey and D. S. Johnson, Computers and ntractablty: A gude to the theory of P-Completeness. ew York: W. H. Freeman Company, 979. [] S. Yuan and J. P. Jue, Dynamc path protecton n WDM mesh networks under wavelength-contnuty and rsk-dsont constrants, Techncal Report, no. UTDCS-6-04, Unversty of Texas at Dallas. IEEE Communcatons Socety Globecom /04/$ IEEE

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

Dynamic Wavelength Routing in WDM Networks under Multiple Signal Quality Constraints

Dynamic Wavelength Routing in WDM Networks under Multiple Signal Quality Constraints 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

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

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

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

Routing in all-optical DWDM Networks with Sparse Wavelength Conversion Capabilities

Routing 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 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

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

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 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

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

Rational Secret Sharing without Broadcast

Rational 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 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

Distributed Channel Allocation Algorithm with Power Control

Distributed 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 information

Efficient Large Integers Arithmetic by Adopting Squaring and Complement Recoding Techniques

Efficient 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 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

Full-duplex Relaying for D2D Communication in mmwave based 5G Networks

Full-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 information

Joint Backup Capacity Allocation and Embedding for Survivable Virtual Networks

Joint Backup Capacity Allocation and Embedding for Survivable Virtual Networks Jont Backup Capacty Allocaton and Embeddng for Survvable Vrtual Networks Nashd Shahrar, Shhabur Rahman Chowdhury, Reaz Ahmed, Amal Khan, Raouf Boutaba, Jeebak Mtra, and Lu Lu Davd R. Cherton School of

More information

Enhancing Throughput in Wireless Multi-Hop Network with Multiple Packet Reception

Enhancing 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 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

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

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

COMPUTER networks nowadays rely on various middleboxes,

COMPUTER 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 information

Optical Amplifiers Placement in WDM Mesh Networks for Optical Multicasting Service Support

Optical 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 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

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

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

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

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

Strategies 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 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

Resource Scheduling in Dependable Integrated Modular Avionics

Resource Scheduling in Dependable Integrated Modular Avionics Resource Schedulng n Dependable Integrated Modular Avoncs Yann-Hang Lee and Daeyoung Km Real Tme Systems Research Laboratory CISE Department, Unversty of Florda {yhlee, dkm}@cse.ufl.edu Mohamed Youns,

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

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

A Mathematical Model for Restoration Problem in Smart Grids Incorporating Load Shedding Concept

A Mathematical Model for Restoration Problem in Smart Grids Incorporating Load Shedding Concept J. Appl. Envron. Bol. Sc., 5(1)20-27, 2015 2015, TextRoad Publcaton ISSN: 2090-4274 Journal of Appled Envronmental and Bologcal Scences www.textroad.com A Mathematcal Model for Restoraton Problem n Smart

More information

Joint Power Control and Scheduling for Two-Cell Energy Efficient Broadcasting with Network Coding

Joint 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 information

Generalized Incomplete Trojan-Type Designs with Unequal Cell Sizes

Generalized Incomplete Trojan-Type Designs with Unequal Cell Sizes Internatonal Journal of Theoretcal & Appled Scences 6(1): 50-54(2014) ISSN No. (Prnt): 0975-1718 ISSN No. (Onlne): 2249-3247 Generalzed Incomplete Trojan-Type Desgns wth Unequal Cell Szes Cn Varghese,

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

Lifetime-Oriented Optimal Relay Deployment for Three-tier Wireless Sensor Networks

Lifetime-Oriented Optimal Relay Deployment for Three-tier Wireless Sensor Networks Sensors & Transducers by IFSA http://www.sensorsportal.com Lfetme-Orented Optmal Relay Deployment for Three-ter Wreless Sensor Networs Bn Zeng, Lu Yao and Ru Wang Department of Management, Naval Unversty

More information

On Interference Alignment for Multi-hop MIMO Networks

On 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 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

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

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

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

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

Exact Probabilistic Analysis of the Limited Scheduling Algorithm for Symmetrical Bluetooth Piconets

Exact Probabilistic Analysis of the Limited Scheduling Algorithm for Symmetrical Bluetooth Piconets Exact Probablstc Analyss of the Lmted Schedulng Algorthm for Symmetrcal Bluetooth Pconets Gl Zussman *, Ur Yechal 2, and Adran Segall Department of Electrcal Engneerng Technon Israel Insttute of Technology,

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

Asynchronous TDMA ad hoc networks: Scheduling and Performance

Asynchronous TDMA ad hoc networks: Scheduling and Performance Communcaton Networks Asynchronous TDMA ad hoc networks: Schedulng and Performance THEODOROS SALONIDIS AND LEANDROS TASSIULAS, Department of Electrcal and Computer Engneerng, Unversty of Maryland at College

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

Asynchronous TDMA ad hoc networks: Scheduling and Performance

Asynchronous TDMA ad hoc networks: Scheduling and Performance Asynchronous TDMA ad hoc networks: Schedulng and Performance Theodoros Salonds and Leandros Tassulas, Department of Electrcal and Computer Engneerng and Insttute of Systems Research Unversty of Maryland,

More information

King s Research Portal

King s Research Portal Kng s Research Portal DOI: 10.1109/TWC.2015.2460254 Document Verson Peer revewed verson Lnk to publcaton record n Kng's Research Portal Ctaton for publshed verson (APA): Shrvanmoghaddam, M., L, Y., Dohler,

More information

Research on the Process-level Production Scheduling Optimization Based on the Manufacturing Process Simplifies

Research on the Process-level Production Scheduling Optimization Based on the Manufacturing Process Simplifies Internatonal Journal of Smart Home Vol.8, No. (04), pp.7-6 http://dx.do.org/0.457/sh.04.8.. Research on the Process-level Producton Schedulng Optmzaton Based on the Manufacturng Process Smplfes Y. P. Wang,*,

More information

Traffic balancing over licensed and unlicensed bands in heterogeneous networks

Traffic balancing over licensed and unlicensed bands in heterogeneous networks Correspondence letter Traffc balancng over lcensed and unlcensed bands n heterogeneous networks LI Zhen, CUI Qme, CUI Zhyan, ZHENG We Natonal Engneerng Laboratory for Moble Network Securty, Bejng Unversty

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

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

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

Ensemble Evolution of Checkers Players with Knowledge of Opening, Middle and Endgame

Ensemble Evolution of Checkers Players with Knowledge of Opening, Middle and Endgame Ensemble Evoluton of Checkers Players wth Knowledge of Openng, Mddle and Endgame Kyung-Joong Km and Sung-Bae Cho Department of Computer Scence, Yonse Unversty 134 Shnchon-dong, Sudaemoon-ku, Seoul 120-749

More information

Secure Transmission of Sensitive data using multiple channels

Secure 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 information

Medium Access Control for Multi-Channel Parallel Transmission in Cognitive Radio Networks

Medium 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 information

Redes de Comunicação em Ambientes Industriais Aula 8

Redes de Comunicação em Ambientes Industriais Aula 8 Redes de Comuncação em Ambentes Industras Aula 8 Luís Almeda lda@det.ua.pt Electronc Systems Lab-IEETA / DET Unversdade de Avero Avero, Portugal RCAI 2005/2006 1 In the prevous epsode... Cooperaton models:

More information

Maximizing Lifetime of Sensor-Target Surveillance in Wireless Sensor Networks

Maximizing 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 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

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

Research Article. ISSN (Print)

Research Article. ISSN (Print) Scholars Journal of Engneerng and Technology (SJET) Sch. J. Eng. Tech., 05; 3(A):-3 Scholars Academc and Scentfc Publsher (An Internatonal Publsher for Academc and Scentfc Resources) www.saspublsher.com

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

The Synthesis of Dependable Communication Networks for Automotive Systems

The 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 information

MIMO-OFDM Systems. Team Telecommunication and Computer Networks, FSSM, University Cadi Ayyad, P.O. Box 2390, Marrakech, Morocco.

MIMO-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 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

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

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

Total Power Minimization in Glitch-Free CMOS Circuits Considering Process Variation

Total Power Minimization in Glitch-Free CMOS Circuits Considering Process Variation Total Power Mnmzaton n Gltch-Free CMOS Crcuts Consderng Process Varaton Abstract Compared to subthreshold age, dynamc power s normally much less senstve to the process varaton due to ts approxmately lnear

More information

TECHNICAL RESEARCH REPORT

TECHNICAL RESEARCH REPORT TECHNICAL RESEARCH REPORT Performance ssues of Bluetooth scatternets and other asynchronous TDMA ad hoc networks by Theodoros Salonds, Leandros Tassulas CSHCN TR 00 (ISR TR 005) The Center for Satellte

More information

10 9 Channel on time. sec

10 9 Channel on time. sec Blockng of dynamc multcast connectons n a sngle lnk COST 257TD(97)46 Joun Karvo 1, Jorma Vrtamo 2, Samul Aalto 2, Oll Martkanen 1 fjoun.karvo,jorma.vrtamo,samul.aalto,oll.martkaneng@hut.f Helsnk Unversty

More information

An Energy-aware Awakening Routing Algorithm in Heterogeneous Sensor Networks

An Energy-aware Awakening Routing Algorithm in Heterogeneous Sensor Networks An Energy-aware Awakenng Routng Algorthm n Heterogeneous Sensor Networks TAO Dan 1, CHEN Houjn 1, SUN Yan 2, CEN Ygang 3 1. School of Electronc and Informaton Engneerng, Bejng Jaotong Unversty, Bejng,

More information

Selective Sensing and Transmission for Multi-Channel Cognitive Radio Networks

Selective Sensing and Transmission for Multi-Channel Cognitive Radio Networks IEEE INFOCOM 2 Workshop On Cogntve & Cooperatve Networks Selectve Sensng and Transmsson for Mult-Channel Cogntve Rado Networks You Xu, Yunzhou L, Yfe Zhao, Hongxng Zou and Athanasos V. Vaslakos Insttute

More information

Energy Efficiency Analysis of a Multichannel Wireless Access Protocol

Energy Efficiency Analysis of a Multichannel Wireless Access Protocol Energy Effcency Analyss of a Multchannel Wreless Access Protocol A. Chockalngam y, Wepng u, Mchele Zorz, and Laurence B. Mlsten Department of Electrcal and Computer Engneerng, Unversty of Calforna, San

More information

Traffic Modeling and Performance Evaluation in GSM/GPRS Networks

Traffic Modeling and Performance Evaluation in GSM/GPRS Networks Proceedngs of the 3th WSEAS Internatonal Conference on COMMUNICATIONS Traffc Modelng and Performance Evaluaton n GSM/ Networks Cornel Balnt, Georgeta Budura, Marza Eugen Poltehnca Unversty of Tmsoara Bd..

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

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

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

Performance Study of OFDMA vs. OFDM/SDMA

Performance Study of OFDMA vs. OFDM/SDMA Performance Study of OFDA vs. OFD/SDA Zhua Guo and Wenwu Zhu crosoft Research, Asa 3F, Beng Sgma Center, No. 49, Zhchun Road adan Dstrct, Beng 00080, P. R. Chna {zhguo, wwzhu}@mcrosoft.com Abstract: In

More information

Throughput Maximization in Software-Defined Networks with Consolidated Middleboxes

Throughput Maximization in Software-Defined Networks with Consolidated Middleboxes 216 IEEE 41st Conference on Local Computer Networks Throughput Maxmzaton n Software-Defned Networks wth Consoldated Mddleboxes Metan Huang, Wefa Lang, Zchuan Xu, Mke Ja, and Song Guo The Australan Natonal

More information

Distributed Fault Detection of Wireless Sensor Networks

Distributed Fault Detection of Wireless Sensor Networks Dstrbuted Fault Detecton of Wreless Sensor Networs Jnran Chen, Shubha Kher, and Arun Soman Dependable Computng and Networng Lab Iowa State Unversty Ames, Iowa 50010 {jrchen, shubha, arun}@astate.edu ABSTRACT

More information

Optimal Local Topology Knowledge for Energy Efficient Geographical Routing in Sensor Networks

Optimal Local Topology Knowledge for Energy Efficient Geographical Routing in Sensor Networks Optmal Local Topology Knowledge for Energy Effcent Geographcal Routng n Sensor Networks Tommaso Meloda, Daro Pompl, Ian F. Akyldz Broadband and Wreless Networkng Laboratory School of Electrcal and Computer

More information

Achievable Rate Region of CSMA Schedulers in Wireless Networks with Primary Interference Constraints

Achievable Rate Region of CSMA Schedulers in Wireless Networks with Primary Interference Constraints Achevable Rate Regon of CSMA Schedulers n Wreless Networks wth Prmary Interference Constrants Peter Marbach, Atlla Erylmaz, and Asuman Ozdaglar Abstract We consder Carrer Sense Multple Access (CSMA) schedulers

More information

Subcarrier allocation for OFDMA wireless channels using lagrangian relaxation methods

Subcarrier 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 information

EENCR: An Energy-efficient Network Coding based Routing Protocol. May 8, 2014

EENCR: An Energy-efficient Network Coding based Routing Protocol. May 8, 2014 EENCR: An Energy-effcent Networ Codng based Routng Protocol May 8, 2014 1 1 Prelmnary Ahlswede et al. [2] frst proposed the networ codng technque. The authors showed that the use of networ codng can effectvely

More information

Power Allocation in Wireless Relay Networks: A Geometric Programming-Based Approach

Power 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 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

Practical Issues with the Timing Analysis of the Controller Area Network

Practical Issues with the Timing Analysis of the Controller Area Network Practcal Issues wth the Tmng Analyss of the Controller Area Network Marco D Natale Scuola Superore Sant Anna, Italy. Emal: marco@sssup.t Habo Zeng McGll Unversty, Canada. Emal: habo.zeng@mcgll.ca Abstract

More information

Distributed Resource Allocation and Scheduling in OFDMA Wireless Networks

Distributed Resource Allocation and Scheduling in OFDMA Wireless Networks Southern Illnos Unversty Carbondale OpenSIUC Conference Proceedngs Department of Electrcal and Computer Engneerng 11-2006 Dstrbuted Resource Allocaton and Schedulng n OFDMA Wreless Networks Xangpng Qn

More information

A Simple Satellite Exclusion Algorithm for Advanced RAIM

A Simple Satellite Exclusion Algorithm for Advanced RAIM A Smple Satellte Excluson Algorthm for Advanced RAIM Juan Blanch, Todd Walter, Per Enge Stanford Unversty ABSTRACT Advanced Recever Autonomous Integrty Montorng s a concept that extends RAIM to mult-constellaton

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

Optimization of Scheduling in Wireless Ad-Hoc Networks. Using Matrix Games

Optimization of Scheduling in Wireless Ad-Hoc Networks. Using Matrix Games Optmzaton of Schedulng n Wreless Ad-Hoc Networs Usng Matrx Games Ebrahm Karam and Savo Glsc, Senor Member IEEE Centre for Wreless Communcatons (CWC), Unversty of Oulu, P.O. Box 4500, FIN-90014, Oulu, Fnland

More information

Optimal Allocation of Static VAr Compensator for Active Power Loss Reduction by Different Decision Variables

Optimal Allocation of Static VAr Compensator for Active Power Loss Reduction by Different Decision Variables S. Aucharyamet and S. Srsumrannukul / GMSARN Internatonal Journal 4 (2010) 57-66 Optmal Allocaton of Statc VAr Compensator for Actve Power oss Reducton by Dfferent Decson Varables S. Aucharyamet and S.

More information

Low Complexity Duty Cycle Control with Joint Delay and Energy Efficiency for Beacon-enabled IEEE Wireless Sensor Networks

Low Complexity Duty Cycle Control with Joint Delay and Energy Efficiency for Beacon-enabled IEEE Wireless Sensor Networks Low Complexty Duty Cycle Control wth Jont Delay and Energy Effcency for Beacon-enabled IEEE 8254 Wreless Sensor Networks Yun L Kok Keong Cha Yue Chen Jonathan Loo School of Electronc Engneerng and Computer

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 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

Adaptive System Control with PID Neural Networks

Adaptive System Control with PID Neural Networks Adaptve System Control wth PID Neural Networs F. Shahra a, M.A. Fanae b, A.R. Aromandzadeh a a Department of Chemcal Engneerng, Unversty of Sstan and Baluchestan, Zahedan, Iran. b Department of Chemcal

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