This preview shows page 1. Sign up to view the full content.
Unformatted text preview: EE 444 INTRODUCTION TO COMPUTER NETWORKS Spring 2009 HOMEWORK #1 Deadline: March 13 2009 @ 23:59 (No late submission is allowed.) Posted on March 06 2009. Please follow the submission method as described over the course webpage (any other submission, e.g. paperwork, will not be accepted). Question # 1 Consider a car dealer that is also responsible for repairing the cars they sell in case they fail. There are a total of M cars that have been sold by the dealer and the dealer does not sell new cars any more due to the global economic recession. However, the repair service must be continuously provided. The cars fail after an average of F time units whenever they are repaired. The repair service is provided by the dealer by k repairmen. Each repairman is capable of repairing a broken car in an average of P time units. Assuming that any car does not die out, obtain upper and lower bounds ( in terms of F , M , P and k ) on the number of car failures per unit time and on the average time between repairs of the same car. The bounds must be as car failures per unit time and on the average time between repairs of the same car....
View Full Document
This note was uploaded on 04/09/2010 for the course EE ee444 taught by Professor Akan during the Spring '10 term at Middle East Technical University.
- Spring '10