Here are sketches of the answers we discussed in class.

Problem #2
1. The application described is most suitable for a circuit-switched network. It requires long sessions with predictable regular bandwidth. Since the bandwidth is known in advnace and is not bursty, time can be reserved for it. Because it will run for a long time we are not concerned about the setup cost.
2. We discussed this in detail during the class.
Problem #3
Problem #5
1. 5(a) and 5(b)
  - See Figure 1-11
  - Example of 5(a)
  - (a) t_s+(Q+M−1)×(L+h)/R
  - (b) (Q+M−1)×(L+2×h)/R
2. 5(c)
  - See Figure 1-10
  - Example of 5(c)
  - Q×(L×M+2×h)/R
3. 5(d)
  - There are not store and forward delays so it is just
    t_s + (h + M×L)/R
Question #9

generation time

6 × 10⁻³ seconds

transmission time

0.384 × 10⁻³ seconds

propogation time

2 × 10⁻³

total time

8.384 × 10⁻³ seconds

Network Computing

Assignment #1