ILP Formulation and KShortest Path Heuristic for the RWA Problem with Allocation of Wavelength Converters


 Sharleen Garrett
 2 years ago
 Views:
Transcription
1 ILP Formuation and KShortest Path Heuristic for the RWA Probem with Aocation of Waveength Converters Karcius D.R. Assis 1, A. C. B. Soares, Wiiam F. Giozza and Heio Wadman 1 UEFS State University of Feira de Santana DTECAv. Universitária, s/nkm da BR 116, Camus Universitário, CEP: UNIFACS Savador University  Rua Ponciano de Oiveira, 16, Rio Vermeho, CEP: SavadorBA, Brazi.Emai: {karcius, UNICAMP State University of CaminasAv. Abert Einstein, 4, CP. 611, CaminasSP, Brazi.Emai: Abstract Different integer inear rogramming (ILP) formuations have been roosed for the routing and waveength assignment (RWA) robem in WDM networks. An imortant goa in the design of WDM networks is to use the minimum number of converters to serve communication needs, because this is cost effective. In this aer, we study the robem of aocating the minimum number of converters in a network for soving the RWA robem. Furthermore, our formuation aows any kind (artia or fu, sarse or ubiquitous) of waveength conversion in the network. We aso roose an exerimenta comarison of the heuristic from [Swaminathan and Sivarajan ] with a Kshortest ath heuristic with imited number of converters, for a arge network. 1. Introduction The design of an otica network invoves three cosey reated tasks: dimensioning, routing, and waveength assignment. Given is a hysica tooogy of the network as we as, for every air of nodes, a demand for a number of ightaths to be estabished between these nodes [Koster and Zymoka 5], [Subramaniam, S. and Azizogu, M., 1996] Otica networks design draws an increasing amount of attention nowadays. The Waveength Division Mutiexing (WDM) technique sits the arge bandwidth avaiabe in otica fibers into mutie channes, each one oerating at different waveengths and at secific data rates (u to 4Gbs). The ightaths are ogica channes which rovide an endtoend connectivity in the a otica network [Ramaswami and Sivarajan 1998]. The erformance of the WDM networks can be imroved by aowing waveength transation (conversion) at the routing nodes [Swaminathan and Sivarajan ], [Ramaswami and Sasaki 1998], [Ramamurthy and Mukherjee 1998]. The key issue in the aotica network design rocess once the hysica reaization has been achieved, is to roery dimension the network with resect to waveength numbers and to determine a waveength aocation an [Swaminathan and Sivarajan ], [Murty and Gurusamy ].
2 For circuit switched ightath service on an otica network, each ightath wi carry traffic reated to ony one sourcedestination air. A session is a set of connections between a sourcedestination air. For exame (A,B:1), (B,C:) are sessions wherein the number of connections required from node A to node B is one and from node B to node C is two. A waveengthconvertibe network, which suorts comete conversion at a nodes, is functionay equivaent to a circuitswitched network, i.e., ightath requests are bocked ony when there is no avaiabe caacity on the ath. Moreover, in most cases, it may be uneconomic to deoy waveength conversion caabiity at a nodes, but having a few nodes with waveength conversion caabiities may be desirabe [Murthy and Gurusamy ]. Then the questions are (1) How many nodes in a network shoud have conversion caabiity? () How many converters shoud a node have? In this aer we extend a heuristic from [Assis and Wadman 4] and focus on question (). In order to rovide an answer, the key oint is the formuation of the weknown Routing and Waveength AssignmentRWA robem in networks with sma number of converters er node, as a matter of fact: whie revious iterature considers conversion with imitess/arge number of converters in nodes [Swaminathan and Sivarajan ], [Ramaswami and Sivarajan 1995]; our strategy considers modifications in RWA robem to aow aocation of a imited number of converters in a node of the network. It is imortant because this number, if sma, is cost effective. Furthermore, our inear formuation and Kshortest ath heuristic aow any kind (artia or fu, sarse or ubiquitous) of waveength conversion in network. The aer is organized as foows. Section defines the traditiona RWA robem, extending an auxiiary grah aroach for a imited number of converters, and we discuss our resuts for a ring tooogy. Section, we discuss our resuts for a mesh tooogy and exain over the comutationa comexity. In section 4, we roose a heuristic with imited number of converters for arge networks. The heuristic is executed on a random mesh Nationa Science Foundation Network (NSFNET) and the erformance is comared with Kshortest ath heuristic without imited number of converters from [Swaminathan and Sivarajan ]. Finay, section 5 resents our concusions.. Routing and Waveength Assignment Probem The hysica tooogy network is reresented as G(N,E,W), in which N reresents the sets of nodes, E reresents the set of directiona fibers, and W reresents the set of waveengths on each ink. The hysica tooogy and the traffic matrix are given as inut for the robem. Our objective is maximize the number of ightaths to be estabished from the traffic matrix. Since we try to maximize connections in a given session or traffic matrix, for a fixed set of waveengths, it is caed MaxRWA robem [Swaminathan and Sivarajan ], [Ramaswami and Sivarajan 1995]. The agorithm that soves the above robem in genera shoud: a) Maximize the number of ightaths estabished using the minimum number of waveengths. In addition, our formuation tries to maximize the number of ightaths estabished using the minimum number of converters (If conversion is avaiabe). The foowing assumtions are made in our RWA robem: a) the number of waveengths in each ink of the fiber is assumed to be
3 same b) each ca requires a fu waveength on each ink of its ath c) simex connections are considered..1 Linear Program We formuate the MaxRWA robem as a Mixed Integer Linear Program (MILP). In the formuation the aths for a connection are not secified before hand, the inear rogram sover is aowed to choose any ossibe ath and any ossibe waveength for a source destination air. Thus the ogica tooogy design and waveength assignment are inbuit in the formuation itsef, which is not in the formuations resented in [Ramaswami and Sivarajan 1996], but is simiar to the resented in [Swaminathan and Sivarajan ]. The constraints invove the edges or arcs of the network. By this aroach the soution for the RWA robem tends to otimaity.. Definitions We use the foowing notation: i and j denote originating and terminating node of a ightath, resectivey; m and n denote endoints of a hysica ink. The arameters of the formuation are: N = Number of nodes in the network. K= The traffic matrix, i.e., K is the number of connections that are to be estabished between node i and j. P mn denotes the existence of a ink in the hysica tooogy. Here, P mn = 1, then there is ony a fiber ink between nodes m and n, otherwise P mn =. W denotes the number of waveengths the fiber can suort. C ( ): set of the waveengths into which can be converted in node. D ( ): set of the waveengths that can be converted to in node. The variabes of the formuation are: b denotes the number of ightaths estabished between node i and node j, taking ositive integra vaues. The mn variabe denotes the number of ightaths between nodes i and j being routed through fiber ink mn. L is the maximum number of waveength channes suorted er fiber; c is the number of ightaths between node i and node j that start in the waveength ; for =1,,,...,W; d is the number of ightaths between node i and node j that finish in the waveength ; for =1,,,...,W. Furthermore, mn = 1, if the ightath between node i and j uses waveength through hysica ink mn.. MaxRWA: Origina Mathematica Formuation Objective: Maximize: i j b (1) Remark: The objective here is to maximize the number of connections to be estabished from the given traffic matrix Routing on hysica tooogy mn : mk = kn, if k i, j () m n in = b i, j () n
4 mj = b i, j (4) m mn L. Pmn m, n (5) b K i, j (6) Remark: These constraints ensure that demand at origin and destination node for a sourcedestination air (i,j) is satisfied. On cooring ightaths with conversion resources: in = c i, j, (7) n mj = d i, j, (8) m c = d = b i, j (9) Remark: These constraints aow a ightath to be started in waveength, and finished in another waveength. m n m n nt n t C ( ) mt m t D ( ) if i,j (1) if i,j (11) Remark: conversion in intermediate nodes, exained ater. = mn i, j, m n (1) mn, mn Pmn m, n, (1) Remark: Constraints (1) guarantees that the number of waveengths resent in each hysica ink is equa to the number of ightaths traversing it. In (1) we assure that there is no waveength cash at hysica ink. Int b, mn, c, d Bin mn..1 Exanantion of (1) and (11) In a node with resources of conversion, equations (1) and (11) guarantee that a waveength that arrives in node in coor can be converted to another waveength in accordance with definition of the C ( ) and D ( ) sets. Notice that if conversion is not aowed (fig. 1b) in node =4, then: Therefore, for = 1,, : m C ( ) = D ( ) = {}, nt C ( ) = and m n
5 n = mt D ( ) n n m = m n. m i 4 6 j b a 7 c 1 Figure. 1. (a) Otiona hysica inks that arrive and eave node 4 for a ightath from node i to node j, (b) no conversion, (c) artia conversion. This ast equaity exresses a fow conservation of coored aths through node that is vaid when conversion is not aowed. Now, with artia conversion at node =4, as iustrated for the fig 1c. Then, C 4 ( 1 )={ 1, }, D 4 ( 1 )={ 1, } and C 4 ( )={, }, D 4 ( )={ 1, } and C 4 ( )={ 1, }, D 4 ( )={, }. Aying 1 and 11, we get: = = = Through the exame above we evidence that the definition of the sets C ( ) and D ( ) aows any kind of conversion in network: artia, fu, sarse, ubiquitous etc..4 Number of converters In fig., in order to aow the secification of a imited number of converters, a node with resources of conversion is sit into two auxiiary nodes a and b. After, it is created one unidirectiona arc ab. If we woud ike to have one converter, it is created one more auxiiary node c 1 and two more auxiiary arcs ac 1 and c 1 b. If we woud ike to have two converters, it is created one more auxiiary node c and two more auxiiary arcs ac
6 and c b and so on. Note that in auxiiary grah constraints arcs from or to c i have oad L=1 and arcs from a to b don t have traditiona cash constraints. Therefore (5) and (1) must be reaced by two other equations to guarantee the success of the strategy. These two new equations wi be shown in the next subsection. L ac 1 =1, L ac =1...L aci =1 L C1 b =1, L C b =1...L C i b =1 C i C E 1 C 1 E 1 E 1 E E a b E E a mn P mn b E E (a) (b) (c) Figure.. (a) The origina grah with back nodes (with resources of conversion) and bidirectiona arcs. (b) Back node is sitting in two nodes (a and b), (c) A auxiiary grah with auxiiary nodes a, b and c: a is incoming of arcs, b is out of arcs and c is an auxiiary node that reresents a converter..4.1 Auxiiar Grah (New formuation) In fig., a, b and c i denote nodes from the auxiiary grah (for estabished number of converters N c with i=1,...n c ). Therefore, if the auxiiary grah is made, i.e., there is the secification of a imited number of converters. Thus, we reace constraints (5) and (1) by the foowing more restrictive equations and in addition, we define the Nc. L. P for (ink mn) (ink ac i ) or (ink c i b) mn (14) mn 1 for (ink mn) = (ink ac i ) or= (ink c i b) mn Pmn for (ink mn) (ink ab) (15).4. Comexity In the formuation with auxiiary grah, based in the strategy of fig., with sarse conversion in one node, the number of nodes grows from N to N+, for 1 converter. From N to N+ for converters and so on. Therefore, the number of nodes grows from N to N+N c +1 nodes, when N c converters are ut in one node of network. Simiary, the number of inks E grows from E to E+, for 1 converter, from E to E+5 for converters and so on. Therefore the number of inks grows from E to E+1+.N c when N c converters are ut in one node of the network. If the same number of converters are ut in a N nodes of network, then the number of nodes in formuation grows from N to
7 N+(N.N c ) and the number of inks grow from E to E+(1+.N c ).N. Issues, ike the number of routing variabes O(N.E.W), where there are W waveengths, wi become critica in anayzing scaabiity. However, in the network ractica design the cost is minimized when the minimum number of converters is used [Yiming and Oiver ], [Assis and Wadman 4]..4. The sime exame (Nc is the number of converters in one node with conversion resources) W =4 W =4 (a) (b) (c) Figure.. (a) Nr=6 and (b) Nr=1: two unidirectiona rings (cockwise direction). Back nodesconversion. Cear nodesno conversion, (c) Traffic matrix (1 connections). Notice that with the aication in formuation/strategy with N c = in one node, fig. b, we wi obtain 1 connections, what roves the efficiency and cost saving of the formuation. Notice in tabe 1, that in auxiiary grah, the comutationa cost increases, see revious subsection, and is given by: Node cost = N+Nr.(1+Nc), Link cost: = E+Nr.(1+.Nc), where Nr is the number of nodes with conversion resources.. Simuations Tabe 1: Comutationa cost for auxiiary grah Ring Nc Node cost Link cost comutationa (b) Nr=1 (a) Nr= An exhaustive aroach that enumerates a the ossibe ways of converter number acement and choosing the best one is not efficient for moderate arge networks. In this section, we roose simuations in the foowing way:
8 1. To aow fu conversion in a nodes of the network in the origina grah, to ay the traditiona formuation and to get the maximum number of estabished connections. This way, the RWA suose that a node has imitess or great number of converters in each node of the network, in agreement with the hysicaoutdegree of this node. For exame, in a node with hysicaoutdegree δ and W waveengths, the number of converters Nc wi aow Nc = W.δ (as it is aied for a nodes, we have ubiquitous conversion). This ste serves ony for comarison.. Using the auxiiary grah (roosed strategy), to ace Nc=1 in a nodes of the network. To ay the modified formuation and to verify the estabished number of connections.. If the number of estabished connections in revious ste is not same the number obtained in ste one, return to the auxiiary grah (ste ) with Nc=, and so on. Notice that when we use the auxiiary grah, the connections aways have their origin in auxiiary nodes b and aways finish in auxiiary nodes a. For exame (fig. 4b), connections that are initiated in node 1 in the origina grah, are initiated in the node b in auxiiary grah and connections which are finished in node 1 in origina grah, are finished in the node a in auxiiary grah. c i 1 a 1 b (a) (b) Figures. 4.: (a) 6 nodemesh tooogy (b) auxiiary grah for 6 nodemesh tooogy. are finished in the node a in auxiiary grah. Tabe. Traffic matrix for 6 node mesh network 7 7
9 .1 Numerica Resuts for 6 nodemesh tooogy Simuations have been carried out to investigate the erformance of the roosed strategy with auxiiary grah over an 6node mesh tooogy (Fig.4). The traffic matrix used by this network is shown in tabe. The tota number of connections to be set u is 9. The resuts with Linear Program are tabuated in tabe for the cases of No conversion/origina grah. Fu conversion with Nc=1/auxiiary grah and Sarse conversion/auxiiary grah with one or two nodes with Nc=1. In tabe, the number of connections obtained with Nc = 1 in a nodes is same to the number obtained with ubiquitous conversion with Nc imitess, for a waveength ans; therefore, the atter is not shown and the ste is run ony one time for each an. However, a more effective strategy is to ut converters ony in one/some (sarse conversion) nodes of the network; in this case the acement order of converters is the foowing: first, one converter is ut on node 1; if the number of estabished connections is ess than in the case of ubiquitous conversion with Nc=1, then another converter is ut on node, and so on. In tabe with sarse conversion, for W=, W= and W=6 with ony one converter in node 1 we wi estabish the same number of connections from Nc=1 in a nodes, and for W=4 and W=5 with converters: one converter in node 1 and one converter in node we wi aso estabish the number of the connections from Nc =1 in a nodes. However, for W=4 and W=5, if we just one converter in node 1, we wi estabish 1 and 6 connections, resectivey; so the tota number of connections can not be estabished. Therefore the strategy roosed can be used to guide the acement of converters at the design of a network with RWA using the minimum number of converters, as seen in the figure 5. W Tabe. Lightaths estabished x Waveength Number of ightaths estabished No Conversion Conversion Sarse Conversion Nc=, for a Nc=1,for a Node Nc 1 11 Nc 1 16 Nc 1 1 Nc Nc 1 9
10 5 Sarse conversion, Nc=1 for one/some nodes. Nc=1, for a nodes. ubiquitous conversion. Tota Number of Converters Number of the Waveengths Figure. 5. Resuts for 6node mesh Network. Tota number of converters (Nt). Nt = Nc for estabished connections from tabe III in function of waveength an. In ubiquitous conversion, W.δ, for each node..1. Some comments Integer Linear Programming modes are ouar in the iterature as they rovide forma descritions of the robem. In ractice, however, scaabiity to networks with at east 1 s of nodes, with 1 s of demands is required. In many cases a but trivia instances of theses ILP s are comutationay difficut with current stateoftheart software. The comexity of our formuation grows as demonstrated in subsection (.1.4.). In our 6node mesh network, on average our strategy run be the otimization software CPLEX [ILOG CPLEX ] took around five seconds on an Inte Pentium IV/1.6Ghz. However, in a arge network as the Nationa Science Foundation Network  NSFNET, with matrix of traffic given for [Swaminathan and Sivarajan 1998], and Nc=1 for a nodes, our strategy exceeded the CPU memory restriction. Thus, in next subsection a heuristic wi be deveoed to find soutions to robems with size tyicay found in ractice. 4. K shortest ath Heuristic with imited number of converters (KSPNc) Here we resent a comutationay ess intensive heuristic agorithm based on K shortest aths for soving the MaxRWA robem with imited number of converters. Assuming that in the ightath request matrix, the argest ightath request between any sourcedestination air is m, we find the K shortest aths, wherein K is greater than m. The agorithm roceeds in foowing stes: Ste 1: Fiding K shortest aths in terms of hoength between a sourcedestination airs in traffic matrix:
11 The K shortest aths are store in ightaths1, ightaths,, ightathsk arrays. Consider the first shortest ath array i.e., ightaths1 for rocessing and go to Ste. Ste : Waveength assignment to the ightaths: For the ightath which is not waveength assigned in the traffic matrix, choose the ath for that from the chosen K shortest ath array. A tyica ightath between nodes (1) and (N) is reresented as node[1], node[],,node[q],,node[n]; where nodes node[],, node[q] are nodes aong the ightath. The hysica fiber inks of the ightath (node[1], node[]) abeed as ink 1, (node[], node[ ]) as ink and the ast ink (node[n1], node [N]) as ink N1. The first hysica ink of the ightath (here node[1], node[]) is taken and scanned for a free waveength. If a waveength j is free, then we try to find in a inks of that ightath for the avaiabiity of the waveength j. Then the agorithm roceeds further, differenty for the foowing cases: i. For the case of no conversion of waveength aong the ightath, if the waveength j is avaiabe in a hysica inks aong the ightath, then we aocate that waveength for the ighath. If the continuity of the waveength j aong the inks in the igthath is not ossibe then, we scan for the next free waveength j on the ink (node[1],node[]). As before the avaiabiity of the waveength j on a the hysica inks on the igthat is checked, if the waveength is avaiabe then it is assigned, ese we scan for the next free waveength on the ink (node[1], node[]) and the above rocedure for waveength assignment is reeated ti the ightath is waveength assigned ot the waveength in the ink (node[1], node[]) is exhausted. ii. For the case of imited waveength conversion, if waveength j is bocked on any ink n, then go back one hysica ink towards the source node of the ighath n 1 and try to obtain a free waveength by waveength conversion. If waveength conversion is not avaiabe go back further one ink n and try to obtain a free waveength by waveength conversion. Reeat the above rocedure ti a free waveength is obtained or ink is reched on the ightath. If a free waveength is not avaiabe at ink then go to ink 1 and choose a new free waveength and traverse the hysica inks of the ightath towards the destination node assigning waveengths with or without conversion. Whie back tracking for a free waveength if at any intermediate ink if we get a free waveength after conversion, then traverse from that ink towards the destination node assigning waveength with or without conversion. The waveength conversion aowed at any node deends on the degree of conversion aowed and number of converters Nc aowed. Ste : Reeat the ste ti a the ightaths in the chosen array are exhausted. Ste 4: If any of the ightaths in given traffic matrix is not waveength assigned, then choose the next of the K shortest ath arrays and go to ste. If a the ightaths are waveength assigned or a the K shortest ath arrays are exausted, then sto the agorithm.
12 4.1 Numerica Resuts The NSFNET shown in figure 6 is a 14 node network with 1 edges. In this network each edge reresents a air of fibers, one in each direction. The traffic matrix that has to be reaized over the NSFNET is shown in the tabe V. We assumed that at most mutie connections were ermitted for a sourcedestination air. The number of connections are chosen from,1,, with equa robabiity for a source destination air. The tota number of connections to be set u is 68. For comarison with [Swaminathan and Sivarajan ], we assumed: i. A nodes in the network are equied with waveength converters with imited conversion caabiity. Therefore, ony the case ii in ste from heuristic is considered. ii. The degree of conversion is. For he the reader, see fig.1b, it the degree of conversion is. First, we reax the integer constraints of mathematica formuation, as [Swaminathan and Sivarajan ]. For a given waveength, we find LP uer bound. After, we executed the KPSH and KPSNc agorithm on the NSFNET network with the vaue of K=5. The greater the vaue of K, more wi be number of connections reaized, because there are more aternative aths avaiabe for waveength assignment. The KPSNc resuts based on the number of converters are catured in tabe aong with resuts of LP (uer bound) and KPSH Heuristic with arge Nc from [Swaminathan and Sivarajan ]. Comaring in tabe 5, we find that in terms of erformance (Estabished Connections); LP (uer bound), KPSH, KPSNc with Nc=7 and KPSNc with Nc=5 gives better erformance in that order. In LP, this haens because of the reaxed integer constraints. In KSPH, this haens because of arge number of converters. The KSPNc had imited number of converters, therefore the erformance is ess or the same from W=1 to W=. However, in the network ractica design the cost is minimized when the minimum number of converters is used. Then, KSPNc is a heuristic costeffective. 5. Concusions In this aer, we resented ILP formuation and a Kshortest ath heuristic aroach for the imited number of converters and kinds of conversion in otica networks. The formuation/strategy roosed in this aer have a significant imact to the we known RWA robem. First, it can he understand the reationshi between the number of waveengths required and the number of converters. Second, it can be used to guide the acement of converters at the design of a network. Third, a new feature of the roosed formuation is that any kind of conversion can be made in each node of the network. This is obtained by the more genera constraints (1) and (11). By recenty deveoed heuristic technique advancements [Koster and Zymoka 5], the best known soution coud be imroved for more instances with minimum converter waveength assignment, again roving otimatiy. Besides further founding
13 the benefit of our aroach, this observation aso indicates that the heuristic agorithm are sti imrovabe. References Koster, A.M.C.A and Zymoka. (5) Provaby good soutions for waveength assignment in Otica networks Otica Network Design and Modeing ONDM 5, Mian, Itay. Assis, K.D.R and Wadman, H. (4) An Efficient Strategy for the RWA Probem with Aocation of Waveength Converters Otica Network Design and ModeingONDM 4, Gent, Begium., v. 1, Yiming, Z. and Oiver W.W. Y. () An Effective aroach to the connection routing robem of aotica waveength routing DWDM networks with waveength conversion caabiity IEEEInternationa Conference on Communications. ILOG CPLEX version 9., (). htt://www.iog.com/roducts/cex Swaminathan, M.D. and Sivarajan, K.N. () Practica Routing and Waveength Assignment agorithms for A Otica networks with Limited WaveengthConversion IEEE Internationa Conference on Communications  ICC. Murthy, C.S.R and Gurusamy, M. () WDM Otica Networks: Concets, Design, and Agorithms. Prentice Ha, ISBN Ramaswami, R. and Sivarajan, K.N. (1998) Otica Networks: a Practica Persective, Morgan Kaumann Pubishers, ISBN , San Francisco, USA. Ramaswamy, R. and Sasaki, G. (1998) Mutiwaveength Otica Networks with Limited Waveength Conversion, IEEE/ACM Transactions on Networking Vo. 6. No. 6. December. Ramamurthy, B. and Mukherjee, B. (1998) Waveength Conversion in WDM Networking, IEEE Journa on Seected Areas in Communication vo 16, No 7, Banerjee, D. and Mukherjee, B. (1996) Pratica aroaches for routing and waveength Waveength assignment in arge aotica waveengthrouted networks. IEEE Journa on Seected Areas in Communications, 14 (5): 998, June. Ramaswami, R. and Sivarajan, K.N. (1996) Design of ogica tooogies for waveengthrouted A Otica Networks, IEEE/JSAV, vo. 14, , june. Subramaniam, S., Azizogu, M. and and Somani, A.K. (1996) AOtica Networks with Sarse Waveength Conversion, IEEE/ACM Transactions on Networking, Ramaswami, R and Sivarajan, K.N. (1995) Routing and waveength assignment in a otica networks, IEEE/ACM Trans. Networking, vo., n.5, , Oct.
14 Tabe 4. Session Matrix for NSFNET (68 connections) Figure 6. NSFNET
15 Tabe 5. Resut obtained for NSFNET by LP formuation and heuristics Estabished Connections Uer Bound Heuristic W (LP) KSPH KSPNc Nc=W.δ Nc=7 Nc=
TOPOLOGICAL DESIGN OF MULTIPLE VPNS OVER MPLS NETWORK Anotai Srikitja David Tipper
TOPOLOGICAL DESIGN OF MULTIPLE VPNS OVER MPLS NETWORK Anotai Sriitja David Tier Det. of Information Science and Teecommunications University of Pittsburgh N. Beefied Avenue, Pittsburgh, PA 60 ABSTRACT
More informationSimultaneous Routing and Power Allocation in CDMA Wireless Data Networks
Simutaneous Routing and Power Aocation in CDMA Wireess Data Networks Mikae Johansson *,LinXiao and Stephen Boyd * Department of Signas, Sensors and Systems Roya Institute of Technoogy, SE 00 Stockhom,
More informationContent Multihoming: an Alternative Approach
Content Mutihoming: an Aternative Aroach Technica Reort HKUSTCS1401 Jason Min Wang 1, Jun Zhang 2, Brahim Bensaou 1 1 Deartment of Comuter Science and Engineering, The Hong Kong Universit of Science
More informationSecure Network Coding with a Cost Criterion
Secure Network Coding with a Cost Criterion Jianong Tan, Murie Médard Laboratory for Information and Decision Systems Massachusetts Institute of Technoogy Cambridge, MA 0239, USA Emai: {jianong, medard}@mit.edu
More informationSIMPLE MODELS OF TRANSMISSION LINE IN MATHCAD ENVIROMENTS PROSTE MODELE LINII DŁUGIEJ W ŚRODOWISKU MATHCAD
ELEKTRYKA Zeszyt () Ro LVIII Piotr JANKOWSKI Deartment of Marine Eectrica Power Engineering, Gdynia Maritime University SIMPLE MODELS OF TRANSMISSION LINE IN MATHCAD ENVIROMENTS Summary. The artice resents
More informationFast Robust Hashing. ) [7] will be remapped (and therefore discarded), due to the loadbalancing property of hashing.
Fast Robust Hashing Manue Urueña, David Larrabeiti and Pabo Serrano Universidad Caros III de Madrid E89 Leganés (Madrid), Spain Emai: {muruenya,darra,pabo}@it.uc3m.es Abstract As statefu fowaware services
More informationLecture 5: Solution Method for Beam Deflections
Structura Mechanics.080 Lecture 5 Semester Yr Lecture 5: Soution Method for Beam Defections 5.1 Governing Equations So far we have estabished three groups of equations fuy characterizing the response of
More informationThe Online Freezetag Problem
The Online Freezetag Problem Mikael Hammar, Bengt J. Nilsson, and Mia Persson Atus Technologies AB, IDEON, SE3 70 Lund, Sweden mikael.hammar@atus.com School of Technology and Society, Malmö University,
More informationConstrained Optimization: Step by Step. Maximizing Subject to a set of constraints:
Constrained Optimization: Step by Step Most (if not a) economic decisions are the resut of an optimization probem subject to one or a series of constraints: Consumers make decisions on what to buy constrained
More informationMath: Fundamentals 100
Math: Fundamentas 100 Wecome to the Tooing University. This course is designed to be used in conjunction with the onine version of this cass. The onine version can be found at http://www.tooingu.com. We
More information25.4. Solution Using Fourier Series. Introduction. Prerequisites. Learning Outcomes
Soution Using Fourier Series 25.4 Introduction In this Section we continue to use the separation of variabes method for soving PDEs but you wi find that, to be abe to fit certain boundary conditions, Fourier
More informationA Virtual Machine Dynamic Migration Scheduling Model Based on MBFD Algorithm
International Journal of Comuter Theory and Engineering, Vol. 7, No. 4, August 2015 A Virtual Machine Dynamic Migration Scheduling Model Based on MBFD Algorithm Xin Lu and Zhuanzhuan Zhang Abstract This
More informationService Network Design with Asset Management: Formulations and Comparative Analyzes
Service Network Design with Asset Management: Formulations and Comarative Analyzes Jardar Andersen Teodor Gabriel Crainic Marielle Christiansen October 2007 CIRRELT200740 Service Network Design with
More informationCooperative Content Distribution and Traffic Engineering in an ISP Network
Cooperative Content Distribution and Traffic Engineering in an ISP Network Wenjie Jiang, Rui ZhangShen, Jennifer Rexford, Mung Chiang Department of Computer Science, and Department of Eectrica Engineering
More informationVirtual trunk simulation
Virtua trunk simuation Samui Aato * Laboratory of Teecommunications Technoogy Hesinki University of Technoogy Sivia Giordano Laboratoire de Reseaux de Communication Ecoe Poytechnique Federae de Lausanne
More informationBranchandPrice for Service Network Design with Asset Management Constraints
BranchandPrice for Servicee Network Design with Asset Management Constraints Jardar Andersen Roar Grønhaug Mariellee Christiansen Teodor Gabriel Crainic December 2007 CIRRELT200755 BranchandPrice
More informationOn Multicast Capacity and Delay in Cognitive Radio Mobile Adhoc Networks
On Multicast Caacity and Delay in Cognitive Radio Mobile Adhoc Networks Jinbei Zhang, Yixuan Li, Zhuotao Liu, Fan Wu, Feng Yang, Xinbing Wang Det of Electronic Engineering Det of Comuter Science and Engineering
More informationNetwork/Communicational Vulnerability
Automated teer machines (ATMs) are a part of most of our ives. The major appea of these machines is convenience The ATM environment is changing and that change has serious ramifications for the security
More informationMultiRobot Task Scheduling
Proc of IEEE Internationa Conference on Robotics and Automation, Karsruhe, Germany, 013 MutiRobot Tas Scheduing Yu Zhang and Lynne E Parer Abstract The scheduing probem has been studied extensivey in
More informationFinance 360 Problem Set #6 Solutions
Finance 360 Probem Set #6 Soutions 1) Suppose that you are the manager of an opera house. You have a constant margina cost of production equa to $50 (i.e. each additiona person in the theatre raises your
More informationInductance. Bởi: OpenStaxCollege
Inductance Bởi: OpenStaxCoege Inductors Induction is the process in which an emf is induced by changing magnetic fux. Many exampes have been discussed so far, some more effective than others. Transformers,
More informationImaginary quadratic orders with given prime factor of class number
Imaginary quadratic orders with given rime factor of cass number Aexander Rostovtsev, St. Petersburg State Poytechnic University, rostovtsev@ss.stu.neva.ru Abstract Abeian cass grou C(D) of imaginary quadratic
More informationENFORCING SAFETY PROPERTIES IN WEB APPLICATIONS USING PETRI NETS
ENFORCING SAFETY PROPERTIES IN WEB APPLICATIONS USING PETRI NETS Liviu Grigore Comuter Science Deartment University of Illinois at Chicago Chicago, IL, 60607 lgrigore@cs.uic.edu Ugo Buy Comuter Science
More informationSNMP Reference Guide for Avaya Communication Manager
SNMP Reference Guide for Avaya Communication Manager 03602013 Issue 1.0 Feburary 2007 2006 Avaya Inc. A Rights Reserved. Notice Whie reasonabe efforts were made to ensure that the information in this
More informationThe Computation of the Inverse of a Square Polynomial Matrix
The Computation of the Inverse of a Square Poynomia Matrix Ky M. Vu, PhD. AuLac Technoogies Inc. c 2008 Emai: kymvu@auactechnoogies.com Abstract An approach to cacuate the inverse of a square poynomia
More informationService Network Design with Asset Management: Formulations and Comparative Analyzes
Service Network Design with Asset Management: Formulations and Comarative Analyzes Jardar Andersen Teodor Gabriel Crainic Marielle Christiansen October 2007 CIRRELT200740 Service Network Design with
More informationPricing Internet Services With Multiple Providers
Pricing Internet Services With Mutipe Providers Linhai He and Jean Warand Dept. of Eectrica Engineering and Computer Science University of Caifornia at Berkeey Berkeey, CA 94709 inhai, wr@eecs.berkeey.edu
More informationHYBRID FUZZY LOGIC PID CONTROLLER. Abstract
HYBRID FUZZY LOGIC PID CONTROLLER Thomas Brehm and Kudip S. Rattan Department of Eectrica Engineering Wright State University Dayton, OH 45435 Abstract This paper investigates two fuzzy ogic PID controers
More informationWIRELESS Mesh Networks (WMNs) have recently attracted
3968 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 2, NO. 8, AUGUST 23 A New MPLSBased Forwarding Paradigm for MutiRadio Wireess Mesh Networks Stefano Avaone and Giovanni Di Stasi Abstract Routing
More informationArtificial neural networks and deep learning
February 20, 2015 1 Introduction Artificia Neura Networks (ANNs) are a set of statistica modeing toos originay inspired by studies of bioogica neura networks in animas, for exampe the brain and the centra
More informationAA Fixed Rate ISA Savings
AA Fixed Rate ISA Savings For the road ahead The Financia Services Authority is the independent financia services reguator. It requires us to give you this important information to hep you to decide whether
More informationLocal Connectivity Tests to Identify Wormholes in Wireless Networks
Local Connectivity Tests to Identify Wormholes in Wireless Networks Xiaomeng Ban Comuter Science Stony Brook University xban@cs.sunysb.edu Rik Sarkar Comuter Science Freie Universität Berlin sarkar@inf.fuberlin.de
More informationQoSbased Virtual Private Network Design for an MPLS network
QoSbae Virtua Private Networ Deign for an MPLS networ Anotai Sriitja an Davi Tier Det. of Information Science an Teecommunication Univerity of Pittburgh 5 N. Beefie Avenue, Pittburgh, PA 560 emai: anotai@i.itt.eu,
More informationBuffer Capacity Allocation: A method to QoS support on MPLS networks**
Buffer Caacity Allocation: A method to QoS suort on MPLS networks** M. K. Huerta * J. J. Padilla X. Hesselbach ϒ R. Fabregat O. Ravelo Abstract This aer describes an otimized model to suort QoS by mean
More informationStatic and Dynamic Properties of Smallworld Connection Topologies Based on Transitstub Networks
Static and Dynamic Proerties of Smallworld Connection Toologies Based on Transitstub Networks Carlos Aguirre Fernando Corbacho Ramón Huerta Comuter Engineering Deartment, Universidad Autónoma de Madrid,
More informationDynamic Pricing Trade Market for Shared Resources in IIU Federated Cloud
Dynamic Pricing Trade Market or Shared Resources in IIU Federated Coud Tongrang Fan 1, Jian Liu 1, Feng Gao 1 1Schoo o Inormation Science and Technoogy, Shiiazhuang Tiedao University, Shiiazhuang, 543,
More informationPricing and Revenue Sharing Strategies for Internet Service Providers
Pricing and Revenue Sharing Strategies for Internet Service Providers Linhai He and Jean Warand Department of Eectrica Engineering and Computer Sciences University of Caifornia at Berkeey {inhai,wr}@eecs.berkeey.edu
More informationMinimizing the Total Weighted Completion Time of Coflows in Datacenter Networks
Minimizing the Tota Weighted Competion Time of Cofows in Datacenter Networks Zhen Qiu Ciff Stein and Yuan Zhong ABSTRACT Communications in datacenter jobs (such as the shuffe operations in MapReduce appications
More informationOnline Supplement for The Robust Network Loading Problem under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations
Onine Suppement for The Robust Network Loading Probem under Hose Demand Uncertaint: Formuation, Pohedra Anasis, and Computations Aşegü Atın Department of Industria Engineering, TOBB Universit of Economics
More informationPERFORMANCE ANALYSIS OF GANG SCHEDULING IN A PARTITIONABLE PARALLEL SYSTEM
PERFORMANCE ANALYSIS OF GANG SCHEDULING IN A PARTITIONABLE PARALLEL SYSTEM Heen D. Karatza Department of Informatics Aristote University of Thessaoniki 54124 Thessaoniki, Greece Emai: karatza@csd.auth.gr
More informationApplying graph theory to automatic vehicle tracking by remote sensing
0 0 Appying graph theory to automatic vehice tracking by remote sensing *Caros Lima Azevedo Nationa Laboratory for Civi Engineering Department of Transportation Av. Do Brasi, Lisbon, 000 Portuga Phone:
More informationDAYAHEAD ELECTRICITY PRICE FORECASTING BASED ON TIME SERIES MODELS: A COMPARISON
DAYAHEAD ELECTRICITY PRICE FORECASTING BASED ON TIME SERIES MODELS: A COMPARISON Rosario Esínola, Javier Contreras, Francisco J. Nogales and Antonio J. Conejo E.T.S. de Ingenieros Industriales, Universidad
More informationArt of Java Web Development By Neal Ford 624 pages US$44.95 Manning Publications, 2004 ISBN: 1932394060
IEEE DISTRIBUTED SYSTEMS ONLINE 15414922 2005 Pubished by the IEEE Computer Society Vo. 6, No. 5; May 2005 Editor: Marcin Paprzycki, http://www.cs.okstate.edu/%7emarcin/ Book Reviews: Java Toos and Frameworks
More informationPayondelivery investing
Payondeivery investing EVOLVE INVESTment range 1 EVOLVE INVESTMENT RANGE EVOLVE INVESTMENT RANGE 2 Picture a word where you ony pay a company once they have deivered Imagine striking oi first, before
More informationMasters research report. Decentralization and Economic Growth: A Case Study for Canada. Prepared by: Philippe Wingender WINP28028006
Masters research reort Decentraization and Economic Growth: A Case Study or Canada Preared by: Phiie Wingender WINP28028006 Research director: François Vaiancourt Université de Montréa Tuesday, Juy 2th
More informationThe guaranteed selection. For certainty in uncertain times
The guaranteed seection For certainty in uncertain times Making the right investment choice If you can t afford to take a ot of risk with your money it can be hard to find the right investment, especiay
More informationSELECTING THE SUITABLE ERP SYSTEM: A FUZZY AHP APPROACH. Ufuk Cebeci
SELECTING THE SUITABLE ERP SYSTEM: A FUZZY AHP APPROACH Ufuk Cebeci Department of Industria Engineering, Istanbu Technica University, Macka, Istanbu, Turkey  ufuk_cebeci@yahoo.com Abstract An Enterprise
More informationBackground & Motivation. Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures. Layered Architecture
Background & Motivation Layering as Optimization Decomposition: A Mathematica Theory o Network Architectures Network Architecture? Convex Optimization max U(x) Ax C x 0 Francesco Lo Presti Universita di
More informationDesign of A Knowledge Based Trouble Call System with Colored Petri Net Models
2005 IEEE/PES Transmission and Distribution Conference & Exhibition: Asia and Pacific Dalian, China Design of A Knowledge Based Trouble Call System with Colored Petri Net Models HuiJen Chuang, ChiaHung
More informationAn Approach to Optimizations Links Utilization in MPLS Networks
An Aroach to Otimizations Utilization in MPLS Networks M.K Huerta X. Hesselbach R.Fabregat Deartment of Telematics Engineering. Technical University of Catalonia. Jori Girona . Camus Nor, Eif C, UPC.
More informationTeamwork. Abstract. 2.1 Overview
2 Teamwork Abstract This chapter presents one of the basic eements of software projects teamwork. It addresses how to buid teams in a way that promotes team members accountabiity and responsibiity, and
More informationMaintenance activities planning and grouping for complex structure systems
Maintenance activities panning and grouping for compex structure systems Hai Canh u, Phuc Do an, Anne Barros, Christophe Berenguer To cite this version: Hai Canh u, Phuc Do an, Anne Barros, Christophe
More informationAvailable online Journal of Scientific and Engineering Research, 2016, 3(2): Research Article
Avaiabe onine www.jsaer.com Journa of Scientific and Engineering Research, 016, ():1 Research Artice ISSN: 960 CODEN(USA): JSERBR A simpe design of a aboratory testing rig for the experimenta demonstration
More informationA MOST PROBABLE POINTBASED METHOD FOR RELIABILITY ANALYSIS, SENSITIVITY ANALYSIS AND DESIGN OPTIMIZATION
9 th ASCE Secialty Conference on Probabilistic Mechanics and Structural Reliability PMC2004 Abstract A MOST PROBABLE POINTBASED METHOD FOR RELIABILITY ANALYSIS, SENSITIVITY ANALYSIS AND DESIGN OPTIMIZATION
More informationENERGY AND BOLTZMANN DISTRIBUTIONS
MISN159 NRGY AND BOLTZMANN DISTRIBUTIONS NRGY AND BOLTZMANN DISTRIBUTIONS by J. S. Kovacs and O. McHarris Michigan State University 1. Introduction.............................................. 1 2.
More informationLoad Balance vs Energy Efficiency in Traffic Engineering: A Game Theoretical Perspective
Load Baance vs Energy Efficiency in Traffic Engineering: A Game Theoretica Perspective Yangming Zhao, Sheng Wang, Shizhong Xu and Xiong Wang Schoo of Communication and Information Engineering University
More informationNormalization of Database Tables. Functional Dependency. Examples of Functional Dependencies: So Now what is Normalization? Transitive Dependencies
ISM 602 Dr. Hamid Nemati Objectives The idea Dependencies Attributes and Design Understand concepts normaization (HigherLeve Norma Forms) Learn how to normaize tabes Understand normaization and database
More informationIntellectual property rights and foreign direct investment
Journa of Internationa Economics 56 (2002) 387 410 www.esevier.com/ ocate/ econbase Inteectua property rights and foreign direct investment Amy Joceyn Gass *, Kama aggi a, b a Department of Economics,
More informationRisk Margin for a NonLife Insurance RunOff
Risk Margin for a NonLife Insurance RunOff Mario V. Wüthrich, Pau Embrechts, Andreas Tsanakas February 2, 2011 Abstract For sovency purposes insurance companies need to cacuate socaed bestestimate
More informationSorting, Merge Sort and the DivideandConquer Technique
Inf2B gorithms and Data Structures Note 7 Sorting, Merge Sort and the DivideandConquer Technique This and a subsequent next ecture wi mainy be concerned with sorting agorithms. Sorting is an extremey
More informationA train dispatching model based on fuzzy passenger demand forecasting during holidays
Journa of Industria Engineering and Management JIEM, 2013 6(1):320335 Onine ISSN: 20130953 Print ISSN: 20138423 http://dx.doi.org/10.3926/jiem.699 A train dispatching mode based on fuzzy passenger demand
More informationCONTRIBUTION OF INTERNAL AUDITING IN THE VALUE OF A NURSING UNIT WITHIN THREE YEARS
Dehi Business Review X Vo. 4, No. 2, Juy  December 2003 CONTRIBUTION OF INTERNAL AUDITING IN THE VALUE OF A NURSING UNIT WITHIN THREE YEARS John N.. Var arvatsouakis atsouakis DURING the present time,
More informationLoad Balancing in Distributed Web Server Systems with Partial Document Replication *
Load Baancing in Distributed Web Server Systems with Partia Document Repication * Ling Zhuo ChoLi Wang Francis C. M. Lau Department of Computer Science and Information Systems The University of Hong Kong
More informationOn Distributed Computation Rate Optimization for Deploying Cloud Computing Programming Frameworks
On Distributed omputation ate Optimization for Depoying oud omputing Programming Framewors Jia Liu athy H. Xia Ness B. Shroff Xiaodong Zhang Dept. of Eectrica and omputer Engineering Dept. of Integrated
More informationWHITE PAPER BEsT PRAcTIcEs: PusHIng ExcEl BEyond ITs limits WITH InfoRmATIon optimization
Best Practices: Pushing Exce Beyond Its Limits with Information Optimization WHITE Best Practices: Pushing Exce Beyond Its Limits with Information Optimization Executive Overview Microsoft Exce is the
More informationMaturity Fixed Rate Bonds
Savings Maturity Fixed Rate Bonds Effective from 15 September 2016 The current issue numbers and interest rates for our Maturity 1, 2 and 3 Year Fixed Rate Bonds are detaied in the Summary Boxes beow.
More informationNiagara Catholic. District School Board. High Performance. Support Program. Academic
Niagara Cathoic District Schoo Board High Performance Academic Support Program The Niagara Cathoic District Schoo Board, through the charisms of faith, socia justice, support and eadership, nurtures an
More informationsubject to x dp = 1.0, d D (2a)
Lightpath Topology Configuration for Wavelengthrouted IP/MPLS Networks for TimeDependent Traffic Gaurav Agrawal, Deep Medhi Computer Science & Electrical Engineering Department University of Missouri
More informationCERTIFICATE COURSE ON CLIMATE CHANGE AND SUSTAINABILITY. Course Offered By: Indian Environmental Society
CERTIFICATE COURSE ON CLIMATE CHANGE AND SUSTAINABILITY Course Offered By: Indian Environmenta Society INTRODUCTION The Indian Environmenta Society (IES) a dynamic and fexibe organization with a goba vision
More informationExperiment #11 BJT filtering
Jonathan Roderick Hakan Durmus Experiment #11 BJT fitering Introduction: Now that the BJT has bn expored in static and dynamic operation, the BJT, combined with what has bn aready presented, may be used
More informationOn the change in surpluses equivalence: measuring benefits from transport infrastructure investments
On the change in surpuses equivaence: measuring benefits from transport infrastructure investments José MeéndezHidago 1, Piet Rietved 1, Erik Verhoef 1,2 1 Department of Spatia Economics, Free University
More informationIEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 12, DECEMBER 2013 1
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 12, DECEMBER 2013 1 Scaabe MutiCass Traffic Management in Data Center Backbone Networks Amitabha Ghosh, Sangtae Ha, Edward Crabbe, and Jennifer
More informationComparison of Traditional and OpenAccess Appointment Scheduling for Exponentially Distributed Service Time
Journa of Heathcare Engineering Vo. 6 No. 3 Page 34 376 34 Comparison of Traditiona and OpenAccess Appointment Scheduing for Exponentiay Distributed Service Chongjun Yan, PhD; Jiafu Tang *, PhD; Bowen
More informationAn Analysis of Reliable Classifiers through ROC Isometrics
An Analysis of Reliable Classifiers through ROC Isometrics Stijn Vanderlooy s.vanderlooy@cs.unimaas.nl Ida G. SrinkhuizenKuyer kuyer@cs.unimaas.nl Evgueni N. Smirnov smirnov@cs.unimaas.nl MICCIKAT, Universiteit
More informationDecision support system for the batching problems of steelmaking and continuouscasting production
Omega 36 (2008 976 991 www.esevier.com/ocate/omega Decision support system for the batching probems of steemaking and continuouscasting production Lixin Tang, Gongshu Wang The Logistics Institute, Northeastern
More informationFace Hallucination and Recognition
Face Haucination and Recognition Xiaogang Wang and Xiaoou Tang Department of Information Engineering, The Chinese University of Hong Kong {xgwang1, xtang}@ie.cuhk.edu.hk http://mmab.ie.cuhk.edu.hk Abstract.
More informationLargeScale IP Traceback in HighSpeed Internet: Practical Techniques and Theoretical Foundation
LargeScale IP Traceback in HighSeed Internet: Practical Techniques and Theoretical Foundation Jun Li Minho Sung Jun (Jim) Xu College of Comuting Georgia Institute of Technology {junli,mhsung,jx}@cc.gatech.edu
More informationAn Idiot s guide to Support vector machines (SVMs)
An Idiot s guide to Support vector machines (SVMs) R. Berwick, Viage Idiot SVMs: A New Generation of Learning Agorithms Pre 1980: Amost a earning methods earned inear decision surfaces. Linear earning
More informationAn important observation in supply chain management, known as the bullwhip effect,
Quantifying the Bullwhi Effect in a Simle Suly Chain: The Imact of Forecasting, Lead Times, and Information Frank Chen Zvi Drezner Jennifer K. Ryan David SimchiLevi Decision Sciences Deartment, National
More informationLearning framework for NNs. Introduction to Neural Networks. Learning goal: Inputs/outputs. x 1 x 2. y 1 y 2
Introduction to Neura Networks Learning framework for NNs What are neura networks? Noninear function approimators How do they reate to pattern recognition/cassification? Noninear discriminant functions
More informationAustralian Bureau of Statistics Management of Business Providers
Purpose Austraian Bureau of Statistics Management of Business Providers 1 The principa objective of the Austraian Bureau of Statistics (ABS) in respect of business providers is to impose the owest oad
More informationThe Radix4 and the Class of Radix2 s FFTs
Chapter 11 The Radix and the Cass of Radix s FFTs The divideandconuer paradigm introduced in Chapter 3 is not restricted to dividing a probem into two subprobems. In fact, as expained in Section. and
More informationBetting Strategies, Market Selection, and the Wisdom of Crowds
Betting Strategies, Market Seection, and the Wisdom of Crowds Wiemien Kets Northwestern University wkets@keogg.northwestern.edu David M. Pennock Microsoft Research New York City dpennock@microsoft.com
More informationA Similarity Search Scheme over Encrypted Cloud Images based on Secure Transformation
A Simiarity Search Scheme over Encrypted Coud Images based on Secure Transormation Zhihua Xia, Yi Zhu, Xingming Sun, and Jin Wang Jiangsu Engineering Center o Network Monitoring, Nanjing University o Inormation
More informationAUSTRALIA S GAMBLING INDUSTRIES  INQUIRY
Mr Gary Banks Chairman Productivity Commission PO Box 80 BELCONNEN ACT 2616 Dear Mr Banks AUSTRALIA S GAMBLING INDUSTRIES  INQUIRY I refer to the Issues Paper issued September 1998 seeking submissions
More informationA Complete Operational Amplifier Noise Model: Analysis and Measurement of Correlation Coefficient
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I: FUNDAMENTAL THEORY AND APPLICATION, VOL. 47, NO. 3, MARCH 000 40 for ractical alication, oening the ath for widesread adotion of the clockgating technique
More informationASYMPTOTIC DIRECTION FOR RANDOM WALKS IN RANDOM ENVIRONMENTS arxiv:math/0512388v2 [math.pr] 11 Dec 2007
ASYMPTOTIC DIRECTION FOR RANDOM WALKS IN RANDOM ENVIRONMENTS arxiv:math/0512388v2 [math.pr] 11 Dec 2007 FRANÇOIS SIMENHAUS Université Paris 7, Mathématiques, case 7012, 2, pace Jussieu, 75251 Paris, France
More informationLecture 7 Datalink Ethernet, Home. Datalink Layer Architectures
Lecture 7 Dataink Ethernet, Home Peter Steenkiste Schoo of Computer Science Department of Eectrica and Computer Engineering Carnegie Meon University 15441 Networking, Spring 2004 http://www.cs.cmu.edu/~prs/15441
More informationAvaya Remote Feature Activation (RFA) User Guide
Avaya Remote Feature Activation (RFA) User Guide 03300149 Issue 5.0 September 2007 2007 Avaya Inc. A Rights Reserved. Notice Whie reasonabe efforts were made to ensure that the information in this document
More informationChapter 3: ebusiness Integration Patterns
Chapter 3: ebusiness Integration Patterns Page 1 of 9 Chapter 3: ebusiness Integration Patterns "Consistency is the ast refuge of the unimaginative." Oscar Wide In This Chapter What Are Integration Patterns?
More informationApplicationAware Data Collection in Wireless Sensor Networks
AppicationAware Data Coection in Wireess Sensor Networks Xiaoin Fang *, Hong Gao *, Jianzhong Li *, and Yingshu Li +* * Schoo of Computer Science and Technoogy, Harbin Institute of Technoogy, Harbin,
More informationFast bmatching via Sufficient Selection Belief Propagation
Fast bmatching via Sufficient Seection Beief Propagation Bert Huang Computer Science Department Coumbia University New York, NY 127 bert@cs.coumbia.edu Tony Jebara Computer Science Department Coumbia
More informationGreenTE: PowerAware Traffic Engineering
GreenTE: PowerAware Traffic Engineering Mingui Zhang zmg6@mais.tsinghua.edu.cn Cheng Yi yic@emai.arizona.edu Bin Liu iub@tsinghua.edu.cn Beichuan Zhang bzhang@arizona.edu Abstract Current network infrastructures
More informationIncome Distribution and the PublicPrivate Mix in Health Care Provision: The Latin American Case
InterAmerican Deveoment Bank Banco Interamericano de Desarroo Office of the Chief Economist Working aer #391 November 1998 Income Distribtion and the PbicPrivate Mix in Heath Care Provision: The Latin
More informationELEVATING YOUR GAME FROM TRADE SPEND TO TRADE INVESTMENT
Initiatives Strategic Mapping Success in The Food System: Discover. Anayze. Strategize. Impement. Measure. ELEVATING YOUR GAME FROM TRADE SPEND TO TRADE INVESTMENT Foodservice manufacturers aocate, in
More informationHybrid Process Algebra
Hybrid Process Agebra P.J.L. Cuijpers M.A. Reniers Eindhoven University of Technoogy (TU/e) Den Doech 2 5600 MB Eindhoven, The Netherands Abstract We deveop an agebraic theory, caed hybrid process agebra
More informationLoad Balancing Mechanism in Agentbased Grid
Communications on Advanced Comutational Science with Alications 2016 No. 1 (2016) 5762 Available online at www.isacs.com/cacsa Volume 2016, Issue 1, Year 2016 Article ID cacsa00042, 6 Pages doi:10.5899/2016/cacsa00042
More informationFixed income managers: evolution or revolution
Fixed income managers: evoution or revoution Traditiona approaches to managing fixed interest funds rey on benchmarks that may not represent optima risk and return outcomes. New techniques based on separate
More informationRisk Margin for a NonLife Insurance RunOff
Risk Margin for a NonLife Insurance RunOff Mario V. Wüthrich, Pau Embrechts, Andreas Tsanakas August 15, 2011 Abstract For sovency purposes insurance companies need to cacuate socaed bestestimate reserves
More informationOn Capacity Scaling in Arbitrary Wireless Networks
On Capacity Scaing in Arbitrary Wireess Networks Urs Niesen, Piyush Gupta, and Devavrat Shah 1 Abstract arxiv:07112745v3 [csit] 3 Aug 2009 In recent work, Özgür, Lévêque, and Tse 2007) obtained a compete
More information