Applications and Challenges of the e EDCA Mechanism: An Experimental Study
|
|
- Christina Bradford
- 5 years ago
- Views:
Transcription
1 Applcatons and Challenges of the 80.e EDCA Mechansm: An Expermental Study Albert Banchs, Arturo Azcorra, Carlos García, and Rubén Cuevas, Unversty Carlos III of Madrd Abstract In ths artcle we conduct an expermental study of the enhanced dstrbuted channel access mechansm of the upcomng 80.e standard. The man focus of the study s on two applcatons of EDCA: traffc engneerng and servce guarantees. Wth traffc engneerng we am at dstrbutng the bandwdth n the WLAN accordng to a gven throughput allocaton crteron. Wth servce guarantees the objectve s to ensure that the performance metrcs (throughput and delay) experenced by a staton meet a gven qualty crteron. We buld a testbed wth wreless cards that support a substantal subset of the EDCA functonalty and analyze performance aganst dfferent sets of requrements. Expermental results show that EDCA can effectvely be used for traffc engneerng purposes. The goal of provdng servce guarantees wth EDCA s shown to be more challengng; we dentfy future research drectons that need to be addressed n order to acheve ths goal. I n recent years, much nterest has been devoted to the desgn of wreless local area networks (WLANs) wth qualty of servce (QoS) support. The Enhancements Task Group (TGe) was formed under the IEEE 80. project to recommend an nternatonal WLAN standard wth QoS. Ths standard s called 80.e and s beng bult as an extenson of the basc WLAN 80. standard. Whle the standardzaton process of 80.e s stll an ongong effort, the man features of the upcomng standard have already been agreed upon and are unlkely to change. These features are descrbed n the latest verson of the 80.e standard draft []. The standard draft defnes two dfferent access mechansms: the enhanced dstrbuted channel access (EDCA) and hybrd coordnaton functon (HCF) controlled channel access (HCCA). EDCA s a dstrbuted scheme that extends the dstrbuted coordnaton functon (DCF) of 80., whle HCCA s centralzed. Recently, some commercal WLAN products that mplement (to a certan extent) the EDCA mechansm have become avalable. The product roadmap for HCCA s less clear. The focus of the present artcle s on an expermental analyss of the EDCA mechansm wth a real-lfe testbed. To date, a consderable amount of work has been addressed to analyze the performance of ths mechansm (e.g., []); however, to the authors knowledge, all prevous work n the lterature was based on smulatons and/or analyss; none nvestgates the performance of EDCA expermentally. It s well known from The work descrbed n ths artcle s based on results of IST FP6 Integrated Project DAIDALOS. DAIDALOS receves research fundng from the European Communty s Sxth Framework Program. Apart from ths, the European Commsson has no responsblty for the content of ths artcle. expermental studes wth DCF [3, ] that WLANs suffer from a number of nondeal effects that have nonneglgble mpact on performance and are not accounted for n analytcal and smulaton studes. Therefore, experences wth real-lfe experments are needed n order to complement prevous theoretcal studes of EDCA and assess ts real performance. The methodology used n ths artcle to perform the expermental analyss of EDCA s the followng. We consder two wdely accepted applcatons of a QoS archtecture for WLAN, traffc engneerng and servce guarantees, and evaluate how well the requrements of these applcatons are satsfed by our EDCA testbed. The artcle s structured as follows. We frst revew the EDCA mechansm of the 80.e standard draft. Then we descrbe our testbed setup and dscuss some ntal expermental results that gve an understandng of the varous effects observed n the testbed. Next, we take up the ssue of traffc engneerng wth EDCA and study the performance of two dfferent traffc engneerng crtera (symmetrc traffc allocaton and olympc servce model). We then address the provsonng of servce guarantees wth EDCA and outlne some possble future drectons of research n ths context. Fnally, we summarze the results of our work. 80.e EDCA We now brefly summarze the EDCA mechansm as defned n the latest verson of the 80.e standard draft. For a complete descrpton of the EDCA and HCCA mechansms of 80.e, the reader s referred to the standard draft []. EDCA controls the access to the wreless channel on the bass of the channel access functons (CAFs). A staton may run up to four CAFs, wth the frames generated by the staton mapped to one of these CAFs. Each CAF executes an ndependent backoff process to determne the tme of transms /05/$ IEEE
2 son of ts frames. The backoff process s regulated by four confgurable parameters: CW mn, CW max, AIFS, and TXOP lmt. A CAF wth a new frame to transmt montors the channel actvty. If the channel s dle for a perod of tme equal to ts arbtraton nterframe space (AIFS ) parameter, the CAF transmts. Otherwse, f the channel s sensed busy (ether mmedately or durng the AIFS perod), the CAF contnues to montor the channel untl t s measured dle for an AIFS tme. At ths pont, the CAF starts the backoff process by ntalzng ts backoff tme counter to a random value unformly dstrbuted n the range (0, CW ), where CW s the contenton wndow of CAF and depends on the number of faled transmssons. At the frst transmsson attempt, CW s set equal to the mnmum contenton wndow parameter (CW mn ). As long as the channel s sensed dle the backoff tme counter s decremented once every slot tme, where the slot tme duraton (hereafter denoted σ) s a constant defned by the physcal layer. When a transmsson s detected on the channel, the backoff tme counter s frozen, and reactvated agan when the channel s sensed dle for a certan perod. Ths perod s equal to AIFS f the transmsson s receved wth a correct CRC, AND EIFS DIFS + AIFS otherwse, where the extended nterframe space (EIFS) and DCF nterframe space (DIFS) are physcal layer constants. As soon as the backoff tme counter reaches zero, the CAF transmts ts frame n the next slot tme. A collson occurs when two or more CAFs start transmsson smultaneously. In the case of a sngle staton runnng more than one CAF, f the backoff tme counter of two or more CAFs of the staton reach zero at the same tme, a scheduler nsde the staton avods an nternal collson by grantng the channel access to the hghest-prorty CAF. An acknowledgment (ACK) frame s used to notfy the transmttng CAF that the frame has been successfully receved. The ACK s transmtted at the end of the frame after a perod of tme equal to the physcal layer constant short nterframe space (SIFS). If the ACK s not receved wthn a specfed ACK tmeout, the CAF assumes that the transmtted frame was not receved successfully and schedules a retransmsson by reenterng the backoff process. After each unsuccessful transmsson, CW s doubled, up to a maxmum value gven by the CW max parameter. After a successful transmsson, the CAF s allowed to transmt several consecutve frames, the only restrcton beng that t cannot occupy the channel for a perod of tme longer than the transmsson opportunty lmt parameter (TXOP lmt ). In WLANs, the erroneous recepton of a frame may be caused by ether: A collson (.e., two statons transmt smultaneously and thus nterfere wth each other) The nherent nose and nterference of the rado lnk The 80. a/b/g standards tackle the latter by offerng varous modulaton schemes (wth dfferent bt rates and robustness to errors) and usng the one that adapts best to the characterstcs of the rado channel. Specfcally, 80.b (whch s the focus of our experments) reduces the channel bt rate from Mb/s (the nomnal value) to ether 5.5,, or Mb/s dependng on the number of detected errors. The frst cause of erroneous recepton, a collson between two frames, does not always produce an error. On some occasons, the frame receved wth the strongest sgnal survves the collson and s All statons check every receved frame (regardless of ts destnaton) for errors, usng the cyclc redundancy check (CRC) feld of the frame. captured by the recevng staton. Ths s the so-called capture effect. Expermental Setup Although the 80.e standard has not yet been fnalzed, there already are some commercal wreless cards that partally support EDCA. Our experments are conducted wth 80.b wreless cards based on the Atheros AR5 chpsets. The MADWIFI drver provdes full support for wreless adapters usng Atheros chpsets on Lnux platforms. Atheros based cards mplement a substantal subset of EDCA, but also suffer from some restrctons. Out of the parameters defned n the standard draft (CW mn, CW max, AIFS and TXOP lmt), only the frst 3 are supported. In addton, only one CAF per staton s mplemented, nstead of the defned n the standard draft. We beleve, however, that these restrctons do not represent a major lmtaton for our work. Indeed, the multple CAFs per staton feature s not needed for the applcatons we target, whle the TXOP lmt provdes a level of dfferentaton smlar to the CW mn [5]. The confguraton of the CW mn, CW max and AIFS parameters s performed wth some functons that the MADWIFI drver provdes for ths purpose. Specfcally, these functons allow confgurng each wreless card wth three nteger values,, j and k, wth whch the CW mn, CWmax and AIFS parameters of the wreless card are set as follows: CW mn = CW default mn, () CW max = CW default max j, and () AIFS = DIFS + kσ, (3) where CW default mn = 3 and CW default max = 0 correspond to the default values of the DCF mechansm of the 80.b standard. Note that the above restrcts the possble CW mn and CW max values to the ntegers power of. To perform our experments we bult a testbed composed of four desktop PCs under Lnux equpped wth Atherosbased wreless cards. One PC was confgured as the access pont (AP) and the others as statons under the nfrastructure mode; n the rest of the artcle we refer to them as statons,, and 3. Unless otherwse stated, experments were performed wth the four PCs located n the same room at a dstance rangng from to m from each other. Except for the voce applcaton used n the experment of Fg. 6, traffc was generated wth the perf 3 tool sendng (TCP or UDP) 000- byte packets. The expermental results gven are the average of fve runs of 60 s duraton each. In most cases, the dfference between the maxmum and mnmum results of the fve runs falls below 5 percent. In order to gan understandng of the nondealtes of our testbed, we conducted a frst set of experments. Frst, by saturatng the wreless channel wth only one staton sendng UDP traffc, we determned that the throughput obtaned s ndependent of the staton s locaton. Ths shows that wthn the range of dstances n our testbed all PCs work at the nomnal bt rate of 80.b ( Mb/s), and error rates are neglgble. By saturatng the channel wth two statons located at the Multband Atheros Drver for WFI (MADWIFI) conssts of the followng modules: hal, f_ath, and ath_pc. Our work was performed wth hal v. 0.8., f_ath v , and ath_pc v New versons of these modules wth extended functonalty are currently beng developed. See
3 r /r (CW) n Fgure. CW mn and AIFS parameters. same (about m) and dfferent ( and m) dstances from the AP, respectvely, and observng that the AP only detected errors n the former case, we found that the capture effect occurs wthn the range of dstances of our testbed. Furthermore, by comparng the results of the latter experment aganst the analytcal model of [6] for the capture effect, we concluded that ths s the man cause of the devatons observed n our expermental results. EDCA for Traffc Engneerng A r /r (CW) 50 r /r (AIFS) CW mn /CW mn One of the possble applcatons of 80.e EDCA s traffc engneerng. Wth traffc engneerng we am at (by settng approprately the EDCA parameters of the statons) dstrbutng the throughput of the WLAN accordng to a traffc engneerng crteron. We now study the effectveness of EDCA for ths purpose, takng as an example two dfferent traffc engneerng crtera: the symmetrc traffc allocaton and the olympc servce model. We frst propose some confguraton gudelnes of EDCA for traffc engneerng. Next, we assess how well EDCA confgured wth these gudelnes meets the performance goals of the two consdered crtera under UDP traffc. Then we take one of the two crtera, the symmetrc traffc allocaton, and study ts performance under TCP traffc. Fnally, we study, also wth the symmetrc traffc allocaton crteron, the mpact of heterogeneous rado condtons on traffc engneerng. Parameter Confguraton for Traffc Engneerng Most traffc engneerng crtera (n partcular the ones we use as examples here) are based on weghts. Wth these crtera, dfferent statons get assgned dfferent weghts; the goal s to provde them wth a throughput proportonal to the weght. In order to assess whch of the EDCA parameters (CW and AIFS) satsfes the above goal better, we conducted the followng experment. We saturated two statons wth UDP traffc and studed the rato of throughputs (r /r ) when we ncreased, respectvely, the CW mn and AIFS of the second staton (CW mn and AIFS = DIFS + A σ), whle leavng all the other parameters at ther default value. The results, depcted n Fg., show a lnear relatonshp between r /r and CW mn /CW mn, and an exponental one between r /r and AIFS, whch matches the analyss and smulatons of []. From the above we conclude that the CW mn parameter s the most approprate for provdng a staton wth throughput proportonal to ts weght. Specfcally, results show that the throughput obtaned s approxmately nversely proportonal r /r (AIFS) to the CW mn. Followng ths, we confgured the parameters of staton accordng to the followng formulae: AIFS = DIFS, () CW mn CW max = CW default mn round_power(w max /w ), and (5) = CW default max round_power(w max /w ), (6) where w s the weght assgned to staton, w max s the hghest weght n the WLAN, and round_power(x) s the nteger power of closest to x: log ( x), log ( x) x round _ power( x) = log ( x) x. (7) log ( x), otherwse Note that wth the above confguraton the staton wth the hghest weght n the WLAN uses the default CW values (.e., CW default mn and CW default max ), whle the remanng statons use hgher values. Ths ensures that effcency s not degraded due to low CW values yeldng an unacceptably hgh collson rate. In addton, the number of steps between CW mn and CW max s kept equal to the default value for all statons; ths s done n order to preserve the good features of the exponental backoff ncrease algorthm. Fnally, the round_power functon s ntroduced because of the restrcton mposed by the wreless cards that CWs have to be a power of. Symmetrc Traffc Allocaton wth UDP Traffc Throughput n DCF s dstrbuted farly among all contendng statons, n the sense that all statons wth traffc to send are allocated the same throughput. Whle at frst glance ths crteron may seem reasonable, a closer look at the throughput dstrbuton of a WLAN workng n the nfrastructure mode reveals that, as ponted out n [3], ths dstrbuton may be undesrable from a traffc engneerng vewpont. In the nfrastructure mode, statons only send and receve packets from the AP. Therefore, the relevant traffc engneerng parameters n ths case are the rate at whch the statons can send packets (hereafter called the upstream throughput) and the rate at whch the statons can receve (the downstream throughput). Wth the far dstrbuton of DCF, the AP, whch behaves n the same way as any other staton as far as the contenton algorthm s concerned, s allocated the same throughput for sendng packets as any other staton. As a result, the sum of all downstream throughputs n the WLAN s equal to one sngle upstream throughput. In other words, f there are N statons n the WLAN, each staton s allocated N tmes more throughput for upstream than for downstream traffc. A more reasonable throughput allocaton may be to allocate the same throughputs for upstream and downstream traffc (to whch we refer as symmetrc traffc allocaton). A typcal scenaro n whch ths allocaton would be desrable s a WLAN wth all statons holdng bdrectonal voce over IP (VoIP) conversatons. Note that to acheve ths allocaton we need to provde the AP wth a throughput N tmes larger than any other staton, N beng the number of statons n the WLAN. 5 Whle there are other proposals for confguraton of the EDCA parameters (e.g., [7]), one of the advantages of the confguraton proposed here s ts smplcty. 5 In a dynamc envronment, the number of actve statons n the WLAN can be obtaned, for example, by cachng the MAC address of the statons that have transmtted packets recently; ths functonalty s provded by the Wreless Tools ( Lnux/Tools.html). 5
4 Downstream Upstream Throughput (kb/s) nternal Weghted Far Queung (WFQ) scheduler at the AP n order to dstrbute the downstream throughput among the competng flows proportonal to ther weghts. Fgure 3 llustrates the throughput allocatons resultng from the above confguraton wth the three statons saturatng both the upstream and downstream drectons wth UDP traffc. Results confrm the effectveness of EDCA to mplement the OSM; upstream and downstream throughputs are approxmately proportonal to the weghts. Downstream throughputs are about 30 percent larger than upstream; ths s a consequence of the asymmetry n the capture effect dscussed for the prevous experment as well as the error ntroduced by the roundng operaton of Eq. 7. Staton Staton Staton 3 DCF EDCA n Fgure. Symmetrc traffc allocaton wth UDP traffc. To study the effectveness of EDCA n provdng symmetrc throughput allocaton, we saturated the upstream and downstream drectons of three statons wth UDP traffc and examned the resultng throughput allocaton for DCF and EDCA. Results for DCF were obtaned usng the default confguraton. The EDCA confguraton was derved from the formulae gven n Eqs. 6 wth weght w AP = 3 for the AP and weght w STA = for the statons. Results are llustrated n Fg.. We observe that, as expected, DCF allocates approxmately three tmes more throughput to upstream than to downstream, whle, n contrast, our EDCA confguraton behaves much better accordng to the symmetrc traffc allocaton objectve. It s worthwhle to observe that n both the DCF and EDCA results, the AP receves throughput approxmately 0 percent hgher than expected wth the respectve confguratons. Note that f a staton and the AP collde, the staton s transmsson wll surely result n a falure, as the destnaton of the transmsson (the AP) s not n lsten mode. In contrast, there s some probablty that the AP transmsson results n success as a consequence of the capture effect. Ths asymmetry n the capture effect explans why n all our experments the AP s always favored over the statons. Olympc Servce Model wth UDP Traffc Wth the olympc servce model (OSM) [8] users are classfed n three categores (gold, slver, and bronze), and each category s mapped to a weght (w gold > w slver > w bronze ). Then a gold user s allocated throughput proportonal to w gold, a slver user throughput proportonal to w slver and a bronze user throughput proportonal to w bronze. Ths allocaton would be the desrable one for, say, a gold user holdng a vdeoconference wth hgh-rate vdeo, a slver user holdng a low-rate vdeoconference, and a bronze user holdng an audoconference. To study the effectveness of EDCA to provde the OSM, we took w gold =, w slver =, w bronze =, wth one staton for each category, and amed to provde each staton wth balanced downstream and upstream throughputs, both proportonal to the weght of the staton s category. For ths purpose we confgured EDCA wth the formulae gven n Eqs. 6, each staton wth the weght of ts category and the AP wth a weght equal to w AP = w gold + w slver + w bronze (.e., the sum of the weghts of all statons). In addton, we confgured an Staton Staton Staton 3 Traffc Engneerng wth TCP Traffc Traffc engneerng for TCP traffc becomes more challengng as a consequence of the well-known nteractons wth the congeston control algorthm of TCP and the presence of TCP ACKs 6 [3]. In order to gan nsght nto the mpact of TCP on throughput dstrbuton, we repeated the symmetrc trafc allocaton experement of Fg. wth each staton runnng n longlved TCP flows n both upstream and downstream drectons. Experments were performed wth both the default output queue buffer sze n all PCs (B = 99 packets) and (followng the recommendatons of [3]) an output queue buffer sze of B AP = NB at the AP, N beng the number of statons n the WLAN (n our case N = 3). Fgure shows the rato of upstream and downstream throughputs resultng from the above scenaro for DCF and EDCA and the two buffer confguratons. Accordng to our objectve of a symmetrc traffc allocaton, ths rato should deally be equal to. Results show substantal dfferences wth the allocaton obtaned for UDP traffc n Fg.. For n =, TCP balances the throughput obtaned by all flows ndependently of the EDCA parameters and buffer confguraton. For 6 Note that throughput n EDCA s regulated by controllng the number of tmes a staton accesses the channel, and from ths perspectve, a TPC ACK counts as much as any other packet ndependent of ts sze. Trhoughput (kb/s) Gold Slver 35 5 Bronze Downstream Upstream n Fgure 3. Olympc servce model wth UDP traffc. 55
5 r up /r down DCF DCF, B AP = NB EDCA EDCA, B AP = NB 3 5 n n Fgure. Symmetrc traffc allocaton wth TCP traffc. a larger number of flows, the dstrbuton becomes unbalanced wth DCF, whle wth EDCA (both when B AP = B and B AP = NB) the ratos keep relatvely close to. We conclude that the confguraton of EDCA parameters s also useful wth TCP traffc to keep the throughput dstrbuton close to the desred allocaton. We beleve, however, that more extensve studes are needed to better understand the nteractons between TCP and EDCA. Traffc Engneerng Under Heterogeneous Rado Condtons The fact that throughputs n WLAN depend on rado condtons poses an addtonal challenge to traffc engneerng. Rado condtons may mpact the throughput of a staton n 80.b WLAN n the followng ways: Dfferences n the receve power of two statons may yeld the capture effect. Some degradaton of the rado lnk may yeld occasonal transmsson errors. A severe degradaton of the rado lnk yelds frequent transmsson errors, whch trggers the selecton of a new modulaton scheme more robust to errors and wth a lower transmsson bt rate. In order to llustrate the mpact of rado condtons on throughput, we repeated the symmetrc traffc allocaton experment of Fg. wth two statons sendng UDP traffc upstream, the frst staton placed close ( m) to the AP and the second one placed n the followng locatons: At a dstance from the AP smlar to the frst staton ( m) At a longer dstance ( m) but stll wth a good rado lnk Outsde the room, where the bt rate remans at Mb/s At about 00 m, where the transmsson bt rate decreases to Mb/s Results of the total throughput n the WLAN (r) and the rato of throughputs (r /r ) as a functon of the locaton of the second staton are gven n Fg. 5. We observe that n poston both statons obtan approxmately the same throughput. In poston, the capture effect leads to the frst staton obtanng greater throughput (about 0 percent more) than the second staton. In poston 3 transmsson errors occur, whch slghtly degrade the throughput of the second staton and the total throughput; however, the mpact s almost mperceptble. Fnally, n poston the total throughput s drastcally degraded as a result of the second staton transmttng at a lower bt rate, but the rato of throughputs does not change. We conclude from the results that rado condtons have lttle mpact on the rato of throughputs; ndeed, n our experments the rato s always close to, whch s the deal value accordng to the symmetrc traffc allocaton crteron. Another concluson drawn from the results s that when a staton decreases ts transmsson bt rate (poston ), although the ratos are preserved, the throughputs of all the statons n the WLAN are sharply degraded. Indeed, f a gven staton transmts at a lower bt rate, each tme t accesses the channel t occupes t for a longer perod; therefore, less channel tme s avalable for other statons. Ths behavor s studed n detal n []. EDCA for Servce Guarantees We now address the ssue of provdng servce guarantees wth EDCA and analyze the challenges that stll have to be solved n order to reach ths goal. To support the explanatons provded here, we performed a number of experments (Fg. 6) whose setup s descrbed n the followng paragraphs. In experment, staton and the AP held a bdrectonal voce conversaton usng the GnomeMeetng 7 tool, whch measures the round-trp delay. Statons and 3 sent background data traffc of 000-byte packets at a rate of r background. In order to saturate the channel, statons were manually confgured at a low transmsson bt rate; specfcally, the AP and statons and were confgured at a bt rate of Mb/s, and staton 3 at a bt rate of Mb/s. All statons had the default confguraton (.e. the one of DCF). We measured the voce traffc round-trp delay as a functon of the background statons sendng rate, and consdered (as an example of qualty crteron) that voce performance s acceptable as long as ths delay falls below 50 ms (ths s represented by the horzontal straght lne n Fg. 6). In experment we repeated the above setup but usng EDCA. Followng the results of Fg., whch show that the AIFS parameter s more approprate for provdng strct prortes, we confgured real-tme statons wth the mnmum AIFS allowed by the standard draft (AIFS = DIFS) and background statons wth the maxmum allowed AIFS (AIFS = DIFS In the recommendatons gven by the standard draft, real-tme and background statons are also confgured wth dfferent CW mn and CW max parameters. In ths artcle we restrct our analyss to only one parameter for smplcty. r /r Locaton of the second staton n Fgure 5. Heterogeneous rado condtons. r /r r + r r(mb/s) 56
6 Delay real-tme (ms) Experment Experment Experment 3 Experment r background (kb/s) EDCA analyses are restrcted to average delay []. Even for DCF, analyses of the delay dstrbuton are lmted (e.g., the analyss of [0] s restrcted to saturaton condtons). Algorthms to derve the optmal confguraton. The EDCA confguraton proposed here as well as the one gven by the standard draft recommendatons s derved heurstcally and guarantees no optmzed performance. Instead, t would be desrable to use the optmal EDCA confguraton (.e., the confguraton that, gven a set of requests and requrements, provdes the best possble performance). Exstng algorthms to compute the optmal EDCA confguraton [7] are restrcted to saturaton condtons and throughput, and do not serve the purpose of provdng real-tme applcatons wth servce guarantees. n Fgure 6. Experments wth real-tme traffc. 3σ), and left the other parameters at ther default values. 8 In experments 3 and we repeated experment ntroducng the followng varatons. In experment 3, the bt rate of staton 3 was reduced to Mb/s. In experment, staton was moved about m further from the AP than the other statons, such that the lnk qualty was stll good but not as good as the others. Analyss and Algorthms: Future Drectons The provsonng of servce guarantees wth EDCA requres the development of a theoretcal bass that s not yet complete. Indeed, QoS archtectures for wred lnks such as ntegrated servces (IntServ) and dfferentated servces (DffServ) rely on analyses (e.g., [9]) that allow performance predctons and can be used to guarantee QoS va an admsson control algorthm: f acceptng a new request would degrade the performance of admtted requests below the guaranteed metrcs, the algorthm rejects the new request. The development of these analyses and algorthms for EDCA s one of the research challenges that reman yet to be addressed before ths mechansm can be used for provdng servce guarantees. Let us look at experment of the above set. Gven the condtons of the experment and the requrement that the round-trp delay for the voce applcatons cannot be greater than 50 ms, the maxmum sendng rate that can be admtted for the background statons s 00 kb/s. Ths value s hgher than that obtaned wth DCF (experment ), where the maxmum admssble sendng rate s 00 kb/s. Nonetheless, an algorthm s stll needed n EDCA n order to derve the maxmum admssble sendng rate and perform admsson control accordngly. In the last years consderable effort has been dedcated to analyze the theoretcal performance of EDCA; however, there stll exst a number of gaps that need to be flled before analyss can be used to provde servce guarantees. In the followng we outlne future research drectons to fll these gaps: Analyses wth realstc source models. Present analyses of EDCA are restrcted to the unrealstc case of saturated sources (.e., they assume that all statons always have packets to transmt, e.g., []). Even for DCF (the basc mechansm that EDCA extends), although there are some analyses that consder nonsaturaton condtons, no complete analyses wth realstc source models exst (e.g., [5] s restrcted to Posson arrvals). Analyses of the end-to-end delay dstrbuton. Real-tme applcatons need not only a low average delay but also a low delay for most of ther packets, whch requres the computaton of the end-to-end delay dstrbuton. Exstng Inherent Uncertantes wth Moblty: A New Concept for Admsson Control Most of the analyses referenced above assume that all statons transmt at the nomnal bt rate ( Mb/s) under deal condtons (no transmsson errors and no capture effect). These nondeal aspects, as shown by experments 3 and, strongly mpact performance and therefore must be taken nto account to provde servce guarantees. Although there are some analyses that account for the above aspects (e.g., [] provdes an analyss for heterogeneous transmsson bt rates and errors, and [6] provdes an analyss for the capture effect), these analyses requre the knowledge of some data (e.g., the receve power) that s not always easy to obtan. In fact, the receve power depends not only on the transmt power and dstance, but also on some addtonal effects lke fadng that are not easy to derve. Under statc condtons (e.g., a company network based on WLAN where the statons are n fxed locatons), t may be concevable to obtan, from the locaton of each staton and the measured qualty of the correspondng rado lnk, the data necessary to evaluate the mpact of the above aspects and use ths data n the analyses and algorthms that provde servce guarantees. The goal of provdng servce guarantees, however, becomes more challengng when consderng a moble envronment, n whch rado condtons vary wth tme. The problem n ths case arses from the fact that the condtons that yeld a gven admsson control decson at one pont may not hold after some tme. Ths can be seen n the experments of Fg. 6: under the condtons of experment, background statons wth a sendng rate of 00 kb/s may be admtted. However, f the transmsson bt rate of the second background staton s reduced to Mb/s (experment 3) or the real-tme staton moves a bt further (experment ), the performance goals are no longer met, and the admsson control decson needs to be reevaluated. We conclude that under moblty condtons a new concept for admsson control s requred that constantly montors the channel condtons and reevaluates admsson control decsons. Such an algorthm s a subject of future research. Conclusons In ths artcle we have nvestgated the ablty of the EDCA mechansm to satsfy, n a real envronment, the requrements of two of the applcatons for whch ths protocol was desgned: traffc engneerng and servce guarantees. The nvestgaton was performed based on real-lfe experments that have gven us nsght nto a number of aspects not typcally shown by smulatons and analyses. Results for traffc engneerng show that ths applcaton s 57
7 well supported by EDCA when only UDP traffc s present n the WLAN. For the two traffc engneerng crtera studed (symmetrc traffc allocaton and olympc servce model) the results obtaned match, wth reasonable accuracy, the desred allocatons. Only some small devatons are observed because of the capture effect and the restrcton that CW values must be set to nteger powers of. Results wth TCP are promsng; although the nteracton between the TCP congeston control and the EDCA mechansm causes some devatons from the desred allocatons, the throughput dstrbutons we have obtaned are farly good and much better than the ones obtaned wth DCF. Experments under heterogeneous rado condtons reveal that transmsson errors and the capture effect have a small nfluence, whle the statons bt rates have a much stronger mpact on traffc engneerng. The other applcaton we have analyzed, servce guarantees, s much harder to satsfy. A substantal amount of theoretcal work stll needs to be developed before ths applcaton can be mplemented wth EDCA. Ths theoretcal work ncludes analyses under nonsaturaton condtons, analyses of the dstrbuton of the end-to-end delay, and algorthms to determne the optmal EDCA confguraton. In addton, our experments show that the nherent uncertantes of a moble envronment represent a major challenge for servce guarantees. In order to tackle ths problem, we propose the desgn of a new concept for admsson control that constantly montors the WLAN condtons and reacts to changng condtons. As a fnal concluson, we beleve that the expermental results reported n ths artcle show that the EDCA mechansm has many useful applcatons that would not be possble to satsfy wth the legacy DCF protocol, but there are stll some challenges that need to be addressed before EDCA can meet all the desgn goals for whch t was orgnally conceved. Acknowledgments The authors would lke to thank José Félx Kukelka, Chrstos Doulgers, and anonymous referees for ther nsghtful comments on earler versons of ths artcle. References [] IEEE 80.e/D3.0, Part, Wreless LAN Medum Access Control (MAC) and Physcal Layer (PHY) specfcatons: Medum Access Control (MAC) Enhancements for Qualty of Servce (QoS), draft supp. to IEEE 80. std., Jan [] Z. Kong et al., Performance Analyss of IEEE 80.e Contenton-Based Channel Access, IEEE JSAC, vol., no. 0, Dec. 00, pp [3] S. Plosof et al., Understandng TCP farness over Wreless LAN, Proc. IEEE INFOCOM 03, Mar. 003, pp [] M. Heusse et al., Performance anomaly of 80.b, Proc. IEEE INFOCOM 03, Mar. 003, pp [5] G. R. Canten et al., Performance Analyss under Fnte Load and Improvements for Multrate 80., to appear, Elsever Comp. Commun. [6] R. Ltjens et al., Performance Analyss of Wreless LANs: An Integrated Packet/Flow Level Approach, Proc. 8th Int l. Teletraffc Cong., Sept. 003, pp [7] A. Banchs, X. Perez, and D. Qao, Provdng Throughput Guarantees n IEEE 80.e Wreless LANs, Proc. 8th Int l. Teletraffc Cong., Sept. 003, pp [8] C. Dovrols and P. Ramanathan, A Case for Relatve Dfferentated Servces and the Proportonal Dfferentaton Model, IEEE Network, vol. 3, no. 5, Sept. 999, pp [9] J. C. R. Bennett et al., Delay Jtter Bounds and Packet Scale Rate Guarantee for Expedted Forwardng, IEEE/ACM Trans. Net., vol. 0, no., Aug. 00, pp [0] A. Banchs, Analyss of the Delay Dstrbuton n 80. DCF: A Step Towards Delay Guarantees n WLANs, LNCS, vol. 366, Sept. 00, pp [] H. Pan, S. Sato, and K. Kobayash, On the Throughput of an IEEE 80.a Wreless LAN System wth Termnals under Heterogeneous Rado Condtons, Proc. 8th Int l. Teletraffc Cong., Sept. 003, pp Bographes ALBERT BANCHS [M] (banchs@t.uc3m.es) receved hs M.Sc. and Ph.D. degrees n telecommuncatons from the Techncal Unversty of Catalona n 997 and 00, respectvely. Hs Ph.D. receved the natonal award for best thess on broadband networks granted by the Professonal Assocaton of Telecommuncaton Engneers. He worked for the Internatonal Computer Scence Insttute n 997, for Telefonca I+D n 998, and for NEC Network Laboratores from 998 to 003. Snce 003 he s wth Unversty Carlos III, Madrd. Hs current research nterests nclude resource allocaton, QoS, and performance evaluaton of wreless and wred networks. ARTURO AZCORRA [SM] (azcorra@t.uc3m.es) receved an M.Sc. degree n telecommuncatons from the Techncal Unversty of Madrd n 986, and a Ph.D. degree from the same unversty n 989. Hs Ph.D. receved the natonal award for best thess, jontly granted by the Professonal Assocaton of Telecommuncaton Engneers and the Natonal Assocaton of Electronc Industres. In 993 he obtaned an M.B.A. from Insttuto de Empresa. He was a lecturer at the Techncal Unversty of Madrd from 987 to 990, when he was promoted to assocate professor. In 998 he joned Unversty Carlos III, Madrd, where he has stayed to the present as a full professor. Snce 998 he s also Deputy Vce- Provost for Academc Infrastructures at Unversty Carlos III. He has been program commttee member of several edtons of IEEE PROMS, IDMS, QofIS, CONEXT, and IEEE INFOCOM. He s general co-char for CONEXT 05 and TPC co-char for INFOCOM 06. Hs lst of papers publshed n natonal and nternatonal journals, books, and conferences s over 00 ttles. Current research projects nclude broadband networks, multcast teleservces, actve networks, and advanced IP networks. CARLOS GARCI A (cgg@t.uc3m.es) receved an M.Sc. degree n telecommuncatons from Unversty Carlos III, Madrd, n 00. Hs M.Sc. thess receved the award for best thess granted by the Nortel Networks Char. He s currently a Ph.D. student and lecturer at Unversty Carlos III. Hs research nterests are QoS provson n G networks and IP over DWDM network deployment. RUBÉN CUEVAS (rcuevas@nv.t.uc3m.es) s pursung hs M.Sc. degree n telecommuncatons at Unversty Carlos III. In 00 he receved a scholarshp from Telefonca I+D to work on VPN applcatons. Snce 00 he s nvolved n the development of a QoS management platform for wreless networks as part of hs M.Sc. thess. 58
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 informationRAP. Speed/RAP/CODA. Real-time Systems. Modeling the sensor networks. Real-time Systems. Modeling the sensor networks. Real-time systems:
Speed/RAP/CODA Presented by Octav Chpara Real-tme Systems Many wreless sensor network applcatons requre real-tme support Survellance and trackng Border patrol Fre fghtng Real-tme systems: Hard real-tme:
More informationSimulation Based Analysis of FAST TCP using OMNET++
Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months
More informationVoice capacity of IEEE b WLANs
Voce capacty of IEEE 82.b WLANs D. S. Amanatads, V. Vtsas, A. Mantsars 2, I. Mavrds 2, P. Chatzmsos and A.C. Boucouvalas 3 Abstract-There s a tremendous growth n the deployment and usage of Wreless Local
More informationInterclass Collision Protection for IEEE e Wireless LANs
Interclass Collson Protecton for IEEE 82.e Wreless LANs Woon Sun Cho, Chae Y. Lee Dstrbuted Coordnaton Functon (DCF) n IEEE 82. and Enhanced Dstrbuted Channel Access (EDCA) n IEEE 82.e are contenton-based
More informationUSER CLASS BASED QoS DIFFERENTIATION IN e WLAN
USER CLASS BASED QoS DIFFERENTIATION IN 802.11e WLAN Amt Kejrwal, Ratan Guha School of Computer Scence Unversty of Central Florda Orlando, FL-32816 USA E-mal: {kejrwal, guha}@cs.ucf.edu Manak Chatterjee
More informationIEEE E: QOS PROVISIONING AT THE MAC LAYER YANG XIAO, THE UNIVERSITY OF MEMPHIS
ACCEPTED FROM O PEN C ALL IEEE 802.11E: QOS PROVISIONING AT THE MAC LAYER YANG XIAO, THE UNIVERSITY OF MEMPHIS ess AIFS[j] AIFS[] PIFS SIFS AIFS[] Content 0 to CW Bac Slot Select s The emergng IEEE 802.11e
More informationAchievable Bandwidth Estimation for Stations in Multi-Rate IEEE WLAN Cells
Achevable Bandwdth Estmaton for Statons n Mult-Rate IEEE 802. WLAN Cells Eduard Garca, Davd Vamonte, Rafael Vdal and Josep Paradells Wreless Networks Group - echncal Unversty of Catalona (UPC) {eduardg,
More informationEfficient Backoff Algorithm in Wireless Multihop Ad Hoc Networks
1 Chen-Mn Wu, 2 Hu-Ka Su, 3 Wang-Has Yang *1,Correspondng Author Nanhua Unversty, cmwu@mal.nhu.edu.tw 2 Natonal Formosa Unversty, hksu@nfu.edu.tw 3 Hsupng Insttute of Technology, yangwh@mal.ht.edu.tw do:10.4156/jact.vol3.
More informationA Fair Access Mechanism Based on TXOP in IEEE e Wireless Networks
11 Internatonal Journal of Communcaton Networks and Informaton Securty (IJCNIS) Vol. 8, No. 1, Aprl 16 A Far Access Mechansm Based on TXOP n IEEE 8.11e Wreless Networks Marjan Yazdan 1, Maryam Kamal, Neda
More informationA Binarization Algorithm specialized on Document Images and Photos
A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a
More informationPriority-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 informationEfficient 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 informationTHE IEEE standard for wireless local area networks
IEEE RANSACIONS ON VEHICULAR ECHNOLOGY, VOL. 58, NO. 2, FEBRUARY 2009 855 Determnstc Prorty Channel Access Scheme for QoS Support n IEEE 802.11e Wreless LANs Sunmyeng Km, Rongsheng Huang, Student Member,
More informationPerformance analysis of distributed cluster-based MAC protocol for multiuser MIMO wireless networks
RESEARCH Open Access Performance analyss of dstrbuted cluster-based MAC protocol for multuser MIMO wreless networks Azadeh Ettefagh *, Marc Kuhn, Celal Eşl and Armn Wttneben Abstract It s known that multuser
More informationDynamic 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 informationCombined SINR Based Vertical Handoff Algorithm for Next Generation Heterogeneous Wireless Networks
Combned SINR Based Vertcal Handoff Algorthm for Next Generaton Heterogeneous Wreless Networks Kemeng Yang, Iqbal Gondal, Bn Qu and Laurence S. Dooley Faculty of Informaton Technology Monash Unversty Melbourne,
More informationAdaptive Network Resource Management in IEEE Wireless Random Access MAC
Adaptve Network Resource Management n IEEE 802.11 Wreless Random Access MAC Hao Wang, Changcheng Huang, James Yan Department of Systems and Computer Engneerng Carleton Unversty, Ottawa, ON, Canada Abstract
More informationA 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 informationExtension and Comparison of QoS-Enabled Wi-Fi Models in the Presence of Errors
Extenson and Comparson of QoS-Enabled W-F Models n the Presence of Errors Ioanns Papapanagotou, Georgos S. Paschos*, Stavros A. Kotsopoulos** and Mchael Devetskots Electrcal and Computer Engneerng, North
More informationA Fair MAC Algorithm with Dynamic Priority for e WLANs
29 Internatonal Conference on Communcaton Software and Networks A Far MAC Algorthm wth Dynamc Prorty for 82.e WLANs Rong He, Xumng Fang Provncal Key Lab of Informaton Codng & Transmsson, Southwest Jaotong
More informationFast 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 informationA mathematical programming approach to the analysis, design and scheduling of offshore oilfields
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and
More informationAdvanced 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 informationDepartment of Electrical and Computer Systems Engineering
Department of Electrcal and Computer Systems Engneerng Techncal Report MECSE-5-2004 A Survey of IEEE 802.11 MAC Mechansms for Qualty of Servce (QoS) n Wreless Local Area Networks (WLANs) D. Pham, A. Sekercoglu
More informationRe-routing Instability in IEEE Multi-hop Ad-hoc Networks *
Re-routng Instablty n IEEE 802.11 Mult-hop Ad-hoc Networks * Png Chung Ng and Soung Chang Lew Department of Informaton Engneerng The Chnese Unversty of Hong Kong {pcng3, soung}@e.cuhk.edu.hk Abstract TCP
More informationCompiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz
Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster
More informationVirtual 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 informationPricing Network Resources for Adaptive Applications in a Differentiated Services Network
IEEE INFOCOM Prcng Network Resources for Adaptve Applcatons n a Dfferentated Servces Network Xn Wang and Hennng Schulzrnne Columba Unversty Emal: {xnwang, schulzrnne}@cs.columba.edu Abstract The Dfferentated
More informationVirtual 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 informationReal-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 informationDESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT
DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,
More informationAvoiding congestion through dynamic load control
Avodng congeston through dynamc load control Vasl Hnatyshn, Adarshpal S. Seth Department of Computer and Informaton Scences, Unversty of Delaware, Newark, DE 976 ABSTRACT The current best effort approach
More informationAn 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 informationAn Optimal Algorithm for Prufer Codes *
J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,
More informationEFT: a high throughput routing metric for IEEE s wireless mesh networks
Ann. Telecommun. (2010) 65:247 262 DOI 10.1007/s12243-009-0130-1 EFT: a hgh throughput routng metrc for IEEE 802.11s wreless mesh networks Md. Sharful Islam Muhammad Mahbub Alam Md. Abdul Hamd Choong Seon
More informationWIRELESS communication technology has gained widespread
616 IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 4, NO. 6, NOVEMBER/DECEMBER 2005 Dstrbuted Far Schedulng n a Wreless LAN Ntn Vadya, Senor Member, IEEE, Anurag Dugar, Seema Gupta, and Paramvr Bahl, Senor
More informationAggregated traffic flow weight controlled hierarchical MAC protocol for wireless sensor networks
Ann. Telecommun. (29) 64:75 721 DOI.7/s12243-9-95- Aggregated traffc flow weght controlled herarchcal MAC protocol for wreless sensor networks M. Abdur Razzaque M. Mamun-Or-Rashd Muhammad Mahbub Alam Choong
More informationTransmit Power Control Algorithms in IEEE h Based Networks
Transmt Power Control Algorthms n IEEE 82.h Based Networks Andreas J. Könsgen, Zakr Hossan, Carmelta Görg Department of Communcaton Networks Center for Informaton and Communcaton Technology (IKOM) Unversty
More informationVideo Proxy System for a Large-scale VOD System (DINA)
Vdeo Proxy System for a Large-scale VOD System (DINA) KWUN-CHUNG CHAN #, KWOK-WAI CHEUNG *# #Department of Informaton Engneerng *Centre of Innovaton and Technology The Chnese Unversty of Hong Kong SHATIN,
More information136 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 1, JANUARY Ching-Ling Huang and Wanjiun Liao, Senior Member, IEEE
136 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 1, JANUARY 2007 Throughput and Delay Performance of IEEE 802.11e Enhanced Dstrbuted Channel Access (EDCA) Under Saturaton Condton Chng-Lng
More informationAADL : about scheduling analysis
AADL : about schedulng analyss Schedulng analyss, what s t? Embedded real-tme crtcal systems have temporal constrants to meet (e.g. deadlne). Many systems are bult wth operatng systems provdng multtaskng
More informationResearch Article A Comparison Performance Analysis of QoS WLANs: Approaches with Enhanced Features
Hndaw Publshng Corporaton Advances n Multmeda Volume 007, Artcle ID 387, 3 pages do:055/007/387 Research Artcle A Comparson Performance Analyss of QoS WLANs: Approaches wth Enhanced Features Ioanns Papapanagotou,
More informationUBICC Publishers 2008 Ubiquitous Computing and Communication Journal
UBICC Journal Ubqutous Computng and Communcaton Journal 008 Volume 3. 008-04-30. ISSN 99-844 Specal Issue on Moble Adhoc Networks UBICC ublshers 008 Ubqutous Computng and Communcaton Journal Edted by Usman
More informationPerformance Evaluation of IEEE e based on ON-OFF Traffic Model I. Papapanagiotou PhD. Student
erformance Evaluaton of IEEE 82.e based on ON-OFF Traffc Model I. apapanagotou hd. Student Wreless Telecommuncaton Laboratory Unversty of atras 265 4 atras Greece papapanag@upnet.gr J.S. Vardakas hd. Student
More informationSLAM Summer School 2006 Practical 2: SLAM using Monocular Vision
SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,
More informationAnalysis of QoS in WLAN
Analyss of QoS n WLAN PAAL E. ENGELSTAD AND OLAV N. ØSTERBØ Paal E. Engelstad s Research Scentst n Telenor R&D An analytcal model s proposed to descrbe the prorty schemes of the EDCA mechansm of the IEEE
More informationAn Analytical Model for IEEE Point-to-Point Link
An Analytcal Model for IEEE 82. Pont-to-Pont Lnk Yong Yan, Xaowen hu Department of omputer cence, Hong Kong Baptst Unversty Emal: {yyan, chxw}@comp.hkbu.edu.hk Abstract - Wreless mesh networks have attracted
More informationTECHNIQUE 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 informationImprovement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration
Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,
More informationVRT012 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 informationEfficient QoS Provisioning at the MAC Layer in Heterogeneous Wireless Sensor Networks
Effcent QoS Provsonng at the MAC Layer n Heterogeneous Wreless Sensor Networks M.Soul a,, A.Bouabdallah a, A.E.Kamal b a UMR CNRS 7253 HeuDaSyC, Unversté de Technologe de Compègne, Compègne Cedex F-625,
More informationFAHP and Modified GRA Based Network Selection in Heterogeneous Wireless Networks
2017 2nd Internatonal Semnar on Appled Physcs, Optoelectroncs and Photoncs (APOP 2017) ISBN: 978-1-60595-522-3 FAHP and Modfed GRA Based Network Selecton n Heterogeneous Wreless Networks Xaohan DU, Zhqng
More informationBandwidth Allocation for Service Level Agreement Aware Ethernet Passive Optical Networks
Bandwdth Allocaton for Servce Level Agreement Aware Ethernet Passve Optcal Networks Dawd Nowak Performance Engneerng Laboratory School of Electronc Engneerng Dubln Cty Unversty Emal: nowakd@eengdcue Phlp
More informationA Semi-Distributed Load Balancing Architecture and Algorithm for Heterogeneous Wireless Networks
A Sem-Dstrbuted oad Balancng Archtecture and Algorthm for Heterogeneous reless Networks Md. Golam Rabul Ala Choong Seon Hong * Kyung Hee Unversty, Korea rob@networkng.khu.ac.kr, cshong@khu.ac.kr Abstract
More informationCluster Analysis of Electrical Behavior
Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School
More informationABRC: An End-to-End Rate Adaptation Scheme for Multimedia Streaming over Wireless LAN*
ARC: An End-to-End Rate Adaptaton Scheme for Multmeda Streamng over Wreless LAN We Wang Soung C Lew Jack Y Lee Department of Informaton Engneerng he Chnese Unversty of Hong Kong Shatn N Hong Kong {wwang2
More informationMobileGrid: Capacity-aware Topology Control in Mobile Ad Hoc Networks
MobleGrd: Capacty-aware Topology Control n Moble Ad Hoc Networks Jle Lu, Baochun L Department of Electrcal and Computer Engneerng Unversty of Toronto {jenne,bl}@eecg.toronto.edu Abstract Snce wreless moble
More informationLoad-Balanced Anycast Routing
Load-Balanced Anycast Routng Chng-Yu Ln, Jung-Hua Lo, and Sy-Yen Kuo Department of Electrcal Engneerng atonal Tawan Unversty, Tape, Tawan sykuo@cc.ee.ntu.edu.tw Abstract For fault-tolerance and load-balance
More informationComparisons of Packet Scheduling Algorithms for Fair Service among Connections on the Internet
Comparsons of Packet Schedulng Algorthms for Far Servce among Connectons on the Internet Go Hasegawa, Takahro Matsuo, Masayuk Murata and Hdeo Myahara Department of Infomatcs and Mathematcal Scence Graduate
More information3. CR parameters and Multi-Objective Fitness Function
3 CR parameters and Mult-objectve Ftness Functon 41 3. CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft
More informationCS 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 informationChannel-Quality Dependent Earliest Deadline Due Fair Scheduling Schemes for Wireless Multimedia Networks
Channel-Qualty Dependent Earlest Deadlne Due Far Schedulng Schemes for Wreless Multmeda Networks Ahmed K. F. Khattab Khaled M. F. Elsayed ahmedkhattab@eng.cu.edu.eg khaled@eee.org Department of Electroncs
More informationGoals and Approach Type of Resources Allocation Models Shared Non-shared Not in this Lecture In this Lecture
Goals and Approach CS 194: Dstrbuted Systems Resource Allocaton Goal: acheve predcable performances Three steps: 1) Estmate applcaton s resource needs (not n ths lecture) 2) Admsson control 3) Resource
More informationPerformance 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 informationThe Codesign Challenge
ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.
More informationLearning the Kernel Parameters in Kernel Minimum Distance Classifier
Learnng the Kernel Parameters n Kernel Mnmum Dstance Classfer Daoqang Zhang 1,, Songcan Chen and Zh-Hua Zhou 1* 1 Natonal Laboratory for Novel Software Technology Nanjng Unversty, Nanjng 193, Chna Department
More informationTechnical Report. i-game: An Implicit GTS Allocation Mechanism in IEEE for Time- Sensitive Wireless Sensor Networks
www.hurray.sep.pp.pt Techncal Report -GAME: An Implct GTS Allocaton Mechansm n IEEE 802.15.4 for Tme- Senstve Wreless Sensor etworks Ans Koubaa Máro Alves Eduardo Tovar TR-060706 Verson: 1.0 Date: Jul
More informationEnhanced Signaling Scheme with Admission Control in the Hybrid Optical Wireless (HOW) Networks
Enhanced Sgnalng Scheme wth Admsson Control n the Hybrd Optcal Wreless (HOW) Networks Yng Yan, Hao Yu, Henrk Wessng, and Lars Dttmann Department of Photoncs Techncal Unversty of Denmark Lyngby, Denmark
More informationParallelism for Nested Loops with Non-uniform and Flow Dependences
Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr
More informationGateway Algorithm for Fair Bandwidth Sharing
Algorm for Far Bandwd Sharng We Y, Rupnder Makkar, Ioanns Lambadars Department of System and Computer Engneerng Carleton Unversty 5 Colonel By Dr., Ottawa, ON KS 5B6, Canada {wy, rup, oanns}@sce.carleton.ca
More informationX- 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 informationResource and Virtual Function Status Monitoring in Network Function Virtualization Environment
Journal of Physcs: Conference Seres PAPER OPEN ACCESS Resource and Vrtual Functon Status Montorng n Network Functon Vrtualzaton Envronment To cte ths artcle: MS Ha et al 2018 J. Phys.: Conf. Ser. 1087
More informationExperimental Tuning of the AIFSN Parameter to Prioritize Voice Over Data Transmission in E WLAN Networks
Dubln Insttute of Technology AOW@DIT Conference papers Communcatons Network esearch Insttute 27-8-1 Expermental Tunng of the AIFSN Parameter to Prortze Voce Over Data Transmsson n 82.11E WLAN Networks
More informationEnhancing Class-Based Service Architectures with Adaptive Rate Allocation and Dropping Mechanisms
Enhancng Class-Based Servce Archtectures wth Adaptve Rate Allocaton and Droppng Mechansms Ncolas Chrstn, Member, IEEE, Jörg Lebeherr, Senor Member, IEEE, and Tarek Abdelzaher, Member, IEEE Abstract Class-based
More informationProblem 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 informationARTICLE 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 informationSolutions for Real-Time Communication over Best-Effort Networks
Solutons for Real-Tme Communcaton over Best-Effort Networks Anca Hangan, Ramona Marfevc, Gheorghe Sebestyen Techncal Unversty of Cluj-Napoca, Computer Scence Department {Anca.Hangan, Ramona.Marfevc, Gheorghe.Sebestyen}@cs.utcluj.ro
More informationUser Authentication Based On Behavioral Mouse Dynamics Biometrics
User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA
More informationEfficient Content Distribution in Wireless P2P Networks
Effcent Content Dstrbuton n Wreless P2P Networs Qong Sun, Vctor O. K. L, and Ka-Cheong Leung Department of Electrcal and Electronc Engneerng The Unversty of Hong Kong Pofulam Road, Hong Kong, Chna {oansun,
More informationA new access point selection policy for multi-rate IEEE WLANs
Internatonal Journal of Parallel, Emergent and Dstrbuted Systems Vol. 23, No. 4, August 2008, 1 20 A new access pont selecton polcy for mult-rate IEEE 802.11 WLANs Murad Abusubah, Sven Wethoelter, James
More informationNetwork Coding as a Dynamical System
Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.
More informationOPTIMAL CONFIGURATION FOR NODES IN MIXED CELLULAR AND MOBILE AD HOC NETWORK FOR INET
OPTIMAL CONFIGURATION FOR NODE IN MIED CELLULAR AND MOBILE AD HOC NETWORK FOR INET Olusola Babalola D.E. Department of Electrcal and Computer Engneerng Morgan tate Unversty Dr. Rchard Dean Faculty Advsor
More informationA MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS
Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung
More informationSample Solution. Advanced Computer Networks P 1 P 2 P 3 P 4 P 5. Module: IN2097 Date: Examiner: Prof. Dr.-Ing. Georg Carle Exam: Final exam
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 informationProblem 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 informationNUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS
ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana
More informationAn Iterative Solution Approach to Process Plant Layout using Mixed Integer Optimisation
17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 An Iteratve Soluton Approach to Process Plant Layout usng Mxed
More informationIP Camera Configuration Software Instruction Manual
IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the
More informationDynamic Bandwidth Allocation Schemes in Hybrid TDM/WDM Passive Optical Networks
Dynamc Bandwdth Allocaton Schemes n Hybrd TDM/WDM Passve Optcal Networks Ahmad R. Dhan, Chad M. Ass, and Abdallah Sham Concorda Insttue for Informaton Systems Engneerng Concorda Unversty, Montreal, Quebec,
More informationBioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.
[Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented
More informationA Sub-Critical Deficit Round-Robin Scheduler
A Sub-Crtcal Defct ound-obn Scheduler Anton Kos, Sašo Tomažč Unversty of Ljubljana, Faculty of Electrcal Engneerng, Ljubljana, Slovena E-mal: anton.kos@fe.un-lj.s Abstract - A scheduler s an essental element
More informationLoad Balancing for Hex-Cell Interconnection Network
Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,
More informationA Free-Collision MAC Proposal for Networks
12th Brazlan Workshop on Real-Tme and Embedded Systems 89 A Free-Collson MAC Proposal for 802.11 Networks Omar Alment 1,2, Gullermo Fredrch 1, Gullermo Reggan 1 1 SITIC Group Unversdad Tecnológca Naconal
More informationContent Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers
IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth
More informationNetwork-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 informationMachine Learning: Algorithms and Applications
14/05/1 Machne Learnng: Algorthms and Applcatons Florano Zn Free Unversty of Bozen-Bolzano Faculty of Computer Scence Academc Year 011-01 Lecture 10: 14 May 01 Unsupervsed Learnng cont Sldes courtesy of
More informationDelay Variation Optimized Traffic Allocation Based on Network Calculus for Multi-path Routing in Wireless Mesh Networks
Appl. Math. Inf. Sc. 7, No. 2L, 467-474 2013) 467 Appled Mathematcs & Informaton Scences An Internatonal Journal http://dx.do.org/10.12785/ams/072l13 Delay Varaton Optmzed Traffc Allocaton Based on Network
More informationQuantifying Responsiveness of TCP Aggregates by Using Direct Sequence Spread Spectrum CDMA and Its Application in Congestion Control
Quantfyng Responsveness of TCP Aggregates by Usng Drect Sequence Spread Spectrum CDMA and Its Applcaton n Congeston Control Mehd Kalantar Department of Electrcal and Computer Engneerng Unversty of Maryland,
More informationReal-time interactive applications
Real-tme nteractve applcatons PC-2-PC phone PC-2-phone Dalpad Net2phone vdeoconference Webcams Now we look at a PC-2-PC Internet phone example n detal Internet phone over best-effort (1) Best effort packet
More information