DOWNLOAD MY Ph.D Thesis - UNAM

More documents

Recommendations

Info

Chapter 4Simulation and analytical modelling pThe average size is ≈ 368 bytes or 8.3 ATM cells and the message inter-arrival timeis exponential distributed with mean T = 1/λ, where λ varies according to the offeredload (e.g. 32 or 64 kbps). The minimum packet size of 64 bytes corresponds to anacknowledgement packet that is exchanged during a TCP session and the packet sizeof 1518 bytes corresponds to the maximum size of an Ethernet packet that is mainlyFigure 4.6 – NIU Manager process – FSM.used in PC Networks.• Traffic Source 2: This traffic type emulates a CBR stream. It is a modifiedimplementation of the ON-OFF source provided by the CSF, which is used togenerate isochronous streams. All sources create packets of constant length, variablebetween simulation runs from 20 to 1518 bytes to cover a large range of applicationswith a constant inter-arrival rate. The time, t, that each source starts generatingpackets was exponentially distributed with a mean of 1 second. This prevents NIUsfrom issuing the first reservation request simultaneously and causing an excessivenumber of collisions at the beginning of the simulation.The most important block in the NIU node is the IU MAC (Figure 4.4a). This block isbased on two asynchronous processes: The IU Manager process handles upstream/downstream traffic and performs the initialisation and registration process depicted inFigure 3.2.4-9
Chapter 4Simulation and analytical modelling pThe finite state machine used for the IU Manger process is as illustrated in Figure 4.6.Packets from the traffic source generators and signalling frames that describe the use ofthe upstream channel are transferred to the IU Child process (see Figure 4.7). TheChild process performs bandwidth request, collision detection/resolution and packettransmissions.Figure 4.7 – NIU Child process – FSM.4-10
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 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 67 and 68: Chapter 3The DVB/DAVIC protocol p3.
Page 69 and 70: Chapter 4Simulation and analytical
Page 75: Chapter 4Simulation and analytical
Page 105 and 106: Chapter 5Upstream channel capacity
Page 127 and 128:
Chapter 5Upstream channel capacity
Page 129 and 130:
Page 131 and 132:
Page 133 and 134:
Page 135 and 136:
Page 137 and 138:
Page 139 and 140:
Page 141 and 142:
Page 143 and 144:
Chapter 6Optimisation of CRA using
Page 145 and 146:
Page 147 and 148:
Page 149 and 150:
Page 151 and 152:
Page 153 and 154:
Page 155 and 156:
Page 157 and 158:
Page 159 and 160:
Page 161 and 162:
Page 163 and 164:
Page 165 and 166:
Page 167 and 168:
Page 169 and 170:
Page 171 and 172:
Chapter 7PERFORMANCE OPTIMISATION F
Page 173 and 174:
Chapter 7Performance optimisation f
Page 175 and 176:
Page 177 and 178:
Page 179 and 180:
Page 181 and 182:
Page 183 and 184:
Page 185 and 186:
Page 187 and 188:
Page 189 and 190:
Page 191 and 192:
Page 193 and 194:
Page 195 and 196:
Page 197 and 198:
Page 199 and 200:
Page 201 and 202:
aChapter 7Performance optimisation
Page 203 and 204:
Page 205 and 206:
Page 207 and 208:
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

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?