Unformatted text preview: n of them need to use the telephone at the same time. ii. Suppose you want to minimize the number of telephone lines installed. How many telephone lines should you provide for them if you want the probability that they need to wait for the telephone be less than 0.03? c) What kind of multiplexing technique is used in part (b)? 3. Suppose Host A wants to send a large file to Host B. The path from Host A to Host B has three links, of rates R 1 = 500 kbps, R 2 = 2 Mbps, and R 3 = 1 Mbps. a) Assuming no other traffic in the network, what is the throughput (in bits per second) for the file transfer? b) Suppose the file is 4 Mbytes. How long will it take to transfer the file to Host B? (Note: 1 Mbyte = 1024 Kbytes = 1024 × 1024 bytes. In this question, ignore propagation delay.) c) Repeat (a) and (b), but now with R 2 reduces to 100 kbps....
View Full Document
- Spring '11
- telephone lines, common multiplexing techniques