Adaptive Queue Management with Restraint on Non-Responsive Flows

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "Adaptive Queue Management with Restraint on Non-Responsive Flows"

Transcription

1 Adaptive Queue Management wi Restaint on Non-Responsive Flows Lan Li and Gyungho Lee Depatment of Electical and Compute Engineeing Univesity of Illinois at Chicago 85 S. Mogan Steet Chicago, IL 667 {lli, ABSTRACT This pape poposes an adaptive queue management scheme (adaptive RED) to impove Random Ealy Detection (RED) on estaining non-esponsive flows. Due to a lack of flow contol mechanism, non-esponsive flows can stave esponsive flows fo buffe and bandwid at e gateway. In ode to solve e dispopotionate esouce poblem, RED famewok is modified in is way: on detecting when e non-esponsive flows stave e queue, packet-dop intensity (Max_p in RED) can be adaptively adusted to cub non-esponsive flows fo esouce fai-shaing, such as buffe and bandwid fai-shaing. Based on detection of taffic behavios, intentionally estaining nonesponsive flows is to incease e oughput and decease e dop ate of esponsive flows. Ou expeimental esults based on adaptive RED shows at e enhancement of esponsive taffic and e bette shaing of buffe and bandwid can be achieved unde a vaiety of taffic scenaios. Keywods Active queue management, dop pobability, non-esponsive flows, adaptive RED.. INTRODUCTION Congestion contol heteogeneity in e Intenet leads to fainess poblems of esouce shaing. Especially, non-esponsive flows do not back off ei tansmission ates in esponse to congestion indications of e netwok (i.e. packet loss) [5]. Consequently, non-esponsive flows tend to consume unfaily esouce high bandwid and buffe space [6] at congestion points. A lage numbe of UDP-based applications geneate is kind of flows. It is necessay to employ a flow management mechanism fo e fai utilization of netwok esouce. It may also be helpful to satisfy moe uses QOS equiement. Thee ae two kinds of flow management mechanisms at ty to achieve e esouce fai shaing: scheduling scheme and queue management scheme. Scheduling schemes have geneally too much complexity and low scalability to lage numbe of flows. If we plan to povide fai utilization on high-speed edge oute, queue management scheme could be a bette choice. Queue management scheme not only has less complexity, but also appoximates fainess bette. Route wi a queue management scheme maintains a single FIFO shaed by all flows [] and employs a dopping algoim to discad aiving packets when congestion builds up. Dopping pobability inceases wi e aise of congestion level. By adusting dopping pobability fo in-queue flows, it can achieve a bette fainess fo e esouce utilization between flows. One of classic queue management schemes is Random Ealy Detection (RED). The RED utilizes a andom dopping algoim [4]. In a RED gateway, incipient congestions ae detected by estimated aveage queue size. Aveage queue size is calculated via a low-pass filte. When e aveage queue size exceeds a peset eshold, e gateway dops packets wi a cetain pobability at is calculated based on e aveage queue size. In e RED gateway, occasional busts of packets in e queue ae allowed and aveage queue size is kept at low level [6]. Alough RED deceases loss-bias against esponsive taffic at exists in e Dop Tail queue, it does not achieve a faishae of e buffe and bandwid between esponsive flows and non-esponsive flows []. One possible eason is at given a cetain time slot e pecentage of packets dopped fom each flow is almost e same. As a esult, non-esponsive flows may consume a lage potion of e bandwid at congestion points because of its lack of flow contol mechanism [3]. Consequently, non-esponsive flows can stave out e esponsive flows. In ode to solve e dispopotionate esouce poblem, seveal vaiants of RED have been poposed, such as Flow Random Ealy Dop (FRED) [7], Refined Design of Random Ealy Detection Gateways [6] and uing RED Gateway [9]. Howeve, FRED maintains exta flow state which inceases implementation ovehead. As fo e Refined Design of RED, it dynamically adusts e Wq (queue weight) and Max_p (maximum dop pobability) wi espect to e vaiance of queue size change. Howeve, it divides e aea between minimal eshold and maximal eshold, called Yellow aea [4], into seveal sub-phases at inceases implementation ovehead as well. In addition, it still does not conside e fai shaing of e buffe and bandwid between esponsive flows and non-esponsive flows. uing RED Gateway also employs an adaptive paameteization at RED gateway. Wiout consideing non-esponsive taffic, adaptive paameteization is only based on e congestion level indicated by e aveage queue leng. It can effectively adapt to taffic scenaios wi diffeent congestion levels. Howeve, it does not distinguish esponsive and non-esponsive taffic. In some cases of medium congestion, esponsive taffic may get suffeed due to e unfiendly behavios of non-esponsive taffic. If we can distinguish non-esponsive flows fom esponsive flows, a esouce fai-shaing between em can be popely managed. Unfotunately, any meods based on pe-flow state must incease e implementation ovehead. Howeve, we ae awae of e appoaches at ty to appoximately discen nonesponsive flow and esponsive flow accoding to cetain taffic featues [5]. Such a featue could be an extaodinay high congestion o an impope eaction to congestion notification. 4 SYSTEMICS, CYBERNETICS AND INFORMATICS VOLUME - NUMBER 6

2 We en popose to detect flow s behavio based on e vaiance of instantaneous queue size. Based on e detection, we can penalize non-esponsive flows and impoves esponsive flows oughput via adaptive adustment of e dop pobability. The est of e pape is oganized as follows. Section pesents flow behavios in conunction wi e RED queue and notes some flaws of RED algoim. Section 3, descibes ou poposed queue management scheme Adaptive RED wi estaint on non-esponsive flows. In Section 4, we compae ou appoach wi oe schemes via simulation. Finally, we give discusses and conclusions in Section 5.. RED Scheme Oveview. BACKGROUND RED (Random Ealy Detection) is a congestion avoidance mechanism employed at gateways. Its basic idea is to use two peset esholds to detect incipient congestion and contol e aveage queue size wi e eshold []. Wi espect to e estimated aveage queue size, e gateway woks in one of ee woking states: ed, geen and yellow states [6]. When e aveage queue size is less an e Min_ (minimum eshold), e gateway woks in e geen state wiout packet dop. When e leng is between e Min_ and Max_ (maximum eshold), e state tansfes to yellow one in which aiving packets ae andomly dopped wi a pobability calculated on aveage queue leng. When e leng goes beyond e maximum eshold, e gateway eaches e ed state in which evey aiving packet is discaded [6]. The goal of RED scheme is to detect incipient congestion via aveage queue size and pefom andom packet dopping befoe e queue is full. Theefoe, it can implement congestion avoidance while allowing shot-tem busty. Alough RED pevents packets fom consecutive dopping (especially fo busty taffic) and emoves highe loss bias against busty taffic [4], it still has some flaws:. RED is unable to efain non-esponsive flows fom consuming most buffe space at heavy congestion [3].. Aveage queue size is not a good estimato of congestion. Sevee congestion should be elated to e amount of flows and e degee of bustiness []. 3. It is not clea how to select e RED paametes. RED equies selecting vaious paametes in diffeent congestion scenaios. That is why ecommended values had been changed ove time [].. Flow Behavios in e RED Queue Geneally speaking, most of TCP flows wi congestion contol ae egaded as esponsive flows, while UDP flows wiout congestion esponse ae consideed non-esponsive flows [5]. TCP congestion contol utilizes an Additive Incease/Multiplicative Decease mechanism to adust e flow ate [8]. This mechanism causes e bustiness of TCP flows. Since TCP congestion contol is based on end-to-end feedback, e contol esponse is elatively sluggish in compaison wi queue opeation. It implies at TCP would keep e sending ate fo a while afte packet dopping. The contol latency is equal to e TCP timeout, which is usually fou times as much as RRT (Round Tip Time) [8]. On e oe hand, nonesponsive flows have no congestion contol mechanism. They do not espond to congestion notification and us send packets as many as ey want. At e RED-suite gateways, TCP flows (esponsive flow) tend to decease sending ate afte aveage queue size goes beyond e minimal eshold. Howeve, RED does not penalize nonesponsive flow, because packet dop atio of each flow ove time is almost same. Alough UDP flows (non-esponsive flow) wi high bandwid may suffe moe packet dopping, ey obtain much moe oughput an TCP flows do. Consequently, non-esponsive flows may take up e most bandwid and stave out esponsive flows [3]. Since RED uses static paametes to deal wi dynamic taffic, e effectiveness of RED depends on e appopiate paameteization. It is known at no single set of RED paametes woks well unde diffeent congestion scenaios, including e case at TCP is mixed wi UDP Total (including CBR UDP flows, 5k each) Max_p 4 (a) Two 5k UDP flows ae mixed wi TCP flows Total (including CBR UDP flows, k each) Max_p (b) Two k UDP flows ae mixed wi TCP flows Figue. TCP loss ate vs. Max_p Simulation esult in Figue shows at e total loss ate is petty high fo e small Max_p. As Max_p inceases, loss ate deceases since e RED queue is able to send congestion notification back to e souces in time to pevent continuous buffe oveflow. Finally, when Max_p becomes quite lage, e RED queue causes an incease in packet loss ates ove Dop Tail queues. As moe connections ae added, e optimal value of Max_p inceases. It clealy suppots at an adaptive scheme fo dop pobability is equied. Moe extensive and detailed discussion can be also found in [9]. The details of e simulation ae fully descibed in Section ADAPTIVE RED WITH RESTRAINT ON NON-RESPONSIVE FLOWS Though TCP flows ae dominant taffic in Intenet, moe and moe multimedia applications tend to geneate UDP flows, mostly belonging to non-esponsive flows. It is because ose SYSTEMICS, CYBERNETICS AND INFORMATICS VOLUME - NUMBER 6 4

3 applications mainly concen e delay constaint instead of data integity. It is necessay to deploy a flow management mechanism to implement a fai utilization of netwok esouce. Dop Pobability 3. Basic assumption Given at packet-pocessing ate is invaiable (sevice ate: S ) and non-esponsive flows have e aival ate R non (t), e instant queue size is detemined by: t Q inst ( t ) = ( R non ( t ) + R ep ( t ) S ) dt () t i, whee R ep (t) is e aival ate of esponsive flows; t i is e initialization time. The aveage ate of n TCP-fiendly flows (esponsive flow) can be appoximately calculated as []: n 3 packets ep = RTT p second (), whee RTT is e ound tip time and p is e loss pobability of flow. It is applicable only when e p is small. Accoding to e Eq. (), given a small time slot T wi e size of t, change in queue size is mainly detemined by e aival ate of flows: Qinst ( τ ) Rnon( τ ) + Rep( τ ) S t Consideing two consecutive slots T and T wi e same + size t, e vaiance of aival ate ( = non + ep ) can be appoximated by: Qinst ( τ + ) Qinst ( τ ) t, wheeτ T andτ + T (3) + Suppose ep is e aveage aival ates of esponsive flows at slot T and t RTT, extending Eq. () e vaiance of esponsive flows aival ate p ep ( ) ep p + (4), whee p and p + ae dop pobability at T and T RED Queue Analysis The vey impotant featue of RED algoim is e use of a low-pass filte to estimate e aveage queue size [6]. The lowpass filte employs e EWMA (exponentially-weighted moving aveage) given by [4]: Q ave = ( wq ) Qave' + wqqinst,whee w is e weight facto. q Q ave and Q ave ' ae e cuent and pevious aveage queue size espectively. Figue shows e dop function of RED. Dop ate of RED is pesented by:, Qave < Min_ (5) Qave Min_ Ded = Max_ p, Min_ Qave < Max_ Max_ Min_, Max_ Qave Extending Eq. (4), we can have: τ Qave ( ) Min _ ep ( ) ep Qave ( τ + ) Min _ (6) Max_p Min_ Max_ Q ave Figue. Dop function of RED The tendency of esponsive flows can be detected via Qave ( Qave = Qave ( τ + ) Qave ( τ )). When Q ave inceases to e yellow state [], ep should decease accodingly. Howeve, if non gets invese tendency at at time, e aival ate of all flows ( ) inceases. It causes esponsive flows staved and esouce unfaily shaed. 3.3 Adaptive RED Scheme Adaptive RED is poposed to detect non-esponsive (unfiendly) flow behavios via monitoing e vaiation of queue leng, including instant and aveage queue leng. At congestion, esponsive flows decease its ate while non-esponsive flows may keep o incease e ate. Theefoe, adaptively adusting packet-dop intensity may estain non-esponsive flows to stave esponsive flows. We apply is adaptive scheme only if e aveage queue leng anging fom Mid_ ((Min_+Max_)/) to Max_. In at medium congestion aea, esponsive flows ust get essential suffeing and take deep congestion esponse. Based on ou assumption and analysis in Section 3. and 3., Q ave indicates e tendency of esponsive flows and Q ins ( ) eflects e vaiation of aival Q = Q ( τ ) Q ( τ ) inst inst + inst ate. If bo of em ae positive, must be positive non too. It implies non-esponsive flows take unfiendly esponse against esponsive flows and e atio of non-esponsive flows and esponsive flows gets inceased. At at time, unfai esouce shaing happens and e adustment of dop density is needed. In ode to avoid too aggessive of packet dopping, dop density needs to be adusted back once e condition is not satisfied ( Q inst < Qave < ). We en popose ou algoim as follows: Evey T (contol slot): While ( Max_ > Qave > Mid_) if Q inst > & Qave > Max_p = Max_p*α else Max_p =Min (Max_p, Max_p/α) Max_p : Default Max_p α: e scale facto of Max_p α is e scale facto to extend e Max_p. Max_p is e peset paamete of dop density. Based on e obsevation of Q ave and Q inst, e algoim detects unfiendly taffic 4 SYSTEMICS, CYBERNETICS AND INFORMATICS VOLUME - NUMBER 6

4 behavios and modulates e value of Max_p by e facto of α. The paametesα is expeimentally chosen accoding to e contol slot (T) which detemines e contol sensitivity. If contol slot is too small, ee is no enough time fo esponsive flows to esponse and e scheme may become moe aggessive and cause contol oscillation. On e oe hand, it may become insensitive and cause contol sluggishness. In e simulation, we chose contol time slot as.s (aveage RTT). This slot size can accommodate e shot bustiness and avoid e contol vibation. 4. SIMULATION RESULTS This section pesents e simulation esults of Adaptive RED s pefomance wi efaining of non-esponsive flows and enhancing e esponsive flows. The simulations ange ove netwok configuations and taffic pattens. 4. Basic netwok uation Netwok simulation topology is shown in Figue 3. Thee is a single congested link fom GW to GW in a dumbbell topology. The congested link is Mbps; oes ae Mbps each. TCP and UDP flows pass ough e congested link. The numbe of TCP flows anges fom 8 to 3, while at of UDP flows anges fom to 8. Thee active queue management schemes: RED, ue and ae applied on e bottleneck link. Node Mb 6ms Node 3 Mb 4ms Node Mb 3ms RED/ / SC GW Mb ms GW Mb ms Node 4 Mb 5ms Mb ms Mb 3ms Node 5 Mb 4ms Node 8 Node 6 Node 7 Figue 3. Topology of e Simulation To compae wi RED and schemes, a popula simulation envionment of RED-suite gateway is chosen and descibed in Table and Table. The physical queue capacity is set to 3 packets. Following [4], we set Min_ to packets, and set Max_ to be twice as e Min_. RED is simulated wi NS s default value of W q =. and.. Paametes fo ae efeed to [6] in which α=3 and β=. We expeimentally select T as.s and α as.5 to. In ode to ceate non-esponsive behavios, UDP flows fo all schemes ae chosen as exponential type wi a packet size of bytes. Queue Capacity 3 Packets Min_ Packets Max_ Packets αfo.5 T (Contol slot). s W q and Max_p fo RED. and. αβfo 3 and Table. Gateway Paametes TCP window size 5 UDP packet-size TCP packet-size UDP Type Exponential TCP Type UDP ate 4. Simulation Results FTP taffic.5 Mbps Table. Flow Paametes ) The oughput of RED, and Adaptive RED espectively TCP Thoughput (Wiout UDP Taffic) (a) Pue TCP flows TCP Thoughput (Wi UDP flows, 5k each) (b) Mixing wi UDP flows TCP Thoughput (Wi 4 UDP flows, 5k each) (c) Mixing wi 4 UDP flows TCP Thoughput (Wi 8 UDP flows, 5k each) (d) Mixing wi 8 UDP flows Figue 4. TCP Thoughput Pefomance SYSTEMICS, CYBERNETICS AND INFORMATICS VOLUME - NUMBER 6 43

5 ) TCP of ee schemes TCP (Wiout UDP Taffic) (a) Pue TCP flows TCP (Wi UDP flows, 5k each) (b) Mixing wi UDP flows TCP (Wi 4 UDP flows, 5k each) (c) Mixing wi 4 UDP flows T CP (Wi 8 UDP flows, 5k each) (d) Mixing wi 8 UDP flows Figue 5. TCP 3) Restaint on unfiendly non-esponsive taffic by. Aival ate atio (8 TCP wi UDP) (a) 8 TCP flows mixing wi UDP flows Map_p Map_p Aival ate atio Aival ate atio Aival ate atio (8 TCP wi 4 UDP) Map_p Map_p (b) 8 TCP flows mixing wi 4 UDP flows.5.5 (3 TCP wi UDP) Map_p Map_p (c) 3 TCP flows mixing wi UDP flows. (3 TCP wi 4 UDP) Map_p Map_p (d) 3 TCP flows mixing wi 4 UDP flows Figue 6. Aival Rate Ratio of UDP flows TCP oughput is shown in Figue 4. Compaed wi RED and, scheme has compehend-sively bette pefomance. In case of pue TCP (Figue 4(a)), scheme shows slightly bette. It is because adusts dop density only accoding to e congestion level. To do so can help avoid heavy and shot congestion caused by a lage numbe of TCP flows. When a lage numbe of TCP flows mix wi big UDP taffic (Figue 4(d)), scheme becomes e wost one. Accoding to e algoim, Max_p of may always be kept in a big value, if aveage queue leng fluctuates aound Max_ [9]. Such adustment to Max_p may be so aggessive at TCP suffes moe an UDP, since UDP flows always ovewhelm TCP flows so at e bandwid eleased fom TCP is taken ove by UDP. Coesponding TCP loss ate is shown in Figue 5. Basically, e decease of TCP dop ate indicates e impovement of TCP oughput. It implies at helps TCP flows scamble fo bandwid fom UDP flows. It makes esponsive flows be enhanced. Howeve, it can be found at a little bit lowe pefomance an RED is pesented when a lage numbe of TCP and UDP flows ae mixed (3 TCP flows in Figue 5(d)). The eason may be at wi sevee and continuous congestion, has less space to opeate so at it may misdetect nonesponsive behavios. The simila poblem would be found in e simulations of moe UDP flows. Howeve, ee is no need 44 SYSTEMICS, CYBERNETICS AND INFORMATICS VOLUME - NUMBER 6

6 to discuss ose cases because of vey sevee congestion and intoleable dop atio (beyond 3%). Those cases should be in system poblem and cannot be solved ust by queue management schemes. Figue 6 shows e effectiveness of. We sampled e aival ate atio of UDP flows ( non ) evey.5s. Most dop density adustments ae made when UDP flows occupy moe an half of e bandwid. At at time, moe UDP packets ae dopped via inceasing Max_p. In addition, adusts Max_p only when e aveage queue leng goes beyond Mid_. Theefoe, effectively efains non-esponsive taffic behavios and enhances esponsive ones as well. We would not list e simulation esult of Mixed taffic wi 6 and 8 UDP flows, because e esult does not mean much if UDP flows always ovewhelm TCP flows. As a conclusion, keeps esponsive flows moe adaptively an RED and do. It also has bette oughput pefomance and can adapt to a wide vaiety of taffic scenaios. Gateways fo Congestion Avoidance, IEEE/ACM Tansactions on Netwoking, (4), 993, [5] S. Floyd, and K. Fall, Pomoting e Use of End-to-end Congestion Contol in e Intenet, IEEE/ACM Tansactions on Netwoking, 7(4), 999, [6] H. Wang and K. G. Shin, Refined Design of Random Ealy Detection Gateways, Poc. IEEE GlobeCom, Rio de Janeio, Bazil, 999, [7] D. Lin and R. Mois, Dynamics of Random Ealy Detection, Poc. ACM SIGCOMM, Cannes, Fance, 997, [8] W. Stevens, TCP/IP illustated, Volume : e potocols (Reading, MA: Addison-Wesley, 994) [9] W. Feng, D. Kandlu, D. Saha, K. Shin, A configuing RED Gateway, Poc. IEEE INFOCOM, New Yok, NY, 999, [] J. Padhye, V. Fioiu, D. Towsley and J. Kuose, Modeling TCP Thoughput: A Simple Model and Its Empiical Validation, Poc. ACM SIGCOMM, Vancouve, Canada, 998, DISCUSSIONS AND CONCLUSION We only applied to exponential UDP taffic in ou simulation because of its simplicity and typical non-esponsive featue. Wi egad to e basis of scheme, any unfiendly non-esponsive taffic can be detected and efained by, such as DDOS attack flows. Though DDOS attack may geneate TCP flows, e congestion mechanism does not wok. The attack taffic shows absolutely non-esponsive behavios. has geat chance to detect and estain it. We can also adaptively adust paamete of α so at can fit well wi e diffeent degee of non-esponsive behavios. It is expected at α is evised accoding to e diffeence between and. ep This pape has shown how adaptive active queue management can be used in conunction wi RED gateway to effectively enhance esponsive behavios. Peliminay simulation esults wi a popula envionment have shown e efficacy of e algoim. If e inteactions among diffeent flows ae fully undestood and contol paametes ae well optimized, moe pefomance impovement can be expected in an extensive eseach. Since e netwoks ae becoming moe heteogeneous, is scheme should adapt to moe extensive taffic. How to impove e scalability is ou futue wok. 6. REFERENCES [] W. Feng, K. G. Shin, D. Kandlu, and D. Saha, Stochastic Fai Blue: A Queue Management Algoim fo Enfocing Fainess, Poc. IEEE INFOCOM, Anchoage, AK,, [] T. Bonald, M. May and J. Bolot, Analytic Evaluation of RED Pefomance, Poc. IEEE INFOCOM, Tel Aviv, Isael,, [3] R. Pan, B. Pabhaka, K. Psounis, CHOKE: A Stateless Active Queue Management Scheme fo Appoximating Fai Bandwid Allocation, Poc. IEEE INFOCOM, Tel Aviv, Isael,, [4] S. Floyd, and V. Jacobson, Random Ealy Detection SYSTEMICS, CYBERNETICS AND INFORMATICS VOLUME - NUMBER 6 45

Effect of Contention Window on the Performance of IEEE 802.11 WLANs

Effect of Contention Window on the Performance of IEEE 802.11 WLANs Effect of Contention Window on the Pefomance of IEEE 82.11 WLANs Yunli Chen and Dhama P. Agawal Cente fo Distibuted and Mobile Computing, Depatment of ECECS Univesity of Cincinnati, OH 45221-3 {ychen,

More information

ON THE (Q, R) POLICY IN PRODUCTION-INVENTORY SYSTEMS

ON THE (Q, R) POLICY IN PRODUCTION-INVENTORY SYSTEMS ON THE R POLICY IN PRODUCTION-INVENTORY SYSTEMS Saifallah Benjaafa and Joon-Seok Kim Depatment of Mechanical Engineeing Univesity of Minnesota Minneapolis MN 55455 Abstact We conside a poduction-inventoy

More information

Questions & Answers Chapter 10 Software Reliability Prediction, Allocation and Demonstration Testing

Questions & Answers Chapter 10 Software Reliability Prediction, Allocation and Demonstration Testing M13914 Questions & Answes Chapte 10 Softwae Reliability Pediction, Allocation and Demonstation Testing 1. Homewok: How to deive the fomula of failue ate estimate. λ = χ α,+ t When the failue times follow

More information

Software Engineering and Development

Software Engineering and Development I T H E A 67 Softwae Engineeing and Development SOFTWARE DEVELOPMENT PROCESS DYNAMICS MODELING AS STATE MACHINE Leonid Lyubchyk, Vasyl Soloshchuk Abstact: Softwae development pocess modeling is gaining

More information

An Approach to Optimized Resource Allocation for Cloud Simulation Platform

An Approach to Optimized Resource Allocation for Cloud Simulation Platform An Appoach to Optimized Resouce Allocation fo Cloud Simulation Platfom Haitao Yuan 1, Jing Bi 2, Bo Hu Li 1,3, Xudong Chai 3 1 School of Automation Science and Electical Engineeing, Beihang Univesity,

More information

est using the formula I = Prt, where I is the interest earned, P is the principal, r is the interest rate, and t is the time in years.

est using the formula I = Prt, where I is the interest earned, P is the principal, r is the interest rate, and t is the time in years. 9.2 Inteest Objectives 1. Undestand the simple inteest fomula. 2. Use the compound inteest fomula to find futue value. 3. Solve the compound inteest fomula fo diffeent unknowns, such as the pesent value,

More information

Efficient Redundancy Techniques for Latency Reduction in Cloud Systems

Efficient Redundancy Techniques for Latency Reduction in Cloud Systems Efficient Redundancy Techniques fo Latency Reduction in Cloud Systems 1 Gaui Joshi, Emina Soljanin, and Gegoy Wonell Abstact In cloud computing systems, assigning a task to multiple seves and waiting fo

More information

HEALTHCARE INTEGRATION BASED ON CLOUD COMPUTING

HEALTHCARE INTEGRATION BASED ON CLOUD COMPUTING U.P.B. Sci. Bull., Seies C, Vol. 77, Iss. 2, 2015 ISSN 2286-3540 HEALTHCARE INTEGRATION BASED ON CLOUD COMPUTING Roxana MARCU 1, Dan POPESCU 2, Iulian DANILĂ 3 A high numbe of infomation systems ae available

More information

Comparing Availability of Various Rack Power Redundancy Configurations

Comparing Availability of Various Rack Power Redundancy Configurations Compaing Availability of Vaious Rack Powe Redundancy Configuations By Victo Avela White Pape #48 Executive Summay Tansfe switches and dual-path powe distibution to IT equipment ae used to enhance the availability

More information

INITIAL MARGIN CALCULATION ON DERIVATIVE MARKETS OPTION VALUATION FORMULAS

INITIAL MARGIN CALCULATION ON DERIVATIVE MARKETS OPTION VALUATION FORMULAS INITIAL MARGIN CALCULATION ON DERIVATIVE MARKETS OPTION VALUATION FORMULAS Vesion:.0 Date: June 0 Disclaime This document is solely intended as infomation fo cleaing membes and othes who ae inteested in

More information

STUDENT RESPONSE TO ANNUITY FORMULA DERIVATION

STUDENT RESPONSE TO ANNUITY FORMULA DERIVATION Page 1 STUDENT RESPONSE TO ANNUITY FORMULA DERIVATION C. Alan Blaylock, Hendeson State Univesity ABSTRACT This pape pesents an intuitive appoach to deiving annuity fomulas fo classoom use and attempts

More information

Chapter 3 Savings, Present Value and Ricardian Equivalence

Chapter 3 Savings, Present Value and Ricardian Equivalence Chapte 3 Savings, Pesent Value and Ricadian Equivalence Chapte Oveview In the pevious chapte we studied the decision of households to supply hous to the labo maket. This decision was a static decision,

More information

Modeling and Verifying a Price Model for Congestion Control in Computer Networks Using PROMELA/SPIN

Modeling and Verifying a Price Model for Congestion Control in Computer Networks Using PROMELA/SPIN Modeling and Veifying a Pice Model fo Congestion Contol in Compute Netwoks Using PROMELA/SPIN Clement Yuen and Wei Tjioe Depatment of Compute Science Univesity of Toonto 1 King s College Road, Toonto,

More information

Comparing Availability of Various Rack Power Redundancy Configurations

Comparing Availability of Various Rack Power Redundancy Configurations Compaing Availability of Vaious Rack Powe Redundancy Configuations White Pape 48 Revision by Victo Avela > Executive summay Tansfe switches and dual-path powe distibution to IT equipment ae used to enhance

More information

Hubs, Bridges, and Switches

Hubs, Bridges, and Switches Hubs, Bidges, and Switches Used fo extending LANs in tems of geogaphical coveage, numbe of nodes, administation capabilities, etc. Diffe in egads to: m collision domain isolation m laye at which they opeate

More information

AN IMPLEMENTATION OF BINARY AND FLOATING POINT CHROMOSOME REPRESENTATION IN GENETIC ALGORITHM

AN IMPLEMENTATION OF BINARY AND FLOATING POINT CHROMOSOME REPRESENTATION IN GENETIC ALGORITHM AN IMPLEMENTATION OF BINARY AND FLOATING POINT CHROMOSOME REPRESENTATION IN GENETIC ALGORITHM Main Golub Faculty of Electical Engineeing and Computing, Univesity of Zageb Depatment of Electonics, Micoelectonics,

More information

Cloud Service Reliability: Modeling and Analysis

Cloud Service Reliability: Modeling and Analysis Cloud Sevice eliability: Modeling and Analysis Yuan-Shun Dai * a c, Bo Yang b, Jack Dongaa a, Gewei Zhang c a Innovative Computing Laboatoy, Depatment of Electical Engineeing & Compute Science, Univesity

More information

Tracking/Fusion and Deghosting with Doppler Frequency from Two Passive Acoustic Sensors

Tracking/Fusion and Deghosting with Doppler Frequency from Two Passive Acoustic Sensors Tacking/Fusion and Deghosting with Dopple Fequency fom Two Passive Acoustic Sensos Rong Yang, Gee Wah Ng DSO National Laboatoies 2 Science Pak Dive Singapoe 11823 Emails: yong@dso.og.sg, ngeewah@dso.og.sg

More information

An Epidemic Model of Mobile Phone Virus

An Epidemic Model of Mobile Phone Virus An Epidemic Model of Mobile Phone Vius Hui Zheng, Dong Li, Zhuo Gao 3 Netwok Reseach Cente, Tsinghua Univesity, P. R. China zh@tsinghua.edu.cn School of Compute Science and Technology, Huazhong Univesity

More information

The transport performance evaluation system building of logistics enterprises

The transport performance evaluation system building of logistics enterprises Jounal of Industial Engineeing and Management JIEM, 213 6(4): 194-114 Online ISSN: 213-953 Pint ISSN: 213-8423 http://dx.doi.og/1.3926/jiem.784 The tanspot pefomance evaluation system building of logistics

More information

Energy Efficient Cache Invalidation in a Mobile Environment

Energy Efficient Cache Invalidation in a Mobile Environment Enegy Efficient Cache Invalidation in a Mobile Envionment Naottam Chand, Ramesh Chanda Joshi, Manoj Misa Electonics & Compute Engineeing Depatment Indian Institute of Technology, Rookee - 247 667. INDIA

More information

Concept and Experiences on using a Wiki-based System for Software-related Seminar Papers

Concept and Experiences on using a Wiki-based System for Software-related Seminar Papers Concept and Expeiences on using a Wiki-based System fo Softwae-elated Semina Papes Dominik Fanke and Stefan Kowalewski RWTH Aachen Univesity, 52074 Aachen, Gemany, {fanke, kowalewski}@embedded.wth-aachen.de,

More information

IBM Research Smarter Transportation Analytics

IBM Research Smarter Transportation Analytics IBM Reseach Smate Tanspotation Analytics Laua Wynte PhD, Senio Reseach Scientist, IBM Watson Reseach Cente lwynte@us.ibm.com INSTRUMENTED We now have the ability to measue, sense and see the exact condition

More information

9:6.4 Sample Questions/Requests for Managing Underwriter Candidates

9:6.4 Sample Questions/Requests for Managing Underwriter Candidates 9:6.4 INITIAL PUBLIC OFFERINGS 9:6.4 Sample Questions/Requests fo Managing Undewite Candidates Recent IPO Expeience Please povide a list of all completed o withdawn IPOs in which you fim has paticipated

More information

An Analysis of Manufacturer Benefits under Vendor Managed Systems

An Analysis of Manufacturer Benefits under Vendor Managed Systems An Analysis of Manufactue Benefits unde Vendo Managed Systems Seçil Savaşaneil Depatment of Industial Engineeing, Middle East Technical Univesity, 06531, Ankaa, TURKEY secil@ie.metu.edu.t Nesim Ekip 1

More information

Automatic Testing of Neighbor Discovery Protocol Based on FSM and TTCN*

Automatic Testing of Neighbor Discovery Protocol Based on FSM and TTCN* Automatic Testing of Neighbo Discovey Potocol Based on FSM and TTCN* Zhiliang Wang, Xia Yin, Haibin Wang, and Jianping Wu Depatment of Compute Science, Tsinghua Univesity Beijing, P. R. China, 100084 Email:

More information

Electricity transmission network optimization model of supply and demand the case in Taiwan electricity transmission system

Electricity transmission network optimization model of supply and demand the case in Taiwan electricity transmission system Electicity tansmission netwok optimization model of supply and demand the case in Taiwan electicity tansmission system Miao-Sheng Chen a Chien-Liang Wang b,c, Sheng-Chuan Wang d,e a Taichung Banch Gaduate

More information

An application of stochastic programming in solving capacity allocation and migration planning problem under uncertainty

An application of stochastic programming in solving capacity allocation and migration planning problem under uncertainty An application of stochastic pogamming in solving capacity allocation and migation planning poblem unde uncetainty Yin-Yann Chen * and Hsiao-Yao Fan Depatment of Industial Management, National Fomosa Univesity,

More information

High Availability Replication Strategy for Deduplication Storage System

High Availability Replication Strategy for Deduplication Storage System Zhengda Zhou, Jingli Zhou College of Compute Science and Technology, Huazhong Univesity of Science and Technology, *, zhouzd@smail.hust.edu.cn jlzhou@mail.hust.edu.cn Abstact As the amount of digital data

More information

An Infrastructure Cost Evaluation of Single- and Multi-Access Networks with Heterogeneous Traffic Density

An Infrastructure Cost Evaluation of Single- and Multi-Access Networks with Heterogeneous Traffic Density An Infastuctue Cost Evaluation of Single- and Multi-Access Netwoks with Heteogeneous Taffic Density Andes Fuuskä and Magnus Almgen Wieless Access Netwoks Eicsson Reseach Kista, Sweden [andes.fuuska, magnus.almgen]@eicsson.com

More information

Data Center Demand Response: Avoiding the Coincident Peak via Workload Shifting and Local Generation

Data Center Demand Response: Avoiding the Coincident Peak via Workload Shifting and Local Generation (213) 1 28 Data Cente Demand Response: Avoiding the Coincident Peak via Wokload Shifting and Local Geneation Zhenhua Liu 1, Adam Wieman 1, Yuan Chen 2, Benjamin Razon 1, Niangjun Chen 1 1 Califonia Institute

More information

Over-encryption: Management of Access Control Evolution on Outsourced Data

Over-encryption: Management of Access Control Evolution on Outsourced Data Ove-encyption: Management of Access Contol Evolution on Outsouced Data Sabina De Capitani di Vimecati DTI - Univesità di Milano 26013 Cema - Italy decapita@dti.unimi.it Stefano Paaboschi DIIMM - Univesità

More information

Channel selection in e-commerce age: A strategic analysis of co-op advertising models

Channel selection in e-commerce age: A strategic analysis of co-op advertising models Jounal of Industial Engineeing and Management JIEM, 013 6(1):89-103 Online ISSN: 013-0953 Pint ISSN: 013-843 http://dx.doi.og/10.396/jiem.664 Channel selection in e-commece age: A stategic analysis of

More information

Self-Adaptive and Resource-Efficient SLA Enactment for Cloud Computing Infrastructures

Self-Adaptive and Resource-Efficient SLA Enactment for Cloud Computing Infrastructures 2012 IEEE Fifth Intenational Confeence on Cloud Computing Self-Adaptive and Resouce-Efficient SLA Enactment fo Cloud Computing Infastuctues Michael Maue, Ivona Bandic Distibuted Systems Goup Vienna Univesity

More information

Financial Planning and Risk-return profiles

Financial Planning and Risk-return profiles Financial Planning and Risk-etun pofiles Stefan Gaf, Alexande Kling und Jochen Russ Pepint Seies: 2010-16 Fakultät fü Mathematik und Witschaftswissenschaften UNIERSITÄT ULM Financial Planning and Risk-etun

More information

Chapter 2 Valiant Load-Balancing: Building Networks That Can Support All Traffic Matrices

Chapter 2 Valiant Load-Balancing: Building Networks That Can Support All Traffic Matrices Chapte 2 Valiant Load-Balancing: Building etwoks That Can Suppot All Taffic Matices Rui Zhang-Shen Abstact This pape is a bief suvey on how Valiant load-balancing (VLB) can be used to build netwoks that

More information

A Comparative Analysis of Data Center Network Architectures

A Comparative Analysis of Data Center Network Architectures A Compaative Analysis of Data Cente Netwok Achitectues Fan Yao, Jingxin Wu, Guu Venkataamani, Suesh Subamaniam Depatment of Electical and Compute Engineeing, The Geoge Washington Univesity, Washington,

More information

An Introduction to Omega

An Introduction to Omega An Intoduction to Omega Con Keating and William F. Shadwick These distibutions have the same mean and vaiance. Ae you indiffeent to thei isk-ewad chaacteistics? The Finance Development Cente 2002 1 Fom

More information

Scheduling Hadoop Jobs to Meet Deadlines

Scheduling Hadoop Jobs to Meet Deadlines Scheduling Hadoop Jobs to Meet Deadlines Kamal Kc, Kemafo Anyanwu Depatment of Compute Science Noth Caolina State Univesity {kkc,kogan}@ncsu.edu Abstact Use constaints such as deadlines ae impotant equiements

More information

A framework for the selection of enterprise resource planning (ERP) system based on fuzzy decision making methods

A framework for the selection of enterprise resource planning (ERP) system based on fuzzy decision making methods A famewok fo the selection of entepise esouce planning (ERP) system based on fuzzy decision making methods Omid Golshan Tafti M.s student in Industial Management, Univesity of Yazd Omidgolshan87@yahoo.com

More information

Avoided emissions kgco 2eq /m 2 Reflecting surfaces 130

Avoided emissions kgco 2eq /m 2 Reflecting surfaces 130 ANALYSIS OF GLOBAL WARMING MITIGATION BY WHITE REFLECTING SURFACES Fedeico Rossi, Andea Nicolini Univesity of Peugia, CIRIAF Via G.Duanti 67 0615 Peugia, Italy T: +9-075-585846; F: +9-075-5848470; E: fossi@unipg.it

More information

How to recover your Exchange 2003/2007 mailboxes and emails if all you have available are your PRIV1.EDB and PRIV1.STM Information Store database

How to recover your Exchange 2003/2007 mailboxes and emails if all you have available are your PRIV1.EDB and PRIV1.STM Information Store database AnswesThatWok TM Recoveing Emails and Mailboxes fom a PRIV1.EDB Exchange 2003 IS database How to ecove you Exchange 2003/2007 mailboxes and emails if all you have available ae you PRIV1.EDB and PRIV1.STM

More information

VISCOSITY OF BIO-DIESEL FUELS

VISCOSITY OF BIO-DIESEL FUELS VISCOSITY OF BIO-DIESEL FUELS One of the key assumptions fo ideal gases is that the motion of a given paticle is independent of any othe paticles in the system. With this assumption in place, one can use

More information

Optimizing Content Retrieval Delay for LT-based Distributed Cloud Storage Systems

Optimizing Content Retrieval Delay for LT-based Distributed Cloud Storage Systems Optimizing Content Retieval Delay fo LT-based Distibuted Cloud Stoage Systems Haifeng Lu, Chuan Heng Foh, Yonggang Wen, and Jianfei Cai School of Compute Engineeing, Nanyang Technological Univesity, Singapoe

More information

Reduced Pattern Training Based on Task Decomposition Using Pattern Distributor

Reduced Pattern Training Based on Task Decomposition Using Pattern Distributor > PNN05-P762 < Reduced Patten Taining Based on Task Decomposition Using Patten Distibuto Sheng-Uei Guan, Chunyu Bao, and TseNgee Neo Abstact Task Decomposition with Patten Distibuto (PD) is a new task

More information

Strength Analysis and Optimization Design about the key parts of the Robot

Strength Analysis and Optimization Design about the key parts of the Robot Intenational Jounal of Reseach in Engineeing and Science (IJRES) ISSN (Online): 2320-9364, ISSN (Pint): 2320-9356 www.ijes.og Volume 3 Issue 3 ǁ Mach 2015 ǁ PP.25-29 Stength Analysis and Optimization Design

More information

Performance Analysis of an Inverse Notch Filter and Its Application to F 0 Estimation

Performance Analysis of an Inverse Notch Filter and Its Application to F 0 Estimation Cicuits and Systems, 013, 4, 117-1 http://dx.doi.og/10.436/cs.013.41017 Published Online Januay 013 (http://www.scip.og/jounal/cs) Pefomance Analysis of an Invese Notch Filte and Its Application to F 0

More information

Instituto Superior Técnico Av. Rovisco Pais, 1 1049-001 Lisboa E-mail: virginia.infante@ist.utl.pt

Instituto Superior Técnico Av. Rovisco Pais, 1 1049-001 Lisboa E-mail: virginia.infante@ist.utl.pt FATIGUE LIFE TIME PREDICTIO OF POAF EPSILO TB-30 AIRCRAFT - PART I: IMPLEMETATIO OF DIFERET CYCLE COUTIG METHODS TO PREDICT THE ACCUMULATED DAMAGE B. A. S. Seano 1, V. I. M.. Infante 2, B. S. D. Maado

More information

Review Graph based Online Store Review Spammer Detection

Review Graph based Online Store Review Spammer Detection Review Gaph based Online Stoe Review Spamme Detection Guan Wang, Sihong Xie, Bing Liu, Philip S. Yu Univesity of Illinois at Chicago Chicago, USA gwang26@uic.edu sxie6@uic.edu liub@uic.edu psyu@uic.edu

More information

Evaluating the impact of Blade Server and Virtualization Software Technologies on the RIT Datacenter

Evaluating the impact of Blade Server and Virtualization Software Technologies on the RIT Datacenter Evaluating the impact of and Vitualization Softwae Technologies on the RIT Datacente Chistophe M Butle Vitual Infastuctue Administato Rocheste Institute of Technology s Datacente Contact: chis.butle@it.edu

More information

The Impacts of Congestion on Commercial Vehicle Tours

The Impacts of Congestion on Commercial Vehicle Tours Figliozzi 1 The Impacts of Congestion on Commecial Vehicle Tous Miguel Andes Figliozzi Potland State Univesity Maseeh College of Engineeing and Compute Science figliozzi@pdx.edu 5124 wods + 7 Tables +

More information

Peer-to-Peer File Sharing Game using Correlated Equilibrium

Peer-to-Peer File Sharing Game using Correlated Equilibrium Pee-to-Pee File Shaing Game using Coelated Equilibium Beibei Wang, Zhu Han, and K. J. Ray Liu Depatment of Electical and Compute Engineeing and Institute fo Systems Reseach, Univesity of Mayland, College

More information

30 H. N. CHIU 1. INTRODUCTION. Recherche opérationnelle/operations Research

30 H. N. CHIU 1. INTRODUCTION. Recherche opérationnelle/operations Research RAIRO Rech. Opé. (vol. 33, n 1, 1999, pp. 29-45) A GOOD APPROXIMATION OF THE INVENTORY LEVEL IN A(Q ) PERISHABLE INVENTORY SYSTEM (*) by Huan Neng CHIU ( 1 ) Communicated by Shunji OSAKI Abstact. This

More information

Research on Risk Assessment of the Transformer Based on Life Cycle Cost

Research on Risk Assessment of the Transformer Based on Life Cycle Cost ntenational Jounal of Smat Gid and lean Enegy eseach on isk Assessment of the Tansfome Based on Life ycle ost Hui Zhou a, Guowei Wu a, Weiwei Pan a, Yunhe Hou b, hong Wang b * a Zhejiang Electic Powe opoation,

More information

The Impact of Radio Propagation Models on Ad Hoc Networks Performances

The Impact of Radio Propagation Models on Ad Hoc Networks Performances Jounal of Compute Science 8 (5): 752-760, 2012 ISSN 1549-3636 2012 Science Publications The Impact of Radio Popagation Models on Ad Hoc Netwoks Pefomances 1 Rhattoy, A. and 2 A. Zatni 1 Depatment of Compute,

More information

Gravitational Mechanics of the Mars-Phobos System: Comparing Methods of Orbital Dynamics Modeling for Exploratory Mission Planning

Gravitational Mechanics of the Mars-Phobos System: Comparing Methods of Orbital Dynamics Modeling for Exploratory Mission Planning Gavitational Mechanics of the Mas-Phobos System: Compaing Methods of Obital Dynamics Modeling fo Exploatoy Mission Planning Alfedo C. Itualde The Pennsylvania State Univesity, Univesity Pak, PA, 6802 This

More information

Towards Automatic Update of Access Control Policy

Towards Automatic Update of Access Control Policy Towads Automatic Update of Access Contol Policy Jinwei Hu, Yan Zhang, and Ruixuan Li Intelligent Systems Laboatoy, School of Computing and Mathematics Univesity of Westen Sydney, Sydney 1797, Austalia

More information

Supplementary Material for EpiDiff

Supplementary Material for EpiDiff Supplementay Mateial fo EpiDiff Supplementay Text S1. Pocessing of aw chomatin modification data In ode to obtain the chomatin modification levels in each of the egions submitted by the use QDCMR module

More information

Comparative Analysis of Congestion Control Algorithms Using ns-2

Comparative Analysis of Congestion Control Algorithms Using ns-2 www.ijcsi.org 89 Comparative Analysis of Congestion Control Algorithms Using ns-2 Sanjeev Patel 1, P. K. Gupta 2, Arjun Garg 3, Prateek Mehrotra 4 and Manish Chhabra 5 1 Deptt. of Computer Sc. & Engg,

More information

Definitions and terminology

Definitions and terminology I love the Case & Fai textbook but it is out of date with how monetay policy woks today. Please use this handout to supplement the chapte on monetay policy. The textbook assumes that the Fedeal Reseve

More information

Nice Resource Reservations in Linux

Nice Resource Reservations in Linux Nice Resouce Resevations in Linux Matin Ohlin Depatment of Automatic Contol Lund Univesity Box 118, SE-221 Lund, Sweden Email: Matin.Ohlin@contol.lth.se Matin A. Kjæ Depatment of Automatic Contol Lund

More information

Approximation Algorithms for Data Management in Networks

Approximation Algorithms for Data Management in Networks Appoximation Algoithms fo Data Management in Netwoks Chistof Kick Heinz Nixdof Institute and Depatment of Mathematics & Compute Science adebon Univesity Gemany kueke@upb.de Haald Räcke Heinz Nixdof Institute

More information

An Efficient Group Key Agreement Protocol for Ad hoc Networks

An Efficient Group Key Agreement Protocol for Ad hoc Networks An Efficient Goup Key Ageement Potocol fo Ad hoc Netwoks Daniel Augot, Raghav haska, Valéie Issany and Daniele Sacchetti INRIA Rocquencout 78153 Le Chesnay Fance {Daniel.Augot, Raghav.haska, Valéie.Issany,

More information

Financial Derivatives for Computer Network Capacity Markets with Quality-of-Service Guarantees

Financial Derivatives for Computer Network Capacity Markets with Quality-of-Service Guarantees Financial Deivatives fo Compute Netwok Capacity Makets with Quality-of-Sevice Guaantees Pette Pettesson pp@kth.se Febuay 2003 SICS Technical Repot T2003:03 Keywods Netwoking and Intenet Achitectue. Abstact

More information

How Much Should a Firm Borrow. Effect of tax shields. Capital Structure Theory. Capital Structure & Corporate Taxes

How Much Should a Firm Borrow. Effect of tax shields. Capital Structure Theory. Capital Structure & Corporate Taxes How Much Should a Fim Boow Chapte 19 Capital Stuctue & Copoate Taxes Financial Risk - Risk to shaeholdes esulting fom the use of debt. Financial Leveage - Incease in the vaiability of shaeholde etuns that

More information

Towards Realizing a Low Cost and Highly Available Datacenter Power Infrastructure

Towards Realizing a Low Cost and Highly Available Datacenter Power Infrastructure Towads Realizing a Low Cost and Highly Available Datacente Powe Infastuctue Siam Govindan, Di Wang, Lydia Chen, Anand Sivasubamaniam, and Bhuvan Ugaonka The Pennsylvania State Univesity. IBM Reseach Zuich

More information

ENABLING INFORMATION GATHERING PATTERNS FOR EMERGENCY RESPONSE WITH THE OPENKNOWLEDGE SYSTEM

ENABLING INFORMATION GATHERING PATTERNS FOR EMERGENCY RESPONSE WITH THE OPENKNOWLEDGE SYSTEM Computing and Infomatics, Vol. 29, 2010, 537 555 ENABLING INFORMATION GATHERING PATTERNS FOR EMERGENCY RESPONSE WITH THE OPENKNOWLEDGE SYSTEM Gaia Tecaichi, Veonica Rizzi, Mauizio Machese Depatment of

More information

Uncertain Version Control in Open Collaborative Editing of Tree-Structured Documents

Uncertain Version Control in Open Collaborative Editing of Tree-Structured Documents Uncetain Vesion Contol in Open Collaboative Editing of Tee-Stuctued Documents M. Lamine Ba Institut Mines Télécom; Télécom PaisTech; LTCI Pais, Fance mouhamadou.ba@ telecom-paistech.f Talel Abdessalem

More information

Memory-Aware Sizing for In-Memory Databases

Memory-Aware Sizing for In-Memory Databases Memoy-Awae Sizing fo In-Memoy Databases Kasten Molka, Giuliano Casale, Thomas Molka, Laua Mooe Depatment of Computing, Impeial College London, United Kingdom {k.molka3, g.casale}@impeial.ac.uk SAP HANA

More information

The impact of migration on the provision. of UK public services (SRG.10.039.4) Final Report. December 2011

The impact of migration on the provision. of UK public services (SRG.10.039.4) Final Report. December 2011 The impact of migation on the povision of UK public sevices (SRG.10.039.4) Final Repot Decembe 2011 The obustness The obustness of the analysis of the is analysis the esponsibility is the esponsibility

More information

SUPPORT VECTOR MACHINE FOR BANDWIDTH ANALYSIS OF SLOTTED MICROSTRIP ANTENNA

SUPPORT VECTOR MACHINE FOR BANDWIDTH ANALYSIS OF SLOTTED MICROSTRIP ANTENNA Intenational Jounal of Compute Science, Systems Engineeing and Infomation Technology, 4(), 20, pp. 67-7 SUPPORT VECTOR MACHIE FOR BADWIDTH AALYSIS OF SLOTTED MICROSTRIP ATEA Venmathi A.R. & Vanitha L.

More information

They aim to select the best services that satisfy the user s. other providers infrastructures and utility services to run

They aim to select the best services that satisfy the user s. other providers infrastructures and utility services to run End-to-End Qo Mapping and Aggegation fo electing Cloud evices Raed Kaim, Chen Ding, Ali Mii Depatment of Compute cience Ryeson Univesity, Toonto, Canada 2kaim@yeson.ca, cding@scs.yeson.ca, ali.mii@yeson.ca

More information

Ilona V. Tregub, ScD., Professor

Ilona V. Tregub, ScD., Professor Investment Potfolio Fomation fo the Pension Fund of Russia Ilona V. egub, ScD., Pofesso Mathematical Modeling of Economic Pocesses Depatment he Financial Univesity unde the Govenment of the Russian Fedeation

More information

A Two-Step Tabu Search Heuristic for Multi-Period Multi-Site Assignment Problem with Joint Requirement of Multiple Resource Types

A Two-Step Tabu Search Heuristic for Multi-Period Multi-Site Assignment Problem with Joint Requirement of Multiple Resource Types Aticle A Two-Step Tabu Seach Heuistic fo Multi-Peiod Multi-Site Assignment Poblem with Joint Requiement of Multiple Resouce Types Siavit Swangnop and Paveena Chaovalitwongse* Depatment of Industial Engineeing,

More information

A Capacitated Commodity Trading Model with Market Power

A Capacitated Commodity Trading Model with Market Power A Capacitated Commodity Tading Model with Maket Powe Victo Matínez-de-Albéniz Josep Maia Vendell Simón IESE Business School, Univesity of Navaa, Av. Peason 1, 08034 Bacelona, Spain VAlbeniz@iese.edu JMVendell@iese.edu

More information

Unveiling the MPLS Structure on Internet Topology

Unveiling the MPLS Structure on Internet Topology Unveiling the MPLS Stuctue on Intenet Topology Gabiel Davila Revelo, Mauicio Andeson Ricci, Benoit Donnet, José Ignacio Alvaez-Hamelin INTECIN, Facultad de Ingenieía, Univesidad de Buenos Aies Agentina

More information

THE DISTRIBUTED LOCATION RESOLUTION PROBLEM AND ITS EFFICIENT SOLUTION

THE DISTRIBUTED LOCATION RESOLUTION PROBLEM AND ITS EFFICIENT SOLUTION IADIS Intenational Confeence Applied Computing 2006 THE DISTRIBUTED LOCATION RESOLUTION PROBLEM AND ITS EFFICIENT SOLUTION Jög Roth Univesity of Hagen 58084 Hagen, Gemany Joeg.Roth@Fenuni-hagen.de ABSTRACT

More information

YARN PROPERTIES MEASUREMENT: AN OPTICAL APPROACH

YARN PROPERTIES MEASUREMENT: AN OPTICAL APPROACH nd INTERNATIONAL TEXTILE, CLOTHING & ESIGN CONFERENCE Magic Wold of Textiles Octobe 03 d to 06 th 004, UBROVNIK, CROATIA YARN PROPERTIES MEASUREMENT: AN OPTICAL APPROACH Jana VOBOROVA; Ashish GARG; Bohuslav

More information

Multiband Microstrip Patch Antenna for Microwave Applications

Multiband Microstrip Patch Antenna for Microwave Applications IOSR Jounal of Electonics and Communication Engineeing (IOSR-JECE) ISSN: 2278-2834, ISBN: 2278-8735. Volume 3, Issue 5 (Sep. - Oct. 2012), PP 43-48 Multiband Micostip Patch Antenna fo Micowave Applications

More information

Alarm transmission through Radio and GSM networks

Alarm transmission through Radio and GSM networks Alam tansmission though Radio and GSM netwoks 2015 Alam tansmission though Radio netwok RR-IP12 RL10 E10C E10C LAN RL1 0 R11 T10 (T10U) Windows MONAS MS NETWORK MCI > GNH > GND > +E > DATA POWER DATA BUS

More information

INVESTIGATION OF FLOW INSIDE AN AXIAL-FLOW PUMP OF GV IMP TYPE

INVESTIGATION OF FLOW INSIDE AN AXIAL-FLOW PUMP OF GV IMP TYPE 1 INVESTIGATION OF FLOW INSIDE AN AXIAL-FLOW PUMP OF GV IMP TYPE ANATOLIY A. YEVTUSHENKO 1, ALEXEY N. KOCHEVSKY 1, NATALYA A. FEDOTOVA 1, ALEXANDER Y. SCHELYAEV 2, VLADIMIR N. KONSHIN 2 1 Depatment of

More information

Modal Characteristics study of CEM-1 Single-Layer Printed Circuit Board Using Experimental Modal Analysis

Modal Characteristics study of CEM-1 Single-Layer Printed Circuit Board Using Experimental Modal Analysis Available online at www.sciencediect.com Pocedia Engineeing 41 (2012 ) 1360 1366 Intenational Symposium on Robotics and Intelligent Sensos 2012 (IRIS 2012) Modal Chaacteistics study of CEM-1 Single-Laye

More information

Public Health and Transportation Coalition (PHiT) Vision, Mission, Goals, Objectives, and Work Plan August 2, 2012

Public Health and Transportation Coalition (PHiT) Vision, Mission, Goals, Objectives, and Work Plan August 2, 2012 Public Health and Tanspotation Coalition (PHiT) Vision, Mission, Goals, Objectives, and Wok Plan 2, 2012 Vision We envision Maine as a place whee people of all ages and abilities can move about in ways

More information

Real Time Tracking of High Speed Movements in the Context of a Table Tennis Application

Real Time Tracking of High Speed Movements in the Context of a Table Tennis Application Real Time Tacking of High Speed Movements in the Context of a Table Tennis Application Stephan Rusdof Chemnitz Univesity of Technology D-09107, Chemnitz, Gemany +49 371 531 1533 stephan.usdof@infomatik.tu-chemnitz.de

More information

Exam #1 Review Answers

Exam #1 Review Answers xam #1 Review Answes 1. Given the following pobability distibution, calculate the expected etun, vaiance and standad deviation fo Secuity J. State Pob (R) 1 0.2 10% 2 0.6 15 3 0.2 20 xpected etun = 0.2*10%

More information

Improving Software Effort Estimation Using Neuro-Fuzzy Model with SEER-SEM

Improving Software Effort Estimation Using Neuro-Fuzzy Model with SEER-SEM Global Jounal of Compute Science and Technology Vol. 10 Issue 12 (Ve. 1.0) Octobe 2010 a g e 51 Impoving Softwae Effot Estimation Using Neuo-Fuzzy Model with SEER-SEM Wei Lin Du 1, Danny Ho 2, Luiz Fenando

More information

Optimal Peer Selection in a Free-Market Peer-Resource Economy

Optimal Peer Selection in a Free-Market Peer-Resource Economy Optimal Pee Selection in a Fee-Maket Pee-Resouce Economy Micah Adle, Rakesh Kuma, Keith Ross, Dan Rubenstein, David Tune and David D Yao Dept of Compute Science Univesity of Massachusetts Amhest, MA; Email:

More information

The Binomial Distribution

The Binomial Distribution The Binomial Distibution A. It would be vey tedious if, evey time we had a slightly diffeent poblem, we had to detemine the pobability distibutions fom scatch. Luckily, thee ae enough similaities between

More information

Loyalty Rewards and Gift Card Programs: Basic Actuarial Estimation Techniques

Loyalty Rewards and Gift Card Programs: Basic Actuarial Estimation Techniques Loyalty Rewads and Gift Cad Pogams: Basic Actuaial Estimation Techniques Tim A. Gault, ACAS, MAAA, Len Llaguno, FCAS, MAAA and Matin Ménad, FCAS, MAAA Abstact In this pape we establish an actuaial famewok

More information

DYNAMICS AND STRUCTURAL LOADING IN WIND TURBINES

DYNAMICS AND STRUCTURAL LOADING IN WIND TURBINES DYNAMIS AND STRUTURAL LOADING IN WIND TURBINES M. Ragheb 12/30/2008 INTRODUTION The loading egimes to which wind tubines ae subject to ae extemely complex equiing special attention in thei design, opeation

More information

PRICING MODEL FOR COMPETING ONLINE AND RETAIL CHANNEL WITH ONLINE BUYING RISK

PRICING MODEL FOR COMPETING ONLINE AND RETAIL CHANNEL WITH ONLINE BUYING RISK PRICING MODEL FOR COMPETING ONLINE AND RETAIL CHANNEL WITH ONLINE BUYING RISK Vaanya Vaanyuwatana Chutikan Anunyavanit Manoat Pinthong Puthapon Jaupash Aussaavut Dumongsii Siinhon Intenational Institute

More information

who supply the system vectors for their JVM products. 1 HBench:Java will work best with support from JVM vendors

who supply the system vectors for their JVM products. 1 HBench:Java will work best with support from JVM vendors Appeaed in the ACM Java Gande 2000 Confeence, San Fancisco, Califonia, June 3-5, 2000 HBench:Java: An Application-Specific Benchmaking Famewok fo Java Vitual Machines Xiaolan Zhang Mago Seltze Division

More information

Load Balancing in Processor Sharing Systems

Load Balancing in Processor Sharing Systems Load Balancing in ocesso Shaing Systems Eitan Altman INRIA Sophia Antipolis 2004, oute des Lucioles 06902 Sophia Antipolis, Fance altman@sophia.inia.f Utzi Ayesta LAAS-CNRS Univesité de Toulouse 7, Avenue

More information

Load Balancing in Processor Sharing Systems

Load Balancing in Processor Sharing Systems Load Balancing in ocesso Shaing Systems Eitan Altman INRIA Sophia Antipolis 2004, oute des Lucioles 06902 Sophia Antipolis, Fance altman@sophia.inia.f Utzi Ayesta LAAS-CNRS Univesité de Toulouse 7, Avenue

More information

Give me all I pay for Execution Guarantees in Electronic Commerce Payment Processes

Give me all I pay for Execution Guarantees in Electronic Commerce Payment Processes Give me all I pay fo Execution Guaantees in Electonic Commece Payment Pocesses Heiko Schuldt Andei Popovici Hans-Jög Schek Email: Database Reseach Goup Institute of Infomation Systems ETH Zentum, 8092

More information

Experiment 6: Centripetal Force

Experiment 6: Centripetal Force Name Section Date Intoduction Expeiment 6: Centipetal oce This expeiment is concened with the foce necessay to keep an object moving in a constant cicula path. Accoding to Newton s fist law of motion thee

More information

Office of Family Assistance. Evaluation Resource Guide for Responsible Fatherhood Programs

Office of Family Assistance. Evaluation Resource Guide for Responsible Fatherhood Programs Office of Family Assistance Evaluation Resouce Guide fo Responsible Fathehood Pogams Contents Intoduction........................................................ 4 Backgound..........................................................

More information

Database Management Systems

Database Management Systems Contents Database Management Systems (COP 5725) D. Makus Schneide Depatment of Compute & Infomation Science & Engineeing (CISE) Database Systems Reseach & Development Cente Couse Syllabus 1 Sping 2012

More information

Model-Driven Engineering of Adaptation Engines for Self-Adaptive Software: Executable Runtime Megamodels

Model-Driven Engineering of Adaptation Engines for Self-Adaptive Software: Executable Runtime Megamodels Model-Diven Engineeing of Adaptation Engines fo Self-Adaptive Softwae: Executable Runtime Megamodels Thomas Vogel, Holge Giese Technische Beichte N. 66 des Hasso-Plattne-Instituts fü Softwaesystemtechnik

More information

Automated Hydraulic Drilling Rigs. HHSeries

Automated Hydraulic Drilling Rigs. HHSeries Automated Hydaulic Dilling Rigs HHSeies The Shape of Things to Come CUSTOMSOLUTIONS HH600 Rig The HH Hydaulic Hoist Seies Eveything about the HH Seies is designed fo speed, safety and efficiency. You can

More information