What This Document Is
This is a homework assignment for EE 555: Broadband Network Architectures, a graduate-level course offered at the University of Southern California. Specifically, it’s Homework Two from the Spring 2012 semester. The assignment focuses on applying theoretical concepts related to queueing theory, congestion control, and traffic shaping within broadband networks. It requires students to demonstrate a practical understanding of how different scheduling and congestion management techniques impact network performance.
Why This Document Matters
This assignment is designed for students enrolled in advanced networking courses, particularly those specializing in broadband systems. It’s valuable for solidifying your understanding of core concepts discussed in lectures and readings. Working through these problems will enhance your ability to analyze and design network architectures that efficiently manage traffic and ensure quality of service. It’s best utilized *after* you’ve grasped the fundamental principles of fair queueing, weighted fair queueing, RED, and token bucket filtering. Successfully completing this assignment will prepare you for more complex network design challenges.
Common Limitations or Challenges
This assignment presents a series of analytical problems. It does *not* provide a comprehensive review of the underlying theory. You’ll need a strong foundation in queueing models and networking principles to effectively tackle the questions. The assignment also doesn’t offer step-by-step solutions or worked examples; it expects you to apply your knowledge independently. It focuses on calculations and analysis, not simulations or practical implementations.
What This Document Provides
* Problem sets centered around router scheduling algorithms (Fair Queueing, Weighted Fair Queueing, FCFS, Priority Queueing).
* Scenarios involving packet arrival patterns and link capacity constraints.
* Exercises focused on analyzing the performance of Random Early Detection (RED) congestion control.
* Problems related to token bucket filter configurations and flow specifications.
* Questions exploring the impact of lost reservation state in RSVP networks.
* A Markov chain problem related to token bucket burst control and packet marking.
