Search
Search Funnelback University
- Refined by:
- Date: 2011
41 -
50 of
58
search results for TALK:PC53 20 |u:www.statslab.cam.ac.uk
where 0
match all words and 58
match some words.
Results that match 1 of 2 words
-
p2pw6.dvi
www.statslab.cam.ac.uk/~rrw1/publications/Antoniadis%20-%20Courcoubetis%20-%20Weber%202004%20An%20Asymptotically%20Optimal%20Scheme%20for%20P2P%20File%20Sharing.pdf15 Nov 2011: 1. 2.5. 7.5. 12.5. 17.5. 20. 15. 10. Figure 2: Welfare gain of dial-up (group A) and DSL(group B) users when forming groups in which -
1034 IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. ...
www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%202006%20%20Incentives%20for%20large%20peer-to-peer%20systems.pdf15 Sep 2011: 20). Suppose that each peer incurs a cost that is proportional to thenumber of files he contributes. -
Preprint 0 (2000) 1{22 1Telecommunication Systems, 15(3-4):323-343,…
www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Kelly%20-%20Siris%20-%20Weber%202000%20A%20study%20of%20simple%20charging%20schemes%20for%20broadband%20networks.pdf15 Sep 2011: 0.2. 0.25. 0.3. 0.35. 0.4. 0.45. 0.5. 0 10 20 30 40 50 60 70 80. ... 20. 0.45. 0.5. 0.55. 0.6. 0.65. 0.7. 0.75. 0.8. 0.85. 0.9. -
LiuWeberZhao11CDC_revised.dvi
www.statslab.cam.ac.uk/~rrw1/publications/Liu%20-%20Weber%20-%20Zhao%202011%20Indexability%20and%20Whittle%20Index%20for%20restless%20bandit%20problems%20involving%20reset%20processes.pdf31 Oct 2011: Rw = K. (. 1 1. E[L]. ). , (20). where E[L] is the average length of the active period overthe infinite time horizon and all arms. ... To bound the throughput Rw, it is equivalent to bound theaverage length of the transmission period E[L] as shown -
Markov Chains, Computer Proofs, andAverage-Case Analysis of Best Fit…
www.statslab.cam.ac.uk/~rrw1/publications/Coffman%20-%20Johnson%20-%20Shor%20-%20Weber%201993%20Markov%20chains,%20computer%20proofs,%20and%20average-case%20analysis%20of%20best%20fit%20bin%20packing.pdf15 Sep 2011: c) there exist constants c,d 20 such that. IIsll s c$(s)dforalls e S,. ... The following iseasy to verify. Lemma 3.1. (i) IfK = 2r+ lor some integer r 20, thenn@ = x;=(tl)i. -
paper3.dvi
www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Kelly%20-%20Weber%202000%20Measurement%20based%20charging%20in%20communication%20networks.pdf15 Sep 2011: in the eective bandwidths are small as thetrac mix varies by 10-20%, whereas for small links the eect cannot be ignored. ... Pt1 xi=x p(x1;x2; : : : ;xt): (20)Then (m;h) = (1=st)log Y where Y is the optimal value attained in the linear programmaximize Xx -
wiopt.dvi
www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%202004%20Asymptotics%20for%20provisioning%20problems%20of%20peering%20wireless%20LANS%20with%20a%20large%20number%20of%20participants.pdf15 Sep 2011: i )) θ. i. ui(Q) ci(Qi)]. 0. (20). The proof is in the Appendix and is given for the more general case in which only payments in kindare possible. -
Z:/helmut/Projekte/JUCS_2008/accepted_papers/Soursos/source_files/sour…
www.statslab.cam.ac.uk/~rrw1/publications/Souros%20-%20Courcoubetis%20-Weber%202008%20Dynamic%20bandwidth%20pricing%20Provision%20cost%20market%20size%20effective%20bandwidths%20and%20price%20games.pdf15 Sep 2011: Figure 5 depicts how the equilibrium point moves as the provision unit costincreases, for a small market (n = 20). ... c) c = 0.4 (d) c = 0.5. Figure 5: The reaction curves for the providers of static(blue) and dy-namic(violet) providers, as c increases -
Buffer Overflow Asymptotics for a Buffer Handling Many Traffic Sources
www.statslab.cam.ac.uk/~rrw1/publications/Courcoubetis%20-%20Weber%201996%20%20Buffer%20overflow%20asymptotics%20for%20a%20switch%20handling%20many%20traffic%20sources.pdf15 Sep 2011: m2a = (mI -1)al2_i+ 2(a cx2. m. a"-I)a2. 1- a = (m- 1)a 2_ l• 20.22r2 1--x. ... Queueing Systems 20, 37-59. DUFFIELD, N. (1996) Economies of scale in queues with sources having power-law large deviation scalings. -
MunWebWei06JoS_2.dvi
www.statslab.cam.ac.uk/~rrw1/publications/Mundinger%20-%20Weber%20-%20Weiss%202008%20Optimal%20scheduling%20of%20peer-to-peer%20file%20dissemination.pdf15 Sep 2011: 1. peer-to-peer (P2P) systems such as BitTorrent [9], Slurpie [32], SplitStream [7], Bullet’ [20]and Avalanche [12], to name but a few. ... Other P2P overlaynetworks have also been proposed. For example see SplitStream [7] and Bullet’ [20].
Search history
Recently clicked results
Recently clicked results
Your click history is empty.
Recent searches
Recent searches
Your search history is empty.