ANALYTICAL CHARACTERIZATION OF WLANS FOR QUALITY-OF-SERVICE WITH ACTIVE QUEUE MANAGEMENT

Save this PDF as:
 WORD  PNG  TXT  JPG

Size: px
Start display at page:

Download "ANALYTICAL CHARACTERIZATION OF WLANS FOR QUALITY-OF-SERVICE WITH ACTIVE QUEUE MANAGEMENT"

Transcription

1 M USHA AND K MADHANA: ANALYTICAL CHARACTERIZATION OF WLANS FOR QUALITY-OF-SERVICE WITH ACTIVE QUEUE MANAGEMENT ANALYTICAL CHARACTERIZATION OF WLANS FOR QUALITY-OF-SERVICE WITH ACTIVE QUEUE MANAGEMENT M. Usa 1 and K. Madana 2 1 SonaNET Network Computng Researc Center, Sona Coege of Tecnoogy, Inda E-ma: 2 Department of Computer Scence, Sona Coege of Tecnoogy, Inda E-ma: Abstract Desgn of an Actve Queue Management sceme at te Access Pont to address te probem of congeston contro, packet deay varaton and packet oss rate s dscussed. Te proposed mecansm cacuates and adjusts redundancy rate adaptvey at te access pont by consderng bot network traffc oad and wreess canne condton. Rea-tme appcatons suc as Mobe earnng and smart earnng need te speca treatment and requre dfferentated QoS to satsfy te cent wo s ready to pay more tan oters. Mantanng te jtter vaue of te mutmeda packets beow te tresod s essenta to guarantee te desrabe quaty of te vdeo at te recever. Te work ntay concentrates on mnmzng te packet oss of suc prorty fows and tey ave to be gven pace n te queue even at te tme of buffer overfow. Tus te proposed work uses pus-out pocy to provde dfferentated servces to te mutmeda fow wc aceves consderabe mprovement n te vdeo quaty at te recever. Te consderabe decrease n packet oss rate and speca treatment n te queue of te access pont owers te packet deay varaton of te mutmeda fow. Te resuts sow tat te AQM used at te access pont effectvey aceves ow packet oss, ow jtter usng dfferentated FEC rate cacuaton wtout generatng congeston n te wreess network. Keywords: Actve Queue Management, Wreess Access Pont, Quaty of Servce, Pus-Out Pocy 1. INTRODUCTION As Tecnoogy s attanng vast growt, numbers of users prefer to connect to te Internet troug wreess devces. A varety of mutmeda servces ke vdeo conferencng, Ondemand earnng, mobe earnng are n g demand and tus face dverse caenges suc as attenuaton, fadng, nterference from actve sources durng transmsson n wreess network envronments. Suc caenges ead to packet osses wc are recovered by two tecnques: Automatc Repeat Request (ARQ) and Forward Error Correcton (FEC). ARQ recovers packets by retransmttng te ost packets durng tmeouts or respondng to te expct requests from te recever wereas FEC [9], [10] acts n advance by sendng redundant packets aong wt orgna packets to recover successfuy at te recever n case of packet osses. Out of te two approaces, FEC guarantees te ow retransmsson deay and varaton n deay (aso known as jtter ) and tus sutabe for rea-tme data transmsson. Mutmeda data fnds te way dffcut to transmt troug wreess network because of ow bandwdt, packet osses and deay. Wt te rapd ncrease of data transmsson ncudng data, voce, vdeo and mobty supported by a common IP patform, quaty-of-servce provsonng as grabbed prmary focus from te probem of congeston contro. Snce varous types of traffc are carred troug te Internet, mutmeda fow requres dfferentated servces from oter network servces. Te Actve Queue Management (AQM) mecansms are epfu for provdng dfferentated servces to reduce deay varaton or jtter, packet oss and bandwdt dependng on mutuay agreed upon servce eve agreements (SLA). Rea-tme appcatons requre QoS guarantees suc as g trougput, bandwdt [1]- [3], ow deay and jtter to transmt te audo or vdeo wt better quaty. A guarantee, n te sense, fxes a maxmum tresod above wc degradaton n quaty must not ncrease. In te mutmeda transmsson used n appcatons suc as Learnng-on-Demand, packet deay varaton s not acceptabe. Jtter s defned as an end-to-end deay between te seected packets n a partcuar fow. Te nter-packet arrva tme pays an mportant roe n provdng QoS for rea-tme appcatons. Te dfferentated servces are needed to reduce packet deay and varaton to mprove mutmeda quaty. Congeston contro s agan a bg caenge n wreess networks. Congeston affects te QoS caracterstcs and so t soud be effectvey managed by te queue management mecansms. Ta drop s one suc mecansm to contro congeston [4]. It drops te packets at te ta of te queue durng buffer overfow. It s not sutabe for rea-tme data transmsson. AQM [5]-[7] s proposed to contro end-to-end congeston by adaptng Random Eary Detecton (RED) [8] wc drops te packets earer to avod congeston to emnate buffer overfow. Tus t aceves g system utzaton and ow packet deay and suts for rea-tme appcatons. Te fundamenta contrbutons of ts work are: Reducng packet oss rate by usng FEC mecansm. Controng congeston usng AQM mecansm. Reducng packet deay and jtter to aceve mutmeda quaty. Te mecansm caed prorty-based FEC (PFEC) s proposed to attan above acevements. To dffer from te prevous study [35], we ncude Jtter anayss at te Access Pont (AP) eve for rea-tme data transmsson. 2. RELATED WORK Tere are many researces wc ave been done on AQM mecansms and FEC cacuaton to provde QoS. Many sender based FEC cacuatons takes fnte duraton and degrades te receved data performance. Many tradtona AQM mecansms adapt RED wc randomy drops packets wen te buffer overfows and not sutabe for rea tme mutmeda appcatons. 970

2 ISSN: (ONLINE) ICTACT JOURNAL ON COMMUNICATION TECHNOLOGY, SEPTEMBER 2014, VOLUME: 05, ISSUE: AQM MECHANISM Foyd proposed RED agortm [8] wc s a smpe mecansm and contros congeston by accompanyng te transport ayer congeston contro protoco. Te RED gateways can detect congeston pror by contnuousy montorng te average queue sze. RED works n contrast to oter tradtona queue mecansms. RED drops te packets wt a probabty accordng to te queue sze. Wen te average queue sze grows, te droppng probabty aso ncreases and reaces 1 wen te buffer s fu. Te dsadvantage of RED agortm s tat t does not provde dfferentated QOS [15]. Snce a snge set of RED parameters are not avaabe t does not react we to dfferent congeston scenaros [19]. Te ntegraton of te RED mecansm wt te prorty scedung paves souton for congeston contro and servce dfferentaton n [12]-[14]. Te sceme uses parttoned buffer wt correspondng tresods. If te sze of a partcuar cass s fed ten te packets wt ger prorty tan tat of te fed cass w enter nto te queue and tose wt ower prorty w be dropped. But ts sceme uses Sort-Range-Dependent (SRD) arrva processes and so SRD cannot capture mutmeda traffc nature [15]. To remove ts compexty an anaytca mode [15] s ntroduced, wc aceves servce dfferentaton for dfferent types of traffc fowng troug te traffc. Te buffer [X 0 - X k ] s vrtuay dvded nto many parttons suc as [X 0 -X 1,,X - X +1,,X k-1 -X k ] as n buffer partton [16]. Te packets of eac fow occupy te correspondng partton. If any partcuar partton gets fed ten te packets of correspondng fow w be dropped and ony te packets of ger prorty fow w be aowed. Te ssue presented ere s tat te sceme foows norma FIFO tecnque for vrtua buffers wc drops te ncomng ger prorty fows wen te capacty of te respectve partton overfows. Te buffer partton sceme [16] s ntroduced to manage mut-cass buffer and admsson contro for te buffer. It extends te bandwdt concept to utze te bandwdt effcenty by te Markovan traffc. Te tresods of te parttoned buffer are adaptvey canged to toerate te oss probabtes of te ncomng traffc and to manage te nput traffc oad nto te network. An agortm caed Loss Rato-based RED (LRED) [6] s deveoped to contro congeston, aceve nk utzaton and ow deay. It mantans stabty of te network by adaptve adjustment of te network parameters. It montors te average packet oss rato to adjust te droppng probabty of te packet adaptvey to mantan te queue engt stabe. It aceves fast response tme and good robustness. 2.2 PUSH-OUT POLICIES Tere ave been many pus-out poces deveoped to utze te buffer effcenty and to mantan a constant rato of packet oss rate among dfferent traffc fows. Te concept of mantanng mutpe casses for dfferent fows eads to g computng compexty n mut-cass pusout pocy. To overcome ts probem, Parta Buffer Sarng [16] as been desgned. Yet tey drop te ncomng ger prorty packets wen te buffer overfows toug tere are ower prorty packets avaabe n te buffer. An effcent buffer sarng sceme [17] n ATM swtces s aso dscussed to emnate te same above probem. It repaces te ess mportant packets n te queue by te ncomng g prorty packets wen te average queue sze exceeds te maxmum tresod. Ts sceme attracts te researcers for ts smpe mpementaton and g performance. Te droppng of ger prorty packets s emnated by te pus-out pocy [18] wt AQM wc s deveoped n IP routers. It works by ettng te ger prorty packets to enter te queue by dscardng ower prorty packets aready present n te queue even wen te buffer overfows. It reduces packet oss rate compared to RED. Anoter mecansm caed Fow-based Prorty Queung (FPQ) [32] s ntroduced to gve preference to rea-tme UDP fows at ntermedate routers. Tus t reduces packet oss rate, deay and jtter and at te same tme t mantans farness among a te ncomng traffc fows. 2.3 FEC MECHANISM Many FEC mecansms provde dynamc QOS contro of rea-tme mutmeda appcatons. Sender-based mecansms [19], [20] cacuate te redundancy rate at te sender wc takes fnte duraton because of recevng oss reports from te recever. Aso t does not ensure tat te sender predcts te current network condton. It causes varaton n te deay between recevng packets at te recever wc greaty affects te mutmeda quaty. Durng congeston t ncreases te rate of redundant packets wc may furter ncrease te congeston and degrade te network performance. Access-pont based approaces ave been proposed to emnate te duraton needed by te sender for redundancy rate cacuaton. Te RED-FEC mecansm [21] does t and contros congeston by decreasng redundancy rate as queue sze ncreases. It works by ncreasng redundant rate as te queue sze decreases and decreasng te rate wen te average queue sze exceeds te maxmum tresod. Te mtaton ere s tat t does not consder te packet oss rate. Te cross-ayer based FEC mecansm Adaptve Cross Layer FEC Mecansm [22] as been ntroduced to ncude te packet oss rate for redundancy rate cacuaton wc s retreved from te ARQ functon of te MAC ayer. In ts mecansm, te redundant rate canges n proporton to te packet oss percentage. It ncreases te redundant rate wen numbers of packets are ost and decreases wen packet oss s decreasng. But t does not consder network traffc oad for rate cacuaton. ERED-FEC mecansm [23] as been deveoped to cacuate te redundancy rate dependng on bot factors suc as wreess canne condton and network traffc oad to emnate te probem of congeston due to excessve number of ntroductons of redundant packets wc s found n te above two Access Pont based approaces. Te mtaton found ere s tat t cannot provde dfferentated QoS wc s essenta for mutmeda traffc to aceve better QoS. 2.4 JITTER REDUCTION APPROACHES A Jtter Detecton metod [24] as been proposed for gateway-based congeston contro to transmt mutmeda n packet swtced networks. It ntroduces an AQM mecansm to 971

3 M USHA AND K MADHANA: ANALYTICAL CHARACTERIZATION OF WLANS FOR QUALITY-OF-SERVICE WITH ACTIVE QUEUE MANAGEMENT mprove QoS for mutmeda transmsson by jtter detecton. It reduces jtter by detectng and dscardng mutmeda packets wc accumuated more jtter to mantan g bandwdt for oter good mutmeda packets. Te packets wc accumuated jtter more tan te jtter toerance eve become useess for cents to recover tem and tey degrades te QoS of te entre mutmeda fow. Tus ts metod emnates quaty degradng and contros congeston by droppng unwanted packets. Te jtter reducton not ony provdes g bandwdt but aso aceves g trougput for mutmeda fow. It s more essenta to evauate te quaty of mutmeda usng appcaton-eve evauaton metrc ke Decodabe Frame Rate (DFR) tan network-eve metrc suc as packet deay, packet oss rate. Te DFR evauaton [25] s used to anayze te effects of ossy wreess networks. A comparson of dstrbuton packet oss and burst packet oss n wreess networks s done. Te effect of te sze of te pay-out buffer and te sze of te transmsson are dscussed because tey affect te jtter quaty of te receved vdeo. Te packets wc arrve at te recever ater tan te needed tme are dropped from te pay-out buffer wc affects te vdeo quaty. It s now evdent tat PFEC mecansm resuts n controng congeston and reducng jtter for mutmeda transmsson. Tus t mantans farness among a te ncomng fows and gves servce dfferentaton to te preferred fow of mutmeda by dfferentated FEC redundancy rate cacuaton. 3. PROPOSED WORK Te current work focuses on an AQM sceme at te AP to mprove Quaty-of-Servce of te mutmeda data aong wt FEC redundancy rate cacuaton by prortzng te ncomng traffc. Intay te mode of te system s expaned and ten a quatatve study s performed n ts secton. 3.1 SYSTEM MODEL Te topoogy assumed ere s ustrated n Fg.1. Te system cassfes te ncomng packets as TCP avng varabe bt rate and UDP avng constant sendng rate. Wen te sender s ready to send te vdeo fe tey are encapsuated as vdeo packets at te appcaton ayer. Te dentfcaton of mutmeda stream s based on encodng n te protoco fed of te IPv4 eader at te network ayer. Te prorty of te partcuar fow s set by te sender n te Dfferentated Servce Code Pont (DSCP) fed of te IPv4 eader. In te MAC ayer, te ARQ functon s responsbe to contro congeston by adjustng te transmsson rate of te sender after recevng te response from te network. At te access pont, severa functons w be performed as sown n Fg.2. FEC encodng s performed on te ncomng packets we sendng tem out of te access pont. Te prorty of ncomng fow s cecked n te DSCP fed of te IP eader. Te packet oss montor contnuousy montors te wreess canne condton and cacuates te packet oss of eac fow. Snce te evauaton metrc caed Decodabe Frame Rate (DFR) s essenta for appcaton eve users, te quaty of te vdeo s measured usng DFR wc w be expaned ater. Te network traffc montor anayses te network to fnd te oad tat s carred by te network at te gven pont of tme. It s needed to adjust te redundancy rate expaned as foows. Te FEC redundancy rate cacuaton ncudes two pases for eac prorty fows. It frst montors te queue engt and compares t wt tresod vaues. If te queue engt s ess tan te mnmum tresod ten maxmum number of redundant packets w be generated. If te queue engt s more tan te maxmum tresod ten no redundant packets w be generated. Oterwse FEC packets are generated based on te data sze fracton n te queue. It ten adaptvey adjusts te FEC rate accordng to packet retransmsson tme. If te packets of te partcuar fow need maxmum number of retransmsson ten t w sow tat te fow s experencng g oss or error. So te rate ncreases to overcome te oss. Sender Internet Access Pont Recever k k k Fg.1. System Mode FEC Cacuaton Pusout Pocy Network Traffc Load Montor Decodabe Frame Rate Packet Loss Montor Prorty Ceckng Packet Bock Fg.2. Functons of te Access Pont On te oter and, f te packets need zero or mnmum number of retransmsson ten te AP w reaze tat te network condton s good. So tere s no need to send te redundant packets and tus te rate decreases accordngy. 1) If te ncomng packet s of g prorty, packet retransmsson tme s ow snce te queue gves more preference to tem by te preempton of ow prorty packets present n te queue durng te buffer overfow; no or mnmum number of FEC redundant packets ave to be encoded. 972

4 ISSN: (ONLINE) ICTACT JOURNAL ON COMMUNICATION TECHNOLOGY, SEPTEMBER 2014, VOLUME: 05, ISSUE: 03 2) If te ncomng packet s of ow prorty, packet retransmsson tme s g due to te g oss rate of tem wen compared to g prorty packets; FEC redundancy rate s g to baance te oss rate. Ts provdes farness to ow prorty fows. Te Access Pont adjusts te redundancy rate for ncomng traffc to provde dfferentated servce, based on wreess canne condton and network traffc oad to avod packet oss and contro congeston, and to reduce te jtter. 3.2 QUALITATIVE ANALYSIS Consder te sender transmts te vdeo fe wt k packets per transmsson bock. Te tota number of vdeo packets to be sent s N pkt. Accordng to EAFEC, t s proposed tat te effectve packet oss rate s gven by, k 1 k t 1 P P k t C T T 0 max max PFEC Pbock (1) k were, T max defnes te maxmum retransmsson tme, P bock defnes te probabty of a bock tat as not been recovered at te recever. P k 1 P P k k FEC C k Tmax Tmax 1 (2) P Tmax defnes te probabty of a packet tat as not been receved correcty. P T max T max 1 P P (3) correct were, P pkt ndcates te probabty of a packet s faure wen t s transmtted just one tme, P correct ndcates te probabty k of a packet wc s receved correcty and C ndcates a possbe combnatons of packets receved n a bock successfuy. E R Te Pusout Pocy [18] proposed tat pkt C M t C N t E C M t C Nt t 0 1 R 0 1 t were, C = cost of a ost ger prorty packet, C = cost of a ost ower prorty packet, M(t) and N(t) are number of ger and ower prorty packets tose are dropped and E(.) denotes expectaton of cost of dropped packet. R denotes te pocy n wc te buffer s consdered as vrtuay parttoned as two portons Q 1 and Q 2. Te ncomng packets w be dropped wen te woe buffer overfows. If Q 1 s not fed ten a te packets w be aowed to enter te queue. If Q 1 s fed and Q 2 s not fed te ncomng packets w be dropped wt some droppng probabty. R 1 s te subset of R and denotes pus-out pocy. If Q 1 s not fed ten a te fows w enter te queue. If Q 1 overfows and Q 2 s not fed ten ger prorty fows w append at te ta of te queue and ower prorty fows w be dropped wt some droppng probabty. If te woe buffer overfows ten te 1 (4) ncomng ger prorty packets w repace te aready occuped ower prorty packets n te queue. Te prevous study proves tat P bock P bock k 1 k 1 C X 0 k 1 k 2 C X 0 P (5) FEC P FEC 1 X 1 PT max k 1 1 X P T max k 2 PT max P T max k 1 t X k 2 t X were, P FEC and P FEC ndcate te effectve packet oss rate of ger prorty and ower prorty fows respectvey. P T max and T (6) P max denote te maxmum retransmsson rate of g and ow prorty fows respectvey. Snce preempton tecnque foowed by te queue gves more preference to ger prorty fows, tey face mnmum oss. So te retransmsson rate of suc packets s becomng ow and te number of redundant packets to be appended s ess. In contrast, snce ower prorty fows face g oss wen compared to ger prorty fows, retransmsson rate and te number of redundant packets generated for suc fows s g. Ts makes te woe eft and sde term to be esser tan rgt and sde term n Eq.(6) Standard Devaton Cacuaton: To cacuate te standard devaton, te varaton n packet deay soud be known. Deay varaton or jtter s defned as devaton from te dea tmng of an event. In oter words, jtter of a packet denotes te dfference between recevng tme and sendng tme of te packet. Te Eqs.(7-9) present tese. Send_Tme_Dff = send_tme[] - send_tme [-1] (7) Recv_tme_Dff = recv_tme[] - recv_tme [-1] (8) j = Recv_Tme_Dff[] Send_Tme_Dff[] (9) were, j ndcates te jtter for eac transmtted packet. Te term recevng tme of a packet at te recever depends on te factors ke propagaton deay, queung deay, retransmsson tme f t as been ost. Te terms suc as queung deay and retransmsson tme grabbed te major concentraton n ts work. Standard devaton s cacuated as foows: 1 N pkt 2 j 1 (10) N pkt were, µ ndcates mean of jtter vaues n Eq.(10) Decodabe Frame Rate: Te vdeo fe s transmtted troug te network as segment of sma packets. A frame s sad to be decodabe frame f and ony f at east enoug number of packets n te frame reaced te recever so tat te woe frame can be recovered at te recever successfuy even f one or more packets n te frame ave been ost. Te MPEG terature [28] defnes a standard n wc tere are tree frame types I, P, B frames n te compressve vdeo streams. Te I frames are encoded ndependenty. Te P frames 973

5 Effectve Packet Loss Rate M USHA AND K MADHANA: ANALYTICAL CHARACTERIZATION OF WLANS FOR QUALITY-OF-SERVICE WITH ACTIVE QUEUE MANAGEMENT are encoded dependng on precedng I or P frames n te vdeo sequence. Te B frames are encoded dependng on te proceedng and succeedng I or P frames n te vdeo sequence. It s customary to cacuate te appcaton eve metrc, DFR, denoted as (Q), as sown n Eq.(11). Ndec Q Ntota Ntota N (11) tota were, N dec = Tota number of decodabe frames n te fow, N tota = Tota number of I frames, N tota P = Tota number of P frames and N tota B = Tota number of B frames. Te vaue of Q ranges between 0 and 1.0. If Q s 1 ten te frame w be competey sensbe tat oss of even one packet w make te frame undecodabe. If Q s 0.6 ten te frame w be consdered as decodabe and at most of 50% packets n te frame can be ost. Te cacuaton of DFR mpes tat te mecansm s aert about te oss of te most mportant frames n te frame. Toug te oss probabty of a packets n a partcuar fow s same, te oss of most mportant frame eads te oter dependent frame on t as undecodabe one. Hence te oss probabty of I frames s gy senstve. 4. RESULTS AND DISCUSSIONS Te proposed system s vadated wt te performance evauaton. Te vdeo fe s transmtted as many bocks eac of wc contans k (assume k = 8) vdeo packets. It s assumed to be transmtted usng uncast transmsson. Te maxmum retransmsson tme needed for eac ost packet s assumed as T max = 4. Consder n traffc fows be enterng te wreess network troug te Access Pont among wc m fows are Vdeo-on-Demand traffc. Te m mutmeda traffc are usng UDP as a transport protoco and remanng n-m traffc are consdered as TCP fows Effectve packet oss rate comparson P B ow_prorty_fow g_prorty_fow Te maxmum number of redundant packets to be generated for eac bock of 8 packets s 8. Te redundant rates for ower prorty fow s assumed ntutvey as 2 = 0,1,2,3,4,5,6 and tat for g prorty fow as 1 = 2,3,4,5,6,7,8. Hence, wen te packet oss s ow te number of redundant packets generated for te ow prorty fow s 6 and tat for QoS requred fow s 8. No redundant packets woud be generated for ow prorty packets and mnmum number of redundant packets (say 2) woud be generated for g prorty packets even at te tme of g packet oss. From te quatatve anayss of te prevous study [35], a grap s sown to compare te effectve packet oss rate of norma TCP fow and user demanded mutmeda fow n Fg.3. Te grap sows tat te effectve packet oss rate of mutmeda fow s consderaby ess tat of norma ower prorty fow. 4.1 JITTER COMPARISON WITH AP-BASED FEC APPROACHES From te extenson of te prevous study [35], anayss s done addtonay on te evauaton metrc.e., jtter. Te performance comparson of jtter vaues obtaned for te mutmeda fow usng ts mecansm are compared wt tat of EAFEC, one of te Access Pont based FEC mecansms. As we ave anayzed n te secton 3.2, te queue at te access pont provdes speca treatment to ger prorty fow. As a resut, te retransmsson tme for suc fow s ess because tey face ess packet oss n te wreess network. Aso te ower prorty packets are gettng repaced by te ger prorty one durng te buffer overfow. So te g prorty fows do not suffer from g deay we watng n te queue.e., queung deay and beng processed n te queue. On te woe te preferred packets reac te recever qucky wen compared to oter fows. Ts, n turn, owers te jtter j for te preferred mutmeda fow. On anayzng Eq.(10), te terms j and µ become substantay ess for te cent preferred fow wc consderaby mnmzes te standard devaton (σ) of te fow. Tus te PFEC mecansm aceves ower packet deay varaton for te mutmeda fow as sown n Fg.4. Te grap compares te jtter vaues n some frames of a transmtted vdeo usng EAFEC wt PFEC mecansm. It proves tat te jtter vaues n proposed approac are mantanng ess vaue trougout te transmsson of te vdeo fe wen compared to tat n te exstng approac. 5. CONCLUSION Packet Loss Rate Fg.3. Comparson of effectve packet oss rate of ger and ower prorty fows Adaptve FEC mecansm PFEC s proposed to mprove te QoS of te mutmeda traffc wt congeston contro. Te quatatve anayss for te metrcs packet oss rate and jtter are presented. Te resuts sow ow jtter and ow packet oss due to effectve management of congeston usng adaptve FEC wt effectve AQM. Te redundant rate cacuaton dependng on te prorty of te fows enabes te mecansm to provde servce dfferentaton to te mutmeda packets. Incuson of adaptve bandwdt adjustment based on wreess canne condton w be consdered as a future work. 974

6 Jtter ISSN: (ONLINE) ICTACT JOURNAL ON COMMUNICATION TECHNOLOGY, SEPTEMBER 2014, VOLUME: 05, ISSUE: Jtter Comparson EAFEC PFEC Frame Number Fg.4. Comparson of Jtter n Proposed Approac PFEC wt Exstng Approac EAFEC REFERENCES [1] Lu Png, S. C. Evans and Weerakoon Isan, Mutmeda QoS troug Content Aware Trage: An Integrated DffServ Framework, IEEE Mtary Communcatons Conference, pp. 1-6, [2] T. J. F. Omnes, T. Franzett and F. Cattoor, Interactve co-desgn of g trougput embedded mutmeda, Proceedngs of te IEEE Desgn Automaton Conference, pp , [3] C. Overa, Jame Bae Km and T. Suda, An adaptve bandwdt reservaton sceme for g-speed mutmeda wreess networks, IEEE Journa on Seected Areas n Communcatons, Vo. 16, No. 6, pp , [4] Su Gang Lu, Smuaton and evauaton of random eary detecton n congeston contro, Proceedngs of te Internatona Conference on Macne Learnng and Cybernetcs, Vo. 4, pp , [5] K. Cavan, R. G. Kumar, M. N. Beur and A. Karandkar, Robust actve queue management for wreess networks, IEEE Transactons on Contro System Tecnoogy, Vo. 19, No. 6, pp , [6] C. Wang, J. Lu, B. L, K. Soraby and Y. T. Hou, LRED: a robust and responsve AQM agortm usng packet oss rato measurement, IEEE Transactons on Parae and Dstrbuted Systems, Vo. 18, No. 1, pp , [7] Geyong Mn and Xaoong Jn, Performance Modeng of Random Eary Detecton Based Congeston Contro for Mut-Cass Sef-Smar Network Traffc, IEEE Internatona Conference on Communcatons, pp , [8] S. Foyd and V. Jacobson, Random Eary Detecton Gateways for Congeston Avodance, IEEE/ACM Transactons on Networkng, Vo. 1, No. 4, pp , [9] J. Dan, F. Pasca and J. Aeksandar, Forward error correcton for mutpat meda streamng, IEEE/ACM Transactons on Crcuts and Systems for Vdeo Tecnoogy, Vo. 19, No. 9, pp , [10] E. Maan and A. K. Katsaggeos, Unequa error protecton for robust streamng of scaabe vdeo over packet ossy networks, IEEE Transactons on Crcuts and Systems for Vdeo Tecnoogy, Vo. 20, No. 3, pp , [11] A. Nafaa, T. Amed and A. Meaoua, Unequa and ntereaved FEC protoco for robust MPEG-4 mutcastng over wreess LANs, Proceedngs of te IEEE Conference on Communcatons, Vo. 3, pp , [12] Y. Ceng and W. Zuang, Effectve bandwdt of mutcass Markovan traffc sources and admsson contro wt dynamc buffer parttonng, IEEE Transactons on Communcatons, Vo. 51, No. 9, pp , [13] A. Ioannou and M. G. H. Katevens, Ppened eap (prorty queue) management for advanced scedung n g-speed networks, IEEE/ACM Transactons on Networkng, Vo. 15, No. 2, pp , [14] Y. L and S.-H. Yang, PC-RED for IPv6: agortm and performance, Proceedngs of te IEEE Internatona Conference on Communcatons, pp , [15] Geyong Mn and Xaoong Jn, Anaytca Modeng and Optmzaton of Congeston contro for prortzed Mut- Cass Sef-Smar traffc, IEEE Transactons on Communcatons, Vo. 61, No. 1, pp , [16] Cuang Ln and Yn L, Dynamc Parta Buffer Sarng sceme: Proportona Packet Loss Rate, Proceedngs of te Internatona Conference on Communcaton Tecnoogy, Vo. 1, pp , [17] D. W. Petr and V. S. Frost, Nested tresod ce dscardng for ATM overoad contro: Optmzaton under ce oss constrants, Proceedngs of te Tent Annua Jont Conference of te IEEE/ACM Computer and Communcatons Socetes, Vo. 3, pp , [18] M. Usa and R. S. D. Wada Banu, Pus-out Pocy n Actve Queue Management to support quaty of servce guarantes n IP Routers, Tent IEEE Internatona Conference on Communcaton Systems, pp. 1-5, [19] K. Takaata, N. Ucda and Y. Sbata, Packet error and frame rate contros for rea tme vdeo stream over 975

7 M USHA AND K MADHANA: ANALYTICAL CHARACTERIZATION OF WLANS FOR QUALITY-OF-SERVICE WITH ACTIVE QUEUE MANAGEMENT wreess LANs, Proceedngs of te 23 rd Internatona Conference on Dstrbuted Computng Systems Worksops, pp , [20] I. V. Bajc, Effcent cross-ayer error contro for wreess vdeo mutcast, IEEE Transactons on Broadcastng, Vo. 53, No. 1, pp , [21] C. H. Ln, C. K. Se, N. K. Camkurt, C. H. Ke and W. S. Hwang, A RED-FEC mecansm for vdeo transmsson over WLANs, IEEE Transactons on Broadcastng, Vo. 54, No. 3, pp , [22] L. Han, S. Park, S. Kang and H. P. In, An adaptve crossayer FEC mecansm for vdeo transmsson over WLANs, Proceedngs of te Frst Internatona Conference on Internet, pp , [23] Ceng-Han Ln, Ce-Kuen Se and Wen-Syang Hwang, An Access pont-based FEC mecansm for vdeo transmsson over wreess LANs, IEEE Transactons on Mutmeda, Vo. 15 No. 1, pp , [24] Su-Png Can, C-Wa Kok and Abert K. Wong, Mutmeda Streamng Gateway Wt Jtter Detecton, IEEE Transactons on Mutmeda, Vo. 7, No. 3, pp , [25] Ceng-Han Ln, C-Heng Ke, Ce-Kuen Se and Naveen K Camkurt, Te Packet Loss Effect on MPEG Vdeo Transmsson n Wreess Networks, Proceedngs of te 20 t Internatona Conference on Advanced Informaton Networkng and Appcatons, Vo. 1, pp , [26] Jrka Kaue, EvaVd - A Vdeo Quaty Evauaton Tooset, Avaabe at: [27] NS-2 Mutmeda Communcaton too, Avaabe at: ttp:// /~smako/ns2/mutmedacomm_en. tm. [28] Joan L. Mtce, W. Pennebaker, Cad E. Fogg and Dder J. Lega, MPEG Vdeo: Compresson Standard, Capman and Ha, [29] C. H. Ln, C. H. Ke and C. K. Se, A study of MPEG Vdeo Transmsson n Lossy Wreess Network, Worksop on Wreess, Ad Hoc and Sensor Networks, pp , [30] X. Jn and G. Mn, Modeng and anayss of prorty queueng systems wt mut-cass sef-smar network traffc: a nove and effcent queue decomposton approac, IEEE Transactons on Communcaton, Vo. 57, No. 5, pp , [31] M. Usa and R. S. D. Wada Banu Towards a smpe servce cass for dstrbuted Mutmeda Appcatons n next generaton IP networks, Proceedngs of Internatona Conference on Parae and Dstrbuted Computng and Systems, pp , [32] M. Usa, Enanced Quaty of Servce troug Jtter Contro for Next Generaton Servce Computng, Proceedngs of Natona Conference on Advanced Computng, [33] Sanjeev Merotra, Jn L and Yng-Zong Huang, Optmzng FEC Transmsson Strategy for Mnmzng Deay n Lossess Sequenta Streamng, IEEE Transactons on Mutmeda, Vo. 13, No. 5, pp. 1-23, [34] ZHAO Mn-ceng, GONG Xang-yang, QUE X-rong, WANG Wen-dong and CHENG S-duan, Contextaware adaptve actve queue management mecansm for mprovng vdeo transmsson over IEEE E WLAN, Te Journa of Cna Unverstes of Posts and Teecommuncatons, Vo. 19, No. 2, pp , [35] M. Usa and K. Madana, Dfferentated QoS Framework for Vdeo Transmsson over Wreess LANs Usng Pus-out Pocy, IEEE Internatona Advance Computng Conference, pp ,

An Efficient Job Scheduling for MapReduce Clusters

An Efficient Job Scheduling for MapReduce Clusters Internatona Journa of Future Generaton ommuncaton and Networkng, pp. 391-398 http://dx.do.org/10.14257/jfgcn.2015.8.2.32 An Effcent Job Schedung for MapReduce usters Jun Lu 1, Tanshu Wu 1, and Mng We Ln

More information

Increasing Supported VoIP Flows in WMNs through Link-Based Aggregation

Increasing Supported VoIP Flows in WMNs through Link-Based Aggregation Increasng Supported VoIP Fows n WMNs through n-based Aggregaton J. Oech, Y. Hamam, A. Kuren F SATIE TUT Pretora, South Afrca oechr@gma.com T. Owa Meraa Insttute Counc of Scentfc and Industra Research (CSIR)

More information

Approximation Algorithms for Data Distribution with Load Balancing of Web Servers

Approximation Algorithms for Data Distribution with Load Balancing of Web Servers Approxmaton Agorthms for Data Dstrbuton wth Load Baancng of Web Servers L-Chuan Chen Networkng and Communcatons Department The MITRE Corporaton McLean, VA 22102 chen@mtreorg Hyeong-Ah Cho Department of

More information

QoS-Aware Active Queue Management for Multimedia Services over the Internet

QoS-Aware Active Queue Management for Multimedia Services over the Internet QoS-Aware Actve Queue Management for Multmeda Servces over the Internet I-Shyan Hwang, *Bor-Junn Hwang, Pen-Mng Chang, Cheng-Yu Wang Abstract Recently, the multmeda servces such as IPTV, vdeo conference

More information

TCP/IP Interaction Based on Congestion Price: Stability and Optimality

TCP/IP Interaction Based on Congestion Price: Stability and Optimality TCP/IP Interacton Based on Congeston Prce: Stabty and Optmaty Jayue He Eectrca Engneerng Prnceton Unversty Ema: jhe@prncetonedu Mung Chang Eectrca Engneerng Prnceton Unversty Ema: changm@prncetonedu Jennfer

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

Dynamic Virtual Network Allocation for OpenFlow Based Cloud Resident Data Center

Dynamic Virtual Network Allocation for OpenFlow Based Cloud Resident Data Center 56 IEICE TRANS. COMMUN., VOL.E96 B, NO. JANUARY 203 PAPER Speca Secton on Networ Vrtuazaton, and Fuson Patform of Computng and Networng Dynamc Vrtua Networ Aocaton for OpenFow Based Coud Resdent Data Center

More information

Asymptotically Optimal Inventory Control for Assemble-to-Order Systems with Identical Lead Times

Asymptotically Optimal Inventory Control for Assemble-to-Order Systems with Identical Lead Times Asymptotcay Optma Inventory Contro for Assembe-to-Order Systems wth Identca ead Tmes Martn I. Reman Acate-ucent Be abs, Murray H, NJ 07974, marty@research.be-abs.com Qong Wang Industra and Enterprse Systems

More information

A Simple Congestion-Aware Algorithm for Load Balancing in Datacenter Networks

A Simple Congestion-Aware Algorithm for Load Balancing in Datacenter Networks A Smpe Congeston-Aware Agorthm for Load Baancng n Datacenter Networs Mehrnoosh Shafee, and Javad Ghader, Coumba Unversty Abstract We study the probem of oad baancng n datacenter networs, namey, assgnng

More information

Performance Analysis and Comparison of QoS Provisioning Mechanisms for CBR Traffic in Noisy IEEE 802.11e WLANs Environments

Performance Analysis and Comparison of QoS Provisioning Mechanisms for CBR Traffic in Noisy IEEE 802.11e WLANs Environments Tamkang Journal of Scence and Engneerng, Vol. 12, No. 2, pp. 143149 (2008) 143 Performance Analyss and Comparson of QoS Provsonng Mechansms for CBR Traffc n Nosy IEEE 802.11e WLANs Envronments Der-Junn

More information

SAT Math Must-Know Facts & Formulas

SAT Math Must-Know Facts & Formulas SAT Mat Must-Know Facts & Formuas Numbers, Sequences, Factors Integers:..., -3, -2, -1, 0, 1, 2, 3,... Rationas: fractions, tat is, anyting expressabe as a ratio of integers Reas: integers pus rationas

More information

SMOOTH TRAJECTORY PLANNING ALGORITHMS FOR INDUSTRIAL ROBOTS: AN EXPERIMENTAL EVALUATION

SMOOTH TRAJECTORY PLANNING ALGORITHMS FOR INDUSTRIAL ROBOTS: AN EXPERIMENTAL EVALUATION 1. Albano LANZUTTI SMOOTH TRAJECTORY PLANNING ALGORITHMS FOR INDUSTRIAL ROBOTS: AN EXPERIMENTAL EVALUATION 1. DIPARTIMENTO DI INGEGNERIA ELETTRICA, GESTIONALE E MECCANICA UNIVERSITA' DI UDINE, UDINE ITALY

More information

VoIP Playout Buffer Adjustment using Adaptive Estimation of Network Delays

VoIP Playout Buffer Adjustment using Adaptive Estimation of Network Delays VoIP Playout Buffer Adjustment usng Adaptve Estmaton of Network Delays Mroslaw Narbutt and Lam Murphy* Department of Computer Scence Unversty College Dubln, Belfeld, Dubln, IRELAND Abstract The poor qualty

More information

E-learning Vendor Management Checklist

E-learning Vendor Management Checklist E-learning Vendor Management Checklist June 2008 Permission is granted to print freely, unmodified, this document from www.doingelearning.com or to copy it in electronic form. If linked to from the net

More information

Authenticated AODV Routing Protocol Using One-Time Signature and Transitive Signature Schemes

Authenticated AODV Routing Protocol Using One-Time Signature and Transitive Signature Schemes JOURNAL OF NETWORKS, VOL. 1, NO. 1, MAY 2006 47 Autentcated AODV Routng Protocol Usng One-Tme Sgnature and Transtve Sgnature Scemes Sd Xu Unversty of Wollongong, Wollongong, Australa Emal: sdx86@uow.edu.au

More information

ivoip: an Intelligent Bandwidth Management Scheme for VoIP in WLANs

ivoip: an Intelligent Bandwidth Management Scheme for VoIP in WLANs VoIP: an Intellgent Bandwdth Management Scheme for VoIP n WLANs Zhenhu Yuan and Gabrel-Mro Muntean Abstract Voce over Internet Protocol (VoIP) has been wdely used by many moble consumer devces n IEEE 802.11

More information

Prediction of Success or Fail of Students on Different Educational Majors at the End of the High School with Artificial Neural Networks Methods

Prediction of Success or Fail of Students on Different Educational Majors at the End of the High School with Artificial Neural Networks Methods Predcton of Success or Fa of on Dfferent Educatona Maors at the End of the Hgh Schoo th Artfca Neura Netors Methods Sayyed Mad Maznan, Member, IACSIT, and Sayyede Azam Aboghasempur Abstract The man obectve

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

Off-line and on-line scheduling on heterogeneous master-slave platforms

Off-line and on-line scheduling on heterogeneous master-slave platforms Laboratore de Informatque du Paraésme Écoe Normae Supéreure de Lyon Unté Mxte de Recherche CNRS-INRIA-ENS LYON-UCBL n o 5668 Off-ne and on-ne schedung on heterogeneous master-save patforms Jean-Franços

More information

Predictive Control of a Smart Grid: A Distributed Optimization Algorithm with Centralized Performance Properties*

Predictive Control of a Smart Grid: A Distributed Optimization Algorithm with Centralized Performance Properties* Predctve Contro of a Smart Grd: A Dstrbuted Optmzaton Agorthm wth Centrazed Performance Propertes* Phpp Braun, Lars Grüne, Chrstopher M. Keett 2, Steven R. Weer 2, and Kar Worthmann 3 Abstract The authors

More information

Efficient Bandwidth Management in Broadband Wireless Access Systems Using CAC-based Dynamic Pricing

Efficient Bandwidth Management in Broadband Wireless Access Systems Using CAC-based Dynamic Pricing Effcent Bandwdth Management n Broadband Wreless Access Systems Usng CAC-based Dynamc Prcng Bader Al-Manthar, Ndal Nasser 2, Najah Abu Al 3, Hossam Hassanen Telecommuncatons Research Laboratory School of

More information

An Ensemble Classification Framework to Evolving Data Streams

An Ensemble Classification Framework to Evolving Data Streams Internatona Journa of Scence and Research (IJSR) ISSN (Onne): 39-7064 An Ensembe Cassfcaton Framework to Evovng Data Streams Naga Chthra Dev. R MCA, (M.Ph), Sr Jayendra Saraswathy Maha Vdyaaya, Coege of

More information

An Inter-Frame De-Jittering Scheme for Video Streaming over Mobile Communication Networks

An Inter-Frame De-Jittering Scheme for Video Streaming over Mobile Communication Networks An Inter-Frame De-Jtterng Scheme for Vdeo Streamng over Moble Communcaton Networks Tsang-Lng Sheu and Po-Wen Lee Department of Electrcal Engneerng Natonal Sun Yat-Sen Unversty Kaohsung, Tawan sheu@ee.nsysu.edu.tw

More information

On-Line Trajectory Generation: Nonconstant Motion Constraints

On-Line Trajectory Generation: Nonconstant Motion Constraints 2012 IEEE Internatona Conference on Robotcs and Automaton RverCentre, Sant Pau, Mnnesota, USA May 14-18, 2012 On-Lne Trajectory Generaton: Nonconstant Moton Constrants Torsten Kröger Abstract A concept

More information

A Design Method of High-availability and Low-optical-loss Optical Aggregation Network Architecture

A Design Method of High-availability and Low-optical-loss Optical Aggregation Network Architecture A Desgn Method of Hgh-avalablty and Low-optcal-loss Optcal Aggregaton Network Archtecture Takehro Sato, Kuntaka Ashzawa, Kazumasa Tokuhash, Dasuke Ish, Satoru Okamoto and Naoak Yamanaka Dept. of Informaton

More information

Communication Networks II Contents

Communication Networks II Contents 8 / 1 -- Communcaton Networs II (Görg) -- www.comnets.un-bremen.de Communcaton Networs II Contents 1 Fundamentals of probablty theory 2 Traffc n communcaton networs 3 Stochastc & Marovan Processes (SP

More information

The Dynamics of Wealth and Income Distribution in a Neoclassical Growth Model * Stephen J. Turnovsky. University of Washington, Seattle

The Dynamics of Wealth and Income Distribution in a Neoclassical Growth Model * Stephen J. Turnovsky. University of Washington, Seattle The Dynamcs of Weath and Income Dstrbuton n a Neocassca Growth Mode * Stephen J. Turnovsy Unversty of Washngton, Seatte Ceca García-Peñaosa CNRS and GREQAM March 26 Abstract: We examne the evouton of the

More information

Clustering based Two-Stage Text Classification Requiring Minimal Training Data

Clustering based Two-Stage Text Classification Requiring Minimal Training Data OI: 10.2298/CSIS120130044Z Custerng based Two-Stage Text Cassfcaton Requrng Mnma Tranng ata Xue Zhang 1,2 and Wangxn Xao 3,4 1 Key Laboratory of Hgh Confdence Software Technooges, Mnstry of Educaton, Pekng

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

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

A Dynamic Load Balancing for Massive Multiplayer Online Game Server

A Dynamic Load Balancing for Massive Multiplayer Online Game Server A Dynamc Load Balancng for Massve Multplayer Onlne Game Server Jungyoul Lm, Jaeyong Chung, Jnryong Km and Kwanghyun Shm Dgtal Content Research Dvson Electroncs and Telecommuncatons Research Insttute Daejeon,

More information

A FRAMEWORK FOR EFFICIENT BANDWIDTH MANAGEMENT IN BROADBAND WIRELESS ACCESS SYSTEMS

A FRAMEWORK FOR EFFICIENT BANDWIDTH MANAGEMENT IN BROADBAND WIRELESS ACCESS SYSTEMS A FRAMEWORK FOR EFFICIENT BANDWIDTH MANAGEMENT IN BROADBAND WIRELESS ACCESS SYSTEMS BY BADER S. AL-MANTHARI A thess submtted to the School of Computng n conformty wth the requrements for the degree of

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

LAMOR: Lifetime-Aware Multipath Optimized Routing Algorithm for Video Transmission over Ad Hoc Networks

LAMOR: Lifetime-Aware Multipath Optimized Routing Algorithm for Video Transmission over Ad Hoc Networks LAMOR: Lfetme-Aware Multpath Optmzed Routng Algorthm for Vdeo ransmsson over Ad Hoc Networks 1 Lansheng an, Lng Xe, Kng-m Ko, Mng Le and Moshe Zukerman Abstract Multpath routng s a key technque to support

More information

Service Provider SIP trunk Validation Detailed Test Plan

Service Provider SIP trunk Validation Detailed Test Plan E Document Number EDC-827327 Based on emplate EDC-206096 Rev 35 Create By Cecly Lu ervce Provder P trunk Valdaton Detaled Plan odfcatons Revson Name User d Date Comments 1 ony Banuelos tbanuelo 11/2/2009

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

Spam Detection in Voice-over-IP Calls through Semi-Supervised Clustering

Spam Detection in Voice-over-IP Calls through Semi-Supervised Clustering Spam Detecton n Voce-over-IP Calls troug Sem-Supervsed Clusterng Yu-Sung Wu, Saurab Bagc Navjot Sng Ratsameetp Wta 3 Scool of Electrcal & Computer Eng., Purdue Unversty, West Lafayette, IN 4797 vaya Labs,

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

Multi-Source Video Multicast in Peer-to-Peer Networks

Multi-Source Video Multicast in Peer-to-Peer Networks ult-source Vdeo ultcast n Peer-to-Peer Networks Francsco de Asís López-Fuentes*, Eckehard Stenbach Technsche Unverstät ünchen Insttute of Communcaton Networks, eda Technology Group 80333 ünchen, Germany

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

SIMPLIFYING NDA PROGRAMMING WITH PROt SQL

SIMPLIFYING NDA PROGRAMMING WITH PROt SQL SIMPLIFYING NDA PROGRAMMING WITH PROt SQL Aeen L. Yam, Besseaar Assocates, Prnceton, NJ ABSRACf The programmng of New Drug Appcaton (NDA) Integrated Summary of Safety (ISS) usuay nvoves obtanng patent

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

Market Segmentation and Information Development Costs in a Two-Tiered Information Web Site

Market Segmentation and Information Development Costs in a Two-Tiered Information Web Site Market Segmentation and Information Deveopment Costs in a Two-Tiered Information Web Site Frederick J. Riggins Carson Scoo of Management University of Minnesota, Minneapois, MN friggins@csom.umn.edu Pone:

More information

The Cox-Ross-Rubinstein Option Pricing Model

The Cox-Ross-Rubinstein Option Pricing Model Fnance 400 A. Penat - G. Pennacc Te Cox-Ross-Rubnsten Opton Prcng Model Te prevous notes sowed tat te absence o arbtrage restrcts te prce o an opton n terms o ts underlyng asset. However, te no-arbtrage

More information

A Resources Allocation Model for Multi-Project Management

A Resources Allocation Model for Multi-Project Management A Resources Aocaton Mode for Mut-Proect Management Hamdatou Kane, Aban Tsser To cte ths verson: Hamdatou Kane, Aban Tsser. A Resources Aocaton Mode for Mut-Proect Management. 9th Internatona Conference

More information

Adaptive Voice Smoother with Optimal Playback Delay for New Generation VoIP Services

Adaptive Voice Smoother with Optimal Playback Delay for New Generation VoIP Services Adaptve Voce Smoother wth Optmal Playack Delay for New Generaton VoIP Servces Shyh-Fang Huang 1, Erc Hsao-Kuang Wu 2, and Pao-Ch Chang 3 1 Department of Electrcal Engneerng, Natonal Central Unversty, Tawan,

More information

Cardiovascular Event Risk Assessment Fusion of Individual Risk Assessment Tools Applied to the Portuguese Population

Cardiovascular Event Risk Assessment Fusion of Individual Risk Assessment Tools Applied to the Portuguese Population Cardovascuar Event Rsk Assessment Fuson of Indvdua Rsk Assessment Toos Apped to the Portuguese Popuaton S. Paredes, T. Rocha, P. de Carvaho, J. Henrques, J. Moras*, J. Ferrera, M. Mendes Abstract Cardovascuar

More information

Branch-and-Price and Heuristic Column Generation for the Generalized Truck-and-Trailer Routing Problem

Branch-and-Price and Heuristic Column Generation for the Generalized Truck-and-Trailer Routing Problem REVISTA DE MÉTODOS CUANTITATIVOS PARA LA ECONOMÍA Y LA EMPRESA (12) Págnas 5 38 Dcembre de 2011 ISSN: 1886-516X DL: SE-2927-06 URL: http://wwwupoes/revmetcuant/artphp?d=51 Branch-and-Prce and Heurstc Coumn

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

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

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

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

Improving Perceived Speech Quality for Wireless. VoIP By Cross-Layer Designs

Improving Perceived Speech Quality for Wireless. VoIP By Cross-Layer Designs Improvng Perceved Speech Qualty for Wreless VoIP By Cross-Layer Desgns By Zhuoqun L Ths dssertaton s submtted to the Unversty of Plymouth n partal fulflment of the award of Master of Research n Network

More information

Delay-Throughput Enhancement in Wireless Networks with Multi-path Routing and Channel Coding

Delay-Throughput Enhancement in Wireless Networks with Multi-path Routing and Channel Coding Delay-Throughput Enhancement n Wreless Networs wth Mult-path Routng and Channel Codng Kevan Ronas, Student Member, IEEE, Amr-Hamed Mohsenan-Rad, Member, IEEE, Vncent W.S. Wong, Senor Member, IEEE, Sathsh

More information

Minimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures

Minimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures Mnmal Codng Network Wth Combnatoral Structure For Instantaneous Recovery From Edge Falures Ashly Joseph 1, Mr.M.Sadsh Sendl 2, Dr.S.Karthk 3 1 Fnal Year ME CSE Student Department of Computer Scence Engneerng

More information

Fault tolerance in cloud technologies presented as a service

Fault tolerance in cloud technologies presented as a service Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance

More information

CHAPTER-II WATER-FLOODING. Calculating Oil Recovery Resulting from Displ. by an Immiscible Fluid:

CHAPTER-II WATER-FLOODING. Calculating Oil Recovery Resulting from Displ. by an Immiscible Fluid: CHAPTER-II WATER-FLOODING Interfacal Tenson: Energy requred ncreasng te area of te nterface by one unt. Te metods of measurng IFT s nclude a rng tensometer, pendant drop and spnnng drop tecnques. IFT s

More information

AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE

AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE Yu-L Huang Industral Engneerng Department New Mexco State Unversty Las Cruces, New Mexco 88003, U.S.A. Abstract Patent

More information

A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks

A 2 -MAC: An Adaptive, Anycast MAC Protocol for Wireless Sensor Networks : An Adaptve, Anycast MAC Protocol for Wreless Sensor Networks Hwee-Xan Tan and Mun Choon Chan Department of Computer Scence, School of Computng, Natonal Unversty of Sngapore {hweexan, chanmc}@comp.nus.edu.sg

More information

DEFINING %COMPLETE IN MICROSOFT PROJECT

DEFINING %COMPLETE IN MICROSOFT PROJECT CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,

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

A Replication-Based and Fault Tolerant Allocation Algorithm for Cloud Computing

A Replication-Based and Fault Tolerant Allocation Algorithm for Cloud Computing A Replcaton-Based and Fault Tolerant Allocaton Algorthm for Cloud Computng Tork Altameem Dept of Computer Scence, RCC, Kng Saud Unversty, PO Box: 28095 11437 Ryadh-Saud Araba Abstract The very large nfrastructure

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

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

RESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL. Yaoqi FENG 1, Hanping QIU 1. China Academy of Space Technology (CAST) yaoqi.feng@yahoo.

RESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL. Yaoqi FENG 1, Hanping QIU 1. China Academy of Space Technology (CAST) yaoqi.feng@yahoo. ICSV4 Carns Australa 9- July, 007 RESEARCH ON DUAL-SHAKER SINE VIBRATION CONTROL Yaoq FENG, Hanpng QIU Dynamc Test Laboratory, BISEE Chna Academy of Space Technology (CAST) yaoq.feng@yahoo.com Abstract

More information

SAT Math Facts & Formulas

SAT Math Facts & Formulas Numbers, Sequences, Factors SAT Mat Facts & Formuas Integers:..., -3, -2, -1, 0, 1, 2, 3,... Reas: integers pus fractions, decimas, and irrationas ( 2, 3, π, etc.) Order Of Operations: Aritmetic Sequences:

More information

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Luby s Alg. for Maximal Independent Sets using Pairwise Independence Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

More information

Schedulability Analysis under Graph Routing in WirelessHART Networks

Schedulability Analysis under Graph Routing in WirelessHART Networks Scedulability Analysis under Grap Routing in WirelessHART Networks Abusayeed Saifulla, Dolvara Gunatilaka, Paras Tiwari, Mo Sa, Cenyang Lu, Bo Li Cengjie Wu, and Yixin Cen Department of Computer Science,

More information

A New Task Scheduling Algorithm Based on Improved Genetic Algorithm

A New Task Scheduling Algorithm Based on Improved Genetic Algorithm A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng Envronment Congcong Xong, Long Feng, Lxan Chen A New Task Schedulng Algorthm Based on Improved Genetc Algorthm n Cloud Computng

More information

A probabilistic approach for predictive congestion control in wireless sensor networks

A probabilistic approach for predictive congestion control in wireless sensor networks Anne Uthra et al. / J Zhejang Unv-Sc C (Comput & Electron) 214 15(3):187-199 187 Journal of Zhejang Unversty-SCIENCE C (Computers & Electroncs) ISSN 1869-1951 (Prnt); ISSN 1869-196X (Onlne) www.zju.edu.cn/jzus;

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

An Ad Hoc Network Load Balancing Energy- Efficient Multipath Routing Protocol

An Ad Hoc Network Load Balancing Energy- Efficient Multipath Routing Protocol 246 JOURNA OF SOFTWAR, VO. 9, NO. 1, JANUARY 2014 An Ad Hoc Network oad alancng nergy- ffcent Multpath Routng Protocol De-jn Kong Shanx Fnance and Taxaton College, Tayuan, Chna mal: dejnkong@163.com Xao-lng

More information

VOLUME 5 BLAGOEVGRAD, BULGARIA SCIENTIFIC. Research ELECTRONIC ISSUE ISSN 1312-7535

VOLUME 5 BLAGOEVGRAD, BULGARIA SCIENTIFIC. Research ELECTRONIC ISSUE ISSN 1312-7535 VOLUME 5 007 BLAGOEVGRAD, BULGARIA SCIENTIFIC Research ISSN 131-7535 ELECTRONIC ISSUE IMPROVING FAIRNESS IN CDMA-HDR NETWORKS Valentn Hrstov Abstract. Improvng throughput and farness n Cellular Data Networks

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

Efficient Striping Techniques for Variable Bit Rate Continuous Media File Servers æ

Efficient Striping Techniques for Variable Bit Rate Continuous Media File Servers æ Effcent Strpng Technques for Varable Bt Rate Contnuous Meda Fle Servers æ Prashant J. Shenoy Harrck M. Vn Department of Computer Scence, Department of Computer Scences, Unversty of Massachusetts at Amherst

More information

Optimal Choice of Random Variables in D-ITG Traffic Generating Tool using Evolutionary Algorithms

Optimal Choice of Random Variables in D-ITG Traffic Generating Tool using Evolutionary Algorithms Optmal Choce of Random Varables n D-ITG Traffc Generatng Tool usng Evolutonary Algorthms M. R. Mosav* (C.A.), F. Farab* and S. Karam* Abstract: Impressve development of computer networks has been requred

More information

On the Use of Bayesian Networks to Analyze Survey Data

On the Use of Bayesian Networks to Analyze Survey Data On te Use of Bayesan Networks to Analyze Survey Data P. Sebastan 1 (1 and. Ramon ( (1 Department of atematcs and Statstcs, Unversty of assacusetts. ( Cldren's Hosptal Informatcs Program, Harvard Unversty

More information

Load Balancing Based on Clustering Methods for LTE Networks

Load Balancing Based on Clustering Methods for LTE Networks Cyber Journals: Multdscplnary Journals n Scence and Technology Journal of Selected Areas n Telecommuncatons (JSAT) February Edton 2013 Volume 3 Issue 2 Load Balancng Based on Clusterng Methods for LTE

More information

JCS&T Vol. 11 No. 1 April 2011

JCS&T Vol. 11 No. 1 April 2011 Reversble Data Hdng Explotng Varance n Wavelet Coeffcents Xu-Ren Luo Department of Electrcal and Electronc Engneerng, Cung Ceng Insttute of Tecnology, Natonal Defense Unversty, Tas, Taoyuan 33509, Tawan,

More information

Practical Design Considerations for Next Generation High-Speed Data Wireless Systems

Practical Design Considerations for Next Generation High-Speed Data Wireless Systems Practcal Desgn Consderatons for ext Generaton Hgh-peed Data Wreless ystems ChngYao Huang and Hue Yuan u Wreless Informaton and Technology Lab Department of Electroncs Engneerng atonal Chao Tung Unversty

More information

A generalized hierarchical fair service curve algorithm for high network utilization and link-sharing

A generalized hierarchical fair service curve algorithm for high network utilization and link-sharing Computer Networks 43 (2003) 669 694 www.elsever.com/locate/comnet A generalzed herarchcal far servce curve algorthm for hgh network utlzaton and lnk-sharng Khyun Pyun *, Junehwa Song, Heung-Kyu Lee Department

More information

On File Delay Minimization for Content Uploading to Media Cloud via Collaborative Wireless Network

On File Delay Minimization for Content Uploading to Media Cloud via Collaborative Wireless Network On Fle Delay Mnmzaton for Content Uploadng to Meda Cloud va Collaboratve Wreless Network Ge Zhang and Yonggang Wen School of Computer Engneerng Nanyang Technologcal Unversty Sngapore Emal: {zh0001ge, ygwen}@ntu.edu.sg

More information

Reinforcement Learning for Quality of Service in Mobile Ad Hoc Network (MANET)

Reinforcement Learning for Quality of Service in Mobile Ad Hoc Network (MANET) Renforcement Learnng for Qualty of Servce n Moble Ad Hoc Network (MANET) *T.KUMANAN AND **K.DURAISWAMY *Meenaksh College of Engneerng West K.K Nagar, Cheena-78 **Dean/academc,K.S.R College of Technology,Truchengode

More information

A New Quality of Service Metric for Hard/Soft Real-Time Applications

A New Quality of Service Metric for Hard/Soft Real-Time Applications A New Qualty of Servce Metrc for Hard/Soft Real-Tme Applcatons Shaoxong Hua and Gang Qu Electrcal and Computer Engneerng Department and Insttute of Advanced Computer Study Unversty of Maryland, College

More information

A GENERIC HANDOVER DECISION MANAGEMENT FRAMEWORK FOR NEXT GENERATION NETWORKS

A GENERIC HANDOVER DECISION MANAGEMENT FRAMEWORK FOR NEXT GENERATION NETWORKS A GENERIC HANDOVER DECISION MANAGEMENT FRAMEWORK FOR NEXT GENERATION NETWORKS Shanthy Menezes 1 and S. Venkatesan 2 1 Department of Computer Scence, Unversty of Texas at Dallas, Rchardson, TX, USA 1 shanthy.menezes@student.utdallas.edu

More information

EXPORT INSURANCE SUBSIDISATION AND UNDISTORTED TRADE CREATION. Gerda Dewit University of Glasgow. September 1996

EXPORT INSURANCE SUBSIDISATION AND UNDISTORTED TRADE CREATION. Gerda Dewit University of Glasgow. September 1996 EXPORT INSURANCE SUBSIDISATION AND UNDISTORTED TRADE CREATION by Gerda Dewt Unversty of Gasgow September 1996 Abstract: Trade actvtes nvovng uncertanty tend to be underdeveoped. Incompete or mssng nsurance

More information

Interleaved Power Factor Correction (IPFC)

Interleaved Power Factor Correction (IPFC) Interleaved Power Factor Correcton (IPFC) 2009 Mcrochp Technology Incorporated. All Rghts Reserved. Interleaved Power Factor Correcton Slde 1 Welcome to the Interleaved Power Factor Correcton Reference

More information

A Novel Auction Mechanism for Selling Time-Sensitive E-Services

A Novel Auction Mechanism for Selling Time-Sensitive E-Services A ovel Aucton Mechansm for Sellng Tme-Senstve E-Servces Juong-Sk Lee and Boleslaw K. Szymansk Optmaret Inc. and Department of Computer Scence Rensselaer Polytechnc Insttute 110 8 th Street, Troy, Y 12180,

More information

Analysis of the Delay and Jitter of Voice Traffic Over the Internet

Analysis of the Delay and Jitter of Voice Traffic Over the Internet Analyss of the Delay and Jtter of Voce Traffc Over the Internet Mansour J. Karam, Fouad A. Tobag Abstract In the future, voce communcaton s expected to mgrate from the Publc Swtched Telephone Network (PSTN)

More information

DBA-VM: Dynamic Bandwidth Allocator for Virtual Machines

DBA-VM: Dynamic Bandwidth Allocator for Virtual Machines DBA-VM: Dynamc Bandwdth Allocator for Vrtual Machnes Ahmed Amamou, Manel Bourguba, Kamel Haddadou and Guy Pujolle LIP6, Perre & Mare Cure Unversty, 4 Place Jusseu 755 Pars, France Gand SAS, 65 Boulevard

More information

P2P/ Grid-based Overlay Architecture to Support VoIP Services in Large Scale IP Networks

P2P/ Grid-based Overlay Architecture to Support VoIP Services in Large Scale IP Networks PP/ Grd-based Overlay Archtecture to Support VoIP Servces n Large Scale IP Networks We Yu *, Srram Chellappan # and Dong Xuan # * Dept. of Computer Scence, Texas A&M Unversty, U.S.A. {weyu}@cs.tamu.edu

More information

Network Services Definition and Deployment in a Differentiated Services Architecture

Network Services Definition and Deployment in a Differentiated Services Architecture etwork Servces Defnton and Deployment n a Dfferentated Servces Archtecture E. kolouzou, S. Manats, P. Sampatakos,. Tsetsekas, I. S. Veners atonal Techncal Unversty of Athens, Department of Electrcal and

More information

Multi-agent System for Custom Relationship Management with SVMs Tool

Multi-agent System for Custom Relationship Management with SVMs Tool Mut-agent System for Custom Reatonshp Management wth SVMs oo Yanshan Xao, Bo Lu, 3, Dan Luo, and Longbng Cao Guangzhou Asan Games Organzng Commttee, Guangzhou 5063, P.R. Chna Facuty of Informaton echnoogy,

More information

Response Coordination of Distributed Generation and Tap Changers for Voltage Support

Response Coordination of Distributed Generation and Tap Changers for Voltage Support Response Coordnaton of Dstrbuted Generaton and Tap Changers for Voltage Support An D.T. Le, Student Member, IEEE, K.M. Muttaq, Senor Member, IEEE, M. Negnevtsky, Member, IEEE,and G. Ledwch, Senor Member,

More information

Dynamic Fleet Management for Cybercars

Dynamic Fleet Management for Cybercars Proceedngs of the IEEE ITSC 2006 2006 IEEE Intellgent Transportaton Systems Conference Toronto, Canada, September 17-20, 2006 TC7.5 Dynamc Fleet Management for Cybercars Fenghu. Wang, Mng. Yang, Ruqng.

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

Network-Wide Load Balancing Routing With Performance Guarantees

Network-Wide Load Balancing Routing With Performance Guarantees Network-Wde Load Balancng Routng Wth Performance Guarantees Kartk Gopalan Tz-cker Chueh Yow-Jan Ln Florda State Unversty Stony Brook Unversty Telcorda Research kartk@cs.fsu.edu chueh@cs.sunysb.edu yjln@research.telcorda.com

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

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