Routing in Degree-constrained FSO Mesh Networks
|
|
- Janis Copeland
- 6 years ago
- Views:
Transcription
1 Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 Routng n Degree-constraned FSO Mesh Networks Zpng Hu, Pramode Verma, and James Sluss Jr. School of Electrcal & Computer Engneerng The Unversty of Oklahoma, Schusterman Center 450 E. 41 st Street, Tulsa, OK , USA {zpng.hu, pverma, sluss}@ou.edu Abstract Ths paper addresses the routng problem n packet swtchng free-space optcal (FSO) mesh networks. FSO mesh networks are emergng as broadband communcaton networks because of ther hgh bandwdth (up to Gbps), low cost, and easy nstallaton. Physcal layer topology desgn of degree-constraned FSO mesh networks has been studed n a recent communcaton [1]. In ths paper, we propose four dfferent routng algorthms, and evaluate ther performances through smulatons for a number of FSO mesh networks wth dfferent topologes and nodal degrees. The performance parameter aganst whch we evaluate these algorthms s the mean end-to-end delay. Our proposed least cost path (LCP) routng algorthm, whch s based on mnmzng the end-to-end delay, s consdered as the bench mark. The performance of each of other three proposed algorthms s evaluated aganst the bench mark. Our proposed mnmum hop count wth load-balancng (MHLB) routng algorthm s based on the number of hops between the source and the destnaton node to route the traffc. Smulatons show that the MHLB routng algorthm performs best n most cases compared wth the other two. It results n mnmum average delay and least blocked traffc. 1. Introducton FSO networks are emergng as broadband communcaton networks because of ther hgh bandwdth (up to Gbps), low cost, and easy nstallaton. An FSO network conssts of a set of geographcally dstrbuted FSO nodes and FSO lnks nterconnectng the nodes. Each FSO node can carry a router and several transcevers. An FSO node can carry only lmted number of transcevers due to sze, weght and power ssues. Each transcever operates both n transmttng and recevng modes. FSO lnks that form the communcaton channels of FSO networks are pont-to-pont drectonal lght beams. To mprove the performance of FSO networks through network desgn, the two major ssues are topology desgn and routng. Tradtonally, for wred communcaton networks such as fber-optc networks, a fxed physcal layer topology s formed based on external traffc flow requrements and/or other requrements. Routng s then a task of fndng optmal logcal connectons that can be mapped on the physcal layer topology n order to acheve low delay, hgh throughput, or reduced congeston. Research n [] presents a delay-constraned mnmum hop (DCMH) dstrbuted routng algorthm for real tme communcaton applcatons. An optmal dverse routng algorthm s proposed n [3] to fnd the shortest par of physcally-dsjont paths n order to mprove the relablty of fber optcal networks. Reference [4] presents an algorthm that computes the shortest path from a gven source to a destnaton for any number of hops for QoS routng. Research n [5] extends the work n [4], 71
2 Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 and proposes an All Hops Shortest Paths (AHSP) algorthm to compute the shortest path wth hop count lmtaton n order to fnd a feasble path. A load-balanced routng scheme s proposed n [6] to randomly dstrbute the traffc load over all avalable paths to the destnaton for real tme applcatons. A survey s presented n [7] that ntroduce several approaches to solve mult-constraned paths problem for QoS routng. All the above mentoned routng approaches assume a gven physcal layer topology. However, for FSO networks, current approaches [8-11] have combned both topology desgn and routng problems nto one makng use of the auto-trackng functon of FSO nodes. In these approaches, logcal topologes are frst calculated at upper layer. Physcal layer topologes are then gradually formed based on the calculated logcal topologes. Snce the mappng of physcal layer topology to logcal topology nvolves a number of rounds of mechancal movements of transcevers n FSO nodes, and each movement of a transcever takes about 500ms for algnment purpose only [8]; these approaches are not, n general, practcal for FSO communcaton networks. Our work approaches the problem n a way that s smlar to wred networks. In our prevous work [1], we constructed a hghly relable physcal layer topology for an FSO mesh network through topology desgn. Now, based on gven physcal layer topology, and external traffc demands, our objectve n ths paper s fndng optmal logcal topology that can be mapped onto the physcal layer topology n order to acheve low average packet delay. Four dfferent routng algorthms are proposed n ths paper. Through extensve smulatons, we show that the proposed mnmum hop count wth load balancng (MHLB) routng algorthm leads to the best overall performance. In ths paper, Secton defnes all the notatons used n our work. Secton 3 presents the problem that needs to be solved. A queung system model s ntroduced n Secton 4. Secton 5 presents the mathematcal background. The four proposed routng algorthms are presented n Secton 6. Secton 7 shows the smulaton results. Secton 8 concludes our work.. Notatons We treat a degree-constraned FSO mesh network as a graph G(N,L) wth N representng the set of nodes and L representng the set of lnks. The followng notatons are used n our work. A=[γ jk ] denotes the N x N traffc matrx, where γ jk : external traffc flow enterng node j, and destned to node k B=[ ] denotes the N x N lnk utlzaton matrx, where st st : utlzaton of lnk between node s and node t. μ : departure rate λ : traffc load on lnk λ: total nternal traffc load γ: total external traffc demand T: average delay for a packet travelng through the network 3. Problem Statement Three factors can affect the delay performance of FSO networks: physcal layer topology, external traffc demands, and routng strategy. In our work, we assume that the physcal layer topology and external traffc demands are gven. To smplfy the problem, we also assume that all lnk capactes are the same. The problem becomes fndng an optmal routng strategy 7
3 Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 that mnmzes the average delay T; therefore t s a flow assgnment (FA) problem [1]. The FA problem can be stated as follows. Gven: network topology and external traffc flows Mnmze: T Wth respect to: {λ }, =1,,, L 4. System Model To solve the FA problem, a packet swtchng FSO network s modeled as a network of queues. Each FSO node (or lnk) s modeled as a queue and a server, and treated as an ndependent M/M/1 model [1-13]. For example, gven the physcal layer topology of a fve node network shown n Fgure 1, external traffc flow, and the routng strategy of the traffc, the network can be modeled as a network of queues shown n Fgure. Fgure 1. Physcal layer topology of a L fne node 5. Mathematcal Background Fgure. Network of queues Assume for an FSO network wth N nodes and L lnks, the external traffc flow requrement from a source node j to a destnaton node k s jk, then the total external traffc flow (n packets per second) that s offered to the network can be expressed as N N = j1 k 1 jk (1) Snce a packet may travel multple hops from source to destnaton, the total nternal traffc flow n the network wll be hgher than the external offered traffc. The total nternal traffc load n the network s therefore gven as L = () 1 We can see that the total nternal traffc flow depends on not only the external offered traffc, but also the actual paths taken by packets through the network. The total traffc load 73
4 Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 on each ndvdual lnk s determned by both the offered traffc flows, and the routng algorthm. Snce each FSO lnk s actually a drectonal lght beam, an FSO lght sgnal propagates at lght speed. Wth lmted FSO lnk length (up to 4 km), the propagaton delay can be neglected; therefore when a packet travels along ts mult-hop path, t s served at a node, and then goes drectly to the next node on ts path. Let Tr denote the resdence tme of a packet at lnk. The average delay T can be defned as T = 1 L T r (3) By applyng the M/M/1 model, 1 T = 1 L 1 = 1 L = 1 L 1 1 ( ) 1 1 (4) Because of the separatblty [1] of each component at the rght hand sde of equaton (4), the senstvty of the average delay T to the utlzaton of lnk can be expressed as T 1, = 1,,, L (5) (1 ) Further, T (1 ) = 3, =1,,, L (6) Snce the utlzaton of lnk, =, always satsfes that 0 < 1 to keep the T network n a stable state; therefore, we have > 0 for all under lnk utlzaton constrant. We conclude that T s a convex functon of lnk utlzaton. It shows that wth the ncrease of lnk utlzaton, the growth of T becomes faster. Therefore, an optmal routng strategy should keep lnk utlzaton of each lnk mnmal n order to mnmze the average delay T. The total nternal traffc flow n the network also affects the average delay T; therefore, gven external traffc flow requrements and physcal layer topology of a network, an optmal routng algorthm should be able to mnmze the total nternal traffc flow of the network n order to mnmze the average delay T. Based on above analyss, we specfy the propertes of an optmal routng algorthm: For all lnks n the network, the lnk utlzaton constrant has to be satsfed,.e., 0 < 1, =1,,, L. The lnk utlzaton of each lnk has to be kept as low as possble, whch means that lnks wth low utlzaton should have hgher prorty of beng chosen to route gven traffc demand. Gven physcal layer topology and external traffc flow requrements, the total nternal traffc should be kept as low as possble through routng n order to decrease the average delay. 74
5 Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, Proposed Routng Algorthms We frst ntalze traffc matrx A, and lnk utlzaton matrx B. Each entry of the traffc matrx conssts of source node j, destnaton node k, and requred traffc flow jk, where j = 1,,, N, k = 1,,, N. If j = k, then jk =0. Each entry of the lnk utlzaton matrx conssts of node s, node t, and lnk utlzaton st, where s = 1,,, N, t = 1,,, N. If there s no drect lnk between node s and node t, or s = t, then st = 1. Otherwse, t sets to 0. For practcal reasons and for smplfcaton, we set the mum lnk utlzaton of each lnk as 0.8. Because of ths lnk utlzaton constrant, all traffc that can't be routed s regarded as blocked traffc. We propose four dfferent routng algorthms as follows. 6.1 Least Cost Path routng algorthm (LCP) * Assume the exstng traffc load on lnk s, or the exstng lnk utlzaton of lnk * * s. Usng equaton (5), we compute the cost (the ncrease of average delay) of routng traffc flow jk through lnk as T jk 1 jk Cost() = = (7) (1 * * ) Therefore, the total cost of routng traffc jk through a path of m lnks scost( ). In order to mnmze the average delay T, each traffc demand has to be routed through the least cost path. Our proposed least cost path routng algorthm s as follows. 1. Set =0.8. Route all one hop count traffcs under the constrant that. Update traffc matrx and lnk utlzaton matrx.. Arrange all traffc demands n the decreasng order. If the mum traffc demand s 0, then stop. 3. Startng from the heavest traffc demand, fnd the least cost path to route the traffc under the constrant that < for any lnk on the path. Because of the upper bound of lnk utlzaton, the part of traffc that can't be routed through the path remans unrouted. Update traffc matrx and lnk utlzaton matrx. If no such path exsts, consder next traffc demand. Repeat Step 3 untl all traffc demands are consdered. Go to Step. Varatons of Djkstra s or Bellman-Ford algorthm are the most wdely used algorthms n least cost routng n packet-swtchng networks. In our LCP routng algorthm, because of lnk utlzaton constrant, we use a modfed Djkastra algorthm to fnd the least cost path at step 3 n order to route a gven external traffc demand. Lnk cost s computed accordng to equaton (7). 6. Mnmum Hop Count Path Routng Algorthm (MHP) Proposed mnmum hop count path routng algorthm s used to route each traffc demand through the mnmum hop count path n order to mnmze the total nternal traffc load on the m 1 75
6 Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 network. In ths way, t's expected to acheve low average packet delay. The proposed mnmum hop count path routng algorthm s presented as: 1. Set =0.8. Route all one hop count traffcs under the constrant that. Update traffc matrx and lnk utlzaton matrx.. Arrange all traffc demands n the decreasng order. If the mum traffc demand s 0, then stop. 3. Startng from the heavest traffc demand, fnd the mnmum hop count path to route the traffc under the constrant that < for any lnk on the path. If more than one mnmum hop count path exsts, choose the one wth the mnmum mum lnk utlzaton. Because of the upper bound of lnk utlzaton, the part of traffc that can't be routed through the path remans unrouted. Update traffc matrx and lnk utlzaton matrx. If no such path exsts, consder next traffc demand. Repeat Step 3 untl all traffc demands are consdered. Go to Step. At step 3, by settng the cost of each lnk to be the same, a modfed Djkastra s algorthm s used to fnd the mnmum hop count path for a gven traffc demand under lnk utlzaton constrant. For a path wth m lnks, the mum lnk utlzaton of the path s defned as: {, =1,,, m}. Ths concept s also used n the followng routng algorthms. 6.3 Mnmum Hop Count wth Load Balancng Routng Algorthm (MHLB) The MHLB routng algorthm s used to route all traffc demands based on the hop count of the paths. All one hop count traffc are routed frst, then two hop count traffc, next three hop count traffc, and so on. The mum lnk utlzaton of a lnk s set at 0.6 frst, whch s ncreased up to 0.8 n the subsequent rounds. The steps are as follows. 1. Set =0.6. Route all one hop count traffcs under the constrant that Update traffc matrx and lnk utlzaton matrx. Set counter = 1... Arrange all traffc demands n the decreasng order. If the mum traffc demand s 0, then stop. Otherwse ncrease counter by 1 (or counter++), let = +, 0 0. (the actual value of selected s determned by searchng the optmal value from a small set). If > 0.8, then set = Startng from the heavest traffc demand, fnd the path wth total hop count less or equal to counter to route the traffc under the constrant that < for any lnk on the path. If more than one such path exsts, choose the one wth the mnmum mum lnk utlzaton. Update traffc matrx and lnk utlzaton matrx. If no such path exsts, consder next traffc demand. Repeat Step 3 untl all traffc demands are consdered. Go to Step. At step 3, a modfed Bellman-Ford algorthm s used to fnd the path wth total hop count less or equal to counter to route a gven traffc demand. Traffc load balancng s acheved through ncreasng the upper bound of lnk utlzaton from 0.6 to 0.8 step by step. The MHLB s expected to acheve low average delay, low total nternal traffc, and least blocked traffc. 6.4 Mnmum Hop Count Routng Algorthm (MH) Proposed MH routng algorthm s used to route all traffc demands based on the hop count of the paths smlar to MHLB. All one hop count traffc are routed frst, then two hop count 76
7 Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 traffc, next three hop count traffc, and so on. However for MH algorthm, the upper bound of lnk utlzaton always remans as 0.8 durng the whole process. 1. Set =0.8. Route all one hop count traffc under the constrant that. Update traffc matrx and lnk utlzaton matrx. Set counter = 1.. Arrange all traffc demands n the decreasng order. If the mum traffc demand s 0, then stop. Otherwse ncrease counter by 1 (or counter++). 3. Startng from the heavest traffc demand, fnd the mnmum hop count path wth total hop count less or equal to counter to route the traffc under the constrant that < for any lnk on the path. If more than one such path exsts, choose the one wth the mnmum mum lnk utlzaton. Update traffc matrx and lnk utlzaton matrx. If no such path exsts, consder next traffc demand. Repeat Step 3 untl all traffc demands are consdered. Go to Step. At step 3, a modfed Bellman-Ford algorthm s used to fnd the path wth total hop countless or equal to counter to route a gven traffc demand. Through MH routng the total nternal traffc s expected to be the least. 7. Smulatons and analyss Case1: Gven a physcal layer network topology of degree 3 wth 10 nodes and 15 lnks, we set the departure rate μ as 130 unts. (a) Lght external traffc demands: For a 10 nodes network, there are 10 9 dstnct source-destnaton node pars. Therefore 90 external traffc demands are generated randomly from 0 to 9 unts correspondng to the 90 dfferent source-destnaton node pars. Smulatons are done over 10 dfferent topologes wth proposed four dfferent routng algorthms to route the traffc. Under lght external traffc demands, the total blocked traffc s 0. The average delay s shown n Table 1. Table 1. Average delay (ms) (b) Heavy traffc demands: 90 external traffc demands are generated randomly from 0 to 19 unts correspondng to the 90 dfferent source-destnaton node pars. Smulatons are done over the same 10 dfferent topologes wth proposed four dfferent routng algorthms to route the traffc. The average delay under heavy traffc load s shown n Table.1. The total blocked traffc n dfferent scenaros s shown n Table.. 77
8 Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 Table.1. Average delay (ms) Table. Total blocked traffc (unts) Case : Gven a physcal layer network topology of degree 4 wth 30 nodes and 60 lnks, we set the departure rate μ as 80 unts. (a) Lght external traffc demands: For a 30 nodes network, there are 30 9 dstnct source-destnaton node pars. Therefore 870 external traffc demands are generated randomly from 0 to 9 unts correspondng to the 870 dfferent source-destnaton node pars. Smulatons are done over 10 dfferent topologes wth proposed four dfferent routng algorthms to route the traffc. In all dfferent scenaros, the total blocked traffc s 0. The average delay s shown n Table 3. (b) Heavy external traffc demands: 870 external traffc demands are generated randomly from 0 to 10 unts correspondng to the 870 dfferent source-destnaton node pars. Smulatons are done over the 10 dfferent topologes wth proposed four dfferent routng algorthms to route the traffc. The average delay s shown n Table 4.1. The total blocked traffc n dfferent scenaros s shown n Table 4.. The proposed three new routng algorthms are compared aganst the LCP algorthm, whch s based on routng that mathematcally mnmzes the end-to-end delay. The LCP algorthm routes as much as possble traffc through the least cost path untl the mum lnk utlzaton 0.8 s reached. Because of ths reason, LCP does not, under heavy traffc load, dstrbute traffc evenly over all avalable paths. 78
9 Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 Table 3. Average delay (ms) Table 4.1. Average delay (ms) Table 4.. Total blocked traffc (unts) Snce the proposed MHLB algorthm does dstrbute the traffc more evenly by settng at frst a lnk utlzaton lmt of 0.6, and then ncreasng t up to 0.8 f necessary, MHLB s expected to result n better performance than LCP n most cases. Note also that whle LCP determnes the route after a computatonally ntensve process, MHLB doesn't requre the 79
10 Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 computaton of lnk cost pror to determnng the route. It smply routes the traffc based on the hop count of the path, subject to, the lmts on lnk utlzaton. Further, for the LCP algorthm, the lnk cost depends on the traffc, and the traffc n turn depends on the routes chosen. Because of the exstence of ths feedback condton, nstabltes may result [13]. The other three routng algorthms, ncludng the MHLB, are not subject to such nstablty. Smulaton results show that for small szed FSO networks, under lght traffc demands, performance of the three proposed algorthms are smlar to each other; under heavy traffc load, the proposed MHLB routng algorthm results n mnmum average delay. For large szed FSO networks, smulaton results show that, under lght traffc demands, MHLB results n mnmum average delay n most cases; under heavy traffc load, t results n mnmum average delay and least blocked traffc n most cases. Compared wth LCP, MHLB performs better for small szed FSO networks. For large szed FSO networks, even though LCP results n less average delay than MHLB, MHLB s expected to outperform LCP wth the ncrease of the nodal degree because of ts traffc load balancng feature. 8. Conclusons Ths paper has proposed and analyzed three routng algorthms for degree-constraned FSO mesh networks of dfferent szes under varyng traffc demands. In each case, the cost s characterzed by average delay. The mum lnk utlzaton s set as 0.8. Traffc that exceeds ths constrant s regarded as blocked traffc. Smulaton results show that for small szed FSO networks, under lght traffc demands, the performance of the three proposed algorthms are smlar to each other; under heavy traffc load, the proposed MHLB routng algorthm outperforms the others n most cases. For large szed FSO networks, smulaton results show that MHLB performs best n most case. References [1] Zpng Hu, Pramode Verma, and James Sluss, Jr., "Improved Relablty of Free-space Optcal Mesh Networks Through Topology Desgn," Journal of Optcal Networkng Vol.7(5), pp (008). [] A. R. Mohd Sharff and M. E. Woodward, "A Delay Constraned Mnmum Hop Dstrbuted Routng Algorthm usng Adaptve Path Predcton," Journal of Networks Vol.(No.3), pp (007). [3] R. Bhandar, "Optmal dverse routng n Telecommuncaton Fber Networks," presented at the Proc. of the 13th IEEE INFOCOM conference on networkng for global communcatons, Toronto, [4] R. Guern and A. Orda, "Computng shortest paths for any number of hops," IEEE/ACM Trans. on Networkng Vol.10, pp (00). [5] G. Cheng and N. Ansar, "Fndng All Hops Shortest Paths," IEEE Communcaton Letters Vol.8(No.), pp.1-14 (004). [6] S. Bak, A. M. K. Cheng, J. A. Cobb, and E. L. Less, "Load-balanced Routng and Schedulng for Real- Tme Traffc n Packet-Swtch Networks," presented at the 5th Annual IEEE Internatonal Conference on Local Computer Networks, 000. [7] M. Curado and E. Montero, "A Survey of QoS Routng Algorthms," presented at the Proc. of the Internatonal conference on Informaton Technology, 004. [8] U. V. Fang Lu, and Stuart Mlner, "Bootstrappng free-space optcal networks," IEEE Journal on Selected Areas n Communcatons Vol. 4(No.1), pp.13- (006). [9] A. Kashyap, K. Lee, M. Kalantar, S. Khuller, and M. Shayman, "Integrated Topology Control and Routng n Wreless Optcal Mesh Networks," Computer Netwroks Vol.51(15), pp.1-13 (007). [10] K. Lee and K. Km, "Dynamc Topology Control and Routng n Wreless Ad Hoc Networks," IEICE Trans. on INF. & SYST. Vol.E89-D(No.5), pp (006). 80
11 Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 [11] A. Desa and S. Mlner, "Autonomous reconfguraton n free-space optcal sensor networks," IEEE Journal of Selected Areas n Communcatons VOL. 3(NO. 8), pp (005). [1] L. Klenrock, Queueng Systems.Volume II. Computer Applcatons (Wley, New York, 1976). [13] W. Stallngs, Hgh-Speed Networks and Internet: Performance and Qualty of Servce, nd Edton ed. pp.415 (Prentce Hall, New Jersy, 00). 81
Simulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationDESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT
DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,
More informationAn efficient iterative source routing algorithm
An effcent teratve source routng algorthm Gang Cheng Ye Tan Nrwan Ansar Advanced Networng Lab Department of Electrcal Computer Engneerng New Jersey Insttute of Technology Newar NJ 7 {gc yt Ansar}@ntedu
More informationEfficient Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model. Eiji Oki May 28, 2009 The University of Electro-Communications
Effcent Loa-Balance IP Routng Scheme Base on Shortest Paths n Hose Moel E Ok May 28, 2009 The Unversty of Electro-Communcatons Ok Lab. Semnar, May 28, 2009 1 Outlne Backgroun on IP routng IP routng strategy
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationPriority-Based Scheduling Algorithm for Downlink Traffics in IEEE Networks
Prorty-Based Schedulng Algorthm for Downlnk Traffcs n IEEE 80.6 Networks Ja-Mng Lang, Jen-Jee Chen, You-Chun Wang, Yu-Chee Tseng, and Bao-Shuh P. Ln Department of Computer Scence Natonal Chao-Tung Unversty,
More informationThe Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique
//00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy
More informationEfficient Distributed File System (EDFS)
Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate
More informationConstructing Minimum Connected Dominating Set: Algorithmic approach
Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected
More informationFAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks
2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng
More informationFibre-Optic AWG-based Real-Time Networks
Fbre-Optc AWG-based Real-Tme Networks Krstna Kunert, Annette Böhm, Magnus Jonsson, School of Informaton Scence, Computer and Electrcal Engneerng, Halmstad Unversty {Magnus.Jonsson, Krstna.Kunert}@de.hh.se
More informationA New Token Allocation Algorithm for TCP Traffic in Diffserv Network
A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationTECHNICAL REPORT AN OPTIMAL DISTRIBUTED PROTOCOL FOR FAST CONVERGENCE TO MAXMIN RATE ALLOCATION. Jordi Ros and Wei K Tsai
TECHNICAL REPORT AN OPTIMAL DISTRIUTED PROTOCOL FOR FAST CONVERGENCE TO MAXMIN RATE ALLOCATION Jord Ros and We K Tsa Department of Electrcal and Computer Engneerng Unversty of Calforna, Irvne 1 AN OPTIMAL
More informationDelay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks
Appl. Math. Inf. Sc. 7, No. 2L, 467-474 2013) 467 Appled Mathematcs & Informaton Scences An Internatonal Journal http://dx.do.org/10.12785/ams/072l13 Delay Varaton Optmzed Traffc Allocaton Based on Network
More informationA Saturation Binary Neural Network for Crossbar Switching Problem
A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com
More informationA Fair Access Mechanism Based on TXOP in IEEE e Wireless Networks
11 Internatonal Journal of Communcaton Networks and Informaton Securty (IJCNIS) Vol. 8, No. 1, Aprl 16 A Far Access Mechansm Based on TXOP n IEEE 8.11e Wreless Networks Marjan Yazdan 1, Maryam Kamal, Neda
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationDEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS
DEAR: A DEVICE AND ENERGY AWARE ROUTING PROTOCOL FOR MOBILE AD HOC NETWORKS Arun Avudanayagam Yuguang Fang Wenjng Lou Department of Electrcal and Computer Engneerng Unversty of Florda Ganesvlle, FL 3261
More information3. CR parameters and Multi-Objective Fitness Function
3 CR parameters and Mult-objectve Ftness Functon 41 3. CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft
More informationDynamic Bandwidth Provisioning with Fairness and Revenue Considerations for Broadband Wireless Communication
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the ICC 008 proceedngs. Dynamc Bandwdth Provsonng wth Farness and Revenue Consderatons
More informationReal-Time Guarantees. Traffic Characteristics. Flow Control
Real-Tme Guarantees Requrements on RT communcaton protocols: delay (response s) small jtter small throughput hgh error detecton at recever (and sender) small error detecton latency no thrashng under peak
More informationA Low-Overhead Routing Protocol for Ad Hoc Networks with selfish nodes
A Low-Oerhead Routng Protocol for Ad Hoc Networks wth selfsh nodes Dongbn Wang 1, Xaofeng Wang 2, Xangzhan Yu 3, Kacheng Q 1, Zhbn Xa 1 1 School of Software Engneerng, Bejng Unersty of Posts and Telecommuncatons,100876,
More informationInternational Journal of Scientific & Engineering Research, Volume 4, Issue 12, December-2013 ISSN
833 Polynomal Tme Algorthm (PTA) to generate a survvable rng vrtual topology for Optcal WDM based on Hamltonan Crcut Detecton Heurstcs(HCDH) *Sajal Kanta Das, Department of Computer Scence & Technology,
More informationTHere are increasing interests and use of mobile ad hoc
1 Adaptve Schedulng n MIMO-based Heterogeneous Ad hoc Networks Shan Chu, Xn Wang Member, IEEE, and Yuanyuan Yang Fellow, IEEE. Abstract The demands for data rate and transmsson relablty constantly ncrease
More informationOptimization of Local Routing for Connected Nodes with Single Output Ports - Part I: Theory
U J.T. (: 33- (pr. 0 Optmzaton of Local Routng for Connected odes wth Sngle Output Ports - Part I: Theory Dobr tanassov Batovsk Faculty of Scence and Technology ssumpton Unversty Bangkok Thaland E-mal:
More informationAADL : about scheduling analysis
AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationNeural Network Based Algorithm for Multi-Constrained Shortest Path Problem
Neural Network Based Algorthm for Mult-Constraned Shortest Path Problem Jyang Dong 1,2, Junyng Zhang 2, and Zhong Chen 1 1 Department of Physcs, Fujan Engneerng Research Center for Sold-State Lghtng, Xamen
More informationRAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems:
Speed/RAP/CODA Presented by Octav Chpara Real-tme Systems Many wreless sensor network applcatons requre real-tme support Survellance and trackng Border patrol Fre fghtng Real-tme systems: Hard real-tme:
More informationHierarchical clustering for gene expression data analysis
Herarchcal clusterng for gene expresson data analyss Gorgo Valentn e-mal: valentn@ds.unm.t Clusterng of Mcroarray Data. Clusterng of gene expresson profles (rows) => dscovery of co-regulated and functonally
More informationCHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION
24 CHAPTER 2 PROPOSED IMPROVED PARTICLE SWARM OPTIMIZATION The present chapter proposes an IPSO approach for multprocessor task schedulng problem wth two classfcatons, namely, statc ndependent tasks and
More informationMULTIHOP wireless networks are a paradigm in wireless
400 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 17, NO. 1, JANUARY 2018 Toward Optmal Dstrbuted Node Schedulng n a Multhop Wreless Network Through Local Votng Dmtros J. Vergados, Member, IEEE, Natala
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
More informationAnnales UMCS Informatica AI 1 (2003) UMCS. Designing of multichannel optical communication systems topologies criteria optimization
Annales Informatca AI 1 (2003) 277-284 Annales Informatca Lubln-Polona Secto AI http://www.annales.umcs.lubln.pl/ Desgnng of multchannel optcal communcaton systems topologes crtera optmzaton Mrosław Hajder,
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationFast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems
Fast Retransmsson of Real-Tme Traffc n HIPERLAN/ Systems José A Afonso and Joaqum E Neves Department of Industral Electroncs Unversty of Mnho, Campus de Azurém 4800-058 Gumarães, Portugal {joseafonso,
More informationProblem Definitions and Evaluation Criteria for Computational Expensive Optimization
Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty
More informationOverview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION
Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationUsing Particle Swarm Optimization for Enhancing the Hierarchical Cell Relay Routing Protocol
2012 Thrd Internatonal Conference on Networkng and Computng Usng Partcle Swarm Optmzaton for Enhancng the Herarchcal Cell Relay Routng Protocol Hung-Y Ch Department of Electrcal Engneerng Natonal Sun Yat-Sen
More informationVirtual Machine Migration based on Trust Measurement of Computer Node
Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationNon-Split Restrained Dominating Set of an Interval Graph Using an Algorithm
Internatonal Journal of Advancements n Research & Technology, Volume, Issue, July- ISS - on-splt Restraned Domnatng Set of an Interval Graph Usng an Algorthm ABSTRACT Dr.A.Sudhakaraah *, E. Gnana Deepka,
More informationAdaptive Network Resource Management in IEEE Wireless Random Access MAC
Adaptve Network Resource Management n IEEE 802.11 Wreless Random Access MAC Hao Wang, Changcheng Huang, James Yan Department of Systems and Computer Engneerng Carleton Unversty, Ottawa, ON, Canada Abstract
More informationA HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS
Kumar Pardeep and Chaturved D.K., Pahua G.L. - A HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS A HEURISTIC METHOD FOR RELIABILITY REDUNDANCY OPTIMIZATION OF FLOW NETWORKS Kumar
More informationEfficient Content Distribution in Wireless P2P Networks
Effcent Content Dstrbuton n Wreless P2P Networs Qong Sun, Vctor O. K. L, and Ka-Cheong Leung Department of Electrcal and Electronc Engneerng The Unversty of Hong Kong Pofulam Road, Hong Kong, Chna {oansun,
More informationX- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationARTICLE IN PRESS. Signal Processing: Image Communication
Sgnal Processng: Image Communcaton 23 (2008) 754 768 Contents lsts avalable at ScenceDrect Sgnal Processng: Image Communcaton journal homepage: www.elsever.com/locate/mage Dstrbuted meda rate allocaton
More informationAlgorithms for Routing and Centralized Scheduling to Provide QoS in IEEE Mesh Networks
Algorthms for Routng and Centralzed Schedulng to Provde QoS n IEEE 802.16 Mesh Networks Harsh Shetya Dept of Electrcal Communcaton Engneerng Indan Insttute of Scence Bangalore, Inda. 560012 harsh@pal.ece.sc.ernet.n
More informationNetwork Coding as a Dynamical System
Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.
More informationRange images. Range image registration. Examples of sampling patterns. Range images and range surfaces
Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples
More informationVirtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory
Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process
More informationNETWORK LIFETIME AND ENERGY EFFICIENT MAXIMIZATION FOR HYBRID WIRELESS NETWORK
NETWORK LIFETIME AND ENERGY EFFICIENT MAXIMIZATION FOR HYBRID WIRELESS NETWORK Prasana kumar. S 1, Deepak.N 2, Tajudeen. H 3, Sakthsundaram. G 4 1,2,3,4Student, Department of Electroncs and Communcaton,
More informationSolutions for Real-Time Communication over Best-Effort Networks
Solutons for Real-Tme Communcaton over Best-Effort Networks Anca Hangan, Ramona Marfevc, Gheorghe Sebestyen Techncal Unversty of Cluj-Napoca, Computer Scence Department {Anca.Hangan, Ramona.Marfevc, Gheorghe.Sebestyen}@cs.utcluj.ro
More informationA Semi-Distributed Load Balancing Architecture and Algorithm for Heterogeneous Wireless Networks
A Sem-Dstrbuted oad Balancng Archtecture and Algorthm for Heterogeneous reless Networks Md. Golam Rabul Ala Choong Seon Hong * Kyung Hee Unversty, Korea rob@networkng.khu.ac.kr, cshong@khu.ac.kr Abstract
More informationEnhanced Signaling Scheme with Admission Control in the Hybrid Optical Wireless (HOW) Networks
Enhanced Sgnalng Scheme wth Admsson Control n the Hybrd Optcal Wreless (HOW) Networks Yng Yan, Hao Yu, Henrk Wessng, and Lars Dttmann Department of Photoncs Techncal Unversty of Denmark Lyngby, Denmark
More informationDistributed Middlebox Placement Based on Potential Game
Int. J. Communcatons, Network and System Scences, 2017, 10, 264-273 http://www.scrp.org/ournal/cns ISSN Onlne: 1913-3723 ISSN Prnt: 1913-3715 Dstrbuted Mddlebox Placement Based on Potental Game Yongwen
More informationA Distributed Three-hop Routing Protocol to Increase the Capacity of Hybrid Wireless 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. Ctaton nformaton: DOI.9/TMC.25.2388476, IEEE Transactons
More informationAnalysis of Collaborative Distributed Admission Control in x Networks
1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,
More informationReal-time Fault-tolerant Scheduling Algorithm for Distributed Computing Systems
Real-tme Fault-tolerant Schedulng Algorthm for Dstrbuted Computng Systems Yun Lng, Y Ouyang College of Computer Scence and Informaton Engneerng Zheang Gongshang Unversty Postal code: 310018 P.R.CHINA {ylng,
More informationLecture 5: Multilayer Perceptrons
Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented
More informationPerformance Evaluation of Information Retrieval Systems
Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationEFT: a high throughput routing metric for IEEE s wireless mesh networks
Ann. Telecommun. (2010) 65:247 262 DOI 10.1007/s12243-009-0130-1 EFT: a hgh throughput routng metrc for IEEE 802.11s wreless mesh networks Md. Sharful Islam Muhammad Mahbub Alam Md. Abdul Hamd Choong Seon
More informationA Model Based on Multi-agent for Dynamic Bandwidth Allocation in Networks Guang LU, Jian-Wen QI
216 Jont Internatonal Conference on Artfcal Intellgence and Computer Engneerng (AICE 216) and Internatonal Conference on etwork and Communcaton Securty (CS 216) ISB: 978-1-6595-362-5 A Model Based on Mult-agent
More informationA fair buffer allocation scheme
A far buffer allocaton scheme Juha Henanen and Kalev Klkk Telecom Fnland P.O. Box 228, SF-330 Tampere, Fnland E-mal: juha.henanen@tele.f Abstract An approprate servce for data traffc n ATM networks requres
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationResource and Virtual Function Status Monitoring in Network Function Virtualization Environment
Journal of Physcs: Conference Seres PAPER OPEN ACCESS Resource and Vrtual Functon Status Montorng n Network Functon Vrtualzaton Envronment To cte ths artcle: MS Ha et al 2018 J. Phys.: Conf. Ser. 1087
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationQuantifying Responsiveness of TCP Aggregates by Using Direct Sequence Spread Spectrum CDMA and Its Application in Congestion Control
Quantfyng Responsveness of TCP Aggregates by Usng Drect Sequence Spread Spectrum CDMA and Its Applcaton n Congeston Control Mehd Kalantar Department of Electrcal and Computer Engneerng Unversty of Maryland,
More informationIJCTA Nov-Dec 2016 Available
Dr K Santh et al, Internatonal Journal of Computer Technology & Applcatons,Vol 7(6),773-779 Optmzed Route Technque for DSR Routng Protocol n MANET Dr.K.Santh, Assocate Professor, Dept. of Computer Scence,
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More informationResearch of Dynamic Access to Cloud Database Based on Improved Pheromone Algorithm
, pp.197-202 http://dx.do.org/10.14257/dta.2016.9.5.20 Research of Dynamc Access to Cloud Database Based on Improved Pheromone Algorthm Yongqang L 1 and Jn Pan 2 1 (Software Technology Vocatonal College,
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationCan Congestion Control and Traffic Engineering Be at Odds?
Can Congeston Control and Traffc Engneerng Be at Odds? Jayue He Dept. of EE, Prnceton Unversty Emal: jhe@prnceton.edu Mung Chang Dept. of EE, Prnceton Unversty Emal: changm@prnceton.edu Jennfer Rexford
More informationA protocol for mixed-criticality management in switched Ethernet networks
A protocol for mxed-crtcalty management n swtched Ethernet networks Olver CROS, Laurent GEORGE Unversté Pars-Est, LIGM / ESIEE, France cros@ece.fr,lgeorge@eee.org Xaotng LI ECE Pars / LACSC, France xaotng.l@ece.fr
More informationEvaluation of Parallel Processing Systems through Queuing Model
ISSN 2278-309 Vkas Shnde, Internatonal Journal of Advanced Volume Trends 4, n Computer No.2, March Scence - and Aprl Engneerng, 205 4(2), March - Aprl 205, 36-43 Internatonal Journal of Advanced Trends
More informationELEC 377 Operating Systems. Week 6 Class 3
ELEC 377 Operatng Systems Week 6 Class 3 Last Class Memory Management Memory Pagng Pagng Structure ELEC 377 Operatng Systems Today Pagng Szes Vrtual Memory Concept Demand Pagng ELEC 377 Operatng Systems
More informationDerivation of Three Queue Nodes Discrete-Time Analytical Model Based on DRED Algorithm
Seventh Internatonal Conference on Informaton Technology Dervaton of Three Queue Nodes Dscrete-Tme Analytcal Model Based on DRED Algorthm Jafar Ababneh, Hussen Abdel-Jaber, 3 Fad Thabtah, 3 Wael Had, EmranBadarneh
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationOutline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:
Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 A
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationCategories and Subject Descriptors ABSTRACT. General Terms. Keywords 1. INTRODUCTION. C.2.1. [Computer-Communication Networks]: Network Architecture
On Desgnng Incentve-Compatble Routng and Forwardng Protocols n Wreless Ad-Hoc Networks An Integrated Approach Usng Game Theoretcal and Cryptographc Technques Sheng Zhong L (Erran) L Yanbn Grace Lu Yang
More informationScheduling Independent Tasks in Heterogeneous Environments under Communication Constraints
Schedulng Independent Tasks n Heterogeneous Envronments under Communcaton Constrants Petros Lampsas 1 Thanass Loukopoulos 2 Fedon Dmopoulos 1 Marouso Athanasou 1 1 Department of Informatcs and Computer
More informationATYPICAL SDN consists of a logical controller in the
IEEE/ACM TRANSACTIONS ON NETWORKING, VOL. 25, NO. 6, DECEMBER 2017 3587 Mnmzng Flow Statstcs Collecton Cost Usng Wldcard-Based Requests n SDNs Hongl Xu, Member, IEEE, Zhuolong Yu, Chen Qan, Member, IEEE,
More informationState of the Art in Differentiated
Outlne Dfferentated Servces on the Internet Explct Allocaton of Best Effort Packet Delvery Servce, D. Clark and W. Fang A Two bt Dfferentated Servces Archtecture for the Internet, K. Nchols, V. Jacobson,
More informationSession 5.3. Switching/Routing and Transmission planning
ITU Regonal Semnar Belgrade Serba and Montenegro 20-24 24 June 2005 Sesson 5.3 Swtchng/Routng and Transmsson plannng volvng nfrastructures to NGN and related Plannng Strateges and Tools I.S. Sesson 5.3-1
More informationAttribute Allocation in Large Scale Sensor Networks
Attrbute Allocaton n Large Scale Sensor Networks Ratnabal Bswas Kaushk Chowdhury Dharma P. Agrawal OBR Research Center for Dstrbuted and Moble Computng, Dept. of ECECS, Unversty of Cncnnat, Cncnnat, OH
More informationMobileGrid: Capacity-aware Topology Control in Mobile Ad Hoc Networks
MobleGrd: Capacty-aware Topology Control n Moble Ad Hoc Networks Jle Lu, Baochun L Department of Electrcal and Computer Engneerng Unversty of Toronto {jenne,bl}@eecg.toronto.edu Abstract Snce wreless moble
More informationA Hybrid Genetic Algorithm for Routing Optimization in IP Networks Utilizing Bandwidth and Delay Metrics
A Hybrd Genetc Algorthm for Routng Optmzaton n IP Networks Utlzng Bandwdth and Delay Metrcs Anton Redl Insttute of Communcaton Networks, Munch Unversty of Technology, Arcsstr. 21, 80290 Munch, Germany
More informationDynamic Bandwidth Allocation Schemes in Hybrid TDM/WDM Passive Optical Networks
Dynamc Bandwdth Allocaton Schemes n Hybrd TDM/WDM Passve Optcal Networks Ahmad R. Dhan, Chad M. Ass, and Abdallah Sham Concorda Insttue for Informaton Systems Engneerng Concorda Unversty, Montreal, Quebec,
More informationAUTONOMOUS ROUTING ALGORITHMS FOR NETWORKS WITH WIDE-SPREAD FAILURES
AUTONOMOUS ROUTNG ALGORTHMS FOR NETWORKS WTH WDE-SPREAD FALURES Wajahat Khan, Long Bao Le and Eytan Modano Communcatons and Networkng Research Group Massachusetts nsttute of Technology Cambrdge, MA, USA
More informationRoutability Driven Modification Method of Monotonic Via Assignment for 2-layer Ball Grid Array Packages
Routablty Drven Modfcaton Method of Monotonc Va Assgnment for 2-layer Ball Grd Array Pacages Yoch Tomoa Atsush Taahash Department of Communcatons and Integrated Systems, Toyo Insttute of Technology 2 12
More informationQoS-aware routing for heterogeneous layered unicast transmissions in wireless mesh networks with cooperative network coding
Tarno et al. EURASIP Journal on Wreless Communcatons and Networkng 214, 214:81 http://wcn.euraspournals.com/content/214/1/81 RESEARCH Open Access QoS-aware routng for heterogeneous layered uncast transmssons
More informationQuality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation
Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on
More information