Heterogeneity in Vulnerable Hosts Slows Down Worm Propagation
|
|
- Ralph Cannon
- 6 years ago
- Views:
Transcription
1 Heterogenety n Vulnerable Hosts Slows Down Worm Propagaton Zesheng Chen and Chao Chen Department of Engneerng Indana Unversty - Purdue Unversty Fort Wayne, Indana 4685 Emal: {zchen, chen}@engr.pfw.edu Abstract Worm attacks contnue to be a sgnfcant threat to the Internet and have been a man tool used by botnets to recrut bots. Worm propagaton models are mportant for understandng worm dynamcs and desgnng effectve and effcent detecton and defense systems. The exstng models, however, gnore the heterogenety n vulnerable hosts and assume that the wormscannng rate s the same for all nfected hosts. In ths work, we analytcally and emprcally study the mpact of heterogenety of vulnerable hosts on worm propagaton. Specfcally, we frst apply the Jensen s nequalty to show that the heterogenety n vulnerable hosts ndeed hnders the speed of worm propagaton. We then conjecture, through the approxmaton analyss, that f the degree of the heterogenety n vulnerable hosts s hgher, the worm spreads slower. Next, we propose a novel model to predct and characterze worm dynamcs among heterogeneous vulnerable hosts. Fnally, applyng the scale-down smulatons and smulatng the propagaton of a Wtty-lke worm n the Internet, we verfy our analytcal results and demonstrate that our proposed model can accurately predct the spread of worms among heterogeneous vulnerable hosts. I. INTRODUCTION Worms nfect vulnerable hosts and use them to compromse other vulnerable hosts. Such a self-propagaton attack has been a sgnfcant threat to network securty snce. Internet worms, such as Code Red, Nmda, Slammer, Wtty, and Storm, nfected a large number of hosts and caused huge damages. In recent years, worms have also been a man tool used by botnets to recrut a certan number of compromsed machnes and collect the nformaton of nfected hosts. Therefore, t s mportant and mperatve to accurately model the spread of worms n the Internet. Worm propagaton models can help better understand worm dynamc characterstcs. More mportantly, such models are fundamental for detectng and defendng aganst Internet worms. Mathematcal models of worm spreadng have been wdely studed. For example, dfferental equatons have been used to descrbe random-scannng worms [], [9] and to desgn a worm detecton system [8]. A dscrete-tme model has been proposed wth the consderaton of host recovery and patch, and has been exploted to montor, detect, and defend aganst worms []. A stochastc model has been studed to reflect the varaton of worm propagaton and ts mpact to worm detecton []. All exstng models, however, assume that vulnerable hosts are homogeneous and as a result, that all nfected hosts use the same scannng rate to search for targets. Two related works [7], [6] consder that the scannng rate of nfected hosts can vary wth tme. But these two works also make the assumpton that the worm-scannng rate s the same for all nfected hosts. Therefore, the mpact of heterogenety n vulnerable hosts on worm propagaton has not been studed yet. Vulnerable hosts n the Internet have been shown to be sgnfcantly heterogeneous. The network condtons and the computer performance of end-hosts are very dfferent. Specfcally, t has been shown that 7% of the end-hosts n a popular BtTorrent system have an upload capacty between 5 Kbps and Mbps, whereas % of them have an upload capacty of Mbps or more [5]. Moreover, 64% of the avalable resources are contrbuted by only 5% of hosts that have the bandwdth between 55 Mbps and Mbps. A measurement study of the Wtty worm also ndcates strong heterogenety n vulnerable hosts []. For nstance, the bt rates of nfected hosts span from less than 56 Kbps to more than Mbps. Hence, when studyng worm propagaton models, we cannot gnore the effect of the heterogenety n vulnerable hosts. The goal of ths work s to study the mpact of heterogenety n vulnerable hosts on worm propagaton. Specfcally, we attempt to answer the followng questons: Does heterogenety n vulnerable hosts slow down worm propagaton? If vulnerable hosts have a hgher degree of heterogenety, would ths have a greater mpact on worm spreadng? How can we effectvely predct and model worm propagaton among heterogeneous vulnerable hosts? To answer these questons, we analytcally and emprcally study the worm propagaton among both homogeneous and heterogeneous vulnerable hosts. Our analyss s based on the probablstc model, and the nequalty and approxmaton technques; whereas the smulaton uses the scale-down method and mmcs the spread of the Wtty-lke worm n the Internet. Specfcally, we summarze our dscoveres and contrbutons n the followng: Through both analyss and smulaton, we fnd that statstcally the worm has a smaller spreadng speed among heterogeneous vulnerable hosts wth dstnct scannng rates than among homogeneous vulnerable hosts wth the same scannng rate. For nstance, we demonstrate that a Wtty-lke worm can be slowed down three tmes on average n the heterogeneous case than n the homoge-
2 neous case. Therefore, heterogenety n vulnerable hosts can potentally slow down worm spreadng sgnfcantly. We show analytcally and conjecture that f the degree of heterogenety n vulnerable hosts s hgher, the worm propagates slower. Our smulaton results verfy the conjecture. Ths ndcates that the current hgh degree of heterogenety among vulnerable hosts n the Internet ndeed helps defenders to gan some tme to respond to worm attacks. We then desgn a novel model to predct the spread of worms among heterogeneous vulnerable hosts. Such a model characterzes the worm propagaton delay,.e., the tme dfference between the homogeneous case and the heterogeneous case. Smulaton results show that our model can accurately predct the dynamcs of worm propagaton among heterogeneous vulnerable hosts. The remander of ths paper s structured as follows. Secton II dscusses the heterogenety n vulnerable hosts. Secton III gves our analyss on worm propagaton among heterogeneous vulnerable hosts, whereas Secton IV uses smulatons to verfy our analytcal results. Fnally, Secton V concludes ths paper. II. HETEROGENEITY IN VULNERABLE HOSTS Vulnerable hosts n the Internet are heterogeneous. Ths les n the fact that end-hosts n the Internet have dstnct bandwdth and computer performance. A host may connect to the Internet through a dal-up connecton (e.g., 56 Kbps), a dgtal subscrber lne (DSL) (e.g., 4 Kbps 5 Kbps), a local area network (LAN) (e.g., Mbps, Mbps, or Gbps), or a wreless LAN (e.g., 54 Mbps) [7]. Moreover, many worms such as Slammer and Wtty are bandwdth lmted and send packets as fast as the nfected hosts Internet connecton allows [8], []. A measurement study on the Wtty worm has shown that the nfected hosts are heterogeneous []. Specfcally, whle the average transmsson speed of an nfected host s Mbps, 6% of nfected hosts transmt wth bt rates between 96 Kbps and 5 Kbps. For an ndvdual nfected host, the bandwdth manly determnes how many scans per unt tme a bandwdth-lmted worm can send to fnd targets,.e., the worm-scannng rate. If an nfected host has a hgher bandwdth, the worm-scannng rate s always hgher. In ths work, therefore, we use the varaton of worm-scannng rates to reflect the heterogenety n vulnerable hosts. III. THEORETICAL ANALYSIS Snce vulnerable hosts have dstnct bandwdth and computer performance, worm-scannng rates from nfected hosts can be very dfferent. In ths paper, we specfcally focus on the mpact of the varaton of scannng rates on worm propagaton and make several smplfed assumptons. Frst, we assume that once a host s nfected, t remans n the nfecton state. Such a susceptble nfected (SI) model has been wdely used n studyng worm spreadng [], [9], [], [4], []. Second, we focus on random-scannng worms. Random scannng selects target IPv4 addresses unformly and has been exploted by many worms such as Code Red [9], Slammer [8], and Wtty []. The observatons found n ths paper, however, can be well extended to other scannng methods such as localzed scannng [] and mportance scannng []. Fnally, whle the scannng rates of nfected hosts can be dfferent from each other, we assume that the scannng rate of an ndvdual host does not vary wth tme. Ths s a reasonable assumpton for two reasons: () As ndcated by our analyss, the tme perod of worm propagaton that we are nterested n s at the early stage,.e., before the worm has nfected many hosts and congested networks. () It has been observed that an nfected host always scans for vulnerable hosts at the maxmum speed allowed by ts network condtons and computng resources [6]. In ths secton, we frst show theoretcally that compared wth worm propagaton among homogeneous vulnerable hosts, worm spreadng s slowed down among heterogeneous vulnerable hosts. We then demonstrate and conjecture that f the degree of heterogenety n vulnerable hosts s hgher, worms spread slower. Fnally, we provde a novel worm model that characterzes the spread of worms among heterogeneous vulnerable hosts. A. Comparng Worm Propagaton wth Homogeneous Vulnerable Hosts and wth Heterogeneous Vulnerable Hosts We use a dscrete-tme system to analyze the effect of the varaton of scannng rates on worm propagaton. Specfcally, t s assumed that there are totally N vulnerable hosts and currently I nfected hosts. Infected host ( =,,,I) uses a scannng rate of s,.e., sends s scans per unt tme. Then, the total number of scans at the next tme step s = s. Therefore, the probablty that an unnfected vulnerable host s ht by a worm scan at the next tme step s p h = N I I s, () = where s the scannng space. Thus, the tme to recrut a new vctm, T, follows the geometrc dstrbuton,.e., Pr(T = k) = p h ( p h ) k, k =,,, () whch leads to E[T s,s,,s I ] = = p h (N I) = s. () It can be seen that f E[T] s smaller, the worm spreads faster. If all nfected hosts are homogeneous, s = s,,.e., the scannng rate for all nfected hosts s a constant. Thus, the expected tme to recrut a new vctm s E[T] = si(n I). (4) On the other hand, f nfected hosts are heterogeneous, the scannng rate can be very dfferent for dstnct nfected hosts. Because of the nature of random scannng, each nstant of worm propagaton can nfect vulnerable hosts n totally dfferent orders. Hence, we assume that s s are ndependent
3 and dentcally-dstrbuted (..d.) random varables wth mean s and varance σ (σ ). Note that f σ =, vulnerable hosts are homogeneous; otherwse, they are heterogeneous. Therefore, from the law of total expectaton, we have E[T] = E[E[T s,s,,s I ]] = N I E [ = s ]. (5) Accordng to the Jensen s nequalty [], [4], f X s a random varable, f s a strctly convex functon (.e., f (x) > ), and E[X] and E[f(X)] exst, then E[f(X)] f(e[x]), (6) where the equalty holds f an only f X s a constant. Here, we apply the Jensen s nequalty by settng f(x) = x. Snce f (x) = x and f (x) = x > when x >, x s a strctly convex functon. We then fnd from Equaton (5) that E[T] N I E[ = s ] = si(n I), (7) where the equalty holds f and only f σ =. Comparng Equaton (4) and Inequalty (7), we have the followng theorem. Theorem : If worm-scannng rates s s are..d. random varables wth mean s and varance σ, then the worm spreads slower when σ > than when σ =. That s, statstcally the worm has a smaller spreadng speed among heterogeneous vulnerable hosts wth dstnct scannng rates than among homogeneous vulnerable hosts wth the same scannng rate. Theorem ndcates that the exstng worm propagaton models gnore the varaton of scannng rates and thus overestmate the worm propagaton speed. Moreover, Theorem reflects that the heterogenety n vulnerable hosts ndeed hnders worm propagaton and can help defenders gan some tme to respond to worm attacks. B. Conjecturng the Impact of the Degree of Heterogenety n Vulnerable Hosts Snce the heterogenety n vulnerable hosts slows down worm propagaton, a queston arses: Would the worm spread slower f the degree of the heterogenety of vulnerable hosts s hgher? That s, when σ ncreases, would E[T] be larger? To answer ths queston, we apply Taylor expanson and approxmaton technques. Specfcally, we study the Taylor expanson of functon f(x) = x,.e., f(x) = a + f (a)(x a) + f (a)(x a) + H (8) a x a (x a) a + a. (9) In the above equaton, H contans the hgher-order terms and can be gnored. Note that E[ = s ] = si. Then, settng x = = s and a = si n the above equaton, we have = s si s I + ( = s si) s I. () = s si Takng the expectaton on both sdes of the above equaton, we obtan [ ] E = s si + E[( = s si) ] s I () = si + Var[ = s ] s I () = si + σ s I. () Therefore, from Equatons (5) and (), the expected tme to recrut a new vctm s E[T] si(n I) + σ s I (N I). (4) In the above equaton, the frst term (.e., si(n I) ) s dentcal to E[T] for the homogeneous case, and the second term s proportonal to σ. Based on ths approxmaton result, t s obvous that when σ ncreases, E[T] also ncreases. Hence, we have the followng conjecture. Conjecture : When σ s larger, the worm spreads slower. That s, the worm propagates slower among the vulnerable hosts wth a hgher degree of heterogenety. C. Modelng Worm Propagaton among Heterogeneous Vulnerable Hosts We apply a novel approach to characterze the spread of random-scannng worms among heterogeneous vulnerable hosts. Instead of obtanng the propagaton speed of worms, we attempt to study how much worm propagaton delay, compared wth the homogeneous case, s caused by the varaton of worm-scannng rates. In ths way, once we smulate or model the worm spreadng among homogeneous vulnerable hosts, we can predct or model the worm propagaton among heterogeneous vulnerable hosts. We frst use two worm-scannng rates as an example to demonstrate our modelng procedure. We assume that among N vulnerable hosts, p N hosts have a scannng rate of r, and ( p) N hosts have a scannng rate of r, where p and r r. That s, a randomly selected nfected host has a scannng rate of r wth probablty p and a scannng rate of r wth probablty p. Thus, the average scannng rate s s = pr + ( p)r. That s, p = r s r r. Note that p can be derved, gven arbtrary values of r, r, and s. Moreover, among the I nfected hosts, the number of hosts havng the scannng rate of r follows the bnomal dstrbuton B(I, p). If k nfected hosts have a scannng rate of r, then = s = kr + (I k)r. From Equaton (5), we then obtan [ ] E = s = I k= ( ) I p k ( p) I k. k kr + (I k)r (5) Therefore, based on the above equaton and Equaton (4), we can calculate the tme dfference to recrut a new vctm between the heterogeneous case and the homogeneous case,
4 4.e., E[T I ] = I k= ( ) I p k ( p) I k k [kr + (I k)r ](N I) si(n I). (6) Accordng to the feature of the bnomal dstrbuton, when I s large, kr +(I k)r approaches si wth a hgh probablty, and thus E[T I ] s very small and can be gnored. Therefore, we only need to calculate the tme dfference when I s not large (e.g., I % of the total number of vulnerable hosts). In other words, the worm propagaton dfference between the heterogeneous case and the homogeneous case only occurs at the early stage of worm spreadng when the number of nfected hosts s small. Statstcally, once a worm has recruted a suffcent number of nfected hosts, the heterogenety n vulnerable hosts has lttle mpact on the worm propagaton. On the other hand, when a worm has just started spreadng from one or a small number of nfected hosts, the mpact of the heterogenety n vulnerable hosts on worm dynamcs can be sgnfcant, whch wll be shown n the next secton. Specfcally, f we assume that a worm starts spreadng from one nfected host and set I as the upper bound for calculatng E[T I ] n Equaton (6), then D H = I = E[T ] (7) represents how much delay s caused by the varaton of scannng rates at the early stage of worm propagaton. That s, once we obtan the propagaton curve for worms among homogeneous vulnerable hosts, we can then shft the curve wth the delay D H to predct the worm spreadng among heterogeneous vulnerable hosts wth the same average scannng rate. Note that such a modelng procedure can be easly extended to the case of multple worm-scannng rates or the case when worm-scannng rates follow an arbtrary dstrbuton. For example, when a worm has multple scannng rates (.e., r, r,, r m ), an nfected host has a scannng rate of r wth probablty p, where m s the number of scannng rates and m = p =. Let n (n ) denote the number of nfected hosts among I nfected hosts that have the scannng rate of r, where m = n = I. Then, n s have a multnomal dstrbuton wth parameters I and p s, and = s = m = n r. Therefore, Equaton (5) becomes E [ = s ] = n=i (I!)( m = pn ) ( m = n!)( m = n r ). (8) Moreover, f s s are..d. random varables wth probablty dstrbuton f S (s). Then, [ ] I = E = s = f S(s ) = s ds ds I. (9) In a smlar way, we can obtan E [T I ] and D H for the worm wth multple scannng rates or an arbtrary dstrbuton of scannng rates, and use them to predct the worm propagaton among heterogeneous vulnerable hosts. IV. SIMULATION VERIFICATION We verfy the analytcal results n the prevous secton by smulatng the spread of a worm among vulnerable hosts wth both homogeneous and heterogeneous scannng rates. As an ntal attempt, we only study random-scannng worms wth two scannng rates. That s, we assume that some nfected hosts have a scannng rate of scan, whereas others have a scannng rate of scan. If scan = scan, t s the homogeneous case; otherwse, t s the heterogeneous case. Both homogeneous and heterogeneous cases have the same average worm-scannng rate. Moreover, the target of each worm scan s created by a random number generator over the scannng space, so that each host s ht by the worm scan wth an equal probablty. Once an unnfected vulnerable host s ht by a worm scan, we record the nfecton tme,.e., when ths vulnerable host s compromsed. Based on ths nfecton tme, we can count the number of nfected hosts at each tme step and thus obtan the worm propagaton curve. In our smulatons, the worm starts spreadng from one nfected host (.e., htlst = ), whch s randomly selected from the vulnerable hosts. To obtan the analytcal results for worm propagaton n the heterogeneous case, we frst obtan the smulaton results for worm spreadng n the homogeneous case, and use Equatons (6) and (7) to calculate the delay (.e., D H ) caused by the varaton of scannng rates. We then shft the worm propagaton curve from the homogeneous case wth the delay D H to predct worm spreadng n the heterogeneous case. Specfcally, n ths secton we frst apply scale-down smulatons to obtan the observatons of worm propagaton n a /6 network. We then smulate the spread of Wtty worms n the IPv4 address space. A. Scale-Down Smulatons A scale-down smulaton studes worm propagaton n a much smaller scannng space, nstead of the IPv4 address space that contans IP addresses [5]. In such a way, the patterns of worm spreadng can be obtaned n a much shorter tme through smulatons. We apply the technque of scale-down smulatons and smulate the spread of randomscannng worms n a /6 subnet. Specfcally, we assume that the scannng space s 6 (.e., = 6556), the number of vulnerable hosts s 5 (.e., N = 5), and the average scannng rate s /second (.e., s = /second). Fgure shows the smulaton results of worm propagaton wth four cases of two scannng rates: () scan = scan = ; () scan = 5 and scan = 5; () scan = and scan = 9; (4) scan = and scan = 9. The curves n the fgure are averages over runs. It can be seen that compared wth the worm n the homogeneous case (.e., case ()), worms spread slower n the heterogeneous cases (.e., cases ()-(4)), whch verfes
5 5 Number of nfected hosts 5 4 scan = scan = scan = 5, scan = 5 scan =, scan = 9 scan =, scan = Tme (second) Fg.. Impact of scannng-rate varaton on worm propagaton n scale-down smulatons ( = 6556, N = 5, s = /second, and htlst = ). Number of nfected hosts 5 4 scan = 5, scan = 5 (smulaton) scan = 5, scan = 5 (model) scan =, scan = 9 (smulaton) scan =, scan = 9 (model) scan =, scan = 9 (smulaton) scan =, scan = 9 (model) Tme (second) Fg.. Comparsons of worm propagaton from scale-down smulatons and from the model ( = 6556, N = 5, s = /second, htlst =, and I = 5). Theorem. Moreover, f the degree of the heterogenety n vulnerable hosts s hgher, the worm spreads slower, whch confrms Conjecture. Specfcally, the worm takes on average 8. seconds to nfect all vulnerable hosts n case (), whereas the worm uses 8.8, 6., and 55. seconds n cases (), (), and (4), respectvely. Moreover, t can be seen from the fgure that after the worm has nfected a certan number of hosts (e.g., % of vulnerable hosts), the propagaton curves for all four cases are dentcal, whch verfes our observatons from Equaton (6). Fgure compares the smulaton results to our analytcal results for the heterogeneous cases. In Equaton (7), we set 5 as the upper bound (.e., I = 5) to calculate the delay (.e., D H ). Specfcally, we fnd that D H =.7, 8., and 6.8 seconds for cases ()-(4). From the fgure, t can be seen that the curves of analytcal results and smulaton results overlap, ndcatng that our predcton s accurate. B. Wtty-Worm Propagaton Smulatons Next, we smulate the spread of a worm n the IPv4 address space, usng the parameters from the Wtty worm. Specfcally, the Wtty worm scans the entre IPv4 address space (.e., = ), targets 5599 vulnerable hosts (.e., N = 5599), and uses an average scannng rate of /seconds (.e., s = /seconds) []. We consder three cases of two worm-scannng rates: () scan = scan = ; () scan = and scan = ; () scan = and scan =. For case (), two scannng rates dffer tmes, whch s motvated from the observaton that the bandwdth capacty of end-hosts can have tmes dfference [5]. For each scenaro, we smulate runs wth dfferent seeds. Snce the major dfference among three cases occurs n the tme perod before the worm nfect a sgnfcant porton of vulnerable hosts, our smulator stops runnng when the worm has compromsed hosts. Fgure shows the spread of the Wtty worm wth three dfferent combnatons of two scannng rates. In each subfgure, the 5% curve ndcates that a worm spreads no faster than ths curve n 5 out of smulaton runs. The smlar defnton s appled to the 5%, 5%, 75%, and 95% curves. Moreover, the mean curve s the average over runs. It can be seen that the worm propagates faster n the homogeneous case than n the heterogeneous cases. Furthermore, when the degree of heterogenety n vulnerable hosts ncreases, the worm spreads slower, and the varaton of worm propagaton s larger. These observatons are smlar to those n the scale-down smulatons and verfy our analyss. Specfcally, comparng cases () and (), we fnd that the worm uses on average 756. seconds to nfect hosts n the homogeneous case, whereas the worm needs.9 seconds to compromse the same number of hosts n the heterogeneous case. Ths means that the worm s slowed down about tmes due to the varaton of scannng rates and ndcates that the heterogenety n vulnerable hosts can potentally mpact worm spreadng sgnfcantly. We then further evaluate the performance of our predcton to worm propagaton among heterogeneous vulnerable hosts n Fgure 4. In our predcaton, we use only as the upper bound n Equaton (7),.e., I =. In ths fgure, the curves of smulatons are the averages over runs, whereas the curves of the model are based on Equatons (6) and (7). It can also be seen that the curves of smulaton and analytcal results are very close, ndcatng that our model well characterzes the dynamcs of worm propagaton among heterogeneous vulnerable hosts. V. CONCLUSIONS In ths work, we have shown that heterogenety n vulnerable hosts slows down worm propagaton through both analyss and smulaton. Moreover, a hgher degree of heterogenety n vulnerable hosts leads to slower propagaton of worms. We have also desgned a new model to characterze worm spreadng among heterogeneous vulnerable hosts. Our model focuses on the worm propagaton tme dfference between the heterogeneous case and the homogeneous case, and s shown emprcally to have a good performance to predct worm dynamcs. To the best of our knowledge, ths s the
6 6 Number of nfected hosts.5 x % 5% 5% 75% 95% Mean Number of nfected hosts.5 x % 5% 5% 75% 95% Mean Number of nfected hosts.5 x % 5% 5% 75% 95% Mean Tme (second) (a) Case : scan = scan = 5 5 Tme (second) (b) Case : scan = and scan = 4 Tme (second) (c) Case : scan = and scan = Fg.. Impact of scannng-rate varaton on wtty-worm propagaton ( =, N = 5599, s = /second, and htlst = ). Number of nfected hosts 5 x 4 4 scan =, scan = (smulaton) scan =, scan = (model) scan =, scan = (smulaton) scan =, scan = (model) Tme (second) Fg. 4. Comparsons of wtty-worm propagaton from smulatons and from the model ( =, N = 5599, s = /second, htlst =, and I = ). frst attempt n understandng the mpact of the heterogenety of vulnerable hosts on worm propagaton quanttatvely. As our on-gong work, we plan to extend the study to other scannng methods such as mportance scannng. REFERENCES [] Z. Chen, L. Gao, and K. Kwat, Modelng the spread of actve worms, n Proc. of INFOCOM, vol., San Francsco, CA, Apr., pp [] Z. Chen and C. J, Optmal worm-scannng method usng vulnerablehost dstrbutons, Internatonal Journal of Securty and Networks: Specal Issue on Computer and Network Securty, vol., no. /, 7. [] Z. Chen and C. J, An nformaton-theoretc vew of network-aware malware attacks, IEEE Transactons on Informaton Forenscs and Securty, vol. 4, no., Sept. 9, pp [4] T. M. Cover and J. A. Thomas, Elements of Informaton Theory. New York: Wley, 99. [5] T. Isdal, M. Patek, A. Krshnamurthy, and T. Anderson, Leveragng BtTorrent for end host measurements, n Proc. of the 8th Passve and Actve Measurement Conference (PAM 7), Louvan-la-neuve, Belgum, Apr. 7. [6] E. Krman and C. S. Hood, Analyss of a scannng model of worm propagaton, Journal n Computer Vrology, vol. 6, no.,, pp. -4. [7] J. F. Kurose and K. W. Ross, Computer Networkng: A Top-Down Approach, 4th Edton, Pearson Educaton, Inc., 8. [8] D. Moore, V. Paxson, S. Savage, C. Shannon, S. Stanford, and N. Weaver, Insde the Slammer worm, IEEE Securty and Prvacy, vol., no. 4, July, pp. -9. [9] D. Moore, C. Shannon, and J. Brown, Code-red: a case study on the spread and vctms of an Internet worm, n ACM SIGCOMM/USENIX Internet Measurement Workshop, Marselle, France, Nov.. [] D. M. Ncol, The mpact of stochastc varance on worm propagaton and detecton, n Proc. ACM/CCS Workshop on Rapd Malcode (WORM 6), Farfax, VA, Nov. 6. [] S. M. Ross, Stochastc Processes, Second Edton. John Wley & Sons, Inc., 996. [] C. Shannon and D. Moore, The spread of the Wtty worm, IEEE Securty and Prvacy, vol., no 4, Jul-Aug 4, pp [] S. Stanford, V. Paxson, and N. Weaver, How to wn the Internet n your spare tme, n Proc. of the th USENIX Securty Symposum (Securty ), San Francsco, CA, Aug., pp [4] M. Vojnovc, V. Gupta, T. Karaganns, and C. Gkantsds, Samplng strateges for epdemc-style nformaton dssemnaton, IEEE/ACM Transactons on Networkng, vol. 8, no. 4, Aug., pp. -5. [5] N. Weaver, I. Hamadeh, G. Kesds, and V. Paxson, Prelmnary results usng scale-down to explore worm dynamcs, n Proc. of the nd ACM Workshop on Rapd Malcode (WORM 4), Farfax, VA, Oct. 4. [6] S. We and J. Mrkovc, Correctng congeston-based error n network telescopes observatons of worm dynamcs, n Proc. of the 8th Internet Measurement Conference (IMC 8), Voulagmen, Greece, Oct. 8. [7] C. C. Zou, W. Gong, and D. Towsley, Code red worm propagaton modelng and analyss, n Proc. of the 9th ACM Conference on Computer and Communcaton Securty (CCS ), Washngton DC, Nov., pp [8] C. C. Zou, W. Gong, D. Towsley, and L. Gao, The montorng and early detecton of Internet worms, IEEE/ACM Transactons on Networkng, vol., no. 5, Oct. 5, pp [9] C. C. Zou, D. Towsley, and W. Gong, On the performance of Internet worm scannng strateges, Elsever Journal of Performance Evaluaton, vol. 6. no. 7, July 6, pp. 7-7.
X- Chart Using ANOM Approach
ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationAnalysis of Collaborative Distributed Admission Control in x Networks
1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,
More informationSome Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.
Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationNetwork Coding as a Dynamical System
Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.
More informationA Closed-Form Expression for Static Worm-Scanning Strategies
A Closed-Form Expression for Static Worm-Scanning Strategies Zesheng Chen Department of Electrical & Computer Engineering Florida International University Miami, FL 7 zchen@fiu.edu Chao Chen Department
More informationy and the total sum of
Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton
More informationQuantifying Responsiveness of TCP Aggregates by Using Direct Sequence Spread Spectrum CDMA and Its Application in Congestion Control
Quantfyng Responsveness of TCP Aggregates by Usng Drect Sequence Spread Spectrum CDMA and Its Applcaton n Congeston Control Mehd Kalantar Department of Electrcal and Computer Engneerng Unversty of Maryland,
More informationS1 Note. Basis functions.
S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationPrivate Information Retrieval (PIR)
2 Levente Buttyán Problem formulaton Alce wants to obtan nformaton from a database, but she does not want the database to learn whch nformaton she wanted e.g., Alce s an nvestor queryng a stock-market
More informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationThe Research of Support Vector Machine in Agricultural Data Classification
The Research of Support Vector Machne n Agrcultural Data Classfcaton Le Sh, Qguo Duan, Xnmng Ma, Me Weng College of Informaton and Management Scence, HeNan Agrcultural Unversty, Zhengzhou 45000 Chna Zhengzhou
More informationThe Shortest Path of Touring Lines given in the Plane
Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He
More informationReducing Frame Rate for Object Tracking
Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg
More informationExplicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements
Explct Formulas and Effcent Algorthm for Moment Computaton of Coupled RC Trees wth Lumped and Dstrbuted Elements Qngan Yu and Ernest S.Kuh Electroncs Research Lab. Unv. of Calforna at Berkeley Berkeley
More informationSum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints
Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan
More informationCS 534: Computer Vision Model Fitting
CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust
More informationDetermining the Optimal Bandwidth Based on Multi-criterion Fusion
Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn
More informationNeural Network Control for TCP Network Congestion
5 Amercan Control Conference June 8-, 5. Portland, OR, USA FrA3. Neural Network Control for TCP Network Congeston Hyun C. Cho, M. Sam Fadal, Hyunjeong Lee Electrcal Engneerng/6, Unversty of Nevada, Reno,
More informationWishing you all a Total Quality New Year!
Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma
More informationFusion Performance Model for Distributed Tracking and Classification
Fuson Performance Model for Dstrbuted rackng and Classfcaton K.C. Chang and Yng Song Dept. of SEOR, School of I&E George Mason Unversty FAIRFAX, VA kchang@gmu.edu Martn Lggns Verdan Systems Dvson, Inc.
More informationMathematics 256 a course in differential equations for engineering students
Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the
More informationFor instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)
Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A
More informationQuery Clustering Using a Hybrid Query Similarity Measure
Query clusterng usng a hybrd query smlarty measure Fu. L., Goh, D.H., & Foo, S. (2004). WSEAS Transacton on Computers, 3(3), 700-705. Query Clusterng Usng a Hybrd Query Smlarty Measure Ln Fu, Don Hoe-Lan
More informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationAn Entropy-Based Approach to Integrated Information Needs Assessment
Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationVISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
UbCC 2011, Volume 6, 5002981-x manuscrpts OPEN ACCES UbCC Journal ISSN 1992-8424 www.ubcc.org VISUAL SELECTION OF SURFACE FEATURES DURING THEIR GEOMETRIC SIMULATION WITH THE HELP OF COMPUTER TECHNOLOGIES
More informationAADL : about scheduling analysis
AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng
More informationLecture 5: Probability Distributions. Random Variables
Lecture 5: Probablty Dstrbutons Random Varables Probablty Dstrbutons Dscrete Random Varables Contnuous Random Varables and ther Dstrbutons Dscrete Jont Dstrbutons Contnuous Jont Dstrbutons Independent
More informationComputer Communications
Computer Communcatons 3 (22) 3 48 Contents lsts avalable at ScVerse ScenceDrect Computer Communcatons journal homepage: www.elsever.com/locate/comcom On the queueng behavor of nter-flow asynchronous network
More informationDelay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks
Appl. Math. Inf. Sc. 7, No. 2L, 467-474 2013) 467 Appled Mathematcs & Informaton Scences An Internatonal Journal http://dx.do.org/10.12785/ams/072l13 Delay Varaton Optmzed Traffc Allocaton Based on Network
More informationConstructing Minimum Connected Dominating Set: Algorithmic approach
Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected
More informationVideo Proxy System for a Large-scale VOD System (DINA)
Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,
More informationZhiyong Huang* and Xiaoping Zeng
44 Int. J. Internet Protocol Technology, Vol. 5, Nos. 1/2, 2010 Detectng and blockng P2P botnets through contact tracng chans Zhyong Huang* and Xaopng Zeng College of Communcaton Engneerng, Chongqng Unversty,
More informationGateway Algorithm for Fair Bandwidth Sharing
Algorm for Far Bandwd Sharng We Y, Rupnder Makkar, Ioanns Lambadars Department of System and Computer Engneerng Carleton Unversty 5 Colonel By Dr., Ottawa, ON KS 5B6, Canada {wy, rup, oanns}@sce.carleton.ca
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
More informationFuture Generation Computer Systems
Future Generaton Computer Systems 29 (2013) 1631 1644 Contents lsts avalable at ScVerse ScenceDrect Future Generaton Computer Systems journal homepage: www.elsever.com/locate/fgcs Gosspng for resource
More informationComparisons of Packet Scheduling Algorithms for Fair Service among Connections on the Internet
Comparsons of Packet Schedulng Algorthms for Far Servce among Connectons on the Internet Go Hasegawa, Takahro Matsuo, Masayuk Murata and Hdeo Myahara Department of Infomatcs and Mathematcal Scence Graduate
More informationModeling Local Uncertainty accounting for Uncertainty in the Data
Modelng Local Uncertanty accontng for Uncertanty n the Data Olena Babak and Clayton V Detsch Consder the problem of estmaton at an nsampled locaton sng srrondng samples The standard approach to ths problem
More information6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour
6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the
More informationSimulation: Solving Dynamic Models ABE 5646 Week 11 Chapter 2, Spring 2010
Smulaton: Solvng Dynamc Models ABE 5646 Week Chapter 2, Sprng 200 Week Descrpton Readng Materal Mar 5- Mar 9 Evaluatng [Crop] Models Comparng a model wth data - Graphcal, errors - Measures of agreement
More informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationHelsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)
Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute
More informationA New Approach For the Ranking of Fuzzy Sets With Different Heights
New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays
More informationComparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments
Comparson of Heurstcs for Schedulng Independent Tasks on Heterogeneous Dstrbuted Envronments Hesam Izakan¹, Ath Abraham², Senor Member, IEEE, Václav Snášel³ ¹ Islamc Azad Unversty, Ramsar Branch, Ramsar,
More informationBase Station Location Protection in Wireless Sensor Networks: Attacks and Defense
Base Staton Locaton Protecton n Wreless Sensor Networks: Attacks and Defense Juan Chen, Hongl Zhang, Xaojang Du 2, Bnxng Fang, Yan Lu 3, Hanng Yu Research Center of Computer Network and Informaton Securty
More informationResource and Virtual Function Status Monitoring in Network Function Virtualization Environment
Journal of Physcs: Conference Seres PAPER OPEN ACCESS Resource and Vrtual Functon Status Montorng n Network Functon Vrtualzaton Envronment To cte ths artcle: MS Ha et al 2018 J. Phys.: Conf. Ser. 1087
More informationAn Improved Image Segmentation Algorithm Based on the Otsu Method
3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,
More informationA Topology-aware Random Walk
A Topology-aware Random Walk Inkwan Yu, Rchard Newman Dept. of CISE, Unversty of Florda, Ganesvlle, Florda, USA Abstract When a graph can be decomposed nto clusters of well connected subgraphs, t s possble
More informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationUSING GRAPHING SKILLS
Name: BOLOGY: Date: _ Class: USNG GRAPHNG SKLLS NTRODUCTON: Recorded data can be plotted on a graph. A graph s a pctoral representaton of nformaton recorded n a data table. t s used to show a relatonshp
More informationC2 Training: June 8 9, Combining effect sizes across studies. Create a set of independent effect sizes. Introduction to meta-analysis
C2 Tranng: June 8 9, 2010 Introducton to meta-analyss The Campbell Collaboraton www.campbellcollaboraton.org Combnng effect szes across studes Compute effect szes wthn each study Create a set of ndependent
More informationDESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT
DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,
More informationA Fast Content-Based Multimedia Retrieval Technique Using Compressed Data
A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationA CLASS OF TRANSFORMED EFFICIENT RATIO ESTIMATORS OF FINITE POPULATION MEAN. Department of Statistics, Islamia College, Peshawar, Pakistan 2
Pa. J. Statst. 5 Vol. 3(4), 353-36 A CLASS OF TRANSFORMED EFFICIENT RATIO ESTIMATORS OF FINITE POPULATION MEAN Sajjad Ahmad Khan, Hameed Al, Sadaf Manzoor and Alamgr Department of Statstcs, Islama College,
More informationClassifier Selection Based on Data Complexity Measures *
Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.
More informationAnalysis of Continuous Beams in General
Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,
More informationFEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur
FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents
More informationQuantifying Performance Models
Quantfyng Performance Models Prof. Danel A. Menascé Department of Computer Scence George Mason Unversty www.cs.gmu.edu/faculty/menasce.html 1 Copyrght Notce Most of the fgures n ths set of sldes come from
More informationScheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research
Schedulng Remote Access to Scentfc Instruments n Cybernfrastructure for Educaton and Research Je Yn 1, Junwe Cao 2,3,*, Yuexuan Wang 4, Lanchen Lu 1,3 and Cheng Wu 1,3 1 Natonal CIMS Engneerng and Research
More informationRouting in Degree-constrained FSO Mesh Networks
Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 Routng n Degree-constraned FSO Mesh Networks Zpng Hu, Pramode Verma, and James Sluss Jr. School of Electrcal & Computer Engneerng
More informationTerm Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task
Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationAnalytic Evaluation of Quality of Service for On-Demand Data Delivery
Analytc Evaluaton of Qualty of Servce for On-Demand Data Delvery Hongfe Guo Haonan Tan ( guo@cs.wsc.edu) (haonan@cs.wsc.edu) Abstract Qualty of servce (QoS) measured as balkng probablty and average watng
More informationOverview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION
Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup
More informationYubin Li Florida International University. Zesheng Chen Florida International University. Chao Chen Indiana University Purdue University Fort Wayne
Yubin Li Florida International University Zesheng Chen Florida International University Chao Chen Indiana University Purdue University Fort Wayne Background and motivations Mathematical model Simulation
More informationBANDWIDTH OPTIMIZATION OF INDIVIDUAL HOP FOR ROBUST DATA STREAMING ON EMERGENCY MEDICAL APPLICATION
ARPN Journal of Engneerng and Appled Scences 2006-2009 Asan Research Publshng Network (ARPN). All rghts reserved. BANDWIDTH OPTIMIZATION OF INDIVIDUA HOP FOR ROBUST DATA STREAMING ON EMERGENCY MEDICA APPICATION
More informationFAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks
2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng
More informationEffectiveness of Information Retraction
Effectveness of Informaton on Cndy Hu, Malk Magdon-Ismal, Mark Goldberg and Wllam A. Wallace Department of Industral and Systems Engneerng Rensselaer Polytechnc Insttute Troy, New York Emal: huc@rp.edu,
More informationA Fast Visual Tracking Algorithm Based on Circle Pixels Matching
A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng
More informationModule Management Tool in Software Development Organizations
Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,
More informationNew Exploration of Packet-Pair Probing for Available Bandwidth Estimation and Traffic Characterization
New Exploraton of Packet-Par Probng for Avalable Bandwdth Estmaton and Traffc Characterzaton Yu Cheng, Vkram Ravndran, Alberto Leon-Garca, Hsao-Hwa Chen Department of Electrcal and Computer Engneerng,
More informationLearning-Based Top-N Selection Query Evaluation over Relational Databases
Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **
More informationAn Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices
Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal
More informationAPPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT
3. - 5. 5., Brno, Czech Republc, EU APPLICATION OF MULTIVARIATE LOSS FUNCTION FOR ASSESSMENT OF THE QUALITY OF TECHNOLOGICAL PROCESS MANAGEMENT Abstract Josef TOŠENOVSKÝ ) Lenka MONSPORTOVÁ ) Flp TOŠENOVSKÝ
More informationDerivation of Three Queue Nodes Discrete-Time Analytical Model Based on DRED Algorithm
Seventh Internatonal Conference on Informaton Technology Dervaton of Three Queue Nodes Dscrete-Tme Analytcal Model Based on DRED Algorthm Jafar Ababneh, Hussen Abdel-Jaber, 3 Fad Thabtah, 3 Wael Had, EmranBadarneh
More informationDistributed Middlebox Placement Based on Potential Game
Int. J. Communcatons, Network and System Scences, 2017, 10, 264-273 http://www.scrp.org/ournal/cns ISSN Onlne: 1913-3723 ISSN Prnt: 1913-3715 Dstrbuted Mddlebox Placement Based on Potental Game Yongwen
More informationEvaluation of an Enhanced Scheme for High-level Nested Network Mobility
IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.
More informationAPPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET
APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET Jae-young Lee, Shahram Payandeh, and Ljljana Trajovć School of Engneerng Scence Smon Fraser Unversty 8888 Unversty
More informationA Statistical Model Selection Strategy Applied to Neural Networks
A Statstcal Model Selecton Strategy Appled to Neural Networks Joaquín Pzarro Elsa Guerrero Pedro L. Galndo joaqun.pzarro@uca.es elsa.guerrero@uca.es pedro.galndo@uca.es Dpto Lenguajes y Sstemas Informátcos
More informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationAPPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET
APPLICATION OF PREDICTION-BASED PARTICLE FILTERS FOR TELEOPERATIONS OVER THE INTERNET Jae-young Lee, Shahram Payandeh, and Ljljana Trajovć School of Engneerng Scence Smon Fraser Unversty 8888 Unversty
More informationA NOTE ON FUZZY CLOSURE OF A FUZZY SET
(JPMNT) Journal of Process Management New Technologes, Internatonal A NOTE ON FUZZY CLOSURE OF A FUZZY SET Bhmraj Basumatary Department of Mathematcal Scences, Bodoland Unversty, Kokrajhar, Assam, Inda,
More informationAdaptive Energy and Location Aware Routing in Wireless Sensor Network
Adaptve Energy and Locaton Aware Routng n Wreless Sensor Network Hong Fu 1,1, Xaomng Wang 1, Yngshu L 1 Department of Computer Scence, Shaanx Normal Unversty, X an, Chna, 71006 fuhong433@gmal.com {wangxmsnnu@hotmal.cn}
More informationwith `ook-ahead for Broadcast WDM Networks TR May 14, 1996 Abstract
HPeR-`: A Hgh Performance Reservaton Protocol wth `ook-ahead for Broadcast WDM Networks Vjay Svaraman George N. Rouskas TR-96-06 May 14, 1996 Abstract We consder the problem of coordnatng access to the
More informationEvaluation of Parallel Processing Systems through Queuing Model
ISSN 2278-309 Vkas Shnde, Internatonal Journal of Advanced Volume Trends 4, n Computer No.2, March Scence - and Aprl Engneerng, 205 4(2), March - Aprl 205, 36-43 Internatonal Journal of Advanced Trends
More informationAvoiding congestion through dynamic load control
Avodng congeston through dynamc load control Vasl Hnatyshn, Adarshpal S. Seth Department of Computer and Informaton Scences, Unversty of Delaware, Newark, DE 976 ABSTRACT The current best effort approach
More informationIP Camera Configuration Software Instruction Manual
IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the
More informationCordial and 3-Equitable Labeling for Some Star Related Graphs
Internatonal Mathematcal Forum, 4, 009, no. 31, 1543-1553 Cordal and 3-Equtable Labelng for Some Star Related Graphs S. K. Vadya Department of Mathematcs, Saurashtra Unversty Rajkot - 360005, Gujarat,
More information