Detecting Network Intrusions via Sampling : A Game Theoretic Approach
|
|
- Herbert Spencer
- 8 years ago
- Views:
Transcription
1 Deecing Nework Inrusions vi Smpling : A Gme Theoreic Approch Murli Kodilm T. V. Lkshmn Bell Lborories Lucen Technologies 101 Crwfords Corner Rod Holmdel, NJ 07733, USA {murlik, lkshmn}@bell-lbs.com Absrc In his pper, we consider he problem of deecing n inruding pcke in communicion nework. Deecion is ccomplished by smpling porion of he pckes rnsiing seleced nework links (or rouer inerfces). Since smpling enils incurring nework coss for rel-ime pcke smpling nd pcke exminion hrdwre, we would like o develop nework pcke smpling sregy o effecively deec nework inrusions while no exceeding given ol smpling budge. We consider his problem in gme heoreic frmework, where he inruder picks phs (or he nework ingress poin if only shores ph rouing is possible) o minimize chnces of deecion nd where he nework operor chooses smpling sregy o mximize he chnces of deecion. We formule he gme heoreic problem, nd develop smpling schemes h re opiml in his gme heoreic seing. I. INTRODUCTION In his pper, we consider he problem of deecing inrusions in communicion nework. There is growing lierure on providing securiy in communicion neworks. Two key res of ineres in securiy re inrusion deecion nd inrusion prevenion. In his pper, we del wih he problem of inrusion deecion. Inrusion in neworks kes mny forms including denil of service cks, viruses inroduced ino he neworks, ec. Typiclly, in n inrusion problem, he inruder emps o gin ccess o priculr file server or websie in he nework. In his pper, we consider sylized inrusion problem. In his problem, he inruder emps o send mlicious pcke o given node in he nework. The nework emps o deec his inrusion. The deecion mechnism is pcke smpling nd exminion in he nework. The ide in smpling is h some porion of pckes rversing designed links (or rouer inerfces) re smpled nd exmined in deil o deermine wheher he pcke is n inruder pcke. This pcke exminion my be simple (limied o specific pcke heder fields s in pcke filering) or my involve more deiled exminion of he pcke. To preven pcke mis-ordering or reducion of link hroughpu his exminion hs o be done preferbly line res. Pcke smpling hs been previously proposed for vriey of neworking purposes. For insnce, he SRED scheme in [6] uses pcke smpling o esime he number of cive TCP flows in order o sbilize nework buffer occupncy for TCP rffic. Only pcke heders need be exmined for his scheme. The scheme proposed in [7], lso uses pcke smpling nd i is used for fir link-bndwidh llocion. Smpling hs lso been proposed o infer nework rffic nd rouing chrcerisics [3]. Wheres, hese pplicions require only smpling bsed on pcke heder comprisons, inrusion deecion my enil more horough exminion of smpled pckes. Also, unlike some of he smpling pplicions menioned bove, smpling for inrusion deecion requires ner line-speed pcke exminion since copying smpled pckes or pcke-heders for off-line nlysis is no sufficien o preven inruding pckes from geing hrough. Hence, in he design of n inrusion deecion scheme i is imperive o keep he smpling coss in mind. We sudy his inrusion deecion vi smpling problem in gme heoreic seing. Gme heory hs been used exensively o model differen neworking problems. This work includes he work of Shenker for modeling service disciplines [10], Akell e. l. for TCP performnce [2], nd Korilis, Lzr nd Ord [5] for modeling rouing problems. To he bes of our knowledge, his is he firs emp o model inrusion deecion vi smpling in communicion neworks using gme-heoreic frmework. This work is closely reled o drug inerdicion models. In priculr he work of Wshburn nd Wood [11] who considered drug inerdicion in gme heoreic frmework. This work differs from he drug inerdicion models in wo wys. Firs, in he drug inerdicion models he objecive is o deploy gens which is discree llocion problem. In our cse, he deecion is by mens of smpling. Therefore he gme heoreic resuls re much more nurl hn he discree llocion models. Secondly, in our cse, he gme heoreic problem nurlly leds o rouing problem (o
2 mximize he service provider s chnces of deecing inruding pckes) which is bsen in he drug inerdicion problem. The soluion o he gme heoreic formulion is mximum flow problem nd he rouing problem cn be formuled s mulicommodiy flow problem. We lso consider vrious exensions nd vrins o he bsic models. Ack Node Mlicious Pcke II. PROBLEM DEFINITION The problem se-up is oulined in hree seps. Firs, we describe he nework, hen we define he dversries in he gmeheoreic frmework, nd finlly we describe he objecive of he gme h is plyed beween he dversries. Fig. 1. Nework Inrusion Gme Trge Node A. Nework Se-Up We consider nework G =(N,E) where N is he se of nodes nd E is he se of unidirecionl links in he nework. We ssume h here re n nodes nd m links in he nework. We ssume h he cpciy of link e E is denoed by c e nd he moun of rffic flowing on link e is denoed by f e.given wo nodes u nd v in he nework, le Pu v represen he se of phs from u o v in G. Given n m-vecor w, weusem uv (w) o denoe he mximum flow h cn be sen from node u o node v using w s he link cpciies. We use he prmeer w explicily when we define M uv () o indice h dependence of he mximum flow on he link cpciies. Corresponding o his mximum flow beween nodes u nd v, here is minimum cu comprising of se of links in he nework. This se of links in his minimum cu will be represened by Cu(c). v B. Nework Inrusion Gme The nework inrusion deecion gme is plyed on he nework beween wo plyers: he Service Provider nd he Inruder. The objecive of he inruder is o injec mlicious pcke from some ck node N wih he inenion of cking rge node N. We ssume h n inrusion is successful when he mlicious pcke reches he desired rge node wihou deecion. In order o deec nd preven he inrusion, he service provider is llowed o smple pckes in he nework. We ssume h smpling kes plce on he links in he nework. I is esy o modify he model o consider he cse, where he smpling is done he nodes in he nework. If during he course of smpling, he service provider smples he mlicious pcke hen he inrusion is ssumed o be deeced nd hwred. The gme is picorilly illusred in Figure 1. C. The Objecive nd he Consrins of he Gme If here is no bound on he moun of smpling h cn be done by he service provider, hen he service provider cn poenilly inspec every pcke h flows hrough he nework nd hence deec he mlicious pcke. Smpling he pckes flowing on link involves seing up he pproprie smpling filers nd exmining he pckes. These cn be firly expensive operions o perform in rel ime. Therefore, we ssume h he service provider hs smpling bound of B pckes per second over he enire nework. This smpling effor cn be disribued rbirrily over he links in he nework. One wy of implemening he smpling scheme is for ech link o pick some frcion of he pckes flowing hrough i nd send i o cenrl inrusion deecion node in he nework which exmines he pcke in more deil. The smpling bound cn be viewed s he mximum re which he inrusion deecion node cn process pckes in rel ime. If link e h hs rffic of f e flowing on i, is smpled re s e hen he probbiliy of deecing mlicious pcke on his link is given by p e = s e /f e.the smpling budge consrin implies h e E s e B. Weformule he gme heoreic problems in erms of p e. We ssume h boh he plyers hve complee informion bou he opology of he nework nd ll he link flows in he nework. The service provider cn hve ccess o his informion eiher from link-se rouing proocols wih rffic engineering exensions h disribue flow informion hroughou nework re or by explici link polling from mngemen sysems. We ssume h he dversry injecing inruding pckes hs his informion vilble s well since his mkes he service provider s deecion problem more difficul. Similrly, we lso ssume h he inruder is cpble of picking phs in he nework so s o mke he deecion problem for he service provider more difficul. However, in Secion V-A, we lso consider he cse where only shores ph rouing is llowed in he nework. 1) Sregies for he Two Plyers: In he cse of he inruder, pure sregy would be o pick ph from P P for he mlicious pcke o rverse from s o. The inruder, in generl, cn use mixed sregy. In he cse of mixed sregy, he inruder hs probbiliy disribuion q over he se of phs in P such h P P q(p )=1.LeV = {q : P P q(p )=1} represen he se of fesible probbiliy llocions over he se
3 of phs beween nd. The inruder hen picks ph P P wih probbiliy q(p ). The sregy for he service provider is o deermine se of links on which smpling hs o be done. The sregy for he service provider is o choose he smpling re s e on link e such h e E s e B. If he mlicious pcke rverses link e wih smpling re of s e on link wih flow f e resuls in he mlicious pcke being deeced wih probbiliy p e = s e /f e.leu = {p : e E p ef e B} represen he se of deecion probbiliy vecors p h sisfy he smpling budge consrin. (Noe h p is n m- vecor.) Insed of viewing he service provider s picking he smpling res he links, we view he service provider s picking se of deecion probbiliies he links which belongs in he se U. Figures 2 nd 3 depic he inruder s nd he service provider s cions. Ack Node Fig. 2. Inruders Sregy: Pick ph from o Ack Node Fig. 3. Defenders Sregy: Pick he smpling res he links Inruder s Problem Service Provider s Problem Trge Node Trge Node Smpling on rcs belonging o - mincu 2) Pyoff Mrix: Assume h he inruder nd he service provider ech hve chosen sregy. This implies h he inruder hs picked probbiliy disribuion q over he se of phs in P nd he service provider hs picked se of deecion probbiliies p he links. The pyoff h we consider, is he expeced number of imes he mlicious pcke is deeced s i goes from o. For given ph P P,he expeced number of imes h pcke is deeced is given by e P p e. The probbiliy h his ph P is picked by he inruder is given by q(p ). Therefore he expeced number of imes pcke is deeced s i goes from he source o he desinion for fixed sregy from boh dversries is given by [ ] q(p ) p e. P P e P Inerchnging he order of summion, we ge [ ] q(p ) p e = p e q(p ). e P e E P P :P e P P This cn be equivlenly wrien in mrix form s q T Mp where M is n m P ph-rc incidence mrix. Ech row in M represens link in he nework nd ech column of M represens ph beween nodes nd. The enry correspondingorowe nd column P is se o one if e P nd o zero oherwise. A more nurl pyoff, is he probbiliy of deecion of he mlicious pcke s opposed o he expeced number of imes he mlicious pcke is deeced. In his cse for fixed ph P P, he probbiliy of he mlicious pcke being deeced is given by 1 e P (1 p e). This objecive is non-liner in p e which mkes he gme heoreic problem inrcble. However, he wo pyoffs h we oulined bove coincide if he opiml soluion for he service provider is o smple mos one link on ny ph P P wih q(p ) > 0. We cll his sregy miniml smpling sregy. We show ler h for ll he problems we consider, he opiml soluion is miniml smpling sregy. 3) Objecive of he Adversries: The inruder fers h if his sregy is known o he service provider hen service provider will choose sregy h mx p U P P q(p ) [ e P p e]. Therefore he objecive of he inruder is o pick disribuion q() h minimizes his mximum vlue. In oher words, he objecive of he inruder is o [ ] min mx q(p ) p e. q V p U P P e P The objecive of he service provider, using similr rgumen is [ ] mx min q(p ) p e. p U p V P P e P This is clssicl wo person zero-sum gme nd he following minmx resul is well known.
4 Theorem 1: There exiss n opiml soluion o he inrusion deecion gme where [ ] θ = min mx q(p ) p e = q V p U mx min p U q V P P P P e P [ ] q(p ) p e, e P where θ is he vlue of he gme. In he res of his pper, we show how his minmx opiml soluion cn be compued for he inrusion deecion gme nd use h insigh o roue flows in he nework. III. SOLUTION OF THE GAME We now consider he soluion of he minmx problem formuled in he ls secion. The ide is o ge some insigh ino he srucure of he problem which will enble us o exend he soluion o more complex cses. Consider he inruders problem. min mx p e q(p ). q V p U e E P P :P e For fixed q V he inner mximizion problem is he following: mx q(p ) p e e E P P :P e f e p e B e E p e 0 Associing dul vrible λ wih he budge consrin, we obin he following dul opimizion problem. f e λ λ 0 min Bλ q(p ) e E P P :P e Subsiuing his opimizion problem in he inruders minmx formulion mkes i he following minimizion problem. min Bλ q(p ) f e λ e E P P :P e q(p ) = 1 P P λ 0 Inerpreing q(p ) s flow on ph P, he consrin q(p ) f e λ P P :P e resrics he flow on link e o be f e λ. Therefore f e λ cn be inerpreed s he cpciy of link e. The consrin P P q(p )=1enforces one uni of flow o be sen from u v he source o he desinion. Assume h f e is he cpciy of link e in he nework. The objecive hen is o deermine he smlles scling fcor λ, on he links in he nework so h flow of one uni cn be sen from he source o he desinion. This cn be done s follows: Assume h link e hs cpciy f e nd deermine he mximum flow, M (f) from he o using hese cpciies. Se λ = M (f) 1. By scling he cpciies by λ, noe h flow of one uni is sen from o. The vlue of he gme θ = BM (f) 1. Any mximum flow from o cn be decomposed ino se of flows on phs from o using sndrd flow decomposiion echniques. From nework flow duliy, noe h corresponding o he mximum flow vlue here is minimum cu. The sble opering poin for he inruder nd he service provider re he following: Inruders Sregy: Solve he mximum flow M (f), from o using cpciy of f e on link e. Using sndrd flow decomposiion echniques, decompose he mximum flow ino flow on phs P 1,P 2,...,P l from o. wih flows of m 1,m 2,...,m l respecively. (Noe h l i=1 m i = M (f).) The inruder inroduces he mlicious pcke long he ph P i wih probbiliy m i M (f) 1. Service Providers Sregy: The service provider compues he mximum flow from o using f e s he cpciy of link e. Lee 1,e 2,...,e r denoe he rcs in he corresponding minimum cu wih flows f 1,f 2,...,f r.from duliy r i=1 f i = M (f). The service provider smples link e i re Bf i M (f) 1. We now illusre he bove resuls on he exmple shown in Figure 4. The numbers nex o he links re he flows on he links. How hese flows re genered is discussed in deil in subsequen secion. For now ssume h he flows on he links re given. Assume h here is smpling budge B of 5 unis. nd =1nd =5re he ck nd rge nodes respecively. The links (1, 2), (4, 5) belonging o he minimum cu re shown in hick lines. The minimum cu (nd hence he mximum flow) hs vlue of 11.5 unis. The inruder s sregy is he following: Inroduce he mlicious pcke long he ph wih probbiliy 7.0/11.5 Inroduce he mlicious pcke long he ph wih probbiliy 0.5/11.5
5 Inroduce he mlicious pcke long he ph wih probbiliy 4.0/11.5 The minmx sregy for he service provider is he following: Smple link 1-2 re 5/11.5 giving ol smpling re of (5 7.5)/11.5 on h link. Smple link 4-5 re 5/11.5 giving ol smpling re of (5 4.0)/11.5 on h link. Noe h θ =5/11.5 is he vlue of he gme. 1 Fig Exmple of Nework Minimum Cu The following observions cn be mde bou he minmx opiml soluion: The opiml sregy for he service provider is o smple pckes on he mincu wih respec o he rffic flows. This implies h long ny ph h he inruder would choose, he mlicious pcke will be smpled mos on one link. Therefore his is miniml smpling scheme. If B M (f) hen noe h he mlicious pcke will lwys be deeced. If B<M (f) hen here is non-null probbiliy h he mlicious pcke will no be deeced. IV. ROUTING TO IMPROVE THE VALUE OF THE GAME In he ls secion, we showed h he vlue of he nework inrusion gme is given by BM (f) 1. All long, we ssumed h he flow f on he links is fixed. The flows on he links re resul of rouing he demnds (ggrege rffic beween node pirs) in he nework. In his secion, we explore he cse where he service provider djuss he flows in he nework in order o mximize he vlue of he gme. Corresponding o ech pir of nodes in he nework, here could poenilly be demnds h hve o be roued from he firs node in his pir o he second node. Ech node pir beween which here is some demnd h hs o be roued is ermed source-desinion pir or commodiy. We ssume h here re K source-desinion demnd pirs (commodiies) in he nework. The source node Source Des. Demnds Pir TABLE I SOURCE-DESTINATION PAIRS AND DEMANDS Source Phs Flow Des. Pir TABLE II FLOWS FOR BASE CASE for commodiy k will be represened by s(k), he desinion node by d(k) nd he moun of demnd (bndwidh) h hs o be roued for his source-desinion pir is b(k). The service provider hs o roue hese flows in he nework respecing he link cpciy consrins. For he exmple shown in Figure 4, ech link is ssumed o hve cpciy of 10 unis. The differen source-desinion pirs nd he corresponding demnds re shown in Tble I. These demnds hve o be roued in he nework such h he link cpciy consrins re respeced. There re severl wys of rouing hese demnds. One commonly used mehod is o roue he demnds such h he mximum link uilizion in he nework is minimized. (This cn be solved s mximum concurren flow problem.) The link flows shown in Figure 4 re resul of rouing he demnds in order o minimize he mximum uilizion in he nework. The rouing is given in Tble II. We now explore he cse where he service provider roues hese flows such h he vlue of he nework inrusion gme is mximized. In oher words, he service provider roues he source-desinion demnds such h he mximum probbiliy of deecion of he mlicious pcke is incresed. We firs
6 formule his problem nd hen explore differen heurisics o solve he problem. Recll h P d(k) s(k) represens he se of phs beween he source node s(k) nd he desinion node d(k) for commodiy k. For noionl simpliciy, we refer o P d(k) s(k) s P k. Noe h P k represens he se of vlid phs o roue commodiy k. Le X = {x(p ) : P P k x(p) = d(k) k, k P P k :e P x(p ) c e e E}. Noe h X denoes n llocion of flow on phs in he nework which mees he demnd for ech commodiy while sisfying he cpciy consrins on he links in he nework. Given fesible rouing vecor, x X, he flow on link e is given by f e = k P P k :e P x(p ). From Secion III, he vlue of he gme is given by B/M (f). The objecive of he service provider hen is o roue he source desinion demnds such h he resuling vlue of M (f) is s smll s possible. Therefore he objecive of he service provider is o solve he following opimizion problem. min M ( x(p )). x X k P P k :e P This cn be wrien more explicily s min y(p ) P P v u :e P y(p ) x X P P y(p ) 0. k P P v u :e P x(p ) Unforunely his problem cnno be solved s liner progrmming problem. I is possible o reformule his problem s non-convex opimizion problem bu i is no cler if here is soluion echnique o solve his problem. We herefore develop wo differen heurisics o ge good soluions o his opimizion problem. Insed of minimizing he lef hnd side of he inequliy, we minimize he upper bound represened by he righ hnd side of he inequliy. Since c is fixed, his is equivlen o mximizing M(c k P P k :e P x(p )) subjec o he consrin h x X. We wrie his more formlly s: mx y(p ) k P P k :e P y(p ) P Pu v :e P P P v u x(p ) c e e E k P P k :e P x(p ) x(p ) = d(k) k P P k x(p ) 0 P P k j k y(p ) 0 P Pu v j k e E I is esy o view his s muli-commodiy flow problem wih K +1commodiies. There re he originl K commodiies nd n ddiionl commodiy beween nd. The size of he demnds for he firs K commodiies re known. We perform bisecion serch o deermine he lrges vlue of he commodiy K +1h sill resuls in fesible rouing for he firs K commodiies. In order o develop n efficien lgorihm i is beer o formule he problem s mximum concurren flow problem nd perform he bisecion serch for his problem insed. We do no give he deils of he soluion procedure. In he cse of he flow flushing lgorihm, he link flows for he exmple in Figure 4 re shown in Figure 5 nd he corresponding rouing is shown in Tble III A. Flow Flushing Algorihm Le he m-vecors c nd f represen he link cpciy nd he flow on he link respecively. The flow on he links is resul of rouing he differen source- desinion demnds in he nework. I is esy o see h M (f)+m (c f) M (c). This is rue since he se of flows in he wo erms on he lef hnd side of he inequliy is fesible flow for he righ hnd side of he inequliy. Therefore M (f) M (c) M (c f). If f is he resul of rouing he source-desinion demnds hen M ( x(p )) M(c) M(c x(p )). k P P k :e P k P P k :e P 1 Fig Flow Flushing Algorihm Minimum Cu 9.95 The mximum flow M (f) on his nework is 9.95 unis. The vlue of he gme θ =5/9.95. We now ouline noher
7 Source Phs Flow Des. Pir TABLE III Cu rcs FLOWS FOR BASE CASE s heurisic h cn be used by he service provider o improve he probbiliy of deecion of he mlicious pcke. B. Cu Surion Algorihm This lgorihm relies on he fc h he mximum flow beween nd is upper bounded by he size of ny cu. Le C represen he se of links in some cu. Given ny link e E, leα(e) nd β(e) represen he sr nd end nodes of h link. The cu surion lgorihm picks some cu nd ries o direc flow wy from his cu. Once he sourcedesinion demnds re roued, his cu will be smll nd hence will limi he mximum flow. This is done s follows: Inroduce wo new nodes s nd. Inroduce n rc beween node s nd ll nodes α(e) for ll e C. Similrly inroduce links beween ech node β(e) for ech e C nd he node.the objecive now is o deermine he highes flow h cn be sen from s o while minining he fesibiliy of rouing he source-desinion demnds. The modificion of he nework is shown in Figure 6. The only links shown in he nework re he cu links. This problem cn be solved lmos ideniclly o he Flow Flushing Algorihm, excep h he K +1commodiy flows go beween nodes s nd. One wy of choosing he cu h is o be sured is s follows: Assume h we currenly hve rouing of he source-desinion demnds resuling in flow of f(e) on link e. Deermine minimum cu (using hese flows f s he cpciies). Tke his cu o be C nd now emp o sure his cu. Coninuing he exmple in Figure 4, ssume h he cu h we sure comprises of he links (1, 2) nd (4, 5). The links flows re shown in Figure 7 nd he corresponding flows re shown in Tble IV. The mximum flow M (f) on his nework is 8.0 unis. The vlue of he gme θ =5/8. Therefore, in his exmple, he cu Fig Fig. 7. Cu Surion Algorihm Nework Se-up Cu Surion Algorihm Minimum Cu 7.0 surion lgorihm gives beer soluion h he flow flushing lgorihm. V. VARIANTS AND EXTENSIONS We consider severl vrins of he problem oulined bove. The firs vrin h we consider is he cse where he inruder cn inroduce he mlicious pcke one of se of nodes A N. We ssume h / A. The second vrin h we consider is he cse where he objecive of he inruder is o rech ny one of of se of nodes T N. We ssume h A T =. Boh hese cses re esy o solve by inroducing super source node h is conneced o ll nodes in A nd connecing ll nodes in T o super sink node. The gme is now plyed beween he super source node nd he super sink node. Anoher vrin is he cse where he inruder cn inroduce he pcke ny one
8 Source Phs Flow Des. Pir TABLE IV FLOWS FOR BASE CASE Noe h L(d) represens he mximum flow h cn be sen from ll he nodes in A o he desinion node d. Thevlueof he gme is B/L(d). VI. EXPERIMENTAL RESULTS In his secion we evlued he lgorihms developed on wo neworks. The firs nework is shown in Figure 8. Ech undireced link in he figure represens wo direced links ech hving cpciy of 10 unis. We performed he following experi of se of nodes A bu we ssume h he inruder does no hve conrol of he rouing in he nework. Insed, we ssume h he rouing in he nework is shores ph rouing like in OSPF or IS- IS. We erm his shores ph rouing gme A. Shores Ph Rouing Gme We now consider he problem where he rouing in he nework is long shores phs. We ssume h ech link hs lengh nd pckes re roued from he source o he desinion long shores phs ccording o his lengh meric. We ssume h ies re broken rbirrily. Therefore given ny wo nodes in he nework, here is unique ph from one node o he oher. Given rge node, ll pckes rriving his node rverse he shores ph ree. Shores ph rouing implies h here is unique ree rooed he desinion. A pcke inroduced ny node in he nework rverses he unique ph from h node o he desinion long he links in he shores ph ree. We use A o represen he se of nodes h he inruder cn inroduce mlicious pcke ino he nework. The objecive of he inruder is o deermine which node of his se A o inroduce he pcke ino nd he objecive for he service provider is o deermine he smpling re he links subjec o smpling budge of B. The min difference beween his problem nd he problem h we originlly sudied is he fc h i is esy o compue he mximum flow nd hence he minimum cu on ree. The lgorihm for solving his problem is he following: Elimine ll lef nodes in he rouing ree h do no belong o A. LeT represen his ree. Le P (i) represen he predecessor of node i on T. Se L(i) = for ll lef nodes. While here re no lef nodes do Pick lef node i. Lee be he edge connecing i o P (i). Se L(P (i)) L(P (i)) + min{l(i),f e }. Oupu L(). 4 Fig. 8. Experimenl Nework mens: Single ck node nd single rge node. (3 problems). Muliple ck node nd single rge node. (1 problem). Muliple ck node nd muliple rge node. (1 problem). For ech of he cses, we rn hree differen lgorihms. 1) Rouing o minimize he highes uilized link wih f 1 represening he m-vecor of link flows s resul of his rouing lgorihm. 2) Rouing wih flow flushing lgorihm wih f 2 represening he m-vecor of link flows s resul of his rouing lgorihm. 3) Rouing wih cu surion lgorihm wih f 3 represening he m-vecor of link flows s resul of his rouing lgorihm. Le M(f i ) for i =1, 2, 3 represen he mximum flow h cn be sen from node o using f i s he link cpciies. If B is he smpling budge, hen he vlue of he gme θ = B/M(). Tble V shows he vlues of M() insed of θ. The smller h vlue of M, he beer he chnces of deecion for given smpling budge
9 Ack Trge M(f 1 ) M(f 2 ) M(f 3 ) Node(s) Node(s) ,2,4, ,2,4,8 12,13, TABLE V COMPARISON OF DIFFERENT ROUTING ALGORITHMS From he ble, noe h he mximum flow vlue nd hence he vlue of he gme cn be chnged significnly by chnging he rouing in he nework. In mos of he exmples he performnce of he flow flusing lgorihm nd he cu surion lgorihm re quie similr, nd beer hn he simple minimizion of mximum link uilizion lgorihm A. Effec of Cpciy on he Vlue of he Gme As he moun of spre cpciy in nework increses, he opporuniy o reroue flows increses. This implies h he service provider cn improve he probbiliy of deecion by exploiing he spre cpciy o reroue flows. We illusre his in he following se of experimens, using second exmple nework, where he cpciy of he links in he exmple nework re fixed some consn vlue C. IfhevlueofC increses, hen he opporuniy o reroue flows goes up. We consider he inrusion deecion gme beween nodes =1nd =13.The demnds in he nework re uniformly disribued beween zero nd one. We firs run he lgorihm o roue he flow such h mximum uilizion of ny link is minimized. This mximum uilizion vlue versus he link cpciy C is shown in Figure 9. As he mximum uilizion becomes lower, he moun of spre cpciy o reroue flows increses in he nework. This implies h boh he flow flushing lgorihm s well s he cu surion lgorihm will hve more lerne phs. In Figure 10, we show he performnce of he flow flushing lgorihm s he vlue of C increses. The srigh line in he plo shows he performnce of he bse cse which is he rouing lgorihm h minimizes he mximum uilizion. The mximum flow is independen of he vlue of C. In he cse of he flow flushing lgorihm, he mximum flow vlue decreses wih incresing link cpciy. I sympoes bou 8.8. The sme kind of performnce ws observed in he cse of oher ck-rge pirs s well s he cse for muliple ck sies. VII. CONCLUDING REMARKS We considered he problem of deecing inruding pckes in nework by mens of nework pcke smpling. Since MAX UTILIZATION LINK CAPACITY Fig. 9. Mx. Uilizion vs. Link Cpciy for flow rouing o minimize mximum link uilizion MAXIMUM FLOW Fig. 10. MAXFLOW BEFORE FFA MAXFLOW AFTER FFA LINK CAPACITY Performnce of flow flushing lgorihm for differen link cpciies pcke smpling nd exminion in rel-ime cn be expensive, he nework operor mus devise n effecive smpling scheme o deec inruding pckes injeced ino he nework by n dversry. We considered he scenrio where he dversry hs considerble informion bou he nework nd cn eiher pick phs o minimize chnces of deecion or cn pick suible nework ingress-poin if only shores ph rouing is llowed. The deecion vi smpling problem ws formuled in gme-heoreic frmework. The soluion o his gme-heoreic problem is mx-flow problem from which he sble opering poins re obined. We lso considered he nework op-
10 eror s problem of rouing ggrege rffic beween ingressegress pirs s o o mximize he chnces of deecion wihin given pcke smpling budge. We proposed wo heurisic lgorihms for solving his problem. Finlly, we evlued he performnce of he developed lgorihms on some smple neworks. REFERENCES [1] R. K. Ahuj, T. L. Mgnni, J. B. Orlin, Nework Flows: Theory, Algorihms, nd Applicions, Prenice Hll, [2] Akell, A., Krp, R., Ppdimiriou, C., Seshn, S., Shenker, S., Selfish Behvior nd he Sbiliy of he Inerne: A Gme Theoreic Anlysis of TCP, Proceedings of SIGCOMM 2002, [3] Duffield, N., Greenberg, A., Grossgluser, M., Rexford, J., A Frmework for Pssive Pcke Mesuremen. IETF Drf, work in progress, drfduffield-frmework-ppme-01, Februry [4] Grg, N., nd Könemnn, J., Fser nd Simpler Algorihms for Mulicommodiy Flow nd oher Frcionl Pcking Problems, Proceedings of he 39h Annul Symposium on Foundions of Compuer Science, pp , [5] Korilis, Y., Lzr, A., Ord, A., Archiecing Noncooperive Neworks, IEEE Journl on Seleced Ares in Communicions, pp , Sepember [6] O, T. J., nd Lkshmn, T. V., nd Wong, L. H., SRED: Sbilized RED, Proceedings of Infocom 1999, pp , [7] Pn, R., Prbhkr, B., Psounis, K., CHOKE, A Seless Acive Queue Mngemen Scheme for Approximing Fir Bndwidh Allocion, Proceedings of Infocom 200, pp , [8] Owen, G., Gme Theory, Acdemic Press, New York. [9] Shhrokhi, F., nd Mul, D., The Mximum Concurren Flow Problem, Journl of he ACM, 37, pp , [10] Shenker, S., Mking Greed Work in Neworks: A Gme-Theoreic Anlysis of Swich Service Disciplines, IEEE/ACM Trnscions on Neworking, [11] Wshburn, A., nd Wood, K., Two-Person Zero-Sum Gmes for Nework Inerdicion, Operions Reserch, 43, pp , 1995.
Improper Integrals. Dr. Philippe B. laval Kennesaw State University. September 19, 2005. f (x) dx over a finite interval [a, b].
Improper Inegrls Dr. Philippe B. lvl Kennesw Se Universiy Sepember 9, 25 Absrc Noes on improper inegrls. Improper Inegrls. Inroducion In Clculus II, sudens defined he inegrl f (x) over finie inervl [,
More informationOne Practical Algorithm for Both Stochastic and Adversarial Bandits
One Prcicl Algorihm for Boh Sochsic nd Adversril Bndis Yevgeny Seldin Queenslnd Universiy of Technology, Brisbne, Ausrli Aleksndrs Slivkins Microsof Reserch, New York NY, USA YEVGENY.SELDIN@GMAIL.COM SLIVKINS@MICROSOFT.COM
More informationDynamic Magnification Factor of SDOF Oscillators under. Harmonic Loading
Dynmic Mgnificion Fcor of SDOF Oscillors under Hrmonic Loding Luis Mrí Gil-Mrín, Jun Frncisco Cronell-Márquez, Enrique Hernández-Mones 3, Mrk Aschheim 4 nd M. Psds-Fernández 5 Asrc The mgnificion fcor
More informationExample What is the minimum bandwidth for transmitting data at a rate of 33.6 kbps without ISI?
Emple Wh is he minimum ndwidh for rnsmiing d re of 33.6 kps wihou ISI? Answer: he minimum ndwidh is equl o he yquis ndwidh. herefore, BW min W R / 33.6/ 6.8 khz oe: If % roll-off chrcerisic is used, ndwidh
More informationOptimal Contracts in a Continuous-Time Delegated Portfolio Management Problem
Opiml Conrcs in Coninuous-ime Deleged Porfolio Mngemen Problem Hui Ou-Yng Duke Universiy nd Universiy of Norh Crolin his ricle sudies he conrcing problem beween n individul invesor nd professionl porfolio
More informationMr. Kepple. Motion at Constant Acceleration 1D Kinematics HW#5. Name: Date: Period: (b) Distance traveled. (a) Acceleration.
Moion Consn Accelerion 1D Kinemics HW#5 Mr. Kepple Nme: De: Period: 1. A cr cceleres from 1 m/s o 1 m/s in 6.0 s. () Wh ws is ccelerion? (b) How fr did i rel in his ime? Assume consn ccelerion. () Accelerion
More informationA Multi-agent Trading Platform for Electricity Contract Market
1 A Muli-gen Trding Plform for Elecriciy Conrc Mrke Yun Ji-hi, Yu Shun-kun nd Hu Zho-gung Absrc-- An gen-bsed negoiion plform for power genering nd power consuming (purchsing) compnies in conrc elecriciy
More informationChapter 7. Response of First-Order RL and RC Circuits
Chaper 7. esponse of Firs-Order L and C Circuis 7.1. The Naural esponse of an L Circui 7.2. The Naural esponse of an C Circui 7.3. The ep esponse of L and C Circuis 7.4. A General oluion for ep and Naural
More informationHuman Body Tracking with Auxiliary Measurements
IEEE Inernionl Workshop on Anlysis nd Modeling of Fces nd Gesures, 003. Humn Body Trcking wih Auxiliry Mesuremens Mun Wi Lee, Isc Cohen Insiue for Roboics nd Inelligen Sysems Inegred Medi Sysems Cener
More informationInfluence of Network Load on the Performance of Opportunistic Scanning
Influence of Nework Lod on he Performnce of Opporunisic Scnning Mrc Emmelmnn, Sven Wiehöler, nd Hyung-Tek Lim Technicl Universiy Berlin Telecommunicion Neworks Group TKN Berlin, Germny Emil: emmelmnn@ieee.org,
More informationA Dynamic Model of Health Insurance Choices and Health Care Consumption 1. Jian Ni Johns Hopkins University Email: jni@jhu.edu
A Dynmic Model of Helh Insurnce Choices nd Helh Cre Consumpion Jin Ni Johns Hopins Universiy Emil: jni@jhu.edu Niin Meh Universiy of Torono Emil: nmeh@romn.uorono.c Knnn Srinivsn Crnegie Mellon Universiy
More informationA MODEL OF FIRM BEHAVIOUR WITH EQUITY CONSTRAINTS AND BANKRUPTCY COSTS.
WORKING PAPERS Invesigção - Trblhos em curso - nº 134, Novembro de 003 A Model of Firm Behviour wih Euiy Consrins nd Bnrupcy Coss Pedro Mzed Gil FACULDADE DE ECONOMIA UNIVERSIDADE DO PORTO www.fep.up.p
More informationMultiprocessor Systems-on-Chips
Par of: Muliprocessor Sysems-on-Chips Edied by: Ahmed Amine Jerraya and Wayne Wolf Morgan Kaufmann Publishers, 2005 2 Modeling Shared Resources Conex swiching implies overhead. On a processing elemen,
More informationSingle-machine Scheduling with Periodic Maintenance and both Preemptive and. Non-preemptive jobs in Remanufacturing System 1
Absrac number: 05-0407 Single-machine Scheduling wih Periodic Mainenance and boh Preempive and Non-preempive jobs in Remanufacuring Sysem Liu Biyu hen Weida (School of Economics and Managemen Souheas Universiy
More informationDDoS Attacks Detection Model and its Application
DDoS Aacks Deecion Model and is Applicaion 1, MUHAI LI, 1 MING LI, XIUYING JIANG 1 School of Informaion Science & Technology Eas China Normal Universiy No. 500, Dong-Chuan Road, Shanghai 0041, PR. China
More informationTSG-RAN Working Group 1 (Radio Layer 1) meeting #3 Nynashamn, Sweden 22 nd 26 th March 1999
TSG-RAN Working Group 1 (Radio Layer 1) meeing #3 Nynashamn, Sweden 22 nd 26 h March 1999 RAN TSGW1#3(99)196 Agenda Iem: 9.1 Source: Tile: Documen for: Moorola Macro-diversiy for he PRACH Discussion/Decision
More informationPolynomial Functions. Polynomial functions in one variable can be written in expanded form as ( )
Polynomil Functions Polynomil functions in one vrible cn be written in expnded form s n n 1 n 2 2 f x = x + x + x + + x + x+ n n 1 n 2 2 1 0 Exmples of polynomils in expnded form re nd 3 8 7 4 = 5 4 +
More informationResource allocation in multi-server dynamic PERT networks using multi-objective programming and Markov process. E-mail: bagherpour@iust.ac.
IJST () A: -7 Irnin Journl of Science & Technology hp://www.shirzu.c.ir/en Resource llocion in uli-server dynic PERT neworks using uli-objecive progring nd Mrkov process S. Yghoubi, S. Noori nd M. Bgherpour
More informationTerm-based composition of security protocols
Term-sed composiion of securiy proocols B Genge P Hller R Ovidiu I Ign Peru ior Universiy of Trgu ures Romni genge@upmro phller@upmro oroi@engineeringupmro Technicl Universiy of Cluj poc Romni IosifIgn@csuclujro
More informationPROFIT TEST MODELLING IN LIFE ASSURANCE USING SPREADSHEETS PART ONE
Profi Tes Modelling in Life Assurance Using Spreadshees PROFIT TEST MODELLING IN LIFE ASSURANCE USING SPREADSHEETS PART ONE Erik Alm Peer Millingon 2004 Profi Tes Modelling in Life Assurance Using Spreadshees
More informationTask is a schedulable entity, i.e., a thread
Real-Time Scheduling Sysem Model Task is a schedulable eniy, i.e., a hread Time consrains of periodic ask T: - s: saring poin - e: processing ime of T - d: deadline of T - p: period of T Periodic ask T
More informationSignal Processing and Linear Systems I
Sanford Universiy Summer 214-215 Signal Processing and Linear Sysems I Lecure 5: Time Domain Analysis of Coninuous Time Sysems June 3, 215 EE12A:Signal Processing and Linear Sysems I; Summer 14-15, Gibbons
More informationReasoning to Solve Equations and Inequalities
Lesson4 Resoning to Solve Equtions nd Inequlities In erlier work in this unit, you modeled situtions with severl vriles nd equtions. For exmple, suppose you were given usiness plns for concert showing
More information2. The econometric model
Age Bised Technicl nd Orgnisionl Chnge, Trining nd Employmen Prospecs of Older Workers * Luc BEHAGHEL (Pris School of Economics (INRA) nd CREST) Eve CAROLI (Universiy Pris Duphine, LED-LEGOS, Pris School
More informationRandom Walk in 1-D. 3 possible paths x vs n. -5 For our random walk, we assume the probabilities p,q do not depend on time (n) - stationary
Random Walk in -D Random walks appear in many cones: diffusion is a random walk process undersanding buffering, waiing imes, queuing more generally he heory of sochasic processes gambling choosing he bes
More informationChapter 8: Regression with Lagged Explanatory Variables
Chaper 8: Regression wih Lagged Explanaory Variables Time series daa: Y for =1,..,T End goal: Regression model relaing a dependen variable o explanaory variables. Wih ime series new issues arise: 1. One
More informationAutomatic measurement and detection of GSM interferences
Auomaic measuremen and deecion of GSM inerferences Poor speech qualiy and dropped calls in GSM neworks may be caused by inerferences as a resul of high raffic load. The radio nework analyzers from Rohde
More informationThe Transport Equation
The Transpor Equaion Consider a fluid, flowing wih velociy, V, in a hin sraigh ube whose cross secion will be denoed by A. Suppose he fluid conains a conaminan whose concenraion a posiion a ime will be
More informationDuration and Convexity ( ) 20 = Bond B has a maturity of 5 years and also has a required rate of return of 10%. Its price is $613.
Graduae School of Business Adminisraion Universiy of Virginia UVA-F-38 Duraion and Convexiy he price of a bond is a funcion of he promised paymens and he marke required rae of reurn. Since he promised
More informationReuse-Based Test Traceability: Automatic Linking of Test Cases and Requirements
Inernionl Journl on Advnces in Sofwre, vol 7 no 3&4, yer 2014, hp://www.irijournls.org/sofwre/ Reuse-Bsed Tes Trcebiliy: Auomic Linking of Tes Cses nd Requiremens 469 Thoms Nock, Thoms Krbe Technische
More informationReal-time Particle Filters
Real-ime Paricle Filers Cody Kwok Dieer Fox Marina Meilă Dep. of Compuer Science & Engineering, Dep. of Saisics Universiy of Washingon Seale, WA 9895 ckwok,fox @cs.washingon.edu, mmp@sa.washingon.edu Absrac
More informationACCOUNTING, ECONOMICS AND FINANCE. School Working Papers Series 2004 SWP 2004/08
FACULTY OF BUSINESS AND LAW School of ACCOUNTING, ECONOMICS AND FINANCE School Workin Ppers Series 4 SWP 4/8 STRUCTURAL EFFECTS AND SPILLOVERS IN HSIF, HSI AND S&P5 VOLATILITY Gerrd Gnnon* Deprmen of Accounin,
More informationOption Put-Call Parity Relations When the Underlying Security Pays Dividends
Inernaional Journal of Business and conomics, 26, Vol. 5, No. 3, 225-23 Opion Pu-all Pariy Relaions When he Underlying Securiy Pays Dividends Weiyu Guo Deparmen of Finance, Universiy of Nebraska Omaha,
More informationIn the last decades, due to the increasing progress in genome
Se Esimion for Geneic Regulory Neworks wih Time-Vrying Delys nd Recion-Diffusion Terms Yunyun Hn, Xin Zhng, Member, IEEE, Ligng Wu, Senior Member, IEEE nd Yno Wng rxiv:59.888v [mh.oc] Sep 5 Absrc This
More informationInformation Technology Investment and Adoption: A Rational Expectations Perspective
Informion Technology Invesmen nd Adopion: A Rionl Expecions Perspecive Yoris A. Au Rober J. Kuffmn Docorl Progrm, Informion nd Decision Co-Direcor, MIS Reserch Cener nd Sciences, Crlson School of Mngemen,
More information17 Laplace transform. Solving linear ODE with piecewise continuous right hand sides
7 Laplace ransform. Solving linear ODE wih piecewise coninuous righ hand sides In his lecure I will show how o apply he Laplace ransform o he ODE Ly = f wih piecewise coninuous f. Definiion. A funcion
More informationAge Biased Technical and Organisational Change, Training and Employment Prospects of Older Workers
DISCUSSION PAPER SERIES IZA DP No. 5544 Age Bised Technicl nd Orgnisionl Chnge, Trining nd Employmen Prospecs of Older Workers Luc Behghel Eve Croli Muriel Roger Mrch 2011 Forschungsinsiu zur Zukunf der
More informationUSE OF EDUCATION TECHNOLOGY IN ENGLISH CLASSES
USE OF EDUCATION TECHNOLOGY IN ENGLISH CLASSES Mehme Nuri GÖMLEKSİZ Absrac Using educaion echnology in classes helps eachers realize a beer and more effecive learning. In his sudy 150 English eachers were
More informationModule 3 Design for Strength. Version 2 ME, IIT Kharagpur
Module 3 Design for Srengh Lesson 2 Sress Concenraion Insrucional Objecives A he end of his lesson, he sudens should be able o undersand Sress concenraion and he facors responsible. Deerminaion of sress
More informationSTRATEGIC PLANNING COMMITTEE Wednesday, February 17, 2010
em: STATEGC PLANNNG COMMTTEE Wednesdy, Februry 17, 2010 SUBJECT: EQUEST FO APPOVAL TO NAME THE WALKWAY FOM DADE AVENUE TO PAKNG GAAGE 2 DVESTY WAY ON THE BOCA ATON CAMPUS. POPOSED COMMTTEE ACTON Provide
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationThe option pricing framework
Chaper 2 The opion pricing framework The opion markes based on swap raes or he LIBOR have become he larges fixed income markes, and caps (floors) and swapions are he mos imporan derivaives wihin hese markes.
More informationAppendix A: Area. 1 Find the radius of a circle that has circumference 12 inches.
Appendi A: Area worked-ou s o Odd-Numbered Eercises Do no read hese worked-ou s before aemping o do he eercises ourself. Oherwise ou ma mimic he echniques shown here wihou undersanding he ideas. Bes wa
More informationStrategic Optimization of a Transportation Distribution Network
Sraegic Opimizaion of a Transporaion Disribuion Nework K. John Sophabmixay, Sco J. Mason, Manuel D. Rossei Deparmen of Indusrial Engineering Universiy of Arkansas 4207 Bell Engineering Cener Fayeeville,
More informationInductance and Transient Circuits
Chaper H Inducance and Transien Circuis Blinn College - Physics 2426 - Terry Honan As a consequence of Faraday's law a changing curren hrough one coil induces an EMF in anoher coil; his is known as muual
More informationMathematics in Pharmacokinetics What and Why (A second attempt to make it clearer)
Mahemaics in Pharmacokineics Wha and Why (A second aemp o make i clearer) We have used equaions for concenraion () as a funcion of ime (). We will coninue o use hese equaions since he plasma concenraions
More informationModule 4. Single-phase AC circuits. Version 2 EE IIT, Kharagpur
Module 4 Single-phase A circuis ersion EE T, Kharagpur esson 5 Soluion of urren in A Series and Parallel ircuis ersion EE T, Kharagpur n he las lesson, wo poins were described:. How o solve for he impedance,
More informationStochastic Optimal Control Problem for Life Insurance
Sochasic Opimal Conrol Problem for Life Insurance s. Basukh 1, D. Nyamsuren 2 1 Deparmen of Economics and Economerics, Insiue of Finance and Economics, Ulaanbaaar, Mongolia 2 School of Mahemaics, Mongolian
More informationBusato, Francesco; Chiarini, Bruno; Marzano, Elisabetta. Working Paper Moonlighting production, tax rates and capital subsidies
econsor www.econsor.eu Der Open-Access-Publikionsserver der ZBW Leibniz-Informionszenrum Wirschf The Open Access Publicion Server of he ZBW Leibniz Informion Cenre for Economics Buso, Frncesco; Chirini,
More informationSTABILITY OF LOAD BALANCING ALGORITHMS IN DYNAMIC ADVERSARIAL SYSTEMS
STABILITY OF LOAD BALANCING ALGORITHMS IN DYNAMIC ADVERSARIAL SYSTEMS ELLIOT ANSHELEVICH, DAVID KEMPE, AND JON KLEINBERG Absrac. In he dynamic load balancing problem, we seek o keep he job load roughly
More informationSpectrum-Aware Data Replication in Intermittently Connected Cognitive Radio Networks
Specrum-Aware Daa Replicaion in Inermienly Conneced Cogniive Radio Neworks Absrac The opening of under-uilized specrum creaes an opporuniy for unlicensed users o achieve subsanial performance improvemen
More informationChapter 2 Problems. 3600s = 25m / s d = s t = 25m / s 0.5s = 12.5m. Δx = x(4) x(0) =12m 0m =12m
Chaper 2 Problems 2.1 During a hard sneeze, your eyes migh shu for 0.5s. If you are driving a car a 90km/h during such a sneeze, how far does he car move during ha ime s = 90km 1000m h 1km 1h 3600s = 25m
More informationA Note on Using the Svensson procedure to estimate the risk free rate in corporate valuation
A Noe on Using he Svensson procedure o esimae he risk free rae in corporae valuaion By Sven Arnold, Alexander Lahmann and Bernhard Schwezler Ocober 2011 1. The risk free ineres rae in corporae valuaion
More informationINTERFEROMETRIC TECHNIQUES FOR TERRASAR-X DATA. Holger Nies, Otmar Loffeld, Baki Dönmez, Amina Ben Hammadi, Robert Wang, Ulrich Gebhardt
INTERFEROMETRIC TECHNIQUES FOR TERRASAR-X DATA Holger Nies, Omr Loffeld, Bki Dönmez, Amin Ben Hmmdi, Rober Wng, Ulrich Gebhrd Cener for Sensorsysems (ZESS), Universiy of Siegen Pul-Bonz-Sr. 9-, D-5768
More informationSELF-EVALUATION FOR VIDEO TRACKING SYSTEMS
SELF-EVALUATION FOR VIDEO TRACKING SYSTEMS Hao Wu and Qinfen Zheng Cenre for Auomaion Research Dep. of Elecrical and Compuer Engineering Universiy of Maryland, College Park, MD-20742 {wh2003, qinfen}@cfar.umd.edu
More informationCHARGE AND DISCHARGE OF A CAPACITOR
REFERENCES RC Circuis: Elecrical Insrumens: Mos Inroducory Physics exs (e.g. A. Halliday and Resnick, Physics ; M. Sernheim and J. Kane, General Physics.) This Laboraory Manual: Commonly Used Insrumens:
More information4. International Parity Conditions
4. Inernaional ariy ondiions 4.1 urchasing ower ariy he urchasing ower ariy ( heory is one of he early heories of exchange rae deerminaion. his heory is based on he concep ha he demand for a counry's currency
More informationIdentifying Merger Unilateral Effects: HHI or Simulation?
Idenifying Merger Unilerl Effecs: HHI or Simulion? Jerome FONCEL Universiy of Lille, Frnce erome.foncel@univ-lille3.fr Mrc IVALDI Toulouse School of Economics, nd CEPR, Frnce ivldi@cic.fr Jrissy MOTIS
More informationThe Application of Multi Shifts and Break Windows in Employees Scheduling
The Applicaion of Muli Shifs and Brea Windows in Employees Scheduling Evy Herowai Indusrial Engineering Deparmen, Universiy of Surabaya, Indonesia Absrac. One mehod for increasing company s performance
More informationAnalysis of Pricing and Efficiency Control Strategy between Internet Retailer and Conventional Retailer
Recen Advances in Business Managemen and Markeing Analysis of Pricing and Efficiency Conrol Sraegy beween Inerne Reailer and Convenional Reailer HYUG RAE CHO 1, SUG MOO BAE and JOG HU PARK 3 Deparmen of
More informationDETERMINISTIC INVENTORY MODEL FOR ITEMS WITH TIME VARYING DEMAND, WEIBULL DISTRIBUTION DETERIORATION AND SHORTAGES KUN-SHAN WU
Yugoslav Journal of Operaions Research 2 (22), Number, 6-7 DEERMINISIC INVENORY MODEL FOR IEMS WIH IME VARYING DEMAND, WEIBULL DISRIBUION DEERIORAION AND SHORAGES KUN-SHAN WU Deparmen of Bussines Adminisraion
More informationConstant Data Length Retrieval for Video Servers with Variable Bit Rate Streams
IEEE Inernaional Conference on Mulimedia Compuing & Sysems, June 17-3, 1996, in Hiroshima, Japan, p. 151-155 Consan Lengh Rerieval for Video Servers wih Variable Bi Rae Sreams Erns Biersack, Frédéric Thiesse,
More informationThe Greek financial crisis: growing imbalances and sovereign spreads. Heather D. Gibson, Stephan G. Hall and George S. Tavlas
The Greek financial crisis: growing imbalances and sovereign spreads Heaher D. Gibson, Sephan G. Hall and George S. Tavlas The enry The enry of Greece ino he Eurozone in 2001 produced a dividend in he
More informationPhys222 W12 Quiz 2: Chapters 23, 24. Name: = 80 nc, and q = 30 nc in the figure, what is the magnitude of the total electric force on q?
Nme: 1. A pricle (m = 5 g, = 5. µc) is relesed from res when i is 5 cm from second pricle (Q = µc). Deermine he mgniude of he iniil ccelerion of he 5-g pricle.. 54 m/s b. 9 m/s c. 7 m/s d. 65 m/s e. 36
More informationTerm Structure of Prices of Asian Options
Term Srucure of Prices of Asian Opions Jirô Akahori, Tsuomu Mikami, Kenji Yasuomi and Teruo Yokoa Dep. of Mahemaical Sciences, Risumeikan Universiy 1-1-1 Nojihigashi, Kusasu, Shiga 525-8577, Japan E-mail:
More informationTEMPORAL PATTERN IDENTIFICATION OF TIME SERIES DATA USING PATTERN WAVELETS AND GENETIC ALGORITHMS
TEMPORAL PATTERN IDENTIFICATION OF TIME SERIES DATA USING PATTERN WAVELETS AND GENETIC ALGORITHMS RICHARD J. POVINELLI AND XIN FENG Deparmen of Elecrical and Compuer Engineering Marquee Universiy, P.O.
More informationAnalogue and Digital Signal Processing. First Term Third Year CS Engineering By Dr Mukhtiar Ali Unar
Analogue and Digial Signal Processing Firs Term Third Year CS Engineering By Dr Mukhiar Ali Unar Recommended Books Haykin S. and Van Veen B.; Signals and Sysems, John Wiley& Sons Inc. ISBN: 0-7-380-7 Ifeachor
More informationTask-Execution Scheduling Schemes for Network Measurement and Monitoring
Task-Execuion Scheduling Schemes for Nework Measuremen and Monioring Zhen Qin, Robero Rojas-Cessa, and Nirwan Ansari Deparmen of Elecrical and Compuer Engineering New Jersey Insiue of Technology Universiy
More informationPATHWISE PROPERTIES AND PERFORMANCE BOUNDS FOR A PERISHABLE INVENTORY SYSTEM
PATHWISE PROPERTIES AND PERFORMANCE BOUNDS FOR A PERISHABLE INVENTORY SYSTEM WILLIAM L. COOPER Deparmen of Mechanical Engineering, Universiy of Minnesoa, 111 Church Sree S.E., Minneapolis, MN 55455 billcoop@me.umn.edu
More informationGraphs on Logarithmic and Semilogarithmic Paper
0CH_PHClter_TMSETE_ 3//00 :3 PM Pge Grphs on Logrithmic nd Semilogrithmic Pper OBJECTIVES When ou hve completed this chpter, ou should be ble to: Mke grphs on logrithmic nd semilogrithmic pper. Grph empiricl
More informationEconomics Honors Exam 2008 Solutions Question 5
Economics Honors Exam 2008 Soluions Quesion 5 (a) (2 poins) Oupu can be decomposed as Y = C + I + G. And we can solve for i by subsiuing in equaions given in he quesion, Y = C + I + G = c 0 + c Y D + I
More information3.1. Overview Serial Devices to Ethernet Gateway
Overview Progrmmble Server (Seril-o-) Overview Overview.. Overview Seril o Gewy he CP DAS Progrmmble Server i deigned o bring nework conneciviy o your eril device. he progrmmble feure llow developer o
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd business. Introducing technology
More informationHedging with Forwards and Futures
Hedging wih orwards and uures Hedging in mos cases is sraighforward. You plan o buy 10,000 barrels of oil in six monhs and you wish o eliminae he price risk. If you ake he buy-side of a forward/fuures
More informationAcceleration Lab Teacher s Guide
Acceleraion Lab Teacher s Guide Objecives:. Use graphs of disance vs. ime and velociy vs. ime o find acceleraion of a oy car.. Observe he relaionship beween he angle of an inclined plane and he acceleraion
More informationTrends in TCP/IP Retransmissions and Resets
Trends in TCP/IP Reransmissions and Reses Absrac Concordia Chen, Mrunal Mangrulkar, Naomi Ramos, and Mahaswea Sarkar {cychen, mkulkarn, msarkar,naramos}@cs.ucsd.edu As he Inerne grows larger, measuring
More informationMorningstar Investor Return
Morningsar Invesor Reurn Morningsar Mehodology Paper Augus 31, 2010 2010 Morningsar, Inc. All righs reserved. The informaion in his documen is he propery of Morningsar, Inc. Reproducion or ranscripion
More informationANALYSIS AND COMPARISONS OF SOME SOLUTION CONCEPTS FOR STOCHASTIC PROGRAMMING PROBLEMS
ANALYSIS AND COMPARISONS OF SOME SOLUTION CONCEPTS FOR STOCHASTIC PROGRAMMING PROBLEMS R. Caballero, E. Cerdá, M. M. Muñoz and L. Rey () Deparmen of Applied Economics (Mahemaics), Universiy of Málaga,
More informationSTABILITY OF LOAD BALANCING ALGORITHMS IN DYNAMIC ADVERSARIAL SYSTEMS
SIAM J. COMPUT. Vol. 37, No. 5, pp. 1656 1673 c 2008 Sociey for Indusrial and Applied Mahemaics STABILITY OF LOAD BALANCING ALGORITHMS IN DYNAMIC ADVERSARIAL SYSTEMS ELLIOT ANSHELEVICH, DAVID KEMPE, AND
More informationEfficient One-time Signature Schemes for Stream Authentication *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 611-64 (006) Efficien One-ime Signaure Schemes for Sream Auhenicaion * YONGSU PARK AND YOOKUN CHO + College of Informaion and Communicaions Hanyang Universiy
More informationERSİTES ABSTRACTT. The. optimal. bulunmasına yönelik. Warsaw Tel: 482 256 486 17,
ANADOLU ÜNİVE ERSİTES Bilim ve Tenoloji Dergisi B-Teori Bilimler Cil: 2 Syı: 2 203 Syf:27-42 ARAŞTIRMAA MAKALESİ / RESEARCH ARTICLE Ann DECEWİCZ MARKOV MODELS IN CALCULATING ABSTRACTT The er resens mehod
More informationChapter 13. Network Flow III Applications. 13.1 Edge disjoint paths. 13.1.1 Edge-disjoint paths in a directed graphs
Chaper 13 Nework Flow III Applicaion CS 573: Algorihm, Fall 014 Ocober 9, 014 13.1 Edge dijoin pah 13.1.1 Edge-dijoin pah in a direced graph 13.1.1.1 Edge dijoin pah queiong: graph (dir/undir)., : verice.
More informationMATH 150 HOMEWORK 4 SOLUTIONS
MATH 150 HOMEWORK 4 SOLUTIONS Section 1.8 Show tht the product of two of the numbers 65 1000 8 2001 + 3 177, 79 1212 9 2399 + 2 2001, nd 24 4493 5 8192 + 7 1777 is nonnegtive. Is your proof constructive
More informationTowards Intrusion Detection in Wireless Sensor Networks
Towards Inrusion Deecion in Wireless Sensor Neworks Kroniris Ioannis, Tassos Dimiriou and Felix C. Freiling Ahens Informaion Technology, 19002 Peania, Ahens, Greece Email: {ikro,dim}@ai.edu.gr Deparmen
More informationWhy Did the Demand for Cash Decrease Recently in Korea?
Why Did he Demand for Cash Decrease Recenly in Korea? Byoung Hark Yoo Bank of Korea 26. 5 Absrac We explores why cash demand have decreased recenly in Korea. The raio of cash o consumpion fell o 4.7% in
More informationAll pay auctions with certain and uncertain prizes a comment
CENTER FOR RESEARC IN ECONOMICS AND MANAGEMENT CREAM Publiction No. 1-2015 All py uctions with certin nd uncertin prizes comment Christin Riis All py uctions with certin nd uncertin prizes comment Christin
More informationµ r of the ferrite amounts to 1000...4000. It should be noted that the magnetic length of the + δ
Page 9 Design of Inducors and High Frequency Transformers Inducors sore energy, ransformers ransfer energy. This is he prime difference. The magneic cores are significanly differen for inducors and high
More informationSmall Business Networking
Why network is n essentil productivity tool for ny smll business Effective technology is essentil for smll businesses looking to increse the productivity of their people nd processes. Introducing technology
More informationNASDAQ-100 Futures Index SM Methodology
NASDAQ-100 Fuures Index SM Mehodology Index Descripion The NASDAQ-100 Fuures Index (The Fuures Index ) is designed o rack he performance of a hypoheical porfolio holding he CME NASDAQ-100 E-mini Index
More informationDirec Manipulaion Inerface and EGN algorithms
A Direc Manipulaion Inerface for 3D Compuer Animaion Sco Sona Snibbe y Brown Universiy Deparmen of Compuer Science Providence, RI 02912, USA Absrac We presen a new se of inerface echniques for visualizing
More informationMap Task Scheduling in MapReduce with Data Locality: Throughput and Heavy-Traffic Optimality
Map Task Scheduling in MapReduce wih Daa Localiy: Throughpu and Heavy-Traffic Opimaliy Weina Wang, Kai Zhu and Lei Ying Elecrical, Compuer and Energy Engineering Arizona Sae Universiy Tempe, Arizona 85287
More informationAnswer, Key Homework 2 David McIntyre 45123 Mar 25, 2004 1
Answer, Key Homework 2 Daid McInyre 4123 Mar 2, 2004 1 This prin-ou should hae 1 quesions. Muliple-choice quesions may coninue on he ne column or page find all choices before making your selecion. The
More informationRobust Network Coding Using Diversity through Backup Flows
Robus Nework Coding Using Diversi hrough ackup Flows Hossein ahramgiri Farshad Lahoui Wireless Mulimedia Communicaions Laboraor School of ECE, College of Engineering Universi of ehran hbahramgiri@eceuacir,
More informationDistributed and Secure Computation of Convex Programs over a Network of Connected Processors
DCDIS CONFERENCE GUELPH, ONTARIO, CANADA, JULY 2005 1 Disribued and Secure Compuaion of Convex Programs over a Newor of Conneced Processors Michael J. Neely Universiy of Souhern California hp://www-rcf.usc.edu/
More informationFactoring Polynomials
Fctoring Polynomils Some definitions (not necessrily ll for secondry school mthemtics): A polynomil is the sum of one or more terms, in which ech term consists of product of constnt nd one or more vribles
More informationFull-wave rectification, bulk capacitor calculations Chris Basso January 2009
ull-wave recificaion, bulk capacior calculaions Chris Basso January 9 This shor paper shows how o calculae he bulk capacior value based on ripple specificaions and evaluae he rms curren ha crosses i. oal
More informationPrincipal components of stock market dynamics. Methodology and applications in brief (to be updated ) Andrei Bouzaev, bouzaev@ya.
Principal componens of sock marke dynamics Mehodology and applicaions in brief o be updaed Andrei Bouzaev, bouzaev@ya.ru Why principal componens are needed Objecives undersand he evidence of more han one
More informationAn Online Learning-based Framework for Tracking
An Online Learning-based Framework for Tracking Kamalika Chaudhuri Compuer Science and Engineering Universiy of California, San Diego La Jolla, CA 9293 Yoav Freund Compuer Science and Engineering Universiy
More informationHow To Set Up A Network For Your Business
Why Network is n Essentil Productivity Tool for Any Smll Business TechAdvisory.org SME Reports sponsored by Effective technology is essentil for smll businesses looking to increse their productivity. Computer
More information