{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Final_Exam_sol

# Final_Exam_sol - Final Exam Spring Semester 2009 Data...

This preview shows pages 1–3. Sign up to view the full content.

Final Exam, Spring Semester, 2009 Data Networks Professor: Sunghyun Choi 2008-06-11 (Thu), 10:30am-12:30pm 1. (10 pts, 5 pts each) Indicate the correct answer to each of the following topics, and briefly explain why . (a) The maximum achievable throughputs of slotted ALOHA, unslotted ALOHA, splitting algorithm, CSMA slotted ALOHA, and CSMA/CD can be ordered as follows: unslotted ALOHA < slotted ALOHA < splitting algorithm < CSMA slotted ALOHA < CSMA/CD. A. True B. False Ans. False since the maximum throughputs of CSMA slotted ALOHA and CSMA/CD heavily depend on the propagation and detection delay beta. For example, for large beta, CSMA/CD can perform worse than CSMA slotted ALOHA. (b) Consider an M/M/1, M/M/m, or M/M/ system with arrival rate λ and service rate μ . Suppose that the system starts in steady-state. Then, according to Burke s theorem, the departure process is Poisson with rate μ . A. True B. False Ans. False since the departure rate is λ , NOT μ . 2. (10 pts) Consider a closed Jackson network where the service time at each queue is independent of the number of customers at the queue. Suppose that for a given number of customers, the utilization factor of one of the queues, say queue 1, is strictly larger than the utilization factors of the other queues. Show that as the number of customers increases, the proportion of time that a customer spends in queue 1 approaches unity.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
3.
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

### Page1 / 7

Final_Exam_sol - Final Exam Spring Semester 2009 Data...

This preview shows document pages 1 - 3. Sign up to view the full document.

View Full Document
Ask a homework question - tutors are online