WEB DELAY ANALYSIS AND REDUCTION BY USING LOAD BALANCING OF A DNS-BASED WEB SERVER CLUSTER

Size: px
Start display at page:

Download "WEB DELAY ANALYSIS AND REDUCTION BY USING LOAD BALANCING OF A DNS-BASED WEB SERVER CLUSTER"

Transcription

1 Interntionl Journl of Computers nd Applictions, Vol. 9, No., 007 WEB DELAY ANALYSIS AND REDUCTION BY USING LOAD BALANCING OF A DNS-BASED WEB SERVER CLUSTER Y.W. Bi nd Y.C. Wu Abstrct Bsed on our survey of recent rticles, there is little reserch being conducted into quntittive nlysis of the lod blncing of Web server clusters. In this pper, we propose quntittive nlysis for DNS-bsed server clusters. We lso propose two-pss lod-blncing method for determining the lod blnce re of these clusters. The first pss uses the lookup tble insted of complicted computtion for obtining the lod blncing of the Web service requests. The second pss lso utilizes lookup tble by precomputed Hessin mtrix to obtin the lod blncing. In ddition, we compre the reltive performnce of disptcherbsed nd DNS-bsed server clusters using queuing theory, nlysis, nd simultion, nd we compre the mesurement results using benchmrks. To increse the simultion performnce we hve designed simultion module to promptly locte the lod blncing, with potentil improvement of 36.58% over the verge system response time. Key Words System performnce, modelling techniques, mesurement techniques, web servers, lod blnce, system response time. Introduction The informtion trffic on the world wide web is incresing t the rte of bout two or three times over per yer nd the verge login-time on user s web pge is much longer thn it ws before. Web dely or system response time is one of the min fctors determining the qulity of service of web pge, nd networkbndwidth nd connection strtegy cn lso ffect the totl ltency sources. Mny mens of reducing web dely hve been studies, such s cching rchitectures, prefetching, content distribution network, trnsmission scheme, efficient content, imge optimiztion, nd lod blncing [ 4]. Lod-blncing techniques cn be ctegorized into four mjor clsses: client-bsed pproch, disptcher-bsed p- Deprtment of Electronic Engineering, Fu Jen Ctholic University, Tipei, Tiwn, 4, R.O.C.; e-mil: Recommended by Dr. Weimin Zheng (pper no ) 79 proch, DNS-bsed pproch, nd server-bsed pproch. Most of these investigtions provide new design of the rchitecture nd the lgorithm to gin performnce improvement. However, becuse not much is known bout the quntittive nlysis of vrious rchitectures, we propose the corresponding queuing model nd prompt method to determine the lod blncing of DNS-bsed web server clusters [4, 5]. Due to the stochstic chrcteristics of web server opertion nd internet trnsmission, web dely cn be very rndom. Therefore it cn be difficult to estimte the precise dely. Our reserch includes finding the key fctors utilized in estimting the verge system response time of the DNS-bsed pproch nd using one of these lodblncing pproches to reduce web dely []. Bsed on the lod-blncing mechnism of DNS-bsed pproch, we provide mthemticl model, to nlyze nd simulte results, mesure the verge system response time of web server cluster, nd find some of the dependent fctors [ 5]. First we choose DNS-bsed web server cluster becuse it is commonly used nd hs not been studied in ny previous quntittive nlysis. For tht web server cluster we hve designed queuing model to conduct quntittive nlysis nd to find mthemticl reltion to the web dely of vrious disptch-fctors. Bsed on these results, one cn djust the system opertion prmeters to obtin the minimum possible web dely. Second, we use the mthemticl softwre pckge QNAT (queue networknlysis tool) [6 8] to conduct simultion. In ddition, we propose mthemticl model bsed on queuing model to compute either the web dely or the verge system response time E(t). The mthemticl model will let us know the chrcteristics of the web dely E(t). Then we use the QNAT nd TK Solver softwre pckges to verify whether our mthemticl model is correct. Furthermore, we hve designed new simultion tool to reduce the simultion time by finding the lodblncing condition of cluster of web servers. We lso use modified version of the Hessin mtrix, H[E(t)], to show how we locte the opertion region of the lod blncing of cluster of web servers. Finlly, we provide precomputtion tble to determine how to find lod blncing without using excessively complicted computtion.

2 The rest of this pper is orgnized s follows. In Section the min fctors of web dely re described. In Section 3 severl lod-blncing schemes re given nd resons for choosing the DNS-bsed rchitecture re presented. Section 4 describes the queuing model. Section 5 describes the lod-blncing scheme of cluster of web servers on DNS cluster rchitecture with Hessin mtrix utilizing two-pss lod blncing. Section 6 provides the performnce comprison between disptcher-bsed nd DNS-bsed rchitectures. Section 7 shows the experimentl results of the verge system response time with lod blncing using DNS-bsed web server cluster. Some conclusions from our reserch re drwn in Section 8.. The Min Fctors of Web Dely. Ltency Sources of Systems When we use web browser or ccess version of windows, series of computer system nd networkprocesses tkes plce in the bckground. Every process my hve rndom dely time of bout millisecond to second, depending on different opertionl situtions. For exmple, in clientserver system one first sends request to the browser in the website, where the browser will service the ccepted request. Most of the web contents must wit for other module responses such s softwre or hrdwre. In the best situtions time is required to execute their functions no mtter whether limited by the service bndwidth of the link or by device services. So ltency sources cn be the cuse of most inherent delys nd cn mke it difficult to improve the performnce of common computer networks [ 3].. DNS Lookup Tble When we go to website we must remember the domin nme, such s In typicl computer networkit is necessry to trnsform the domin nme to its specific IP ddress. We lso find tht 0% of the domin nme trnsformtion tkes bout 6 seconds due to retrnsfer time. As the number of clients increses, the DNS lookup tble dely time becomes longer. So the DNS lookup is lso prime fctor cusing web dely [ 3]..3 Connection Therefore the server frequently becomes bottleneck, nd server-side processing lso ffects the bndwidth tht web session needs [ 3]..5 Document Trnsfer Depending on content size, vilble bndwidth, setting of proxy servers nd routing, document trnsfer will be mjor fctor cusing dely time. For exmple, the trnsfer time of MB of dt will be longer thn tht of KB of dt for the sme trnsmission rte. Therefore the document trnsfer time cn be n uncontrollble fctor of dely []. 3. Previously Proposed Approches 3. Client-Bsed Approch Client-bsed pproch routes the request to one of the destintion nodes on the web clusters to specific server bsed on the client-site softwre. This pproch is divided into web client nd client-side proxies. The stte mngement of the client-bsed pproch is very difficult when network trffic increses. As the client-bsed pproch is not often used, we will not consider using it [ 3]. 3. DNS-Bsed Approch Due to the increse of web trffic nd longer URL nmes, we hope to mke simple virtul interfce to communicte with others. This interfce will mke it esier for users who re not experts. A DNS-bsed pproch just trnsforms the site nme of the distributed nodes of the web system into n IP ddress. So, we must design solution with couple of steps s shown in Fig. in order to distribute the requests of ll clients to the most suitble server. Of course, mny intermedite nme servers cn cche logiclto-ip-ddress mpping to reduce the mount of network trffic between client nd the cluster DNS. Therefore DNS-bsed TTL (time-to-live) cn be used to determine how much time will be required to find n intermedite nme server; otherwise the DNS cluster cnnot select suitble web server. This pproch is good ide, but the cluster DNS server often cuses dditionl delys, s too much trffic psses through the intermedite nme server [ 7]. The next web dely builds up the TCP to route the web service to the destintion bsed on the IP dtgrm. A routing lgorithm provides solution to determine how to trnsfer the service request to the next stge or to the wireless-level. So router lso contributes to the dely time. We further found tht bout 40% of the connections tke bout 00 0,000 milliseconds [ 3]..4 Server-Side Processing Due to the increse of websites nd new services, the working lod of web servers increses, even for personl business ffirs including dynmic content. The dynmic dt need to mke more I/O nd CPU requests to the servers. 80 Figure. DNS-bsed pproch rchitecture.

3 3.3 Disptcher-Bsed Approch To centrlize the scheduling request nd control clientrequest routing completely, disptcher-bsed pproch hs been designed. The routing request mong servers is trnsprent, but this is the sme when deling with ddresses t the URL level on DNS. A typicl disptcher hs simple virtul IP ddress (IP-SVA). The disptcher defines its own personl ddress bsed on its server nd its different protocol levels bsed on distinct structures such s pcket rewriting, pcket forwrding, or HTTP redirection. The disptcher selects n lgorithm to choose specific web server to blnce incoming requests to minimize processing dely, s shown in Fig. [ 3, 9 ]. Figure. Disptcher-bsed pproch rchitecture. 3.4 Server-Bsed Approch The server-bsed pproch uses two-level system of disptching. This pproch first distributes the client requests on the web DNS to the web-server nodes. Then every server distributes the request to other system servers gin. Of course, its dvntge is to conduct lod blncing more effectively. In contrst, implements nd mngements re more inconvenient [, 4]. 4. Queuing Models In rel situtions pckets will be lost due to collision or lckof sufficient buffer. Collision is cused by more thn two pckets being trnsferred t the sme time on the MAC lyer. Lckof sufficient buffer is often cused by the service rte being less thn the rrivl rte. To observe the effect of lckof sufficient buffer we ssume tht the MAC lyer is idel in our pper. This mens pckets will only be lost by lckof sufficient buffer, not by collision. There is one intermedite nme server, two dns servers, nd two web servers in our rchitecture. To provide quntittive nlysis of the system performnce, we propose corresponding queuing model for the DNS-bsed rchitecture. In this model there re two clsses of rrivl rtes, one for the ddress request nd the other for the document request. The domin nme server provides service for the ddress request, nd then the client sends the document request to the web server designted by the domin nme server. This system is modelled s 8 shown in Fig. 3, nd the system prmeters re shown in the following. Figure 3. DNS-bsed queuing model. Due to the simultion of networkdely, we dd queue t the feedbckpth s shown in Fig. 3 with feedbck rtio of i nd j to pproximte the rel sitution. The prmeters i nd j re the DNS Server nd DNS Server pcket loss rtios, respectively. For exmple, if i is 0% nd λ is 00 (pckets), 0 pckets will be feedbck to the intermedite nme server from the DNS server to retrnsfer. Definition of system prmeters: λ : Address request rte (job/sec) λ : Document request rte (job/sec) µ 0 : Intermedite nme server service rte (job/sec) µ : Cluster domin nme server service rte (job/sec) µ : Web server service rte (job/sec) : Disptch rtio, 0 < i, j: Feedbckrtio, 0 <i,j λ kλ E (t): The front-end of the domin nme server response time (sec) E (t): The bck-end of the domin nme server response time (sec) E(t): DNS-bsed system response time (sec), E(t) E(n)/λ E(n)ρ n /( ρ n ). The verge number of tsks or jobs on queue To simplify the simultion, we use n infinite length of the buffer so tht there will be no blocking probbility. In ddition, the methods of TLL re round robin. 4. QNAT Simultion Usully, there is three-performnce index for the comprison of simultion results. Here we use the system response time E(t) s the comprison index for the simultion. There re three cses: without networkdely, with networkdely, nd with vrition feedbcknd network dely. Among the three we find wy to locte the lod blncing by using the friendly queuing simultion tool QNAT [, 6 8]. To simulte the performnce we need to ssign specific set of prmeters, n intermedite nme server service rte of 00 (job/sec), cluster DNS service rte if (job/sec), nd web server service rte of 500 (job/sec), ρ.

4 4. Without Network Dely In the cse of without networkdely we just ignore the networkdely. From Tble nd Fig. 4 of the simultion results we find tht there is lod blnce nd minimum system response time when the disptch rtio 0.5, becuse the service rtes of servers nd in Fig. 4 re equl. Tble Front-End System Response Time of DNS-Bsed Architecture (without NetworkDely), µ 0 µ µ 00 (job/sec), i j 0. Arrivl Rte Disptch Rtio Front-End System λ (job/sec) Response Time E (t) (sec) shows the front-end system response time with vrible feedbcknd networkdely. Figure 5. The front-end system response time of DNSbsed rchitecture (with networkdely), µ 0 µ µ 00 (job/sec), i j 0.. Figure 4. Front-end system response time of DNS-bsed rchitecture (without networkdely), µ 0 µ µ 00 (job/sec), i j 0., λ 0 (job/sec). 4.3 With Network Dely Becuse there is dely in networktrnsmission, we should dd on the networkdely to the simultion. From Fig. 5 of the simultion results we see tht there is lso lod blnce for the disptch rtio of 0.5, no mtter wht the networkdely is in the model, s shown in Fig. 3. Fig. 8 Figure 6. The front-end system response time E (t) (sec) with vrible feedbcknd networkdely λ 0 (job/sec), µ 00 (job/sec), µ increses 0 (job/sec), nd i, j reduce Mthemticl Models Bsed on Fig. 3 we derive E (t), E (t), nd E(t) s shown in (3), (4), nd (5). The derivtion cn be seen in []. The bsic steps re: finding the utiliztion ρ of ech queue, finding the verge number of tsks or jobs E(n)ρ n /( ρ n ) on ech queue, nd then finding the verge time E(t) E(n)/λ for single tskto get through the queue. Hence we obtin the following equtions () through (4), where W q represents the network dely. E (t) ( i j j)µ λ ( i j j)µ λ W q ( i j j)µ ( )λ ()

5 W q ρ λ ρ i ( i j j)µ iλ ( )j () ( i j j)µ ( )jλ E (t) ( i j j)µ λ ( i j j)µ λ ( i j j)µ ( )λ i ( i j j)µ iλ ( )j (3) ( i j j)µ ( )jλ E (t) (4) µ λ µ kλ If we hve the sme service rte of the DNS server cluster nd very smll networkdely, then we cn neglect W q. Hence we obtin the verge system response time E(t) s follows: E(t) ( i j j)µ λ ( i j j)µ λ ( i j j)µ ( )λ i (5) ( i j j)µ iλ µ kλ 5. Lod Blncing on Cluster DNS Using Hessin Mtrix E(t) ( i j j)µ λ ( i j j)µ λ ( i j j)µ ( )λ i ( i j j)µ iλ (7) µ kλ 5. Two-Pss Lod Blncing DNS-bsed rchitecture needs to perform two-pss requests while providing web services. The first pss is the lod blncing of ddress request, wheres the second is the lod blncing of document request bsed on the distribution of ddress request. We find tht the service rte of the front end will ffect the feedbckrtio nd the document request rte. If the feedbckrtio of the ddress request increses nd the lod blncing of the DNS side is unstisfctory, the document request rte decreses. In other words, if the lod blncing of the DNS side is sufficient, the feedbck rtio is reduced nd the document request rte increses. Therefore, ccording to the service request rte, we djust the DNS service rte nd locte the minimum system response time. The procedure is shown in Fig. 7. Here we will define the reltionship between k nd the feedbck rtio j. To obtin simultion exmple, we provide specific set of prmeters. We set the service rrivl rte of the DNS cluster t 00 (job/sec) nd λ λ. From () we lern tht E (t) is similr to the model from the previous reserch for the disptcher-bsed rchitecture []. There is one smll difference: the networkdely. Given specific set of prmeters, we estblish the fct tht the networkdely is (sec) for given specific set of prmeters s shown in (6). Hence we use the Hessin mtrix [] to form precomputed tble insted of complicted computtion for finding the lod blncing of the system. From comprison of the simultion results we lso find fixed difference of (sec). Hence the system response time E(t) cn be represented by (7). W q ρ λ ρ ( ) ( 0.5) 0. ( ) ( 0.5) (6) 83 Figure 7. Two-pss flow chrt for locting the lod blncing of DNS-bsed rchitecture.

6 In ddition, when the service rte decreses every 0 (job/sec), k decreses by. Hence the vlue of k is locted in the intervl 6 becuse the service rte of the DNS cluster rnges from 40 to 00 (job/sec). As in the previous section, we lso ssume tht the feedbckrtio is reduced by step size of 0.0 when the service rte is incresed by step size of 0 (job/sec). Therefore we cn obtin (8) nd (9) s the reltionship of k, j nd service rte of the DNS cluster s shown in Fig. 3. k (0. j) 00 (8) µ 40(j 0.4) 00 (9) Becuse we use the sme set of cluster DNS, the bckend of web servers hs set of similr prmeters. Hence we cn rewrite E (t), E (t), nd E(t) s in (0) to (). E (t) ( j) 00 λ ( j)(40 (j 0.4) 00) 0.5λ (0) E (t) µ ( (0. j) 00)λ () E(t) ( j) 00 λ ( j)(40 (j 0.4) 00) 0.5λ () µ ( (0. j) 00)λ According to the mthemticl model nd the serch procedure for lod blncing shown in Fig. 7, we cn locte the lod blncing quickly. As we exmine Tble, we find tht when µ µ 90 there is minimum system response time E(t). According to Tble we reduce the system response time by ( )/ %. 5.3 Lod Blncing of the Whole System Using Hessin Mtrix Previously we proposed lookup tble method to locte the lod blncing for E (t). Here we extend single-pss method to two-pss lod blncing due to the dependence of E (t) nd E (t) on ech other. For both E (t) nd E (t) we provide first-pss mechnism tht uses the lookup tble method to locte the lod blncing nd then provide the second-pss lod blncing by using precomputed tble of the Hessin mtrix for document request [, 3]. First, we tke prtil derivtive of (5) with respect to j nd λ : E(t) 00 (00 00j λ ) 00j 74 ( 00j 74j 6 0.5λ ) 00λ (500 λ 00jλ ) (3) E(t) λ (00 00j λ ) 0.5 ( 00j 74j 6 0.5λ ) 4 00j (500 λ 00jλ ) (4) Second, we tke prtil derivtive of (3) nd (4) with respect to j nd λ : E(t)/ 0000 (00 00j λ ) j 44400j 65 00λ ( 00j 74j 6 0.5λ ) λ (500 λ 00jλ ) 3 (5) Tble System Response Time of DNS-Bsed Architecture λ 0 (job/sec), µ (job/sec), µ increse 0 (job/sec), nd i, j reduce 0.0 Disptch Service Rte of System Response System Response System Response Rtio DNS Cluster time of Front-End Time of Bck-End of Time of DNS-Bsed µ (job/sec) of DNS-Bsed DNS-Bsed Architecture (E(t)) Architecture (E (t)) Architecture (E (t))

7 E(t)/ 00 λ (00 00j λ ) 3 00j 74 ( 00j 74j 6 0.5λ ) λ 0000jλ (500 λ 00jλ ) 3 (6) E(t)/ λ λ (00 00j λ ) ( 00j 74j 6 0.5λ ) 3 E(t)/ λ 6 600j 40000j (500 λ 00jλ ) 3 (7) 00 (00 00j λ ) 3 00j 74 ( 00j 74j 6 0.5λ ) λ 400jλ (500 λ 00jλ ) 3 (8) Third, we form Hessin mtrix: E(t)/ E(t)/ λ E(t)/ λ E(t)/ λ λ (9) To locte the minimum system response time E(t) from (9) we must let the determinnts of (9), nd, be greter thn zero. If j 0.4, then: E(t)/ 0000 ( λ ) (0.4) (0.4) 65 00λ ( 00 (0.4) 74 (0.4) 6 0.5λ ) λ (500 λ 00 (0.4)λ ) 3 (0) E(t)/ 00 (00 00 (0.4) λ ) 3 00 (0.4) 74 ( 00 (0.4) 74 (0.4) 6 0.5λ ) λ 0000 (0.4)λ (500 λ 00 (0.4)λ ) 3 () E(t)/ λ λ ( λ ) 3 E(t)/ λ 0.5 ( 00 (0.4) 74 (0.4) 6 0.5λ ) (0.4) (0.4) (500 λ 00 (0.4)λ ) 3 () 00 ( λ ) ( 00 (0.4) λ ) λ λ (500 λ λ ) 3 (3) From the existing criteri of the minimum vlues of Hessin mtrix, we hve: ( E(t)/ E(t)/ λ λ E(t)/ E(t)/ λ ) > 0 λ (4) We find the solution intervl 9.4 λ < 3.5 from the intersection of the solutions from (0) to (4). In ddition we obtin both the j locted in the intervl [0.4 0.] nd the reltionship between j, λ, nd µ ; then we obtin similr results from (0) to (4) s shown in Tble Comprison of Disptcher-Bsed nd DNS- Bsed Architecture In the simultion results with specific set of prmeters shown in Fig. 8, where the rrivl rte becomes 80 (job/sec), the system response time of disptcher-bsed Tble 3 Two-Pss Lookup Tble Arrivl Rte λ (job/sec) Service Rte of Cluster DNS µ (job/sec) System Response Time of DNS-Bsed Architecture 9.4 λ < Hs minimum system response time 7.77 λ < Hs minimum system response time 6.3 λ < Hs minimum system response time 5 λ < Hs minimum system response time 3.8 λ < 5 80 Hs minimum system response time.73 λ < Hs minimum system response time 85

8 rchitecture my be very long s compred to the DNSbsed rchitecture []. However, when the rrivl rte is smll, the system response time of disptcher-bsed rchitecture will be very short. Furthermore, when the rrivl rte becomes 63 (job/sec), the system response time of disptcher-bsed nd DNS-bsed rchitecture will be equl. Hence, for the smll rrivl rte in LAN, we will choose disptcher-bsed rchitecture insted of DNS-bsed rchitecture. In other words, for the lrge rrivl rte in n Internet, we will choose DNS-bsed rchitecture insted of disptcher-bsed rchitecture, lthough DNS-bsed rchitecture hs higher mngement cost []. 7. Mesurement of Lod Blncing Using DNS- Bsed Web Server Cluster To verify the chrcteristic of the proposed model s shown in Fig. 3, we designed nd implemented testing system with lod-blncing mechnism of DNS-bsed web server cluster s shown in Fig. 9. In ddition, we use the mesurement tool webserver stress tool stndrd edition to mesure the system response time of the web requests. Tble 4 shows the system specifiction []. First, we must set the prmeters for the testing system s shown in Tble 5 with nd without lod-blncing mechnism. Second, by mesurement, we obtin the system response time with respect to number of times s shown in Fig. 0, which shows the comprison between with lod blncing nd without lod blncing setting. We lso lern from the specific mesurement results nd (5) tht we hve potentil improvement of 76% with lodblncing mechnism. Tble 5 Prmeter Setting of Webserver Stress Tool Figure 8. A comprison of lod blncing between disptcher-bsed pproch nd DNS-bsed pproch. Number of Mesured Mx Dt Number of Web Users Time Rte Servers 0 40 Minute 64 kb Figure 9. Testing system for the DNS-bsed web server cluster. Tble 4 System Specifiction of Web Servers CPU RAM (Mb) O.S. Network(Mb/sec) Intermedite Nme Server One P4.6 GMHZ 768 Windows 000 Server 00 DNS One P4.6 GMHZ 768 Windows 000 Server 00 DNS One P4.6 GMHZ 768 Windows 000 Server 00 Web Server One P4.4 GMHZ 5 Windows 000 Server 00 Web Server One P4.4 GMHZ 5 Windows 000 Server 00 86

9 in Fig., which shows both results, from the G/M/ mesurement curve nd from the M/M/ model curve. The increse in the number of users increses the system response time becuse it cuses the server system to be busier, thus delying the service requests. The G/M/ mesurement curve provides the reltionship between the system response times with respect to the generl rrivl distribution. Figure 0. Comprison of the system response time between with lod blncing nd without lod blncing % (5) Third, by mesurement, we lso obtin the system response time with respect to the disptch rtio s shown in Fig., which shows tht djustment of the disptch rtio cn ffect the system response time. Becuse servers nd in Fig. 9 re t the sme mchine model they hve the sme service rte. Therefore, s the disptch rtio is 0.5, which is evenly distributed s shown in Fig., we find tht here we hve the minimum system response time by mesurement. These results of lod blncing re lso similr to the simultion results from QNAT shown in the previous sections. Figure. System response time of testing system of DNS-bsed rchitecture. Fourth, by mesurement, we lso obtin the system response time with respect to number of users s shown 87 Figure. Comprison of the system response times of M/M/ model nd G/M/ mesurement. Bsed on the queuing theory, the M/M/ model of the system response time of DNS-bsed rchitecture is shown in (6) []. E (t) ( i j j)µ λ ( i j j)µ λ ( i j j)µ ( )λ i (6) ( i j j)µ iλ Bsed on the queuing theory the G/M/ model of the system response time of DNS-bsed rchitecture is shown in (7) []. [ E (t) ( i j j)µ λ ( i j j)µ λ ( i j j)µ ( )λ ]( i C ) (S) ( i j j)µ iλ (7) C (S) in (7) is vrition coefficient. In the M/M/ model C (S) is equl to, wheres in our G/M/ mesurement C (S) is lrger thn s shown in Fig. if the

10 vrition of the system response time is lrger thn the men of the system response time [, 8]. The opertionl chrcteristics of the testing system mke the vrition coefficient shift s shown in Fig.. Usully the vrition coefficient of the testing system is dependent on the networksitution, the system softwre mngement policy, nd the chrcteristics of the mesurement tool. Hence couple of unknown fctors my ffect the mesurement results. Although the G/M/ mesurement curve is slightly fr from the M/M/ model curve, due to the lrge vrition coefficient in the G/M/ mesurement both curves still hve similr trend, s shown in Fig.. 8. Conclusion In this pper we propose two-pss lod-blncing scheme. The first pss is for the ddress request nd the second is for document request. Bsed on the corresponding queuing model for DNS-bsed rchitecture, we cn nlyze nd simulte the system response time. Furthermore, by utilizing the precomputed tble of Hessin mtrix insted of complicted computtion, we cn esily locte the lod blncing. Finlly, from comprison of the system response times between DNS-bsed nd disptcher-bsed rchitecture we lern tht disptcher-bsed rchitecture is good for LAN pplictions nd DNS-bsed rchitecture is good for internet pplictions. From nlysis, simultion, nd mesurement results we lern tht when lod blncing exists due to specific set of prmeters nd suitble djustment, we hve the potentil to improve the verge system response time by 36.58% with the specific set of prmeters shown in Section 5.. Although burstiness is specil occurrence in network trffic, it sometimes hppens in rel situtions. According to our survey, most ppers set burstiness prmeter of rrivl rte (λ) or service rte (µ) to dd the burstiness fctor to M/M/ or G/M/ [4 6]. In the future we will refer to [4 6] or others to dd or modify some prmeters so s to consider the burstiness fctor in our model nd to verify it by simultion. References [] Y.W. Bi & Y.C. Wu, Web dely nlysis nd reduction by use of lod blncing of disptcher-bsed web server cluster, IASTED Int. Conf. on Prllel nd Distributed Computer nd Networks, Innsbruck, Austri, 003, [] V. Crdellini, M. Coljnni, & P.S. Yu, Dynmic lod blncing on web-server system, IEEE Internet Computing, 3 (3), 999, [3] M. Zri, H. Siedin, & M. Neem, Understnding nd reducing web delys, IEEE Computers, 34 (), 00, [4] H. Bryhni, A comprison of lod blncing techniques for sclble web servers, IEEE Networks, 4 (4), 000, [5] M. Cstro, M. Dwyer, & M. Rumsewicz, Lod blncing nd control for distributed World Wide Web servers, Proc. 999 IEEE Int. Conf. on Control Applictions,, Kohl Cost- Islnd of Hwii, USA, 999, [6] S. Ndimplli & S. Mjumdr, Techniques for chieving high performnce web servers, Proc. Int. Conf. on Prllel Processing, Toronto, 000, [7] L. Cherksov & S.R. Ponneknti, Optimizing contentwre lod blncing strtegy for shred web hosting service, IEEE Proc. 8th Int. Symp. on Modeling, Anlysis nd 88 Simultion of Computer nd Telecommuniction Systems, Sn Frncisco, CA, 000, [8] D. Mnjunth, D.M. Bhskr, H. Thilrmni, S.K. Bose, & M.N. Umesh, The queueing network nlysis tool (QNAT), Proc. 8th Int. Symp. on Modeling, Anlysis nd Simultion of Computer nd Telecommuniction Systems,, Sn Frncisco, 000, [9] H. Shin, S.H. Lee, & M.S. Prk, Multicst-bsed distributed LVS (MD-LVS) for improving sclbility nd vilbility, IEEE Proc. 8th Int. Conf. on Prllel nd Distributed Systems, KyongJu City, Kore, 00, [0] L. Cherksov, FLEX: Lod blncing nd mngement strtegy for sclble web hosting service, Proc. 5th IEEE Symp. on Computers nd Communictions, ISCC 000, Antibes-Jun Les Pins, Frnce, 000, 8 3. [] L. Cooper & D. Steinberg, Introduction to Methods of Optimiztion (Phildelphi: W.B. Sunders, 970). [] L. Avers & A. Bestvros, Lod blncing cluster of Web servers using distributed pcket rewriting, Proc. of the IEEE Int. Performnce, Computing, nd Communictions Conf., IPCCC 00, Phoenix, Arizon, 000, 4 9. [3] [4] J. Abte, Asymptotic for stedy-stte til probbilities in structured Mrkov queuing models, Stochstic Models, 0, 000, [5] J. Rochol & M.H. Diemer, Adptive description of ATM trffic flows, CLEI Electronic Journl, 55 (), 000, 3. [6] Y. Cheng, X. Ling, L. Ci, W. Song, W. Zhung, X. Shen, & A.L. Grci, Sttisticl multiplexing, dmission region, nd contention window optimiztion in multiclss wireless LANs, Proc. 3rd Int. Conf. on Qulity of Service in Heterogeneous Wired/Wireless Networks (QShine) 006, Wterloo, Cnd, 006, Biogrphies Ying-Wen Bi is professor in the Deprtment of Electronic Engineering t Fu-Jen Ctholic University. His reserch focuses on mobile computing nd microcomputer system design. He obtined his M.Sc. nd Ph.D. degrees in electricl engineering from Columbi University, New York, in 99 nd 993 respectively. Between 993 nd 995 he worked t the Institute for Informtion Industry, Tiwn. Yi-Cho Wu is currently working towrd his Ph.D. t the Grdute Institute of Computer nd Communiction Engineering, Ntionl Tipei University of Technology, Tipei, Tiwn. He received his M.Sc. degree from the Deprtment of Electronic Engineering, Fu-Jen Ctholic University, in 003 nd his B.Sc. degree from the Deprtment of Computer Science nd Informtion Engineering, Chung Hu University, in 00. His reserch focuses on nlysis nd improvement of lod blncing on web servers, wireless d-hoc networknd wireless sensor network.

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

Economics Letters 65 (1999) 9 15. macroeconomists. a b, Ruth A. Judson, Ann L. Owen. Received 11 December 1998; accepted 12 May 1999

Economics Letters 65 (1999) 9 15. macroeconomists. a b, Ruth A. Judson, Ann L. Owen. Received 11 December 1998; accepted 12 May 1999 Economics Letters 65 (1999) 9 15 Estimting dynmic pnel dt models: guide for q mcroeconomists b, * Ruth A. Judson, Ann L. Owen Federl Reserve Bord of Governors, 0th & C Sts., N.W. Wshington, D.C. 0551,

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

Polynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )

Polynomial Functions. Polynomial functions in one variable can be written in expanded form as ( ) Polynomil Functions Polynomil functions in one vrible cn be written in expnded form s n n 1 n 2 2 f x = x + x + x + + x + x+ n n 1 n 2 2 1 0 Exmples of polynomils in expnded form re nd 3 8 7 4 = 5 4 +

More information

QoS Mechanisms C HAPTER 3. 3.1 Introduction. 3.2 Classification

QoS Mechanisms C HAPTER 3. 3.1 Introduction. 3.2 Classification C HAPTER 3 QoS Mechnisms 3.1 Introduction In the previous chpter, we introduced the fundmentl QoS concepts. In this chpter we introduce number of key QoS mechnisms tht enble QoS services. At the end of

More information

Small Business Networking

Small Business Networking Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology

More information

Performance analysis model for big data applications in cloud computing

Performance analysis model for big data applications in cloud computing Butist Villlpndo et l. Journl of Cloud Computing: Advnces, Systems nd Applictions 2014, 3:19 RESEARCH Performnce nlysis model for big dt pplictions in cloud computing Luis Edurdo Butist Villlpndo 1,2,

More information

Treatment Spring Late Summer Fall 0.10 5.56 3.85 0.61 6.97 3.01 1.91 3.01 2.13 2.99 5.33 2.50 1.06 3.53 6.10 Mean = 1.33 Mean = 4.88 Mean = 3.

Treatment Spring Late Summer Fall 0.10 5.56 3.85 0.61 6.97 3.01 1.91 3.01 2.13 2.99 5.33 2.50 1.06 3.53 6.10 Mean = 1.33 Mean = 4.88 Mean = 3. The nlysis of vrince (ANOVA) Although the t-test is one of the most commonly used sttisticl hypothesis tests, it hs limittions. The mjor limittion is tht the t-test cn be used to compre the mens of only

More information

Small Business Cloud Services

Small Business Cloud Services Smll Business Cloud Services Summry. We re thick in the midst of historic se-chnge in computing. Like the emergence of personl computers, grphicl user interfces, nd mobile devices, the cloud is lredy profoundly

More information

Small Business Networking

Small Business Networking Why Network is n Essentil Productivity Tool for Any Smll Business TechAdvisory.org SME Reports sponsored by Effective technology is essentil for smll businesses looking to increse their productivity. Computer

More information

An Undergraduate Curriculum Evaluation with the Analytic Hierarchy Process

An Undergraduate Curriculum Evaluation with the Analytic Hierarchy Process An Undergrdute Curriculum Evlution with the Anlytic Hierrchy Process Les Frir Jessic O. Mtson Jck E. Mtson Deprtment of Industril Engineering P.O. Box 870288 University of Albm Tuscloos, AL. 35487 Abstrct

More information

Traffic Rank Based QoS Routing in Wireless Mesh Network

Traffic Rank Based QoS Routing in Wireless Mesh Network Trffic Rnk Bsed QoS Routing in Wireless Mesh Network Deep P Kmble #1, Sujth P Terdl *2 #1 Deprtment of Computer Science nd Engineering, Poojy Doddp App College of Engineering, Gulbrg, Krntk, Indi. *2 Deprtment

More information

Section 7-4 Translation of Axes

Section 7-4 Translation of Axes 62 7 ADDITIONAL TOPICS IN ANALYTIC GEOMETRY Section 7-4 Trnsltion of Aes Trnsltion of Aes Stndrd Equtions of Trnslted Conics Grphing Equtions of the Form A 2 C 2 D E F 0 Finding Equtions of Conics In the

More information

Space Vector Pulse Width Modulation Based Induction Motor with V/F Control

Space Vector Pulse Width Modulation Based Induction Motor with V/F Control Interntionl Journl of Science nd Reserch (IJSR) Spce Vector Pulse Width Modultion Bsed Induction Motor with V/F Control Vikrmrjn Jmbulingm Electricl nd Electronics Engineering, VIT University, Indi Abstrct:

More information

Energy Saving Analysis of Variable Primary Flow System with Screw Chiller

Energy Saving Analysis of Variable Primary Flow System with Screw Chiller Energy Sving Anlysis of Vrible Primry Flow System with Screw Chiller Yung-Chung Chng [1], Pin-Cheng Chieng [2], Jyun-Ting Lu [3], Tien-Shun Chn [4], Ching-Ling Chen [5], Cheng-Wen Lee [6] [1] Professor,

More information

2 DIODE CLIPPING and CLAMPING CIRCUITS

2 DIODE CLIPPING and CLAMPING CIRCUITS 2 DIODE CLIPPING nd CLAMPING CIRCUITS 2.1 Ojectives Understnding the operting principle of diode clipping circuit Understnding the operting principle of clmping circuit Understnding the wveform chnge of

More information

DlNBVRGH + Sickness Absence Monitoring Report. Executive of the Council. Purpose of report

DlNBVRGH + Sickness Absence Monitoring Report. Executive of the Council. Purpose of report DlNBVRGH + + THE CITY OF EDINBURGH COUNCIL Sickness Absence Monitoring Report Executive of the Council 8fh My 4 I.I...3 Purpose of report This report quntifies the mount of working time lost s result of

More information

Warm-up for Differential Calculus

Warm-up for Differential Calculus Summer Assignment Wrm-up for Differentil Clculus Who should complete this pcket? Students who hve completed Functions or Honors Functions nd will be tking Differentil Clculus in the fll of 015. Due Dte:

More information

Reasoning to Solve Equations and Inequalities

Reasoning to Solve Equations and Inequalities Lesson4 Resoning to Solve Equtions nd Inequlities In erlier work in this unit, you modeled situtions with severl vriles nd equtions. For exmple, suppose you were given usiness plns for concert showing

More information

Operations with Polynomials

Operations with Polynomials 38 Chpter P Prerequisites P.4 Opertions with Polynomils Wht you should lern: Write polynomils in stndrd form nd identify the leding coefficients nd degrees of polynomils Add nd subtrct polynomils Multiply

More information

Application-Level Traffic Monitoring and an Analysis on IP Networks

Application-Level Traffic Monitoring and an Analysis on IP Networks Appliction-Level Trffic Monitoring nd n Anlysis on IP Networks Myung-Sup Kim, Young J. Won, nd Jmes Won-Ki Hong Trditionl trffic identifiction methods bsed on wellknown port numbers re not pproprite for

More information

Vendor Rating for Service Desk Selection

Vendor Rating for Service Desk Selection Vendor Presented By DATE Using the scores of 0, 1, 2, or 3, plese rte the vendor's presenttion on how well they demonstrted the functionl requirements in the res below. Also consider how efficient nd functionl

More information

LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES

LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES LINEAR TRANSFORMATIONS AND THEIR REPRESENTING MATRICES DAVID WEBB CONTENTS Liner trnsformtions 2 The representing mtrix of liner trnsformtion 3 3 An ppliction: reflections in the plne 6 4 The lgebr of

More information

Bandwidth Allocation for Best Effort Traffic to Achieve 100% Throughput

Bandwidth Allocation for Best Effort Traffic to Achieve 100% Throughput Bndwidth Alloction for Best Effort Trffic to Achieve 100% Throughput Msoumeh Krimi, Zhuo Sun, nd Deng Pn Florid Interntionl University, Mimi, FL E-mils: {mkri001, zsun003, pnd}@fiu.edu Abstrct Generlized

More information

Plotting and Graphing

Plotting and Graphing Plotting nd Grphing Much of the dt nd informtion used by engineers is presented in the form of grphs. The vlues to be plotted cn come from theoreticl or empiricl (observed) reltionships, or from mesured

More information

Mathematics. Vectors. hsn.uk.net. Higher. Contents. Vectors 128 HSN23100

Mathematics. Vectors. hsn.uk.net. Higher. Contents. Vectors 128 HSN23100 hsn.uk.net Higher Mthemtics UNIT 3 OUTCOME 1 Vectors Contents Vectors 18 1 Vectors nd Sclrs 18 Components 18 3 Mgnitude 130 4 Equl Vectors 131 5 Addition nd Subtrction of Vectors 13 6 Multipliction by

More information

The Velocity Factor of an Insulated Two-Wire Transmission Line

The Velocity Factor of an Insulated Two-Wire Transmission Line The Velocity Fctor of n Insulted Two-Wire Trnsmission Line Problem Kirk T. McDonld Joseph Henry Lbortories, Princeton University, Princeton, NJ 08544 Mrch 7, 008 Estimte the velocity fctor F = v/c nd the

More information

Decision Rule Extraction from Trained Neural Networks Using Rough Sets

Decision Rule Extraction from Trained Neural Networks Using Rough Sets Decision Rule Extrction from Trined Neurl Networks Using Rough Sets Alin Lzr nd Ishwr K. Sethi Vision nd Neurl Networks Lbortory Deprtment of Computer Science Wyne Stte University Detroit, MI 48 ABSTRACT

More information

Example 27.1 Draw a Venn diagram to show the relationship between counting numbers, whole numbers, integers, and rational numbers.

Example 27.1 Draw a Venn diagram to show the relationship between counting numbers, whole numbers, integers, and rational numbers. 2 Rtionl Numbers Integers such s 5 were importnt when solving the eqution x+5 = 0. In similr wy, frctions re importnt for solving equtions like 2x = 1. Wht bout equtions like 2x + 1 = 0? Equtions of this

More information

Basic Analysis of Autarky and Free Trade Models

Basic Analysis of Autarky and Free Trade Models Bsic Anlysis of Autrky nd Free Trde Models AUTARKY Autrky condition in prticulr commodity mrket refers to sitution in which country does not engge in ny trde in tht commodity with other countries. Consequently

More information

Quality Evaluation of Entrepreneur Education on Graduate Students Based on AHP-fuzzy Comprehensive Evaluation Approach ZhongXiaojun 1, WangYunfeng 2

Quality Evaluation of Entrepreneur Education on Graduate Students Based on AHP-fuzzy Comprehensive Evaluation Approach ZhongXiaojun 1, WangYunfeng 2 Interntionl Journl of Engineering Reserch & Science (IJOER) ISSN [2395-6992] [Vol-2, Issue-1, Jnury- 2016] Qulity Evlution of Entrepreneur Eduction on Grdute Students Bsed on AHP-fuzzy Comprehensive Evlution

More information

Math 135 Circles and Completing the Square Examples

Math 135 Circles and Completing the Square Examples Mth 135 Circles nd Completing the Squre Exmples A perfect squre is number such tht = b 2 for some rel number b. Some exmples of perfect squres re 4 = 2 2, 16 = 4 2, 169 = 13 2. We wish to hve method for

More information

ClearPeaks Customer Care Guide. Business as Usual (BaU) Services Peace of mind for your BI Investment

ClearPeaks Customer Care Guide. Business as Usual (BaU) Services Peace of mind for your BI Investment ClerPeks Customer Cre Guide Business s Usul (BU) Services Pece of mind for your BI Investment ClerPeks Customer Cre Business s Usul Services Tble of Contents 1. Overview...3 Benefits of Choosing ClerPeks

More information

Experiment 6: Friction

Experiment 6: Friction Experiment 6: Friction In previous lbs we studied Newton s lws in n idel setting, tht is, one where friction nd ir resistnce were ignored. However, from our everydy experience with motion, we know tht

More information

AN ANALYTICAL HIERARCHY PROCESS METHODOLOGY TO EVALUATE IT SOLUTIONS FOR ORGANIZATIONS

AN ANALYTICAL HIERARCHY PROCESS METHODOLOGY TO EVALUATE IT SOLUTIONS FOR ORGANIZATIONS AN ANALYTICAL HIERARCHY PROCESS METHODOLOGY TO EVALUATE IT SOLUTIONS FOR ORGANIZATIONS Spiros Vsilkos (), Chrysostomos D. Stylios (),(b), John Groflkis (c) () Dept. of Telemtics Center, Computer Technology

More information

Helicopter Theme and Variations

Helicopter Theme and Variations Helicopter Theme nd Vritions Or, Some Experimentl Designs Employing Pper Helicopters Some possible explntory vribles re: Who drops the helicopter The length of the rotor bldes The height from which the

More information

Project 6 Aircraft static stability and control

Project 6 Aircraft static stability and control Project 6 Aircrft sttic stbility nd control The min objective of the project No. 6 is to compute the chrcteristics of the ircrft sttic stbility nd control chrcteristics in the pitch nd roll chnnel. The

More information

Software Cost Estimation Model Based on Integration of Multi-agent and Case-Based Reasoning

Software Cost Estimation Model Based on Integration of Multi-agent and Case-Based Reasoning Journl of Computer Science 2 (3): 276-282, 2006 ISSN 1549-3636 2006 Science Publictions Softwre Cost Estimtion Model Bsed on Integrtion of Multi-gent nd Cse-Bsed Resoning Hsn Al-Skrn Informtion Technology

More information

TITLE THE PRINCIPLES OF COIN-TAP METHOD OF NON-DESTRUCTIVE TESTING

TITLE THE PRINCIPLES OF COIN-TAP METHOD OF NON-DESTRUCTIVE TESTING TITLE THE PRINCIPLES OF COIN-TAP METHOD OF NON-DESTRUCTIVE TESTING Sung Joon Kim*, Dong-Chul Che Kore Aerospce Reserch Institute, 45 Eoeun-Dong, Youseong-Gu, Dejeon, 35-333, Kore Phone : 82-42-86-231 FAX

More information

Understanding Basic Analog Ideal Op Amps

Understanding Basic Analog Ideal Op Amps Appliction Report SLAA068A - April 2000 Understnding Bsic Anlog Idel Op Amps Ron Mncini Mixed Signl Products ABSTRACT This ppliction report develops the equtions for the idel opertionl mplifier (op mp).

More information

Use Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions.

Use Geometry Expressions to create a more complex locus of points. Find evidence for equivalence using Geometry Expressions. Lerning Objectives Loci nd Conics Lesson 3: The Ellipse Level: Preclculus Time required: 120 minutes In this lesson, students will generlize their knowledge of the circle to the ellipse. The prmetric nd

More information

Unleashing the Power of Cloud

Unleashing the Power of Cloud Unleshing the Power of Cloud A Joint White Pper by FusionLyer nd NetIQ Copyright 2015 FusionLyer, Inc. All rights reserved. No prt of this publiction my be reproduced, stored in retrievl system, or trnsmitted,

More information

Performance Prediction of Distributed Load Balancing on Multicomputer Systems

Performance Prediction of Distributed Load Balancing on Multicomputer Systems Performnce Prediction of Distributed Lod Blncing on Multicomputer Systems Ishfq Ahmd *, Arif Ghfoor+, nd Kishn Mehrotr * * School of Computer nd Informtion Science, Syrcuse University, Syrcuse, NY 13244

More information

Graphs on Logarithmic and Semilogarithmic Paper

Graphs on Logarithmic and Semilogarithmic Paper 0CH_PHClter_TMSETE_ 3//00 :3 PM Pge Grphs on Logrithmic nd Semilogrithmic Pper OBJECTIVES When ou hve completed this chpter, ou should be ble to: Mke grphs on logrithmic nd semilogrithmic pper. Grph empiricl

More information

Data replication in mobile computing

Data replication in mobile computing Technicl Report, My 2010 Dt repliction in mobile computing Bchelor s Thesis in Electricl Engineering Rodrigo Christovm Pmplon HALMSTAD UNIVERSITY, IDE SCHOOL OF INFORMATION SCIENCE, COMPUTER AND ELECTRICAL

More information

Value Function Approximation using Multiple Aggregation for Multiattribute Resource Management

Value Function Approximation using Multiple Aggregation for Multiattribute Resource Management Journl of Mchine Lerning Reserch 9 (2008) 2079-2 Submitted 8/08; Published 0/08 Vlue Function Approximtion using Multiple Aggregtion for Multittribute Resource Mngement Abrhm George Wrren B. Powell Deprtment

More information

Exponential and Logarithmic Functions

Exponential and Logarithmic Functions Nme Chpter Eponentil nd Logrithmic Functions Section. Eponentil Functions nd Their Grphs Objective: In this lesson ou lerned how to recognize, evlute, nd grph eponentil functions. Importnt Vocbulr Define

More information

ORBITAL MANEUVERS USING LOW-THRUST

ORBITAL MANEUVERS USING LOW-THRUST Proceedings of the 8th WSEAS Interntionl Conference on SIGNAL PROCESSING, ROBOICS nd AUOMAION ORBIAL MANEUVERS USING LOW-HRUS VIVIAN MARINS GOMES, ANONIO F. B. A. PRADO, HÉLIO KOII KUGA Ntionl Institute

More information

T H E S E C U R E T R A N S M I S S I O N P R O T O C O L O F S E N S O R A D H O C N E T W O R K

T H E S E C U R E T R A N S M I S S I O N P R O T O C O L O F S E N S O R A D H O C N E T W O R K Z E S Z Y T Y N A U K O W E A K A D E M I I M A R Y N A R K I W O J E N N E J S C I E N T I F I C J O U R N A L O F P O L I S H N A V A L A C A D E M Y 2015 (LVI) 4 (203) A n d r z e j M r c z k DOI: 10.5604/0860889X.1187607

More information

icbs: Incremental Cost based Scheduling under Piecewise Linear SLAs

icbs: Incremental Cost based Scheduling under Piecewise Linear SLAs i: Incrementl Cost bsed Scheduling under Piecewise Liner SLAs Yun Chi NEC Lbortories Americ 18 N. Wolfe Rd., SW3 35 Cupertino, CA 9514, USA ychi@sv.nec lbs.com Hyun Jin Moon NEC Lbortories Americ 18 N.

More information

Lecture 3 Gaussian Probability Distribution

Lecture 3 Gaussian Probability Distribution Lecture 3 Gussin Probbility Distribution Introduction l Gussin probbility distribution is perhps the most used distribution in ll of science. u lso clled bell shped curve or norml distribution l Unlike

More information

Integration. 148 Chapter 7 Integration

Integration. 148 Chapter 7 Integration 48 Chpter 7 Integrtion 7 Integrtion t ech, by supposing tht during ech tenth of second the object is going t constnt speed Since the object initilly hs speed, we gin suppose it mintins this speed, but

More information

Cost Functions for Assessment of Vehicle Dynamics

Cost Functions for Assessment of Vehicle Dynamics Cost Functions for Assessment of Vehicle Dynmics Dzmitry Svitski Automotive Engineering Deprtment Ilmenu University of Technology Ilmenu, Germny dzmitry.svitski@tu-ilmenu.de Pvel Nedom, Jroslv Mchn Skod

More information

All pay auctions with certain and uncertain prizes a comment

All pay auctions with certain and uncertain prizes a comment CENTER FOR RESEARC IN ECONOMICS AND MANAGEMENT CREAM Publiction No. 1-2015 All py uctions with certin nd uncertin prizes comment Christin Riis All py uctions with certin nd uncertin prizes comment Christin

More information

Factoring Polynomials

Factoring Polynomials Fctoring Polynomils Some definitions (not necessrily ll for secondry school mthemtics): A polynomil is the sum of one or more terms, in which ech term consists of product of constnt nd one or more vribles

More information

Network Configuration Independence Mechanism

Network Configuration Independence Mechanism 3GPP TSG SA WG3 Security S3#19 S3-010323 3-6 July, 2001 Newbury, UK Source: Title: Document for: AT&T Wireless Network Configurtion Independence Mechnism Approvl 1 Introduction During the lst S3 meeting

More information

EQUATIONS OF LINES AND PLANES

EQUATIONS OF LINES AND PLANES EQUATIONS OF LINES AND PLANES MATH 195, SECTION 59 (VIPUL NAIK) Corresponding mteril in the ook: Section 12.5. Wht students should definitely get: Prmetric eqution of line given in point-direction nd twopoint

More information

Introducing Kashef for Application Monitoring

Introducing Kashef for Application Monitoring WextWise 2010 Introducing Kshef for Appliction The Cse for Rel-time monitoring of dtcenter helth is criticl IT process serving vriety of needs. Avilbility requirements of 6 nd 7 nines of tody SOA oriented

More information

Econ 4721 Money and Banking Problem Set 2 Answer Key

Econ 4721 Money and Banking Problem Set 2 Answer Key Econ 472 Money nd Bnking Problem Set 2 Answer Key Problem (35 points) Consider n overlpping genertions model in which consumers live for two periods. The number of people born in ech genertion grows in

More information

Health Information Systems: evaluation and performance of a Help Desk

Health Information Systems: evaluation and performance of a Help Desk 536 Digitl Helthcre Empowering Europens R. Cornet et l. (Eds.) 2015 Europen Federtion for Medicl Informtics (EFMI). This rticle is published online with Open Access by IOS Press nd distributed under the

More information

Techniques for Requirements Gathering and Definition. Kristian Persson Principal Product Specialist

Techniques for Requirements Gathering and Definition. Kristian Persson Principal Product Specialist Techniques for Requirements Gthering nd Definition Kristin Persson Principl Product Specilist Requirements Lifecycle Mngement Elicit nd define business/user requirements Vlidte requirements Anlyze requirements

More information

Babylonian Method of Computing the Square Root: Justifications Based on Fuzzy Techniques and on Computational Complexity

Babylonian Method of Computing the Square Root: Justifications Based on Fuzzy Techniques and on Computational Complexity Bbylonin Method of Computing the Squre Root: Justifictions Bsed on Fuzzy Techniques nd on Computtionl Complexity Olg Koshelev Deprtment of Mthemtics Eduction University of Texs t El Pso 500 W. University

More information

Distributions. (corresponding to the cumulative distribution function for the discrete case).

Distributions. (corresponding to the cumulative distribution function for the discrete case). Distributions Recll tht n integrble function f : R [,] such tht R f()d = is clled probbility density function (pdf). The distribution function for the pdf is given by F() = (corresponding to the cumultive

More information

Enterprise Risk Management Software Buyer s Guide

Enterprise Risk Management Software Buyer s Guide Enterprise Risk Mngement Softwre Buyer s Guide 1. Wht is Enterprise Risk Mngement? 2. Gols of n ERM Progrm 3. Why Implement ERM 4. Steps to Implementing Successful ERM Progrm 5. Key Performnce Indictors

More information

Math Review 1. , where α (alpha) is a constant between 0 and 1, is one specific functional form for the general production function.

Math Review 1. , where α (alpha) is a constant between 0 and 1, is one specific functional form for the general production function. Mth Review Vribles, Constnts nd Functions A vrible is mthemticl bbrevition for concept For emple in economics, the vrible Y usully represents the level of output of firm or the GDP of n economy, while

More information

Research of Flow Allocation Optimization in Hybrid Software Defined Networks Based on Bi-level Programming

Research of Flow Allocation Optimization in Hybrid Software Defined Networks Based on Bi-level Programming Reserch of Flow Alloction Optimiztion in Hybrid Softwre Defined Netwo Bsed on Bi-level Progrmming Abstrct Lulu Zho, Mingchun Zheng b School of Shndong Norml Univeity, Shndong 250014, Chin fryrlnc@163.com,

More information

Learner-oriented distance education supporting service system model and applied research

Learner-oriented distance education supporting service system model and applied research SHS Web of Conferences 24, 02001 (2016) DOI: 10.1051/ shsconf/20162402001 C Owned by the uthors, published by EDP Sciences, 2016 Lerner-oriented distnce eduction supporting service system model nd pplied

More information

Homework #4: Answers. 1. Draw the array of world outputs that free trade allows by making use of each country s transformation schedule.

Homework #4: Answers. 1. Draw the array of world outputs that free trade allows by making use of each country s transformation schedule. Text questions, Chpter 5, problems 1-5: Homework #4: Answers 1. Drw the rry of world outputs tht free trde llows by mking use of ech country s trnsformtion schedule.. Drw it. This digrm is constructed

More information

CHAPTER 11 Numerical Differentiation and Integration

CHAPTER 11 Numerical Differentiation and Integration CHAPTER 11 Numericl Differentition nd Integrtion Differentition nd integrtion re bsic mthemticl opertions with wide rnge of pplictions in mny res of science. It is therefore importnt to hve good methods

More information

Contextualizing NSSE Effect Sizes: Empirical Analysis and Interpretation of Benchmark Comparisons

Contextualizing NSSE Effect Sizes: Empirical Analysis and Interpretation of Benchmark Comparisons Contextulizing NSSE Effect Sizes: Empiricl Anlysis nd Interprettion of Benchmrk Comprisons NSSE stff re frequently sked to help interpret effect sizes. Is.3 smll effect size? Is.5 relly lrge effect size?

More information

Rotating DC Motors Part II

Rotating DC Motors Part II Rotting Motors rt II II.1 Motor Equivlent Circuit The next step in our consiertion of motors is to evelop n equivlent circuit which cn be use to better unerstn motor opertion. The rmtures in rel motors

More information

GFI MilArchiver 6 vs C2C Archive One Policy Mnger GFI Softwre www.gfi.com GFI MilArchiver 6 vs C2C Archive One Policy Mnger GFI MilArchiver 6 C2C Archive One Policy Mnger Who we re Generl fetures Supports

More information

MATH 150 HOMEWORK 4 SOLUTIONS

MATH 150 HOMEWORK 4 SOLUTIONS MATH 150 HOMEWORK 4 SOLUTIONS Section 1.8 Show tht the product of two of the numbers 65 1000 8 2001 + 3 177, 79 1212 9 2399 + 2 2001, nd 24 4493 5 8192 + 7 1777 is nonnegtive. Is your proof constructive

More information

C-crcs Cognitive - Counselling Research & Conference Services (eissn: 2301-2358)

C-crcs Cognitive - Counselling Research & Conference Services (eissn: 2301-2358) C-crcs Cognitive - Counselling Reserch & Conference Services (eissn: 2301-2358) Volume I Effects of Music Composition Intervention on Elementry School Children b M. Hogenes, B. Vn Oers, R. F. W. Diekstr,

More information

2. Transaction Cost Economics

2. Transaction Cost Economics 3 2. Trnsction Cost Economics Trnsctions Trnsctions Cn Cn Be Be Internl Internl or or Externl Externl n n Orgniztion Orgniztion Trnsctions Trnsctions occur occur whenever whenever good good or or service

More information

Recognition Scheme Forensic Science Content Within Educational Programmes

Recognition Scheme Forensic Science Content Within Educational Programmes Recognition Scheme Forensic Science Content Within Eductionl Progrmmes one Introduction The Chrtered Society of Forensic Sciences (CSoFS) hs been ccrediting the forensic content of full degree courses

More information

PERFORMANCE ANALYSIS FOR BANDWIDTH ALLOCATION IN IEEE 802.16 BROADBAND WIRELESS NETWORKS USING BMAP QUEUEING

PERFORMANCE ANALYSIS FOR BANDWIDTH ALLOCATION IN IEEE 802.16 BROADBAND WIRELESS NETWORKS USING BMAP QUEUEING PERFORMANCE ANALYSIS FOR BANDWIDTH ALLOCATION IN IEEE 802.6 BROADBAND WIRELESS NETWORKS USING BMAP QUEUEING Sid EL KAFHALI Abdelli EL BOUCHTI Mohmed HANINI nd Abdelkrim HAQIQ Computer, Networks, Mobility

More information

Estimating Exchange Rate Exposures:

Estimating Exchange Rate Exposures: Estimting Exchnge Rte Exposures: Issues in Model Structure * Gordon M. Bodnr ** Pul H. Nitze School of Advnced Interntionl Studies, The Johns Hopkins University 1740 Msschusetts Avenue NW Wshington, DC

More information

Square Roots Teacher Notes

Square Roots Teacher Notes Henri Picciotto Squre Roots Techer Notes This unit is intended to help students develop n understnding of squre roots from visul / geometric point of view, nd lso to develop their numer sense round this

More information

Modeling POMDPs for Generating and Simulating Stock Investment Policies

Modeling POMDPs for Generating and Simulating Stock Investment Policies Modeling POMDPs for Generting nd Simulting Stock Investment Policies Augusto Cesr Espíndol Bff UNIRIO - Dep. Informátic Aplicd Av. Psteur, 458 - Térreo Rio de Jneiro - Brzil ugusto.bff@uniriotec.br Angelo

More information

Novel Methods of Generating Self-Invertible Matrix for Hill Cipher Algorithm

Novel Methods of Generating Self-Invertible Matrix for Hill Cipher Algorithm Bibhudendr chry, Girij Snkr Rth, Srt Kumr Ptr, nd Sroj Kumr Pnigrhy Novel Methods of Generting Self-Invertible Mtrix for Hill Cipher lgorithm Bibhudendr chry Deprtment of Electronics & Communiction Engineering

More information

Discovering General Logical Network Topologies

Discovering General Logical Network Topologies Discovering Generl Logicl Network Topologies Mrk otes McGill University, Montrel, Quebec Emil: cotes@ece.mcgill.c Michel Rbbt nd Robert Nowk Rice University, Houston, TX Emil: {rbbt, nowk}@rice.edu Technicl

More information

** Dpt. Chemical Engineering, Kasetsart University, Bangkok 10900, Thailand

** Dpt. Chemical Engineering, Kasetsart University, Bangkok 10900, Thailand Modelling nd Simultion of hemicl Processes in Multi Pulse TP Experiment P. Phnwdee* S.O. Shekhtmn +. Jrungmnorom** J.T. Gleves ++ * Dpt. hemicl Engineering, Ksetsrt University, Bngkok 10900, Thilnd + Dpt.hemicl

More information

Algebra Review. How well do you remember your algebra?

Algebra Review. How well do you remember your algebra? Algebr Review How well do you remember your lgebr? 1 The Order of Opertions Wht do we men when we write + 4? If we multiply we get 6 nd dding 4 gives 10. But, if we dd + 4 = 7 first, then multiply by then

More information

Bayesian Updating with Continuous Priors Class 13, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom

Bayesian Updating with Continuous Priors Class 13, 18.05, Spring 2014 Jeremy Orloff and Jonathan Bloom Byesin Updting with Continuous Priors Clss 3, 8.05, Spring 04 Jeremy Orloff nd Jonthn Bloom Lerning Gols. Understnd prmeterized fmily of distriutions s representing continuous rnge of hypotheses for the

More information

Data quality issues for accounting information systems implementation: Systems, stakeholders, and organizational factors

Data quality issues for accounting information systems implementation: Systems, stakeholders, and organizational factors Journl of Technology Reserch Dt qulity issues for ccounting informtion systems implementtion: Systems, stkeholders, nd orgniztionl fctors ABSTRACT Hongjing Xu Butler University Qulity informtion is one

More information

COMPARISON OF SOME METHODS TO FIT A MULTIPLICATIVE TARIFF STRUCTURE TO OBSERVED RISK DATA BY B. AJNE. Skandza, Stockholm ABSTRACT

COMPARISON OF SOME METHODS TO FIT A MULTIPLICATIVE TARIFF STRUCTURE TO OBSERVED RISK DATA BY B. AJNE. Skandza, Stockholm ABSTRACT COMPARISON OF SOME METHODS TO FIT A MULTIPLICATIVE TARIFF STRUCTURE TO OBSERVED RISK DATA BY B. AJNE Skndz, Stockholm ABSTRACT Three methods for fitting multiplictive models to observed, cross-clssified

More information

Curve Sketching. 96 Chapter 5 Curve Sketching

Curve Sketching. 96 Chapter 5 Curve Sketching 96 Chpter 5 Curve Sketching 5 Curve Sketching A B A B A Figure 51 Some locl mximum points (A) nd minimum points (B) If (x, f(x)) is point where f(x) reches locl mximum or minimum, nd if the derivtive of

More information

persons withdrawing from addiction is given by summarizing over individuals with different ages and numbers of years of addiction remaining:

persons withdrawing from addiction is given by summarizing over individuals with different ages and numbers of years of addiction remaining: COST- BENEFIT ANALYSIS OF NARCOTIC ADDICTION TREATMENT PROGRAMS with Specil Reference to Age Irving Leveson,l New York City Plnning Commission Introduction Efforts to del with consequences of poverty,

More information

A Network Management System for Power-Line Communications and its Verification by Simulation

A Network Management System for Power-Line Communications and its Verification by Simulation A Network Mngement System for Power-Line Communictions nd its Verifiction y Simultion Mrkus Seeck, Gerd Bumiller GmH Unterschluerscher-Huptstr. 10, D-90613 Großhersdorf, Germny Phone: +49 9105 9960-51,

More information

ENHANCING CUSTOMER EXPERIENCE THROUGH BUSINESS PROCESS IMPROVEMENT: AN APPLICATION OF THE ENHANCED CUSTOMER EXPERIENCE FRAMEWORK (ECEF)

ENHANCING CUSTOMER EXPERIENCE THROUGH BUSINESS PROCESS IMPROVEMENT: AN APPLICATION OF THE ENHANCED CUSTOMER EXPERIENCE FRAMEWORK (ECEF) ENHNCING CUSTOMER EXPERIENCE THROUGH BUSINESS PROCESS IMPROVEMENT: N PPLICTION OF THE ENHNCED CUSTOMER EXPERIENCE FRMEWORK (ECEF) G.J. Both 1, P.S. Kruger 2 & M. de Vries 3 Deprtment of Industril nd Systems

More information

Lump-Sum Distributions at Job Change, p. 2

Lump-Sum Distributions at Job Change, p. 2 Jnury 2009 Vol. 30, No. 1 Lump-Sum Distributions t Job Chnge, p. 2 E X E C U T I V E S U M M A R Y Lump-Sum Distributions t Job Chnge GROWING NUMBER OF WORKERS FACED WITH ASSET DECISIONS AT JOB CHANGE:

More information

Allocation Strategies of Virtual Resources in Cloud-Computing Networks

Allocation Strategies of Virtual Resources in Cloud-Computing Networks RESEARCH ARTICLE OPEN ACCESS Alloction Strtegies of Virtul Resources in Cloud-Computing Networks 1 K.Delhi Bbu, 2 D.Giridhr Kumr Deprtment of Computer Science nd Engineering, SreeVidynikethnEngg.College,

More information

SyGEMe: Integrated Municipal Facilities Management of Water Ressources Swiss Geoscience Meeting, Neuchâtel, 21 novembre 2009 k

SyGEMe: Integrated Municipal Facilities Management of Water Ressources Swiss Geoscience Meeting, Neuchâtel, 21 novembre 2009 k SyGEMe: Integrted Municipl Fcilities Mngement of Wter Ressources Tool presenttion, choice of technology, mn-mchine mchine interfce, business opportunities nd prospects 1. Introduction 2. Mn-mchine interfce

More information

Dynamic TDMA Slot Assignment in Ad Hoc Networks

Dynamic TDMA Slot Assignment in Ad Hoc Networks Dynmic TDMA Slot Assignment in Ad Hoc Networks Akimitsu KANZAKI, Toshiki UEMUKAI, Tkhiro HARA, Shojiro NISHIO Dept. of Multimedi Eng., Grd. Sch. of Informtion Science nd Technology, Osk Univ. Dept. of

More information