MAX-MIN OPTIMALITY OF SERVICE RATES IN QUEUEING SYSTEMS WITH CUSTOMER-AVERAGE PERFORMANCE CRITERION. Li Xia Ming Xie Wenjun Yin Jin Dong
|
|
- Cameron Tyler
- 7 years ago
- Views:
Transcription
1 Proceedings of the 28 Winter Simulation Conference S. J. Mason, R. R. Hill, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. MAX-MIN OPTIMALITY OF SERVICE RATES IN QUEUEING SYSTEMS WITH CUSTOMER-AVERAGE PERFORMANCE CRITERION Li Xia Ming Xie Wenjun Yin Jin Dong IBM China Research Laboratory Diamond Building, Zhongguancun Software Park Haidian District, Beijing 1193, P. R. CHINA ABSTRACT In this paper, we consider the optimization of service rates in queueing systems, especially in closed Jackson networks. The optimization criterion is the customer-average performance, which is another important performance metric compared with the traditional time-average performance. Based on the methodology of perturbation analysis, we can derive a performance difference equation when the service rates are changed. With this difference equation, we find the optimal service rates have a Max-Min property, i.e., the optimal service rates can be chosen from its maximal or minimal value. This property can reduce the complexity of this type of optimization problems. Moreover, we also prove the max-min optimality is valid for both state-dependent service rates and load-dependent service rates in queueing systems. 1 INTRODUCTION Perturbation analysis (PA) is an important theory for the performance optimization of discrete event dynamic systems (DEDS). It gives an efficient way to estimate the performance gradient with respect to system parameters (e.g., the service rates of servers in queueing systems) based on a single sample path (Cao 1994, Cassandras and Lafortune 1999, Glasserman 1991, Gong and Ho 1987, Ho and Cao 1991, Ho, Cao, and Cassandras 1983). With the estimated performance gradients, the gradient-descent algorithms can be used to optimize the system parameters (Chong and Zak 21). The traditional PA theory of queueing systems is extended to Markov systems in the past decade. With the PA theory of Markov systems (we also call it Markov performance potential theory), many new insights into Markov decision processes (MDP) are obtained from a new point of view (Cao and Chen 1997, Cao 23). Although the perturbations in queueing systems are continuous in nature and those in Markov systems are discrete, Xia and Cao (26b) establish the relationship between these two theories. It bridges the gap between PA theory in these two systems. Based on this relationship, we can develop the parallel results between these two theories, such as the performance difference equations and policy iteration algorithms to optimize the service rates under the customer-average performance criterion in queueing systems (Xia, Chen, and Cao 28). In most of the optimization algorithms, time-average performance is used as the performance metric of queueing systems. In fact, customer-average performance is also an important performance metric in queueing systems. It quantifies the system performance averaged by the number of served customers and reflects the idea of customeroriented, which is very popular in many service industries. In practice, many performance measurements belong to the customer-average performance, such as the average waiting time of each customer in a banking system, the probability of a packet successfully reaching the destination node in a wireless communication network, and so on. On the other hand, to the best of our knowledge, there seems not to exist any algorithm for the customer-average performance. Moreover, by a numerical experiment presented in this paper we find that the algorithm for time-average performance can not be directly used to optimize the customer-average performance. Therefore, it is desirable to study the optimization of service rates under the customer-average performance criterion. In this paper we consider the optimization of service rates in a closed Jackson network. The objective is to change the service rates to achieve the optimal customeraverage performance. We study the optimization of two types of service rates, state-dependent service rates and load-dependent service rates. With the performance difference equation in PA theory, we prove that the service /8/$ IEEE 59
2 rates have the Max-Min optimality when the performance function satisfies some properties. It means that we only need to choose the maximal or minimal values of service rates during the optimization of this type of problems. It can greatly reduce the complexity of optimization problems. The Max-Min optimality of service rates is similar to the results of Ma and Cao (1994), Yao and Schechner (1989). But in this paper the optimization criterion is customeraverage performance, which is different from the timeaverage performance discussed by Ma and Cao (1994), Yao and Schechner (1989). Moreover, the previous articles (Ma and Cao 1994, Yao and Schechner 1989) only discuss the load-dependent service rates. Here we prove the Max- Min optimality for both state-dependent service rates and load-dependent service rates. Furthermore, in this paper we prove the Max-Min optimality based on the difference equation in PA theory with a very clear and concise manner. The proofs of Ma and Cao (1994), Yao and Schechner (1989) are much more difficult respectively from the performance gradients and linear programming. The performance difference equation and policy iteration used in this paper give another way to do the optimization of queueing systems. The remainder of the paper is organized as follows. In Section 2 we give an introduction of PA theory in queueing systems related to this paper. Section 3 discusses the optimization problems in closed Jackson networks. We prove the Max-Min optimality of service rates based on the performance difference equation. The policy iteration algorithm is also introduced to do the optimization. In Section 4 we give the numerical experiments to demonstrate the optimality of Max-Min service rates. The difference between customer-average performance and time-average performance is also demonstrated by numerical examples. Finally, we conclude this paper in Section 5. 2 BACKGROUND ON PERTURBATION ANALYSIS In this section, we give an introduction of PA theory in queueing systems, especially the concept of perturbation realization factors and performance sensitivity equations in queueing systems. Consider a closed Jackson network consisting of M servers (Chen and Yao 21, Gordon and Newell 1967). The number of total customers in the network is N. After the service of a customer has been completed at server i, this customer will depart from server i and enter server j with routing probabilities q ij, i, j = 1,2,,M. Without loss of generality, we assume q ii =. The service discipline in each server is FCFS (First-Come First-Served) and the buffer size is infinite. Let n i be the number of customers at server i, and set n =(n 1,n 2,,n i,,n M ). The service requirement of each customer at every server is assumed to be exponentially distributed with mean one, and the service rate of server i depends on n and is therefore denoted as μ i,n, i = 1,2,,M. It is easy to see that n is the system state, and the state space is S = all n : M i=1 n i = N. We call this network a state-dependent closed Jackson network. Let n(t) denote the system state at time t and f (n) : S R =(, ) be the cost function. Let T L be the Lth service completion time of the network (counting all the service completions of servers in the network). The time-average performance is defined as η T = lim TL f (n(t))dt F L = lim, (1) T L T L where F L := T L f (n(t))dt, and the customer-average performance is defined as η ( f ) F L = lim L. (2) We assume that the state process n(t) is ergodic so that the limits in (1) and (2) exist. The time-average performance is a traditional metric used in many systems, while the customeraverage performance is also another important performance metric. These two performance metrics describe different aspects of the performance in queueing systems and both are widely used in practical applications. The difference between them will be discussed later. We now review the perturbation realization factors in PA theory. In a closed network, if the service completion time of a server is delayed by a small amount of time Δ, we say that the server has a perturbation. This perturbation will affect the system performance η ( f ). The effect of a single perturbation Δ of server k when the system is at state n can be measured by the perturbation realization factor, which is defined as c ( f ) ΔFL (n,k)= lim lim E Δ Δ =lim lim Δ E =lim lim Δ E F L F L Δ ( 1 T L Δ TL ) f (n (t))dt f (n(t))dt, (3) where n (t) is the state of the perturbed sample path at time t, T L is the Lth service completion time on the perturbed sample path. From (3), we define the perturbation realization probability c(n,k) as a special case of c ( f ) (n,k) where f (n) =I(n) 1 for all n S. c(n,k) is the probability with which a perturbation of server k at state n will be realized at every server of the network ultimately. With the perturbation realization factors c ( f ) (n,k), we may derive the system performance derivative with respect 51
3 to the service rates as follows (Cao 1994). dη ( f ) d = η(i) π(n)c ( f ) (n,k), (4) where η (I) is a special system performance corresponding to f (n)=i(n) 1 for all n S, and π(n) is the steady-state probability of state n. Since η (I) is a special case of η ( f ), from (2) we have η (I) = lim TL I(n(t))dt T L = lim L L. (5) It is easy to know that η (I) is the reciprocal of average throughput of the network, i.e., L η th = lim = 1, (6) T L η (I) where η th is denoted as the throughput of queueing networks. With (1), (2), and (5), we have η ( f ) F L T L = lim T L L = η T η (I), (7) which shows the relationship between the customer-average performance η ( f ) and the time-average performance η T. Since the service rates will affect the value of both η T and η (I), the optimal values of service rates for η ( f ) and η T are generally different. The numerical experiments in Section 4 demonstrate this point. If we substitute f (n)=i(n) into (4), we get the derivative equation of η (I) as below. dη (I) d = η(i) π(n)c(n,k). (8) These formulas (4) and (8) are important for the gradient-based algorithm of PA theory in queueing systems. We can estimate the performance derivative from sample paths and use the gradient-descent algorithms to optimize the system performance through adjusting the service rates (Cao 1994, Chong and Zak 21). 3 MAX-MIN OPTIMALITY OF SERVICE RATES In this section, we consider the optimization problem of a state-dependent closed Jackson network, where the optimization parameters are the service rates of each server k at each state n, k = 1,2,,M, n S. The objective is to minimize (or maximize) the customer-average performance η ( f ). With the notation of Markov decision processes (Puterman 1994), we can denote U =,k = 1,2,,M,n S as a stationary policy based on parameter. The total policy space is Ψ = all U, which is parameterized by. The cost function is f (n),n S, which may be different for different actions. Furthermore, we denote the cost function as f (n, μ n ), where μ n :=(μ 1,n, μ 2,n,,μ M,n ) is the action at state n. With this notation, a policy can be denoted as U = μ n,n S. With PA of queueing systems, we can use the performance derivative equation (4) to optimize the service rates. But this type of gradient-descent algorithms has a slow convergence speed and may be trapped in a local optimum. In the middle of 9 s of the last century, PA theory has been extended to Markov systems (Cao and Chen 1997, Cao 23). The performance difference equation and policy iteration algorithm are derived along this direction. But this methodology can only optimize the traditional timeaverage performance. Recently, the performance difference equation for customer-average performance is also derived (Xia, Chen, and Cao 28). It gives a new way to do optimization of queueing systems with customer-average performance criterion. With the relationship formula of perturbation realization factors between queueing systems and Markov systems (Xia and Cao 26b), researchers derive the customeraverage performance difference equation for queueing systems. Here we just list the main results without explanation. The detailed proof can be found in Xia, Chen, and Cao (28). When the service rates of server k at state n is changed to μ k,n, the customeraverage performance of closed Jackson networks will be changed from η ( f ) to η ( f ). The performance difference equation is derived as below. η ( f ) η ( f ) = η (I) π Δμk,n (n) c ( f ) (n,k)+h(n), (9) where Δ = μ k,n, h(n)= f (n) f (n), the superscript prime represents the parameters of the perturbed system. If the service rates of all the servers at all the states have changes, the performance difference equation is derived similarly as below. η ( f ) η ( f ) = η (I) π (n) n S M k=1 Δ c ( f ) (n,k)+h(n). (1) Furthermore, with the property of perturbation realization factors c ( f ) (n,k), equation (1) can be simplified as follows (Xia, Chen, and Cao 28). η ( f ) η ( f ) = η (I) π (n) n S f (n) c ( f ) (n,k). (11) M μ k,n k=1 511
4 With these performance difference equations, we can find the optimal service rates of closed Jackson networks have a Max-Min optimality if the cost functions satisfy some requirements. The detailed Max-Min optimality is described as below. Theorem 1 (Max-Min Optimality for State- Dependent Service Rates) In a state-dependent closed Jackson network, if f (n) =l (n)+ M k=1 l(n,k), l (n) and l(n, k) are constants, i.e., f (n) changes linearly with service rates, then the optimal service rate of each server can be either maximal or minimal. Proof. In a state-dependent closed Jackson network, when the service rate of server k changes from to +Δ, the cost function f at state n also changes from f (n) to f (n). Since f (n)=l (n)+ M k=1 l(n,k),wehaveh(n)= f (n) f (n)=δ l(n,k), where l(n,k) is a constant which means the changed cost function per unit changed service rate Δ. So, the performance difference equation (9) becomes η ( f ) η ( f ) = η (I) π Δμk,n (n) c ( f ) (n,k)+h(n) = η (I) π (n)δ c( f ) (n,k) + l(n,k). (12) With (12), we can prove Theorem 1 easily. We first assume that the optimal service rate is neither maximal nor minimal. Since η (I) and π (n) are always positive, from (12) it is easy to know that l(n,k) c( f ) (n,k) μ should be k,n zero (otherwise we can change to get a better η ( f ) ). Since l(n,k) c( f ) (n,k) is zero, it is obvious that the maximal or minimal value of can also achieve the optimal performance. Therefore, it is proved that we can get the optimal performance from the maximal or minimal values of service rates. This theorem extends the similar results of Ma and Cao (1994), Yao and Schechner (1989), which discuss the optimization of the time-average performance of load-dependent networks, to the optimization of the customer-average performance of state-dependent closed networks. It implies that in the performance optimization of closed queueing networks, if f changes linearly with service rates, we only need to consider the maximal or minimal service rates for every state n. So, the action space is reduced to 2 M. Using this property may speed up the optimization procedure greatly. Moreover, from ( 12) itis easy to know that η ( f ) is monotone with respect to if we only change and fix other parameters. So far, we have discussed the optimization of statedependent service rates in closed Jackson networks. The Max-Min optimality of service rates have been proved and it can be used to simplify the optimization procedure. With the performance difference equations ( 9) and (11), the policy iteration type of algorithms can be further derived. This type of algorithms can be implemented on-line based on the estimation of realization factors on a single sample path. The details of algorithm can be found in Xia, Chen, and Cao (28) and we will use it to do numerical experiments in Section 4. Below, we further discuss the optimization problem for loaddependent service rates in closed Jackson networks. We use the similar procedure to prove the Max-Min optimality for load-dependent service rates. In a load-dependent closed Jackson network, the service rate of a server k is dependent only on the queue length at server k. We denote the load-dependent service rates as k, k = 1,2,,M, n k =,1,,N. Obviously, it is known that k when n k =. As we know, the steady-state distribution of closed Jackson network has a product-form solution. With the product-form solution and customerbased aggregation of realization factors, the performance difference equation is derived as follows when the service rates are changed from k to μ k,n k for a particular server k and n k = 1,2,,N (Xia and Cao 26a). η ( f ) η ( f ) = η (I) N n k =1 π (n k ) Δμk,nk k c ( f ) (n k,k)+ h(n k,k), (13) where c ( f ) (n k,k) := π(n n k )c ( f ) (n,k), h(n k,k) := n S nk π(n n k )h(n,k)= π(n n k )[ f (n) f (n)], S nk is n S nk n S nk the set of states where the number of customers at server k is equal to n k. With the performance difference equation ( 13), we can also derive the Max-Min optimality of service rates in a loaddependent closed Jackson network. The proof is similar to that of Theorem 1 and it is neglected for the simplicity of paper. Theorem 2 (Max-Min Optimality for Load- Dependent Service Rates) In a load-dependent closed Jackson network, if f (n)=l (n)+ M k=1 l(n k,k)k,l (n) and l(n k,k) are constants, i.e., f (n) changes linearly with service rates k, then the optimal service rate of each server can be either maximal or minimal. With Theorem 2 we know if the cost function is linear with the service rates, we only need to choose the maximal or minimal service rates. It is similar to Theorem 1. These optimality properties can greatly simplify the optimization complexity of closed Jackson networks. With these theorems, we can only focus on the maximal or minimal values of service rates when we apply any optimization algorithm. This is also called the Bang-Bang control in the area of control science. 512
5 Table 1: Optimal service rates of a state-dependent closed Jackson network. n μ1,n μ2,n μ3,n D μ1,n D μ2,n D μ3,n μ1,n μ2,n μ3,n μ 1,n μ 2,n μ 3,n (,,5) [.1,2.] [.3,1.5] [.9,3.] (,1,4) [.2,2.5] [.2,1.5] [.3,3.5] (,2,3) [.1,1.5] [.5,2.5] [.5,4.5] (,3,2) [.3,1.5] [.6,3.] [.1,1.5] (,4,1) [.2,2.] [.9,2.] [.4,2.] (,5,) [.5,1.5] [.4,2.5] [.1,3.] (1,,4) [.4,2.] [.5,3.] [.6,2.] (1,1,3) [.5,2.5] [.2,3.5] [.8,1.5] (1,2,2) [.2,2.] [.6,1.5] [.4,2.5] (1,3,1) [.6,1.5] [.3,2.] [.2,2.5] (1,4,) [.4,2.5] [.5,3.5] [.7,3.5] (2,,3) [.6,1.] [.3,3.5] [.1,3.] (2,1,2) [.7,1.5] [.4,4.] [.6,2.] (2,2,1) [.8,2.5] [.1,2.] [.5,3.5] (2,3,) [.7,2.] [.2,1.5] [.1,4.] (3,,2) [.3,2.] [.1,1.] [.4,2.] (3,1,1) [.5,2.5] [.1,2.] [.8,4.] (3,2,) [.9,4.5] [.6,3.5] [.6,3.5] (4,,1) [.1,3.5] [.8,1.5] [.9,2.] (4,1,) [.6,4.] [.4,3.] [.4,2.5] (5,,) [.4,4.5] [.6,3.5] [.5,2.] NUMERICAL EXPERIMENTS In this section, we use the policy iteration algorithm to optimize the service rates of closed Jackson networks. The numerical results demonstrate the Max-Min optimality of service rates. The detailed implementation of policy iteration algorithm is neglected for the length limitation of paper. Readers who are interested can refer the literature Xia, Chen, and Cao (28) and Xia and Cao (26a), which are respectively for statedependent and load-dependent closed Jackson networks. First, we consider the optimization of state-dependent service rates in closed Jackson network. The number of servers is M = 3 and the number of customers is N = 5. The routing probability matrix is Q = The initial service rates μk,n are listed in Table 1. The cost function is defined as f (n)=n 1 + r 3 k=1, where r is the cost of unit service rate and we set r = 1 in this example. In fact, r can be a set of values which represent the different costs at different states. The objective is to minimize the customer-average performance η ( f ) through adjusting the service rates, k = 1,2,3 and n S. The value domains of service rates are listed as D μk,n in Table 1. With the policy iteration algorithm for customer-average performance (Xia, Chen, and Cao 28), we find the algorithm iterates some times and locates the optimal solution finally. The optimal service rates μk,n are listed in Table 1. The minimal customer-average performance is η ( f ) = From Table 1 we can also see that the optimal service rates are either maximal or minimal. It demonstrates the correctness of Theorem 1. As a comparison, we use the traditional algorithms in Markov decision processes to optimize the time-average performance of this problem. With this performance metric, we obtain the optimal service rates μ k,n for time-average performance, which are listed in Table 1. The corresponding η ( f ) = , which is larger than the optimal value η ( f ) = The optimal service rates μ k,n for time-average performance are also different from the optimal service rates μk,n for customer-average performance. This experiment illustrates that the algorithm for time-average performance can not be directly used to optimize the customer-average performance. These two performance metrics characterize the different aspects of optimization problems. 513
6 Furthermore, in order to more clearly illustrate the difference between customer-average performance and timeaverage performance, we give another numerical example as follows. Consider a cyclic network with 2 servers. The number of customers is N = 3. For simplicity, we can use n 1 to represent the system state n. The service rates of server 2isfixedatμ 2,n1 = 1, n 1 =,1,2,3. The service rates of server 1 is μ 1,n1 = 1 when n 1 =,1,2, and μ 1,n1 [.5,2] when n 1 = 3. The cost function is f ()= f (1)= f (2)=1, f (3) = μ 1,3 (1 μ 1,3 ) 2. The objective is to choose an optimal μ 1,3 to minimize the system performance η ( f ). With numerical computation, we obtain the performance curve as Figure 1. It is obvious that the optimal μ 1,3 is 2 for η ( f ), while the optimal μ 1,3 is.5 for η T. This example clearly demonstrates the difference between these two performance metrics. system performance η T η (f) μ 1,3 Figure 1: Difference between customer-average performance and time-average performance. The above numerical experiment is about the statedependent service rates. The situation for load-dependent service rates is similar and here is not presented for the paper concision. Interested readers can refer the numerical experiment by Xia and Cao (26a), which can also demonstrate the Max-Min optimality of load-dependent service rates. 5 CONCLUSION In this paper we discuss the service rates optimization problem in closed Jackson networks. With the difference equation of customer-average performance, we prove that the optimal service rates have a so-called Max-Min optimality. This optimality is valid for both state-dependent and load-dependent closed Jackson networks. With the Max-Min optimality, we only need to choose the maximal or minimal values for service rates in optimization procedure. It simplifies greatly the complexity of such type of optimization problems. ACKNOWLEDGMENTS The first author would like to thank Prof. Xi-Ren Cao for his instruction and help when the author did this research work in his Ph.D. pursuing period. Of course, the possible errors in this paper are solely the responsibility of the paper authors. REFERENCES Cao, X. R Realization probabilities - the dynamics of queueing systems. New York: Springer Verlag. Cao, X. R. 23. From perturbation analysis to markov decision processes and reinforcement learning. Discrete Event Dynamic Systems: Theory and Applications 13:9 39. Cao, X. R., and H. F. Chen Potentials, perturbation realization, and sensitivity analysis of markov processes. IEEE Transactions on Automatic Control 42: Cassandras, C., and S. Lafortune Introduction to discrete event systems. Boston, MA: Kluwer Academic Publishers. Chen, H., and D. Yao. 21. Fundamentals of queueing networks: Performance, asymptotics, and optimization. New York: Springer Verlag. Chong, E. K. P., and S. H. Zak. 21. An introduction to optimization, 2 nd edition. New York: John Wiley & Sons. Glasserman, P Gradient estimation via perturbation analysis. Norwell, MA: Kluwer Academic Publisher. Gong, W. B., and Y. C. Ho Smoothed (conditional) perturbation analysis of discrete event dynamical systems. IEEE Transactions on Automatic Control 32: Gordon, W. J., and G. F. Newell Closed queueing systems with exponential servers. Operations Research 15: Ho, Y. C., and X. R. Cao Perturbation analysis of discrete-event dynamic systems. Boston, MA: Kluwer Academic Publisher. Ho, Y. C., X. R. Cao, and C. Cassandras Infinitesimal and finite perturbation analysis for queueing networks. Automatica 19: Ma, D. J., and X. R. Cao A direct approach to decentralized control of service rates in a closed jackson network. IEEE Transactions on Automatic Control 39: Puterman, M. L Markov decision processes: Discrete stochastic dynamic programming. New York: John Wiley & Sons. 514
7 Xia, L., and X. R. Cao. 26a. Aggregation of perturbation realization factors and service rate-based policy iteration for queueing systems. In Proceedings of the 45th IEEE Conference on Decision and Control, San Diego, CA, USA, Xia, L., and X. R. Cao. 26b. Relationship between perturbation realization factors with queueing models and markov models. IEEE Transactions on Automatic Control 51: Xia, L., X. Chen, and X. R. Cao. 28. Policy iteration of customer-average performance in queueing systems. Submitted to Automatica. Yao, D. D., and Z. Schechner Decentralized control of service rates in a closed jackson network. IEEE Transactions on Automatic Control 34: AUTHOR BIOGRAPHIES LI XIA received the B.E. degree in automation in July 22 and the Ph.D. degree in control science and engineering in July 27, both from Tsinghua University, Beijing, China. He is currently a research staff at IBM China Research Laboratory, Beijing, China. His research interests include discrete event dynamic systems (DEDS) theory and applications, simulation optimization techniques, and supply chain management. His address is <crlxiali@cn.ibm.com>. MING XIE received his Ph.D. degree in Tsinghua University from China in 26 and then joined IBM China Research Laboratory. Currently, his research interests include supply chain management, agent-based simulation, complex systems and business intelligence. His address is <xieming@cn.ibm.com>. WENJUN YIN received his Ph.D. degree in Tsinghua University from China in 24 and then joined IBM China Research Laboratory. Currently, his research interests include supply chain management and logistics, business analytics and optimization, data mining and business intelligence. His address is <yinwenj@cn.ibm.com>. JIN DONG, Manager of Supply Chain Management and Logistics Research in IBM China Research Laboratory. He received his Ph.D. degree in Tsinghua University from China in 21. Before joined IBM, he was the Research Assistant Professor in Industrial Engineering Department of Arizona State University in USA. His address is <dongjin@cn.ibm.com>. Xia et al. 515
M/M/1 and M/M/m Queueing Systems
M/M/ and M/M/m Queueing Systems M. Veeraraghavan; March 20, 2004. Preliminaries. Kendall s notation: G/G/n/k queue G: General - can be any distribution. First letter: Arrival process; M: memoryless - exponential
More informationHai Rong Lv Xin Xin Bai Wen Jun Yin Jin Dong. IBM China Research Lab Zuanshi Build, Zhongguancun Software park, Beijing 100084, CHINA,
Proceedings of the 2008 Winter Simulation Conference S. J. Mason, R. R. Hill, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. SIMULATION BASED SALES FORECASTING ON RETAIL SMALL STORES Hai Rong Lv Xin
More informationThe Analysis of Dynamical Queueing Systems (Background)
The Analysis of Dynamical Queueing Systems (Background) Technological innovations are creating new types of communication systems. During the 20 th century, we saw the evolution of electronic communication
More informationLECTURE 4. Last time: Lecture outline
LECTURE 4 Last time: Types of convergence Weak Law of Large Numbers Strong Law of Large Numbers Asymptotic Equipartition Property Lecture outline Stochastic processes Markov chains Entropy rate Random
More informationSupply planning for two-level assembly systems with stochastic component delivery times: trade-off between holding cost and service level
Supply planning for two-level assembly systems with stochastic component delivery times: trade-off between holding cost and service level Faicel Hnaien, Xavier Delorme 2, and Alexandre Dolgui 2 LIMOS,
More informationMATRIX ALGEBRA AND SYSTEMS OF EQUATIONS
MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS Systems of Equations and Matrices Representation of a linear system The general system of m equations in n unknowns can be written a x + a 2 x 2 + + a n x n b a
More informationAnalysis of an Artificial Hormone System (Extended abstract)
c 2013. This is the author s version of the work. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purpose or for creating
More informationOn the mathematical theory of splitting and Russian roulette
On the mathematical theory of splitting and Russian roulette techniques St.Petersburg State University, Russia 1. Introduction Splitting is an universal and potentially very powerful technique for increasing
More informationLoad Balancing and Switch Scheduling
EE384Y Project Final Report Load Balancing and Switch Scheduling Xiangheng Liu Department of Electrical Engineering Stanford University, Stanford CA 94305 Email: liuxh@systems.stanford.edu Abstract Load
More informationChapter 1. Introduction
Chapter 1 Introduction 1.1. Motivation Network performance analysis, and the underlying queueing theory, was born at the beginning of the 20th Century when two Scandinavian engineers, Erlang 1 and Engset
More informationModeling and Performance Evaluation of Computer Systems Security Operation 1
Modeling and Performance Evaluation of Computer Systems Security Operation 1 D. Guster 2 St.Cloud State University 3 N.K. Krivulin 4 St.Petersburg State University 5 Abstract A model of computer system
More informationPractical Guide to the Simplex Method of Linear Programming
Practical Guide to the Simplex Method of Linear Programming Marcel Oliver Revised: April, 0 The basic steps of the simplex algorithm Step : Write the linear programming problem in standard form Linear
More informationNOTES ON LINEAR TRANSFORMATIONS
NOTES ON LINEAR TRANSFORMATIONS Definition 1. Let V and W be vector spaces. A function T : V W is a linear transformation from V to W if the following two properties hold. i T v + v = T v + T v for all
More informationSystems of Linear Equations
Systems of Linear Equations Beifang Chen Systems of linear equations Linear systems A linear equation in variables x, x,, x n is an equation of the form a x + a x + + a n x n = b, where a, a,, a n and
More informationWhat is Linear Programming?
Chapter 1 What is Linear Programming? An optimization problem usually has three essential ingredients: a variable vector x consisting of a set of unknowns to be determined, an objective function of x to
More informationHydrodynamic Limits of Randomized Load Balancing Networks
Hydrodynamic Limits of Randomized Load Balancing Networks Kavita Ramanan and Mohammadreza Aghajani Brown University Stochastic Networks and Stochastic Geometry a conference in honour of François Baccelli
More informationTD(0) Leads to Better Policies than Approximate Value Iteration
TD(0) Leads to Better Policies than Approximate Value Iteration Benjamin Van Roy Management Science and Engineering and Electrical Engineering Stanford University Stanford, CA 94305 bvr@stanford.edu Abstract
More informationCharacterization and Modeling of Packet Loss of a VoIP Communication
Characterization and Modeling of Packet Loss of a VoIP Communication L. Estrada, D. Torres, H. Toral Abstract In this work, a characterization and modeling of packet loss of a Voice over Internet Protocol
More informationDT-Bottlenecks in Serial Production Lines: Theory and Application
IEEE TRANSACTIONS ON ROBOTICS AND AUTOMATION, VOL. 16, NO. 5, OCTOBER 2000 567 DT-Bottlenecks in Serial Production Lines: Theory and Application Shu-Yin Chiang, Member, IEEE, Chih-Tsung Kuo, Member, IEEE,
More informationA Decomposition Approach for a Capacitated, Single Stage, Production-Inventory System
A Decomposition Approach for a Capacitated, Single Stage, Production-Inventory System Ganesh Janakiraman 1 IOMS-OM Group Stern School of Business New York University 44 W. 4th Street, Room 8-160 New York,
More informationInductive QoS Packet Scheduling for Adaptive Dynamic Networks
Inductive QoS Packet Scheduling for Adaptive Dynamic Networks Malika BOURENANE Dept of Computer Science University of Es-Senia Algeria mb_regina@yahoo.fr Abdelhamid MELLOUK LISSI Laboratory University
More informationBRAESS-LIKE PARADOXES FOR NON-COOPERATIVE DYNAMIC LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS
GESJ: Computer Science and Telecommunications 21 No.3(26) BRAESS-LIKE PARADOXES FOR NON-COOPERATIVE DYNAMIC LOAD BALANCING IN DISTRIBUTED COMPUTER SYSTEMS Said Fathy El-Zoghdy Department of Computer Science,
More information9.2 Summation Notation
9. Summation Notation 66 9. Summation Notation In the previous section, we introduced sequences and now we shall present notation and theorems concerning the sum of terms of a sequence. We begin with a
More informationNote on growth and growth accounting
CHAPTER 0 Note on growth and growth accounting 1. Growth and the growth rate In this section aspects of the mathematical concept of the rate of growth used in growth models and in the empirical analysis
More informationModern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh
Modern Optimization Methods for Big Data Problems MATH11146 The University of Edinburgh Peter Richtárik Week 3 Randomized Coordinate Descent With Arbitrary Sampling January 27, 2016 1 / 30 The Problem
More informationInventory Control Policy of Preventive Lateral Transshipment between Retailers in Multi Periods
Journal of Industrial Engineering and Management JIEM, 2014 7(3): 681-697 Online ISSN: 2013-0953 Print ISSN: 2013-8423 http://dx.doi.org/10.3926/jiem.1068 Inventory Control Policy of Preventive Lateral
More informationHOMEWORK 5 SOLUTIONS. n!f n (1) lim. ln x n! + xn x. 1 = G n 1 (x). (2) k + 1 n. (n 1)!
Math 7 Fall 205 HOMEWORK 5 SOLUTIONS Problem. 2008 B2 Let F 0 x = ln x. For n 0 and x > 0, let F n+ x = 0 F ntdt. Evaluate n!f n lim n ln n. By directly computing F n x for small n s, we obtain the following
More informationU.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009. Notes on Algebra
U.C. Berkeley CS276: Cryptography Handout 0.1 Luca Trevisan January, 2009 Notes on Algebra These notes contain as little theory as possible, and most results are stated without proof. Any introductory
More informationComputing Near Optimal Strategies for Stochastic Investment Planning Problems
Computing Near Optimal Strategies for Stochastic Investment Planning Problems Milos Hauskrecfat 1, Gopal Pandurangan 1,2 and Eli Upfal 1,2 Computer Science Department, Box 1910 Brown University Providence,
More informationStructure Preserving Model Reduction for Logistic Networks
Structure Preserving Model Reduction for Logistic Networks Fabian Wirth Institute of Mathematics University of Würzburg Workshop on Stochastic Models of Manufacturing Systems Einhoven, June 24 25, 2010.
More informationContinued Fractions. Darren C. Collins
Continued Fractions Darren C Collins Abstract In this paper, we discuss continued fractions First, we discuss the definition and notation Second, we discuss the development of the subject throughout history
More informationECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE
ECON20310 LECTURE SYNOPSIS REAL BUSINESS CYCLE YUAN TIAN This synopsis is designed merely for keep a record of the materials covered in lectures. Please refer to your own lecture notes for all proofs.
More informationA Markovian model of the RED mechanism solved with a cluster of computers
Annales UMCS Informatica AI 5 (2006) 19-27 Annales UMCS Informatica Lublin-Polonia Sectio AI http://www.annales.umcs.lublin.pl/ A Markovian model of the RED mechanism solved with a cluster of computers
More informationWRITING PROOFS. Christopher Heil Georgia Institute of Technology
WRITING PROOFS Christopher Heil Georgia Institute of Technology A theorem is just a statement of fact A proof of the theorem is a logical explanation of why the theorem is true Many theorems have this
More informationA Load Balancing Algorithm based on the Variation Trend of Entropy in Homogeneous Cluster
, pp.11-20 http://dx.doi.org/10.14257/ ijgdc.2014.7.2.02 A Load Balancing Algorithm based on the Variation Trend of Entropy in Homogeneous Cluster Kehe Wu 1, Long Chen 2, Shichao Ye 2 and Yi Li 2 1 Beijing
More information1 if 1 x 0 1 if 0 x 1
Chapter 3 Continuity In this chapter we begin by defining the fundamental notion of continuity for real valued functions of a single real variable. When trying to decide whether a given function is or
More informationOptimization models for congestion control with multipath routing in TCP/IP networks
Optimization models for congestion control with multipath routing in TCP/IP networks Roberto Cominetti Cristóbal Guzmán Departamento de Ingeniería Industrial Universidad de Chile Workshop on Optimization,
More information160 CHAPTER 4. VECTOR SPACES
160 CHAPTER 4. VECTOR SPACES 4. Rank and Nullity In this section, we look at relationships between the row space, column space, null space of a matrix and its transpose. We will derive fundamental results
More informationOptimal Dynamic Resource Allocation in Multi-Class Queueing Networks
Imperial College London Department of Computing Optimal Dynamic Resource Allocation in Multi-Class Queueing Networks MEng Individual Project Report Diagoras Nicolaides Supervisor: Dr William Knottenbelt
More informationSoftware Performance and Scalability
Software Performance and Scalability A Quantitative Approach Henry H. Liu ^ IEEE )computer society WILEY A JOHN WILEY & SONS, INC., PUBLICATION Contents PREFACE ACKNOWLEDGMENTS xv xxi Introduction 1 Performance
More informationMathematical finance and linear programming (optimization)
Mathematical finance and linear programming (optimization) Geir Dahl September 15, 2009 1 Introduction The purpose of this short note is to explain how linear programming (LP) (=linear optimization) may
More informationMetric Spaces. Chapter 7. 7.1. Metrics
Chapter 7 Metric Spaces A metric space is a set X that has a notion of the distance d(x, y) between every pair of points x, y X. The purpose of this chapter is to introduce metric spaces and give some
More informationQNAT. A Graphical Queuing Network Analysis Tool for General Open and Closed Queuing Networks. Sanjay K. Bose
QNAT A Graphical Queuing Network Analysis Tool for General Open and Closed Queuing Networks Sanjay K. Bose QNAT developed at - Dept. Elect. Engg., I.I.T., Kanpur, INDIA by - Sanjay K. Bose skb@ieee.org
More informationReinforcement Learning
Reinforcement Learning LU 2 - Markov Decision Problems and Dynamic Programming Dr. Martin Lauer AG Maschinelles Lernen und Natürlichsprachliche Systeme Albert-Ludwigs-Universität Freiburg martin.lauer@kit.edu
More informationI. GROUPS: BASIC DEFINITIONS AND EXAMPLES
I GROUPS: BASIC DEFINITIONS AND EXAMPLES Definition 1: An operation on a set G is a function : G G G Definition 2: A group is a set G which is equipped with an operation and a special element e G, called
More informationSOLVING LINEAR SYSTEMS
SOLVING LINEAR SYSTEMS Linear systems Ax = b occur widely in applied mathematics They occur as direct formulations of real world problems; but more often, they occur as a part of the numerical analysis
More informationSection 4.2: The Division Algorithm and Greatest Common Divisors
Section 4.2: The Division Algorithm and Greatest Common Divisors The Division Algorithm The Division Algorithm is merely long division restated as an equation. For example, the division 29 r. 20 32 948
More informationA Game Theoretical Framework for Adversarial Learning
A Game Theoretical Framework for Adversarial Learning Murat Kantarcioglu University of Texas at Dallas Richardson, TX 75083, USA muratk@utdallas Chris Clifton Purdue University West Lafayette, IN 47907,
More informationOptimal Gateway Selection in Multi-domain Wireless Networks: A Potential Game Perspective
Optimal Gateway Selection in Multi-domain Wireless Networks: A Potential Game Perspective Yang Song, Starsky H.Y. Wong, and Kang-Won Lee Wireless Networking Research Group IBM T. J. Watson Research Center
More informationSupplement to Call Centers with Delay Information: Models and Insights
Supplement to Call Centers with Delay Information: Models and Insights Oualid Jouini 1 Zeynep Akşin 2 Yves Dallery 1 1 Laboratoire Genie Industriel, Ecole Centrale Paris, Grande Voie des Vignes, 92290
More information4.5 Linear Dependence and Linear Independence
4.5 Linear Dependence and Linear Independence 267 32. {v 1, v 2 }, where v 1, v 2 are collinear vectors in R 3. 33. Prove that if S and S are subsets of a vector space V such that S is a subset of S, then
More informationMarkov random fields and Gibbs measures
Chapter Markov random fields and Gibbs measures 1. Conditional independence Suppose X i is a random element of (X i, B i ), for i = 1, 2, 3, with all X i defined on the same probability space (.F, P).
More informationa 11 x 1 + a 12 x 2 + + a 1n x n = b 1 a 21 x 1 + a 22 x 2 + + a 2n x n = b 2.
Chapter 1 LINEAR EQUATIONS 1.1 Introduction to linear equations A linear equation in n unknowns x 1, x,, x n is an equation of the form a 1 x 1 + a x + + a n x n = b, where a 1, a,..., a n, b are given
More informationChange Management in Enterprise IT Systems: Process Modeling and Capacity-optimal Scheduling
Change Management in Enterprise IT Systems: Process Modeling and Capacity-optimal Scheduling Praveen K. Muthusamy, Koushik Kar, Sambit Sahu, Prashant Pradhan and Saswati Sarkar Rensselaer Polytechnic Institute
More informationFluid Approximation of Smart Grid Systems: Optimal Control of Energy Storage Units
Fluid Approximation of Smart Grid Systems: Optimal Control of Energy Storage Units by Rasha Ibrahim Sakr, B.Sc. A thesis submitted to the Faculty of Graduate and Postdoctoral Affairs in partial fulfillment
More informationAdaptive Search with Stochastic Acceptance Probabilities for Global Optimization
Adaptive Search with Stochastic Acceptance Probabilities for Global Optimization Archis Ghate a and Robert L. Smith b a Industrial Engineering, University of Washington, Box 352650, Seattle, Washington,
More informationRow Echelon Form and Reduced Row Echelon Form
These notes closely follow the presentation of the material given in David C Lay s textbook Linear Algebra and its Applications (3rd edition) These notes are intended primarily for in-class presentation
More informationA Simultaneous Deterministic Perturbation Actor-Critic Algorithm with an Application to Optimal Mortgage Refinancing
Proceedings of the 45th IEEE Conference on Decision & Control Manchester Grand Hyatt Hotel San Diego, CA, USA, December 13-15, 2006 A Simultaneous Deterministic Perturbation Actor-Critic Algorithm with
More informationLS.6 Solution Matrices
LS.6 Solution Matrices In the literature, solutions to linear systems often are expressed using square matrices rather than vectors. You need to get used to the terminology. As before, we state the definitions
More informationExponential Approximation of Multi-Skill Call Centers Architecture
Exponential Approximation of Multi-Skill Call Centers Architecture Ger Koole and Jérôme Talim Vrije Universiteit - Division of Mathematics and Computer Science De Boelelaan 1081 a - 1081 HV Amsterdam -
More informationAnalysis of a Production/Inventory System with Multiple Retailers
Analysis of a Production/Inventory System with Multiple Retailers Ann M. Noblesse 1, Robert N. Boute 1,2, Marc R. Lambrecht 1, Benny Van Houdt 3 1 Research Center for Operations Management, University
More informationLinear Programming Notes V Problem Transformations
Linear Programming Notes V Problem Transformations 1 Introduction Any linear programming problem can be rewritten in either of two standard forms. In the first form, the objective is to maximize, the material
More informationContinued Fractions and the Euclidean Algorithm
Continued Fractions and the Euclidean Algorithm Lecture notes prepared for MATH 326, Spring 997 Department of Mathematics and Statistics University at Albany William F Hammond Table of Contents Introduction
More informationMASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES
MASSACHUSETTS INSTITUTE OF TECHNOLOGY 6.436J/15.085J Fall 2008 Lecture 5 9/17/2008 RANDOM VARIABLES Contents 1. Random variables and measurable functions 2. Cumulative distribution functions 3. Discrete
More information10.2 Series and Convergence
10.2 Series and Convergence Write sums using sigma notation Find the partial sums of series and determine convergence or divergence of infinite series Find the N th partial sums of geometric series and
More informationQuality Optimal Policy for H.264 Scalable Video Scheduling in Broadband Multimedia Wireless Networks
Quality Optimal Policy for H.264 Scalable Video Scheduling in Broadband Multimedia Wireless Networks Vamseedhar R. Reddyvari Electrical Engineering Indian Institute of Technology Kanpur Email: vamsee@iitk.ac.in
More informationPERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE AD HOC NETWORKS
PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE AD HOC NETWORKS Reza Azizi Engineering Department, Bojnourd Branch, Islamic Azad University, Bojnourd, Iran reza.azizi@bojnourdiau.ac.ir
More information(Quasi-)Newton methods
(Quasi-)Newton methods 1 Introduction 1.1 Newton method Newton method is a method to find the zeros of a differentiable non-linear function g, x such that g(x) = 0, where g : R n R n. Given a starting
More informationQUEUING THEORY. 1. Introduction
QUEUING THEORY RYAN BERRY Abstract. This paper defines the building blocks of and derives basic queuing systems. It begins with a review of some probability theory and then defines processes used to analyze
More informationFault Analysis in Software with the Data Interaction of Classes
, pp.189-196 http://dx.doi.org/10.14257/ijsia.2015.9.9.17 Fault Analysis in Software with the Data Interaction of Classes Yan Xiaobo 1 and Wang Yichen 2 1 Science & Technology on Reliability & Environmental
More informationTRAFFIC ENGINEERING OF DISTRIBUTED CALL CENTERS: NOT AS STRAIGHT FORWARD AS IT MAY SEEM. M. J. Fischer D. A. Garbin A. Gharakhanian D. M.
TRAFFIC ENGINEERING OF DISTRIBUTED CALL CENTERS: NOT AS STRAIGHT FORWARD AS IT MAY SEEM M. J. Fischer D. A. Garbin A. Gharakhanian D. M. Masi January 1999 Mitretek Systems 7525 Colshire Drive McLean, VA
More information5.1 Bipartite Matching
CS787: Advanced Algorithms Lecture 5: Applications of Network Flow In the last lecture, we looked at the problem of finding the maximum flow in a graph, and how it can be efficiently solved using the Ford-Fulkerson
More informationManipulability of the Price Mechanism for Data Centers
Manipulability of the Price Mechanism for Data Centers Greg Bodwin 1, Eric Friedman 2,3,4, and Scott Shenker 3,4 1 Department of Computer Science, Tufts University, Medford, Massachusetts 02155 2 School
More informationResearch Article Two-Period Inventory Control with Manufacturing and Remanufacturing under Return Compensation Policy
Discrete Dynamics in Nature and Society Volume 2013, Article ID 871286, 8 pages http://dx.doi.org/10.1155/2013/871286 Research Article Two-Period Inventory Control with Manufacturing and Remanufacturing
More informationPART III. OPS-based wide area networks
PART III OPS-based wide area networks Chapter 7 Introduction to the OPS-based wide area network 7.1 State-of-the-art In this thesis, we consider the general switch architecture with full connectivity
More informationSTABILITY OF LU-KUMAR NETWORKS UNDER LONGEST-QUEUE AND LONGEST-DOMINATING-QUEUE SCHEDULING
Applied Probability Trust (28 December 2012) STABILITY OF LU-KUMAR NETWORKS UNDER LONGEST-QUEUE AND LONGEST-DOMINATING-QUEUE SCHEDULING RAMTIN PEDARSANI and JEAN WALRAND, University of California, Berkeley
More informationAdaptive Online Gradient Descent
Adaptive Online Gradient Descent Peter L Bartlett Division of Computer Science Department of Statistics UC Berkeley Berkeley, CA 94709 bartlett@csberkeleyedu Elad Hazan IBM Almaden Research Center 650
More information5 Numerical Differentiation
D. Levy 5 Numerical Differentiation 5. Basic Concepts This chapter deals with numerical approximations of derivatives. The first questions that comes up to mind is: why do we need to approximate derivatives
More informationNonparametric adaptive age replacement with a one-cycle criterion
Nonparametric adaptive age replacement with a one-cycle criterion P. Coolen-Schrijner, F.P.A. Coolen Department of Mathematical Sciences University of Durham, Durham, DH1 3LE, UK e-mail: Pauline.Schrijner@durham.ac.uk
More informationReinforcement Learning
Reinforcement Learning LU 2 - Markov Decision Problems and Dynamic Programming Dr. Joschka Bödecker AG Maschinelles Lernen und Natürlichsprachliche Systeme Albert-Ludwigs-Universität Freiburg jboedeck@informatik.uni-freiburg.de
More informationMath 120 Final Exam Practice Problems, Form: A
Math 120 Final Exam Practice Problems, Form: A Name: While every attempt was made to be complete in the types of problems given below, we make no guarantees about the completeness of the problems. Specifically,
More informationIntroduction to Online Learning Theory
Introduction to Online Learning Theory Wojciech Kot lowski Institute of Computing Science, Poznań University of Technology IDSS, 04.06.2013 1 / 53 Outline 1 Example: Online (Stochastic) Gradient Descent
More informationThe Steepest Descent Algorithm for Unconstrained Optimization and a Bisection Line-search Method
The Steepest Descent Algorithm for Unconstrained Optimization and a Bisection Line-search Method Robert M. Freund February, 004 004 Massachusetts Institute of Technology. 1 1 The Algorithm The problem
More informationCoordinated Pricing and Inventory in A System with Minimum and Maximum Production Constraints
The 7th International Symposium on Operations Research and Its Applications (ISORA 08) Lijiang, China, October 31 Novemver 3, 2008 Copyright 2008 ORSC & APORC, pp. 160 165 Coordinated Pricing and Inventory
More informationPerron vector Optimization applied to search engines
Perron vector Optimization applied to search engines Olivier Fercoq INRIA Saclay and CMAP Ecole Polytechnique May 18, 2011 Web page ranking The core of search engines Semantic rankings (keywords) Hyperlink
More informationA QUEUEING-INVENTORY SYSTEM WITH DEFECTIVE ITEMS AND POISSON DEMAND. bhaji@usc.edu
A QUEUEING-INVENTORY SYSTEM WITH DEFECTIVE ITEMS AND POISSON DEMAND Rasoul Hai 1, Babak Hai 1 Industrial Engineering Department, Sharif University of Technology, +98-1-66165708, hai@sharif.edu Industrial
More informationThe Demand for Life Insurance: An Application of the Economics of Uncertainty: A Comment
THE JOlJKNAL OF FINANCE VOL. XXXVII, NO 5 UECEMREK 1982 The Demand for Life Insurance: An Application of the Economics of Uncertainty: A Comment NICHOLAS ECONOMIDES* IN HIS THEORETICAL STUDY on the demand
More informationLecture 7: Finding Lyapunov Functions 1
Massachusetts Institute of Technology Department of Electrical Engineering and Computer Science 6.243j (Fall 2003): DYNAMICS OF NONLINEAR SYSTEMS by A. Megretski Lecture 7: Finding Lyapunov Functions 1
More informationUsing Markov Decision Processes to Solve a Portfolio Allocation Problem
Using Markov Decision Processes to Solve a Portfolio Allocation Problem Daniel Bookstaber April 26, 2005 Contents 1 Introduction 3 2 Defining the Model 4 2.1 The Stochastic Model for a Single Asset.........................
More informationDynamic Assignment of Dedicated and Flexible Servers in Tandem Lines
Dynamic Assignment of Dedicated and Flexible Servers in Tandem Lines Sigrún Andradóttir and Hayriye Ayhan School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, GA 30332-0205,
More informationMathematical Induction
Mathematical Induction (Handout March 8, 01) The Principle of Mathematical Induction provides a means to prove infinitely many statements all at once The principle is logical rather than strictly mathematical,
More informationDDSS: Dynamic Dedicated Servers Scheduling for Multi Priority Level Classes in Cloud Computing
DDSS: Dynamic Dedicated Servers Scheduling for Multi Priority Level Classes in Cloud Computing Husnu S. Narman husnu@ou.edu Md. Shohrab Hossain mshohrabhossain@cse.buet.ac.bd Mohammed Atiquzzaman atiq@ou.edu
More information1 Error in Euler s Method
1 Error in Euler s Method Experience with Euler s 1 method raises some interesting questions about numerical approximations for the solutions of differential equations. 1. What determines the amount of
More information1 Teaching notes on GMM 1.
Bent E. Sørensen January 23, 2007 1 Teaching notes on GMM 1. Generalized Method of Moment (GMM) estimation is one of two developments in econometrics in the 80ies that revolutionized empirical work in
More informationIncreasing for all. Convex for all. ( ) Increasing for all (remember that the log function is only defined for ). ( ) Concave for all.
1. Differentiation The first derivative of a function measures by how much changes in reaction to an infinitesimal shift in its argument. The largest the derivative (in absolute value), the faster is evolving.
More information1.2 Solving a System of Linear Equations
1.. SOLVING A SYSTEM OF LINEAR EQUATIONS 1. Solving a System of Linear Equations 1..1 Simple Systems - Basic De nitions As noticed above, the general form of a linear system of m equations in n variables
More informationRandom access protocols for channel access. Markov chains and their stability. Laurent Massoulié.
Random access protocols for channel access Markov chains and their stability laurent.massoulie@inria.fr Aloha: the first random access protocol for channel access [Abramson, Hawaii 70] Goal: allow machines
More informationCOMPUTING DURATION, SLACK TIME, AND CRITICALITY UNCERTAINTIES IN PATH-INDEPENDENT PROJECT NETWORKS
Proceedings from the 2004 ASEM National Conference pp. 453-460, Alexandria, VA (October 20-23, 2004 COMPUTING DURATION, SLACK TIME, AND CRITICALITY UNCERTAINTIES IN PATH-INDEPENDENT PROJECT NETWORKS Ryan
More informationSolutions to Math 51 First Exam January 29, 2015
Solutions to Math 5 First Exam January 29, 25. ( points) (a) Complete the following sentence: A set of vectors {v,..., v k } is defined to be linearly dependent if (2 points) there exist c,... c k R, not
More informationATM Network Performance Evaluation And Optimization Using Complex Network Theory
ATM Network Performance Evaluation And Optimization Using Complex Network Theory Yalin LI 1, Bruno F. Santos 2 and Richard Curran 3 Air Transport and Operations Faculty of Aerospace Engineering The Technical
More information