SlideShare a Scribd company logo
1 of 8
NETWORK
ARCHITECTURE 1
P a g e 1 | 7
3 Wireless link model
3. Look at the code and answer the following questions.
(a) What does IATM represent?
Ans. It represents Inter-Arrival Time Distribution.
(b) What does SVTM represent?
Ans. It represents Service Time Distribution.
(c) How are customers created?
Ans. Customers are created by this command- create(“cust”);
This is the /*required create statement*/.
(d) What does hold(expnt 1(IATM)) mean?
Ans. It means that the program will hold an exponentially distributed inter-arrival time before
going to the next customer.
(e) If instead hold(IATM) was inserted, what would that mean?
Ans. It means that the program will hold in linear form for the given inter arrival time not in the
exponential form.
(f) What does hold(expnt 1(SVTM)) mean?
Ans. It means that it will hold for an exponentially distributed service time. Basically it is related
to time in which the customer is being processed.
4. Execute the simulation for the following input parameters
nice filename 0.5 1.0 10 > outputfilename1 &
nice filename 0.5 1.0 100 > outputfilename2 &
nice filename 0.5 1.0 100000 > outputfilename3 &
nice filename 0.5 1.0 100000000 > outputfilename4 &
nice filename 0.95 1.0 10 > outputfilename5 &
nice filename 0.95 1.0 100 > outputfilename6 &
nice filename 0.95 1.0 100000 > outputfilename7 &
nice filename 0.95 1.0 100000000 > outputfilename8 &
Ans. Output files have been attached.
P a g e 2 | 7
5. What conclusions can you make about the relationship between the number of arrivals
you are simulating, the utilization of the system, and the rate at which the simulation
results converge to the analytic results?
Ans.
a) When the number of arrivals go beyond 100000 at that time the simulation results converge to
the analytic results. When the number of arrivals increases from 10 to 100, the throughput
fluctuates near to the theoretical value of 0.5.
b) Also, response time, service time and time in queue are not close to the theoretical value.
6. What was the total simulation time for each simulation?
Ans.
OUTPUT SIMULATION
1 22.973
2 172.705
3 198288.489
4 200008809.533
5 12.209
6 113.856
7 105061.033
8 105284410.702
7. What was the total CPU time for each simulation?
Ans.
OUTPUT CPU TIME(seconds)
1 0.000
2 0.000
3 0.116
4 130.892
5 0.000
6 0.001
7 0.136
8 132.310
P a g e 3 | 7
8. Enable the warmup reset by removing the comments from the following lines of code:
/* wait(warmup); */
/*reset(); */
/* if(cnt==NARS-10000) */
/* set(warmup); */
Ans. Enabled.
P a g e 4 | 7
9. Recompile and execute the simulation for the following input parameters
nice filename 0.95 1.0 20000 > outputfilename9 &
nice filename 0.95 1.0 100000 > outputfilename10 &
Ans. Output files have been attached.
10. Is there any difference in the rate of convergence to the analytical results? Explain?
Ans. It depends on the number of arrivals. So when the number of arrivals increases the
simulation results become more convergent with the analytical results. The data of last 10000 is
reset due to the warmup event to eliminate startup bias.
P a g e 5 | 7
4 CSMA Network
4. Take a look at the source code CSMA-network.c.
1. Why do you think the process that is creating arrivals in this model has an infinite loop
for(;;) rather than specifically specifying the number of arrivals for(i =0;i < NARS;i++) as
in the M/M/1 model?
Ans. Because of the exponential back-off process. It might be possible that the process has to run
infinitely because of exponential back-off process.
2. What prevents the model from running forever?
Ans. The following lines of code prevent the model from running forever:
if(cnt = = 0)
set(done);
Basically when cnt = 0, the done event starts taking place which gives the permission to the last
customer to signal to the main process that they are the last one and they are about to leave the
system.
3. Explain in detail how the back-off mechanism works.
a. reserve(f1);
Ans. The facility is checked first before sending a packet.
b. hold (expntl(BETA));
Ans. The hold function stops the facility for an exponentially distributed BETA time.
c. while (busy = = 1)
Ans. It enters the while loop where busy is initiated with 1 and when busy = 1, it enters
the back-off process.
d. hold(expnt1(BETA));
Ans. In the back-off process, it holds for an exponentially distributed BETA time.
e. busy = 1;
f. hold(expnt1(SVTM));
g. busy = 0;
h. release(f1);
Ans.(e,f,g,h): After the service time, the busy is set to 0 so that the back-off process is
will not start again and then the facility will be released.
P a g e 6 | 7
4. What would happen if the variable busy was initialized with the value 1 instead of 0?
Ans. The program won’t be able to go into the back-off process as the criteria for entering the
while loop is not satisfied.
6. Compile and run CSMA-network.c with the following parameters.
nice CSMA-network 0.1 1.0 1.0 1000000 > outputfilename11 &
nice CSMA-network 0.1 1.0 2.0 1000000 > outputfilename12 &
nice CSMA-network 0.1 1.0 5.0 1000000 > outputfilename13 &
Ans. Output files have been attached.
7. Compare the results you get with Kleinrock and Tobagi’s results.
Ans.
Throughput from
Kleinrock and Tobagi’s
Expression
Average Throughput from
the program
90.90 90.74
95.23 95.17
98.03 97.86
5 Wireless CSMA with Forwarding
1. Are the buffers finite or infinite?
Ans. The buffers are finite.
2. For each source, look at the path from the source to the access point. What are the
collision domains for each hop in the path?
ANS. each BSS acts as a single Ethernet collision domain. A BSS can overlap with the another
BSS to provide a greater coverage area. Each BSS can be its own channel to provide separate
collision domains. BSS(basic service set).
3. Compile and run the program with the following parameters:
nice CSMA-repeater 0.16 1.0 1.0 10 1000000 > outputfilename14 &
nice CSMA-repeater 0.16 1.0 1.0 50 1000000 > outputfilename15 &
nice CSMA-repeater 0.16 1.0 1.0 100 1000000 > outputfilename16 &
nice CSMA-repeater 0.16 1.0 1.0 200 1000000 > outputfilename17 &
P a g e 7 | 7
Ans. Output files have been attached.
4. Does increasing the buffer size help with throughput?
Ans. No, the buffer size does not help with the throughput.
5. Does increasing the buffer size help with loss?
Ans. Yes, the buffer size will help with the loss. By increasing the buffer size loss can be
controlled.
6. Which repeaters are the bottlenecks?
Ans. Wireless access point. It offers the possibility to be configured as wireless repeaters, this
provides the same kind of wireless forwarding but in the managed way. 7th facility is the
bottleneck repeater.
7. Run the program with double the back-off rate (below). Does this help? What are the
bottleneck links now?
nice CSMA-repeater 0.16 1.0 2.0 10 1000000 > outputfilename18 &
nice CSMA-repeater 0.16 1.0 2.0 50 1000000 > outputfilename19 &
nice CSMA-repeater 0.16 1.0 2.0 100 1000000 > outputfilename20 &
nice CSMA-repeater 0.16 1.0 2.0 200 1000000 > outputfilename21 &
Ans. output files have been attached. And no this does not help.

More Related Content

What's hot

A Simple Communication System Design Lab #4 with MATLAB Simulink
A Simple Communication System Design Lab #4 with MATLAB SimulinkA Simple Communication System Design Lab #4 with MATLAB Simulink
A Simple Communication System Design Lab #4 with MATLAB SimulinkJaewook. Kang
 
Assignment cn tl
Assignment cn tlAssignment cn tl
Assignment cn tlH K
 
A Simple Communication System Design Lab #3 with MATLAB Simulink
A Simple Communication System Design Lab #3 with MATLAB SimulinkA Simple Communication System Design Lab #3 with MATLAB Simulink
A Simple Communication System Design Lab #3 with MATLAB SimulinkJaewook. Kang
 
C vs Java: Finding Prime Numbers
C vs Java: Finding Prime NumbersC vs Java: Finding Prime Numbers
C vs Java: Finding Prime NumbersAdam Feldscher
 
bask, bfsk, bpsk
bask, bfsk, bpskbask, bfsk, bpsk
bask, bfsk, bpskblzz2net
 
C optimization notes
C optimization notesC optimization notes
C optimization notesFyaz Ghaffar
 
Tales of Linux micro-benchmarks
Tales of Linux micro-benchmarksTales of Linux micro-benchmarks
Tales of Linux micro-benchmarksMatt Fleming
 
c plus plus programsSlide
c plus plus programsSlidec plus plus programsSlide
c plus plus programsSlideharman kaur
 
Lec25-CS110 Computational Engineering
Lec25-CS110 Computational EngineeringLec25-CS110 Computational Engineering
Lec25-CS110 Computational EngineeringSri Harsha Pamu
 
Programming at Compile Time
Programming at Compile TimeProgramming at Compile Time
Programming at Compile TimeemBO_Conference
 
CS106 Lab 3 - Modulus
CS106 Lab 3 - ModulusCS106 Lab 3 - Modulus
CS106 Lab 3 - ModulusNada Kamel
 
Matlab m files and scripts
Matlab m files and scriptsMatlab m files and scripts
Matlab m files and scriptsAmeen San
 
Yampa AFRP Introduction
Yampa AFRP IntroductionYampa AFRP Introduction
Yampa AFRP IntroductionChengHui Weng
 
Optimization in the world of 64-bit errors
Optimization  in the world of 64-bit errorsOptimization  in the world of 64-bit errors
Optimization in the world of 64-bit errorsPVS-Studio
 
CS106 Lab 10 - Functions (passing by value)
CS106 Lab 10 - Functions (passing by value)CS106 Lab 10 - Functions (passing by value)
CS106 Lab 10 - Functions (passing by value)Nada Kamel
 

What's hot (20)

A Simple Communication System Design Lab #4 with MATLAB Simulink
A Simple Communication System Design Lab #4 with MATLAB SimulinkA Simple Communication System Design Lab #4 with MATLAB Simulink
A Simple Communication System Design Lab #4 with MATLAB Simulink
 
Assignment cn tl
Assignment cn tlAssignment cn tl
Assignment cn tl
 
The low level awesomeness of Go
The low level awesomeness of GoThe low level awesomeness of Go
The low level awesomeness of Go
 
A Simple Communication System Design Lab #3 with MATLAB Simulink
A Simple Communication System Design Lab #3 with MATLAB SimulinkA Simple Communication System Design Lab #3 with MATLAB Simulink
A Simple Communication System Design Lab #3 with MATLAB Simulink
 
C vs Java: Finding Prime Numbers
C vs Java: Finding Prime NumbersC vs Java: Finding Prime Numbers
C vs Java: Finding Prime Numbers
 
bask, bfsk, bpsk
bask, bfsk, bpskbask, bfsk, bpsk
bask, bfsk, bpsk
 
20BCE1734.pdf
20BCE1734.pdf20BCE1734.pdf
20BCE1734.pdf
 
C optimization notes
C optimization notesC optimization notes
C optimization notes
 
Tales of Linux micro-benchmarks
Tales of Linux micro-benchmarksTales of Linux micro-benchmarks
Tales of Linux micro-benchmarks
 
c plus plus programsSlide
c plus plus programsSlidec plus plus programsSlide
c plus plus programsSlide
 
Lec25-CS110 Computational Engineering
Lec25-CS110 Computational EngineeringLec25-CS110 Computational Engineering
Lec25-CS110 Computational Engineering
 
Programming at Compile Time
Programming at Compile TimeProgramming at Compile Time
Programming at Compile Time
 
CS106 Lab 3 - Modulus
CS106 Lab 3 - ModulusCS106 Lab 3 - Modulus
CS106 Lab 3 - Modulus
 
algorithm
algorithmalgorithm
algorithm
 
Matlab m files and scripts
Matlab m files and scriptsMatlab m files and scripts
Matlab m files and scripts
 
Oct.22nd.Presentation.Final
Oct.22nd.Presentation.FinalOct.22nd.Presentation.Final
Oct.22nd.Presentation.Final
 
Ch7
Ch7Ch7
Ch7
 
Yampa AFRP Introduction
Yampa AFRP IntroductionYampa AFRP Introduction
Yampa AFRP Introduction
 
Optimization in the world of 64-bit errors
Optimization  in the world of 64-bit errorsOptimization  in the world of 64-bit errors
Optimization in the world of 64-bit errors
 
CS106 Lab 10 - Functions (passing by value)
CS106 Lab 10 - Functions (passing by value)CS106 Lab 10 - Functions (passing by value)
CS106 Lab 10 - Functions (passing by value)
 

Viewers also liked

Viewers also liked (15)

NIU Springboard Domain Name infographic
NIU Springboard Domain Name infographicNIU Springboard Domain Name infographic
NIU Springboard Domain Name infographic
 
No a la explotación sexual
No a la explotación sexualNo a la explotación sexual
No a la explotación sexual
 
Derecho
DerechoDerecho
Derecho
 
skydrive_word_doc
skydrive_word_docskydrive_word_doc
skydrive_word_doc
 
MPP. Reza Moridi
MPP. Reza MoridiMPP. Reza Moridi
MPP. Reza Moridi
 
Tema 2 3-4 PROCESOS PRIMARIA
Tema 2 3-4 PROCESOS PRIMARIATema 2 3-4 PROCESOS PRIMARIA
Tema 2 3-4 PROCESOS PRIMARIA
 
Page 333
Page 333Page 333
Page 333
 
Herradura nueva
Herradura nuevaHerradura nueva
Herradura nueva
 
Adw
 Adw Adw
Adw
 
Page 88
Page 88Page 88
Page 88
 
Lois’ slide show demo
Lois’ slide show demoLois’ slide show demo
Lois’ slide show demo
 
Convocatoria prim2012
Convocatoria prim2012Convocatoria prim2012
Convocatoria prim2012
 
referencje
referencjereferencje
referencje
 
Web 1, web 2
Web 1, web 2Web 1, web 2
Web 1, web 2
 
10
1010
10
 

Similar to project_2

IFSM 310 Software and Hardware Infrastructure ConceptsComputer.docx
IFSM 310 Software and Hardware Infrastructure ConceptsComputer.docxIFSM 310 Software and Hardware Infrastructure ConceptsComputer.docx
IFSM 310 Software and Hardware Infrastructure ConceptsComputer.docxscuttsginette
 
Improved implementation of a Deadline Monotonic algorithm for aperiodic traff...
Improved implementation of a Deadline Monotonic algorithm for aperiodic traff...Improved implementation of a Deadline Monotonic algorithm for aperiodic traff...
Improved implementation of a Deadline Monotonic algorithm for aperiodic traff...Andrea Tino
 
References1. HCS 2010 online manuals.2. Data Data provi.docx
References1. HCS 2010 online manuals.2. Data  Data provi.docxReferences1. HCS 2010 online manuals.2. Data  Data provi.docx
References1. HCS 2010 online manuals.2. Data Data provi.docxdebishakespeare
 
Making Custom Oscilloscope Measurements
Making Custom Oscilloscope MeasurementsMaking Custom Oscilloscope Measurements
Making Custom Oscilloscope Measurementsteledynelecroy
 
Sheet1Address60741024Offsetaddress0102450506074120484026230723002p.docx
Sheet1Address60741024Offsetaddress0102450506074120484026230723002p.docxSheet1Address60741024Offsetaddress0102450506074120484026230723002p.docx
Sheet1Address60741024Offsetaddress0102450506074120484026230723002p.docxbagotjesusa
 
ppt-U3 - (Programming, Memory Interfacing).pptx
ppt-U3 - (Programming, Memory Interfacing).pptxppt-U3 - (Programming, Memory Interfacing).pptx
ppt-U3 - (Programming, Memory Interfacing).pptxRaviKiranVarma4
 
Pipelining in Computer System Achitecture
Pipelining in Computer System AchitecturePipelining in Computer System Achitecture
Pipelining in Computer System AchitectureYashiUpadhyay3
 
2018867974 sulaim (2)
2018867974 sulaim (2)2018867974 sulaim (2)
2018867974 sulaim (2)sulaim_qais
 
cscript_controller.pdf
cscript_controller.pdfcscript_controller.pdf
cscript_controller.pdfVcTrn1
 
Bis 311 final examination answers
Bis 311 final examination answersBis 311 final examination answers
Bis 311 final examination answersRandalHoffman
 
Integrating Adaptation Mechanisms Using Control Theory Centric Architecture M...
Integrating Adaptation Mechanisms Using Control Theory Centric Architecture M...Integrating Adaptation Mechanisms Using Control Theory Centric Architecture M...
Integrating Adaptation Mechanisms Using Control Theory Centric Architecture M...Filip Krikava
 
class12_time.ppt
class12_time.pptclass12_time.ppt
class12_time.pptGauravWaila
 
Performance measures
Performance measuresPerformance measures
Performance measuresDivya Tiwari
 
Frame detection.pdf
Frame detection.pdfFrame detection.pdf
Frame detection.pdfinfomerlin
 
Linear Control Hard-Disk Read/Write Controller Assignment
Linear Control Hard-Disk Read/Write Controller AssignmentLinear Control Hard-Disk Read/Write Controller Assignment
Linear Control Hard-Disk Read/Write Controller AssignmentIsham Rashik
 

Similar to project_2 (20)

IFSM 310 Software and Hardware Infrastructure ConceptsComputer.docx
IFSM 310 Software and Hardware Infrastructure ConceptsComputer.docxIFSM 310 Software and Hardware Infrastructure ConceptsComputer.docx
IFSM 310 Software and Hardware Infrastructure ConceptsComputer.docx
 
Improved implementation of a Deadline Monotonic algorithm for aperiodic traff...
Improved implementation of a Deadline Monotonic algorithm for aperiodic traff...Improved implementation of a Deadline Monotonic algorithm for aperiodic traff...
Improved implementation of a Deadline Monotonic algorithm for aperiodic traff...
 
References1. HCS 2010 online manuals.2. Data Data provi.docx
References1. HCS 2010 online manuals.2. Data  Data provi.docxReferences1. HCS 2010 online manuals.2. Data  Data provi.docx
References1. HCS 2010 online manuals.2. Data Data provi.docx
 
Making Custom Oscilloscope Measurements
Making Custom Oscilloscope MeasurementsMaking Custom Oscilloscope Measurements
Making Custom Oscilloscope Measurements
 
Sheet1Address60741024Offsetaddress0102450506074120484026230723002p.docx
Sheet1Address60741024Offsetaddress0102450506074120484026230723002p.docxSheet1Address60741024Offsetaddress0102450506074120484026230723002p.docx
Sheet1Address60741024Offsetaddress0102450506074120484026230723002p.docx
 
Code Tuning
Code TuningCode Tuning
Code Tuning
 
ppt-U3 - (Programming, Memory Interfacing).pptx
ppt-U3 - (Programming, Memory Interfacing).pptxppt-U3 - (Programming, Memory Interfacing).pptx
ppt-U3 - (Programming, Memory Interfacing).pptx
 
Pipelining in Computer System Achitecture
Pipelining in Computer System AchitecturePipelining in Computer System Achitecture
Pipelining in Computer System Achitecture
 
2018867974 sulaim (2)
2018867974 sulaim (2)2018867974 sulaim (2)
2018867974 sulaim (2)
 
Ch5 answers
Ch5 answersCh5 answers
Ch5 answers
 
cscript_controller.pdf
cscript_controller.pdfcscript_controller.pdf
cscript_controller.pdf
 
Bis 311 final examination answers
Bis 311 final examination answersBis 311 final examination answers
Bis 311 final examination answers
 
Matopt
MatoptMatopt
Matopt
 
Integrating Adaptation Mechanisms Using Control Theory Centric Architecture M...
Integrating Adaptation Mechanisms Using Control Theory Centric Architecture M...Integrating Adaptation Mechanisms Using Control Theory Centric Architecture M...
Integrating Adaptation Mechanisms Using Control Theory Centric Architecture M...
 
class12_time.ppt
class12_time.pptclass12_time.ppt
class12_time.ppt
 
CH05.pdf
CH05.pdfCH05.pdf
CH05.pdf
 
Performance measures
Performance measuresPerformance measures
Performance measures
 
Frame detection.pdf
Frame detection.pdfFrame detection.pdf
Frame detection.pdf
 
Linear Control Hard-Disk Read/Write Controller Assignment
Linear Control Hard-Disk Read/Write Controller AssignmentLinear Control Hard-Disk Read/Write Controller Assignment
Linear Control Hard-Disk Read/Write Controller Assignment
 
Lab
LabLab
Lab
 

project_2

  • 2. P a g e 1 | 7 3 Wireless link model 3. Look at the code and answer the following questions. (a) What does IATM represent? Ans. It represents Inter-Arrival Time Distribution. (b) What does SVTM represent? Ans. It represents Service Time Distribution. (c) How are customers created? Ans. Customers are created by this command- create(“cust”); This is the /*required create statement*/. (d) What does hold(expnt 1(IATM)) mean? Ans. It means that the program will hold an exponentially distributed inter-arrival time before going to the next customer. (e) If instead hold(IATM) was inserted, what would that mean? Ans. It means that the program will hold in linear form for the given inter arrival time not in the exponential form. (f) What does hold(expnt 1(SVTM)) mean? Ans. It means that it will hold for an exponentially distributed service time. Basically it is related to time in which the customer is being processed. 4. Execute the simulation for the following input parameters nice filename 0.5 1.0 10 > outputfilename1 & nice filename 0.5 1.0 100 > outputfilename2 & nice filename 0.5 1.0 100000 > outputfilename3 & nice filename 0.5 1.0 100000000 > outputfilename4 & nice filename 0.95 1.0 10 > outputfilename5 & nice filename 0.95 1.0 100 > outputfilename6 & nice filename 0.95 1.0 100000 > outputfilename7 & nice filename 0.95 1.0 100000000 > outputfilename8 & Ans. Output files have been attached.
  • 3. P a g e 2 | 7 5. What conclusions can you make about the relationship between the number of arrivals you are simulating, the utilization of the system, and the rate at which the simulation results converge to the analytic results? Ans. a) When the number of arrivals go beyond 100000 at that time the simulation results converge to the analytic results. When the number of arrivals increases from 10 to 100, the throughput fluctuates near to the theoretical value of 0.5. b) Also, response time, service time and time in queue are not close to the theoretical value. 6. What was the total simulation time for each simulation? Ans. OUTPUT SIMULATION 1 22.973 2 172.705 3 198288.489 4 200008809.533 5 12.209 6 113.856 7 105061.033 8 105284410.702 7. What was the total CPU time for each simulation? Ans. OUTPUT CPU TIME(seconds) 1 0.000 2 0.000 3 0.116 4 130.892 5 0.000 6 0.001 7 0.136 8 132.310
  • 4. P a g e 3 | 7 8. Enable the warmup reset by removing the comments from the following lines of code: /* wait(warmup); */ /*reset(); */ /* if(cnt==NARS-10000) */ /* set(warmup); */ Ans. Enabled.
  • 5. P a g e 4 | 7 9. Recompile and execute the simulation for the following input parameters nice filename 0.95 1.0 20000 > outputfilename9 & nice filename 0.95 1.0 100000 > outputfilename10 & Ans. Output files have been attached. 10. Is there any difference in the rate of convergence to the analytical results? Explain? Ans. It depends on the number of arrivals. So when the number of arrivals increases the simulation results become more convergent with the analytical results. The data of last 10000 is reset due to the warmup event to eliminate startup bias.
  • 6. P a g e 5 | 7 4 CSMA Network 4. Take a look at the source code CSMA-network.c. 1. Why do you think the process that is creating arrivals in this model has an infinite loop for(;;) rather than specifically specifying the number of arrivals for(i =0;i < NARS;i++) as in the M/M/1 model? Ans. Because of the exponential back-off process. It might be possible that the process has to run infinitely because of exponential back-off process. 2. What prevents the model from running forever? Ans. The following lines of code prevent the model from running forever: if(cnt = = 0) set(done); Basically when cnt = 0, the done event starts taking place which gives the permission to the last customer to signal to the main process that they are the last one and they are about to leave the system. 3. Explain in detail how the back-off mechanism works. a. reserve(f1); Ans. The facility is checked first before sending a packet. b. hold (expntl(BETA)); Ans. The hold function stops the facility for an exponentially distributed BETA time. c. while (busy = = 1) Ans. It enters the while loop where busy is initiated with 1 and when busy = 1, it enters the back-off process. d. hold(expnt1(BETA)); Ans. In the back-off process, it holds for an exponentially distributed BETA time. e. busy = 1; f. hold(expnt1(SVTM)); g. busy = 0; h. release(f1); Ans.(e,f,g,h): After the service time, the busy is set to 0 so that the back-off process is will not start again and then the facility will be released.
  • 7. P a g e 6 | 7 4. What would happen if the variable busy was initialized with the value 1 instead of 0? Ans. The program won’t be able to go into the back-off process as the criteria for entering the while loop is not satisfied. 6. Compile and run CSMA-network.c with the following parameters. nice CSMA-network 0.1 1.0 1.0 1000000 > outputfilename11 & nice CSMA-network 0.1 1.0 2.0 1000000 > outputfilename12 & nice CSMA-network 0.1 1.0 5.0 1000000 > outputfilename13 & Ans. Output files have been attached. 7. Compare the results you get with Kleinrock and Tobagi’s results. Ans. Throughput from Kleinrock and Tobagi’s Expression Average Throughput from the program 90.90 90.74 95.23 95.17 98.03 97.86 5 Wireless CSMA with Forwarding 1. Are the buffers finite or infinite? Ans. The buffers are finite. 2. For each source, look at the path from the source to the access point. What are the collision domains for each hop in the path? ANS. each BSS acts as a single Ethernet collision domain. A BSS can overlap with the another BSS to provide a greater coverage area. Each BSS can be its own channel to provide separate collision domains. BSS(basic service set). 3. Compile and run the program with the following parameters: nice CSMA-repeater 0.16 1.0 1.0 10 1000000 > outputfilename14 & nice CSMA-repeater 0.16 1.0 1.0 50 1000000 > outputfilename15 & nice CSMA-repeater 0.16 1.0 1.0 100 1000000 > outputfilename16 & nice CSMA-repeater 0.16 1.0 1.0 200 1000000 > outputfilename17 &
  • 8. P a g e 7 | 7 Ans. Output files have been attached. 4. Does increasing the buffer size help with throughput? Ans. No, the buffer size does not help with the throughput. 5. Does increasing the buffer size help with loss? Ans. Yes, the buffer size will help with the loss. By increasing the buffer size loss can be controlled. 6. Which repeaters are the bottlenecks? Ans. Wireless access point. It offers the possibility to be configured as wireless repeaters, this provides the same kind of wireless forwarding but in the managed way. 7th facility is the bottleneck repeater. 7. Run the program with double the back-off rate (below). Does this help? What are the bottleneck links now? nice CSMA-repeater 0.16 1.0 2.0 10 1000000 > outputfilename18 & nice CSMA-repeater 0.16 1.0 2.0 50 1000000 > outputfilename19 & nice CSMA-repeater 0.16 1.0 2.0 100 1000000 > outputfilename20 & nice CSMA-repeater 0.16 1.0 2.0 200 1000000 > outputfilename21 & Ans. output files have been attached. And no this does not help.