A Ratio-Based Control Algorithm for Defense of DDoS Attacks

Size: px
Start display at page:

Download "A Ratio-Based Control Algorithm for Defense of DDoS Attacks"

Transcription

1 A Rato-Based ontrol Algorthm for Defense of DDoS Attacks Sheng-Ya n Yong Xong Jyh-harn u Deartment of omuter Scence eas A&M Unversty ollege Staton X {shengyayonglu}@cs.tamu.edu echncal Reort Jan Abstract Resource deleton s a unversal ndcator of Dstrbuted Denal of Servce DDoS attacks. In ths aer we roose a rato based control algorthm for detecton and throttlng of DDoS attacks. We use the sldng mode control SM control theory to formulate and otmze the traffc control condtons for DDoS defense. A cluster-based control model s develoed for the envronment of an oen network at reduced comutng cost. he control algorthm s shown to be hghly fleble and robust aganst dfferent tyes of attack atterns. It can be ntegrated wth dfferent low level detecton schemes so that bandwdth sharng can be mlemented usng one common framework.

2 . Introducton Dstrbuted denal-of-servce DDoS snce t severely dsruted some ublc web stes years ago remans a crtcal threat to Internet securty. By sendng a massve amount of ackets to a selected target the DDoS attack s amed at deletng the comutng and communcaton resources of the vctm. he mact of an attack can be classfed as dsrutve or degradng [6]. It s more dffcult to detect a degradng attack than the dsrutve one because t s more dffcult to dfferentate normal traffc from the hostle traffc when the attack level s low. Bandwdth deleton can be caused by acket floodng or by redrect amlfcaton of attack ackets. DDoS attacks can be mlemented at dfferent rotocol levels. In a floodng attack agents-zombes send large volumes of traffc to the vctm to consume the vctm system s bandwdth whereas n amlfcaton attack the broadcast router redrects and amlfes the attack to the vctm. Many attern and statstcs anomaly based detecton technques have been develoed n the lterature. he attern based aroach cannot defend the attacks unless the atterns are known a ror. he statstcs based detecton aroach needs to effectvely manage false alarms esecally when the dynamcs of the med regular-attack traffc flows are affected by the throttlng mechansms. In general normal traffc would be less affected when the DDoS traffc can be contaned at romty of ther sources [5]. A reventon based aroach usng resource accountng was roosed n [8] [9]. Sectral analyss [0] strng matchng [5] and game theoretc samlng [4] etc. have also been roosed n the lterature. he adatve threshold scheme n [] measured the mean rate to detect attacks but t s nsenstve to the attacks of low densty. umulatve Sum usum [] [] [8] [9] s a wdely adoted algorthm for detecton of DDoS traffc. It effectvely observes the change ont of the acket stream to detect DDoS. he hocount flterng technque [] utlzes the tme-to-lve value to determne the legtmacy of a acket. hs scheme s based on the observaton that soofed IP addresses are generated randomly thus hard to create the matched value for each of them. Knowng that attack traffc and normal traffc can be classfed nto two dfferent tyes ths dea can be generalzed to the noton of rato-based DDoS detecton. raffc rato s a good ndcator for detecton e.g. MUOPS [5] albet t dd not consder non-adatve rotocol attacks. he Packet Scores-P algorthm [6] used the ondtonal egtmate Probablty P as a scorebased flterng aroach to throttle ackets. By comutng the robablstc dstrbuton of acket attrbutes durng the samlng erod each acket s checked to see f t conforms to the rofle of normal traffc. An attack s detected when changes of the ont dstrbutons of suscous traffc tyes eceed some P thresholds. Most detecton algorthms are desgned for sngle ont detecton. When the traffc atterns are stable a statc DDoS detecton technque suffces. Wthout consderng the effects of defense mechansms the detecton scheme may roduce ecessve false alarms. Four rmary mechansms have been develoed for DDoS defense. raceback rovdes the vctm wth the locaton of the attack source that can be quenched. hrottlng reduces the suscous nflues. Flterng dentfes and rohbts secfc tyes of malcous ackets from enterng the rotected zone and reconfguraton adusts the network toology to quarantne the attacks. For better erformance of defense the detecton and resonse subsystems should be ntegrated. In ths aer we roose an area-wde control scheme for rato based DDoS defense. It s based on a smlar observaton of the traffc flow mbalance under DDoS attack as the PacketScore but our aroach does not requre robablstc characterzaton of the traffc flows. o make the solutons ractcal and robust we take a non-arametrc aroach where the target system s treated as a black bo so that only the system nuts and oututs need to be consdered for desgn of the control system. Based on the Sldng Mode ontrol SM theory ths scheme can control traffc flows at any rotocol layers because the system under control s treated as a black bo. Assumng that a change ont detecton technque such as usum s emloyed we focus on how to characterze the network dynamcs usng bandwdth utlzaton rato as the control obect. he tradeoff between resonsveness and stablty of a cluster-based DDoS defense archtecture s analyzed. he remander of the aer s organzed as follows: Secton dscusses the traffc model and system archtecture. Secton analyzes the traffc behavor and derves traffc balance equatons. Secton 4 etends the model from a sngle node to a cluster and gves an otmal control law amed at mamzng the total admsson ratos. Secton 5 gves the smulaton results to verfy the erformance of our control methodology. Secton 6 concludes ths aer.. Rato-based detecton and control of DDoS traffc Detecton and control of DDoS traffc are closely related. ontrol rules are desgned to stablze the detecton and reacton behavors by acket throttlng. An effectve detecton algorthm must take nto account of the queung and control dynamcs when both DDoS attack and ts defense functon are both engaged. Otherwse the detecton system wll tend to gve ecessve false alarms. And the control decsons need to be made based on detecton outcomes so

3 that otmal amounts of control adustment can be delvered to the target system tmely. Rato based control s not based on drect measurements of the hyscal system but based on ndrect erformance measurements. In formulaton of the control obectve we ay attentons to ensure that the otmzaton rocess s consstent wth the hyscal henomenon. he bandwdth rato can be a real-tme tme functon or a constant obtaned by off-lne statstcal analyss and the attrbute of the measurement unt can be defned wth resect to dfferent rotocol layers or rotocol tyes as needed. he comlety of underlyng analyss for multle flows aarently ncreases wth the number of acket tyes beng controlled. In ths work we only consder a two-traffc-tye control roblem whch s adequate for defense of DDoS attacks. Unlke the P-based PacketScore that needs contnuous udate of traffc rofle the rato-based control s stateless and dstrbuton free. Ideally defense of DDoS attack should engage all network nodes to throttle attack traffc but ths s not ossble for real world oeratons. Furthermore from the analytcal vewont t s comutatonally nfeasble to ncororate the dynamcs of a large network nto one sngle model n order to solve the stablty roblem. o balance between soluton otmalty and ractcalty we adot a Selfstablzng luster System SS [].e. Fgure as the desgn bass. O O 4 O O n n O 4 Fgure. he SS archtecture for defense of DDoS attacks A network can be dvded nto an arbtrary number of SS s. Each cluster s assumed to be ndeendently controlled. Obvously the effectveness of DDoS defense s roortonal to the number of artcatng SSs. In modelng of the control systems acket traffc s dvded nto nter-cluster eternal and ntra-cluster nternal traffc. A cluster s treated as an ndeendent system where the ntercluster traffc s the nut/outut of the system. he sum of eternal lnks enterng the cluster s treated as one eternal varable so that t s less senstve to the fluctuaton of ndvdual lnks. Intra-cluster traffc s modeled as system state varables to cature the dynamcs of ntra-cluster lnks. hs way t allows easy coulng of clusters wthout comromsng the accuracy of traffc dynamcs. In ths aer we eand from the threshold based SM control scheme [] to a rato based control scheme. Our work n [] s a range based control strategy where traffc rate control s based on an absolute threshold [0] []. Unlke acket flterng [7] [8] [9] ths technque does not need accurate characterzaton of the attack traffc and s consstent wth QoS mechansms []. he system dynamcs s talored by the selecton of swtchng functon and ts erformance s nsenstve to arameter and model uncertanty []. In ths work we am at recse control of the bandwdth rato for two selected traffc tyes based on the same traffc model but a dfferent analyss and otmzaton aroach. he otmzaton rocess ays elct attenton to rotecton of other resources n throttlng of hot traffc.. Full cluster control model Our node model for defense of DDoS attacks s alcable to sources targets or the ntermedate network nodes. raffc under control s dvded nto two tyes and each acket tye s allowed to consume u to a fed rato of the total caacty. Our frst goal s to mnmze the mact of DDoS attack wthn the cluster. As a result we throttle the nbound traffc to mantan the rato between traffc tyes to the target value. Wthout loss of generalty we assume that the toology n a cluster s a blateral fully connected grah consstng of n nodes. If the lnk between node and does not est we can smly set throttle varable ρ of lnk to zero n our model. odes n a cluster that need to have more close nteractons wth another cluster are called edge nodes. Edge nodes can be assgned to the cluster as needed. odes that are solated from other nodes are called nner nodes. An llustraton of node and traffc s shown n Fgure wth ther notatons gven n able. Smlar to the node model gven n [] [] our node model can be aled to local hosts or eternal nodes. able. otatons used throughout the node model symbol defnton k λ he total rate of tye k traffc enterng λ he rate of nternal traffc from I λ he rate of dsatched traffc n to to k λ he nternal traffc rate of tye k from k he eternal traffc rate of tye k enterng to

4 he eternal traffc rate of tye k leavng O k I he dsatched traffc rate n to the eternal lnk Outbound nter-cluster lnk leavng One-way ntra-cluster lnk from he bandwdth of ρ he throttle level to traffc he throttle level to traffc I λ I to k X he queue length of tye k traffc on lnk k X he queue length of tye k traffc on lnk k X k Utlty functon for outbound traffc of tye k on H k k X Reected rato of outbound traffc k k * X k he ercentle of k ' k λ dsatched to k he ercentle of λ dsatched to the eternal lnk *! " # # " $ λ λ! $ % & Fgure. he eneral raffc model n a node. Balance equatons n a node acket throttlng ntra-cluster routng queung dynamcs and traffc outut.. hrottlng For node λ and are nbound traffc from other nternal and eternal nodes resectvely and the total traffc enterng the node s eressed n.. ongeston control s accomlshed through adustng throttlng varables ρ and. he subscrt for each symbol denotes a lnk from a sender to a recever.. I I λ ρ λ ΦΛ λ where ρ [0] [0] Φ [ ρ ] and [ ] Λ λ. Both Φ and Λ are rank-one matrces. If does not have nuts from eternal lnks then s equal to 0. Symbols λ and resectvely denote the ntra-cluster and nter-cluster traffc and λ I and I n. are acket rates after throttlng s n effect. Packet flows closely affect one another n a cluster esecally when the DDoS attack s actve. he relatonsh between these acket flows s one of the most mortant ndcators for detecton of DDoS attack. o reresent the relatonsh between these traffc flows we use λ and to ndcate these tyes n the lnk. her relatonsh s defned n... Packet routng λ t λ t t t k. In a cluster ackets are routed to dfferent outbound aths based on ther destnaton addresses.. s used to reresent the routng relatonsh between dfferent aths. Here and are ratos of the nut traffc dsatched to k other ntra-cluster nodes and the eternal resectvely. I λ t * λ t k k I t λ * t k k. When 0 t means that a node s not connected to the eternal lnk. On the bass of the traffc model we now dscuss the relatonsh between traffc flows based on four asects: 4

5 . Queung dynamcs he outbound traffc of a lnk s a functon of ts queue length. When the buffer s emty the dearture rate s equal to the arrval rate. When the buffer s not emty the mamum outut rate s uer bounded by the lnk caacty and the change rate of queue length s equal to the dfference between the outut and nut rates. X t λ t X * t k k k k k.4 Outut traffc 0 k.4 When the network traffc s heavy ackets would be droed based on the control laws.5. et H denote the dro rate of the outbound traffc.6 reresents the droed traffc and.7 the actual sendng rate of the outut lnk to nternal nodes. R X t * t λ t λ t.5 k k k k k R λ k k k k k k t H X t * X t * t.6. λ k k k k k k t H X t * X t * t X t * t k k.8 denotes the actual outut rate of the eternal lnk. O. k t H X t * X t * t X t * t.7.8 Substtute. nto.4 we get queue length change on the ntra-cluster lnk n.9. X t t X k k k k *[ ρ λ ].9 k Smlarly the queue length change on the nter-cluster lnk can be eressed as below. X t t X *[ ρ λ ].0 4. Smlfed cluster traffc model he comlete cluster control model s a reference to characterze the cluster dynamcs comrehensvely. o reduce the comutng cost we roose a smlfed model n Fgure for cluster analyss. We wll use a -node cluster to make an n-deth study and the result can be easly modfed for dfferent cluster szes. We assume that no throttlng k between ntra-cluster nodes.e. ρ k. For a threenode cluster every node s consdered ntra-clustered thus they do not block one another but handle eternal DDoS attack together. O O O O O λ λ O λ λ λ λ O Fgure. A reduced traffc model for a cluster et and denote the two tyes of acket tyes beng controlled on each lnk to control ther admsson rato the control obect s defned as O O t where t s a functon that can be reresented by slne wavelet analyss or other statstcal technques. For smlcty we assume that t s known. For any node n a cluster the number of equatons s equal to the number of outbound lnks multled by the number of traffc tyes. For a -node cluster we get s equatons for each node. Due to the symmetrc toology of the cluster we ust need to analyze one node. Balance equatons of other nodes can be derved n a smlar manner. For node the equlbrum equatons are: 4. hese flow balance equatons are smlar to those derved n [] [] ecet that throttle varables are moved from nut flows to the front of the queue to reduce the effect of acket dsatch. et we dscuss the new control law to control the rato between two traffc tyes. 4. he rato control roblem o reduce the mact of short-term traffc fluctuaton we take the movng average of most recent ackets as measured varables of the control and detecton system. Knowng that one cannot redct the stochastc behavor of flows asymtotcal control of the rato s more effectve than nstantaneous control. Otherwse any control rule s subect to sontaneous crash due to random nuts. he SM system conssts of lnear and swtched laws. he lnear control law s derved from the equvalent control whch controls the nut after t s fltered by a low ass flter. It s based on a contnuous control model once the state reaches the swtchng manfold s t 0 where st denotes the swtchng functon one of the mortant comonents n SM. he 5

6 6 constructon of the swtchng functon s based on the eected outut and the relatve degree of the system dynamcs. Recall that our control obectve s to kee the rato of two traffc tyes to a secfed value. 4. dects that our goal y s to control the traffc rate of two tyes to a rato..e. y s mnmzed when the rato of two acket flow tyes s equal to the secfed rato: tye n lnk outut rate of tyen lnk oututrate of O O O O y 4. where s the rato of two traffc tyes. In addton the relatve degree of a system s r when the nut varable aears after the outut functon y s dfferentated r tmes [] [4]. hen we can construct the swtchng functon of an r-degree system usng the followng equaton 0 r r y y c s []. In our model the relatve degree s one because by 4. t shows that the control varable aears after outut varable O s dfferentated one tme where } { and {}. m m k k O 4. herefore the swtchng functon used n our cluster model s eressed n 4.4. O O y s 4.4 Furthermore we derve the equvalent control law by takng the frst dervatve of t s to be zero. In dong so we lug 4.4 along wth 4. nto t s and then obtan 4.5. D t s O O O Φ 4.5 ] [ ] [ Φ where Φ s a control vector that contans all admsson varables. he elements of vector and D are resectvely eressed n 4.6 and and D Otmzaton of equvalent control law When 0 t s the equvalent control vector ] [ eq Φ can be obtaned as the otmzed soluton of the contnuous comonent by solvng 4.8. As a heurstc choce our obectve s to mamze the admsson varables : all ackets acceted 0: no ackets acceted whch s subect to two constrants. Frstly 0 t s s a necessary condton to derve the equvalent control law. Secondly the values of admsson varables must fall wthn the range 0 to. hs can be modeled as a lnear otmzaton roblem where the obectve functon s a lnear combnaton of all nut varables. In summary we formalze ths roblem to 4.8. Φ Φ Φ ] [0 ] [ 0 Subect to ] [ Mamze 6 D m m } { can be solved by usng lnear rogrammng solvers such as Matlab otmzaton toolbo [6] or l solver [7]. o guarantee the value of the fnal controlled throttle varable wthn 0 and we wll adatvely adust arameters of the swtched comonent for mantanng the control law wthn a sensble range as t wll be elaned shortly. For the control obect to reach ts equlbrum.e. the eected bandwdth rato between the two traffc tyes one

7 must drve the control dynamcs from any ntal state to the sldng mode and make t stay on the swtchng surface st0. he -reachablty condton s t s t η s guarantees that s t 0 ast [][4]. o satsfy ths condton and to reduce system uncertantes the control law m 4.9 combnes wth dscontnuous comonent k m sgn s where m { } and {..6 } when alyng the traectory of s t onto the sldng surface. et we dscuss the control law of SS for stablzng the rato of two traffc tyes. onstructon of the control law s based on the theory n [] [7] for { } k sgn s 4.9 k sgn s where k and k are desgn arameters and sgn s the sgnum functon defned as s * sgn s s. ote that the sgn of the swtched comonent of the control law n two traffc tyes s ooste for drvng the traffc rato to the target value radly. By substtutng control law 4. nto 4.9 we can rove that the traectory of s wll converge to the swtchng manfold s t 0. he control law satsfes the reachablty condton because s t s t 6 6 k k s η s where >0. hs s a stronger condton than the rght hand sde to be zero because t guarantees that the outut traectory wll reaches the swtchng surface wthn a fnte tme not nfnte. 5. Desgn and Smulaton 5. Desgn of adatve arameters K and K We need to desgn k and k n 4.9 such that the admsson level of a traffc tye falls wthn the range of [0 ]. wo cases sgn s > 0 and sgn s < 0 need to be carefully consdered. We frst analyze k and then k based on ts comlementary roerty wth resect to k. ase : sgn s > 0.e. k condton :0 k condton : k > 0 In order to satsfy both condtons k must be wthn the range of 0 and.e. k 0 ] so that 0. As a heurstc choce we eect the swtched comonent adatve and roortonal to the equvalent control..e. k k * where k 0].s called the range arameter that defnes the dynamc range of the control actons. ase : sgn s < 0.e. k condton : 0 k condton : k > 0 Agan these two condtons dctate the range of k so that k 0 ]. et k be the rato of then k * k where k 0]. In summary 5. reresents our desgn for adatve selecton of the arameters. sgn s > 0 k k * k k * 5. sgn s < 0 k * * k k k where k 0] and { }. 5. Eerment evaluaton We evaluated the erformance of our scheme usng smulaton. In the frst eerment we regard the whole cluster as the control obect wthout consderng states of ndvdual lnks. he target rato of two traffc tyes n a - node cluster s set to be 0.5 for the whole cluster wthout consderng ndvdual lnks. hat s the bandwdth utlzaton of tye traffc should be half of that of tye traffc at the three outut lnks of the cluster. In the smulaton ackets have the same sze and the bandwdth of each lnk s equal to 0 5 ackets/sec. Eternal traffc sources are randomly generated usng s ndeendent random number generators. he ngressve acket rate s bounded between [0.7-.]*0 4 for node [0-]*0 4 for node and [0.5-] *0 4 for node. Packets have random aths but a acket must leave the cluster after t vsted all nodes. Packet throttlng s based on 4.9 where are derved by and usng 4.8 and k and k are calculated usng 5.. he range arameter k s set to be 0.6 n the whole study. By luggng the value of above arameters nto 4.9 we obtan the comuted admsson rate and used for the current controllng decsons. he smulaton results are gven n Fgure 4 and Fgure 5 resectvely where n Fgure 4 the rato of the total outut rates between tye- and tye- traffc s about 50% wth some nstantaneous fluctuaton. However consderng the cumulatve ratos between the two tyes of traffc the control erformance aears to be rght on target.e. 50% ecet for the short ntal erod see Fgure 5. 7

8 Fgure 4. Inut and outut traffc traces n each node s t E Φ F E [ ] [ ] 5. F where s defned n 4.6 and are defned n 4.8 and { }. Hence Φ eq can be comuted by luggng arameters of 5. nto 4.8 to obtan ts otmal value. After recevng Φ k and k we can substtute them eq nto the modfed 4.9 and then secure admsson varables and he frst row of Fgure 6 shows the nstantaneous measurement of traffc ratos on the three lnks. he second row of Fgure 7 shows that when takng cumulatve average of the traffc rato t asymtotcally converges to the target value 0.5. Fgure 5. he cumulatve rato of traffc tyes n the cluster 5. ontrol of sngle lnk In the second eerment we treated each lnk as an ndeendent control system usng slghtly modfed control rules. For the eternal outbound lnk of node O O s s the swtchng functon for the lnk to mantan the traffc rato and then we use 4.9 for obtanng the control law. he swtchng functon S n 4.9 s relaced by S whch means the control goal s determned by the ndeendent lnk. Smlarly we also use S nstead of S n 5. to acqure k and k. For obtanng the otmzed admsson rate lnk. Φ eq we rewrte as 5. for each Fgure 6. raffc rato control to nter-cluster lnks We note that a larger value of range arameter k lowers the chance of saturatng the controller but t comes at a rce of hgh level of oscllaton. Fgure 7 shows the tme trace of the admsson levels n terms of the ercentle of nbound ackets based on the second eerment. ven the cluster traffc nuts the control system the controller adusts the throttlng/admsson levels dynamcally. 8

9 Fgure 7. Admsson levels on each lnk for each tye when k 0.6 and target traffc rato s 0.5 cluster_algo for each samlng tme f scoreadm_tye_lnkq > scoreadm_tye_lnkq where q {} then sgnal else sgnal 0 sendsgnal Fgure 8. ontrol algorthm used n the cluster source_algo for every fed erod recevesgnal f sgnal then ratetye ratetye* r where r > else ratetye ratetye* r where r [0 Fgure 9. MIMD algorthm used at the source 5.4 Pushback usng admsson ndcator Admsson level s desgned for drect traffc throttlng n the two eerments mentoned above. It was found that the admsson level s also an effectve ndcator for detecton of traffc rato changes. We can use them to notfy ustream acket sources to throttle ther outbound traffc based on the ushback concet mechansm [0] []. he source uses a multle-ncrease-multle-decrease MIMD rule to adust ts acket flow ncrease or decrease rato based on the feedback sgnals. hat s gven the current traffc level at each adustment the traffc flow ncreases to c or decreases to -c where c s a constant. Fgure 8 and Fgure 9 descrbe the algorthm corresondng to the cluster and source resectvely. Here adm_tye_lnkq denotes the eected admsson level of traffc tye n outbound lnk q and score. s a user-desgned routne usng admsson levels of same tye as arguments for comutng and erformng bnary traffc ushback. In our smulaton we set r. and r0.8 where tye- traffc s adusted n sources accordng to the sgnal from the cluster and tye- traffc s assumed to be a relable one that need not be adusted. Fgure 0 shows the tme traces of the traffc sources after the control s aled where the controlled traffc has the large yet relatvely slow swngng shaes. he cluster admsson levels under ths control scheme are lotted n Fgure and the rato between the two tyes of traffc s lotted n Fgure. omarng to lots n Fgure 5 and Fgure the new results have slghtly degraded yet ecellent asymtotc stablty. he rato between tye and tye traffc stll converges to the target value 0.5. Fgure 0. Source control usng ushback Fgure. luster admsson levels for tye- and - traffc 9

10 Fgure. he ratos of two traffc tyes on each lnk and for the whole cluster when the target value s oncluson In ths aer we roosed a rato based model usng SM for detecton and control of DDoS attack. o solve ths multle nut sngle outut system we aled both control theory and lnear otmzaton technques to derve the rato control laws. Knowng that the admsson level s a relatve measurement the swtched comonent of the control law s made adatve accordng to the current throttlng rato. We derved the feasblty crtera for desgn of the adatve swtched law and guaranteed the range of control varables to satsfy ther constrants. Our desgn s smle and can be aled to dfferent levels of control. he cluster level control has ecellent asymtotc stablty n convergng to the target rato value. It was modfed for ndeendent lnk level control to acheve smlar erformance. When the admsson level of the cluster s used as a DDoS detecton ndcator for sources we also acheve smlar erformance wth some eected slght degradaton n stablty. It s well known that delay s a maor concern for any feedback control systems [] [] [4]. We tested but dd not reort the effect of delays due to sace lmt. It was found that the control erformance remans hghly stable when the delay s as hgh as one second or more more than enough to address the cross US contnent delays n most cases. References [] Yong Xong S. u P. Sun On the defense of the dstrbuted denal of servce attacks: an on-off feedback control aroach IEEE ransactons on Systems Man and ybernetcs Part A [] Janusz Flak Modelng and ontrol of Dynamc Flows n ommuncaton etworks Srnger-Verlag Berln Hedelberg 988. []. Edwards and S. K. Surgeon Sldng Mode ontrol - heory and Alcatons aylor & Francs Inc Brstol PA 998. [4] Jean-Jacques Slotne and Weng. Aled onlnear ontrol. Prentce Hall Englewood lffs.j. 99. [5] J. Mrkovc. Prer P. Reher Source-end DDoS defense In Proceedngs of Second IEEE Internatonal Symosum on etwork omutng and Alcatons Arl 00. [6] Jelena Mrkovc and Peter Reher A taonomy of DDoS attack and DDoS defense mechansms AM SIOMM omuter ommuncaton Revew Volume 4 Issue [7] P. Ferguson and D Sene etwok Ingress Flterng: Defeatng Denal-of servce Attacks whch emloy IP Source Address Soofng htt:// [8] J. J. Mrkovc M. Wang P. Reher and. Zhang SAVE: Source Address Valdty Enforcement Protocol In Proceedngs of IEEE Infocom 00. [9] K. Park and H. ee. On the Effectveness of Roter-based Packet Flterng for Dstrbuted DoS Attack Preventon n Power-law Internets In Proceedngs of AM SIOM [0] J. Ioammds and S. M. Bellovn Imlementng Pushback: Router-Based Defense aganst DDoS Attacks In Proceedngs of ISO etwork and Dstrbuted System Securty Symosum DSS 00. [] R. Mahaan M. Bellovn S. Floyd V.Pason and S. Shenker ontrollng hgh bandwdth aggregates n the network AM omuter ommuncatons Revew July 00. [] Jeun Kong M. Mrza J.Shu. Yoedhana M. erla and Songwu u. Random flow network modelng and smulatons for DDoS attack mtgaton In the Proc. of IEEE Internatonal onference on ommuncatons Volume: -5 May [] A. Isodor ecture otes on onlnear ontrol otes for a ourse at the arl ranz esellshaft Aug 987. [4] A. Isodor onlnear ontrol Systems: An Introducton Srnger-Verlag ew York 989. [5]. M. l and M. Poletto. MUOPS: a data-structure for bandwdth attack detecton In Proceedngs of 0 th Usen Securty Symosum August 00. [6] Matlab. htt:// [7] l_solve. ft://ft.cs.ele.tue.nl/ub/l_solve/. [8] A. arg and A... Reddy. Mtgaton of DoS attacks through QoS Regulaton In Proceedngs of IWQOS worksho May 00 [9] F. au S. H. Rubn M. H. Smth and. rakovc. Dstrbuted Denal of Servce Attacks In IEEE Internatonal onference on System Man and ybernetcs ashvlle USA October [0] Alefya Hussan John Hedemann and hrstos Paadooulos A Framework for lassfyng Denal of Servce Attacks In Proceedngs of AM SIOMM 00 Karlsruhe ermany 00. [] V. Srs & F. Paagalou Alcaton of Anomaly Detecton Algorthms for Detectng SY Floodng Attacks In Proceedngs of IEEE lobal elecommuncatons onference lobecom 004 Dallas USA 004. [] heng Jn Hanng Wang and Kang. Shn Ho-ount Flterng: An Effectve Defense aganst Soofed raffc In Proceedngs of the 0th AM conference on omuter and 0

11 ommuncaton Securty Washngton D.. USA [] H. Wang D. Zhang and Kang. Shn Detectng SY Floodng Attacks In Proceedngs of IEEE onference on omuter ommuncatons ew York June 00. [4] Mural Kodalam.V. akshman. Detectng etwork Intrusons vs Samlng: A ame heoretc Aroach In roceedngs of IEEE onference on omuter ommuncatons. San Francsco March 00. [5]. uck. Sherwood B. alder and. Varghese. Determnstc Memory-Effcent Strng Matchng Algorthms for Intruson Detecton In Proceedngs of IEEE onference on omuter ommuncatons Hong Kong. March 004. [6] Y. Km W.. au M.. huah and H. J. hao. PacketScore: Statstcs-based Overload ontrol aganst Dstrbuted Denal-of-Servce Attacks In Proceedngs of IEEE onference on omuter ommuncatons. Hong Kong. March 004. [7] Vadm I. Utkn Sldng Mode n ontrol Otmzaton Srnger-Verlag Berln Hedelberg ew York 99. [8]. Peng. ecke and R. Kotagr. Proactvely Detectng DDoS Attack Usng Source IP Address Montorng In Proc. of IFIP-6 conference on etworkng 004 Athensreece May 004 [9]. Peng. ecke and R. Kotagr Preventon from dstrbuted denal of servce usng hstory-based IP flterng In Proceedngs of IEEE Internatonal onference on ommuncatons 00 Anchorage Alaska USA August 00. [0] John Ioannds and Steven M. Bellovn "Imlementng Pushback: Router-Based Defense aganst DDoS Attacks" In Proceedng of etwork and Dstrbuted System Securty Symosum February 00. [] Ratul Mahaan Steven M. Bellovn Sally Floyd John Ioannds Vern Pason Scott Shenker. ontrollng hgh bandwdth aggregates n the network AM SIOMM omuter ommuncaton Revew Volume Issue July 00 [] Shn K..; Xanzhong uomutng tme delay and ts effects on real-tme control systems IEEE ransactons on ontrol Systems echnology. June [] Moroka H. Sabanovc A. Uchbor A.; Wada K. Oka M Alcaton of tme-delay-control n varable structure moton control systems. In Proceedngs of IEEE Internatonal Symosum on Industral Electroncs. Vol.. June [4] Aweya J Ouellette M. Montuno D.Y. Desgn and Stablty Analyss of a Rate ontrol Algorthm Usng the Routh Hurwtz Stablty rteron. IEEE/AM ransactons on etworkng 4 Aug. 004.

Applied Research Laboratory. Decision Theory and Receiver Design

Applied Research Laboratory. Decision Theory and Receiver Design Decson Theor and Recever Desgn Sgnal Detecton and Performance Estmaton Sgnal Processor Decde Sgnal s resent or Sgnal s not resent Nose Nose Sgnal? Problem: How should receved sgnals be rocessed n order

More information

PAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign

PAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of Illnos-Urbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng

More information

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.

More information

A NEW ACTIVE QUEUE MANAGEMENT ALGORITHM BASED ON NEURAL NETWORKS PI. M. Yaghoubi Waskasi MYaghoubi@ece.ut.ac.ir. M. J. Yazdanpanah Yazdan@ut.ac.

A NEW ACTIVE QUEUE MANAGEMENT ALGORITHM BASED ON NEURAL NETWORKS PI. M. Yaghoubi Waskasi MYaghoubi@ece.ut.ac.ir. M. J. Yazdanpanah Yazdan@ut.ac. A NEW ACTIVE QUEUE MANAGEMENT ALGORITHM BASED ON NEURAL NETWORKS M. Yaghoub Waskas MYaghoub@ece.ut.ac.r M. J. Yazdananah Yazdan@ut.ac.r N. Yazdan Yazdan@ut.ac.r Control and Intellgent Processng Center

More information

Chapter 3: Dual-bandwidth Data Path and BOCP Design

Chapter 3: Dual-bandwidth Data Path and BOCP Design Chater 3: Dual-bandwdth Data Path and BOCP Desgn 3. Introducton The focus of ths thess s on the 4G wreless moble Internet networks to rovde data servces wthn the overlang areas of CDA2000-WLA networks.

More information

A Comprehensive Analysis of Bandwidth Request Mechanisms in IEEE 802.16 Networks

A Comprehensive Analysis of Bandwidth Request Mechanisms in IEEE 802.16 Networks A Comrehensve Analyss of Bandwdth Reuest Mechansms n IEEE 802.6 Networks Davd Chuck, Kuan-Yu Chen and J. Morrs Chang Deartment of Electrcal and Comuter Engneerng Iowa State Unversty, Ames, Iowa 500, USA

More information

An Interest-Oriented Network Evolution Mechanism for Online Communities

An Interest-Oriented Network Evolution Mechanism for Online Communities An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne

More information

A Study on Secure Data Storage Strategy in Cloud Computing

A Study on Secure Data Storage Strategy in Cloud Computing Journal of Convergence Informaton Technology Volume 5, Number 7, Setember 00 A Study on Secure Data Storage Strategy n Cloud Comutng Danwe Chen, Yanjun He, Frst Author College of Comuter Technology, Nanjng

More information

Monitoring Network Traffic to Detect Stepping-Stone Intrusion

Monitoring Network Traffic to Detect Stepping-Stone Intrusion Montorng etork Traffc to Detect Steng-Stone Intruson Janhua Yang, Byong Lee, Stehen S. H. Huang Deartment of Math and Comuter Scence, Bennett College E-mal: {jhyang, blee }@bennett.edu Deartment of Comuter

More information

Evaluation of the information servicing in a distributed learning environment by using monitoring and stochastic modeling

Evaluation of the information servicing in a distributed learning environment by using monitoring and stochastic modeling MultCraft Internatonal Journal of Engneerng, Scence and Technology Vol, o, 9, -4 ITERATIOAL JOURAL OF EGIEERIG, SCIECE AD TECHOLOGY wwwest-ngcom 9 MultCraft Lmted All rghts reserved Evaluaton of the nformaton

More information

A New Technique for Vehicle Tracking on the Assumption of Stratospheric Platforms. Department of Civil Engineering, University of Tokyo **

A New Technique for Vehicle Tracking on the Assumption of Stratospheric Platforms. Department of Civil Engineering, University of Tokyo ** Fuse, Taash A New Technque for Vehcle Tracng on the Assumton of Stratosherc Platforms Taash FUSE * and Ehan SHIMIZU ** * Deartment of Cvl Engneerng, Unversty of Toyo ** Professor, Deartment of Cvl Engneerng,

More information

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College

Feature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure

More information

Analysis and Modeling of Buck Converter in Discontinuous-Output-Inductor-Current Mode Operation *

Analysis and Modeling of Buck Converter in Discontinuous-Output-Inductor-Current Mode Operation * Energy and Power Engneerng, 3, 5, 85-856 do:.436/ee.3.54b63 Publshed Onlne July 3 (htt://www.scr.org/journal/ee) Analyss and Modelng of Buck Converter n Dscontnuous-Outut-Inductor-Current Mode Oeraton

More information

Optimal maintenance of a production-inventory system with continuous repair times and idle periods

Optimal maintenance of a production-inventory system with continuous repair times and idle periods Proceedngs o the 3 Internatonal Conerence on Aled Mathematcs and Comutatonal Methods Otmal mantenance o a roducton-nventory system wth contnuous rear tmes and dle erods T. D. Dmtrakos* Deartment o Mathematcs

More information

Traffic State Estimation in the Traffic Management Center of Berlin

Traffic State Estimation in the Traffic Management Center of Berlin Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D-763 Karlsruhe, Germany phone ++49/72/965/35, emal peter.vortsch@ptv.de Peter Möhl, PTV AG,

More information

A Prediction System Based on Fuzzy Logic

A Prediction System Based on Fuzzy Logic Proceedngs of the World Congress on Engneerng and Comuter Scence 2008 WCECS 2008, October 22-24, 2008, San Francsco, USA A Predcton System Based on Fuzzy Logc Vadeh.V,Monca.S, Mohamed Shek Safeer.S, Deeka.M

More information

Recurrence. 1 Definitions and main statements

Recurrence. 1 Definitions and main statements Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.

More information

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ). REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

More information

1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)

1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP) 6.3 / -- Communcaton Networks II (Görg) SS20 -- www.comnets.un-bremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes

More information

Dynamic Load Balancing of Parallel Computational Iterative Routines on Platforms with Memory Heterogeneity

Dynamic Load Balancing of Parallel Computational Iterative Routines on Platforms with Memory Heterogeneity Dynamc Load Balancng of Parallel Comutatonal Iteratve Routnes on Platforms wth Memory Heterogenety Davd Clare, Alexey Lastovetsy, Vladmr Rychov School of Comuter Scence and Informatcs, Unversty College

More information

Adaptive Load Balancing of Parallel Applications with Multi-Agent Reinforcement Learning on Heterogeneous Systems

Adaptive Load Balancing of Parallel Applications with Multi-Agent Reinforcement Learning on Heterogeneous Systems Adatve Load Balancng of Parallel Alcatons wth Mult-Agent Renforcement Learnng on Heterogeneous Systems Johan PAREN, Kata VERBEECK, Ann NOWE, Krs SEENHAU COMO, VUB Brussels, Belgum Emal: ohan@nfo.vub.ac.be,

More information

A Secure Password-Authenticated Key Agreement Using Smart Cards

A Secure Password-Authenticated Key Agreement Using Smart Cards A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,

More information

Load Balancing of Parallelized Information Filters

Load Balancing of Parallelized Information Filters IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, VOL. XXX, NO. XX, XXXXXXX 2001 1 Load Balancng of Parallelzed Informaton Flters Nel C. Rowe, Member, IEEE Comuter Socety, and Amr Zaky, Member, IEEE

More information

What is Candidate Sampling

What is Candidate Sampling What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.

More information

Network Security Situation Evaluation Method for Distributed Denial of Service

Network Security Situation Evaluation Method for Distributed Denial of Service Network Securty Stuaton Evaluaton Method for Dstrbuted Denal of Servce Jn Q,2, Cu YMn,2, Huang MnHuan,2, Kuang XaoHu,2, TangHong,2 ) Scence and Technology on Informaton System Securty Laboratory, Bejng,

More information

RequIn, a tool for fast web traffic inference

RequIn, a tool for fast web traffic inference RequIn, a tool for fast web traffc nference Olver aul, Jean Etenne Kba GET/INT, LOR Department 9 rue Charles Fourer 90 Evry, France Olver.aul@nt-evry.fr, Jean-Etenne.Kba@nt-evry.fr Abstract As networked

More information

Efficient Computation of Optimal, Physically Valid Motion

Efficient Computation of Optimal, Physically Valid Motion Vol. xx No. xx,.1 5, 200x 1 Effcent Comutaton of Otmal, Physcally Vald Moton Anthony C. Fang 1 and Nancy S. Pollard 2 1 Deartment of Comuter Scence, Natonal Unversty of Sngaore 2 Robotcs Insttute, Carnege

More information

Chosen Public Key and Ciphertext Secure Proxy Re-encryption Schemes

Chosen Public Key and Ciphertext Secure Proxy Re-encryption Schemes Internatonal Journal of Dgtal ontent Technology and ts Alcatons Volume 4 Number 9 December 00 hosen Publc Key and hertext Secure Proxy Re-encryton Schemes Lmng Fang Wlly Suslo Yongun Ren huneng Ge and

More information

Energy-based Design of Steel Structures According to the Predefined Interstory Drift Ratio 1

Energy-based Design of Steel Structures According to the Predefined Interstory Drift Ratio 1 Dgest 01, December 01, 1573-1593 Energy-based Desgn of Steel Structures Accordng to the Predefned Interstory Drft Rato 1 Onur ERTER* Özgür BOZDAĞ** ustafa DÜZGÜ*** ABSTRACT The methods whch take lace n

More information

Research Article Competition and Integration in Closed-Loop Supply Chain Network with Variational Inequality

Research Article Competition and Integration in Closed-Loop Supply Chain Network with Variational Inequality Hndaw Publshng Cororaton Mathematcal Problems n Engneerng Volume 2012, Artcle ID 524809, 21 ages do:10.1155/2012/524809 Research Artcle Cometton and Integraton n Closed-Loo Suly Chan Network wth Varatonal

More information

An Alternative Way to Measure Private Equity Performance

An Alternative Way to Measure Private Equity Performance An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate

More information

Inter-domain Alliance Authentication Protocol Based on Blind Signature

Inter-domain Alliance Authentication Protocol Based on Blind Signature Internatonal Journal of Securty Its Alcatons Vol9 No2 (205) 97-206 htt://ddoorg/04257/sa205929 Inter-doman Allance Authentcaton Protocol Based on Blnd Sgnature Zhang Je Zhang Q-kun Gan Yong Yn Yfeng Tan

More information

PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12

PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 12 14 The Ch-squared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304-C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed

More information

ADOPTION OF BIG DATA ANALYTICS IN HEALTHCARE: THE EFFICIENCY AND PRIVACY

ADOPTION OF BIG DATA ANALYTICS IN HEALTHCARE: THE EFFICIENCY AND PRIVACY ADOPTION OF BIG DATA ANALYTICS IN HEALTHCARE: THE EFFICIENCY AND PRIVACY He L, School of Economc Informaton Engneerng, Southwestern Unversty of Fnance and Economcs, Chengdu, Chna, olverlhe@gmalcom Jng

More information

Analysis of Energy-Conserving Access Protocols for Wireless Identification Networks

Analysis of Energy-Conserving Access Protocols for Wireless Identification Networks From the Proceedngs of Internatonal Conference on Telecommuncaton Systems (ITC-97), March 2-23, 1997. 1 Analyss of Energy-Conservng Access Protocols for Wreless Identfcaton etworks Imrch Chlamtac a, Chara

More information

Calculating the high frequency transmission line parameters of power cables

Calculating the high frequency transmission line parameters of power cables < ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,

More information

Can Auto Liability Insurance Purchases Signal Risk Attitude?

Can Auto Liability Insurance Purchases Signal Risk Attitude? Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang

More information

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange

More information

Real-Time Traffic Signal Intelligent Control with Transit-Priority

Real-Time Traffic Signal Intelligent Control with Transit-Priority 738 JOURNAL OF SOFTWARE, VOL. 7, NO. 8, AUGUST 202 Real-Tme Traffc Sgnal Intellgent ontrol wth Transt-Prorty Xanyan Kuang School of vl Engneerng and Transortaton, South hna Unversty of Technology, GuangZhou,

More information

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

More information

Survey on Virtual Machine Placement Techniques in Cloud Computing Environment

Survey on Virtual Machine Placement Techniques in Cloud Computing Environment Survey on Vrtual Machne Placement Technques n Cloud Computng Envronment Rajeev Kumar Gupta and R. K. Paterya Department of Computer Scence & Engneerng, MANIT, Bhopal, Inda ABSTRACT In tradtonal data center

More information

An Analytical Model for Multi-tier Internet Services and Its Applications

An Analytical Model for Multi-tier Internet Services and Its Applications An Analytcal Model for Mult-ter Internet Servces and Its Alcatons Bhuvan Urgaonkar, Govann Pacfc, Prashant Shenoy, Mke Sretzer, and Asser Tantaw Det. of Comuter Scence, Servce Management Mddleware Det.,

More information

THE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek

THE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo

More information

J. Parallel Distrib. Comput.

J. Parallel Distrib. Comput. J. Parallel Dstrb. Comput. 71 (2011) 62 76 Contents lsts avalable at ScenceDrect J. Parallel Dstrb. Comput. journal homepage: www.elsever.com/locate/jpdc Optmzng server placement n dstrbuted systems n

More information

A Structure Preserving Database Encryption Scheme

A Structure Preserving Database Encryption Scheme A Structure Preservng Database Encryton Scheme Yuval Elovc, Ronen Wasenberg, Erez Shmuel, Ehud Gudes Ben-Guron Unversty of the Negev, Faculty of Engneerng, Deartment of Informaton Systems Engneerng, Postfach

More information

Vision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION

Vision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION Vson Mouse Saurabh Sarkar a* a Unversty of Cncnnat, Cncnnat, USA ABSTRACT The report dscusses a vson based approach towards trackng of eyes and fngers. The report descrbes the process of locatng the possble

More information

taposh_kuet20@yahoo.comcsedchan@cityu.edu.hk rajib_csedept@yahoo.co.uk, alam_shihabul@yahoo.com

taposh_kuet20@yahoo.comcsedchan@cityu.edu.hk rajib_csedept@yahoo.co.uk, alam_shihabul@yahoo.com G. G. Md. Nawaz Al 1,2, Rajb Chakraborty 2, Md. Shhabul Alam 2 and Edward Chan 1 1 Cty Unversty of Hong Kong, Hong Kong, Chna taposh_kuet20@yahoo.comcsedchan@ctyu.edu.hk 2 Khulna Unversty of Engneerng

More information

Learning User's Scheduling Criteria in a Personal Calendar Agent!

Learning User's Scheduling Criteria in a Personal Calendar Agent! Learnng User's Schedulng Crtera n a Personal Calendar Agent! Shh-ju Ln and Jane Yung-jen Hsu Deartment of Comuter Scence and Informaton Engneerng Natonal Tawan Unversty 1 Sec 4 Roosevelt Road, Tae, 106

More information

Application of Multi-Agents for Fault Detection and Reconfiguration of Power Distribution Systems

Application of Multi-Agents for Fault Detection and Reconfiguration of Power Distribution Systems 1 Applcaton of Mult-Agents for Fault Detecton and Reconfguraton of Power Dstrbuton Systems K. Nareshkumar, Member, IEEE, M. A. Choudhry, Senor Member, IEEE, J. La, A. Felach, Senor Member, IEEE Abstract--The

More information

The OC Curve of Attribute Acceptance Plans

The OC Curve of Attribute Acceptance Plans The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4

More information

CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol

CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK Sample Stablty Protocol Background The Cholesterol Reference Method Laboratory Network (CRMLN) developed certfcaton protocols for total cholesterol, HDL

More information

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by

8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by 6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng

More information

APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT

APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT Toshhko Oda (1), Kochro Iwaoka (2) (1), (2) Infrastructure Systems Busness Unt, Panasonc System Networks Co., Ltd. Saedo-cho

More information

Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts

Power-of-Two Policies for Single- Warehouse Multi-Retailer Inventory Systems with Order Frequency Discounts Power-of-wo Polces for Sngle- Warehouse Mult-Retaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)

More information

Project Networks With Mixed-Time Constraints

Project Networks With Mixed-Time Constraints Project Networs Wth Mxed-Tme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa

More information

Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network *

Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819-840 (2008) Data Broadcast on a Mult-System Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,

More information

Forecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network

Forecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network 700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School

More information

Risk-based Fatigue Estimate of Deep Water Risers -- Course Project for EM388F: Fracture Mechanics, Spring 2008

Risk-based Fatigue Estimate of Deep Water Risers -- Course Project for EM388F: Fracture Mechanics, Spring 2008 Rsk-based Fatgue Estmate of Deep Water Rsers -- Course Project for EM388F: Fracture Mechancs, Sprng 2008 Chen Sh Department of Cvl, Archtectural, and Envronmental Engneerng The Unversty of Texas at Austn

More information

INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS

INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS 21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech-2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS

More information

Formulating & Solving Integer Problems Chapter 11 289

Formulating & Solving Integer Problems Chapter 11 289 Formulatng & Solvng Integer Problems Chapter 11 289 The Optonal Stop TSP If we drop the requrement that every stop must be vsted, we then get the optonal stop TSP. Ths mght correspond to a ob sequencng

More information

A Novel Adaptive Load Balancing Routing Algorithm in Ad hoc Networks

A Novel Adaptive Load Balancing Routing Algorithm in Ad hoc Networks Journal of Convergence Informaton Technology A Novel Adaptve Load Balancng Routng Algorthm n Ad hoc Networks Zhu Bn, Zeng Xao-png, Xong Xan-sheng, Chen Qan, Fan Wen-yan, We Geng College of Communcaton

More information

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm

A hybrid global optimization algorithm based on parallel chaos optimization and outlook algorithm Avalable onlne www.ocpr.com Journal of Chemcal and Pharmaceutcal Research, 2014, 6(7):1884-1889 Research Artcle ISSN : 0975-7384 CODEN(USA) : JCPRC5 A hybrd global optmzaton algorthm based on parallel

More information

SDN: Systemic Risks due to Dynamic Load Balancing

SDN: Systemic Risks due to Dynamic Load Balancing SDN: Systemc Rsks due to Dynamc Load Balancng Vladmr Marbukh IRTF SDN Abstract SDN acltates dynamc load balancng Systemc benets o dynamc load balancng: - economc: hgher resource utlzaton, hgher revenue,..

More information

Calculation of Sampling Weights

Calculation of Sampling Weights Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample

More information

An MILP model for planning of batch plants operating in a campaign-mode

An MILP model for planning of batch plants operating in a campaign-mode An MILP model for plannng of batch plants operatng n a campagn-mode Yanna Fumero Insttuto de Desarrollo y Dseño CONICET UTN yfumero@santafe-concet.gov.ar Gabrela Corsano Insttuto de Desarrollo y Dseño

More information

Portfolio Loss Distribution

Portfolio Loss Distribution Portfolo Loss Dstrbuton Rsky assets n loan ortfolo hghly llqud assets hold-to-maturty n the bank s balance sheet Outstandngs The orton of the bank asset that has already been extended to borrowers. Commtment

More information

Lecture 3: Force of Interest, Real Interest Rate, Annuity

Lecture 3: Force of Interest, Real Interest Rate, Annuity Lecture 3: Force of Interest, Real Interest Rate, Annuty Goals: Study contnuous compoundng and force of nterest Dscuss real nterest rate Learn annuty-mmedate, and ts present value Study annuty-due, and

More information

Relay Secrecy in Wireless Networks with Eavesdropper

Relay Secrecy in Wireless Networks with Eavesdropper Relay Secrecy n Wreless Networks wth Eavesdropper Parvathnathan Venktasubramanam, Tng He and Lang Tong School of Electrcal and Computer Engneerng Cornell Unversty, Ithaca, NY 14853 Emal : {pv45, th255,

More information

Schedulability Bound of Weighted Round Robin Schedulers for Hard Real-Time Systems

Schedulability Bound of Weighted Round Robin Schedulers for Hard Real-Time Systems Schedulablty Bound of Weghted Round Robn Schedulers for Hard Real-Tme Systems Janja Wu, Jyh-Charn Lu, and We Zhao Department of Computer Scence, Texas A&M Unversty {janjaw, lu, zhao}@cs.tamu.edu Abstract

More information

Enabling P2P One-view Multi-party Video Conferencing

Enabling P2P One-view Multi-party Video Conferencing Enablng P2P One-vew Mult-party Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract Mult-Party Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P

More information

Effective Network Defense Strategies against Malicious Attacks with Various Defense Mechanisms under Quality of Service Constraints

Effective Network Defense Strategies against Malicious Attacks with Various Defense Mechanisms under Quality of Service Constraints Effectve Network Defense Strateges aganst Malcous Attacks wth Varous Defense Mechansms under Qualty of Servce Constrants Frank Yeong-Sung Ln Department of Informaton Natonal Tawan Unversty Tape, Tawan,

More information

Extending Probabilistic Dynamic Epistemic Logic

Extending Probabilistic Dynamic Epistemic Logic Extendng Probablstc Dynamc Epstemc Logc Joshua Sack May 29, 2008 Probablty Space Defnton A probablty space s a tuple (S, A, µ), where 1 S s a set called the sample space. 2 A P(S) s a σ-algebra: a set

More information

A Passive Network Measurement-based Traffic Control Algorithm in Gateway of. P2P Systems

A Passive Network Measurement-based Traffic Control Algorithm in Gateway of. P2P Systems roceedngs of the 7th World Congress The Internatonal Federaton of Automatc Control A assve Network Measurement-based Traffc Control Algorthm n Gateway of 2 Systems Ybo Jang, Weje Chen, Janwe Zheng, Wanlang

More information

A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña

A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION. Michael E. Kuhl Radhamés A. Tolentino-Peña Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATION-BASED OPTIMIZATION

More information

Answer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy

Answer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy 4.02 Quz Solutons Fall 2004 Multple-Choce Questons (30/00 ponts) Please, crcle the correct answer for each of the followng 0 multple-choce questons. For each queston, only one of the answers s correct.

More information

Forecasting the Direction and Strength of Stock Market Movement

Forecasting the Direction and Strength of Stock Market Movement Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract - Stock market s one of the most complcated systems

More information

JCM_VN_AM003_ver01.0 Sectoral scope: 03

JCM_VN_AM003_ver01.0 Sectoral scope: 03 Sectoral scoe: 03 Jont Credtng Mechansm Aroved Methodology VN_AM003 Imrovng the energy effcency of commercal buldngs by utlzaton of hgh effcency equment A. Ttle of the methodology Imrovng the energy effcency

More information

The Greedy Method. Introduction. 0/1 Knapsack Problem

The Greedy Method. Introduction. 0/1 Knapsack Problem The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton

More information

Efficient Project Portfolio as a tool for Enterprise Risk Management

Efficient Project Portfolio as a tool for Enterprise Risk Management Effcent Proect Portfolo as a tool for Enterprse Rsk Management Valentn O. Nkonov Ural State Techncal Unversty Growth Traectory Consultng Company January 5, 27 Effcent Proect Portfolo as a tool for Enterprse

More information

Addendum to: Importing Skill-Biased Technology

Addendum to: Importing Skill-Biased Technology Addendum to: Importng Skll-Based Technology Arel Bursten UCLA and NBER Javer Cravno UCLA August 202 Jonathan Vogel Columba and NBER Abstract Ths Addendum derves the results dscussed n secton 3.3 of our

More information

Fragility Based Rehabilitation Decision Analysis

Fragility Based Rehabilitation Decision Analysis .171. Fraglty Based Rehabltaton Decson Analyss Cagdas Kafal Graduate Student, School of Cvl and Envronmental Engneerng, Cornell Unversty Research Supervsor: rcea Grgoru, Professor Summary A method s presented

More information

Performance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application

Performance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application Internatonal Journal of mart Grd and lean Energy Performance Analyss of Energy onsumpton of martphone Runnng Moble Hotspot Applcaton Yun on hung a chool of Electronc Engneerng, oongsl Unversty, 511 angdo-dong,

More information

Brigid Mullany, Ph.D University of North Carolina, Charlotte

Brigid Mullany, Ph.D University of North Carolina, Charlotte Evaluaton And Comparson Of The Dfferent Standards Used To Defne The Postonal Accuracy And Repeatablty Of Numercally Controlled Machnng Center Axes Brgd Mullany, Ph.D Unversty of North Carolna, Charlotte

More information

www.engineerspress.com Neural Network Solutions for Forward Kinematics Problem of Hybrid Serial-Parallel Manipulator

www.engineerspress.com Neural Network Solutions for Forward Kinematics Problem of Hybrid Serial-Parallel Manipulator www.engneersress.com World of Scences Journal ISSN: 307-307 Year: 03 Volume: Issue: 8 Pages: 48-58 Aahmad Ghanbar,, Arash ahman Deartment of Mechancal Engneerng, Unversty of Tabrz, Tabrz, Iran School of

More information

Stochastic Protocol Modeling for Anomaly Based Network Intrusion Detection

Stochastic Protocol Modeling for Anomaly Based Network Intrusion Detection Stochastc Protocol Modelng for Anomaly Based Network Intruson Detecton Juan M. Estevez-Tapador, Pedro Garca-Teodoro, and Jesus E. Daz-Verdejo Department of Electroncs and Computer Technology Unversty of

More information

Frequency Selective IQ Phase and IQ Amplitude Imbalance Adjustments for OFDM Direct Conversion Transmitters

Frequency Selective IQ Phase and IQ Amplitude Imbalance Adjustments for OFDM Direct Conversion Transmitters Frequency Selectve IQ Phase and IQ Ampltude Imbalance Adjustments for OFDM Drect Converson ransmtters Edmund Coersmeer, Ernst Zelnsk Noka, Meesmannstrasse 103, 44807 Bochum, Germany edmund.coersmeer@noka.com,

More information

Network Aware Load-Balancing via Parallel VM Migration for Data Centers

Network Aware Load-Balancing via Parallel VM Migration for Data Centers Network Aware Load-Balancng va Parallel VM Mgraton for Data Centers Kun-Tng Chen 2, Chen Chen 12, Po-Hsang Wang 2 1 Informaton Technology Servce Center, 2 Department of Computer Scence Natonal Chao Tung

More information

Virtual Network Embedding with Coordinated Node and Link Mapping

Virtual Network Embedding with Coordinated Node and Link Mapping Vrtual Network Embeddng wth Coordnated Node and Lnk Mappng N. M. Mosharaf Kabr Chowdhury Cherton School of Computer Scence Unversty of Waterloo Waterloo, Canada Emal: nmmkchow@uwaterloo.ca Muntasr Rahan

More information

Feasibility of Using Discriminate Pricing Schemes for Energy Trading in Smart Grid

Feasibility of Using Discriminate Pricing Schemes for Energy Trading in Smart Grid Feasblty of Usng Dscrmnate Prcng Schemes for Energy Tradng n Smart Grd Wayes Tushar, Chau Yuen, Bo Cha, Davd B. Smth, and H. Vncent Poor Sngapore Unversty of Technology and Desgn, Sngapore 138682. Emal:

More information

Fair Virtual Bandwidth Allocation Model in Virtual Data Centers

Fair Virtual Bandwidth Allocation Model in Virtual Data Centers Far Vrtual Bandwdth Allocaton Model n Vrtual Data Centers Yng Yuan, Cu-rong Wang, Cong Wang School of Informaton Scence and Engneerng ortheastern Unversty Shenyang, Chna School of Computer and Communcaton

More information

A Distributed Algorithm for Least Constraining Slot Allocation in MPLS Optical TDM Networks

A Distributed Algorithm for Least Constraining Slot Allocation in MPLS Optical TDM Networks A Dstrbuted Algorthm for Least Constranng Slot Allocaton n MPLS Optcal TDM Networks Hassan Zeneddne and Gregor V. Bochmann, Unversty of Ottawa, Ottawa, ON-K1N 6N5 Abstract - In ths paper, we propose a

More information

PERFORMANCE ANALYSIS OF PARALLEL ALGORITHMS

PERFORMANCE ANALYSIS OF PARALLEL ALGORITHMS Software Analye PERFORMANCE ANALYSIS OF PARALLEL ALGORIHMS Felcan ALECU PhD, Unverty Lecturer, Economc Informatc Deartment, Academy of Economc Stude, Bucharet, Romana E-mal: alecu.felcan@e.ae.ro Abtract:

More information

Modeling and Prediction of Pedestrian Behavior based on the Sub-goal Concept

Modeling and Prediction of Pedestrian Behavior based on the Sub-goal Concept Modelng and Predcton of Pedestran Behavor based on the Sub-goal Concet Tetsush Ieda, Yoshhro Chgodo, Danel Rea, Francesco Zanlungo, Masahro Shom, Taayu Kanda Intellgent Robotcs and Communcaton Laboratores,

More information

How To Solve A Problem In A Powerline (Powerline) With A Powerbook (Powerbook)

How To Solve A Problem In A Powerline (Powerline) With A Powerbook (Powerbook) MIT 8.996: Topc n TCS: Internet Research Problems Sprng 2002 Lecture 7 March 20, 2002 Lecturer: Bran Dean Global Load Balancng Scrbe: John Kogel, Ben Leong In today s lecture, we dscuss global load balancng

More information

"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *

Research Note APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES * Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789-794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC

More information

On-Line Fault Detection in Wind Turbine Transmission System using Adaptive Filter and Robust Statistical Features

On-Line Fault Detection in Wind Turbine Transmission System using Adaptive Filter and Robust Statistical Features On-Lne Fault Detecton n Wnd Turbne Transmsson System usng Adaptve Flter and Robust Statstcal Features Ruoyu L Remote Dagnostcs Center SKF USA Inc. 3443 N. Sam Houston Pkwy., Houston TX 77086 Emal: ruoyu.l@skf.com

More information

A DATA MINING APPLICATION IN A STUDENT DATABASE

A DATA MINING APPLICATION IN A STUDENT DATABASE JOURNAL OF AERONAUTICS AND SPACE TECHNOLOGIES JULY 005 VOLUME NUMBER (53-57) A DATA MINING APPLICATION IN A STUDENT DATABASE Şenol Zafer ERDOĞAN Maltepe Ünversty Faculty of Engneerng Büyükbakkalköy-Istanbul

More information

MAC Layer Service Time Distribution of a Fixed Priority Real Time Scheduler over 802.11

MAC Layer Service Time Distribution of a Fixed Priority Real Time Scheduler over 802.11 Internatonal Journal of Software Engneerng and Its Applcatons Vol., No., Aprl, 008 MAC Layer Servce Tme Dstrbuton of a Fxed Prorty Real Tme Scheduler over 80. Inès El Korb Ecole Natonale des Scences de

More information

ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING

ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 610-519-4390,

More information