10.07.2015 Views

DOWNLOAD MY Ph.D Thesis - UNAM

DOWNLOAD MY Ph.D Thesis - UNAM

DOWNLOAD MY Ph.D Thesis - UNAM

SHOW MORE
SHOW LESS

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

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Chapter 4Simulation and analytical modelling pstandard) was proposed. By making slight changes we can use the same estimationapplied to the DVB/DAVIC standard as shown in Equation 4.43.PayloadPksizeSmax_ exp_ backoff==(4.43)Payload+Overhead+eContention _ Slots Pk + eCSsFor the splitting tree algorithm, reservation requests are now transmitted using aminislot (MSs) of 21 bytes instead of a complete contention slot of 64 bytes. Thus, themaximum theoretical system throughput that can be achieved with this algorithm isgiven by Equation 4.44.PksizeSmax_ split _ tree=(4.44)Pk + eMSsslotsslots4.5 Access delay and system throughput validationIn this section we validate the results yielded by the simulation model for differentpacket sizes and variable offered load. In order to get the maximum throughput, we setthe ‘Minimum number of contention slots per MCI frame’ to 1 slot. The arrival rate ofthe packets was exponentially distributed and the data rate for the upstream channel wasat 6.17 Mbps. Table 4.2 presents the maximum throughput sustainable for differentpacket sizes ranging from 64 to 1518 bytes.In this table the maximum throughput is given by Equation 4.45.SmaxPk ⋅8= (4.45)Xwhere X corresponds to the maximum service time given by Equation 4.29.4-31

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!