Opportunistic Third-Party Backhaul for Cellular Wireless Networks

Size: px
Start display at page:

Download "Opportunistic Third-Party Backhaul for Cellular Wireless Networks"

Transcription

1 1 Opportunstc Thrd-Party Backhaul for Cellular Wreless Networks Russell Ford, Student Member, IEEE, Changkyu Km, Student Member, IEEE, Sundeep Rangan, Senor Member, IEEE arxv: v1 cs.ni 4 May 213 Abstract Wth hgh capacty ar nterfaces and large numbers of small cells, backhaul the wred connectvty to base statons s ncreasngly becomng the cost drver n cellular wreless networks. One reason for the hgh cost of backhaul s that capacty s often purchased on leased lnes wth guaranteed rates provsoned to peak loads. In ths paper, we present an alternate opportunstc backhaul model where thrd partes provde base statons and backhaul connectons and lease out excess capacty n ther networks to the cellular provder when avalable, presumably at sgnfcantly lower costs than guaranteed connectons. We descrbe a scalable archtecture for such deployments usng open access femtocells, whch are small plug-and-play base statons that operate n the carrer s spectrum but can connect drectly nto the thrd party provder s wred network. Wthn the proposed archtecture, we present a general user assocaton optmzaton algorthm that enables the cellular provder to dynamcally determne whch mobles should be assgned to the thrd-party femtocells based on the traffc demands, nterference and channel condtons and thrd-party access prcng. Although the optmzaton s non-convex, the algorthm uses a computatonally effcent method for fndng approxmate solutons va dual decomposton. Smulatons of the deployment model based on actual base staton locatons are presented that show that large capacty gans are achevable f adopton of thrd-party, open access femtocells can reach even a small fracton of the current market penetraton of WF access ponts. Index Terms cellular networks, 3GPP LTE, femtocells, access prcng, utlty maxmzaton. I. INTRODUCTION Cellular wreless networks have been tradtonally desgned on the premse that the wreless nterface s the bottleneck for system throughput and capacty. However, a surprsng recent trend s that backhaul, meanng the wred connectvty to the base statons, s ncreasngly becomng the domnant cost drver n many networks 1, 2. Even for comparatvely lower data rate pre-4g systems, backhaul already accounted for a sgnfcant percentage of the operatng costs (3 to 5% by some estmates 3, 4). Hgher data rate 4G systems combned wth the ncreasng adopton of a large numbers of small cell deployments 3 wll requre even greater costs n the backhaul, partcularly n markets where the operator does not have unversal fber access. Ths work presents a novel deployment model for cellular provders that would enable the rsng costs of backhaul networks to be mtgated by offloadng traffc to thrd-party Ths materal s based upon work supported by the Natonal Scence Foundaton under Grant No R. Ford (emal:rford2@students.poly.edu) and S. Rangan (emal: srangan@poly.edu) are wth the Polytechnc Insttute of New York Unversty, Brooklyn, NY. backhaul connectons. The basc premse s that backhaul servces are currently purchased wth guaranteed servce level agreements (SLAs) along dedcated lnes 5, whch come at a sgnfcant cost for operators. These SLAs must generally be provsoned for the peak data rates. However, due to varatons n loadng and channel condtons, much of the purchased capacty goes to waste. We propose that, rather than provsonng these lnks for the peak demand, cellular networks should be able to dynamcally leverage excess capacty on exstng backhaul lnks provded by thrd-party enttes. The role of ths thrd party may be played by other servces provders (.e. wrelne ISPs) or even broadband customers, the very end-users themselves. The thrd partes can provde connectvty to the operator s subscrbers through femtocells 6 8, whch are small, lowcost, cellular base statons that operate n the provder s spectrum but are connected nto the thrd party s backhaul. The network can then offload moble subscrbers to the thrd party femtocells and the cellular provder would remburse the thrd party for use of the backhaul resources (and possbly cover the one-tme cost of the femtocell as well). The key s to offload traffc opportunstcally when thrd partes have excess backhaul capacty. Snce ths capacty would only be purchased when used and snce moble traffc would generally represent only a small ncrement n average demand at most enterprses and resdences, the opportunstc capacty can presumably be purchased at much a lower cost than guaranteed lnes to base statons. In addton, sgnfcant progress has been made n makng femtocells completely self-organzng wth plug-and-play nstallaton 9, 1, mplyng that thrd-party femtocells would have mnmal operatng costs. In ths way, opportunstc backhaul wth thrd-party open-access femtocells can provde a scalable model for hgh-densty, hgh-capacty deployments at low cost. We descrbe a potental archtecture for thrd-party opportunstc backhaul model wthn the LTE/SAE framework 11 (see Secton II). Wthn ths archtecture, we consder one of the key techncal problems, namely the optmzaton of user assocaton: The cellular provder s network must dynamcally assgn moble subscrbers between the operator-controlled base statons and thrd party femtocells based on channel and nterference condtons, backhaul capacty, traffc demands and thrd party access prcng. We present a general optmzaton formulaton for ths problem usng a recently-developed methodology n 12, whch tself was based on 13. The user assocaton optmzaton problem s generally non-convex,

2 2 but followng 12, we show that the optmzaton admts a dual decomposton that enables applcaton of effcent approxmate augmented Lagrangan methods. The methodology s extremely general and enables ont optmzaton for load balancng and nterference coordnaton and can ncorporate a large class of nterference models, network topologes and prcng schemes. To evaluate the potental capacty ncrease for ths opportunstc backhaul model, we present a smple smulaton where we assume open access femtocells can be co-located at a small fracton (between 2 and 25%) of the locatons where current resdental and enterprse WF access ponts are deployed. Basng our smulatons on reported locaton data of WF access ponts and cellular base statons and ndustry standard cellular evaluaton models 14, we show that large capacty gans are possble wth offload nto thrd-party networks and we dscuss the potental costs of nvestment n the thrd-party model compared to the addtonal operator-deployed or leased lne nfrastructure requred to support an equvalent gan n system throughput. A. Related work Although femtocells have been tradtonally used for mprovng coverage n prvate resdences and enterprses 6 8, open access femtocells deployed explctly for wdearea coverage have also been consdered see, for example, Qualcomm s neghborhood small cells whtepaper 15. That work showed sgnfcant capacty gans would be possble wth open-access LTE femtocells placed at a small fracton (1%) of resdences. The analyss, however, does not explctly consder the ssues of backhaul usage and thrd-party chargng, whch are the man focus of ths paper. A comparable busness model s also found n publc WF networks such as FON, whch boasts tself as the world s largest WF network 16. FON members, called Foneros, agree to allow other Foneros to securely connect to ther custom home WF AP and, n return, gan access the mllons of other hotspots hosted by members of the communty. Under one of the avalable membershp plans, users are ncentvzed to provde relable WF servce by beng compensated perbyte of data traffc consumed by other Foneros. The FON busness model has been tremendously successful n recent years, brngng n 28 mllon Euro n revenue durng In ths work, we consder offload to cellular, rather than WF, whch has the advantage of better support for moblty and nterference management. Moreover, n the model presented, the network makes all cell selecton decsons and s responsble for payng thrd partes for offloaded traffc; thrd-party vs. provder ownershp s transparent to the moble subscrbers who see all base statons as belongng to a sngle network. A mathematcal evaluaton of prcng schemes for moble subscrbers s presented n 18, whch concludes that operators can maxmze revenue by offerng femto servces to all customers at a flat rate, that s, not as an extra value-added servce but part of the basc package. We adopt ths method of subscrber chargng n our model, whch we beleve has the added beneft of encouragng femtocell adopton. The utlty Source s (host) Internet GW Core network r1 max, c1 3 rd -party lnk r2 max, c2 Backhaul BS nbs ϵ 1...NBS ρ21 ρ12 ρ11 Access l ϵ 1...L MS nms ϵ 1...NMS Fg. 1: Heterogeneous network archtecture where operatorcontrolled cells (drawn n green) are combned wth thrd-party controlled femtocells (drawn n purple). for data consumers s often modeled by a logarthmc functon of rate (a specal case of so-elastc utlty), whch has the ratonal bass of expressng the decreasng margnal payoff of rate experenced by users Understandng the shape of the supply-sde utlty curve for thrd-party backhaul provders s not as straghtforward, however. Intutvely, a monopolst operator wants to offer a prce for backhaul capacty that maxmzes ther net utlty, whch s a functon of the average or total throughput seen by users as well as the cost of connectvty over thrd-party lnks. Although we consder the operator to be a prce taker under ths model, f the thrd-party provder s a ndvdual end-user wth leased broadband capacty, we assume ther supply-sde prce elastcty s lkely to be very nelastc snce they wll accept any prce offered for ther excess bandwdth (seeng as how they would otherwse get nothng) 21. Ths dynamc becomes sgnfcantly more complex, requrng a game-theoretc approach to analyss, when we consder a compettve market where one or more broadband ISPs offer resources to one or more moble servce provders and the prce of sad resources may be a tme-varyng functon of demand. 1 In ths paper, we forgo an analyss of compettve markets n favor of nvestgatng the relatonshp between a sngle cellular provder (wth exstng macrocellular nfrastructure) and many 3rd-party backhaul provders. We assume ths baselne model n order to demonstrate a general framework for determnng net utlty gans and couch an upper bound on the ncentve that could be offered whle stll ncreasng operator revenue. II. SYSTEM ARCHITECTURE As descrbed n the Introducton, we propose that thrd partes use open-access femtocells to provde servce to the moble subscrbers of a cellular operator. The basc network archtecture s shown n Fg. 1 whch follows the standard model of 3GPP LTE/SAE heterogeneous networks 9, 11. As shown, there are two classes of base staton cells n the proposed model: operator-controlled and thrd-party. The operator-controlled cells (set BS M ) are the standard BS nodes 1 Such mult-sded markets are the subect of 22, whch ntroduces a bddng system through whch provders compete for network resources. ρ22

3 3 connected drectly to the operator core network and managed by the operator. These are typcally macro- or mcrocells, hence the subscrpt M. The thrd party cells (set BS F ), are the open access femtocell BS nodes nstalled by a thrd party and connected to the thrd-party ISP network,.e. the Internet. In the proposed model, the thrd-party and operator frst agree on some access prcng, perhaps a cost per unt tme or unt data that the operator wll remburse the thrd-party provder when moble subscrbers connect to ther network we wll see that our optmzaton methodology can ncorporate a range of prcng models. Then, at any tme, the network can choose to assgn mobles to ether operator-controlled or thrd-party cells dependng on the channel and nterference condtons, traffc loadng and access prcng. There are several convenent features of ths deployment model: Deployment ease and scalablty: Most mportantly, the use of thrd party femtocells offers a scalable and cost effectve approach to ncrease capacty: Snce femtocells are low-cost, plug-and-play devces, thrd partes can nstall these devces themselves, thereby mmedately creatng an abundance of cell stes vrtually for free. In addton, as descrbed n the Neghborhood Small Cell concept 15, when the cellular operator also provdes a broadband resdental and enterprse ISP servce (such as Verzon s FOS or AT&T s U-Verse servce), they could nclude a femtocell wthn the WF access pont gven to the subscrber, thereby automatcally enablng femtocell capabltes n every subscber s locaton. Drect operator to thrd party economc relatonshp: The economc nteracton wth respect to access prcng can be made entrely between the cellular operator and the thrd-party provder the moble subscrber need not be nvolved. Ths arrangement s possble snce, n networks such as 3GPP LTE, for mobles n connected mode, the network makes all decsons on whch cells serve the mobles 11. Thus, the network and thrd-party provder can come to an agreement on access prcng, and then the network can decde, n each tme nstant, whether to have ts mobles served by the thrd party cells based on channel condtons, network load, and other factors. Transparency to mobles: Related to the above pont s that, from the moble staton perspectve, both classes of base staton cells thrd-party and operator-controlled are completely dentcal, potentally usng the same rado access technology and potentally operatng n the same spectrum band. 2 Thus, the thrd party vs. operator ownershp s transparent to the mobles. Ths feature s benefcal snce the moble user s really concerned wth the qualty of the connectvty and has no nterest per se n who provdes that connecton. Correctly matched ncentves: Snce the operator wll only remburse thrd partes when Open Subscrber Group (OSG) mobles are served by the thrd party cell, the operator does not need to enforce proper nstallment 2 Our nterference model presented n the followng secton addresses cochannel and separate channel deployments. and operaton of the femtocell. Thrd partes wll be naturally ncentvzed to keep ther femtocell on and wellpostoned to attract the operator to move ts moble subscrbers onto ts network to receve payment. On the other hand, f the thrd-party network s busy and cannot support the addtonal moble traffc, the thrd-party s free to shut off or cap the rate to the femtocell and the cellular operator can adust ts cell selecton decsons accordngly. As we wll see n the next secton, our user assocaton algorthm can account for backhaul lmts on the thrd party cells. Mnmal changes to exstng standards: All the hooks necessary for the proposed thrd-party offload can be handled wthn the exstng cellular standards. For example, n 3GPP LTE, the mobles already provde the network wth all the measurement reports necessary to determne the arlnk condtons and receved sgnal strengths to make the handover decsons. Also, n the current LTE network model, all traffc from the publc Internet s routed frst through a gateway 3 before beng tunneled to the base statons, whether the base statons cells are operator-controlled or operated by a thrd-party outsde the operator core network Thus, the network can both montor the exact amount of tme and data to each cell type for chargng and to measure lnk qualty. III. USER ASSOCIATION OPTIMIZATION As mentoned above, a key techncal challenge n realzng the proposed archtecture s that the cellular provder requres a good algorthm for user assocaton: the cellular provder must determne, n each tme nstant, how to assgn moble users between the thrd-party and operator-controlled cells whle accountng for channel and nterference condtons, access prces and loadng. To ths end, we use a utlty maxmzng algorthm proposed n 12 and 13 for optmzed user assocaton n heterogeneous networks, ncorporatng access prce nto the utlty functon. A. Optmzaton Formulaton Returnng to Fg. 1, let MS, = 1,... N MS denote the set of moble statons and BS, = 1,..., N BS set of base staton cells, the latter set ncludng both operator-controlled and thrd-party cells. For each MS, let Γ MS () denote the ndces such that BS can potentally serve the moble. Smlarly, let Γ BS () be the set of mobles potentally served by BS. Also, let r and w be the rate and bandwdth allocated to MS from BS for Γ MS (). Let r MS and r BS be the total rate to the MS and BS respectvely, whch must satsfy the constrants r MS r, r BS r. (1) Γ MS() Γ BS() 3 The gateway, n ths case, serves the combned functon of the LTE P- GW/S-GW. We consder these to be co-located nodes. 4 Note that whle protocols such as Selected IP Traffc Offload (SIPTO) 23 allow small cell traffc to bypass the CN and be offloaded drectly to the Internet, we do not consder ths case here snce network and transport layer moblty functons need to be handled by the CN n any case.

4 4 Absent of carrer aggregaton 24, mobles n LTE are typcally only served by one cell at a tme. If we let r be the vector of the rates r, we wll denote ths sngle path constrant as r S := {r : r = for all but one Γ MS ()}. (2) Now, followng 12, we attempt to fnd rates to maxmze some utlty functon of the form U(r MS ) = N MS =1 U (r MS ), (3) for some utlty functons U (r MS ). To account for the backhaul costs that the operator must pay the thrd party provders, we assume there s a cost of the form C(r BS ) = N BS =1 C (r BS ), (4) where C (r BS ) s the cost for the traffc on BS that the operator wll have to pay the thrd-party that owns BS. BS nodes belongng to BS M represent operator-deployed cells connected over statcally-provsoned backhaul lnks wll generally have zero cost (C (r BS ) = ), snce we consder exstng nfrastructure to be a sunk cost for the operator. Nodes n BS F are thrd-party cells and have some postve cost (C r BS ) > ) that they charge the operator. The cost functons C (r BS ) can also be used to ncorporate rate lmts on ether the thrd-party or operator-deployed cells due to fnte backhaul capacty on those cell stes. The goal s to maxmze a net utlty, U(r MS ) C(r BS ), subect to constrants on the rates. The rate lmts depend on the channel and nterference condtons, whch we model usng a lnear mxng nterference model proposed n 25. Let z be the nterference power on the lnk from BS to MS. As descrbed n 12, assumng that the base statons radate a fxed power per unt bandwdth, the vector of nterference powers must satsfy a constrant of the form z Gw, (5) where w s the vector of bandwdth allocatons and G s an approprate gan matrx. The rate on the lnks must then satsfy r w ρ (z ), (6) where ρ (z ) s the spectral effcency (rate per unt bandwdth) as a functon of the nterference level z. Also, the bandwdths must satsfy some constrants of the form w w, (7) Γ BS() where w s the total bandwdth avalable n BS. By approprate selecton of the gan matrx G, ths formulaton can ncorporate both co-channel deployments of the thrd-party and operator-controlled cells where the two types of cells use the same bandwdth and nterfere wth one another, or separate channel deployments where there s no nterference. Now let be the vector of all the unknowns = (r, r BS, r MS, w, z) T. (8) The constrants (1), (5) and (7) can be replaced by nequalty constrants represented n a matrx form A b, (9) for approprate choce of the matrx A and vector b. We can then wrte the user assocaton problem as the optmzaton max U(r MS ) C(r BS ) (1a) s.t. A b (1b) r w ρ(z) r S, (1c) (1d) where the constrant (1c) s a vector shorthand for the constrants (6). B. Dual Decomposton Algorthm The optmzaton (1) s, n general, non-convex due to the nonlnearty of the nterference rate-nterference constrants (1c) and the sngle path constrants (2). However, followng 12, we can fnd an approxmate soluton to ths problem n two steps. Frst, we ntally gnore the sngle path constrant (2). The resultng optmzaton wll produce a vector wth rates on all paths to the mobles. We then smply truncate the soluton to take the path wth the largest rate. Ths truncaton procedure s well-known n networkng theory 26 and often ntroduces lttle error, snce the multpath soluton tends to concentrate on domnant sngle paths. Unfortunately, even wth the multpath approxmaton, the optmzaton (1) wll be non-convex. However, as n 12, we can show that the optmzaton admts a separable dual decomposton. Specfcally, the Lagrangan correspondng to the optmzaton (1) wthout the sngle path constrant (1d) s gven by L(, µ) := U(r MS ) C(r BS ) µ T g(), (11) where g() s the vector of constrants ( T g() = A b, r w ρ(z)), (12) and µ s the vector of dual parameters parttoned conformably wth g() µ = (µ, µ r ) T. (13) Now central to usng dual optmzaton methods s the ablty to compute the maxma of the form (µ) := arg max L(, µ) Φ(), (14) for some augmentng functon Φ(). Usng a smlar argument as n 12, the followng lemma shows that, under the assumpton of a separable augmentng functon Φ( ), the optmzaton (14) admts a separable dual decomposton. Lemma 1: Let Φ() be any separable functon of the form Φ() = Φ(r, r BS, r MS, w, z) = φ r (r ) + φ z (w, z ) + φ BS (r BS ) + φ MS (r MS ) (15)

5 5 for some functons φ r ( ), φbs ( ), φ MS ( ) and φ z ( ). Let µ be any vector of Lagrange parameters and let (µ) be the correspondng maxma for the dual optmzaton augmented by Φ(), namely (µ) = ( r, r BS, r MS, ŵ, ẑ) := arg max L(, µ) Φ(). (16) Then, the components of (µ) are gven by the solutons to the optmzatons r arg mn φ r (r ) + (λ r + µ r )r and r BS r arg mn r MS r BS arg max r MS C (r BS U (r MS ) + φ BS ) φ MS (r BS (r MS ) + λ BS ) λ MS (ŵ, ẑ ) arg max µ r w ρ (z ) w,z λ z z λ w w φ z (w, z ), r BS r MS where the dual parameters µ are parttoned as n (13) and the parameters λ are the components λ = (λ r, λ BS, λ MS, λ w, λ z ) := A T µ, where the vector λ has been parttoned conformably wth n (8). Proof: Ths result follows mmedately from the separable structure of the obectve functon and constrants. The lemma shows that the vector optmzaton (16) separates nto a set of smple one and two-dmensonal optmzatons over the components of and can thus be computed easly for any dual parameters λ. As dscussed n 12, ths separablty property has two key consequences that follow mmedately from standard optmzaton theory 27: Frst, one can use weak dualty to effcently to compute an upper bound on the maxmum net utlty. Specfcally, the net utlty s bounded by max U() C() max L(, µ), (18) for any dual parameters µ. Moreover, the rght-hand sde of (18) s convex n µ, and snce the dual maxma s separable, one can compute ts value and gradent for any µ. Thus, one can effcently mnmze the rght hand sde of (18), provdng a computable upper bound on the net utlty. Although the dual upper bound may not be tght (.e. the optmzaton may not be strongly dual), the bound provdes a computable metrc under whch any approxmate algorthm can be compared aganst. A second consequence of a computable dual maxma s that one can effcently mplement several well-known augmented Lagrangan technques to fnd approxmate maxma to the net utlty U() C(). These methods nclude varous nexact versons of alternatng drecton method of multpler methods 28, 29 see 12 for more detals. A valuable property s that ths dual decomposton apples n very general crcumstances. In partcular, one can consder arbtrary cost and utlty functons, and SNR-to-rate mappngs ρ ( ). Thus, the framework provdes a tractable and general methodology for a large class of networks, nterference scenaros and prcng schemes wth computable upper bounds on performance. A. Evaluaton Methodology IV. SYSTEM EVALUATION To evaluate the opportunstc backhaul model, we conducted a network smulaton usng a smplfed verson of ndustrystandard models for evaluatng mult-ter networks 14, 3, 31. Our goal was to determne the gan n network capacty as a functon of the number of thrd party provders and offloaded backhaul capacty. Two deployment models were consdered: real-world and stochastc. In the real-world model, the operator-controlled BS locatons were based on actual cell stes as reported n the OpenCellId database, whch has logged data for over 5, ndvdual cells n the US 32. For the thrd-party femtocells, followng 15, we assume that the thrd party femtocells can be co-located wth current resdental and enterprse WF access ponts (APs) the theory beng that the owners of these WF APs would be the potental thrd partes to offer connectvty to the moble subscrbers. The WF AP locatons were estmated from the freely-avalable Wgle.net database. Contrbutors to the Wgle proect have compled over 88 mllon unque observatons of WF statons across the globe 33. Our smulatons consdered two test locatons: a 1km 2 area of the East Vllage n Manhattan, New York Cty representatve of a dense urban deployment and a smlar-szed area n Passac, NJ as representatve of a typcal suburban deployment. Fg. 2 s an aeral map of WF APs and cell stes n the selected area of Manhattan as reported n the OpenCellId and Wgle.net databases, plotted together n Google Earth TM 34. For the observed populaton of WF APs n the 1km 2 areas of NYC and Passac, NJ, we unformly sample a percentage of these nodes n the doman {2%, 5%, 1%, 15%, 2%}, whch represents the adopton rate of thrd-party WF owners that agree to provde backhaul servce to the cellular operator through a femtocell co-located at a WF AP. The equvalent number of nodes for both the urban and suburban locatons s gven n Table I. We mmedately see that, accordng to the databases we sampled, there are more than 2 WF APs for each cellular mcrocell n Manhattan. Ths vast number of WF APs suggests that f, even a small fracton of open-access femtocells can be co-located at current WF locatons, the cellular capacty can be massvely ncreased. For completeness, we compare our results based on realworld locatons wth ndustry-standard stochastc models 14, 31 used wdely n evaluatng cellular systems. For the urban scenaro n both the real-world and stochastc models, we take the operator-deployed nodes to be mcrocells, whch are omndrectonal transmtters wth power, bandwdth and other parameters concdng wth the 3GPP urban mcrocell model n 14, 31. Femtocells are smlarly confgured based on these

6 6 optmal user assocaton between the thrd-party and operatorcontrolled cells. In realty, we envson that ths optmzaton would be conducted n the operator s network. In conductng the optmzaton, we assume a smlar model as 35, where the spectral effcency ρ (z ) n (6) s gven by the Shannon capacty wth a loss of 3 db wth a maxmum value of 4.8 bps/hz (correspondng to 64-QAM at rate 5/6). For the utlty (3), we assume a proportonal far metrc U (r MS ) = log(r MS ). The backhaul capacty s assumed to be zero for operator-controlled cells, whle thrd-party cells charge a lnear cost so that C (r BS ) = { pr BS, BS F (.e. femtocell), BS M (.e. macro/mcrocell) (19) Fg. 2: Google Earth TM map of reported mcrocell locatons (blue balloons) and a fracton of the WF stes (green crcles) n the East Vllage, Manhattan. Snce the WF access ponts vastly outnumber the current cellular base statons (more that 2 to 1 n ths case), cellular capacty can be sgnfcantly ncreased f femtocells can be co-located at even a small fracton of the WF stes. TABLE I: Number of operator-controlled and thrd-party cells and number of UEs n the urban and suburban test cases Envronment Urban mcro-only and mcro+femto Suburban: macro-only and macro+femto Node Number of Nodes Type Mcro N M = 17 Femto N F {722, 185, 361, 5415, 722} UE N MS = 425 (25/mcro) Macro N M = 9 Femto N F {66, 165, 33, 495, 66, 825} UE N MS = 225 (25/macro) *N F computed from the adopton rate: {2%, 5%, 1%, 15%, 2%} of observed WF APs parameters and are subect to a maxmum backhaul rate n the set {1, 2, 3, 4, 5} Mbps. 5 These values for the rate constrant parameter are assgned unformly over the set of femtocells. For the suburban scenaro (for both real-world and stochastc models), we consder operator BSs to be three-waysectorzed macrocells. For the stochastc models, the denstes of the operator-controlled macro/mcrocells and thrd-party femtocells were adusted to match the denstes observed n the real-world data. Other salent parameters are gven n Table II. Note that the femtocells have an addtonal 2 db of path loss to account for the wall loss assumng the femtocell s deployed ndoors. For each of the scenaros (urban / suburban and real-world / stochastc), we follow the standard evaluaton methodology n 14, 31 to assess the downlnk capacty. Specfcally, we generate 1 random nstances of each of the networks; each nstance s called a drop. In each random drop, we run the optmzaton descrbed n Secton III to determne the where p represents the cost per unt backhaul capacty n the femtocell relatve to the utlty. The prce p wll be vared. Urban mcrocell Femtocell Suburban macrocell Global TABLE II: Network model parameters Parameter Topology Total TX power BW Antenna pattern Mcro UE path loss Mcro UE lognormal shadowng Topology Total TX power BW Antenna pattern Femto UE path loss Femto UE lognormal shadowng Backhaul max rate Topology Total TX power BW Antenna pattern Macro UE path loss Macro UE lognormal shadowng Carrer frequency Total area UE dstrbuton Moblty Traffc model Fadng Value Unform wth wrap-around 3 dbm 1 MHz (FDD DL) omn log 1 (R) (R n km) 1dB std. dev; 5% nter-ste correlaton; 1% ntra-ste correlaton Unform wth wrap-around 2 dbm 1 MHz (FDD DL) omn log 1 (R)+2dB (R n km) 8dB std. dev r max {1, 2, 3, 4, 5} Mbps unformly assgned to nodes Hexagonal (3-way sectorzed) wth wraparound 46 dbm 1 MHz (FDD DL) A() = mn{12( ) 2, A 3dB m} log 1 (R) (R n km) 8dB std. dev 2.1 GHz 1x1m Unform, 25 per macro/mcrocell constant full buffer none Lnk capacty C=W mn(log( β SNR),ρ max) β = 3dB (loss from Shannon cap.*) ρ max (max. spectral effcency) *We determne the achevable rate based on the loss from Shannon capacty, as dscussed n Backhaul rate constrant values are based on broadband servces commonly offered by many ISPs n the US.

7 7 Avg. rate gan/user urban real world 5 urban stochastc macro only Adopton rate (fracton of total observed nodes) (a) Urban scenaro Avg. cell edge rate gan/user (bottom 5% of rates) urban real world urban stochastc Adopton rate (fracton of total observed nodes) (a) Urban scenaro Avg. rate gan/user suburban real world macro only suburban hex grd/stochastc Adopton rate (fracton of total observed nodes) (b) Suburban scenaro Fg. 3: Average rate gan as a functon of the adopton rate n urban and suburban deployments. We see that f even a small fracton (5%) of WF owners agree to nstall open-access femtocells, cellular capacty can ncrease more than 2 fold n a dense urban envronment and a factor of 6 n a suburban deployment. B. Potental Capacty Gan wth Offloadng To estmate the maxmum possble capacty gan wth thrdparty offload, we frst consder the case where the thrd-party provders lease ther capacty at zero cost (.e. p = n (19)). Fg. 3 shows that the gan n mean throughput per moble as a functon of the adopton rate the fracton of WF AP locatons where open-access femtocells are co-located. We see that the total capacty can be ncreased sgnfcantly. For example, a 5% adopton yelds more than 2x ncrease n user throughput n the real-world urban settng and a 6x ncrease n the real-world suburban model. The maxmum gan n the suburban model s not as hgh as the urban settng snce the densty of thrd-party cells s lower. Also, the maxmum gans n both cases begn to saturate snce we fx the number of UEs per marcros. Therefore, addng more femtocells eventually has lttle value a phenomena also observed n 15. The fnte backhaul rates on the femtocells also lmts the gan. Fg. 4 smlarly plots the ncrease n the cell-edge throughput. As defned n 14, the cell-edge rate s the rate of the 5% percentle UE n each drop. We see smlar gans at the cell edge as the mean gans, suggestng that the gans are unformly experenced across the cell. Table III states the gan value for the urban case at the 5% adopton. Avg. cell edge rate gan/user (bottom 5% of rates) suburban real world suburban hex grd/stochastc Adopton rate (fracton of total observed nodes) (b) Suburban scenaro Fg. 4: Average 5% cell-edge rate gan as a functon of the adopton rate n urban and suburban deployments. TABLE III: Capacty and cell edge gans wth 5% femtocell adopton based on the urban real-world model. Scenaro Macro-only Macro+Femto Gan Avg. UE rate (Mbps) Avg. 5% cell edge rate (Mbps) Utlty (geometrc mean rate, Mbps) C. Addng Thrd-Party Prcng The results n the prevous subsecton assumed that the relatve cost of the thrd-party backhaul (the varable p n (19)) was zero. Of course, n realty, thrd partes wll not generally offer backhaul for free, so we need to consder the capacty gan wth non-zero prcng. Unfortunately, there s no way to drectly determne the correct relatve prce p to use n the evaluaton wthout some economc analyss relatng the potental revenue ncrease to the operator from ncreased capacty (as measured by the utlty) versus the cost to the operator of the thrd-party backhaul. However, such analyss s beyond the scope of ths study, although busness models have been consdered elsewhere, e.g. 36. What s relevant for ths work s to show that our net utlty

8 8 Cummulatve probablty m+f prce= m+f prce=1. m+f prce=4. m+f prce=8. macro only UE rate (Mbps) Fg. 5: Dstrbuton of the UE rates for mcro+femto urban realworld model wth femto prce p {, 1, 4, 8} and 5% adopton. Also, plotted s the mcro-only dstrbuton whch corresponds to the prce p =. maxmzaton optmzaton can ncorporate prcng, whatever the correct prcng s. As an llustraton, we fx the adopton rate at 5% and run the mcro+femto optmzaton for dfferent prces p n (19). 6 Fg. 5 plots the resultng rate dstrbutons across the UEs for the dfferent prces. As we would expect, as the prce s ncreased, the number of users scheduled on thrdparty lnks along wth the volume of offloaded traffc decreases as a result of the algorthm s penalzaton of such users. The optmal allocaton of resources therefore tends to nvolve these lnks less and less. As p, the rate dstrbuton approaches the dstrbuton usng only the operator-controlled mcrocells. Also, although we cannot assess the absolute economc value of femtocell offload, we can conduct the followng smple comparson: Suppose the operator wshes to ncrease capacty of ts network. We compare the followng two methods: Increase operator-controlled cells: In ths method, the operator does not use any femtocells and ncreases capacty by addng operator-controlled mcro/macrocells only,.e. tradtonal cell splttng. To smulate ths scenaro, we magne a network wth all the parameters beng the same, except that the densty of the mcro/macrocells s ncreased by some factor α 1. Increasng the densty n ths manner wll ncur a varety of costs to the operator ncludng the captal and operatng expenses of the new base statons as well as the cost of the addtonal backhaul. For the moment, we wll only consder the addtonal backhaul costs. Then, as we vary α, we can estmate the gan n network capacty as a functon of the addtonal backhaul. Femto offload: As an alternate approach, we magne that the operator adds no new mcro/macro base staton cells of ts own and reles entrely on purchasng capacty va femto offload. To smulate ths scenaro, we fx an adopton rate at some reasonable value (we assume 5%), and then ncrease network capacty by lowerng the relatve cost p n (19), from p = (where the operator 6 It should be noted that loadng prce p s untless (as far as the resource assgnment algorthm s concerned) and smply represents the weght of the penalty ncurred on net utlty. Utlty geom. mean rates (Mbps/user) Utlty geom. mean rates (Mbps/user) rd party femto offload deployng macro/mcrocells prce=1. prce=.5 prce=.25 1 macro only Avg. addtonal backhaul rate (Mbps/user) (a) Urban scenaro 3rd party femto offload deployng macro/mcrocells Avg. addtonal backhaul rate (Mbps/user) (b) Suburban scenaro prce= Fg. 6: Average utlty as a functon of addtonal backhaul, comparng addng operator-controlled mcro/macrocells only vs. relyng entrely on femtocell offload. For the femtocell offload case, we assume a 5% adopton rate and vary the amount of backhaul used on the femtocells. uses no femtocell offload) to p = (where the network purchases any capacty on femtocells wthout regard to cost). Then, we can agan measure the ncrease n network capacty as a functon of the addtonal backhaul costs, where the addtonal backhaul n ths case s on the thrdparty femtocells. The results of ths comparson are shown n Fg. 6. Plotted s the system utlty as a functon of the addtonal backhaul requred for both methods addng operator-controlled macro/mcrocells, or offloadng to femtocells on exstng backhaul. We measure capacty va the utlty. Snce we assume a proportonal far utlty, log(rms ), the utlty s equvalent to the geometrc mean rate ( rms ) 1/N MS. The geometrc mean rate s a better measure of network capacty than average rate snce t penalzes mobles wth lower rates more sgnfcantly. Nevertheless, although t s not plotted, very smlar curves would be observed wth ether arthmetc mean rate or cell edge throughput. We see from Fg. 6 that, for the urban scenaro, ncreasng the utlty requres roughly the same amount of addtonal backhaul whether deployng more operator-controlled cells or usng femtocell offload. In the suburban scenaro, the femtocell offload requres sgnfcantly more addtonal backhaul for small ncreases n utlty, but requres only modestly more addtonal backhaul for larger ncreases n capacty.

9 9 Now, as dscussed n the Introducton, t s lkely that the backhaul from femtocell offload would be sgnfcantly lower cost than the purchasng leased lnes wth guaranteed rates needed for operator-controlled macro/mcrocells. Moreover, addng operator-deployed cells ncurs addtonal costs ncludng ste acquston, nfrastructure expenses and network mantenance 36. Nevertheless, quantfyng the exact savngs would requre further economc analyss. CONCLUSIONS We have presented a model for operators to offset backhaul costs by leveragng exstng capacty from thrd-partes. In the proposed model, thrd partes nstall open-access femtocells n ther networks and the cellular operator can then opt to move subscrbers onto thrd party cells for a fee. The problem of dynamcally assgnng users between the thrd-party and operator-controlled cells s formulated as an optmzaton problem. A dual decomposton algorthm s presented that s extremely general and can ncorporate channel and nterference condtons, traffc demands, backhaul capacty and access prcng. To evaluate the model, we consdered deployments where the thrd party femtocells were co-located wth exstng WF APs. Due to the large numbers of WF APs relatve to base staton cell stes, our smulatons suggest that network capacty be sgnfcantly ncreased even f only a small fracton (say 5%) of current WF owners deploy open-access femtocells. The gans are partcularly large n dense urban areas where our data suggests there are some 2 WF APs per operator cell. Our optmzaton can also ncorporate a varety of prcng mechansms by the thrd partes, but determnng the correct prce wll need analyss beyond the scope of ths study. However, our smulatons show that, whatever s the correct prce, the addtonal backhaul to ncrease capacty s smlar for both addng more operator-controlled cells or offloadng to thrd-party femtocells. Thus, assumng thrd party backhaul can be offered at a lower rate than leased lnes for operatorcontrolled cells, the savngs of the proposed method can be sgnfcant. In ths way, opportunstc backhaul can offer a scalable, low-cost method to ncrease network capacty and address the growng demands on cellular wreless networks. REFERENCES 1 D. Webster, Solvng the moble backhaul bottleneck, the moble backhaul bottleneck, Apr C. Mathas, Fxng the cellular network: Backhaul s the key, Dec H. Claussen, L. T. W. Ho, and L. Samuel, Fnancal analyss of a pcocellular home network deployment, Jun. 27, pp Senza Fl Consultng, Crucal economcs for moble data backhaul, Whtepaper avalable at 27-DC-LATEST.pdf, S. Cha, M. Gasparron, and P. Brck, The next challenge for cellular networks: backhaul, IEEE Mcrowave Magazne, vol. 1, no. 5, pp , May V. Chandrasekhar, J. G. Andrews, and A. Gatherer, Femtocell networks: A survey, IEEE Comm. Mag., vol. 46, no. 9, pp , Sep D. López-Pérez, A. Valcarce, G. de la Roche, and J. Zhang, OFDMA femtocells: A roadmap on nterference avodance, IEEE Comm. Mag., vol. 47, no. 9, pp , Sep J. G. Andrews, H. Claussen, M. Dohler, S. Rangan, and M. C. Reed, Femtocells: Past, present, and future, IEEE J. Sel. Areas Comm., vol. 3, no. 3, Apr J. Zhang and G. de la Roche, Femtocells: Technologes and Deployment. Chchester, UK: John Wley & Sons, J. Ramro and K. Hamed, Eds., Self-Organzng Networks (SON): Self- Plannng, Self-Optmzaton and Self-Healng for GSM, UMTS and LTE. Wley, M. Olsson, S. Sultana, S. Rommer, L. Frd, and C. Mullgan, SAE and the Evolved Packet Core: Drvng the Moble Broadband Revoluton. Academc Press, C. Km, R. Ford, Y. Q, and S. Rangan, Jont nterference and user assocaton optmzaton n cellular wreless networks, arxv preprnt, Apr Q. Ye, B. Rong, Y. Chen, M. Al-Shalash, C. Caramans, and J. G. Andrews, User assocaton for load balancng n heterogeneous cellular networks, IEEE Trans. Wreless Comm., Dec GPP, Further advancements for E-UTRA physcal layer aspects, TR (release 9), Qualcomm, Neghborhood small cells for hyperdense deployments: Takng hetnets to the next level, onlne Feb Fon, 17 R. Wauters, Fon ended 21 wth 3.35 mllon wf hotspots, 28 mllon n revenues, Feb S.-Y. Yun and Y. Y, The economc effects of sharng femtocells, IEEE J. Sel. Areas Comm., vol. 3, no. 3, pp , Apr F. P. Kelly, A. K. Maulloo, and D. K. H. Tan, Rate control for communcaton networks: shadow prces, proportonal farness and stablty, Journal of the Operatonal Research Socety, vol. 49, no. 3, pp , Mar L. A. DaSlva, Prcng for qos-enabled networks: A survey, IEEE Communcatons Surveys & Tutorals, vol. 3, no. 2, pp. 2 8, M. Yuksel and S. Kalyanaraman, Elastcty consderatons for optmal prcng of networks, Jul. 23, pp L. T. W. Ho, F. Mullany, H. Claussen, and L. Samuel, Autonomous organzaton of wreless network transport n a mult-provder envronment, Apr. 25, pp GPP, Local IP Access and Selected IP Traffc Offload, TR (release 1), G. Yuan, X. Zhang, W. Wang, and Y. Yang, Carrer aggregaton for LTE-Advanced moble communcaton systems, IEEE Comm. Mag., vol. 48, no. 2, pp , S. Rangan and R. Madan, Belef propagaton methods for ntercell nterference coordnaton n femtocell networks, IEEE J. Sel. Areas Comm., vol. 3, no. 3, pp , Apr M. Póro and D. Medh, Routng, Flow and Capacty Desgn n Communcaton and Computer Networks. Elsever, J. Nocedal and S. J. Wrght, Numercal Optmzaton. Sprnger Verlag, S. Boyd, N. Parkh, E. Chu, B. Peleato, and J. Ecksten, Dstrbuted optmzaton and statstcal learnng va the alternatng drecton method of multplers, Found. Trends Mach. Learn., vol. 3, no. 1, X. Zhang, M. Burger, and S. Osher, A unfed prmal-dual algorthm framework based on Bregman teraton, SIAM J. Sc. Comput., vol. 46, pp. 2 46, Femto Forum, Interference management n OFDMA femtocells, Whtepaper avalable at Mar ITU, M.2134: Requrements related to techncal performance for IMT- Advanced rado nterfaces, Techncal Report, OpenCellId, 33 Wgle, Wgle frequently asked questons, 34 Google, Google earth (verson 7), P. Mogensen, W. Na, I. Z. Kovács, F. Frederksen, A. Pokharyal, K. I. Pedersen, T. Koldng, K. Hugl, and M. Kuusela, LTE capacty compared to the Shannon bound, n Proc. IEEE VTC, Sgnals Research Group, Femtocell Busness Case, Femto Forum Whtepaper, Apr. 29.

Advanced radio access solutions for the new 5G requirements

Advanced radio access solutions for the new 5G requirements Advanced rado access solutons for the new 5G requrements Soumaya Hamouda Assocate Professor, Unversty of Carthage Tuns, Tunsa Soumaya.hamouda@supcom.tn IEEE Summt 5G n Future Afrca. May 3 th, 2017 Pretora,

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

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

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

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

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

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

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

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

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

Resource Allocation in Hybrid Macro/Femto Networks 1

Resource Allocation in Hybrid Macro/Femto Networks 1 Resource Allocaton n Hybrd acro/femto Networks Xaol Chu, Yuhua Wu Department of Electronc Engneerng Kng s College ondon ondon WCR S, UK E-mal: {xaol.chu, yuhua.wu}@kcl.ac.uk ama Benmesbah, Wng-Kuen ng

More information

Cognitive Radio Resource Management Using Multi-Agent Systems

Cognitive Radio Resource Management Using Multi-Agent Systems Cogntve Rado Resource Management Usng Mult- Systems Jang Xe, Ivan Howtt, and Anta Raja Department of Electrcal and Computer Engneerng Department of Software and Informaton Systems The Unversty of North

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

Wavefront Reconstructor

Wavefront Reconstructor A Dstrbuted Smplex B-Splne Based Wavefront Reconstructor Coen de Vsser and Mchel Verhaegen 14-12-201212 2012 Delft Unversty of Technology Contents Introducton Wavefront reconstructon usng Smplex B-Splnes

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

The Codesign Challenge

The 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 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

Clustering Based Adaptive Power Control for Interference Mitigation in Two-Tier Femtocell Networks

Clustering Based Adaptive Power Control for Interference Mitigation in Two-Tier Femtocell Networks KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS VOL. 8, NO. 4, Apr. 2014 1424 Copyrght c 2014 KSII Clusterng Based Adaptve Power Control for Interference Mtgaton n Two-Ter Femtocell Networks Hong

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

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

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT

DESIGNING 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 information

Biostatistics 615/815

Biostatistics 615/815 The E-M Algorthm Bostatstcs 615/815 Lecture 17 Last Lecture: The Smplex Method General method for optmzaton Makes few assumptons about functon Crawls towards mnmum Some recommendatons Multple startng ponts

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

MobileGrid: Capacity-aware Topology Control in Mobile Ad Hoc Networks

MobileGrid: 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 information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

Load-Balanced Anycast Routing

Load-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 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

A Semi-Distributed Load Balancing Architecture and Algorithm for Heterogeneous Wireless Networks

A 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 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

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

Network Coding as a Dynamical System

Network 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 information

Combined SINR Based Vertical Handoff Algorithm for Next Generation Heterogeneous Wireless Networks

Combined 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 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

Alternating Direction Method of Multipliers Implementation Using Apache Spark

Alternating Direction Method of Multipliers Implementation Using Apache Spark Alternatng Drecton Method of Multplers Implementaton Usng Apache Spark Deterch Lawson June 4, 2014 1 Introducton Many applcaton areas n optmzaton have benefted from recent trends towards massve datasets.

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning

Outline. Type of Machine Learning. Examples of Application. Unsupervised Learning Outlne Artfcal Intellgence and ts applcatons Lecture 8 Unsupervsed Learnng Professor Danel Yeung danyeung@eee.org Dr. Patrck Chan patrckchan@eee.org South Chna Unversty of Technology, Chna Introducton

More information

Pricing Network Resources for Adaptive Applications in a Differentiated Services Network

Pricing 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 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

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

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

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup

More information

Cost-efficient deployment of distributed software services

Cost-efficient deployment of distributed software services 1/30 Cost-effcent deployment of dstrbuted software servces csorba@tem.ntnu.no 2/30 Short ntroducton & contents Cost-effcent deployment of dstrbuted software servces Cost functons Bo-nspred decentralzed

More information

Concurrent Apriori Data Mining Algorithms

Concurrent Apriori Data Mining Algorithms Concurrent Apror Data Mnng Algorthms Vassl Halatchev Department of Electrcal Engneerng and Computer Scence York Unversty, Toronto October 8, 2015 Outlne Why t s mportant Introducton to Assocaton Rule Mnng

More information

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract

LS-TaSC Version 2.1. Willem Roux Livermore Software Technology Corporation, Livermore, CA, USA. Abstract 12 th Internatonal LS-DYNA Users Conference Optmzaton(1) LS-TaSC Verson 2.1 Wllem Roux Lvermore Software Technology Corporaton, Lvermore, CA, USA Abstract Ths paper gves an overvew of LS-TaSC verson 2.1,

More information

Categories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids Verification. General Terms Algorithms

Categories and Subject Descriptors B.7.2 [Integrated Circuits]: Design Aids Verification. General Terms Algorithms 3. Fndng Determnstc Soluton from Underdetermned Equaton: Large-Scale Performance Modelng by Least Angle Regresson Xn L ECE Department, Carnege Mellon Unversty Forbs Avenue, Pttsburgh, PA 3 xnl@ece.cmu.edu

More information

3. CR parameters and Multi-Objective Fitness Function

3. 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 information

Unsupervised Learning

Unsupervised Learning Pattern Recognton Lecture 8 Outlne Introducton Unsupervsed Learnng Parametrc VS Non-Parametrc Approach Mxture of Denstes Maxmum-Lkelhood Estmates Clusterng Prof. Danel Yeung School of Computer Scence and

More information

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique

The Greedy Method. Outline and Reading. Change Money Problem. Greedy Algorithms. Applications of the Greedy Strategy. The Greedy Method Technique //00 :0 AM Outlne and Readng The Greedy Method The Greedy Method Technque (secton.) Fractonal Knapsack Problem (secton..) Task Schedulng (secton..) Mnmum Spannng Trees (secton.) Change Money Problem Greedy

More information

Resource Control for Loss-Sensitive Traffic in CDMA Networks

Resource Control for Loss-Sensitive Traffic in CDMA Networks Resource Control for Loss-Senstve Traffc n CDMA Networks Vaslos A. Srs Insttute of Computer Scence, FORTH and Department of Computer Scence, Unversty of Crete P. O. Box 1385, GR 711 1, Heraklon, Crete,

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

Routing in Degree-constrained FSO Mesh Networks

Routing in Degree-constrained FSO Mesh Networks Internatonal Journal of Hybrd Informaton Technology Vol., No., Aprl, 009 Routng n Degree-constraned FSO Mesh Networks Zpng Hu, Pramode Verma, and James Sluss Jr. School of Electrcal & Computer Engneerng

More information

LECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming

LECTURE NOTES Duality Theory, Sensitivity Analysis, and Parametric Programming CEE 60 Davd Rosenberg p. LECTURE NOTES Dualty Theory, Senstvty Analyss, and Parametrc Programmng Learnng Objectves. Revew the prmal LP model formulaton 2. Formulate the Dual Problem of an LP problem (TUES)

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

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

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

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

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

Resource and Virtual Function Status Monitoring in Network Function Virtualization Environment

Resource 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 information

Transactions on Emerging Telecommunications Technologies. Scalability Study of Backhaul Capacity Sensitive Network Selection Scheme in LTE-WiFi HetNet

Transactions on Emerging Telecommunications Technologies. Scalability Study of Backhaul Capacity Sensitive Network Selection Scheme in LTE-WiFi HetNet Page of Transactons on Emergng Telecommuncatons Technologes 0 0 0 0 0 0 Scalablty Study of Backhaul Capacty Senstve Network Selecton Scheme n LTE-WF HetNet Alvn Tng, Davd Cheng, Kae Hsang Kwong Wreless

More information

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

BioTechnology. 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 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

Can Congestion Control and Traffic Engineering Be at Odds?

Can Congestion Control and Traffic Engineering Be at Odds? Can Congeston Control and Traffc Engneerng Be at Odds? Jayue He Dept. of EE, Prnceton Unversty Emal: jhe@prnceton.edu Mung Chang Dept. of EE, Prnceton Unversty Emal: changm@prnceton.edu Jennfer Rexford

More information

Control strategies for network efficiency and resilience with route choice

Control strategies for network efficiency and resilience with route choice Control strateges for networ effcency and reslence wth route choce Andy Chow Ru Sha Centre for Transport Studes Unversty College London, UK Centralsed strateges UK 1 Centralsed strateges Some effectve

More information

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices

An Application of the Dulmage-Mendelsohn Decomposition to Sparse Null Space Bases of Full Row Rank Matrices Internatonal Mathematcal Forum, Vol 7, 2012, no 52, 2549-2554 An Applcaton of the Dulmage-Mendelsohn Decomposton to Sparse Null Space Bases of Full Row Rank Matrces Mostafa Khorramzadeh Department of Mathematcal

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

Support Vector Machines

Support Vector Machines Support Vector Machnes Decson surface s a hyperplane (lne n 2D) n feature space (smlar to the Perceptron) Arguably, the most mportant recent dscovery n machne learnng In a nutshell: map the data to a predetermned

More information

Wireless Temperature Monitoring Overview

Wireless Temperature Monitoring Overview Wreless Temperature Montorng Overvew Wreless Temperature Montorng and Alerts. Your Dashboard gves you advanced montorng, alerts (SMS or Emals), graphng and PDF reports from anywhere n the world. Product

More information

LARRY SNYDER DEPT. OF INDUSTRIAL AND SYSTEMS ENGINEERING CENTER FOR VALUE CHAIN RESEARCH LEHIGH UNIVERSITY

LARRY SNYDER DEPT. OF INDUSTRIAL AND SYSTEMS ENGINEERING CENTER FOR VALUE CHAIN RESEARCH LEHIGH UNIVERSITY Faclty Locaton Models: An Overvew 1 LARRY SNYDER DEPT. OF INDUSTRIAL AND SYSTEMS ENGINEERING CENTER FOR VALUE CHAIN RESEARCH LEHIGH UNIVERSITY EWO SEMINAR SERIES APRIL 21, 2010 Outlne Introducton Taxonomy

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

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

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

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 STUDY OF THE SCALABILITY AND PERFORMANCE OF MULTI-LEVEL HIERARCHY FOR SCALABLE MOBILITY MANAGEMENT IN WIRELESS IPv6 NETWORKS

A STUDY OF THE SCALABILITY AND PERFORMANCE OF MULTI-LEVEL HIERARCHY FOR SCALABLE MOBILITY MANAGEMENT IN WIRELESS IPv6 NETWORKS A STUDY OF THE SCALABILITY AND PERFORMANCE OF MULTI-LEVEL HIERARCHY FOR SCALABLE MOBILITY MANAGEMENT IN WIRELESS IPv6 NETWORKS E.N. Onwua and Z. Nu State Key Lab on Mcrowave and Dgtal Communcaton Department

More information

Solution Brief: Creating a Secure Base in a Virtual World

Solution Brief: Creating a Secure Base in a Virtual World Soluton Bref: Creatng a Secure Base n a Vrtual World Soluton Bref: Creatng a Secure Base n a Vrtual World Abstract The adopton rate of Vrtual Machnes has exploded at most organzatons, drven by the mproved

More information

GSLM Operations Research II Fall 13/14

GSLM Operations Research II Fall 13/14 GSLM 58 Operatons Research II Fall /4 6. Separable Programmng Consder a general NLP mn f(x) s.t. g j (x) b j j =. m. Defnton 6.. The NLP s a separable program f ts objectve functon and all constrants are

More information

QoS-aware routing for heterogeneous layered unicast transmissions in wireless mesh networks with cooperative network coding

QoS-aware routing for heterogeneous layered unicast transmissions in wireless mesh networks with cooperative network coding Tarno et al. EURASIP Journal on Wreless Communcatons and Networkng 214, 214:81 http://wcn.euraspournals.com/content/214/1/81 RESEARCH Open Access QoS-aware routng for heterogeneous layered uncast transmssons

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

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier

Some material adapted from Mohamed Younis, UMBC CMSC 611 Spr 2003 course slides Some material adapted from Hennessy & Patterson / 2003 Elsevier Some materal adapted from Mohamed Youns, UMBC CMSC 611 Spr 2003 course sldes Some materal adapted from Hennessy & Patterson / 2003 Elsever Scence Performance = 1 Executon tme Speedup = Performance (B)

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

Intra-Parametric Analysis of a Fuzzy MOLP

Intra-Parametric Analysis of a Fuzzy MOLP Intra-Parametrc Analyss of a Fuzzy MOLP a MIAO-LING WANG a Department of Industral Engneerng and Management a Mnghsn Insttute of Technology and Hsnchu Tawan, ROC b HSIAO-FAN WANG b Insttute of Industral

More information

Motivation. EE 457 Unit 4. Throughput vs. Latency. Performance Depends on View Point?! Computer System Performance. An individual user wants to:

Motivation. EE 457 Unit 4. Throughput vs. Latency. Performance Depends on View Point?! Computer System Performance. An individual user wants to: 4.1 4.2 Motvaton EE 457 Unt 4 Computer System Performance An ndvdual user wants to: Mnmze sngle program executon tme A datacenter owner wants to: Maxmze number of Mnmze ( ) http://e-tellgentnternetmarketng.com/webste/frustrated-computer-user-2/

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

A Topology-aware Random Walk

A Topology-aware Random Walk A Topology-aware Random Walk Inkwan Yu, Rchard Newman Dept. of CISE, Unversty of Florda, Ganesvlle, Florda, USA Abstract When a graph can be decomposed nto clusters of well connected subgraphs, t s possble

More information

Game Based Virtual Bandwidth Allocation for Virtual Networks in Data Centers

Game Based Virtual Bandwidth Allocation for Virtual Networks in Data Centers Avaable onlne at www.scencedrect.com Proceda Engneerng 23 (20) 780 785 Power Electroncs and Engneerng Applcaton, 20 Game Based Vrtual Bandwdth Allocaton for Vrtual Networks n Data Centers Cu-rong Wang,

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

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

REDUCING transmit power and bandwidth consumption. Joint User Association and Resource Allocation Optimization for Ultra Reliable Low Latency HetNets

REDUCING transmit power and bandwidth consumption. Joint User Association and Resource Allocation Optimization for Ultra Reliable Low Latency HetNets IEEE TRANSACTIONS ON GREEN COMMUNICATIONS AND NETWORKING LATEX CLASS FILES, VOL., NO., SEP 2018 1 Jont User Assocaton and Resource Allocaton Optmzaton for Ultra Relable Low Latency HetNets Mohammad Yousefvand,

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

QoS-aware composite scheduling using fuzzy proactive and reactive controllers

QoS-aware composite scheduling using fuzzy proactive and reactive controllers Khan et al. EURASIP Journal on Wreless Communcatons and Networkng 2014, 2014:138 http://jwcn.euraspjournals.com/content/2014/1/138 RESEARCH Open Access QoS-aware composte schedulng usng fuzzy proactve

More information

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR

SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR SENSITIVITY ANALYSIS IN LINEAR PROGRAMMING USING A CALCULATOR Judth Aronow Rchard Jarvnen Independent Consultant Dept of Math/Stat 559 Frost Wnona State Unversty Beaumont, TX 7776 Wnona, MN 55987 aronowju@hal.lamar.edu

More information

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like:

Outline. Self-Organizing Maps (SOM) US Hebbian Learning, Cntd. The learning rule is Hebbian like: Self-Organzng Maps (SOM) Turgay İBRİKÇİ, PhD. Outlne Introducton Structures of SOM SOM Archtecture Neghborhoods SOM Algorthm Examples Summary 1 2 Unsupervsed Hebban Learnng US Hebban Learnng, Cntd 3 A

More information

CS246: Mining Massive Datasets Jure Leskovec, Stanford University

CS246: Mining Massive Datasets Jure Leskovec, Stanford University CS46: Mnng Massve Datasets Jure Leskovec, Stanford Unversty http://cs46.stanford.edu /19/013 Jure Leskovec, Stanford CS46: Mnng Massve Datasets, http://cs46.stanford.edu Perceptron: y = sgn( x Ho to fnd

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

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

THere are increasing interests and use of mobile ad hoc

THere are increasing interests and use of mobile ad hoc 1 Adaptve Schedulng n MIMO-based Heterogeneous Ad hoc Networks Shan Chu, Xn Wang Member, IEEE, and Yuanyuan Yang Fellow, IEEE. Abstract The demands for data rate and transmsson relablty constantly ncrease

More information

MOBILE Cloud Computing (MCC) extends the capabilities

MOBILE Cloud Computing (MCC) extends the capabilities 1 Resource Sharng of a Computng Access Pont for Mult-user Moble Cloud Offloadng wth Delay Constrants Meng-Hs Chen, Student Member, IEEE, Mn Dong, Senor Member, IEEE, Ben Lang, Fellow, IEEE arxv:1712.00030v2

More information

Optimization of Local Routing for Connected Nodes with Single Output Ports - Part I: Theory

Optimization of Local Routing for Connected Nodes with Single Output Ports - Part I: Theory U J.T. (: 33- (pr. 0 Optmzaton of Local Routng for Connected odes wth Sngle Output Ports - Part I: Theory Dobr tanassov Batovsk Faculty of Scence and Technology ssumpton Unversty Bangkok Thaland E-mal:

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

Lecture #15 Lecture Notes

Lecture #15 Lecture Notes Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal

More information

Optimal Caching Placement for D2D Assisted Wireless Caching Networks

Optimal Caching Placement for D2D Assisted Wireless Caching Networks Optmal Cachng Placement for DD Asssted Wreless Cachng Networks Jun Rao, ao Feng, Chenchen Yang, Zhyong Chen, and Bn Xa Department of Electronc Engneerng, Shangha Jao Tong Unversty, Shangha, P. R. Chna

More information