Pricing Internet Services With Multiple Providers

Size: px
Start display at page:

Download "Pricing Internet Services With Multiple Providers"

From this document you will learn the answers to the following questions:

  • In which section do we first study the case in which providers adopt non - cooperative pricing strategies?
  • What type of revenue do providers have to coect?
  • What does r go through?

Transcription

1 Pricing Internet Services With Mutipe Providers Linhai He and Jean Warand Dept. of Eectrica Engineering and Computer Science University of Caifornia at Berkeey Berkeey, CA inhai, Abstract One of the chaenges facing the networking industry today is to increase the profitabiity of service providers. This cas for economic mechanisms that can enabe providers to charge more for better services and coect a fair share of the resuting increased revenue. In this paper we present a generic mode for pricing Internet services in a muti-provider network. We show that non-cooperative pricing is unfair and may discourage future upgrades of the network. As an aternative, we propose a simpe revenue-sharing poicy and show that it is more efficient and encourages providers to coaborate without cheating. We aso suggest a scaabe agorithm for providers to impement this poicy in a distributed way and study its convergence properties. Introduction For historica reasons, the current architecture of the Internet acks the support for impementing efficient market mechanisms. Consequenty, service providers have imited economic incentives to invest in technoogy for new services. This situation imits the future evoution of the Internet. To correct this state of affairs, it is essentia to impement economic mechanisms that woud enabe service providers to charge more for better services and coect a fair share of the resuting increased revenue. In this paper we investigate how to design pricing schemes that coud meet these criteria. The idea of using economic mechanisms in network design is not new. For exampe, [] [2] [3] propose pricing mechanisms that can be used for congestion contro in the Internet. However, in these schemes the network acts as a socia-wefare maximizer with no sef-interest. This assumption does not refect the situation in today s Internet, as most network service providers are in the business for making profit and are primariy interested in maximizing their own benefits [4]. Our pricing schemes try to incude these facts into the modes. We beieve that a good pricing scheme shoud provide the right incentives for providers to foow the protoco and not to cheat. In addition, it shoud be fair for a providers invoved and encourage upgrades to the network. In other words, a provider shoud be abe to coect more revenue by increasing the capacity of its network. Finay, a pricing scheme shoud be scaabe, i.e., feasibe for arge-scae depoyment. This research is supported in part by DARPA Grant No. BAA00-8.

2 Our paper is organized as foows. In Section 2, we describe the basic modes for the providers and the services that they offer. In the foowing two sections, we first study the case in which providers adopt non-cooperative pricing strategies. Through simpe exampes, we show that such strategies woud resut in undesirabe equiibria. We then suggest a revenue sharing poicy as an aternative and show that it woud ead to a better equiibrium. In addition, it coud be reached through a distributed agorithm. We concude the paper with discussions on future work. 2 Basic Mode We consider a group of providers offering services with a certain eve of QoS guarantee. For simpicity, we assume that those QoS requirements coud be transated into oca capacity constraints. For instance, the maximum utiization on a ink may be imited to be ess than, say, 25% to ensure a packets experience ony sma deay going through that ink. We assume that there exists a set of routes across the network. On any of these routes each provider charges a price for its share of the service. The providers may adjust their prices dynamicay and signa them to end users to contro the demand for the services. There are many possibe approaches for impementing such a pricing scheme, for appications with either fixed or eastic bandwidth requirements. However, for the purpose of modeing, we do not specify detais of impementation in this paper. We simpy mode that when a price p is posted for a route r, the resuting traffic oad on that route is given by a function d r (p), which is stricty decreasing and differentiabe. Moreover, mechanisms exist for providers to coect revenues based on the amount of traffic that they have forwarded and the prices that they set. We assume that when a provider sets its price, its objective is to maximize its own revenues, whie maintaining the QoS for the service that it offers by respecting its oca capacity constraint. Therefore, in the case of ony one provider offering the service, the optima price can be determined by soving the foowing constrained optimization program max p 0 J = p d(p) () s.t. d(p) C where C is the capacity constraint. The first-order condition for the soution is p = µ d(p )/d (p ) where µ 0 is some constant that satisfies µ(d(p ) C) = 0. It is easy to show that a unique soution exists if d(p)/d (p) is an increasing function of p. In that case, the soution is aso a maximizer. So in the rest of the paper, we consider ony demand functions that satisfy this property. For ater use, we define g(p) d(p)/d (p). Notice that g(p) indicates the easticity of the demand function. To simpify anaysis, we assume that a providers have sufficient capacity on their interna inks. Capacity may be imited ony on the inks between providers. Loca QoS requirements by each provider are fixed and not affected by prices. A routes between sources and destinations are aso fixed. We choose this assumption because in today s Internet routing between providers is often performed based on a set of provisioned poicies instead of short-term costs or performance measures.

3 3 Non-Cooperative Pricing Strategies In this section we try to understand how providers woud set their prices when they have to work together to offer a service. We assume that each provider acts in its own interest. In addition, each provider keeps its own capacity constraint as private information, but it may be possibe for each provider to observe prices marked by others (depending on the impementation). A these assumptions suggest a game-theoretic formuation of the probem in which each provider is a strategic payer. Under different assumptions on what strategic information is avaiabe to the providers, different types of formuation, such as Nash, Stackeberg, etc., are possibe. However, we argue that ony a Nash game modes cosey how providers woud interact in rea situations. In a arge-scae network with compex topoogy such as the Internet, not much information about the game is avaiabe. Providers generay do not know much about the goba state of the network. A provider s best strategy probaby is to optimize ocay based on its observations on how its payoff changes as it changes its prices. This mode fits naturay the best-response mode of a Nash game. Therefore, we mode the game between providers as foows: max pr 0 J i = ( ) E i r R p r d r k L p r\ kr + p r ( ) s.t. r R d r k L p (2) r\ kr + p r C, E i, where E i is the set of egress inks owned by provider i, L r is the set of inks that route r goes through, R is the set of routes going through ink, p r is the price charged for route r on ink, and C is the capacity constraint on ink. It is known that the equiibria in Nash games are often inefficient and may have undesirabe properties, due to the non-cooperative nature of the games. The game described in (2) is not an exception. In the foowing we use a simpe exampe to show that noncooperative pricing coud ead to unfair distribution of revenues among providers, and that a botteneck provider may not have an incentive to update its capacity. Consider two providers connected in series with ony one route going through them. The demand on that route is d(p + p 2 ), where p i is the price charged by provider i for i =, 2. Without oss of generaity, we assume C > C 2, so that provider 2 is aways the botteneck. The resuting Nash game payed by the two providers is as foows: Provider : max p 0 p d(p + p 2 ) Provider 2: max p2 0 p 2 d(p + p 2 ) s.t. d(p + p 2 ) C 2 (3) It is easy to show that this game has a unique Nash equiibrium. We are interested in the case in which the capacity constraint of provider 2 is active at equiibrium. We first show that in that case provider 2 aways charges a higher price than provider, thus obtaining more revenues. The capacity constraint C 2 is active if C 2 X, where X is the traffic oad at Nash equiibrium when there is no capacity constraint for either provider. By appying a symmetry argument to (3) with the capacity constraint removed, X can be found from the foowing equations: { X = d(2p ) p = g(2p ), or equivaenty, { p = d (X )/2 K /2 p = g(2p ) = g(k ).

4 Here K is defined as the tota price charged to the users at equiibrium. The above equations impies that K = 2g(K ). When C 2 < X, define K d (C 2 ). From the optimaity condition for provider, p = g(p + p 2 ), we get p = g(k). Since the constraint is active, d(p + p 2 ) = C 2, or p + p 2 = K. So p 2 = K p = K g(k). Since d( ) is a decreasing function, K is a decreasing function of C 2. Therefore, when C 2 < X, K > K. Moreover, since g( ) is a decreasing function, 2g(K) < 2g(K ) = K < K. As a resut, p 2 = K g(k) > g(k) = p. What this means is that when potentia demand exceeds network capacity, botteneck provider aways charges higher price, thus obtain a arger share of the tota revenue, than the unconstrained one. This is certainy very unfair. In addition, note that the ratio between the prices is p 2 /p = K/g(K). So the smaer C 2 is, the arger K is, and the higher the ratio is. For fixed C 2, the more eastic the demand is, the faster g(k) decays with K, and the higher the ratio is. Next we show that provider 2 may not have incentive to upgrade its ink. In other words, increasing C 2 may not aways increase provider 2 s revenues! To estimate how the equiibrium changes with C 2, we are interested in the properties of J2 / C 2 (We designate the equiibrium vaue of a variabes by the superscript *). If the soution to the equation J2 = (p 2C 2 ) = p 2 C 2 + p 2 = 0 (4) C 2 C 2 C 2 exists, then it determines the capacity C 2 that yieds the argest revenues for provider 2. By differentiating both sides of d(p + p 2) = C 2 w.r.t. C 2, we get ( p d (p + p 2) p 2 ) p + 2 =. (5) C 2 Simiary, by differentiating both sides of g(p + p 2) = p w.r.t p 2, we get ( ) p p = g (p p + p 2) + = p + = 2 p 2 p 2 g (p + p 2) > 0, by the fact that g(p) is a decreasing function of p. Since the demand function is aso a decreasing function of price, the first term in (5) is negative. This impies that p 2/ C 2 must be negative as we. This resut suggests that there might exist a soution for (4) and hence a possibe maximum of J 2. If such a maximum does exist, then the botteneck provider may stop upgrading its ink after that capacity, even before the demand is fuy met. We find that it is not hard to find a demand function with which this maximum exists. For instance, it can be shown that d(p) = A exp( Bp α ), α >, is one cass of such functions. Figure shows J 2 as a function of C 2, with the demand function chosen to be d(p) = 0 exp( p 2 ). It can be ceary seen that a maximum is achieved before C 2 moves into the unconstrained region. 4 Revenue-Sharing Poicy Given the undesirabe properties of non-cooperative pricing strategy, it is natura to ask if a pricing scheme coud be designed to overcome those drawbacks and yet be compatibe with the providers interest by giving them no incentive to cheat. Game theory itsef provides many usefu concepts and toos for such a design probem, such as mechanism

5 provider 2.2 provider d(p) = 0 exp( p 2 ) C 2 Figure : Revenues coected by two providers at the equiibrium, when demand function is d(p) = 0 exp( p 2 ). design, cooperative game theory, and so on [5] [6]. However, we have found that these concepts are either too compex to compute and very difficut (if not impossibe) to impement in a scaabe way. As an aternative, we propose a straightforward revenue sharing poicy that has the aforementioned properties. We first study how providers woud behave under this poicy, and then suggest a scaabe agorithm for providers to reach that equiibrium. 4. Equiibrium In our revenue sharing poicy, a providers agree to eveny spit the tota revenue coected on a route. Nevertheess, they are sti aowed to choose prices based on their best interest. Mathematicay, a provider finds its optima prices by soving the foowing program: max pr 0 J i = ( ) ( ) E i r R N r k L p r\ kr + p r d r k L p r\ kr + p r ( ) s.t. r R d r k L p (6) r\ kr + p r C, E i, where N r is the number of providers on route r. As we wi see next, this change in the objective function competey aters providers strategy. First we show the existence of an equiibrium. Theorem 4.. A Nash equiibrium exists for the game described in (6). Proof. (To save space we ony give an outine of the proof here.) We first show that for any given strategy profie of other providers, a unique maximizer for (6) exists. Note that because there is no capacity constraint on interna inks, routes existing through different egress inks of a provider do not affect each other at a. So a provider can optimize over each egress ink independenty. By appying the first-order optimaity condition, we get p r = max{0, N r µ + g r ( p kr + p r) p kr }, (7) k L r\ k L r\ where µ 0 is the Lagrangian mutipier for ink. Define t r N r µ +g r (t r ). Intuitivey, t r is the ocay optima tota price for route r, preferred by provider i on ink. Since g( ) is continuous and decreasing, t r, and thus p r, are non-decreasing, continuous functions of µ. Then by Intermediate Vaue theorem, we can concude that either there exists a unique µ > 0 which satisfies r R d r ( k L p r\ kr + p r ) = C, or µ = 0. By duaity

6 theory [7], this set of (p r, µ ) is the optima soution to (6). This resut aso suggests that we ony need to ook at the dua variabes when soving the equiibrium of the game. Foowing this idea, we first show the foowing Lemma. Lemma 4.2. On any route r, for any given set of µ 0, the soution to the foowing system of equations: p r = max{0, t r k L r\ p kr}, L r, is { p r = t r, if t r = max{t r : L r }; 0, otherwise. In other words, ony the ink with the argest t r sets non-zero price. Proof. (We ony give a brief outine of the proof here. Aso the subscript r is omitted for carity.) Cassify inks into different sets according to the vaue of their t s. Denote those sets by A j, j =,, J. Define the vaue of these sets, S j, by the corresponding t of its members. It can be shown that for inks beong to the same set A j, either j A j p j equas some positive number, or p j = 0, j A j. Based on this resut, define y j A j p, and consider the foowing system of equations: y j = max{0, S j k j y k}, j =,, J. By constructing a contradiction, one can show that y must be zero. The same procedure is repeated unti j = J to get y J = 0 and y J = S J. If there are more than one inks in A J, there are a set of prices that they coud choose, as ong as the sum of the prices equas S J. To avoid possibe ambiguity, we fix a rue that ony the most upstream ink in A J sets its price to S J, whie the rest of the inks a set zero price. Remark. Since t r = N r µ + g r (t r ), if µ m > µ n, then t mr > t nr. Roughy speaking, Lagrangian mutipier µ at the optimum indicates how congested a ink is. So this emma impies that on any route ony the most congested ink sets its tota price. Moreover, since µ fuy determines the optima price, we may view µ as the actua strategy payed in the game. We wi use this argument to prove the existence of the equiibrium. Consider the mapping f : µ {µ k, k} µ, the best-response of ink to µ on other inks. It is easy to see that f (µ) is bounded in [0, f (0)],. So to show the existence of the equiibrium, we ony need to show that the mapping f is continuous and then appy Brouwer s fixed-point theorem. Define µ r max {µ : L r }, and the corresponding tota price for that route by p r h r ( µ r ), where h r is the impicit function defined through (7). So now the demand on route r can be expressed in terms of µ r, i.e. d r ( p r ) = d r (h r ( µ r )) = d r h r (max{µ : L r }). For use ater, define x r ( µ r ) d r h r ( µ r ). Ceary, x r is stricty decreasing and continuous. Consider µ (i), i =, 2, and suppose that µ () µ (2) < ɛ in some norm. Without oss of generaity, we may assume that µ () µ (2) < ɛ,. It can be shown that µ () r µ (2) r < ɛ, r, as we. Denote µ (i) as the best-response of ink under µ (i). Notice that µ () r and µ (2) r may be associated with different inks, so we have to study µ () µ (2) under different possibe scenarios. Before we proceed, we introduce a sma emma (we omit the proof). Lemma 4.3. Suppose f(x) is a stricty decreasing, continuous function over a finite interva. Then ɛ > 0, if f(x ) f(x 2 ) < ɛ, then δ ɛ > 0 s.t. x x 2 < δ ɛ.

7 Case. The constraint on ink is active under both µ () and µ (2). Define R, {r R µ r = µ }, and R,2 R \ R,. In other words, R, is the set of routes whose tota price is set by ink. Case. Suppose R, and R,2 do not change under µ () and µ (2). It can be shown that ɛ > 0, if µ () r µ (2) r < ɛ, δ ɛ > 0, s.t. r R, x r ( µ () ) r R, x r ( µ (2) ) < δ ɛ. Then by Lemma 4.3, γ ɛ > 0, s.t. µ () µ (2) < γ ɛ. Case.2. Suppose R, and R,2 change with µ () and µ (2). Define R,i as the set of routes that beong to R (),i under µ () but switch to R (2),j under µ (2), for i, j =, 2, and i j. There are two possibiities: Case.2.a. Suppose neither R, nor R,2 max{ µ () 2, µ (2) } max{ µ (), µ (2) 2 } 2ɛ. Case.2.b. Suppose R, φ but R,2 r R,, and by the fact that is empty. One can show that µ() µ (2) < = φ. If µ() µ (2), then we may choose any µ () r max{µ () k : k L r \ } < µ () µ (2) < µ (2) r max{µ (2) k : k L r \ } to concude µ () µ (2) < ɛ. For the case that µ () > µ (2), it can be shown that δ ɛ > 0, 0 < r R (2), \R, Then by Lemma 4.3, γ ɛ > 0, s.t. x r ( µ (2) ) µ (2) r R (), \R, µ () < γ ɛ. x r ( µ () ) < δ ɛ. The opposite case, i.e. R, = φ but R,2 φ, can be proved using the same idea. Case 2. µ () = 0, but µ (2) > 0. Define x r (µ : L r ) d r h r (max{µ : L r }). By continuity of x r, δ ɛ > 0, s.t. δ ɛ > r R x r (0, µ (2),r ) r R x r (0, µ (),r ) > r R x r (0, µ (2),r ) C = r R x r (0, µ (2),r ) r R x r ( µ (2), µ (2),r ), because r R x r (0, µ (),r ) < C < r R x r (0, µ (2),r ). By Lemma (4.3), γ ɛ > 0 s.t. 0 µ (2) = µ () µ (2) < γ ɛ. The opposite case, i.e. µ () > 0, but µ (2) = 0, can be proved in the same way. Remark. If the decision on the distribution of revenues is made by a centra agent, the optima tota price for route r is p r = L r µ + g r (p r ), where µ s are the corresponding Lagrangian mutipiers which satisfy capacity constraints on a inks. In our sharing poicy, the tota price at equiibrium for the same route is p r = N r max{µ : L r } + g r (p r ). Therefore, one may consider this as a tradeoff between system efficiency and fairness for individua providers. This proof can aso be used to show that providers under revenue-sharing poicy aways have incentive to upgrade their inks. Consider any provider with a constrained ink. Denote R, as the set of routes whose tota prices are set by ink and R,2 = R \ R, = {r R µ r µ }. Because the tota price for a route is determined by the maximum of µ k, over a k L r, routes in R,2 are not affected by increase in C at a,

8 because µ / C < 0. Moreover, on any route r R,, since µ > µ k for any k L r \, any infinitesima increase in C wi not change R,. Therefore, J / C = µ > 0. Since providers aways have incentive to upgrade their inks under sharing poicy, eventuay the network wi move into the capacity region in which none of the inks is constrained. For that case, we show next that revenue coected by each provider under sharing poicy stricty dominates that with non-cooperative pricing. Because there is no capacity constraint, we ony need to prove the resut for the case of a singe route. Consider a route r connected by N providers and has associated demand d. Under revenue-sharing poicy, by Lemma 4.2 in the proof, providers woud agree on a singe tota price, p s = arg max{p d(p)}, and then equay spit the tota revenue p s d(p s ). So in this case revenue-sharing poicy is equivaent to centraized aocation, which resuts in a revenue of J s = p s d(p s )/N for each provider. Note that p s is soved from the optimaity condition p s = g(p s ). Under non-cooperative pricing, suppose that the price set by individua provider i is p n,i. By symmetry, p n,i must be equa for a providers at the equiibrium. So the revenue coected by each provider is J n = p n d(np n ) = Np n d(np n )/N, where p n is the soution to the oca optimaity condition p n = g(np n ). Because g( ) is a decreasing function, it is straightforward to show that Np n > p s for any N >. Since p s is the ony maximizer to the unconstrained optimization program max p 0 p d(p), we can concude that p s d(p s ) > Np n d(np n ), i.e. J s > J n. 4.2 Impementation The proof of the existence of equiibrium aso suggests an agorithm for providers to compute it. Lemma 4.2 suggests that the optima tota price for a route is determined by the ink with the argest Lagrangian mutipier. Because the duaity gap for the oca optimization program is zero, these Lagrangian mutipiers can be computed iterativey based on the oca traffic oad. Theorem 4. then guarantees that an equiibrium exists even if each provider performs updates using oca information ony. Based on these resuts, we suggest the foowing agorithm: Each provider maintains a state variabe µ for each ink, which is updated periodicay according to the foowing rue: µ := max{0, µ + ω (X C )}, where ω > 0 is a sma constant and X is the tota traffic oad on ink. Each packet has two dedicated fieds in its header, denoted by µ and N. Both fieds are initiaized to zero when a packet enters the network. As a packet passes through a ink on its route to destination, the router on that ink increments N by one and updates µ by the rue: µ := max{ µ, µ }, i.e. the router updates µ ony if its own µ is arger. After the packet reaches its destination, the vaues recorded in µ and N are returned to the sending host via either ACK or some specia contro packets. We assume that a provider is abe to keep some estimates of demand on each route that initiates from its network. When it receives an ACK or contro packet returned from a destination, it updates the price for the corresponding route with the soution from p = N µ + g(p).

9 r 2 r 4 r r 3 C =2 C 2 =5 C 3 = p p 3 ink p ink p ink time step time step Figure 2: Adaptation of p and µ over time in numerica simuation. In this impementation, ony first-hop providers need to keep states for each of their routes, and possiby the on-going price charged for each fow. This is feasibe because at the edge of the network the numbers of active fows and routes are reativey sma, and the providers have to maintain those information for charging purpose anyway. Transit providers do not need to keep any per-fow nor per-route state, and they do not even need to estimate any demand function in order to maximize its revenue. So this agorithm is quite scaabe for impementation. Next we show the foowing convergence resut. Theorem 4.4. The agorithm described above converges to the equiibrium described in Theorem 4.. Proof. We take a continuous-time approximation to the adaptation process of µ, i.e. dµ /dt = max{0, ω (X C )}. Consider the foowing function V (µ) = µ (C x r ( µ r )) r R,2 r µr 0 x r (t)dt. It is easy to show that V is continuous and achieves its minimum at the equiibrium. Then we have V µ = C r R,2 x r ( µ r ) r x r( µ r )I{µ = µ r } = C r R,2 x r ( µ r ) r R, x r (µ ) = C X V t = i.e. V is a Lyapunov function for the agorithm. V µ dµ dt = max{0, ω (X C )}(C X ) 0 Figure 2 shows the resuts of a numerica simuation of the above agorithm. In the pots p and µ adapt over time and converge to their equiibrium vaues. 5 Concusion In this paper we have presented a generic mode for pricing Internet services in a mutiprovider network. We have showed that non-cooperative pricing is unfair and may discourage future upgrades of the networks. As an aternative, we have proposed a simpe revenue sharing poicy and have shown that it is fair, more efficient, and encourages

10 providers to coaborate without cheating. We aso have suggested a scaabe agorithm for providers to impement this poicy in a distributed way and studied its convergence property. The mode that we have presented in this paper is probaby more suited for users who prefer predictabe service quaity and are not very sensitive to fuctuations in price. Certainy there are users whose preference is the other way around. So it woud be usefu to extend our pricing schemes to support both service types in a fexibe way. Aso it woud be interesting to understand how optima pricing strategies woud change accordingy to refect different natures of these two services. References [] F. P. Key, A. K. Mauoo, and D. H. K. Tan, The Rate Contro for Communication Networks: Shadow Prices, Proportiona Fairness and Stabiity, Journa of the Operationa Research Society, pp , vo.49, 998. [2] S. Kunniyur and R. Srikant, Anaysis and Design of an Adaptive Virtua Queue Agorithm for Active Queue Management, Proc. ACM Sigcomm, 200. [3] S. H. Low and D. E. Lapsey, Optimization Fow Contro, I: Basic Agorithm and Convergence,, IEEE/ACM Transactions on Networking, 7(6):86-75, Dec [4] G. Huston, Interconnection, peering, and settements, Proc. INET, June 999. [5] D. Fudenberg and J. Tiroe, Game Theory, MIT Press, Cambridge, Mass., 99. [6] G. Owen, Game Theory, Academic Press, San Diego, 995. [7] D. G. Luenberger, Linear and Noninear Programming, Addison-Wesey, Reading, Mass., 984.

Pricing and Revenue Sharing Strategies for Internet Service Providers

Pricing and Revenue Sharing Strategies for Internet Service Providers Pricing and Revenue Sharing Strategies for Internet Service Providers Linhai He and Jean Warand Department of Eectrica Engineering and Computer Sciences University of Caifornia at Berkeey {inhai,wr}@eecs.berkeey.edu

More information

Simultaneous Routing and Power Allocation in CDMA Wireless Data Networks

Simultaneous Routing and Power Allocation in CDMA Wireless Data Networks Simutaneous Routing and Power Aocation in CDMA Wireess Data Networks Mikae Johansson *,LinXiao and Stephen Boyd * Department of Signas, Sensors and Systems Roya Institute of Technoogy, SE 00 Stockhom,

More information

Secure Network Coding with a Cost Criterion

Secure Network Coding with a Cost Criterion Secure Network Coding with a Cost Criterion Jianong Tan, Murie Médard Laboratory for Information and Decision Systems Massachusetts Institute of Technoogy Cambridge, MA 0239, USA E-mai: {jianong, medard}@mit.edu

More information

GREEN: An Active Queue Management Algorithm for a Self Managed Internet

GREEN: An Active Queue Management Algorithm for a Self Managed Internet : An Active Queue Management Agorithm for a Sef Managed Internet Bartek Wydrowski and Moshe Zukerman ARC Specia Research Centre for Utra-Broadband Information Networks, EEE Department, The University of

More information

Fast Robust Hashing. ) [7] will be re-mapped (and therefore discarded), due to the load-balancing property of hashing.

Fast Robust Hashing. ) [7] will be re-mapped (and therefore discarded), due to the load-balancing property of hashing. Fast Robust Hashing Manue Urueña, David Larrabeiti and Pabo Serrano Universidad Caros III de Madrid E-89 Leganés (Madrid), Spain Emai: {muruenya,darra,pabo}@it.uc3m.es Abstract As statefu fow-aware services

More information

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 12, DECEMBER 2013 1

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 12, DECEMBER 2013 1 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 12, DECEMBER 2013 1 Scaabe Muti-Cass Traffic Management in Data Center Backbone Networks Amitabha Ghosh, Sangtae Ha, Edward Crabbe, and Jennifer

More information

Cooperative Content Distribution and Traffic Engineering in an ISP Network

Cooperative Content Distribution and Traffic Engineering in an ISP Network Cooperative Content Distribution and Traffic Engineering in an ISP Network Wenjie Jiang, Rui Zhang-Shen, Jennifer Rexford, Mung Chiang Department of Computer Science, and Department of Eectrica Engineering

More information

With the arrival of Java 2 Micro Edition (J2ME) and its industry

With the arrival of Java 2 Micro Edition (J2ME) and its industry Knowedge-based Autonomous Agents for Pervasive Computing Using AgentLight Fernando L. Koch and John-Jues C. Meyer Utrecht University Project AgentLight is a mutiagent system-buiding framework targeting

More information

Australian Bureau of Statistics Management of Business Providers

Australian Bureau of Statistics Management of Business Providers Purpose Austraian Bureau of Statistics Management of Business Providers 1 The principa objective of the Austraian Bureau of Statistics (ABS) in respect of business providers is to impose the owest oad

More information

Teamwork. Abstract. 2.1 Overview

Teamwork. Abstract. 2.1 Overview 2 Teamwork Abstract This chapter presents one of the basic eements of software projects teamwork. It addresses how to buid teams in a way that promotes team members accountabiity and responsibiity, and

More information

Lecture 7 Datalink Ethernet, Home. Datalink Layer Architectures

Lecture 7 Datalink Ethernet, Home. Datalink Layer Architectures Lecture 7 Dataink Ethernet, Home Peter Steenkiste Schoo of Computer Science Department of Eectrica and Computer Engineering Carnegie Meon University 15-441 Networking, Spring 2004 http://www.cs.cmu.edu/~prs/15-441

More information

Virtual trunk simulation

Virtual trunk simulation Virtua trunk simuation Samui Aato * Laboratory of Teecommunications Technoogy Hesinki University of Technoogy Sivia Giordano Laboratoire de Reseaux de Communication Ecoe Poytechnique Federae de Lausanne

More information

Chapter 3: e-business Integration Patterns

Chapter 3: e-business Integration Patterns Chapter 3: e-business Integration Patterns Page 1 of 9 Chapter 3: e-business Integration Patterns "Consistency is the ast refuge of the unimaginative." Oscar Wide In This Chapter What Are Integration Patterns?

More information

TCP/IP Gateways and Firewalls

TCP/IP Gateways and Firewalls Gateways and Firewas 1 Gateways and Firewas Prof. Jean-Yves Le Boudec Prof. Andrzej Duda ICA, EPFL CH-1015 Ecubens http://cawww.epf.ch Gateways and Firewas Firewas 2 o architecture separates hosts and

More information

Randomized Algorithms for Scheduling VMs in the Cloud

Randomized Algorithms for Scheduling VMs in the Cloud Randomized Agorithms for Scheduing VMs in the Coud Javad Ghaderi Coumbia University Abstract We consider the probem of scheduing VMs (Virtua Machines) in a muti-server system motivated by coud computing

More information

CONTRIBUTION OF INTERNAL AUDITING IN THE VALUE OF A NURSING UNIT WITHIN THREE YEARS

CONTRIBUTION OF INTERNAL AUDITING IN THE VALUE OF A NURSING UNIT WITHIN THREE YEARS Dehi Business Review X Vo. 4, No. 2, Juy - December 2003 CONTRIBUTION OF INTERNAL AUDITING IN THE VALUE OF A NURSING UNIT WITHIN THREE YEARS John N.. Var arvatsouakis atsouakis DURING the present time,

More information

Discounted Cash Flow Analysis (aka Engineering Economy)

Discounted Cash Flow Analysis (aka Engineering Economy) Discounted Cash Fow Anaysis (aka Engineering Economy) Objective: To provide economic comparison of benefits and costs that occur over time Assumptions: Future benefits and costs can be predicted A Benefits,

More information

Journal of Economic Behavior & Organization

Journal of Economic Behavior & Organization Journa of Economic Behavior & Organization 85 (23 79 96 Contents ists avaiabe at SciVerse ScienceDirect Journa of Economic Behavior & Organization j ourna ho me pag e: www.esevier.com/ocate/j ebo Heath

More information

Finance 360 Problem Set #6 Solutions

Finance 360 Problem Set #6 Solutions Finance 360 Probem Set #6 Soutions 1) Suppose that you are the manager of an opera house. You have a constant margina cost of production equa to $50 (i.e. each additiona person in the theatre raises your

More information

Comparison of Traditional and Open-Access Appointment Scheduling for Exponentially Distributed Service Time

Comparison of Traditional and Open-Access Appointment Scheduling for Exponentially Distributed Service Time Journa of Heathcare Engineering Vo. 6 No. 3 Page 34 376 34 Comparison of Traditiona and Open-Access Appointment Scheduing for Exponentiay Distributed Service Chongjun Yan, PhD; Jiafu Tang *, PhD; Bowen

More information

Wide-Area Traffic Management for. Cloud Services

Wide-Area Traffic Management for. Cloud Services Wide-Area Traffic Management for Coud Services Joe Wenjie Jiang A Dissertation Presented to the Facuty of Princeton University in Candidacy for the Degree of Doctor of Phiosophy Recommended for Acceptance

More information

500 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 3, MARCH 2013

500 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 31, NO. 3, MARCH 2013 500 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. 3, NO. 3, MARCH 203 Cognitive Radio Network Duaity Agorithms for Utiity Maximization Liang Zheng Chee Wei Tan, Senior Member, IEEE Abstract We

More information

Online Supplement for The Robust Network Loading Problem under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations

Online Supplement for The Robust Network Loading Problem under Hose Demand Uncertainty: Formulation, Polyhedral Analysis, and Computations Onine Suppement for The Robust Network Loading Probem under Hose Demand Uncertaint: Formuation, Pohedra Anasis, and Computations Aşegü Atın Department of Industria Engineering, TOBB Universit of Economics

More information

FRAME BASED TEXTURE CLASSIFICATION BY CONSIDERING VARIOUS SPATIAL NEIGHBORHOODS. Karl Skretting and John Håkon Husøy

FRAME BASED TEXTURE CLASSIFICATION BY CONSIDERING VARIOUS SPATIAL NEIGHBORHOODS. Karl Skretting and John Håkon Husøy FRAME BASED TEXTURE CLASSIFICATION BY CONSIDERING VARIOUS SPATIAL NEIGHBORHOODS Kar Skretting and John Håkon Husøy University of Stavanger, Department of Eectrica and Computer Engineering N-4036 Stavanger,

More information

Design Considerations

Design Considerations Chapter 2: Basic Virtua Private Network Depoyment Page 1 of 12 Chapter 2: Basic Virtua Private Network Depoyment Before discussing the features of Windows 2000 tunneing technoogy, it is important to estabish

More information

Market Design & Analysis for a P2P Backup System

Market Design & Analysis for a P2P Backup System Market Design & Anaysis for a P2P Backup System Sven Seuken Schoo of Engineering & Appied Sciences Harvard University, Cambridge, MA seuken@eecs.harvard.edu Denis Chares, Max Chickering, Sidd Puri Microsoft

More information

Load Balance vs Energy Efficiency in Traffic Engineering: A Game Theoretical Perspective

Load Balance vs Energy Efficiency in Traffic Engineering: A Game Theoretical Perspective Load Baance vs Energy Efficiency in Traffic Engineering: A Game Theoretica Perspective Yangming Zhao, Sheng Wang, Shizhong Xu and Xiong Wang Schoo of Communication and Information Engineering University

More information

A Supplier Evaluation System for Automotive Industry According To Iso/Ts 16949 Requirements

A Supplier Evaluation System for Automotive Industry According To Iso/Ts 16949 Requirements A Suppier Evauation System for Automotive Industry According To Iso/Ts 16949 Requirements DILEK PINAR ÖZTOP 1, ASLI AKSOY 2,*, NURSEL ÖZTÜRK 2 1 HONDA TR Purchasing Department, 41480, Çayırova - Gebze,

More information

Betting Strategies, Market Selection, and the Wisdom of Crowds

Betting Strategies, Market Selection, and the Wisdom of Crowds Betting Strategies, Market Seection, and the Wisdom of Crowds Wiemien Kets Northwestern University w-kets@keogg.northwestern.edu David M. Pennock Microsoft Research New York City dpennock@microsoft.com

More information

Load Balancing in Distributed Web Server Systems with Partial Document Replication *

Load Balancing in Distributed Web Server Systems with Partial Document Replication * Load Baancing in Distributed Web Server Systems with Partia Document Repication * Ling Zhuo Cho-Li Wang Francis C. M. Lau Department of Computer Science and Information Systems The University of Hong Kong

More information

Link Dimensioning and LSP Optimization for MPLS Networks Supporting DiffServ EF and BE traffic classes

Link Dimensioning and LSP Optimization for MPLS Networks Supporting DiffServ EF and BE traffic classes Link Dimensioning and LSP Optimization for MPLS Networks Supporting DiffServ EF and BE traffic casses Kehang Wu and Dougas S. Reeves Departments of Eectrica and Computer Engineering and Computer Science

More information

Scheduling in Multi-Channel Wireless Networks

Scheduling in Multi-Channel Wireless Networks Scheduing in Muti-Channe Wireess Networks Vartika Bhandari and Nitin H. Vaidya University of Iinois at Urbana-Champaign, USA vartikab@acm.org, nhv@iinois.edu Abstract. The avaiabiity of mutipe orthogona

More information

Fixed income managers: evolution or revolution

Fixed income managers: evolution or revolution Fixed income managers: evoution or revoution Traditiona approaches to managing fixed interest funds rey on benchmarks that may not represent optima risk and return outcomes. New techniques based on separate

More information

The eg Suite Enabing Rea-Time Monitoring and Proactive Infrastructure Triage White Paper Restricted Rights Legend The information contained in this document is confidentia and subject to change without

More information

Mean-field Dynamics of Load-Balancing Networks with General Service Distributions

Mean-field Dynamics of Load-Balancing Networks with General Service Distributions Mean-fied Dynamics of Load-Baancing Networks with Genera Service Distributions Reza Aghajani 1, Xingjie Li 2, and Kavita Ramanan 1 1 Division of Appied Mathematics, Brown University, Providence, RI, USA.

More information

An FDD Wideband CDMA MAC Protocol for Wireless Multimedia Networks

An FDD Wideband CDMA MAC Protocol for Wireless Multimedia Networks An FDD ideband CDMA MAC Protoco for ireess Mutimedia Networks Xudong ang Broadband and ireess Networking (BN) Lab Schoo of Eectrica and Computer Engineering Georgia Institute of Technoogy Atanta, GA 3332

More information

Order-to-Cash Processes

Order-to-Cash Processes TMI170 ING info pat 2:Info pat.qxt 01/12/2008 09:25 Page 1 Section Two: Order-to-Cash Processes Gregory Cronie, Head Saes, Payments and Cash Management, ING O rder-to-cash and purchase-topay processes

More information

Uncertain Bequest Needs and Long-Term Insurance Contracts 1

Uncertain Bequest Needs and Long-Term Insurance Contracts 1 Uncertain Bequest Needs and Long-Term Insurance Contracts 1 Wenan Fei (Hartford Life Insurance) Caude Fuet (Université du Québec à Montréa and CIRPEE) Harris Schesinger (University of Aabama) Apri 22,

More information

The growth of online Internet services during the past decade has

The growth of online Internet services during the past decade has IEEE DS Onine, Voume 2, Number 4 Designing an Adaptive CORBA Load Baancing Service Using TAO Ossama Othman, Caros O'Ryan, and Dougas C. Schmidt University of Caifornia, Irvine The growth of onine Internet

More information

Figure 1. A Simple Centrifugal Speed Governor.

Figure 1. A Simple Centrifugal Speed Governor. ENGINE SPEED CONTROL Peter Westead and Mark Readman, contro systems principes.co.uk ABSTRACT: This is one of a series of white papers on systems modeing, anaysis and contro, prepared by Contro Systems

More information

eg Enterprise vs. a Big 4 Monitoring Soution: Comparing Tota Cost of Ownership Restricted Rights Legend The information contained in this document is confidentia and subject to change without notice. No

More information

WHITE PAPER BEsT PRAcTIcEs: PusHIng ExcEl BEyond ITs limits WITH InfoRmATIon optimization

WHITE PAPER BEsT PRAcTIcEs: PusHIng ExcEl BEyond ITs limits WITH InfoRmATIon optimization Best Practices: Pushing Exce Beyond Its Limits with Information Optimization WHITE Best Practices: Pushing Exce Beyond Its Limits with Information Optimization Executive Overview Microsoft Exce is the

More information

Network/Communicational Vulnerability

Network/Communicational Vulnerability Automated teer machines (ATMs) are a part of most of our ives. The major appea of these machines is convenience The ATM environment is changing and that change has serious ramifications for the security

More information

Betting on the Real Line

Betting on the Real Line Betting on the Rea Line Xi Gao 1, Yiing Chen 1,, and David M. Pennock 2 1 Harvard University, {xagao,yiing}@eecs.harvard.edu 2 Yahoo! Research, pennockd@yahoo-inc.com Abstract. We study the probem of designing

More information

ASYMPTOTIC DIRECTION FOR RANDOM WALKS IN RANDOM ENVIRONMENTS arxiv:math/0512388v2 [math.pr] 11 Dec 2007

ASYMPTOTIC DIRECTION FOR RANDOM WALKS IN RANDOM ENVIRONMENTS arxiv:math/0512388v2 [math.pr] 11 Dec 2007 ASYMPTOTIC DIRECTION FOR RANDOM WALKS IN RANDOM ENVIRONMENTS arxiv:math/0512388v2 [math.pr] 11 Dec 2007 FRANÇOIS SIMENHAUS Université Paris 7, Mathématiques, case 7012, 2, pace Jussieu, 75251 Paris, France

More information

Risk Margin for a Non-Life Insurance Run-Off

Risk Margin for a Non-Life Insurance Run-Off Risk Margin for a Non-Life Insurance Run-Off Mario V. Wüthrich, Pau Embrechts, Andreas Tsanakas February 2, 2011 Abstract For sovency purposes insurance companies need to cacuate so-caed best-estimate

More information

Early access to FAS payments for members in poor health

Early access to FAS payments for members in poor health Financia Assistance Scheme Eary access to FAS payments for members in poor heath Pension Protection Fund Protecting Peope s Futures The Financia Assistance Scheme is administered by the Pension Protection

More information

Multi-Robot Task Scheduling

Multi-Robot Task Scheduling Proc of IEEE Internationa Conference on Robotics and Automation, Karsruhe, Germany, 013 Muti-Robot Tas Scheduing Yu Zhang and Lynne E Parer Abstract The scheduing probem has been studied extensivey in

More information

Oligopoly in Insurance Markets

Oligopoly in Insurance Markets Oigopoy in Insurance Markets June 3, 2008 Abstract We consider an oigopoistic insurance market with individuas who differ in their degrees of accident probabiities. Insurers compete in coverage and premium.

More information

CERTIFICATE COURSE ON CLIMATE CHANGE AND SUSTAINABILITY. Course Offered By: Indian Environmental Society

CERTIFICATE COURSE ON CLIMATE CHANGE AND SUSTAINABILITY. Course Offered By: Indian Environmental Society CERTIFICATE COURSE ON CLIMATE CHANGE AND SUSTAINABILITY Course Offered By: Indian Environmenta Society INTRODUCTION The Indian Environmenta Society (IES) a dynamic and fexibe organization with a goba vision

More information

A New Statistical Approach to Network Anomaly Detection

A New Statistical Approach to Network Anomaly Detection A New Statistica Approach to Network Anomay Detection Christian Caegari, Sandrine Vaton 2, and Michee Pagano Dept of Information Engineering, University of Pisa, ITALY E-mai: {christiancaegari,mpagano}@ietunipiit

More information

A Latent Variable Pairwise Classification Model of a Clustering Ensemble

A Latent Variable Pairwise Classification Model of a Clustering Ensemble A atent Variabe Pairwise Cassification Mode of a Custering Ensembe Vadimir Berikov Soboev Institute of mathematics, Novosibirsk State University, Russia berikov@math.nsc.ru http://www.math.nsc.ru Abstract.

More information

Take me to your leader! Online Optimization of Distributed Storage Configurations

Take me to your leader! Online Optimization of Distributed Storage Configurations Take me to your eader! Onine Optimization of Distributed Storage Configurations Artyom Sharov Aexander Shraer Arif Merchant Murray Stokey sharov@cs.technion.ac.i, {shraex, aamerchant, mstokey}@googe.com

More information

Ricoh Healthcare. Process Optimized. Healthcare Simplified.

Ricoh Healthcare. Process Optimized. Healthcare Simplified. Ricoh Heathcare Process Optimized. Heathcare Simpified. Rather than a destination that concudes with the eimination of a paper, the Paperess Maturity Roadmap is a continuous journey to strategicay remove

More information

An Idiot s guide to Support vector machines (SVMs)

An Idiot s guide to Support vector machines (SVMs) An Idiot s guide to Support vector machines (SVMs) R. Berwick, Viage Idiot SVMs: A New Generation of Learning Agorithms Pre 1980: Amost a earning methods earned inear decision surfaces. Linear earning

More information

Introduction the pressure for efficiency the Estates opportunity

Introduction the pressure for efficiency the Estates opportunity Heathy Savings? A study of the proportion of NHS Trusts with an in-house Buidings Repair and Maintenance workforce, and a discussion of eary experiences of Suppies efficiency initiatives Management Summary

More information

Advanced ColdFusion 4.0 Application Development - 3 - Server Clustering Using Bright Tiger

Advanced ColdFusion 4.0 Application Development - 3 - Server Clustering Using Bright Tiger Advanced CodFusion 4.0 Appication Deveopment - CH 3 - Server Custering Using Bri.. Page 1 of 7 [Figures are not incuded in this sampe chapter] Advanced CodFusion 4.0 Appication Deveopment - 3 - Server

More information

Dynamic Pricing Trade Market for Shared Resources in IIU Federated Cloud

Dynamic Pricing Trade Market for Shared Resources in IIU Federated Cloud Dynamic Pricing Trade Market or Shared Resources in IIU Federated Coud Tongrang Fan 1, Jian Liu 1, Feng Gao 1 1Schoo o Inormation Science and Technoogy, Shiiazhuang Tiedao University, Shiiazhuang, 543,

More information

3.5 Pendulum period. 2009-02-10 19:40:05 UTC / rev 4d4a39156f1e. g = 4π2 l T 2. g = 4π2 x1 m 4 s 2 = π 2 m s 2. 3.5 Pendulum period 68

3.5 Pendulum period. 2009-02-10 19:40:05 UTC / rev 4d4a39156f1e. g = 4π2 l T 2. g = 4π2 x1 m 4 s 2 = π 2 m s 2. 3.5 Pendulum period 68 68 68 3.5 Penduum period 68 3.5 Penduum period Is it coincidence that g, in units of meters per second squared, is 9.8, very cose to 2 9.87? Their proximity suggests a connection. Indeed, they are connected

More information

Risk Margin for a Non-Life Insurance Run-Off

Risk Margin for a Non-Life Insurance Run-Off Risk Margin for a Non-Life Insurance Run-Off Mario V. Wüthrich, Pau Embrechts, Andreas Tsanakas August 15, 2011 Abstract For sovency purposes insurance companies need to cacuate so-caed best-estimate reserves

More information

Capacity of Multi-service Cellular Networks with Transmission-Rate Control: A Queueing Analysis

Capacity of Multi-service Cellular Networks with Transmission-Rate Control: A Queueing Analysis Capacity of Muti-service Ceuar Networs with Transmission-Rate Contro: A Queueing Anaysis Eitan Atman INRIA, BP93, 2004 Route des Lucioes, 06902 Sophia-Antipois, France aso CESIMO, Facutad de Ingeniería,

More information

Iterative Water-filling for Load-balancing in Wireless LAN or Microcellular Networks

Iterative Water-filling for Load-balancing in Wireless LAN or Microcellular Networks terative Water-fiing for Load-baancing in Wireess LAN or Microceuar Networks Jeremy K. Chen Theodore S. Rappaport Gustavo de Veciana Wireess Networking and Communications Group (WNCG), be University of

More information

In some states, however, the couple must live apart for a period of months or years before they can obtain a no fault divorce.

In some states, however, the couple must live apart for a period of months or years before they can obtain a no fault divorce. What is a "no faut" divorce? "No faut" divorce describes any divorce where the spouse asking for a divorce does not have to prove that the other spouse did something wrong. A states aow no faut divorces.

More information

Face Hallucination and Recognition

Face Hallucination and Recognition Face Haucination and Recognition Xiaogang Wang and Xiaoou Tang Department of Information Engineering, The Chinese University of Hong Kong {xgwang1, xtang}@ie.cuhk.edu.hk http://mmab.ie.cuhk.edu.hk Abstract.

More information

3.3 SOFTWARE RISK MANAGEMENT (SRM)

3.3 SOFTWARE RISK MANAGEMENT (SRM) 93 3.3 SOFTWARE RISK MANAGEMENT (SRM) Fig. 3.2 SRM is a process buit in five steps. The steps are: Identify Anayse Pan Track Resove The process is continuous in nature and handed dynamicay throughout ifecyce

More information

Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks

Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks Minimizing the Tota Weighted Competion Time of Cofows in Datacenter Networks Zhen Qiu Ciff Stein and Yuan Zhong ABSTRACT Communications in datacenter jobs (such as the shuffe operations in MapReduce appications

More information

Leakage detection in water pipe networks using a Bayesian probabilistic framework

Leakage detection in water pipe networks using a Bayesian probabilistic framework Probabiistic Engineering Mechanics 18 (2003) 315 327 www.esevier.com/ocate/probengmech Leakage detection in water pipe networks using a Bayesian probabiistic framework Z. Pouakis, D. Vaougeorgis, C. Papadimitriou*

More information

Documents de Travail du Centre d Economie de la Sorbonne

Documents de Travail du Centre d Economie de la Sorbonne Documents de Travai du Centre d Economie de a Sorbonne Rationaizabiity and Efficiency in an Asymmetric Cournot Oigopoy Gabrie DESGRANGES, Stéphane GAUTHIER 2014.28 Maison des Sciences Économiques, 106-112

More information

Minimum Support Size of the Defender s Strong Stackelberg Equilibrium Strategies in Security Games

Minimum Support Size of the Defender s Strong Stackelberg Equilibrium Strategies in Security Games Minimum Support Size o the Deender s Strong Stackeberg Equiibrium Strategies in Security Games Jiarui Gan University o Chinese Academy o Sciences The Key Lab o Inteigent Inormation Processing, ICT, CAS

More information

A Description of the California Partnership for Long-Term Care Prepared by the California Department of Health Care Services

A Description of the California Partnership for Long-Term Care Prepared by the California Department of Health Care Services 2012 Before You Buy A Description of the Caifornia Partnership for Long-Term Care Prepared by the Caifornia Department of Heath Care Services Page 1 of 13 Ony ong-term care insurance poicies bearing any

More information

This paper considers an inventory system with an assembly structure. In addition to uncertain customer

This paper considers an inventory system with an assembly structure. In addition to uncertain customer MANAGEMENT SCIENCE Vo. 51, No. 8, August 2005, pp. 1250 1265 issn 0025-1909 eissn 1526-5501 05 5108 1250 informs doi 10.1287/mnsc.1050.0394 2005 INFORMS Inventory Management for an Assemby System wh Product

More information

Advance PLM Software Solutions for Complex Business Processes

Advance PLM Software Solutions for Complex Business Processes Advance PLM Software Soutions for Compex Business Processes Abstract As customers word-wide camour for more technoogicay rich products, be it a car, or a smartphone, manufacturers are having to contend

More information

WIRELESS Mesh Networks (WMNs) have recently attracted

WIRELESS Mesh Networks (WMNs) have recently attracted 3968 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 2, NO. 8, AUGUST 23 A New MPLS-Based Forwarding Paradigm for Muti-Radio Wireess Mesh Networks Stefano Avaone and Giovanni Di Stasi Abstract Routing

More information

Conference Paper Service Organizations: Customer Contact and Incentives of Knowledge Managers

Conference Paper Service Organizations: Customer Contact and Incentives of Knowledge Managers econstor www.econstor.eu Der Open-Access-Pubikationsserver der ZBW Leibniz-Informationszentrum Wirtschaft The Open Access Pubication Server of the ZBW Leibniz Information Centre for Economics Kirchmaier,

More information

A train dispatching model based on fuzzy passenger demand forecasting during holidays

A train dispatching model based on fuzzy passenger demand forecasting during holidays Journa of Industria Engineering and Management JIEM, 2013 6(1):320-335 Onine ISSN: 2013-0953 Print ISSN: 2013-8423 http://dx.doi.org/10.3926/jiem.699 A train dispatching mode based on fuzzy passenger demand

More information

Art of Java Web Development By Neal Ford 624 pages US$44.95 Manning Publications, 2004 ISBN: 1-932394-06-0

Art of Java Web Development By Neal Ford 624 pages US$44.95 Manning Publications, 2004 ISBN: 1-932394-06-0 IEEE DISTRIBUTED SYSTEMS ONLINE 1541-4922 2005 Pubished by the IEEE Computer Society Vo. 6, No. 5; May 2005 Editor: Marcin Paprzycki, http://www.cs.okstate.edu/%7emarcin/ Book Reviews: Java Toos and Frameworks

More information

Design and Analysis of a Hidden Peer-to-peer Backup Market

Design and Analysis of a Hidden Peer-to-peer Backup Market Design and Anaysis of a Hidden Peer-to-peer Backup Market Sven Seuken, Denis Chares, Max Chickering, Mary Czerwinski Kama Jain, David C. Parkes, Sidd Puri, and Desney Tan December, 2015 Abstract We present

More information

APPENDIX 10.1: SUBSTANTIVE AUDIT PROGRAMME FOR PRODUCTION WAGES: TROSTON PLC

APPENDIX 10.1: SUBSTANTIVE AUDIT PROGRAMME FOR PRODUCTION WAGES: TROSTON PLC Appendix 10.1: substantive audit programme for production wages: Troston pc 389 APPENDIX 10.1: SUBSTANTIVE AUDIT PROGRAMME FOR PRODUCTION WAGES: TROSTON PLC The detaied audit programme production wages

More information

The Use of Cooling-Factor Curves for Coordinating Fuses and Reclosers

The Use of Cooling-Factor Curves for Coordinating Fuses and Reclosers he Use of ooing-factor urves for oordinating Fuses and Recosers arey J. ook Senior Member, IEEE S& Eectric ompany hicago, Iinois bstract his paper describes how to precisey coordinate distribution feeder

More information

NCH Software Warp Speed PC Tune-up Software

NCH Software Warp Speed PC Tune-up Software NCH Software Warp Speed PC Tune-up Software This user guide has been created for use with Warp Speed PC Tune-up Software Version 1.xx NCH Software Technica Support If you have difficuties using Warp Speed

More information

SPOTLIGHT. A year of transformation

SPOTLIGHT. A year of transformation WINTER ISSUE 2014 2015 SPOTLIGHT Wecome to the winter issue of Oasis Spotight. These newsetters are designed to keep you upto-date with news about the Oasis community. This quartery issue features an artice

More information

Pay-on-delivery investing

Pay-on-delivery investing Pay-on-deivery investing EVOLVE INVESTment range 1 EVOLVE INVESTMENT RANGE EVOLVE INVESTMENT RANGE 2 Picture a word where you ony pay a company once they have deivered Imagine striking oi first, before

More information

Maintenance activities planning and grouping for complex structure systems

Maintenance activities planning and grouping for complex structure systems Maintenance activities panning and grouping for compex structure systems Hai Canh u, Phuc Do an, Anne Barros, Christophe Berenguer To cite this version: Hai Canh u, Phuc Do an, Anne Barros, Christophe

More information

We are XMA and Viglen.

We are XMA and Viglen. alearn with Microsoft 16pp 21.07_Layout 1 22/12/2014 10:49 Page 1 FRONT COVER alearn with Microsoft We are XMA and Vigen. Ca us now on 0115 846 4900 Visit www.xma.co.uk/aearn Emai alearn@xma.co.uk Foow

More information

Telephony Trainers with Discovery Software

Telephony Trainers with Discovery Software Teephony Trainers 58 Series Teephony Trainers with Discovery Software 58-001 Teephony Training System 58-002 Digita Switching System 58-003 Digita Teephony Training System 58-004 Digita Trunk Network System

More information

Learning from evaluations Processes and instruments used by GIZ as a learning organisation and their contribution to interorganisational learning

Learning from evaluations Processes and instruments used by GIZ as a learning organisation and their contribution to interorganisational learning Monitoring and Evauation Unit Learning from evauations Processes and instruments used by GIZ as a earning organisation and their contribution to interorganisationa earning Contents 1.3Learning from evauations

More information

TERM INSURANCE CALCULATION ILLUSTRATED. This is the U.S. Social Security Life Table, based on year 2007.

TERM INSURANCE CALCULATION ILLUSTRATED. This is the U.S. Social Security Life Table, based on year 2007. This is the U.S. Socia Security Life Tabe, based on year 2007. This is avaiabe at http://www.ssa.gov/oact/stats/tabe4c6.htm. The ife eperiences of maes and femaes are different, and we usuay do separate

More information

A Distributed MAC Scheme Supporting Voice Services in Mobile Ad Hoc Networks 1

A Distributed MAC Scheme Supporting Voice Services in Mobile Ad Hoc Networks 1 A Distributed MAC Scheme Supporting Voice Services in Mobie Ad Hoc Networks 1 Hai Jiang, Ping Wang, H. Vincent Poor, and Weihua Zhuang Department of Eectrica & Computer Engineering, University of Aberta,

More information

Introduction to XSL. Max Froumentin - W3C

Introduction to XSL. Max Froumentin - W3C Introduction to XSL Max Froumentin - W3C Introduction to XSL XML Documents Stying XML Documents XSL Exampe I: Hamet Exampe II: Mixed Writing Modes Exampe III: database Other Exampes How do they do that?

More information

GreenTE: Power-Aware Traffic Engineering

GreenTE: Power-Aware Traffic Engineering GreenTE: Power-Aware Traffic Engineering Mingui Zhang zmg6@mais.tsinghua.edu.cn Cheng Yi yic@emai.arizona.edu Bin Liu iub@tsinghua.edu.cn Beichuan Zhang bzhang@arizona.edu Abstract Current network infrastructures

More information

Chapter 3: JavaScript in Action Page 1 of 10. How to practice reading and writing JavaScript on a Web page

Chapter 3: JavaScript in Action Page 1 of 10. How to practice reading and writing JavaScript on a Web page Chapter 3: JavaScript in Action Page 1 of 10 Chapter 3: JavaScript in Action In this chapter, you get your first opportunity to write JavaScript! This chapter introduces you to JavaScript propery. In addition,

More information

SAT Math Facts & Formulas

SAT Math Facts & Formulas Numbers, Sequences, Factors SAT Mat Facts & Formuas Integers:..., -3, -2, -1, 0, 1, 2, 3,... Reas: integers pus fractions, decimas, and irrationas ( 2, 3, π, etc.) Order Of Operations: Aritmetic Sequences:

More information

Pricing and hedging of variable annuities

Pricing and hedging of variable annuities Cutting Edge Pricing and hedging of variabe annuities Variabe annuity products are unit-inked investments with some form of guarantee, traditionay sod by insurers or banks into the retirement and investment

More information

Strengthening Human Resources Information Systems: Experiences from Bihar and Jharkhand, India

Strengthening Human Resources Information Systems: Experiences from Bihar and Jharkhand, India Strengthening Human Resources Information Systems: Experiences from Bihar and Jharkhand, India Technica Brief October 2012 Context India faces critica human resources (HR) chaenges in the heath sector,

More information

Business schools are the academic setting where. The current crisis has highlighted the need to redefine the role of senior managers in organizations.

Business schools are the academic setting where. The current crisis has highlighted the need to redefine the role of senior managers in organizations. c r o s os r oi a d s REDISCOVERING THE ROLE OF BUSINESS SCHOOLS The current crisis has highighted the need to redefine the roe of senior managers in organizations. JORDI CANALS Professor and Dean, IESE

More information

WINMAG Graphics Management System

WINMAG Graphics Management System SECTION 10: page 1 Section 10: by Honeywe WINMAG Graphics Management System Contents What is WINMAG? WINMAG Text and Graphics WINMAG Text Ony Scenarios Fire/Emergency Management of Fauts & Disabement Historic

More information

Capability Development Grant. Build business capabilities to sharpen your competitive edge

Capability Development Grant. Build business capabilities to sharpen your competitive edge Capabiity Deveopment Grant Buid business capabiities to sharpen your competitive edge 1 Buid up your business with the Capabiity Deveopment Grant The Capabiity Deveopment Grant (CDG) is a financia assistance

More information

Chapter 1 Structural Mechanics

Chapter 1 Structural Mechanics Chapter Structura echanics Introduction There are many different types of structures a around us. Each structure has a specific purpose or function. Some structures are simpe, whie others are compex; however

More information

Ricoh Legal. ediscovery and Document Solutions. Powerful document services provide your best defense.

Ricoh Legal. ediscovery and Document Solutions. Powerful document services provide your best defense. Ricoh Lega ediscovery and Document Soutions Powerfu document services provide your best defense. Our peope have aways been at the heart of our vaue proposition: our experience in your industry, commitment

More information

Vendor Performance Measurement Using Fuzzy Logic Controller

Vendor Performance Measurement Using Fuzzy Logic Controller The Journa of Mathematics and Computer Science Avaiabe onine at http://www.tjmcs.com The Journa of Mathematics and Computer Science Vo.2 No.2 (2011) 311-318 Performance Measurement Using Fuzzy Logic Controer

More information