On the Stability Region of Congestion Control
|
|
- Berniece Phillips
- 6 years ago
- Views:
Transcription
1 On the Stability Region of Congetion Control Xiaojun Lin and Ne B. Shroff School of Electrical and Computer Engineering Purdue Univerity, Wet Lafayette, IN Abtract It i well known that congetion control can be viewed a a ditributed iterative algorithm olving a global optimization problem that maximize the total ytem utility. In thi paper, we tudy the tability region of a network employing congetion control algorithm derived from uch an optimization framework. Previou work in the literature typically adopt a time-cale eparation aumption, which aume that, whenever the number of uer in the ytem change, the data rate of the uer are adjuted intantaneouly to the optimal rate allocation computed by the global optimization problem. Under thi aumption, it ha been hown that uch rate allocation policie can achieve the larget poible tability region. However, thi time-cale eparation aumption, although technically convenient, rarely hold in practice. In thi paper, we remove thi time-cale eparation aumption and how that the larget poible tability region can till be achieved by a large cla of congetion control algorithm derived from the optimization framework. Our reult provide new inight on the performance implication of congetion control and on the choice of the parameter of the congetion controller. 1
2 1 Introduction Congetion control (or rate control) i a key functionality in modern communication network. The objective of congetion control are two-fold: to utilize a much the available capacity of the network a poible without cauing evere congetion within the network, and to enure ome form of fairne among the uer. Since the eminal work by Kelly 1, it i clear that both of thee objective can be mapped to a global optimization problem that maximize the total ytem utility, where different fairne objective can be achieved by appropriately chooing the utility function. Congetion control can then be viewed a a ditributed iterative olution to the global optimization problem 1, 2, 3, 4. Significant advance in the undertanding of congetion control have been made under thi optimization framework for congetion control (ee 5 for a good urvey). The reult can be roughly categorized into two group. In the firt body of work, it i aumed that the number of uer in the network i fixed and each uer ha infinite data to tranfer. Thi reearch focue on developing ditributed iterative algorithm that converge to the fair rate allocation, which correpond to the olution of the global optimization problem. Variou iue have been addreed in thi body of work, including global convergence of the congetion control algorithm, local tability (in the ene of Lyapunov) of the equilibrium rate allocation, the impact of feedback delay and random noie, and the aymptotic behavior of the ytem when the number of uer i large. The econd body of work tudie a network with random dynamic arrival and departure of the uer. Thi reearch tudie the tability region of the ytem employing congetion control. Here, by tability, we mean that the number of uer in the ytem and the queue length at each link in the network remain finite. The tability region of the ytem under a given congetion control algorithm i the et of offered load under which the ytem i table. Thi body of work typically aume that, whenever the number of uer in the ytem change, the data rate of the uer are adjuted intantaneouly to the optimal (and fair) rate allocation computed 2
3 by the global optimization problem. Thi model eentially aume a time-cale eparation, i.e., the time cale of the arrival and departure of the uer i much lower than that of the dynamic determined by the congetion control algorithm derived in the firt body of work. It ha been hown that, for a large cla of utility function and fairne objective, the larget poible tability region can be achieved by allocating data rate fairly according to thi timecale eparation aumption 6, 7, 8, 9. Thi reult i important a it tell u that fairne i not merely an aethetic property, but it actually ha a trong global performance implication, i.e., in achieving the larget poible tability region. However, for a large network like today Internet, with the continual arrival and departure of the uer, the number of uer in the ytem change contantly. There will rarely be an extended period of time when the number of uer in the ytem i fixed. Hence, the iterative congetion control algorithm in the firt body of work may never have the chance to converge to an optimal (and fair) rate allocation. Therefore, the time-cale eparation aumption ued in the econd body of work, albeit technically convenient, rarely hold in practice. In thi paper, we tudy the tability region of congetion control without requiring uch a timecale eparation aumption. We will how that, even when we remove the time-cale eparation aumption, the larget poible tability region can till be achieved by a large cla of congetion control algorithm that are derived from the optimization framework. Hence, our reult reinforce the performance benefit of congetion control in a tronger ene than previou work. The ret of the paper i tructured a follow. In Section 2, we preent the ytem model and review ome relevant reult in the literature. Our main reult i preented in Section 3, and the proof i given in Section 4. Then we conclude. 2 The Sytem Model and Related Reult In thi ection, we decribe our ytem model and review certain related work. We conider a network with L link and S clae of uer. The capacity of each link l i R l. Uer of each 3
4 cla have one path through the network. Let H l = 1, if the path of uer of cla ue link l, and H l = 0, otherwie. Let x denote the rate at which each uer of cla end data into the network, and let U (x ) be the utility received by the uer of cla when it end data at rate x. The utility function U ( ) characterize the atifaction level of a uer of cla when it end data at a certain rate, and a we will oon dicu, it alo correpond to a certain fairne objective. A i typically aumed in the literature, we aume that each uer of cla ha a maximum data-rate limit of M, and the utility function U ( ) i increaing, trictly concave, and twice continuouly differentiable on (0, M 2. Let n, = 1,..., S denote the number of uer of cla that are in the ytem. Let n = n 1,..., n S and x = x 1,..., x S. Congetion control can then be formulated a the following global optimization problem 1: max x:0x M,,...,S ubject to n U (x ) (1) Hn l x R l for all l = 1,..., L. 2.1 Fairne It ha been well known that fairne objective can be achieved by appropriately chooing the utility function 7. For example, utility function of the form U (x ) = w log x (2) correpond to weighted proportional fairne, where w, = 1,..., S are the weight. A more general form of the utility function i x 1 β U (x ) = w, for ome β > 0 and β 1. (3) 1 β Maximizing the total ytem utility will correpond to maximizing weighted throughput a β 0, weighted proportional fairne a β 1, and max-min faine a β. 4
5 2.2 Convergence We firt aume that n, the number of uer in the ytem, i fixed and each uer ha an infinite backlog to tranfer. We aociate an implicit cot q l with each link l and let q = q 1,..., q L. The following iterative algorithm, commonly referred to a the dual olution in the congetion control literature, can olve problem (1) with an appropriate choice of the tep-ize. Algorithm A: At each time intant t, The data rate of each uer of cla i determined by: x (t) = argmax 0x M U (x ) x The implicit cot at each link l i updated by: q l (t + 1) = L Hq l l (t). (4) q l (t) + α l ( H l n x (t) R l ) +, (5) where + denote the projection to 0, ) and α l i a poitive tep-ize for each link l. The following propoition wa hown in 2 with lightly different notation. Propoition 1 Aume that the number of uer in the ytem i fixed. Further, aume that the curvature of U ( ) are bounded away from zero on (0, M, i.e., there exit a poitive number γ for each cla uch that U (x ) γ > 0 for all x (0, M. (6) Let x denote the optimal olution to problem (1). Let S = max l number of uer uing any link, and let L = max ued by any uer. If Hn l denote the maximum L H l denote the maximum number of link max α l 2 l SL min then Algorithm A converge, i.e., x(t) x a t. 5 γ, (7)
6 2.3 Stability Region We now turn to the cae when the number of uer in the ytem change dynamically. In thi cae, we will tudy the tability region of ytem. Here, by tability, we mean that the number of uer in the ytem and the queue length at each link in the network remain finite. To be precie, we aume that uer of cla arrive to the network according to a Poion proce with rate λ and that each uer bring with it a file for tranfer whoe ize i exponentially ditributed with mean 1/µ. The load brought by uer of cla i then ρ = λ /µ. Let ρ = ρ 1,..., ρ S. Let n (t) denote the number of uer of cla that are in the ytem at time t and let n(t) = n 1 (t),..., n S (t). We aume that the rate allocation for uer of the ame cla i identical. Let x (t) denote the rate of uer of cla at time t and let x(t) = x 1 (t),..., x S (t). In the rate aignment model that follow, the evolution of n(t) will be governed by a Markov proce. It tranition rate are given by: n (t) n (t) + 1, with rate λ, n (t) n (t) 1, with rate µ x (t)n (t) if n (t) > 0. We ay that the above ytem i table 10 if lim up t 1 t P t 0 1{ S P dt 0, a M. n L (t)+ q l (t)>m} The tability region Θ of the ytem under a given congetion control algorithm i the et of offered load ρ uch that the ytem i table for any ρ Θ. Pat work on the tability region of congetion control typically adopt the following time-cale eparation aumption: The Time-Scale Separation Aumption: The data rate x(t) of the uer at each time intant t are adjuted intantaneouly to the optimal rate allocation computed by the global optimization problem (1) with n = n(t). 6
7 We refer to a congetion controller that allocate data rate according to the above time-cale eparation aumption a the perfect congetion controller. We ay that the tability region achieved by a congetion controller i the larget poible when the following hold: for any offered load, if thi congetion controller cannot tabilize the ytem, no other congetion controller can. Note that the capacity contraint determine an upper bound on the tability region achieved by any congetion controller, i.e. { } Θ Θ 0 ρ Hρ l R l for all l. (8) The next propoition from 7 how that the tability region achieved by the perfect congetion controller i indeed the larget poible found on the right hand ide of (8). Propoition 2 Under the time-cale eparation aumption, if the utility function are of the form in (2) or (3) for ome β > 0, then for any offered load ρ that reide trictly inide Θ 0, the Markov proce n(t) i poitive recurrent and hence, lim up t 1 t P dt 0, a M. t 0 1{ S n (t)>m} 3 Stability Region of Congetion Control Without the Time-Scale Separation Aumption A dicued earlier in the Introduction, the time-cale eparation aumption rarely hold in reality. In typical network, uer arrive and depart contantly. Hence, the data rate of the uer employing a congetion control algorithm uch a algorithm A may never be able to converge. Further, note that the tep-ize condition (7) in Propoition 1 become more tringent a the number of uer in the ytem increae. A the offered load ρ approache the boundary of the tability region Θ 0, the number of uer in the ytem will approach infinity. Hence, given a choen et of tep-ize, algorithm A will fail to converge when the offered load i cloe to the boundary of Θ 0. The time-cale eparation aumption will not hold in thi cae either. 7
8 In thi ection, we will preent a new reult on the tability region of congetion control without thi time-cale eparation aumption. We firt decribe ome more detail of the dynamic of the ytem. We aume that time i divided into lot of length T, and that the implicit cot at the link are updated only at the end of each time lot. However, uer may arrive and depart in the middle of a time lot. Let q( ) denote the implicit cot at time lot k. Unlike the cae in Propoition 2, we now let the rate allocation x(t) be determined by the current implicit cot. We aume that the utility function i of the form (2) or (3). Then, by olving (4), the data rate of uer of cla i given by w x (t) = x ( ) = min L Hq l l ( ) 1/β, M, for t < (k + 1)T (9) (ue β = 1 when the utility function are of the form (2)). At the end of each time lot, the implicit cot are updated by ( q l ((k + 1)T ) = q l ( ) + α l H l n (t)x ( )dt T R l ) +. (10) The following propoition how that, even when the time-cale eparation aumption i removed, the above congetion control algorithm can till achieve the larget poible tability region. The proof i given in Section 4. Propoition 3 Aume that the utility function are of the form in (2) or (3) for ome β > 1, and that the data rate of the uer are controlled by (9). Let S = maxl denote the maximum number of clae uing any link, and let L = max number of link ued by any cla, If L H l H l denote the maximum max α l 1 l T S L 2 β 1 16 min w ρ M β (11) (ue β = 1 if the utility function are of the form in (2)), then for any offered load ρ that reide trictly inide Θ 0, the ytem decribed by the Markov proce n( ), q( ) i table. 8
9 Several remark are in order: Firtly, no time-cale eparation aumption i required in Propoition 3. Hence, we do not require that the data rate of the uer converge. Secondly, a tep-ize rule that i independent of the intantaneou number of uer in the ytem i provided in (11) (note the difference between S and S). Given our dicuion at the beginning of thi ection, it i quite remarkable that we do not need to reduce the tep-ize even when the offered load i cloe to the boundary of the tability region. In fact, ince the et Θ 0 i bounded, the tep-ize can be choen independently of the offered load. The tep-ize rule (11) i dependent on M, the maximum data rate of uer belonging to cla. Thi dependence i not urpriing. Since the utility function are of the form in (2) or (3), we have, Hence, the minimum curvature of U ( ) i U (x ) = β w x β+1. γ = βw M β+1. Let ñ = ρ /M, which can be interpreted a the average number of uer of cla in a (fictitiou) M/M/ / ytem where each uer of cla i erved at it maximum data rate M. The tepize condition (11) then become max α l 1 l T S L 2 β 1 16β which i comparable to (7). However, note that ñ i quite different from En (t), the average number of uer of cla in the real ytem. Again, a ñ i alway bounded, the tep-ize can be choen independently of the offered load. min γ ñ, 4 Proof of Propoition 3 Define V( n, q) = V n ( n) + V q ( q), 9
10 where V n ( n) = 1 (1 + ɛ) β w n β+1, V (1 + β)µ ρ β q ( q) = L (q l ) 2 2α l, and ɛ i a poitive contant in (0, 1 to be choen later. We hall how that V(, ) i a Lyapunov function of the ytem. We begin with a few lemma. The firt lemma bound the change in V n ( ). Lemma 4 EV n ( n((k + 1)T ) V n ( n( )) n( ), q( ) ɛ E 0 () En β (t) n( ), q( )dt + L Hq l l ( ) (1 + ɛ)ρ T +E 1, 2 β 1 w 8(1 + ɛ) ρ M β t= En 2 (t)x 2 (t) n( ), q( )dt En (t)x (t) n( ), q( )dt (12) where E 0 () and E 1 are finite poitive contant. Proof: Over a mall time interval δt, we have E n β+1 (t + δt) n β+1 (t) n(t), q(t) = (n (t) + 1) β+1 n β+1 (t)λ δt + (n (t) 1) β+1 n β+1 (t)µ n (t)x (t)δt + o(δt). By the Mean-Value Theorem, (n + n) β+1 n β+1 = (β + 1)n β n + for ome ν (0, 1). Hence, letting n = ±1, we have E n β+1 (t + δt) n β+1 (t) n(t), q(t) β(β + 1) (n + ν n) β 1 ( n) 2 2 (β + 1)n β (t)λ δt µ n (t)x (t)δt +2 β 2 β(β + 1)n β 1 (t) λ δt + µ n (t)x (t)δt + N 1 ()δt + o(δt) 10
11 for ome poitive contant N 1 (). We then have, where = EV n ( n(t + δt)) V n ( n(t)) n(t), q(t) δt 1 { w n β (t) λ (1 + ɛ) β µ ρ β µ n (t)x (t) + β2β 2 w n β 1 (t) µ ρ β 1 { w n β (t) ρ (1 + ɛ) β n (t)x (t) ɛ = (1 + ɛ) β ɛ ρ β + β2β 2 w n β 1 ρ β (t) w n β (t) ρ β 1 + β2β 2 w n β 1 ρ β N 0 ()n β (t) + } λ + µ n (t)x (t) + N 1 () + o(1) } ρ + n (t)x (t) + N 1 () + o(1) + 1 (1 + ɛ) β { w n β (t) (1 + ɛ)ρ n (t)x (t) ρ β } (t) ρ + n (t)x (t) + N 1 () + o(1) (13) { L Hq l l (t) (1 + ɛ)ρ n (t)x (t) w L + x β (t) Hq l l (t) (1 + ɛ)ρ n (t)x (t) (14) n β (t) +w ((1 + ɛ)ρ ) 1 (1 + ɛ)ρ β x β n (t)x (t) (15) (t) + β2β 2 w n β 1 (t) ρ (1 + ɛ) β + n (t)x (t) (16) + N 1() (1 + ɛ) β ρ β } + o(1), N 0 () = 1 (1 + ɛ) β w ρ β 1 We hall bound the three term (14-16). By (9), { L w x β (t) = max Hq l l (t), w M β Hence, the term (14) can be bounded by w L x β (t) Hq l l (t) (1 + ɛ)ρ n (t)x (t) 11. }.
12 w L x β (t) Hq l l (t) (1 + ɛ)ρ + w L Hq (t) l l (1 + ɛ)ρ M β N 2 () (1 + ɛ)w ρ. (17) M β Let (A) and (B) denote the term (15) and (16), repectively. Note that n β (t) (A) = w ((1 + ɛ)ρ ) 1 (1 + ɛ)ρ β x β n (t)x (t) (t) (1 + ɛ)ρ n (t)x (t) ((1 + ɛ)ρ ) β n β (t)x β (t) = w ((1 + ɛ)ρ ) β x β (t) 0. (18) If n (t)x (t) 2(1 + ɛ)ρ, then (1 + ɛ)ρ n (t)x (t) ((1 + ɛ)ρ ) β n β (t)x β (t) n (t)x (t) 2 β 1 n β 2 2 β (t)x β (t). (19) Hence, (A) 2β 1 w n β+1 x (t) 2 β+1 ((1 + ɛ)ρ ), β and Since (B) β2β 1 w n β (t)x (t). (1 + ɛ) β β2 β 1 n β (t) 2β 1 2 for ome poitive contant N 3 (), we have, where nβ+1 β+2 ρ β (t) + N 3 () (B) (A) 2 + w N 3 ()x (t) ((1 + ɛ)ρ ) β (A) 2 + N 4(), N 4 () = w N 3 ()M ((1 + ɛ)ρ ) β. 12
13 On the other hand, if n (t)x (t) < 2(1 + ɛ)ρ 4ρ, then (B) 5β2β 2 w n β 1 (t) (1 + ɛ) β ρ β 1 = N 5 ()n β 1 (t), where In both cae, N 5 () = 5β2β 2 (1 + ɛ) β w ρ β 1. Subtituting (17) and (20) back to (14-16), we have, (B) (A) 2 + N 5()n β 1 (t) + N 4 (). (20) EV n ( n(t + δt)) V n ( n(t)) n(t), q(t) δt ɛn0 ()n β (t) N 5 ()n β 1 (t) + + L Hq l l (t) (1 + ɛ)ρ n (t)x (t) (A) 2 + N 1 () + N 2 () + N 4 () + o(1). (21) We hall ue (18) and (19) again to bound (A)/2. Since x (t) M, if n (t)x (t) 2(1 + ɛ)ρ, we have, (A) 2 2 β 1 n β+1 (t)x β+1 (t) w 2 β+2 ((1 + ɛ)ρ ) β M β w 2 β 1 2 β+2 2 β 1 (1 + ɛ)ρ n 2 (t)x 2 (t) w 2 β 1 8(1 + ɛ) n 2 (t)x 2 (t). ρ M β M β (22) On the other hand, if n (t)x (t) < 2(1 + ɛ)ρ, we till have (A)/2 0. Hence, in both cae, (A) 2 w 2 β 1 n 2 (t)x 2 (t) + N 8(1 + ɛ) ρ M β 6 (), (23) 13
14 where Further, note that for ome poitive contant N 7 (). N 6 () = w 2 β 1 8(1 + ɛ) N 5 ()n β 1 (2(1 + ɛ)ρ ) 2. ρ M β (t) ɛn 0() n β (t) + N 7 () (24) 2 Subtituting (23) and (24) into (21), and integrating over, (k + 1)T, the reult (12) then follow with E 0 () = N 0 ()/2 and E 1 = T N 1 () + N 2 () + N 4 () + N 6 () + N 7 (). Q.E.D. The next lemma bound the change in V q ( ). For implicity, we ue the following matrix notation. Let A denote the L L diagonal matrix whoe l-th diagonal element i α l. Let H denote the L S matrix whoe (l, )-element i H l. Let R = R 1,..., R l tr, where tr denote the tranpoe. Further let X (t) = n (t)x (t) and let X(t) = X 1 (t),..., X S (t) tr. Then V q ( q) = q tr A 1 q, 2 and the update on the implicit cot (10) can be written a ( Lemma 5 q((k + 1)T ) = q( ) + A H X(t)dt RT ) +. (25) EV q ( q((k + 1)T ) V q ( q( )) n( ), q( ) q tr ( ) H +T α max S L E X(t) n( ), q( )dt RT (k+1)t En 2 (t)x 2 (t) n( ), q( )dt + E 2, (26) where α max = max l α l, L and S are defined a in Propoition 3, and E2 i a finite poitive contant. 14
15 Proof: By (25), V q ( q((k + 1)T ) V q ( q( )) q tr ( ) H + 1 H 2 q tr ( ) H + H X(t)dt RT tr X(t)dt RT A H X(t)dt RT tr X(t)dt A H X(t)dt RT X(t)dt + T 2 R tr AR. For the econd term, we have, tr (k+1)t (k+1)t H X(t)dt A H X(t)dt L 2 (k+1)t = α l H l n (t)x (t)dt L α l H ( ) 2 (k+1)t l H l n (t)x (t)dt ( S L ) 2 (k+1)t α l H l n (t)x (t)dt T S L n 2 (t)x 2 (t)dt = T S α l H l (k+1)t L n 2 (t)x 2 (t)dt α l H l T α max S L (k+1)t n 2 (t)x 2 (t)dt. (27) Letting E 2 = T 2 R tr AR, the reult (26) then follow. Q.E.D. Proof of Propoition 3 : Adding (12) to (26), and noting that { L } (k+1)t Hq l l ( ) En (t)x (t) n( ), q( )dt 15
16 L = q l ( ) = q tr ( ) H H l En (t)x (t) n( ), q( )dt E X(t) n( ), q( )dt, we have, EV( n((k + 1)T ), q((k + 1)T )) V( n( ), q( )) n( ), q( ) ɛ E 0 () En β (t) n( ), q( )dt + L Hq l l ( ) (1 + ɛ)ρ T q tr ( ) RT 2 β 1 w 8(1 + ɛ) ρ M β +E 3, T α max S L En 2 (t)x 2 (t) n( ), q( )dt (28) where E 3 = E 1 + E 2. If (11) i atified, then the product term in (28) i negative. Hence, by ome rearrangement of the order of the ummation, we have, EV( n((k + 1)T ), q((k + 1)T )) V( n( ), q( )) n( ), q( ) ɛ E 0 () En β (t) n( ), q( )dt + T q tr ( ) (1 + ɛ)h ρ R + E 3. By aumption, ρ lie trictly inide Θ 0. Hence, there exit ome ɛ (0, 1 uch that (1+2ɛ)H ρ R. Ue thi value of ɛ in the definition of V(, ). we then have, EV( n((k + 1)T ), q((k + 1)T )) V( n( ), q( )) n( ), q( ) ɛ E 0 () En β (t) n( ), q( )dt ɛt q tr ( )H ρ + E 3 ɛ n β ( ) + L q l ( ) + E 3 for ome ɛ > 0. By Theorem 2 of 10, the reult then follow. Q.E.D. 16
17 Remark: Thi proof will not work for β < 1, in which cae the relationhip (22) will fail to hold. (We need (22) to cancel the econd term in (26) of the change in V q ( ).) We have not been able to either prove or diprove our reult for β < 1. We could have reorted to the fluid limit technique of 11. However, the difficulty in applying the technique of 11 i that the fluid limit of our ytem i not well defined whenever L Hq l l (t) = 0 for ome cla, which alo correpond to the cae when the econd term in (26) i large. We will leave the cae β < 1 for future work. 5 Concluion In thi paper, we have tudied the tability region of a network employing congetion control algorithm derived from an optimization framework. We have removed the time-cale eparation aumption typical in other related work, and etablihed that the larget poible tability region can be achieved by a large cla of congetion control algorithm (i.e., the o-called dual olution ) derived from the optimization framework. Our reult provide new inight on the performance implication of congetion control, and on the choice of the parameter of the congetion controller. Several direction for future work are poible. Firtly, it would be intereting to ee whether our main reult hold for the o-called primal olution in the literature 1. Secondly, we have aumed a Markovian model in thi paper. We plan to extend our reult to more general uer arrival and departure procee. Our reult can alo be extended to other form of utility function 9. Thirdly, we plan to tudy the impact of feedback delay. We expect that our main reult (Propoition 3) would hold even in the preence of feedback delay, provided that the tepize are appropriately choen. Finally, the extenion to the cae with multipath routing would alo be intereting. 17
18 Reference 1 F. P. Kelly, A. Maulloo, and D. Tan, Rate Control in Communication Network: Shadow Price, Proportional Fairne and Stability, Journal of the Operational Reearch Society, vol. 49, pp , S. H. Low and D. E. Lapley, Optimization Flow Control I: Baic Algorithm and Convergence, IEEE/ACM Tranaction on Networking, vol. 7, no. 6, pp , December S. Kunniyur and R. Srikant, End-to-End Congetion Control Scheme: Utility Function, Random Loe and ECN Mark, IEEE/ACM Tranaction on Networking, vol. 11, no. 5, pp , October H. Yaiche, R. Mazumdar, and C. Roenberg, A Game Theoretic Framework for Bandwidth Allocation and Pricing in Broadband Network, IEEE/ACM Tranaction on Networking, vol. 8, no. 5, pp , Oct S. H. Low and R. Srikant, A Mathematical Framework for Deigning a Low-Lo Low-Delay Internet, Network and Spatial Economic, vol. 4, no. 1, pp , March G. De Veciana, T. J. Lee, and T. Kontantopoulo, Stability and Performance Analyi of Network Supporting Elatic Service, IEEE/ACM Tranaction on Networking, vol. 9, no. 1, pp. 2 14, February T. Bonald and L. Maoulie, Impact of Fairne on Internet Performance, in Proceeding of ACM Sigmetric, Cambridge, MA, June 2001, pp G. Fayolle, A. L. Fortelle, J. M. Lagoutte, L. Maoulie, and J. Robert, Bet Effort Network: Modeling and Performance Analyi via Large Network Aymptotic, in Proceeding of IEEE INFOCOM, Anchorage, Alaka, April
19 9 H. Q. Ye, Stability of Data Network Under an Optimization-Baed Bandwidth Allocation, IEEE Tranaction on Automatic Control, vol. 48, no. 7, pp , July M. J. Neely, E. Modiano, and C. E. Rohr, Power Allocation and Routing in Multibeam Satellite with Time-Varying Channel, IEEE/ACM Tranaction on Networking, vol. 11, no. 1, pp , February J. G. Dai, On Poitive Harri Recurrence of Multicla Queueing Network: A Unified Approach via Fluid Limit Model, Annal of Applied Probability, vol. 5, pp ,
CONGESTION control is a key functionality in modern
IEEE TRANSACTIONS ON INFORMATION TEORY, VOL. X, NO. X, XXXXXXX 2008 On the Connection-Level Stability of Congetion-Controlled Communication Network Xiaojun Lin, Member, IEEE, Ne B. Shroff, Fellow, IEEE,
More informationThe Impact of Imperfect Scheduling on Cross-Layer Rate. Control in Multihop Wireless Networks
The mpact of mperfect Scheduling on Cro-Layer Rate Control in Multihop Wirele Network Xiaojun Lin and Ne B. Shroff Center for Wirele Sytem and Application (CWSA) School of Electrical and Computer Engineering,
More informationThe Impact of Imperfect Scheduling on Cross-Layer Rate Control in Wireless Networks
The Impact of Imperfect Scheduling on Cro-Layer Rate Control in Wirele Network Xiaojun Lin and Ne B. Shroff Center for Wirele Sytem and Application (CWSA) School of Electrical and Computer Engineering,
More informationThe Impact of Imperfect Scheduling on Cross-Layer Congestion Control in Wireless Networks
EEE/ACM TRANSACTONS ON NETWORKNG, VOL. X, NO. XX, XXXXXXX 200X 1 The mpact of mperfect Scheduling on Cro-Layer Congetion Control in Wirele Network Xiaojun Lin, Member, EEE and Ne B. Shroff Senior Member,
More informationA Constraint Propagation Algorithm for Determining the Stability Margin. The paper addresses the stability margin assessment for linear systems
A Contraint Propagation Algorithm for Determining the Stability Margin of Linear Parameter Circuit and Sytem Lubomir Kolev and Simona Filipova-Petrakieva Abtract The paper addree the tability margin aement
More informationA Simplified Methodology for the Synthesis of Adaptive Flight Control Systems
A Simplified Methodology for the Synthei of Adaptive Flight Control Sytem J.ROUSHANIAN, F.NADJAFI Department of Mechanical Engineering KNT Univerity of Technology 3Mirdamad St. Tehran IRAN Abtract- A implified
More informationOnline Appendix for Managerial Attention and Worker Performance by Marina Halac and Andrea Prat
Online Appendix for Managerial Attention and Worker Performance by Marina Halac and Andrea Prat Thi Online Appendix contain the proof of our reult for the undicounted limit dicued in Section 2 of the paper,
More informationDeparture Time and Route Choices with Bottleneck Congestion: User Equilibrium under Risk and Ambiguity
Departure Time and Route Choice with Bottleneck Congetion: Uer Equilibrium under Rik and Ambiguity Yang Liu, Yuanyuan Li and Lu Hu Department of Indutrial Sytem Engineering and Management National Univerity
More informationChapter 4. The Laplace Transform Method
Chapter 4. The Laplace Tranform Method The Laplace Tranform i a tranformation, meaning that it change a function into a new function. Actually, it i a linear tranformation, becaue it convert a linear combination
More informationChapter 2 Sampling and Quantization. In order to investigate sampling and quantization, the difference between analog
Chapter Sampling and Quantization.1 Analog and Digital Signal In order to invetigate ampling and quantization, the difference between analog and digital ignal mut be undertood. Analog ignal conit of continuou
More information7.2 INVERSE TRANSFORMS AND TRANSFORMS OF DERIVATIVES 281
72 INVERSE TRANSFORMS AND TRANSFORMS OF DERIVATIVES 28 and i 2 Show how Euler formula (page 33) can then be ued to deduce the reult a ( a) 2 b 2 {e at co bt} {e at in bt} b ( a) 2 b 2 5 Under what condition
More informationThen C pid (s) S h -stabilizes G(s) if and only if Ĉpid(ŝ) S 0 - stabilizes Ĝ(ŝ). For any ρ R +, an RCF of Ĉ pid (ŝ) is given by
9 American Control Conference Hyatt Regency Riverfront, St. Loui, MO, USA June -, 9 WeC5.5 PID Controller Synthei with Shifted Axi Pole Aignment for a Cla of MIMO Sytem A. N. Gündeş and T. S. Chang Abtract
More informationChapter 7. Root Locus Analysis
Chapter 7 Root Locu Analyi jw + KGH ( ) GH ( ) - K 0 z O 4 p 2 p 3 p Root Locu Analyi The root of the cloed-loop characteritic equation define the ytem characteritic repone. Their location in the complex
More informationHybrid Projective Dislocated Synchronization of Liu Chaotic System Based on Parameters Identification
www.ccenet.org/ma Modern Applied Science Vol. 6, No. ; February Hybrid Projective Dilocated Synchronization of Liu Chaotic Sytem Baed on Parameter Identification Yanfei Chen College of Science, Guilin
More informationCHAPTER 8 OBSERVER BASED REDUCED ORDER CONTROLLER DESIGN FOR LARGE SCALE LINEAR DISCRETE-TIME CONTROL SYSTEMS
CHAPTER 8 OBSERVER BASED REDUCED ORDER CONTROLLER DESIGN FOR LARGE SCALE LINEAR DISCRETE-TIME CONTROL SYSTEMS 8.1 INTRODUCTION 8.2 REDUCED ORDER MODEL DESIGN FOR LINEAR DISCRETE-TIME CONTROL SYSTEMS 8.3
More informationUtility Proportional Fair Bandwidth Allocation: An Optimization Oriented Approach
Utility Proportional Fair Bandwidth Allocation: An Optimization Oriented Approach 61 Tobia Hark Konrad-Zue-Zentrum für Informationtechnik Berlin (ZIB), Department Optimization, Takutr. 7, 14195 Berlin,
More informationMulti-dimensional Fuzzy Euler Approximation
Mathematica Aeterna, Vol 7, 2017, no 2, 163-176 Multi-dimenional Fuzzy Euler Approximation Yangyang Hao College of Mathematic and Information Science Hebei Univerity, Baoding 071002, China hdhyywa@163com
More informationReliability Analysis of Embedded System with Different Modes of Failure Emphasizing Reboot Delay
International Journal of Applied Science and Engineering 3., 4: 449-47 Reliability Analyi of Embedded Sytem with Different Mode of Failure Emphaizing Reboot Delay Deepak Kumar* and S. B. Singh Department
More informationLecture 10 Filtering: Applied Concepts
Lecture Filtering: Applied Concept In the previou two lecture, you have learned about finite-impule-repone (FIR) and infinite-impule-repone (IIR) filter. In thee lecture, we introduced the concept of filtering
More informationSliding Mode Based Congestion Control and
Sliding Mode Baed Congetion Control and 1 Scheduling for Multi-cla Traffic over Per-link Queueing Wirele Network Zongrui Ding and Dapeng Wu Abtract Thi paper conider the problem of joint congetion control
More informationAnalysis and Design of a Third Order Phase-Lock Loop
Analyi Deign of a Third Order Phae-Lock Loop DANIEL Y. ABRAMOVITCH Ford Aeropace Corporation 3939 Fabian Way, MS: X- Palo Alto, CA 94303 Abtract Typical implementation of a phae-lock loop (PLL) are econd
More informationStochastic Optimization with Inequality Constraints Using Simultaneous Perturbations and Penalty Functions
Stochatic Optimization with Inequality Contraint Uing Simultaneou Perturbation and Penalty Function I-Jeng Wang* and Jame C. Spall** The John Hopkin Univerity Applied Phyic Laboratory 11100 John Hopkin
More informationIEOR 3106: Fall 2013, Professor Whitt Topics for Discussion: Tuesday, November 19 Alternating Renewal Processes and The Renewal Equation
IEOR 316: Fall 213, Profeor Whitt Topic for Dicuion: Tueday, November 19 Alternating Renewal Procee and The Renewal Equation 1 Alternating Renewal Procee An alternating renewal proce alternate between
More informationControl Systems Analysis and Design by the Root-Locus Method
6 Control Sytem Analyi and Deign by the Root-Locu Method 6 1 INTRODUCTION The baic characteritic of the tranient repone of a cloed-loop ytem i cloely related to the location of the cloed-loop pole. If
More informationLecture 21. The Lovasz splitting-off lemma Topics in Combinatorial Optimization April 29th, 2004
18.997 Topic in Combinatorial Optimization April 29th, 2004 Lecture 21 Lecturer: Michel X. Goeman Scribe: Mohammad Mahdian 1 The Lovaz plitting-off lemma Lovaz plitting-off lemma tate the following. Theorem
More informationMulticolor Sunflowers
Multicolor Sunflower Dhruv Mubayi Lujia Wang October 19, 2017 Abtract A unflower i a collection of ditinct et uch that the interection of any two of them i the ame a the common interection C of all of
More informationEE Control Systems LECTURE 14
Updated: Tueday, March 3, 999 EE 434 - Control Sytem LECTURE 4 Copyright FL Lewi 999 All right reerved ROOT LOCUS DESIGN TECHNIQUE Suppoe the cloed-loop tranfer function depend on a deign parameter k We
More informationPreemptive scheduling on a small number of hierarchical machines
Available online at www.ciencedirect.com Information and Computation 06 (008) 60 619 www.elevier.com/locate/ic Preemptive cheduling on a mall number of hierarchical machine György Dóa a, Leah Eptein b,
More information696 Fu Jing-Li et al Vol. 12 form in generalized coordinate Q ffiq dt = 0 ( = 1; ;n): (3) For nonholonomic ytem, ffiq are not independent of
Vol 12 No 7, July 2003 cfl 2003 Chin. Phy. Soc. 1009-1963/2003/12(07)/0695-05 Chinee Phyic and IOP Publihing Ltd Lie ymmetrie and conerved quantitie of controllable nonholonomic dynamical ytem Fu Jing-Li(ΛΠ±)
More informationMarch 18, 2014 Academic Year 2013/14
POLITONG - SHANGHAI BASIC AUTOMATIC CONTROL Exam grade March 8, 4 Academic Year 3/4 NAME (Pinyin/Italian)... STUDENT ID Ue only thee page (including the back) for anwer. Do not ue additional heet. Ue of
More informationLecture 7: Testing Distributions
CSE 5: Sublinear (and Streaming) Algorithm Spring 014 Lecture 7: Teting Ditribution April 1, 014 Lecturer: Paul Beame Scribe: Paul Beame 1 Teting Uniformity of Ditribution We return today to property teting
More informationBogoliubov Transformation in Classical Mechanics
Bogoliubov Tranformation in Claical Mechanic Canonical Tranformation Suppoe we have a et of complex canonical variable, {a j }, and would like to conider another et of variable, {b }, b b ({a j }). How
More informationDigital Control System
Digital Control Sytem - A D D A Micro ADC DAC Proceor Correction Element Proce Clock Meaurement A: Analog D: Digital Continuou Controller and Digital Control Rt - c Plant yt Continuou Controller Digital
More informationSimple Observer Based Synchronization of Lorenz System with Parametric Uncertainty
IOSR Journal of Electrical and Electronic Engineering (IOSR-JEEE) ISSN: 78-676Volume, Iue 6 (Nov. - Dec. 0), PP 4-0 Simple Oberver Baed Synchronization of Lorenz Sytem with Parametric Uncertainty Manih
More informationEvolutionary Algorithms Based Fixed Order Robust Controller Design and Robustness Performance Analysis
Proceeding of 01 4th International Conference on Machine Learning and Computing IPCSIT vol. 5 (01) (01) IACSIT Pre, Singapore Evolutionary Algorithm Baed Fixed Order Robut Controller Deign and Robutne
More informationNew bounds for Morse clusters
New bound for More cluter Tamá Vinkó Advanced Concept Team, European Space Agency, ESTEC Keplerlaan 1, 2201 AZ Noordwijk, The Netherland Tama.Vinko@ea.int and Arnold Neumaier Fakultät für Mathematik, Univerität
More informationSocial Studies 201 Notes for November 14, 2003
1 Social Studie 201 Note for November 14, 2003 Etimation of a mean, mall ample ize Section 8.4, p. 501. When a reearcher ha only a mall ample ize available, the central limit theorem doe not apply to the
More informationScale Efficiency in DEA and DEA-R with Weight Restrictions
Available online at http://ijdea.rbiau.ac.ir Int. J. Data Envelopent Analyi (ISSN 2345-458X) Vol.2, No.2, Year 2014 Article ID IJDEA-00226, 5 page Reearch Article International Journal of Data Envelopent
More informationOptimal revenue management in two class pre-emptive delay dependent Markovian queues
Optimal revenue management in two cla pre-emptive delay dependent Markovian queue Manu K. Gupta, N. Hemachandra and J. Venkatewaran Indutrial Engineering and Operation Reearch, IIT Bombay March 15, 2015
More informationON THE APPROXIMATION ERROR IN HIGH DIMENSIONAL MODEL REPRESENTATION. Xiaoqun Wang
Proceeding of the 2008 Winter Simulation Conference S. J. Maon, R. R. Hill, L. Mönch, O. Roe, T. Jefferon, J. W. Fowler ed. ON THE APPROXIMATION ERROR IN HIGH DIMENSIONAL MODEL REPRESENTATION Xiaoqun Wang
More informationStochastic Perishable Inventory Control in a Service Facility System Maintaining Inventory for Service: Semi Markov Decision Problem
Stochatic Perihable Inventory Control in a Service Facility Sytem Maintaining Inventory for Service: Semi Markov Deciion Problem R.Mugeh 1,S.Krihnakumar 2, and C.Elango 3 1 mugehrengawamy@gmail.com 2 krihmathew@gmail.com
More informationAutomatic Control Systems. Part III: Root Locus Technique
www.pdhcenter.com PDH Coure E40 www.pdhonline.org Automatic Control Sytem Part III: Root Locu Technique By Shih-Min Hu, Ph.D., P.E. Page of 30 www.pdhcenter.com PDH Coure E40 www.pdhonline.org VI. Root
More informationGiven the following circuit with unknown initial capacitor voltage v(0): X(s) Immediately, we know that the transfer function H(s) is
EE 4G Note: Chapter 6 Intructor: Cheung More about ZSR and ZIR. Finding unknown initial condition: Given the following circuit with unknown initial capacitor voltage v0: F v0/ / Input xt 0Ω Output yt -
More informationLecture 4 Topic 3: General linear models (GLMs), the fundamentals of the analysis of variance (ANOVA), and completely randomized designs (CRDs)
Lecture 4 Topic 3: General linear model (GLM), the fundamental of the analyi of variance (ANOVA), and completely randomized deign (CRD) The general linear model One population: An obervation i explained
More informationUNIT 15 RELIABILITY EVALUATION OF k-out-of-n AND STANDBY SYSTEMS
UNIT 1 RELIABILITY EVALUATION OF k-out-of-n AND STANDBY SYSTEMS Structure 1.1 Introduction Objective 1.2 Redundancy 1.3 Reliability of k-out-of-n Sytem 1.4 Reliability of Standby Sytem 1. Summary 1.6 Solution/Anwer
More informationA Simple Approach to Synthesizing Naïve Quantized Control for Reference Tracking
A Simple Approach to Syntheizing Naïve Quantized Control for Reference Tracking SHIANG-HUA YU Department of Electrical Engineering National Sun Yat-Sen Univerity 70 Lien-Hai Road, Kaohiung 804 TAIAN Abtract:
More informationCONTROL SYSTEMS, ROBOTICS AND AUTOMATION Vol. VIII Decoupling Control - M. Fikar
DECOUPLING CONTROL M. Fikar Department of Proce Control, Faculty of Chemical and Food Technology, Slovak Univerity of Technology in Bratilava, Radlinkého 9, SK-812 37 Bratilava, Slovakia Keyword: Decoupling:
More informationCHEAP CONTROL PERFORMANCE LIMITATIONS OF INPUT CONSTRAINED LINEAR SYSTEMS
Copyright 22 IFAC 5th Triennial World Congre, Barcelona, Spain CHEAP CONTROL PERFORMANCE LIMITATIONS OF INPUT CONSTRAINED LINEAR SYSTEMS Tritan Pérez Graham C. Goodwin Maria M. Serón Department of Electrical
More informationRoot Locus Diagram. Root loci: The portion of root locus when k assume positive values: that is 0
Objective Root Locu Diagram Upon completion of thi chapter you will be able to: Plot the Root Locu for a given Tranfer Function by varying gain of the ytem, Analye the tability of the ytem from the root
More informationRELIABILITY OF REPAIRABLE k out of n: F SYSTEM HAVING DISCRETE REPAIR AND FAILURE TIMES DISTRIBUTIONS
www.arpapre.com/volume/vol29iue1/ijrras_29_1_01.pdf RELIABILITY OF REPAIRABLE k out of n: F SYSTEM HAVING DISCRETE REPAIR AND FAILURE TIMES DISTRIBUTIONS Sevcan Demir Atalay 1,* & Özge Elmataş Gültekin
More informationSocial Studies 201 Notes for March 18, 2005
1 Social Studie 201 Note for March 18, 2005 Etimation of a mean, mall ample ize Section 8.4, p. 501. When a reearcher ha only a mall ample ize available, the central limit theorem doe not apply to the
More informationAvoiding Forbidden Submatrices by Row Deletions
Avoiding Forbidden Submatrice by Row Deletion Sebatian Wernicke, Jochen Alber, Jen Gramm, Jiong Guo, and Rolf Niedermeier Wilhelm-Schickard-Intitut für Informatik, niverität Tübingen, Sand 13, D-72076
More informationAssignment for Mathematics for Economists Fall 2016
Due date: Mon. Nov. 1. Reading: CSZ, Ch. 5, Ch. 8.1 Aignment for Mathematic for Economit Fall 016 We now turn to finihing our coverage of concavity/convexity. There are two part: Jenen inequality for concave/convex
More informationGain and Phase Margins Based Delay Dependent Stability Analysis of Two- Area LFC System with Communication Delays
Gain and Phae Margin Baed Delay Dependent Stability Analyi of Two- Area LFC Sytem with Communication Delay Şahin Sönmez and Saffet Ayaun Department of Electrical Engineering, Niğde Ömer Halidemir Univerity,
More informationProblem Set 8 Solutions
Deign and Analyi of Algorithm April 29, 2015 Maachuett Intitute of Technology 6.046J/18.410J Prof. Erik Demaine, Srini Devada, and Nancy Lynch Problem Set 8 Solution Problem Set 8 Solution Thi problem
More informationMATEMATIK Datum: Tid: eftermiddag. A.Heintz Telefonvakt: Anders Martinsson Tel.:
MATEMATIK Datum: 20-08-25 Tid: eftermiddag GU, Chalmer Hjälpmedel: inga A.Heintz Telefonvakt: Ander Martinon Tel.: 073-07926. Löningar till tenta i ODE och matematik modellering, MMG5, MVE6. Define what
More informationLayering as Optimization Decomposition
TLEN7000/ECEN7002: Analytical Foundation of Network Layering a Optimization Decompoition Lijun Chen 11/29/2012 The Internet Compleity i ever increaing Large in ize and cope Enormou heterogeneity Incomplete
More informationFeedback Control Systems (FCS)
Feedback Control Sytem (FCS) Lecture19-20 Routh-Herwitz Stability Criterion Dr. Imtiaz Huain email: imtiaz.huain@faculty.muet.edu.pk URL :http://imtiazhuainkalwar.weebly.com/ Stability of Higher Order
More informationTheoretical Computer Science. Optimal algorithms for online scheduling with bounded rearrangement at the end
Theoretical Computer Science 4 (0) 669 678 Content lit available at SciVere ScienceDirect Theoretical Computer Science journal homepage: www.elevier.com/locate/tc Optimal algorithm for online cheduling
More informationApproximate Analytical Solution for Quadratic Riccati Differential Equation
Iranian J. of Numerical Analyi and Optimization Vol 3, No. 2, 2013), pp 21-31 Approximate Analytical Solution for Quadratic Riccati Differential Equation H. Aminikhah Abtract In thi paper, we introduce
More informationEFFECT ON PERSISTENCE OF INTRA-SPECIFIC COMPETITION IN COMPETITION MODELS
Electronic Journal of Differential Equation, Vol. 2007(2007, No. 25, pp. 0. ISSN: 072-669. URL: http://ejde.math.txtate.edu or http://ejde.math.unt.edu ftp ejde.math.txtate.edu (login: ftp EFFECT ON PERSISTENCE
More informationTechnical Appendix: Auxiliary Results and Proofs
A Technical Appendix: Auxiliary Reult and Proof Lemma A. The following propertie hold for q (j) = F r [c + ( ( )) ] de- ned in Lemma. (i) q (j) >, 8 (; ]; (ii) R q (j)d = ( ) q (j) + R q (j)d ; (iii) R
More informationin a circular cylindrical cavity K. Kakazu Department of Physics, University of the Ryukyus, Okinawa , Japan Y. S. Kim
Quantization of electromagnetic eld in a circular cylindrical cavity K. Kakazu Department of Phyic, Univerity of the Ryukyu, Okinawa 903-0, Japan Y. S. Kim Department of Phyic, Univerity of Maryland, College
More informationUnbounded solutions of second order discrete BVPs on infinite intervals
Available online at www.tjna.com J. Nonlinear Sci. Appl. 9 206), 357 369 Reearch Article Unbounded olution of econd order dicrete BVP on infinite interval Hairong Lian a,, Jingwu Li a, Ravi P Agarwal b
More informationAn inventory model with temporary price discount when lead time links to order quantity
80 Journal of Scientific & Indutrial Reearch J SCI IN RES VOL 69 MARCH 00 Vol. 69 March 00 pp. 80-87 An inventory model with temporary price dicount when lead time link to order quantity Chih-Te Yang Liang-Yuh
More informationUSING NONLINEAR CONTROL ALGORITHMS TO IMPROVE THE QUALITY OF SHAKING TABLE TESTS
October 12-17, 28, Beijing, China USING NONLINEAR CONTR ALGORITHMS TO IMPROVE THE QUALITY OF SHAKING TABLE TESTS T.Y. Yang 1 and A. Schellenberg 2 1 Pot Doctoral Scholar, Dept. of Civil and Env. Eng.,
More informationReformulation of Block Implicit Linear Multistep Method into Runge Kutta Type Method for Initial Value Problem
International Journal of Science and Technology Volume 4 No. 4, April, 05 Reformulation of Block Implicit Linear Multitep Method into Runge Kutta Type Method for Initial Value Problem Muhammad R., Y. A
More informationEarth Potential Rise (EPR) Computation for a Fault on Transmission Mains Pole
ACN: 32586675 ABN: 8632586675 NATIONAL ELECTRICAL ENGINEERING CONULTANCY Earth otential Rie (ER) Computation for a Fault on Tranmiion Main ole repared by: M. Naereddine ACN: 32586675 ABN: 8632586675 Abtract
More informationCall Centers with a Postponed Callback Offer
Call Center with a Potponed Callback Offer Benjamin Legro, Sihan Ding, Rob Van Der Mei, Oualid Jouini To cite thi verion: Benjamin Legro, Sihan Ding, Rob Van Der Mei, Oualid Jouini. Call Center with a
More informationControl chart for waiting time in system of (M / M / S) :( / FCFS) Queuing model
IOSR Journal of Mathematic (IOSR-JM) e-issn: 78-578. Volume 5, Iue 6 (Mar. - Apr. 3), PP 48-53 www.iorjournal.org Control chart for waiting time in ytem of (M / M / S) :( / FCFS) Queuing model T.Poongodi,
More informationA SIMPLE NASH-MOSER IMPLICIT FUNCTION THEOREM IN WEIGHTED BANACH SPACES. Sanghyun Cho
A SIMPLE NASH-MOSER IMPLICIT FUNCTION THEOREM IN WEIGHTED BANACH SPACES Sanghyun Cho Abtract. We prove a implified verion of the Nah-Moer implicit function theorem in weighted Banach pace. We relax the
More informationCONTROL SYSTEMS. Chapter 5 : Root Locus Diagram. GATE Objective & Numerical Type Solutions. The transfer function of a closed loop system is
CONTROL SYSTEMS Chapter 5 : Root Locu Diagram GATE Objective & Numerical Type Solution Quetion 1 [Work Book] [GATE EC 199 IISc-Bangalore : Mark] The tranfer function of a cloed loop ytem i T () where i
More informationRoot Locus Contents. Root locus, sketching algorithm. Root locus, examples. Root locus, proofs. Root locus, control examples
Root Locu Content Root locu, ketching algorithm Root locu, example Root locu, proof Root locu, control example Root locu, influence of zero and pole Root locu, lead lag controller deign 9 Spring ME45 -
More informationThe continuous time random walk (CTRW) was introduced by Montroll and Weiss 1.
1 I. CONTINUOUS TIME RANDOM WALK The continuou time random walk (CTRW) wa introduced by Montroll and Wei 1. Unlike dicrete time random walk treated o far, in the CTRW the number of jump n made by the walker
More informationFUNDAMENTALS OF POWER SYSTEMS
1 FUNDAMENTALS OF POWER SYSTEMS 1 Chapter FUNDAMENTALS OF POWER SYSTEMS INTRODUCTION The three baic element of electrical engineering are reitor, inductor and capacitor. The reitor conume ohmic or diipative
More informationFactor Analysis with Poisson Output
Factor Analyi with Poion Output Gopal Santhanam Byron Yu Krihna V. Shenoy, Department of Electrical Engineering, Neurocience Program Stanford Univerity Stanford, CA 94305, USA {gopal,byronyu,henoy}@tanford.edu
More informationLecture 8. PID control. Industrial process control ( today) PID control. Insights about PID actions
Lecture 8. PID control. The role of P, I, and D action 2. PID tuning Indutrial proce control (92... today) Feedback control i ued to improve the proce performance: tatic performance: for contant reference,
More informationSolutions. Digital Control Systems ( ) 120 minutes examination time + 15 minutes reading time at the beginning of the exam
BSc - Sample Examination Digital Control Sytem (5-588-) Prof. L. Guzzella Solution Exam Duration: Number of Quetion: Rating: Permitted aid: minute examination time + 5 minute reading time at the beginning
More informationUnified Design Method for Flexure and Debonding in FRP Retrofitted RC Beams
Unified Deign Method for Flexure and Debonding in FRP Retrofitted RC Beam G.X. Guan, Ph.D. 1 ; and C.J. Burgoyne 2 Abtract Flexural retrofitting of reinforced concrete (RC) beam uing fibre reinforced polymer
More informationTo appear in International Journal of Numerical Methods in Fluids in Stability analysis of numerical interface conditions in uid-structure therm
To appear in International Journal of Numerical Method in Fluid in 997. Stability analyi of numerical interface condition in uid-tructure thermal analyi M. B. Gile Oxford Univerity Computing Laboratory
More informationSERIES COMPENSATION: VOLTAGE COMPENSATION USING DVR (Lectures 41-48)
Chapter 5 SERIES COMPENSATION: VOLTAGE COMPENSATION USING DVR (Lecture 41-48) 5.1 Introduction Power ytem hould enure good quality of electric power upply, which mean voltage and current waveform hould
More informationAn Inequality for Nonnegative Matrices and the Inverse Eigenvalue Problem
An Inequality for Nonnegative Matrice and the Invere Eigenvalue Problem Robert Ream Program in Mathematical Science The Univerity of Texa at Dalla Box 83688, Richardon, Texa 7583-688 Abtract We preent
More informationOptimal Coordination of Samples in Business Surveys
Paper preented at the ICES-III, June 8-, 007, Montreal, Quebec, Canada Optimal Coordination of Sample in Buine Survey enka Mach, Ioana Şchiopu-Kratina, Philip T Rei, Jean-Marc Fillion Statitic Canada New
More informationStratified Analysis of Probabilities of Causation
Stratified Analyi of Probabilitie of Cauation Manabu Kuroki Sytem Innovation Dept. Oaka Univerity Toyonaka, Oaka, Japan mkuroki@igmath.e.oaka-u.ac.jp Zhihong Cai Biotatitic Dept. Kyoto Univerity Sakyo-ku,
More informationCodes Correcting Two Deletions
1 Code Correcting Two Deletion Ryan Gabry and Frederic Sala Spawar Sytem Center Univerity of California, Lo Angele ryan.gabry@navy.mil fredala@ucla.edu Abtract In thi work, we invetigate the problem of
More informationResearch Article Existence for Nonoscillatory Solutions of Higher-Order Nonlinear Differential Equations
International Scholarly Reearch Network ISRN Mathematical Analyi Volume 20, Article ID 85203, 9 page doi:0.502/20/85203 Reearch Article Exitence for Nonocillatory Solution of Higher-Order Nonlinear Differential
More informationSMALL-SIGNAL STABILITY ASSESSMENT OF THE EUROPEAN POWER SYSTEM BASED ON ADVANCED NEURAL NETWORK METHOD
SMALL-SIGNAL STABILITY ASSESSMENT OF THE EUROPEAN POWER SYSTEM BASED ON ADVANCED NEURAL NETWORK METHOD S.P. Teeuwen, I. Erlich U. Bachmann Univerity of Duiburg, Germany Department of Electrical Power Sytem
More informationCDMA Signature Sequences with Low Peak-to-Average-Power Ratio via Alternating Projection
CDMA Signature Sequence with Low Peak-to-Average-Power Ratio via Alternating Projection Joel A Tropp Int for Comp Engr and Sci (ICES) The Univerity of Texa at Autin 1 Univerity Station C0200 Autin, TX
More informationLecture 3. January 9, 2018
Lecture 3 January 9, 208 Some complex analyi Although you might have never taken a complex analyi coure, you perhap till know what a complex number i. It i a number of the form z = x + iy, where x and
More informationOne Class of Splitting Iterative Schemes
One Cla of Splitting Iterative Scheme v Ciegi and V. Pakalnytė Vilniu Gedimina Technical Univerity Saulėtekio al. 11, 2054, Vilniu, Lithuania rc@fm.vtu.lt Abtract. Thi paper deal with the tability analyi
More informationProactive Serving Decreases User Delay Exponentially: The Light-tailed Service Time Case
Proactive Serving Decreae Uer Delay Exponentially: The Light-tailed Service Time Cae Shaoquan Zhang, Longbo Huang, Minghua Chen, and Xin Liu Abtract In online ervice ytem, the delay experienced by uer
More informationCompetitive Analysis of Task Scheduling Algorithms on a Fault-Prone Machine and the Impact of Resource Augmentation
Competitive Analyi of Tak Scheduling Algorithm on a Fault-Prone Machine and the Impact of Reource Augmentation Antonio Fernández Anta a, Chryi Georgiou b, Dariuz R. Kowalki c, Elli Zavou a,d,1 a Intitute
More informationPythagorean Triple Updated 08--5 Drlnoordzij@leennoordzijnl wwwleennoordzijme Content A Roadmap for generating Pythagorean Triple Pythagorean Triple 3 Dicuion Concluion 5 A Roadmap for generating Pythagorean
More informationRandom vs. Deterministic Deployment of Sensors in the Presence of Failures and Placement Errors
Random v. Determinitic Deployment of Senor in the Preence of Failure and Placement Error Paul Baliter Univerity of Memphi pbalitr@memphi.edu Santoh Kumar Univerity of Memphi antoh.kumar@memphi.edu Abtract
More informationA Full-Newton Step Primal-Dual Interior Point Algorithm for Linear Complementarity Problems *
ISSN 76-7659, England, UK Journal of Information and Computing Science Vol 5, No,, pp 35-33 A Full-Newton Step Primal-Dual Interior Point Algorithm for Linear Complementarity Problem * Lipu Zhang and Yinghong
More informationAdvanced D-Partitioning Analysis and its Comparison with the Kharitonov s Theorem Assessment
Journal of Multidiciplinary Engineering Science and Technology (JMEST) ISSN: 59- Vol. Iue, January - 5 Advanced D-Partitioning Analyi and it Comparion with the haritonov Theorem Aement amen M. Yanev Profeor,
More informationEXTENDED STABILITY MARGINS ON CONTROLLER DESIGN FOR NONLINEAR INPUT DELAY SYSTEMS. Otto J. Roesch, Hubert Roth, Asif Iqbal
EXTENDED STABILITY MARGINS ON CONTROLLER DESIGN FOR NONLINEAR INPUT DELAY SYSTEMS Otto J. Roech, Hubert Roth, Aif Iqbal Intitute of Automatic Control Engineering Univerity Siegen, Germany {otto.roech,
More informationConvex Hulls of Curves Sam Burton
Convex Hull of Curve Sam Burton 1 Introduction Thi paper will primarily be concerned with determining the face of convex hull of curve of the form C = {(t, t a, t b ) t [ 1, 1]}, a < b N in R 3. We hall
More informationμ + = σ = D 4 σ = D 3 σ = σ = All units in parts (a) and (b) are in V. (1) x chart: Center = μ = 0.75 UCL =
Our online Tutor are available 4*7 to provide Help with Proce control ytem Homework/Aignment or a long term Graduate/Undergraduate Proce control ytem Project. Our Tutor being experienced and proficient
More informationPacific Journal of Mathematics
Pacific Journal of Mathematic OSCILLAION AND NONOSCILLAION OF FORCED SECOND ORDER DYNAMIC EQUAIONS MARIN BOHNER AND CHRISOPHER C. ISDELL Volume 230 No. March 2007 PACIFIC JOURNAL OF MAHEMAICS Vol. 230,
More information