Optimal Caching Placement for D2D Assisted Wireless Caching Networks
|
|
- Deirdre Marsh
- 5 years ago
- Views:
Transcription
1 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 Cooperatve Medanet Innovaton Center, Shangha, Chna Emal: {sjtu jun, fenghao, zhanchfexang, zhyongchen, arxv: v [cs.it] 3 Nov 05 Abstract In ths paper, we devse the optmal cachng placement to maxmze the offloadng probablty for a two-ter wreless cachng system, where the helpers and a part of users have cachng ablty. The offloadng comes from the local cachng, DD sharng and the helper transmsson. In partcular, to maxmze the offloadng probablty we reformulate the cachng placement problem for users and helpers nto a dfference of convex (DC) problem whch can be effectvely solved by DC programmng. Moreover, we analyze the two extreme cases where there s only help-ter cachng network and only user-ter. Specfcally, the placement problem for the helper-ter cachng network s reduced to a convex problem, and can be effectvely solved by the classcal water-fllng method. We notce that users and helpers prefer to cache popular contents under low node densty and prefer to cache dfferent contents evenly under hgh node densty. Smulaton results ndcate a great performance gan of the proposed cachng placement over exstng approaches. I. INTRODUCTION As more and more dfferent types of smart devces are produced and appled n people s daly lfe, wreless traffc demand has experenced an unprecedented growth. Csco s most recent report [] forecasts that the moble multmeda data wll grow at a compound annual growth rate of more than 60%. On the other hand, users demand for multmeda contents s hghly redundant,.e., a few popular contents account for a majorty of all requests []. Therefore, cachng popular contents at varous nodes n the network s a promsng approach to allevate the network bottleneck [3]. For the wreless cachng systems where helpers (WF, femtocells) have hgh storage capacty, the performance depends heavly on the adopted cachng replacement. The cachng placement for helpers s frstly nvestgated n [4] to mnmze the downloadng tme, where both uncoded and coded cases are consdered. It s shown that the optmzaton problem for the uncoded case s NP-hard. In addton, [5] consders the channel fadng factor and develops the cachng placement to mnmze the average bt error rate, where the optmal cachng placement s to balance between the channel dversty gan and the cachng dversty gan. Moreover, the problem of optmal MDS-encoded cachng placement at the wreless edge s nvestgated n [6] to mnmze the backhaul rate n heterogeneous networks. owever, all above analyses [4] [6] are based on the fxed topology between users and helpers. In [7], more realstc network models are adopted to characterze the stochastc natures of geographc locaton and the correspondng optmal cachng placements are derved accordng to the total ht probablty. On the other hand, the potental cache capacty at user sde can also be exploted, e.g., local cache offloadng or DD sharng. Varous works have been done on the cachng placement at user sde. In [8], the DD outage-throughput tradeoff problem s nvestgated and the optmal scalng laws are characterzed. [9] analyzes the scalng behavor of the throughput wth the number of devces per cell under Zpf dstrbuted content request probablty wth exponent γ r, and concludes that the optmal cache dstrbuton s also a Zpf dstrbuton wth a dfferent value γ c. By modelng the moble devces as a homogeneous Posson Pont Processes (PPP), [0] derves the optmal cache dstrbuton resultng n the total probablty of content delvery s maxmzed. owever, the local offloadng probablty s not consdered n ther analyss. In addton, coded cachng s also an effectve approach to explot the content dversty []. By cachng contents partally at user sde accordng to the developed cachng dstrbuton durng the frst phase, a coded multcastng opportunty can be created even for dfferent content requests n the second phase. Moreover, [] further proposes the herarchcal coded cachng to address the jont cachng placement problem at both users and helpers. owever, these analyses [] [3] are based on the fxed topology whch s not sutable for the user moblty scenaro. Despte the aforementoned studes, to the best of our knowledge, the optmal cachng placements for both helpers and users under realstc network models reman unsolved to date. Thus n ths paper, we consder a two-ter cachng system, where the helpers and users are spatally dstrbuted accordng to two mutually ndependent homogeneous Posson Pont Processes (PPPs) wth dfferent denstes [4]. In order to allevate the traffc load n the cellular network, we am to develop an optmal cachng placement scheme to maxmze the offloadng probablty, where the offloadng ncludes self-offloadng, DD-offloadng and helper-offloadng. More detals along wth the man contrbutons are as follows: We consder a DD asssted two-ter wreless cachng network consstng of users and helpers where the offloadng comes from self-offloadng, DD-offloadng and helperoffloadng. Dfferent from [0], we take self-offloadng events nto consderaton. Moreover, the practcal assumpton that only a part of users has cachng ablty
2 s consdered. We formulate the total offloadng probablty of cachng placement n the two-ter wreless networks and adopt the DC programmng to solve the non-convex maxmzaton problem. In addton, we notce that users and helpers ought to cache the popular contents whle the densty s low and ought to cache dfferent contents whle the densty s hgh. And our proposed cachng placement can acheve a balance between them. The two extreme cases for one-ter cachng systems are consdered. In absence of user cachng ablty, we formulate the cachng placement for helper-ter as a convex problem, and can be effectvely solved by the classcal waterfllng method; In absence of helper cachng ablty, the cachng placement for users s also formulated nto a convex problem. Furthermore, we combne the solutons of the two cases as a non-jont optmal cachng placement and compare t wth the proposed placement. II. SYSTEM MODEL AND CONTENT ACCESS PROTOCOL In ths secton, we frst ntroduce the two-tered cachng system as llustrated n Fg., where the helpers and users are spatally dstrbuted accordng to two mutually ndependent homogeneous Posson Pont Processes (PPPs) wth densty λ and λ, respectvely. Then the content access protocol s provded. A. System Model ) Content module: The content lbrary conssts of N contents. The popularty dstrbuton vector of the contents s denoted by q = {q,..., q N }, where q s the access probablty for the -th content. In ths paper, we characterze the popularty dstrbuton as a Zpf dstrbuton wth parameter γ []. If we arrange contents n descendng order of popularty, the popularty of the -th ranked content s [5] / γ q = N, () j= /jγ where γ governs the skewness of the popularty. The popularty s unform over contents for γ = 0, and becomes more skewed as γ grows. For smplcty, we assume all the N contents are of equal sze L. ) Network module: In addton to the macro base statons (BSs), the network module also conssts of the helpers wth cachng ablty, where helpers could successfully send the contents n ts local cache to requestng users wthn radus R at relatvely low cost. For smplcty, we assume the cachng capacty for all helpers are the same, denoted by M L, where M < N. Therefore, the helper can cache up to M dfferent contents entrely. Also we assume a content can only be cached entrely rather than partally. Denote the cachng placement at the helpers for each content as P = [p, p,..., p N ], where p s the proporton of helpers cachng the -th content and 0 p for =,,..., N. The cache storage constrant at the helpers can then be wrtten as N M. The helpers p cachng the -th content also follow a PPP wth densty λ p. (a) (c) (d) (d) (b) (a) elper User (c) (b) Cache Fg.. System model of the DD asssted wreless cachng system, where (a), (b), (c) and (d) stand for Self-offload, DD-offload, elper-offload and Celluar-response, respectvely. 3) User module: We assume part of the users havng cachng ablty. Let α denote the proporton of cache-enabled users, where 0 α. The cache-enabled users also follow a thnnng homogeneous PPP wth densty αλ. For smplcty, we assume the cachng capacty for the cacheenabled users are the same, denoted by M L. Therefore, cache-enabled users can cache up to M dfferent contents entrely n ts local cache. Moreover, a devce to devce (DD) communcaton can be establshed f the dstance between the requestng user and the user cachng the desred content s less than R, where R < R due to the transmttng power. Let P = [p, p,..., p N ] denote the cachng placement at the cache-enabled users for each content, where p s the proporton of users cachng the -th content, and 0 p for =,,..., N. The cache storage constrant at the cache-enabled users can then be wrtten as N p M. Therefore, the users cachng the -th content also follows a PPP wth densty αλ p. B. Content Access Protocol As ndcated n Fg., the content access protocol s as follows: (a) Self-offloadng: When a content request occurs, the user frst checks ts local storage whether the desred content has been stored n t. The request wll be satsfed and offloaded mmedately f the user has cached the desred content n ts local storage space. We term t as Selfoffloadng. (b) DD-offloadng: If the exact content has not been cached n the local storage or the requestng user does not have cache ablty, the user wll turn to search near devces for the desred content. If there s at least one users have stored the desred content wthn the radus R. The request would be met and offloaded by establshng a DD communcaton, termed as DD-offloadng. (c) elper-offloadng: In addton to DD-offloadng, f there s at least one helper have stored the desred content wthn R, the request would be satsfed and offloaded
3 by the helper transmsson, termed as elper-offloadng. (d) Cellular-response: If the request could not be offloaded va local cache, DD or the helpers then t need to be forwarded to the cellular base staton and the cellular network transmts the requested content n response. III. OFFLOADING PROBABILITY AND PROBLEM FORMULATION In ths paper, n order to allevate the traffc load from the cellular network, our goal s to fnd the optmal cachng placement to maxmze the offloadng probablty. Therefore, we frst analyze the offloadng probablty for the DD asssted wreless cachng network. Then, the optmal cachng placement problem s formulated. A. Offloadng probablty analyss For a PPP dstrbuton wth densty λ, the probablty that there are n devces n the area wthn a radus r s: F(n, r, λ) = (πr λ) n n! e πr λ Therefore, for a reference user located at the orgn, the probablty of at least another user cachng the -th content wthn the transmsson range s P DD,off = F(0, R, αλ p ) = e παλp R. (3) Smlarly, the probablty of at least one helper cachng the -th content wthn the radus R s () P,off = F(0, R, λ p ) = e πλp R. (4) The offloadng probablty for the th content of cacheunabled users,.e the probablty at least one helper or one user cachng the -th content s: P,NC = ( P DD,off )( P,off) = e (παλp R +πλ p R). The correspondng offloadng probablty of the cache-enabled users for the -th content s P,C = p (5) + ( p )P,NC. (6) Therefore, the offloadng probablty for the -th content becomes P,off =αp,c + ( α)p,nc = ( αp )e (παλp R +πλ p R). The total offloadng probablty for the DD asssted wreless cachng system becomes P off = (7) q P,off, (8) whle more data offloaded by the wreless cachng network, less data needs to be sent va the cellular network, allevatng the traffc load for the cellular network. B. Problem Formulaton Let P = [P P ] denotes the cachng placement at helper and user sdes. The optmal cachng placement that maxmzes the offloadng probablty for the wreless cachng network can be formulated as max q P,off (9) P p M s.t. M. (0) p 0 p, {,..., N} 0 p, {,..., N} IV. DC PROGRAMMING FOR CACING PLACEMENT OPTIMIZATION In ths secton, we adopt the dfference of convex (DC) program to solve the above problem. The maxmzaton problem s equvalent to the followng mnmzaton problem: mn P s.t. q P,off () p p M M 0 p, {,..., N} 0 p, {,..., N}. () Let F (P) = N q P,off denote the objectve functon n problem () and t can be easly verfed that the hessan matrx of F (P) s not postve defnte and hence F (P) s non-convex. Let (P) = n q h, where h = απλ R (p + p ). Denote G(P) = F (P) + (P), we then have the followng proposton. Proposton : (P) and G(P) are both convex of P. Proof: Let A denote the hessan matrx of h A = h h (p ) p p h h p p (p ) [ απλ R = 0 0 απλ R ence the matrx A s postve defnte and h s convex. Snce the lnear combnaton of convex functons s also convex, (P) s convex. Smlarly, we have the hessan matrx of G(P) s defnte and G(P) convex of P. ence, F (P) can be wrtten as a dfference of the followng two convex functons: ]. F (P) = G(P) (P). (3) Therefore, we adopt the DC programmng to solve ths problem. DC programmng s a quck convergence programmng whch can obtan a partal optmal soluton and sometmes the global optmal soluton of a non-convex functon [6]. Snce (P) P s contnuous and the constrant of problem () s a
4 convex set, the DC programmng can be smply descrbed n Algorthm. The result wll be llustrated n secton VI. 6 5 lnq πλ R p Algorthm DC programmng for cachng placement : ntal value: P 0 = M N, P 0 = M N ; : solve the convex optmzaton problem: mn G(P) (P k ) (P P k ) (P k) P s.t.(); 3: the soluton of step s P k+ ; 4: f F (P k ) F (P k+ ) ε or P k P k+ ε,p k s the optmal soluton of F (P); otherwse,return to step ; 5: RETURN:the result s:f (P k ),the soluton s: P k ; p lnq πλr β4 3 Water Level V. EXTREME CASE ANALYSES In ths secton, we consder the cachng problem under extreme cases where only one ter of the cachng system s consdered and the optmal cachng placement can be calculated. We analyze the cachng placement of the two extreme cases and combne the solutons as a baselne. A. α = 0: helper-ter cachng network ) problem formulaton: In ths case, all users have no cachng ablty and we only need to optmze the cachng placement P at helper sde. The offloadng probablty for the -th content s reduced to P,off = P,off = e πλp R (4) Problem () can be wrtten as mn q ( e πλp R ) (5) P p s.t. M, (6) 0 p, {,..., N} Lemma : (Water-fllng method) The optmal cachng placement of the helpers s ( p = mn (β + ln q ) πλ R )+, (7) for =,,..., N, where x + = max (x, 0) and β s effectvely solved by the bsecton search wth N p = M. Proof: The second dervatve of P,off s P,off = π λ Re 4 πλp R p < 0, (8) thus P,off s convex n p and the objectve functon N q P,off s also convex. Therefore, the cachng placement optmzaton problem s a convex problem. Consder the followng Lagrangan L = q ( e πλp R ) + µ( p M ) (9) Content No. Fg.. Optmal cachng placement at helper sde under the settngs N = 0, γ =, M = 4, λ = 0 π500. where µ s the Lagrange multpler. The KKT condton for the optmalty of a cachng placement s L = 0 f 0 < p < p = πλ R q e πλp R +µ 0 f p = 0. 0 f p = (0) Let β = ln (πλr ) ln µ πλ R and x + = max (x, 0), we then have p ( = mn (β + ln q ) πλ R )+,, () where β can be solved by the bsecton search method under the cache storage constrant. As llustrated n Fg., the water-fllng method allocate more cache probablty to contents wth larger popularty. For nstance, the contents wth larger populartes under the water level,.e., the frst content and the second contents have been cached n all helpers. Whle the contents wth smaller popularty above the water level,.e., the 7-th content to the last content, have not been cached n any helper. Remark : Accordng to Lemma, t s straghtforward that the most popular contents are cached n helper storage under relatvely low helper densty.e., p =... = p M = and p M =... = + p N = 0. Whle under relatvely hgh densty, contents are evenly cached at helper sde,.e, p =... = p N = M N. B. λ M = 0: user-ter cachng network In ths case, no helpers wth cachng ablty partcpate n offloadng the user requests, the optmzaton problem s reduced to the optmal cachng placement of p. We thus rewrtten the functon of offloadng probablty as: P,off = ( αp )e παλp R. ()
5 TABLE I DEFAULT PARAMETER SETTING Parameters values DD communcaton range:r 5(m) helper transmsson range:r 00 (m) the proporton of cache-enabled users:α the densty of users:λ 5000/π500 the densty of helpers:λ 50/π500 the cache capacty of users and helpers M = ; M = 8 the sze of content lbrary:n 30 the skewness of the popularty:γ TABLE II DIFFERENT CACING SCEMES Schemes cachng schemes of users cachng schemes of helpers popular cache p =, [, M ] p =, [, M ] p j = 0, j [M +, N] p j = 0, j [M +, N] even cache P = M /N P = M /N Non-jont the soluton of Problem (3) the soluton of problem (5) Offloadng Probablty Non jont elper Densty λ x 0 4 Fg. 3. The mpact of λ on the offloadng probablty Then problem () becomes mn P s.t. p q ( ( αp )e παλp R ) (3) M 0 p, {,..., N}, (4) Proposton : The above problem s also a convex problem. Proof: The second dervatve of the objectve functon becomes P,off = [αb + b ( αp p )]e bp < 0, (5) where b = παλ R. Therefore, P,off s convex n and the objectve functon N q P,off s also convex. p Therefore, the cachng placement optmzaton problem s convex. As a result, we can adopt a nter-pont method to acheve the optmal soluton [7]. VI. SIMULATIONS In ths secton, we provde some numercal results to verfy our analyss and compare the performance of the proposed cachng placement wth other baselnes. Parameter settng and the three baselnes are descrbed n Table I and Table II. In partcular, we combne the optmal solutons of the two oneter cachng cases as a baselne and named t non-jont optmal cachng placement. Fg. 3 shows that the offloadng probablty ncreases wth helper densty λ. The performance of the proposed cachng placement s better than other three baselnes no matter how λ changes. When λ = 0, the performance of the proposed cachng placement s equal to the non-jont one, because n ths stuaton there are no helpers jonng to offload traffc data. Offloadng Probablty Non jont User Densty λ Fg. 4. The mpact of λ on the offloadng probablty Wth the ncreasng of λ, the performance of the proposed cachng placement becomes better than the non-jont one. Whle λ s consderable large, non-jont cachng placement approaches to the proposed scheme agan. That s because the cachng placement of non-jont schemes s also a optmal soluton when there s only helper-ter, and the offloadng s mostly conssted of helper-ter n ths stuaton. From Fg. 4 we can draw a smlar concluson about λ. Furthermore, from Fg. 3 and Fg. 4, we can see that when both of λ and λ are small, the performance of even cache scheme s the worst one. As λ or λ ncreases, the performance of even cache scheme becomes better. When λ = 0 4 and λ =. 0, t exceeds over the popular cache scheme. That s because whle there are few devces partcpatng n the cachng network, users and helpers need to cache popular contents to cope wth the correspondng hgh request probablty, thus the popular cache scheme performs well; When the resource of the cachng network s rch.e the node densty s relatvely hgh, the offloadng probabltes for the most popular contents are easly satsfed, and the surplus
6 Cachng Probablty p p p 3 p 4 p 5 p p 0.3 p 3 0. p 4 0. p User Densty λ Offloadng Probablty Non jont Zpf Parameter γ Fg. 5. the cachng placement of the proposed placement Fg. 7. The mpact of γ on the offloadng probablty Offloadng Probablty Non jont Offloadng Probablty Non jont 0 0. Proporton of Cache enable Users α Fg. 6. The mpact of α on the offloadng probablty storage can be used to cache other relatvely less popular contents. So the even cache scheme performs better and the offloadng probablty of popular cache scheme no longer ncreases. When λ s consderable large, the performance of even cache scheme approaches to the optmal cachng placement. In Fg. 5, we demonstrate the proposed cachng placement whch s calculated by DC programmng where N = 5, M =, M = 3. As λ ncreases, we can see that the optmal cachng placement changes from a popular cache scheme to a even cache scheme whch s consstent wth our analyss. Fg. 6 llustrates the mpact of α on offloadng probablty, where α stands for the proporton of cache-enabled users. When α = 0, the system reduces to a helper-ter cachng system hence, the offloadng probablty of the proposed cachng placement s equal to the non-jont one. Whle α s larger, there are more cache-enabled users jonng n the cachng system and therefore the offloadng probablty wll ncrease. And we can see that whle α 0, the performance of the proposed placement s clearly better than the non-jont one Content Lbrary Sze N Fg. 8. The mpact of N on the offloadng probablty In ths paper, γ s denoted as the skewness of content popularty. Whle γ s large, the user requests focus on the popular contents and the cachng system may have large probabltes to cache the rght contents. Therefore the offloadng probablty usually ncreases wth γ and we show t n Fg. 7. The performance of popular cache scheme grows rapdly wth ncreasng γ whle the performance of even cache scheme s not affected by γ, because t caches every content wth a same probablty. Fg. 8 llustrates that the offloadng probablty decreases wth N. To expand the sze of content lbrary N, n a sense, s smlar to reduce the cache capacty M, thus the offloadng probablty wll experence a declne accordngly. owever we can notce that the performance of our proposed cachng placement s stll well. It demonstrates that when the system s appled nto a mult-contents stuaton, the proposed cachng placement can fnely adjust the cachng proporton of each content by a jont optmzaton and keep a good performance.
7 VII. CONCLUSION In ths paper, the optmal cachng placement are proposed to maxmze the total offloadng probablty for the DD asssted wreless cachng network. Specfcally, the cachng placement problem for the two-ter cachng network s formulated as a DC problem and be solved by the DC programmng. In addton, the extreme analyss are provded for helper-ter (or user-ter) cachng case n absence of the other ter. The cachng placements for both cases are proved to be convex. Moreover, the classcal water-fllng method s adopted to solve the helper-ter cachng case. Smulaton results ndcate the most popular contents are ought to be cached under relatvely low node densty, whle contents are ought to be cached evenly under relatvely hgh node densty. And our proposed cachng placement can always make a balance of that. REFERENCES [] Csco, Csco Vsual Networkng Index: Global Moble Data Traffc Forecast Update, 04-09, Whter paper, Feb. 05. [] M. Cha,. Kwak, P. Rodrguez, Y. Ahn, and S. Moon, I tube, you tube, everybody tubes: analyzng the world s largest user generated content vdeo system, n Proc. ACM SIGCOMM Internet Measurement, Oct. 007, pp. 4. [3]. Lu, Z. Chen, X. Tan, X. Wang, and M. Tao, On content-centrc wreless delvery networks, IEEE Wreless Communcatons, vol., no. 6, pp. 8 5, December 04. [4] K. Shanmugam, N. Golrezae, A. Dmaks, A. Molsch, and G. Care, Femtocachng: Wreless content delvery through dstrbuted cachng helpers, IEEE Trans. Informaton Theory, vol. 59, no., pp , Dec. 03. [5] J. Song,. Song, and W. Cho, Optmal cachng placement of cachng system wth helpers, n Proc. IEEE ICC 05, Jun. 05, pp [6] V. Boglo, F. Gabry, and I. Land, Optmzng mds codes for cachng at the edge, to appear n Proc. IEEE GLOBECOM 05, Dec. 05. [7] B. Blaszczyszyn and A. Govands, Optmal geographc cachng n cellular networks, n Proc. IEEE ICC 05, June 05, pp [8] M. J, G. Care, and A. Molsch, The throughput-outage tradeoff of wreless one-hop cachng networks, IEEE Trans. Informaton Theory, vol. PP, no. 99, pp., Oct. 05. [9] N. Golrezae, A. Dmaks, and A. Molsch, Devce-to-devce collaboraton through dstrbuted storage, n Proc. IEEE GLOBECOM 0, Dec 0, pp [0] D. Malak and M. Al-Shalash, Optmal cachng for devce-to-devce content dstrbuton n 5g networks, n IEEE GLOBECOM Wkshps, Dec. 04, pp [] M. Maddah-Al and U. Nesen, Fundamental Lmts of Cachng, IEEE Trans. Inf. Theory, vol. 6, no., pp. 5 39, May 04. [] N. Karamchandan, U. Nesen, M. Maddah-Al, and S. Dggav, erarchcal coded cachng, n Proc. IEEE ISIT 04, June 04, pp [3] M. J, A. M. Tulno, J. Llorca, and G. Care, Order-Optmal Rate of Cachng and Coded Multcastng wth Random Demands, Feb. 05. [4] C. Yang, Y. Yao, Z. Chen, and B. Xa, Analyss on cache-enabled wreless heterogeneous networks, IEEE Trans. Wreless Communcatons, vol. PP, no. 99, pp., 05. [5] K. Wang, Z. Chen, and. Lu, Push-based wreless converged networks for massve multmeda content delvery, IEEE Trans. Wreless Communcatons, vol. 3, no. 5, pp , May 04. [6] P. D. Tao et al., The dc (dfference of convex functons) programmng and dca revsted wth dc models of real world nonconvex optmzaton problems, Annals of Operatons Research, vol. 33, no. -4, pp. 3 46, 005. [7] S. Boyd and L. Vandenberghe, Convex optmzaton. Cambrdge unversty press, 004.
Distortion-Memory Tradeoffs in Cache-Aided Wireless Video Delivery
Dstorton-Memory Tradeoffs n Cache-Aded Wreless Vdeo Delvery P. Hassanzadeh, E. Erkp, J. Llorca, A. Tulno arxv:1511.03932v1 [cs.it] 12 Nov 2015 Abstract Moble network operators are consderng cachng as one
More informationGSLM 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 informationAdvanced 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 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 informationAnalysis 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 informationSupport 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 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 informationPositive Semi-definite Programming Localization in Wireless Sensor Networks
Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer
More 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 informationOverview. 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 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 informationOn the Exact Analysis of Bluetooth Scheduling Algorithms
On the Exact Analyss of Bluetooth Schedulng Algorth Gl Zussman Dept. of Electrcal Engneerng Technon IIT Hafa 3000, Israel glz@tx.technon.ac.l Ur Yechal Dept. of Statstcs and Operatons Research School of
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 informationOnline Policies for Opportunistic Virtual MISO Routing in Wireless Ad Hoc Networks
12 IEEE Wreless Communcatons and Networkng Conference: Moble and Wreless Networks Onlne Polces for Opportunstc Vrtual MISO Routng n Wreless Ad Hoc Networks Crstano Tapparello, Stefano Tomasn and Mchele
More informationUtility Constrained Energy Minimization In Aloha Networks
Utlty Constraned Energy nmzaton In Aloha Networks Amrmahd Khodaan, Babak H. Khalaj, ohammad S. Taleb Electrcal Engneerng Department Sharf Unversty of Technology Tehran, Iran khodaan@ee.shrf.edu, khalaj@sharf.edu,
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 informationRepeater Insertion for Two-Terminal Nets in Three-Dimensional Integrated Circuits
Repeater Inserton for Two-Termnal Nets n Three-Dmensonal Integrated Crcuts Hu Xu, Vasls F. Pavlds, and Govann De Mchel LSI - EPFL, CH-5, Swtzerland, {hu.xu,vasleos.pavlds,govann.demchel}@epfl.ch Abstract.
More informationBuffer-aided link selection with network coding in multihop networks
Loughborough Unversty Insttutonal Repostory Buffer-aded lnk selecton wth network codng n multhop networks Ths tem was submtted to Loughborough Unversty's Insttutonal Repostory by the/an author. Ctaton:
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 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 informationQoS-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 informationBiostatistics 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 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 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 informationOutline. 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 informationDUE to the recent popularization of hand-held mobile
IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 15, NO. 4, APRIL 2016 803 Contact Duraton Aware Data Replcaton n DTNs wth Lcensed and Unlcensed Spectrum Jng Zhao, Student Member, IEEE, Xuejun Zhuo, Qnghua
More informationSpatially Coupled Repeat-Accumulate Coded Cooperation
Spatally Coupled Repeat-Accumulate Coded Cooperaton Naok Takesh and Ko Ishbash Advanced Wreless Communcaton Research Center (AWCC) The Unversty of Electro-Communcatons, 1-5-1 Chofugaoka, Chofu-sh, Tokyo
More informationModeling Local Uncertainty accounting for Uncertainty in the Data
Modelng Local Uncertanty accontng for Uncertanty n the Data Olena Babak and Clayton V Detsch Consder the problem of estmaton at an nsampled locaton sng srrondng samples The standard approach to ths problem
More informationA Load-balancing and Energy-aware Clustering Algorithm in Wireless Ad-hoc Networks
A Load-balancng and Energy-aware Clusterng Algorthm n Wreless Ad-hoc Networks Wang Jn, Shu Le, Jnsung Cho, Young-Koo Lee, Sungyoung Lee, Yonl Zhong Department of Computer Engneerng Kyung Hee Unversty,
More informationLobachevsky State University of Nizhni Novgorod. Polyhedron. Quick Start Guide
Lobachevsky State Unversty of Nzhn Novgorod Polyhedron Quck Start Gude Nzhn Novgorod 2016 Contents Specfcaton of Polyhedron software... 3 Theoretcal background... 4 1. Interface of Polyhedron... 6 1.1.
More informationAnalysis 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 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 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 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 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 informationLECTURE 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 informationShared Running Buffer Based Proxy Caching of Streaming Sessions
Shared Runnng Buffer Based Proxy Cachng of Streamng Sessons Songqng Chen, Bo Shen, Yong Yan, Sujoy Basu Moble and Meda Systems Laboratory HP Laboratores Palo Alto HPL-23-47 March th, 23* E-mal: sqchen@cs.wm.edu,
More informationA Decentralized Lifetime Maximization Algorithm for Distributed Applications in Wireless Sensor Networks
A Decentralzed Lfetme Maxmzaton Algorthm for Dstrbuted Applcatons n Wreless Sensor Networks Vrgna Pllon, Mauro Franceschell, Lug Atzor, Alessandro Gua Dept. of Electrcal and Electronc Engneerng, Unversty
More informationKent State University CS 4/ Design and Analysis of Algorithms. Dept. of Math & Computer Science LECT-16. Dynamic Programming
CS 4/560 Desgn and Analyss of Algorthms Kent State Unversty Dept. of Math & Computer Scence LECT-6 Dynamc Programmng 2 Dynamc Programmng Dynamc Programmng, lke the dvde-and-conquer method, solves problems
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 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 informationHermite 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 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 informationClustering 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 informationContact Duration Aware Data Replication in Delay Tolerant Networks
Contact Duraton Aware Data Replcaton n Delay Tolerant Networks Xuejun Zhuo, Qnghua L, We Gao, Guohong Cao, Yq Da Tsnghua Natonal Laboratory for Informaton Scence and Technology, Tsnghua Unversty, Chna.
More informationMeta-heuristics for Multidimensional Knapsack Problems
2012 4th Internatonal Conference on Computer Research and Development IPCSIT vol.39 (2012) (2012) IACSIT Press, Sngapore Meta-heurstcs for Multdmensonal Knapsack Problems Zhbao Man + Computer Scence Department,
More 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 informationCan 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 informationUnsupervised 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 informationCellular Traffic Offloading through Opportunistic Communications Based on Human Mobility
KSII TRANSACTIONS ON INTERNET AND INFORMATION SYSTEMS VOL. 9, NO. 3, Mar. 2015 872 Copyrght c 2015 KSII Cellular Traffc Offloadng through Opportunstc Communcatons Based on Human Moblty Zhgang L 1, Yan
More informationNeural Network Control for TCP Network Congestion
5 Amercan Control Conference June 8-, 5. Portland, OR, USA FrA3. Neural Network Control for TCP Network Congeston Hyun C. Cho, M. Sam Fadal, Hyunjeong Lee Electrcal Engneerng/6, Unversty of Nevada, Reno,
More informationMOBILE 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 informationRelated-Mode Attacks on CTR Encryption Mode
Internatonal Journal of Network Securty, Vol.4, No.3, PP.282 287, May 2007 282 Related-Mode Attacks on CTR Encrypton Mode Dayn Wang, Dongda Ln, and Wenlng Wu (Correspondng author: Dayn Wang) Key Laboratory
More informationS1 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 informationSolving 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 informationThe 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 informationMessage-Passing Algorithms for Quadratic Programming Formulations of MAP Estimation
Message-Passng Algorthms for Quadratc Programmng Formulatons of MAP Estmaton Akshat Kumar Department of Computer Scence Unversty of Massachusetts Amherst akshat@cs.umass.edu Shlomo Zlbersten Department
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 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 information6.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 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 informationSubspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;
Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features
More informationA Robust Method for Estimating the Fundamental Matrix
Proc. VIIth Dgtal Image Computng: Technques and Applcatons, Sun C., Talbot H., Ourseln S. and Adraansen T. (Eds.), 0- Dec. 003, Sydney A Robust Method for Estmatng the Fundamental Matrx C.L. Feng and Y.S.
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 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 informationPerformance Evaluation of Information Retrieval Systems
Why System Evaluaton? Performance Evaluaton of Informaton Retreval Systems Many sldes n ths secton are adapted from Prof. Joydeep Ghosh (UT ECE) who n turn adapted them from Prof. Dk Lee (Unv. of Scence
More informationAn 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 informationProper Choice of Data Used for the Estimation of Datum Transformation Parameters
Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and
More informationSum 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 informationA Novel Cooperative Content Fetching-based Strategy to Increase the Quality of Video Delivery to Mobile Users in Wireless Networks
1 A Novel Cooperatve Content Fetchng-based Strategy to Increase the Qualty of Vdeo Delvery to Moble Users n Wreless Networks She Ja, Changqao Xu, Member, IEEE, Janfeng Guan, Hongke Zhang and Gabrel-Mro
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 informationSmoothing 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 informationSteps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices
Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between
More informationHelsinki 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 informationFor 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 informationMULTIHOP wireless networks are a paradigm in wireless
400 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 17, NO. 1, JANUARY 2018 Toward Optmal Dstrbuted Node Schedulng n a Multhop Wreless Network Through Local Votng Dmtros J. Vergados, Member, IEEE, Natala
More informationControl 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 informationMinimization of the Expected Total Net Loss in a Stationary Multistate Flow Network System
Appled Mathematcs, 6, 7, 793-87 Publshed Onlne May 6 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/.436/am.6.787 Mnmzaton of the Expected Total Net Loss n a Statonary Multstate Flow Networ System
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 informationTHere 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 informationOptimal Rate Allocation for ISP-friendly P2P VoD Systems
JOURNAL OF NETWORKS, VOL. 9, NO. 7, JULY 0 7 Optmal Rate Allocaton for ISP-frendly PP VoD Systems Yun He, Zhongyang Xong, and Xaoln Tan Department of Computer Scence, Chongqng Unversty, Chongqng 000, Chna
More informationChannel 0. Channel 1 Channel 2. Channel 3 Channel 4. Channel 5 Channel 6 Channel 7
Optmzed Regonal Cachng for On-Demand Data Delvery Derek L. Eager Mchael C. Ferrs Mary K. Vernon Unversty of Saskatchewan Unversty of Wsconsn Madson Saskatoon, SK Canada S7N 5A9 Madson, WI 5376 eager@cs.usask.ca
More informationLocalTree: An Efficient Algorithm for Mobile Peer-to-Peer Live Streaming
LocalTree: An Effcent Algorthm for Moble Peer-to-Peer Lve Streamng Bo Zhang S.-H. Gary Chan Department of Comp. Sc. & Eng. The Hong Kong Un. of Sc. & Tech. Clear Water Bay, Hong Kong Emal: {zhangbo, gchan}@cse.ust.hk
More informationA Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme
Mathematcal and Computatonal Applcatons Artcle A Fve-Pont Subdvson Scheme wth Two Parameters and a Four-Pont Shape-Preservng Scheme Jeqng Tan,2, Bo Wang, * and Jun Sh School of Mathematcs, Hefe Unversty
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 informationOptimized caching in systems with heterogeneous client populations
Performance Evaluaton 42 (2000) 163 185 Optmzed cachng n systems wth heterogeneous clent populatons Derek L. Eager a,, Mchael C. Ferrs b, Mary K. Vernon b a Department of Computer Scence, Unversty of Saskatchewan,
More informationA 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 informationSolitary and Traveling Wave Solutions to a Model. of Long Range Diffusion Involving Flux with. Stability Analysis
Internatonal Mathematcal Forum, Vol. 6,, no. 7, 8 Soltary and Travelng Wave Solutons to a Model of Long Range ffuson Involvng Flux wth Stablty Analyss Manar A. Al-Qudah Math epartment, Rabgh Faculty of
More information2 optmal per-pxel estmate () whch we had proposed for non-scalable vdeo codng [5] [6]. The extended s shown to accurately account for both temporal an
Scalable Vdeo Codng wth Robust Mode Selecton Ru Zhang, Shankar L. Regunathan and Kenneth Rose Department of Electrcal and Computer Engneerng Unversty of Calforna Santa Barbara, CA 906 Abstract We propose
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 Saturation Binary Neural Network for Crossbar Switching Problem
A Saturaton Bnary Neural Network for Crossbar Swtchng Problem Cu Zhang 1, L-Qng Zhao 2, and Rong-Long Wang 2 1 Department of Autocontrol, Laonng Insttute of Scence and Technology, Benx, Chna bxlkyzhangcu@163.com
More informationSciFed Journal of Telecommunication Single Fitness Function to Optimize Energy using Genetic Algorithms for Wireless Sensor Network
Ismal Abdullah,, 2017, 1:1 ScFed Journal of Telecommuncaton Research Artcle Open Access Sngle Ftness Functon to Optmze Energy usng Genetc Algorthms for Wreless Sensor Network *1 Ismal Abdullah, 2 Kald
More informationA NOTE ON FUZZY CLOSURE OF A FUZZY SET
(JPMNT) Journal of Process Management New Technologes, Internatonal A NOTE ON FUZZY CLOSURE OF A FUZZY SET Bhmraj Basumatary Department of Mathematcal Scences, Bodoland Unversty, Kokrajhar, Assam, Inda,
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 informationSupport Vector Machines. CS534 - Machine Learning
Support Vector Machnes CS534 - Machne Learnng Perceptron Revsted: Lnear Separators Bnar classfcaton can be veed as the task of separatng classes n feature space: b > 0 b 0 b < 0 f() sgn( b) Lnear Separators
More informationREDUCING 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 informationMinimum Cost Optimization of Multicast Wireless Networks with Network Coding
Mnmum Cost Optmzaton of Multcast Wreless Networks wth Network Codng Chengyu Xong and Xaohua L Department of ECE, State Unversty of New York at Bnghamton, Bnghamton, NY 13902 Emal: {cxong1, xl}@bnghamton.edu
More informationThe Hybrid Mobile Wireless Sensor Networks for Data Gathering
The Hybrd Moble Wreless Sensor Networks for Data Gatherng Bao Ren Bejng Unv. of Posts & Telecommuncatons, Bejng 876, Chna +86--62287 renb@bupt.edu.cn Jan Ma Noka Research Center, Bejng 3, Chna +86--65392828-2883
More informationFixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations
Fxng Max-Product: Convergent Message Passng Algorthms for MAP LP-Relaxatons Amr Globerson Tomm Jaakkola Computer Scence and Artfcal Intellgence Laboratory Massachusetts Insttute of Technology Cambrdge,
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 information