Research Article A Novel Adaptation Method for HTTP Streaming of VBR Videos over Mobile Networks

Size: px
Start display at page:

Download "Research Article A Novel Adaptation Method for HTTP Streaming of VBR Videos over Mobile Networks"

Transcription

1 Moble Informaton Systems Volume 216, Artcle ID 29285, 11 pages Research Artcle A Novel Adaptaton Method for HTTP Streamng of VBR Vdeos over Moble Networks Hung T. Le, 1 Ha N. Nguyen, 2 Nam Pham Ngoc, 2 Anh T. Pham, 1 and Truong Cong Thang 1 1 Unversty of Azu, Tsuruga, Ikk-mach, Azu-Wakamatsu , Japan 2 Hano Unversty of Scence and Technology, 1 Da Co Vet, Hano 1, Vetnam Correspondence should be addressed to Truong Cong Thang; thang@u-azu.ac.jp Receved 16 November 215; Accepted 12 June 216 Academc Edtor: Q Wang Copyrght 216 Hung T. Le et al. Ths s an open access artcle dstrbuted under the Creatve Commons Attrbuton Lcense, whch permts unrestrcted use, dstrbuton, and reproducton n any medum, provded the orgnal work s properly cted. Recently, HTTP streamng has become very popular for delverng vdeos over the Internet. For adaptvty, a provder should generate multple versons of a vdeo as well as the related metadata. Varous adaptaton methods have been proposed to support a streamng clent n copng wth strong bandwdth varatons. However, most of exstng methods target at constant btrate (CBR) vdeos only. In ths paper, we present a new method for qualty adaptaton n on-demand streamng of varable btrate (VBR) vdeos. To cope wth strong varatons of VBR btrate, we use a local average btrate as the representatve btrate of a verson. A buffer-based algorthm s then proposed to conservatvely adapt vdeo qualty. Through experments n the moble streamng context, we show that our method can provde qualty stablty as well as buffer stablty even under very strong varatons of bandwdth and vdeo btrates. 1. Introducton Recently, vdeo streamng has rapdly ganed popularty over themobleinternet.itspredctedthatglobalvdeotraffcwll reach 8 percent of total consumer Internet traffc n 219 [1]. Besdes, HTTP protocol has become a cost-effectve soluton thanks to the abundance of Web platform and broadband connectons [2, 3]. Furthermore, for nteroperablty of HTTP streamng n the ndustry, ISO/IEC MPEG has developed Dynamc Adaptve Streamng over HTTP (DASH) [4] as the frst standard for vdeo streamng over HTTP. Due to the heterogenety of communcaton networks nowadays, adaptvty s a prncpal requrement for any streamng clents. In DASH, multple versons of an orgnal vdeo as well as related metadata (e.g., descrbng btrates and resolutons) are generated and stored at servers [4, 5]. Based on the nformaton of metadata as well as the termnal and networks, a clent can adaptvely decde whch/when data parts should be downloaded. Currently, the queston of vdeo adaptaton for HTTP streamng s stll an open ssue [6]. Varous adaptaton methods for HTTP streamng have been proposed over the past few years [7 17]. These methods can be roughly classfed nto two groups, throughput-based and buffer-based; each has ts own strengths and weaknesses [18]. Throughput-based methods decde the verson based on the estmated throughput only, whle buffer-based methods manly use buffer characterstcs as references for makng decsons. Throughput-based methods are usually able to react quckly to throughput varatons; however, the streamng qualty may be unstable [7]. Meanwhle, buffer-based methods try to mantan a smooth vdeo stream, but may cause sudden changes n vdeo qualty when the buffer level drastcallydrops[8 11].Itshouldbenotedthatasthedatasze of each segment vares accordng to the requested verson, the buffer sze and buffer level should be measured n seconds of meda. So far, exstng adaptaton methods have mostly focused on CBR (constant btrate) vdeos. The research on HTTP streamng for VBR (varable btrate) vdeos s stll lmted. The problem wth VBR vdeos s that even though the throughput s stable, strong fluctuatons of vdeo btrate may result n buffer underflows [12]. Our prevous work n [12] s the frst study on HTTP streamng that supports VBR vdeos by estmatng both the nstant btrate and the nstant throughput. In the context of managed IPTV networks, where

2 2 Moble Informaton Systems Tme Server Alternatve 1 Alternatve 2 HTTP requestresponse transactons Alternatve 3 Throughput Clent Play Fgure 1: Meda delvery herarchy n HTTP streamng. the bandwdth s allocated n advance, the delay-qualty tradeoff of a VBR vdeo s optmally acheved by replacng some hgh-btrate segments wth low-btrate segments [13]. In [9], a buffer-based adaptaton method s proposed for VBR vdeo streamng by usng a partal-lnear buffer predcton model along wth a strategy to select versons n dfferent buffer ranges. However, ths method does not consder btrate values, and so t cannot avod sudden changes of qualty when vdeo btrate and throughput are drastcally varyng. In ths paper, we present a novel adaptaton method whch can effectvely support VBR vdeos. By extendng our prelmnary work n [14], the proposed method can cope wth varatons of throughput as well as vdeo btrate. Our method especally takes nto account the movng average of bandwdth and vdeo btrate to provde stable streamng qualty wthout sudden changes. The expermental results n the moble streamng context show that our approach can provde consstent VBR vdeo streamng wth smooth vdeo qualty and stable buffer level. To the best of our knowledge, ths s the frst method that can provde smooth verson transtons for VBR vdeo streamng over HTTP. It should be noted that our method does not requre the exact values of vdeo segment btrates to make decsons. The organzaton of ths paper s as follows. Secton 2 presents an overvew of HTTP streamng and the related work. The prncples of our method as well as the algorthm descrpton are presented n detal n Secton 3. Secton 4 provdes our expermental results and dscussons. Fnally, concluson and drecton for future work are gven n Secton Related Work The general archtecture of an HTTP streamng system conssts of servers, delvery networks, and clents [3, 4]. In MPEG DASH termnology, to support adaptvty, a vdeo s encoded n multple versons (also called alternatves or representatons), each of whch s further dvded nto short segments. Vdeo segments together wth metadata are hosted at a server and wll be requested by the clent. In most cases, for each request from the clent, the server wll send one segment. Therefore, a vdeo wll be delvered by a sequence of HTTP request-response transactons. The verson (low or hgh) of a requested segment s decded based on the metadata and status of termnals/networks. Fgure 1 depcts an llustraton of meda delvery n DASH. More nformaton about the HTTP streamng structure as well as DASH concepts could be found n [2, 4]. In general, an adaptaton method needs to answer two key questons: (1) should the current verson be mantaned? and (2) f not, whch verson should be swtched to?asalreadymentoned,exstngmethodscanbedvded nto a throughput-based group and a buffer-based group. Throughput-based methods are dfferent n the ways they estmate or use the throughput. In terms of throughput estmaton, the smplest way s to use the measured throughput rght after havng fully receved a segment (called nstant throughput) as the throughput estmate of the next segment. Another approach s to use a smoothed throughput measure [3,1]toavodshort-termfluctuatons,whchareadrawback of usng nstant throughput. However, ths may cause late reacton of the clent to large throughput drops. In [3] we propose a throughput estmaton method that has the advantages of both nstant throughput and smoothed throughput. Furthermore, other studes also present ways to obtan the estmatedthroughputbasedonsampledthroughputvalues and RTT [12], probng or stored data (lookup table) [15]. Once the clent obtans the estmated throughput, the verson can be decded n many ways. A smple soluton s usng a safety margn to compute an approprate verson for the next segment [3]. In [7], the verson s controlled by a TCPlke mechansm where a measure proportonal to the nstant throughput s used as the key nput. Buffer-based methods, whch manly use buffer characterstcs to decde the vdeo versons, may take nto account a throughput estmate as well. A popular strategy of these methodssdvdngthebufferntomultplerangeswth buffer thresholds β 1, β 2, β 3, β max (<β 1 <β 2 <β 3 β max ) [8, 1, 11]. When the buffer level stays n dfferent ranges,

3 Moble Informaton Systems Btrate (kbps) Tme (seconds) Btrate (kbps) Tme (seconds) QP =22 QP =28 QP =34 QP =38 QP =42 QP =48 QP =22 QP =28 QP =34 QP =38 QP =42 QP =48 (a) Sony Demo (b) Termnator 2 Fgure 2: Btrates of the versons of two test vdeos [19]. dfferent actons are appled. For nstance, methods of [8, 1] try to mantan the current verson n a specfc buffer range (e.g., β 2 β 3 for the method of [8] and β 2 β max for themethodof[1])anddynamcallyswtchup/downthe qualty n other buffer ranges. Meanwhle, the method of [11] chooses vdeo versons followng the varatons of nstant throughput (also wth the use of upscalng and downscalng factors) based on dfferent buffer ranges. In [16] we ntroduce a trells-based method that represents all possble changes of the versons and correspondng buffer levels n the near future. Thus, ths approach can make good decsons on the btrates of some future segments. In [17], the buffer level devaton and nstant throughput are employed as nputs of a proportonal-ntegral controller for adaptaton. Yet, most of the exstng methods have been developed only for the context of CBR vdeos, where the btrate of a verson s constant. Compared to CBR vdeos, vdeos encoded nvbrmodehavemportantadvantagesntermsofqualty and network resource usage [2]. However, the varatons of vdeo btrate over tme, together wth throughput fluctuatons, result n a bg challenge for HTTP adaptve streamng [12]. Two examples of how btrates of dfferent versons vary, especally n some scene changes, are llustrated n Fgure 2. Detaled nformaton of these vdeos wll be descrbed n Secton 4. Our prevous work n [12] s the frst study on VBR vdeo streamng over HTTP. Besdes throughput estmaton, ths method also consders the estmaton of the nstant vdeo btrate, whch can be dvded nto (1) ntrastream estmaton and (2) nterstream estmaton. The former estmates thebtratesofsegmentswthnaverson,whlethelatter estmates the btrates of segments across dfferent versons. Thsmethodcanprovdeaverystablebufferand,moreover, can support a CBR-lke streamng servce from VBR vdeos. In [9], a buffer-based adaptaton method for VBR vdeos s proposed, where the buffer s dvded nto multple ranges. In order not to take nto account varyng vdeo btrates, ths method uses a partal-lnear trend predcton of the buffer level for choosng versons n dfferent buffer ranges. If no sgnfcant change of buffer level s estmated, the clent wll mantan the current verson for the next segment. However, ths method stll causes sudden verson changes f the actual buffer level declnes drastcally. In ths paper, we propose a novel adaptaton method that can effectvely support VBR vdeos n on-demand streamng. The dstngushng features of our method nclude the followng: () To cope wth strong varatons of vdeo btrates, we proposeusngalocalaveragebtrateasthe(movng) representatve btrate of a verson. Snce ths representatve btrate s stable n short term, t helps the clent clearly dfferentate between the avalable versons and make a good verson selecton at each tme nstance. () Because the clent does not have enough nformaton aboutthesegmentbtratesofallversons,weprovde an algorthm to obtan an estmated representatve btrate of each verson. () Regardng the frst key queston, qualty stablty s effectvely mantaned by (1) usng a smoothed throughput estmate when the buffer s not n danger, (2) usng the representatve btrate, and (3) beng conservatve n qualty swtchng. (v) Regardng the second key queston, smooth transtons of qualty are supported by avodng jumpng smply to the lowest verson n panc case and by early swtchng down when there s a throughput-btrate msmatch. 3. The Proposed Adaptaton Method In ths secton, we present a new buffer-based qualty adaptaton method for VBR vdeo streamng. Some notatons along wth ther defntons used n the paper are provded n Notatons Handlng Throughput and Btrate Fluctuatons. Generally, basedonthemeasuredthroughputandthevdeobtrate, theclentshouldchooseanapproprateversonforthenext segment. Suppose that after recevng the current (or last)

4 4 Moble Informaton Systems segment of verson I, the clent measures the btrate B,I and throughput T of ths segment. Now the clent wll decde the verson I +1 for the next segment +1.Ourproposed method wll also leverage the clent buffer to cope wth the fluctuatons of both the throughput and the vdeo btrate. Dependng on the current buffer level β cur,theclentwll decde whether the verson should be ncreased, decreased, or mantaned. For the verson selecton of the next segment, t s necessary to estmate the throughput based on the throughput hstory of receved segments. To avod the effects of shortterm fluctuatons of nstant throughput, we use a smoothed throughput measure T s [3, 1] as the throughput estmate Test +1 for the next segment +1: +1 =Ts = { (1 δ) T s 1 +δ T { T { T est f >; f =, where δ s a weghtng value, whch s set to.1 n ths paper. As vdeo btrate s hghly fluctuatng, we propose usng a representatve btrate for each verson, whch can dfferentatetheavalableversonsandcanalsobeappropratefor the representatve btrate for verson k at segment ndex. Inourmethod,B rep,k s calculated as the average btrate of N recent segments of verson k. The problem s that the clent only knows the btrates of the receved segments, whch may belong to dfferent versons. So, after recevng each segment, wewllestmate the segment btrates of other versons wth the same ndex. Ths s enabled by the btrate estmaton method proposed n our prevous study [12], where the segment btrates of other versons are estmated from the btrate of the receved segment usng the nterstream btrate predcton. Specfcally, mantanng qualty stablty. Denote B rep,k (1) the estmated btrate B e,k of verson k canbecalculatedfrom the (actual) btrate B o,n of the receved segment wth the selected versonn as follows: B e,k =θ Bo,n 2(QP n QP k )/6, (2) where QP k and QP n are the quantzaton parameter (QP) values of the versons and θ = 1.5 s an emprcal factor used as the compensaton for the approxmaton error of the model [12]. In our notaton (see Notatons), btrate B,k can be ether the actual btrate B o,k or the estmated one Be,k.Oncethe btrates of all segments are obtaned, the representatve btrate of each verson at segment ndex s calculated as the average of the btrates of segment and N 1 prevous segments n that verson. The algorthm to calculate the representatve btrates s provded n Algorthm 1. In ths algorthm, the current representatve btrate s actually computed usng the prevous representatve btrate. Also, t should be noted that, when <N, N wll be set to. In Secton 4, we wll nvestgate how dfferent values of N affect the performance of our method Adaptaton Algorthm. Our algorthm wll address the twokeyquestonsabove,soastoavodrebufferngandto Input: N, B rep 1,k 1 k V, B j,k j<n,1 k V Output: B rep,k 1 k V for k 1,2,...,V do // Check f btrate s the orgnal btrate f k=i then B,k B o,k ; // Otherwse the btrate s the estmated btrate else end Estmate B e,k by (2); B,k B e,k ; end // Compute B rep B rep,k Brep,k 1,k +(B,k B N,k )/N; Algorthm 1: Representatve btrate computaton (after recevng the last segment and for all vdeo versons). reduce the number and the degree of (verson) swtches. Based on the current buffer level of the clent, we defne four possble cases n a streamng sesson, whch are uptrend, stable, downtrend, and panc cases. In these four cases, the clent wll be lkely to swtch up, mantan, swtch down, or aggressvely decrease the verson. For ths purpose, our method dvdes the buffer nto three ranges wth thresholds β mn and β th (β mn <β th <β max ). Here β max s the buffer sze andalsothetargetbufferleveloftheadaptatonmethod. When the current buffer level exceeds β max,theuptrend case s actvated (for the reason why the buffer level could be hgher than β max,pleaserefertoourprevouswork[18]). However, t s not good f the clent frequently goes back and forth between the uptrend case and downtrend case. To avod ths fluctuaton, our method swtches up to the next hgher verson (I +1) only f the representatve btrate B rep,i +1 of that verson s smaller than the throughput estmate of the next segment (.e., B rep,i +1 < Test +1 ); otherwse, the clent wll mantan the current verson. The stable case s determned by the condton β th β cur < β max. In ths case, the buffer level s judged as n a very safe condton, so no change n qualty s needed. The clent just mantans the current verson to avod unnecessary swtches. The downtrend case s actvated when β mn β cur < β th. In ths case, the clent needs to carefully decde the requested verson n order to avod buffer underflows as well as sudden qualty changes when the throughput and/or the vdeo btrate change drastcally. In general, the verson should be decreased; however, t s unnecessary to swtch down always when the buffer level s n ths range. In ths process, we defne the target btrate for the next segment +1 as the hghest representatve btrate, whch s lower than the throughput estmate: B tar +1 = max{brep,k Brep,k <Test +1 }.Ifthe nstant btrate and the representatve btrate do not exceed the target btrate (B,I B tar +1 and Brep,I B tar +1 ), the current verson wll be mantaned. Otherwse, the clent wll swtch down to the next lower verson.

5 Moble Informaton Systems 5 Input: T, β cur, I, B,I, B rep,i, T est +1 Output: I +1 // Uptrend case (1) f β cur >β max then f B rep,i <T est +1 then I +1 I +1; else I +1 I ; end // Stable case (2) else f β [β th,β max ) then I +1 I ; // Downtrend case (3) else f β [β mn,β th ) then B tar +1 max{brep f B,I B tar +1,k Brep,k and Brep,I I +1 I ; else I +1 I 1; end // Panc case (4) else Select I +1 based on (4); end <Test +1 }; B tar +1 then Algorthm 2: Adaptaton algorthm for VBR vdeo streamng. We can see that sometmes the nstant throughput mght be much smaller than the nstant btrate. Even though the buffer s not n danger yet, the downtrend case should be actvated earler to avod havng to quckly reduce the verson nthefuture.thssenabledbyncreasngthevalueofβ th. In our method, β th s controlled usng a logstc functon as follows: β th =β max 1 1+e σ (β max β mn ), where σ=1 T B,I. In ths way, the larger the msmatch between T and B,I becomes, the hgher the value of β th wll be, whle stll satsfyng the condton β mn β th <β max. The fnal case, called the panc case, s when the buffer level s n danger; that s, β cur <β mn.toensurethatthebuffer wll not be empty, the clent wll aggressvely swtch down the verson. Yet, nstead of jumpng drectly to the lowest verson, the clent employs the method of our prevous work [12] n ths case. Specfcally, the clent wll choose a verson of whch the nstant btrate s the hghest but stll lower than the nstant throughput: I +1 = arg max {B,k B,k <T }. (4) 1 k V The algorthm of our method s summarzed by pseudocode as n Algorthm 2. Generally, t can be seen that our method tres to provde a smooth vdeo stream by two technques. Frst, t (3) Web server IP networks Fgure 3: Test-bed organzaton for experments. DummyNet Clent s somewhat conservatve n ncreasng the qualty because that s allowed only when the buffer s full. In addton, the selected verson s constraned by the long-term values of throughput and btrate. Second, the downtrend case s also conservatve by avodng contnuously swtchng down the qualty. Meanwhle, n the panc case, we take nto account the nstant btrate and nstant throughput. Thus, the clent can swtch down gradually when possble; and there s no need to swtch to the lowest verson f the nstant btrate of a hgher verson stll meets the throughput constrant. 4. Expermental Results and Dscussons In ths secton, we wll evaluate our proposed method and two reference methods n the context of on-demand VBR streamng over moble networks, focusng on the behavors of verson swtchng and buffer level after the ntal bufferng stage. Two bandwdth traces, a smple one and a complex one, are employed n our experments Experment Setup. Our test-bed organzaton used for the experments s smlar to that of [18], whch conssts of an HTTP Web server, a streamng clent, and an IP network as n Fgure 3. The IP network ncludes a router and wred connectons connectng the server and the clent. The server s an Apache HTTP server of verson runnng on Ubuntu Our test-bed uses DummyNet tool [21] nstalled at the clent sde to emulate network characterstcs. The packet loss rate s set to %, assumng that the bandwdth trace used n the experments already takes nto account the fluctuatons caused by packet loss. RTT value of DummyNet s set to 4 ms. The clent s mplemented n Java and runs on a Wndows 7 notebook wth Core GHz CPU and 4 GB RAM. The test vdeos are Sony Demo and Termnator 2 [19] wth a frame rate of 3fps and a resoluton of The duraton of each vdeo s 6 seconds. We encode 6 VBR versons by the hgh profle of H.264/AVC [22], correspondng to 6 dfferent values of QP, namely, 22, 28, 34, 38, 42, and 48. Each verson s dvded nto small vdeo segments of 2 seconds. The verson ndex, QP, and the average btrate of each verson are lsted n Table 1. The btrate traces of the vdeo versons are shown n Fgure 2. As we focus on on-demand streamng, the buffer sze of the clent s set to 5 s (.e., 25 segment duratons), whch s smlar to prevous work (e.g., [9, 14]). For comparson, two reference methods whch are the nstant throughput-nstant btrate based method [12] (called ) and the buffer-based method wth trend predcton [9] (called ) are employed. The method s mplemented wth buffer thresholds (B mn,b low,b hgh,b max ) = (1 s,2s,4s,5s),whcharethe

6 6 Moble Informaton Systems Bandwdth (kbps) Tme (s) Versson Tme (s) Bandwdth (a) Segment btrate Bandwdth (kbps) AVG-1 AVG-3 AVG-5 AVG Tme (s) Bandwdth AVG-1 AVG-3 AVG-5 (c) Resultng buffer level AVG-3 AVG-5 (b) Requested verson Fgure 4: Adaptaton results of the three methods n smple bandwdth scenaro Buffer level (seconds) Table 1: Verson nformaton of the two test vdeos. Index QP Average btrate (kbps) Sony Demo Termnator same as the settngs n [9]. In our method, β mn and β max are 1 s and 5 s, respectvely. Also, we nvestgate whether the number of segments N used for representatve btrates affects our method s performance. The values of N consdered are 1, 3, and 5, and these optons of our method are referred to as AVG-1, AVG-3, and AVG-5, respectvely Smple Bandwdth Scenaro. Frst, we nvestgate the performance of the methods n a smple bandwdth scenaro, when the avalable bandwdth drops suddenly. The bandwdth has a rectangular shape wth two bandwdth levels, 25 kbps and 5 kbps, as shown n Fgure 4(a). Ths case s mportant n evaluatng adaptaton methods because we need to know how they perform when the bandwdth drops drastcally. In ths case, the Sony Demo vdeo s used. Fgure 4 shows the comparsons of requested versons, btrates, and buffer levels of the three methods. It s clear that the method tres to mantan the hgh qualty (verson 5) for too long even when the avalable bandwdth drops and stays at the low level for a long nterval, resultng n the worst buffer level curve (Fgure 4(c)) as well as a drastc drop of qualty (around t = 125 s, from verson 5 to verson 1 n Fgure 4(b)). As for the method, because t requests versons followng the varatons of nstant throughput and nstant vdeo btrate, the qualty s aggressvely changed over tme whle the buffer level varatons are very small. Asforourmethod,allthethreeoptonshavesmlar behavorsntermsofbtrate,versonswtch,andbufferlevel. Our method reduces the vdeo qualty gradually wth no swtches larger than 1 whle the buffer level s hgher than 25 seconds. Also, the mnmum verson provded by our method s 2, whle the other two methods sometmes jump to verson Complex Bandwdth Scenaro. In ths part, we evaluate the adaptaton methods wth a complex bandwdth trace (Fgure 5), whch was obtaned from a moble network [11].

7 Moble Informaton Systems 7 Bandwdth (kbps) Tme (s) Fgure 5: The bandwdth trace used n the complex bandwdth scenaro. Both test vdeos, Sony Demo and Termnator 2, are employed n ths scenaro. Fgure 6 shows the expermental results for the Sony Demo vdeo. As seen n Fgure 6(a), t s very dffcult to use the curves of segment btrates to compare the adaptaton methods. From Fgure 6(b), t s obvous that the method s behavor s smlar to that n the smple bandwdth case. Usually, ths method tres to mantan a hgh verson as long as the buffer level permts. Ths behavor results n sudden drops of qualty (e.g., from verson 6 to verson 3 at 1sandfromverson5toverson1at24s).Also,thebuffer level curve of ths method s the worst (Fgure 6(c)), as n the prevous scenaro. As for the method, ts btrate curve closely follows the throughput curve, resultng n a hghly fluctuatng versoncurvewthmanyswtches,ncludngswtchesoflarge degrees. Anyway, ths method has the most stable buffer level curve as seen n Fgure 6(c). Meanwhle, our method provdes both qualty stablty and buffer stablty. The verson curves of our method (Fgure 6(b)) have no sudden swtches. Moreover, when the throughput decreases, the selected verson of our method s always hgher than or equal to those of the other methods. The buffer level curve of our method s not as stable as that of the method; however, t s always hgher than that of the method. Compared to the method, our method s more conservatve n swtchng-up and less conservatve n swtchng-down. Somestatstcsoftheadaptatonresultsareprovdedn Table 2. The statstcs are related to btrate, requested verson, verson swtch, and buffer level. In terms of btrate, the method has the lowest average btrate. Its qualty s also very fluctuatng wth many swtches and large swtch degree/devaton. The method has the hghest average btrate snce ths method tends to select and mantan the best possble qualty. However, ts average verson s nterestngly lower than that of our AVG-1 opton (4.19 vs. 4.3). Even, the method has very low average btrate, but ts average verson s hgher than that of the method. In fact, the average verson values of all methods are very smlar (about 4.2 or 4.3). Among the three optons, the AVG-1 opton s the most aggressve as t always tres to request hgher versons; however, ths causes a lttle more swtches than other optons. These ponts wll be explaned and dscussed further n the next part. Table 2: Statstcs of the reference methods and the proposed method wth three dfferent optons for Sony Demo. Here, STD s the standard devaton. Statstcs AVG-1 AVG-3 AVG-5 Average btrate (kbps) Average verson Maxmum verson Mnmum verson Number of swtches Maxmum swtch degree STD of swtch degrees Mnmum buffer level (s) STD of buffer levels (s) Table 3: Statstcs of the reference methods and the proposed method wth three dfferent optons for Termnator 2. Here, STD s the standard devaton. Statstcs AVG-1 AVG-3 AVG-5 Average btrate (kbps) Average verson Maxmum verson Mnmum verson Number of swtches Maxmum swtch degree STD of swtch degrees Mnmum buffer level (s) STD of buffer levels (s) Moreover, our method provdes the smallest values n terms of the number of swtches and the degree of swtches. In addton, the mnmum verson of our method s hgher than the other methods. The mnmum value and standard devaton (STD) of buffer level of our method are also much better than those of the method. For more nformaton about the buffer, the cumulatve dstrbuton functons (CDFs) of the buffer levels are provded n Fgure 7(a). Agan, tsevdentthatthebufferofourmethodsmuchmorestable than that of the method. Fgure 8 shows the expermental results for Termnator 2 vdeo, where smlar behavors of the methods can be found. Our method agan provdes a smoother verson curve and a more stable buffer level curve than the method. The aggressveness of AVG-1 can also be seen n Fgure 8(b). For example, durng 33 s 37 s, the AVG-1 opton shortly ncreases the qualty to verson 6 and then reduces the qualty to verson 5 and verson 4. Meanwhle, the other two optons stll request verson 5 durng the same nterval. The statstcs of the adaptaton results for Termnator 2 vdeo s provded n Table 3. Wth ths vdeo, the average verson values of our method are all hgher than that of the method. The average btrate of the AVG-1 opton especally s hgher than that of the method. Ths s because verson btrates of Termnator 2 are smaller than those of Sony Demo, so the AVG-1 opton can easly reach the hghest possble qualty. In addton, the other parameters

8 8 Moble Informaton Systems 8 9 Btrate (kbps) Verson Tme (s) Tme (s) Throughput (a) Segment btrate 8 AVG-1 AVG-3 AVG-5 AVG-1 AVG-3 AVG-5 (b) Requested verson 8 Throughput (kbps) Tme (s) Buffer level (seconds) Throughput AVG-1 AVG-3 AVG-5 (c) Resultng buffer level Fgure 6: Adaptaton results of the three methods n the complex bandwdth scenaro wth Sony Demo vdeo. CDF Buffer level (s) AVG-1 (a) Sony Demo AVG-3 AVG-5 CDF Buffer level (s) AVG-1 (b) Termnator 2 AVG-3 AVG-5 Fgure 7: Cumulatve dstrbuton functons (CDFs) of buffer level n the complex bandwdth scenaro. also show that our method provdes a smoother qualty and a more stable buffer than the method. Besdes, the CDFs of buffer levels (Fgure 7(b)) confrm the stablty of buffer level of our method. Fgure 7(b) also showsthatthebufferlevelsoftheavg-3andavg-5 optons are a lttle better than that of the AVG-1 opton. ThssbecausetheAVG-1optonsmoreaggressvethanthe other optons. Especally compared to the case of Sony Demo vdeo (Fgure 7(a)), the buffer of the method s worse whle the buffer of our method s better. Ths s actually due to the characterstcs of the Termnator 2 vdeo as dscussed n the next part Dscussons. From the above expermental results, we can see some nterestng ponts. Frst, n some cases the average btrate of the method s hgher than that of our proposed method, whle ts average verson s lower than that of our method. Ths can be explaned by the fact that sometmes the nstant btrate s very hgh. So, havng some more segments of hgh btrates, especally those belongng to the top verson, wll sgnfcantly ncrease the average btrate. In case of Termnator 2 vdeo, whch has lower verson btrates than Sony Demo vdeo, the average btrate of method s not better than that of our method. Meanwhle, n low-throughput perods, the selected versons of the method are lower than those of our method, resultng n a lower value of average verson. So, as the btrate of VBR vdeo s hghly fluctuatng, the parameter of average btrate should not be the man ndcator to evaluate the performance of VBR vdeo streamng (as n [9]); rather, the parameter of average verson should be consdered. Ths s dfferent from CBR vdeo streamng, where the average btrate s always of hgh nterest.

9 Moble Informaton Systems Btrate (kbps) Verson Tme (s) Tme (s) Throughput (a) Segment btrate 1 AVG-1 AVG-3 AVG-5 AVG-1 AVG-3 AVG-5 (b) Requested verson 8 Throughput (kbps) Tme (s) Throughput AVG-1 AVG-3 AVG-5 (c) Resultng buffer level Buffer level (seconds) Fgure 8: Adaptaton results of the three methods n the complex bandwdth scenaro wth Termnator 2 vdeo. The results of our adaptaton method show that a normal buffer sze (.e., smlar to that n CBR vdeo streamng) s already enough to cope wth strong btrate varatons of VBR vdeos. Also, a representatve btrate for each verson s mportant for VBR vdeos. Even the method benefts a lot from learnng the nstant btrate. Though havng a hghly fluctuatng verson curve, ths method can be used for lve streamng thanks to ts very stable buffer. On the other hand, the method does not consder btrate values and thus poorly handles the strong varatons of VBR vdeo. For example, although Termnator 2 vdeo has lower verson btrates than Sony Demo vdeo, the buffer stablty of the method n the case of Termnator 2 vdeo s worse than n the case of Sony Demo vdeo. Ths s just because the verson btrates of Termnator 2 vdeo are extremely varyng (wth repeated and quck changes fromahghvaluetoalowvalue),whereastheperformance of our method s not degraded n the case of Termnator 2vdeo. The three optons of our method are smlar n terms of average verson values. Yet, among the three optons, the AVG-1 opton seems to be more aggressve n swtchng up and mantanng a hgh qualty. Ths s because the representatve btrate of ths opton s more local and can quckly detect low-btrate segment ntervals, where the clent can swtch to a hgher verson when the throughput permts. Such property can ncrease the average verson; however, that also causes more swtches as seen n the statstcs of the AVG- 1 opton. The above statstcs show that AVG-3 and AVG-5 optons have nearly the same performance wth good qualty stablty and good buffer stablty. In general, t s shown that our method s more effectve than the reference methods n provdng stable streamng qualty, wth smooth verson transtons even when the avalable bandwdth dramatcally drops. If a user prefers streamng wth the hghest possble qualty, more local representatve btrates should be used. On the other hand, f the user prefers a stable streamng sesson wth fewer verson swtches, more global representatve btrates should be used. It should be noted that, actually, the qualty of a CBR vdeo s varable and the qualty of a VBR vdeo s constant. Meanwhle, as shown n [12], t s totally feasble to provde a quas-cbr streamng servce from VBR vdeo data sets. The above results also show that, wth the smple method of representatve btrate estmaton, we do not need to know exactly the btrates of all VBR vdeo segments even though the nstant btrate s extremely varyng. Ths means that VBR vdeos and the clent-based adaptaton method proposed n ths paper can be easly deployed n DASH-complant

10 1 Moble Informaton Systems streamng systems wthout the need to modfy the current standard specfcaton. 5. Concluson In ths paper, we have presented an adaptaton method for VBRvdeosandevaluatedthemethodnthemoblestreamngcontext.Tocopewthstrongvaratonsofvdeobtrate,we employed a local average btrate as the representatve btrate of a verson. A buffer-based algorthm was then proposed to conservatvely adapt vdeo qualty by takng nto account a smoothed throughput estmate, the representatve btrate, and even the nstant btrate. The expermental results showed thatourmethodcanprovdesmoothvdeoqualtyandstable buffer level, even under very strong varatons of bandwdth andvdeobtrates.forfuturework,wewllfocusonlve streamng scenaros such as survellances wth VBR vdeo sources. Notatons T : Thethroughputofsegment T est +1 : Thethroughputestmateofsegment+1 β cur : Thecurrentbufferlevel β mn : The mnmum buffer threshold β th : The flexble buffer threshold β max : The buffer sze and also the target buffer level B,k : Thebtrateofthesegment n verson k. It could be the actual value B o,k or the estmated value B e,k B rep,k : The representatve btrate of verson k at segment V: The number of avalable vdeo versons I : The ndex of the verson whch s chosen for segment (verson of hgher qualty has a hgher ndex value). Competng Interests The authors declare that they have no competng nterests. References [1] Csco, Csco vsual networkng ndex: forecast and methodology, , Whte Paper, 215. [2] A.C.Begen,T.Akgul,andM.Baugher, Watchngvdeoover the web: part 1: streamng protocols, IEEE Internet Computng, vol. 15, no. 2, pp , 211. [3] T.C.Thang,Q.-D.Ho,J.W.Kang,andA.T.Pham, Adaptve streamng of audovsual content usng MPEG DASH, IEEE Transactons on Consumer Electroncs, vol.58,no.1,pp.78 85, 212. [4] T. Stockhammer, Dynamc adaptve streamng over HTTP: standards and desgn prncples, n Proceedngs of the 2nd Annual ACM Multmeda Systems Conference (MMSys 11), pp , San Jose, Calf, USA, February 211. [5] T.C.Thang,J.Y.Lee,J.W.Kang,S.J.Bae,S.Jung,andS.T.Park, Sgnalng metadata for adaptve http streamng, n ISO/IEC JTC1/SC29/WG11m17771,21. [6] A.C.Begen,T.Akgul,andM.Baugher, Watchngvdeoover the web: part 2: applcatons, standardzaton, and open ssues, IEEE Internet Computng,vol.15,no.3,pp.59 63,211. [7] C. Lu, I. Bouazz, and M. Gabbouj, Rate adaptaton for adaptve HTTP streamng, n Proceedngs of the 2nd Annual ACM Multmeda Systems Conference (MMSys 11),pp , San Jose, Calf, USA, February 211. [8] K. Mller, E. Quaccho, G. Gennar, and A. Wolsz, Adaptaton algorthm for adaptve streamng over HTTP, n Proceedngs of the 19th Internatonal Packet Vdeo Workshop (PV 12),pp , IEEE, Munch, Germany, May 212. [9]Y.Zhou,Y.Duan,J.Sun,andZ.Guo, Towardssmpleand smooth rate adapton for VBR vdeo n DASH, n Proceedngs of the IEEE Vsual Communcatons and Image Processng Conference (VCIP 14),pp.9 12,December214. [1] S.Akhshab,S.Narayanaswamy,A.C.Begen,andC.Dovrols, An expermental evaluaton of rate-adaptve vdeo players over HTTP, Sgnal Processng: Image Communcaton, vol.27,no.4, pp , 212. [11] C. Müller, S. Lederer, and C. Tmmerer, An evaluaton of dynamc adaptve streamng over HTTP n vehcular envronments, n Proceedngs of the 4th Workshop on Moble Vdeo (MoVd 12), pp , Chapel Hll, NC, USA, February 212. [12] T.C.Thang,H.T.Le,H.X.Nguyen,A.T.Pham,J.W.Kang,and Y. M. Ro, Adaptve vdeo streamng over HTTP wth dynamc resource estmaton, Journal of Communcatons and Networks, vol.15,no.6,pp ,213. [13]D.V.Nguyen,D.M.Nguyen,H.T.Tran,N.P.Ngoc,A.T. Pham, and T. C. Thang, Qualty-delay tradeoff optmzaton n mult-btrate adaptve streamng, n Proceedngs of the IEEE Internatonal Conference on Consumer Electroncs (ICCE 15), pp , IEEE, January 215. [14]H.T.Le,N.P.Ngoc,T.A.Vu,A.T.Pham,andT.C.Thang, Smooth-btrate adaptaton method for HTTP streamng n vehcular envronments, n Proceedngs of the IEEE Vehcular Networkng Conference (VNC 14), pp , December 214. [15] K. Evensen, A. Petlund, H. Rser et al., Moble vdeo streamng usng locaton-based network predcton and transparent handover, n Proceedngs of the 21st Internatonal Workshop on Network and Operatng Systems Support for Dgtal Audo And Vdeo (NOSSDAV 11), pp.21 26,ACM,BrtshColumba, Canada, June 211. [16] H.T.Le,D.V.Nguyen,N.P.Ngoc,A.T.Pham,andT.C.Thang, Buffer-based btrate adaptaton for adaptve HTTP streamng, n Proceedngs of the Internatonal Conference on Advanced Technologes for Communcatons (ATC 13), pp.33 38,HoCh Mnh Cty, Vetnam, October 213. [17] G. Tan and Y. Lu, Towards agle and smooth vdeo adaptaton n dynamc HTTP streamng, n Proceedngs of the 8th ACM Internatonal Conference on Emergng Networkng Experments and Technologes (CoNEXT 12), pp , Nce, France, December 212. [18] T.C.Thang,H.T.Le,A.T.Pham,andY.M.Ro, Anevaluaton of btrate adaptaton methods for HTTP lve streamng, IEEE Journal on Selected Areas n Communcatons,vol.32,no.4,pp , 214. [19] H264/AVC vdeo trace lbrary, [2]T.V.Lakshman,A.Ortega,andA.R.Rebman, VBRvdeo: tradeoffs and potentals, Proceedngs of the IEEE,vol.86,no.5, pp , 1998.

11 Moble Informaton Systems 11 [21] L. Rzzo, Dummynet: a smple approach to the evaluaton of network protocols, ACM SIGCOMM Computer Communcaton Revew,vol.27,pp.31 41,1997. [22] T. Wegand, G. J. Sullvan, G. Bjøntegaard, and A. Luthra, Overvew of the H.264/AVC vdeo codng standard, IEEE Transactons on Crcuts and Systems for Vdeo Technology, vol. 13,no.7,pp ,23.

12 Journal of Advances n Industral Engneerng Multmeda The Scentfc World Journal Volume 214 Volume 214 Appled Computatonal Intellgence and Soft Computng Internatonal Journal of Dstrbuted Sensor Networks Volume 214 Volume 214 Volume 214 Advances n Fuzzy Systems Modellng & Smulaton n Engneerng Volume 214 Volume 214 Submt your manuscrpts at Journal of Computer Networks and Communcatons Advances n Artfcal Intellgence Hndaw Publshng Corporaton Volume 214 Internatonal Journal of Bomedcal Imagng Volume 214 Advances n Artfcal Neural Systems Internatonal Journal of Computer Engneerng Computer Games Technology Advances n Volume 214 Advances n Software Engneerng Volume 214 Volume 214 Volume 214 Volume 214 Internatonal Journal of Reconfgurable Computng Robotcs Computatonal Intellgence and Neuroscence Advances n Human-Computer Interacton Journal of Volume 214 Volume 214 Journal of Electrcal and Computer Engneerng Volume 214 Volume 214 Volume 214

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information

Video Proxy System for a Large-scale VOD System (DINA)

Video Proxy System for a Large-scale VOD System (DINA) Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,

More information

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Learning the Kernel Parameters in Kernel Minimum Distance Classifier

Learning the Kernel Parameters in Kernel Minimum Distance Classifier Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department

More information

Internet Traffic Managers

Internet Traffic Managers Internet Traffc Managers Ibrahm Matta matta@cs.bu.edu www.cs.bu.edu/faculty/matta Computer Scence Department Boston Unversty Boston, MA 225 Jont work wth members of the WING group: Azer Bestavros, John

More information

Virtual Machine Migration based on Trust Measurement of Computer Node

Virtual Machine Migration based on Trust Measurement of Computer Node Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on

More information

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks

FAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks 2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng

More information

Analysis of Collaborative Distributed Admission Control in x Networks

Analysis of Collaborative Distributed Admission Control in x Networks 1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,

More information

Improved H.264 Rate Control by Enhanced MAD-Based Frame Complexity Prediction

Improved H.264 Rate Control by Enhanced MAD-Based Frame Complexity Prediction Journal of Vsual Communcaton and Image Representaton (Specal Issue on Emergng H.64/AVC Vdeo Codng Standard), Elsever Scence, May 005 Improved H.64 Rate Control by Enhanced -Based Frame Complexty Predcton

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

Efficient Distributed File System (EDFS)

Efficient Distributed File System (EDFS) Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

SRB: Shared Running Buffers in Proxy to Exploit Memory Locality of Multiple Streaming Media Sessions

SRB: Shared Running Buffers in Proxy to Exploit Memory Locality of Multiple Streaming Media Sessions SRB: Shared Runnng Buffers n Proxy to Explot Memory Localty of Multple Streamng Meda Sessons Songqng Chen,BoShen, Yong Yan, Sujoy Basu, and Xaodong Zhang Department of Computer Scence Moble and Meda System

More information

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) ,

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) , Fax: (370-5) , VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual

More information

Streaming Variable Bitrate Video Over Mobile Networks with Predictable Performance

Streaming Variable Bitrate Video Over Mobile Networks with Predictable Performance IEEE Wreless Communcatons and Networkng Conference (WCNC 2016) - Track 3 - Moble and Wreless Networks Streamng Varable Btrate Vdeo Over Moble Networks wth Predctable Performance Yan Lu Department of Informaton

More information

Shared Running Buffer Based Proxy Caching of Streaming Sessions

Shared Running Buffer Based Proxy Caching of Streaming Sessions Shared Runnng Buffer Based Proxy Cachng of Streamng Sessons Songqng Chen, Bo Shen, Yong Yan, Sujoy Basu Moble and Meda Systems Laboratory HP Laboratores Palo Alto HPL-23-47 March th, 23* E-mal: sqchen@cs.wm.edu,

More information

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory

Virtual Memory. Background. No. 10. Virtual Memory: concept. Logical Memory Space (review) Demand Paging(1) Virtual Memory Background EECS. Operatng System Fundamentals No. Vrtual Memory Prof. Hu Jang Department of Electrcal Engneerng and Computer Scence, York Unversty Memory-management methods normally requres the entre process

More information

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

Meta-heuristics for Multidimensional Knapsack Problems

Meta-heuristics for Multidimensional Knapsack Problems 2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Dynamic Bandwidth Provisioning with Fairness and Revenue Considerations for Broadband Wireless Communication

Dynamic Bandwidth Provisioning with Fairness and Revenue Considerations for Broadband Wireless Communication Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the ICC 008 proceedngs. Dynamc Bandwdth Provsonng wth Farness and Revenue Consderatons

More information

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task

Term Weighting Classification System Using the Chi-square Statistic for the Classification Subtask at NTCIR-6 Patent Retrieval Task Proceedngs of NTCIR-6 Workshop Meetng, May 15-18, 2007, Tokyo, Japan Term Weghtng Classfcaton System Usng the Ch-square Statstc for the Classfcaton Subtask at NTCIR-6 Patent Retreval Task Kotaro Hashmoto

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation

Quality Improvement Algorithm for Tetrahedral Mesh Based on Optimal Delaunay Triangulation Intellgent Informaton Management, 013, 5, 191-195 Publshed Onlne November 013 (http://www.scrp.org/journal/m) http://dx.do.org/10.36/m.013.5601 Qualty Improvement Algorthm for Tetrahedral Mesh Based on

More information

Efficient Broadcast Disks Program Construction in Asymmetric Communication Environments

Efficient Broadcast Disks Program Construction in Asymmetric Communication Environments Effcent Broadcast Dsks Program Constructon n Asymmetrc Communcaton Envronments Eleftheros Takas, Stefanos Ougaroglou, Petros copoltds Department of Informatcs, Arstotle Unversty of Thessalonk Box 888,

More information

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research

Scheduling Remote Access to Scientific Instruments in Cyberinfrastructure for Education and Research Schedulng Remote Access to Scentfc Instruments n Cybernfrastructure for Educaton and Research Je Yn 1, Junwe Cao 2,3,*, Yuexuan Wang 4, Lanchen Lu 1,3 and Cheng Wu 1,3 1 Natonal CIMS Engneerng and Research

More information

Positive Semi-definite Programming Localization in Wireless Sensor Networks

Positive Semi-definite Programming Localization in Wireless Sensor Networks Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer

More information

Future Buffer based Adaptation for VBR Video Streaming over HTTP

Future Buffer based Adaptation for VBR Video Streaming over HTTP Future Buffer based Adaptation for VBR Video Streaming over HTTP Tuan Vu 1, Hung T. Le 2, Duc V. Nguyen 2, Nam Pham Ngoc 1, Truong Cong Thang 2 1 Hanoi University of Science and Technology, Hanoi, Vietnam

More information

Wightman. Mobility. Quick Reference Guide THIS SPACE INTENTIONALLY LEFT BLANK

Wightman. Mobility. Quick Reference Guide THIS SPACE INTENTIONALLY LEFT BLANK Wghtman Moblty Quck Reference Gude THIS SPACE INTENTIONALLY LEFT BLANK WIGHTMAN MOBILITY BASICS How to Set Up Your Vocemal 1. On your phone s dal screen, press and hold 1 to access your vocemal. If your

More information

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following.

Complex Numbers. Now we also saw that if a and b were both positive then ab = a b. For a second let s forget that restriction and do the following. Complex Numbers The last topc n ths secton s not really related to most of what we ve done n ths chapter, although t s somewhat related to the radcals secton as we wll see. We also won t need the materal

More information

Fast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems

Fast Retransmission of Real-Time Traffic in HIPERLAN/2 Systems Fast Retransmsson of Real-Tme Traffc n HIPERLAN/ Systems José A Afonso and Joaqum E Neves Department of Industral Electroncs Unversty of Mnho, Campus de Azurém 4800-058 Gumarães, Portugal {joseafonso,

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

End-to-end Distortion Estimation for RD-based Robust Delivery of Pre-compressed Video

End-to-end Distortion Estimation for RD-based Robust Delivery of Pre-compressed Video End-to-end Dstorton Estmaton for RD-based Robust Delvery of Pre-compressed Vdeo Ru Zhang, Shankar L. Regunathan and Kenneth Rose Department of Electrcal and Computer Engneerng Unversty of Calforna, Santa

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

Post-Streaming Rate Analysis - A New Approach to Mobile Video Streaming with Predictable Performance

Post-Streaming Rate Analysis - A New Approach to Mobile Video Streaming with Predictable Performance The fnal verson of record s avalable at http://dx.do.org/10.1109/tmc.2017.2694418 IEEE TRANSACTIONS ON MOBILE COMPUTING, MANUSCRIPT ID TMC-2016-05-0324 1 Post-Streamng Rate Analyss - A New Approach to

More information

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints

Sum of Linear and Fractional Multiobjective Programming Problem under Fuzzy Rules Constraints Australan Journal of Basc and Appled Scences, 2(4): 1204-1208, 2008 ISSN 1991-8178 Sum of Lnear and Fractonal Multobjectve Programmng Problem under Fuzzy Rules Constrants 1 2 Sanjay Jan and Kalash Lachhwan

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated. Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,

More information

UB at GeoCLEF Department of Geography Abstract

UB at GeoCLEF Department of Geography   Abstract UB at GeoCLEF 2006 Mguel E. Ruz (1), Stuart Shapro (2), June Abbas (1), Slva B. Southwck (1) and Davd Mark (3) State Unversty of New York at Buffalo (1) Department of Lbrary and Informaton Studes (2) Department

More information

Network-Driven Layered Multicast with IPv6

Network-Driven Layered Multicast with IPv6 Network-Drven Layered Multcast wth IPv6 Ho-pong Sze and Soung C. Lew Department of Informaton Engneerng, The Chnese Unversty of Hong Kong, Shatn, N.T., Hong Kong {hpsze8, soung}@e.cuhk.edu.hk Abstract.

More information

Distributed Middlebox Placement Based on Potential Game

Distributed Middlebox Placement Based on Potential Game Int. J. Communcatons, Network and System Scences, 2017, 10, 264-273 http://www.scrp.org/ournal/cns ISSN Onlne: 1913-3723 ISSN Prnt: 1913-3715 Dstrbuted Mddlebox Placement Based on Potental Game Yongwen

More information

Support Vector Machines

Support Vector Machines /9/207 MIST.6060 Busness Intellgence and Data Mnng What are Support Vector Machnes? Support Vector Machnes Support Vector Machnes (SVMs) are supervsed learnng technques that analyze data and recognze patterns.

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

Real-Time Guarantees. Traffic Characteristics. Flow Control

Real-Time Guarantees. Traffic Characteristics. Flow Control Real-Tme Guarantees Requrements on RT communcaton protocols: delay (response s) small jtter small throughput hgh error detecton at recever (and sender) small error detecton latency no thrashng under peak

More information

Learning-Based Top-N Selection Query Evaluation over Relational Databases

Learning-Based Top-N Selection Query Evaluation over Relational Databases Learnng-Based Top-N Selecton Query Evaluaton over Relatonal Databases Lang Zhu *, Wey Meng ** * School of Mathematcs and Computer Scence, Hebe Unversty, Baodng, Hebe 071002, Chna, zhu@mal.hbu.edu.cn **

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

Delay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks

Delay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks Appl. Math. Inf. Sc. 7, No. 2L, 467-474 2013) 467 Appled Mathematcs & Informaton Scences An Internatonal Journal http://dx.do.org/10.12785/ams/072l13 Delay Varaton Optmzed Traffc Allocaton Based on Network

More information

A Background Subtraction for a Vision-based User Interface *

A Background Subtraction for a Vision-based User Interface * A Background Subtracton for a Vson-based User Interface * Dongpyo Hong and Woontack Woo KJIST U-VR Lab. {dhon wwoo}@kjst.ac.kr Abstract In ths paper, we propose a robust and effcent background subtracton

More information

Application of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling

Application of Improved Fish Swarm Algorithm in Cloud Computing Resource Scheduling , pp.40-45 http://dx.do.org/10.14257/astl.2017.143.08 Applcaton of Improved Fsh Swarm Algorthm n Cloud Computng Resource Schedulng Yu Lu, Fangtao Lu School of Informaton Engneerng, Chongqng Vocatonal Insttute

More information

Performance Comparison of a QoS Aware Routing Protocol for Wireless Sensor Networks

Performance Comparison of a QoS Aware Routing Protocol for Wireless Sensor Networks Communcatons and Network, 2016, 8, 45-55 Publshed Onlne February 2016 n ScRes. http://www.scrp.org/journal/cn http://dx.do.org/10.4236/cn.2016.81006 Performance Comparson of a QoS Aware Routng Protocol

More information

Obstacle-Aware Routing Problem in. a Rectangular Mesh Network

Obstacle-Aware Routing Problem in. a Rectangular Mesh Network Appled Mathematcal Scences, Vol. 9, 015, no. 14, 653-663 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.1988/ams.015.411911 Obstacle-Aware Routng Problem n a Rectangular Mesh Network Norazah Adzhar Department

More information

ARTICLE IN PRESS. Signal Processing: Image Communication

ARTICLE IN PRESS. Signal Processing: Image Communication Sgnal Processng: Image Communcaton 23 (2008) 754 768 Contents lsts avalable at ScenceDrect Sgnal Processng: Image Communcaton journal homepage: www.elsever.com/locate/mage Dstrbuted meda rate allocaton

More information

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation

An Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed

More information

Priority-Based Scheduling Algorithm for Downlink Traffics in IEEE Networks

Priority-Based Scheduling Algorithm for Downlink Traffics in IEEE Networks Prorty-Based Schedulng Algorthm for Downlnk Traffcs n IEEE 80.6 Networks Ja-Mng Lang, Jen-Jee Chen, You-Chun Wang, Yu-Chee Tseng, and Bao-Shuh P. Ln Department of Computer Scence Natonal Chao-Tung Unversty,

More information

Fast Computation of Shortest Path for Visiting Segments in the Plane

Fast Computation of Shortest Path for Visiting Segments in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

IP Camera Configuration Software Instruction Manual

IP Camera Configuration Software Instruction Manual IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the

More information

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms

Course Introduction. Algorithm 8/31/2017. COSC 320 Advanced Data Structures and Algorithms. COSC 320 Advanced Data Structures and Algorithms Course Introducton Course Topcs Exams, abs, Proects A quc loo at a few algorthms 1 Advanced Data Structures and Algorthms Descrpton: We are gong to dscuss algorthm complexty analyss, algorthm desgn technques

More information

Security Vulnerabilities of an Enhanced Remote User Authentication Scheme

Security Vulnerabilities of an Enhanced Remote User Authentication Scheme Contemporary Engneerng Scences, Vol. 7, 2014, no. 26, 1475-1482 HIKARI Ltd, www.m-hkar.com http://dx.do.org/10.12988/ces.2014.49186 Securty Vulnerabltes of an Enhanced Remote User Authentcaton Scheme Hae-Soon

More information

AADL : about scheduling analysis

AADL : about scheduling analysis AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

Lecture 5: Multilayer Perceptrons

Lecture 5: Multilayer Perceptrons Lecture 5: Multlayer Perceptrons Roger Grosse 1 Introducton So far, we ve only talked about lnear models: lnear regresson and lnear bnary classfers. We noted that there are functons that can t be represented

More information

A Saturation Binary Neural Network for Crossbar Switching Problem

A Saturation Binary Neural Network for Crossbar Switching Problem A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com

More information

Avoiding congestion through dynamic load control

Avoiding congestion through dynamic load control Avodng congeston through dynamc load control Vasl Hnatyshn, Adarshpal S. Seth Department of Computer and Informaton Scences, Unversty of Delaware, Newark, DE 976 ABSTRACT The current best effort approach

More information

Performance Evaluation of Information Retrieval Systems

Performance Evaluation of Information Retrieval Systems Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence

More information

FAST TCP: Motivation, Architecture, Algorithms, Performance

FAST TCP: Motivation, Architecture, Algorithms, Performance FAST TCP: Motvaton, Archtecture, Algorthms, Performance Cheng Jn Davd X. We Steven H. Low Engneerng & Appled Scence, Caltech http://netlab.caltech.edu Abstract We descrbe FAST TCP, a new TCP congeston

More information

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and

More information

Design and Implementation of an Energy Efficient Multimedia Playback System

Design and Implementation of an Energy Efficient Multimedia Playback System Desgn and Implementaton of an Energy Effcent Multmeda Playback System Zhjan Lu, John Lach, Mrcea Stan, Kevn Skadron, Departments of Electrcal and Computer Engneerng and Computer Scence, Unversty of Vrgna

More information

Related-Mode Attacks on CTR Encryption Mode

Related-Mode Attacks on CTR Encryption Mode Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory

More information

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces

Range images. Range image registration. Examples of sampling patterns. Range images and range surfaces Range mages For many structured lght scanners, the range data forms a hghly regular pattern known as a range mage. he samplng pattern s determned by the specfc scanner. Range mage regstraton 1 Examples

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

A KIND OF ROUTING MODEL IN PEER-TO-PEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE

A KIND OF ROUTING MODEL IN PEER-TO-PEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE A KIND OF ROUTING MODEL IN PEER-TO-PEER NETWORK BASED ON SUCCESSFUL ACCESSING RATE 1 TAO LIU, 2 JI-JUN XU 1 College of Informaton Scence and Technology, Zhengzhou Normal Unversty, Chna 2 School of Mathematcs

More information

Advanced Computer Networks

Advanced Computer Networks Char of Network Archtectures and Servces Department of Informatcs Techncal Unversty of Munch Note: Durng the attendance check a stcker contanng a unque QR code wll be put on ths exam. Ths QR code contans

More information

CS 268: Lecture 8 Router Support for Congestion Control

CS 268: Lecture 8 Router Support for Congestion Control CS 268: Lecture 8 Router Support for Congeston Control Ion Stoca Computer Scence Dvson Department of Electrcal Engneerng and Computer Scences Unversty of Calforna, Berkeley Berkeley, CA 9472-1776 Router

More information

Enhanced AMBTC for Image Compression using Block Classification and Interpolation

Enhanced AMBTC for Image Compression using Block Classification and Interpolation Internatonal Journal of Computer Applcatons (0975 8887) Volume 5 No.0, August 0 Enhanced AMBTC for Image Compresson usng Block Classfcaton and Interpolaton S. Vmala Dept. of Comp. Scence Mother Teresa

More information

Instantaneous Fairness of TCP in Heterogeneous Traffic Wireless LAN Environments

Instantaneous Fairness of TCP in Heterogeneous Traffic Wireless LAN Environments KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS VOL. 10, NO. 8, Aug. 2016 3753 Copyrght c2016 KSII Instantaneous Farness of TCP n Heterogeneous Traffc Wreless LAN Envronments Young-Jn Jung 1 and

More information

An Optimal Bandwidth Allocation and Data Droppage Scheme for Differentiated Services in a Wireless Network

An Optimal Bandwidth Allocation and Data Droppage Scheme for Differentiated Services in a Wireless Network Purdue Unversty Purdue e-pubs ECE Techncal Reports Electrcal and Computer Engneerng 3--7 An Optmal Bandwdth Allocaton and Data Droppage Scheme for Dfferentated Servces n a Wreless Network Waseem Shekh

More information

Security Enhanced Dynamic ID based Remote User Authentication Scheme for Multi-Server Environments

Security Enhanced Dynamic ID based Remote User Authentication Scheme for Multi-Server Environments Internatonal Journal of u- and e- ervce, cence and Technology Vol8, o 7 0), pp7-6 http://dxdoorg/07/unesst087 ecurty Enhanced Dynamc ID based Remote ser Authentcaton cheme for ult-erver Envronments Jun-ub

More information

A fair buffer allocation scheme

A fair buffer allocation scheme A far buffer allocaton scheme Juha Henanen and Kalev Klkk Telecom Fnland P.O. Box 228, SF-330 Tampere, Fnland E-mal: juha.henanen@tele.f Abstract An approprate servce for data traffc n ATM networks requres

More information

IMPACT OF RADIO MAP SIMULATION ON POSITIONING IN INDOOR ENVIRONTMENT USING FINGER PRINTING ALGORITHMS

IMPACT OF RADIO MAP SIMULATION ON POSITIONING IN INDOOR ENVIRONTMENT USING FINGER PRINTING ALGORITHMS IMPACT OF RADIO MAP SIMULATION ON POSITIONING IN INDOOR ENVIRONTMENT USING FINGER PRINTING ALGORITHMS Jura Macha and Peter Brda Unversty of Zlna, Faculty of Electrcal Engneerng, Department of Telecommuncatons

More information

Combined Rate Control and Mode Decision Optimization for MPEG-2 Transcoding with Spatial Resolution Reduction

Combined Rate Control and Mode Decision Optimization for MPEG-2 Transcoding with Spatial Resolution Reduction MITSUBISHI ELECTRIC RESEARCH LABORATORIES http://www.merl.com Combned Rate Control and Mode Decson Optmzaton for MPEG-2 Transcodng wth Spatal Resoluton Reducton TR2003-7 December 2003 Abstract Ths paper

More information