DOWNLOAD MY Ph.D Thesis - UNAM

More documents

Recommendations

Info

Chapter 6Optimisation of CRA using adaptive CSAs pSystem Throughput (%)45.445.3Es-6 / Es-745.245.1Es-8/ Es-945.044.944.8Es-444.744.644.53 Mbps Upstream44.49.7 Kbps kbps VoIP44.3Tree CRA44.2145 150 155 160 165 170umber of Active StationsFigure 6.16 – System throughput vs. No. of active stationsfor different entry spreading factors and VoIP traffic.By defining larger values for the Entry spreading factor, (e.g. Es-8 and Es-9), theprobability of transmission of requests in one of the next 3 contention minislots is (3/8≈) 0.38 and (3/9 ≈) 0.33 for Es-8 and Es-9, respectively. This is equivalent to passing(on average) 2 or 3 contention slots before transmitting a request, which also results in aslight reduction in system performance.Results reported in this section suggest that for optimum performance, the Es factorshould be set to 6 for mixed traffic (or medium size networks) and 6 or 7 for VoIPtraffic (or large networks).6.3.3 Performance comparison between the exponential backoffalgorithm and the splitting tree algorithmIn the previous analysis of Chapter 5, we presented an initial performance comparisonbetween both CRAs of the DVB/DAVIC protocol. In this section we focus explicitlyon the details and dynamics of each CRA in order to demonstrate why the splitting treealgorithm outperforms the exponential backoff algorithm.6-23
Chapter 6Optimisation of CRA using adaptive CSAs pResults presented in Figures 6.17 to 6.20 show a performance comparison between theexponential backoff algorithm and the splitting tree algorithm, for three different trafficconfigurations (32 kbps IP, 9.7 kbps VoIP and 41.7 kbps mixed traffic).Figure 6.17 indicates that the increase in system throughput when using the splittingtree algorithm is 9%, 12.3% and 9.7% of the cc for Internet, VoIP and mixed traffic,respectively. Figure 6.17 also shows that the maximum throughput achieved varies from32% to 58% of the cc.System Throughput (%)6560555045403530BackoffTreeVoIP TrafficI PTrafficMixedTraffic2525 28 31 34 37 40 43 46 49 52 55 58 61 64Offered Load (%)Figure 6.17 – System throughput. Exponential backoff vs. splitting tree algorithmfor different traffic configurations.6-24
Page 6 and 7:
I would like to thank all the peopl
Page 10:
CHAPTER 6: OPTIMISATIO OF CRA ALGOR
Page 13 and 14:
FIGURE 5.17 - SYSTEM THROUGHPUT VS.
Page 15 and 16:
LIST OF TABLESTABLE 2.1 - NEXT GENE
Page 17 and 18:
Chapter 1Introduction pBecause of h
Page 19 and 20:
Chapter 1Introduction pA first step
Page 21 and 22:
Chapter 1Introduction passumption i
Page 23 and 24:
Chapter 1Introduction ppolynomial b
Page 25 and 26:
Chapter 1Introduction pIn general,
Page 27 and 28:
Chapter 1Introduction pminislots to
Page 29 and 30:
Chapter 1Introduction pThe authors
Page 31 and 32:
Chapter 1Introduction prate access
Page 33 and 34:
Chapter 1Introduction p1.4 Overview
Page 35 and 36:
Chapter 2OVERVIEW OF CURRENT CATVNE
Page 37 and 38:
Chapter 2Overview of current CATV n
Page 39 and 40:
Page 41 and 42:
Page 43 and 44:
Page 45 and 46:
Page 47 and 48:
Page 49 and 50:
Page 51 and 52:
Page 53 and 54:
Page 55 and 56:
Chapter 3THE DVB/DAVIC PROTOCOL3.1
Page 57 and 58:
Chapter 3The DVB/DAVIC protocol pEu
Page 59 and 60:
Chapter 3The DVB/DAVIC protocol pMA
Page 61 and 62:
Chapter 3The DVB/DAVIC protocol pTh
Page 63 and 64:
Page 65 and 66:
Page 67 and 68:
Chapter 3The DVB/DAVIC protocol p3.
Page 69 and 70:
Chapter 4Simulation and analytical
Page 71 and 72:
Page 73 and 74:
Page 75 and 76:
Page 77 and 78:
Page 79 and 80:
Page 81 and 82:
Page 83 and 84:
Page 85 and 86:
Page 87 and 88:
Page 89 and 90:
Page 91 and 92:
Page 93 and 94:
Page 95 and 96:
Page 97 and 98:
Page 99 and 100:
Page 101 and 102:
Page 103 and 104:
Page 105 and 106:
Chapter 5Upstream channel capacity
Page 107 and 108:
Page 109 and 110:
Page 111 and 112:
Page 113 and 114: Chapter 5Upstream channel capacity
Page 143 and 144: Chapter 6Optimisation of CRA using
Page 163: Chapter 6Optimisation of CRA using
Page 171 and 172: Chapter 7PERFORMANCE OPTIMISATION F
Page 173 and 174: Chapter 7Performance optimisation f
Page 201 and 202: aChapter 7Performance optimisation
Page 209 and 210: Chapter 8Final conclusions p8.2 Gen
Page 211 and 212: Chapter 8Final conclusions pWe have
Page 213 and 214: Chapter 8Final conclusions pperform
Page 215 and 216:
Chapter 8Final conclusions pslots i
Page 217 and 218:
Chapter 8Final conclusions pfocused
Page 219 and 220:
Chapter 8Final conclusions preserva
Page 221 and 222:
Chapter 8Final conclusions pbandwid
Page 223 and 224:
Chapter 8Final conclusions pThe opt
Page 225 and 226:
Chapter 8Final conclusions p8.4 Fut
Page 227 and 228:
Chapter 8Final conclusions pApplica
Page 229 and 230:
Chapter 8Final conclusions pTCIS st
Page 231 and 232:
Referencesp[17] I. Cidon, and M. Si
Page 233 and 234:
Referencesp[50] N. F. Huang, C. A.
Page 235 and 236:
Referencesp[85] V. Rangel, R. Edwar
Page 237 and 238:
Referencesp[112] K. Sriram, “Meth
Page 239 and 240:
APPEDIX A: GLOSSARYAALABRADSLATMBCB
Page 241 and 242:
Appendix AGlossary pkbpsLANLLCMACMA
Page 243 and 244:
Appendix AGlossary pUSBUWVDSLVoDVoI
Page 245 and 246:
Appendix BProtocol stack and packet
Page 247 and 248:
Appendix BProtocol stack and packet
Page 249 and 250:
APPENDIX C: D VERIFICATION TEST FOR
Page 251 and 252:
Appendix D Verification test p209 2
Page 253 and 254:
Appendix EResults for a 6 Mbps upst
Page 255:
Appendix FGuide to CD-ROM p IEEE802
show all

DOWNLOAD MY Ph.D Thesis - UNAM

Create successful ePaper yourself

Delete template?

Save as template?