DOWNLOAD MY Ph.D Thesis - UNAM
DOWNLOAD MY Ph.D Thesis - UNAM
DOWNLOAD MY Ph.D Thesis - UNAM
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
LIST OF FIGURESFIGURE 2.1 – EXAMPLE BLOCK DIAGRAM OF A TYPICAL CATV NETWORK. 2-3FIGURE 2.2 – SPECTRUM ALLOCATION ON A CATV NETWORK. 2-4FIGURE 2.3 – MODERN CATV NETWORK WITH HFC ARCHITECTURE. 2-6FIGURE 2.4 – CABLE MODEM CONFIGURATIONS. 2-7FIGURE 3.1 – DVB SYSTEM REFERENCE MODEL. 3-3FIGURE 3.2 – DVB/DAVIC INITIALISATION AND REGISTRATION PROCESS. 3-5FIGURE 3.3 – CONTENTION-RESOLUTION-GRANT CYCLE. 3-7FIGURE 3.4 – BLOCK DIAGRAM OF THE EXPOETIAL BACKOFF ALGORITHM. 3-8FIGURE 3.5 – BLOCK DIAGRAM OF THE SPLITTIG TREE ALGORITHM. 3-10FIGURE 3.6 – SLOT STRUCTURE. 3-11FIGURE 4.1 – STAGE DIAGRAM OF OPNET SIMULATION MODELS. 4-3FIGURE 4.2 – GENERIC CSF MODEL. 4-5FIGURE 4.3 – NETWORK TOPOLOGY. 4-7FIGURE 4.4 – NIU NODE DESCRIPTION. 4-8FIGURE 4.5 – INTERNET PACKET DISTRIBUTION. 4-8FIGURE 4.6 – NIU MANAGER PROCESS – FSM. 4-9FIGURE 4.7 – NIU CHILD PROCESS – FSM. 4-10FIGURE 4.8 – PROTO-C CODE OF THE STATE: TX. OPPORTUNITY. 4-11FIGURE 4.9 – INA NODE DESCRIPTION. 4-12FIGURE 4.10 – INA MANAGER PROCESS – FSM. 4-13FIGURE 4.11 – INA TX CONTROLLER - FSM. 4-14FIGURE 4.12 – UPSTREAM CHANNEL MODEL WITH VIRTUAL CONTENTION RESERVATION ANDFIXED-RATE CHANNELS. 4-15FIGURE 4.13 – UPSTREAM TIMING DIAGRAM. 4-19FIGURE 4.14 – MEAN SERVICE TIME WHEN THE SYSTEM IS IN IDLE STATE. 4-22FIGURE 4.15 – SCHEDULER LOOK AHEAD DELAY. 4-23FIGURE 4.16 – VARIANCE OF THE MEAN SERVICE TIME. 4-28FIGURE 4.17 – TIME OF BUSY CYCLE. 4-28FIGURE 4.18 – SYSTEM THROUGHPUT: SIMULATION AND THEORETICAL RESULTSFOR DIFFERENT PACKET SIZES. 4-32FIGURE 4.19 – MEAN ACCESS DELAY: SIMULATION AND THEORETICAL RESULTSFOR DIFFERENT PACKET SIZES. 4-33FIGURE 5.1 - MEAN ACCESS DELAY, SYSTEM THROUGHPUT AND UTILISATION VS. OFFERED LOAD. 5-10FIGURE 5.2 - CUMULATIVE PROBABILITY VS. MEAN ACCESS DELAY. 5-11FIGURE 5.3 - SYSTEM THROUGHPUT AND UTILISATION VS. NO. OF ACTIVE STATIONS, EXPOETIALBACKOFF AND SPLITTIG TREE ALGORITHM. 5-12FIGURE 5.4 – MEAN ACCESS DELAY VS. NO. OF ACTIVE STATIONS, EXPOETIAL BACKOFF ANDSPLITTIG TREE ALGORITHM. 5-13FIGURE 5.5 – MEAN ACCESS DELAY VS. NO. OF ACTIVE STATIONS FOR DIFFERENT CONTENTION MESSAGES.5-15FIGURE 5.6 – SYSTEM THROUGHPUT VS. NO. OF ACTIVE STATIONS FOR DIFFERENT CONTENTIONMESSAGES. 5-16FIGURE 5.7 – DATA TRANSMITTED IN THE CONTENTION-BASED REGION VS. NO. OF ACTIVESTATIONS FOR DIFFERENT CONTENTION MESSAGES. 5-17FIGURE 5.8 – BANDWIDTH CONSUMED BY COLLISIONS VS. NO. OF ACTIVE STATIONS FORDIFFERENT CONTENTION MESSAGES. 5-17FIGURE 5.9 – MEAN ACCESS DELAY VS. NO. OF ACTIVE STATIONS FOR DIFFERENT REQUEST SIZES. 5-19FIGURE 5.10 – SYSTEM THROUGHPUT VS. NO. OF ACTIVE STATIONS FOR DIFFERENT REQUEST SIZES. 5-20FIGURE 5.11 – RESERVATION REQUEST BANDWIDTH CONSUMED VS. NO. OF ACTIVE STATIONS. 5-21FIGURE 5.12 – MEAN ACCESS DELAY VS. NO. OF ACTIVE STATIONS FOR VOIP AND IP TRAFFIC. 5-22FIGURE 5.13 – MEAN ACCESS DELAY VS. NO. OF ACTIVE STATIONS FOR INCREASED BUFFER SIZE. 5-24FIGURE 5.14 – BUFFER CAPACITY VS. OFFERED LOAD FOR INCREASED BUFFER SIZE. 5-25FIGURE 5.15 – DISCARDED PACKETS VS. OFFERED LOAD FOR INCREASED BUFFER SIZE. 5-26FIGURE 5.16 – MEAN ACCESS DELAY VS. NO. OF ACTIVE STATIONS FOR DIFFERENT MCI VALUES. 5-28xii