DOWNLOAD MY Ph.D Thesis - UNAM

More documents

Recommendations

Info

Chapter 4Simulation and analytical modelling pConsidering the above limitation, the formulation of an accurate analytical modelbecomes highly complex. Despite the high level of complexity associated with theproduction of an analytical model, a form of validation process is essential, even of thebasic functionality of the DVB/DAVIC protocol in order to verify correctness of thesimulation model.The analytical model formalised in Sections 4.4.1 to 4.4.3, address some questions thatconcern performance evaluation of a new protocol, (i.e. the knowledge of packet accessdelays and maximum system throughput achieved per stations). This is one of the firstissues that participant vendors and cable network manufacturers have to address, asthere is a significant delay associated with transmissions in the upstream channel thathas to do with the CRGC, even where there are not contending users in the cablenetwork. The analytical model presented in Section 4.4.1 and Section 4.4.2 is based inthe following reasonable assumptions:• The bandwidth of the F-channel for fixed-rate access is not considered. This is anadvanced functionality included in the second version of EuroModems [36].• In accordance with the DVB/PDAVIC protocol, at least one MCI frame should betransmitted in the 3 ms period. We consider that the DVB/DAVIC transmits 4 MCIframes per 3 ms period. Thus the number of slots described per MCI frames is of 9slots, with a 6.17 Mbps upstream channel.The following formulation addresses issues of mean packet access delay and maximumsystem throughput achieved for a single upstream channel. The quantities andabbreviations that will be used throughout the analysis have been defined in Table 4.1.4-17
Chapter 4Simulation and analytical modelling pTable 4.1 – Symbols and abbreviations.Symbol Description Value or range if applicableλ Packet arrival rate in Pk/s (also referred to as offered load in kbps)µ Average number of packets transmitted per second -XMean packet service time -ρ Utilisation factor -X idle Service time when the system is idle -X busy Service time when the system is busy -2σXVariance of the mean service time 0L Mean number of packets in the system (including the packet in service) -Pk size Length of the packet to be transmitted in bytes [64 –1518]Pk slot Number of slots required to transmit a packet -Pk mci Number of MCI frames required to transmit a data packetAAL5 header Protocol overhead added because of the ATM-AAL5 encapsulation 8 bytesAAL5 PDU Length of the ATM-AAL5 Packet Data Unit 48 bytesWDMean average waiting time -Mean access end-to-end delay from the NIU to the HE -eteMCI pk Number of MCI frames required to transmit a packet -MCI max_slots Maximum number of slots described in each MCI frame 9 slotsMCI CSs Minimum number of contention slots described per MCI frame 1 slotMCI t MAC Control Information interval 0.750 msD prop Propagation delay from the NIU to the HE 0.051 msD sl_tx Slot transmission delay 0.083 msCC Upstream channel capacity in Mbps 6.176P 0P 1TTTLippbbcbcD lahD tx_MPEGD interleaveD IU_procDS_sizeProbability that the system is in an idle stateProbability that the system is in a busy stateAverage time of the idle periodAverage time of the busy periodAverage time of the busy cycleAverage packets in queue per busy cycleScheduler look-ahead delayDownstream transmission delay of an MPEG2 TS frameDelay incurred to enable the correction of burst noise induced errors.NIU processing delayTotal size of the MPEG2 TS frame to be transmitted downstream includingFEC information.204 bytesD ws_bit_rate Downstream data rate 42 MbpsL xSS max_large_packetsS max_exp_backoffS max_split_treeAverage number of packets served per secondThroughputMaximum system throughput for large packet sizesMax. throughput for different packet sizes using the exp. backoff algorithmMax. throughput for different packet sizes using the splitting tree algorithm4-18
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 83: Chapter 4Simulation and analytical
Page 105 and 106: Chapter 5Upstream channel capacity
Page 135 and 136:
Chapter 5Upstream channel capacity
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

Create successful ePaper yourself

Delete template?

Save as template?