Course Plan (Tentative, ECE 158B Spring 2000)

---

• Routing. Shortest path algorithms: Bellman-Ford, Dijkstra, distributed Bellman-Ford.Minimum weight spanning tree algorithms: Prim-Dijkstra, Kruskal.
• Circuit Switch Architectures: Crossbar switch. Benes networks. Clos networks.
• Time slot interchangers. Time-Space-Time switches.
• Packet Switch Architectures: Bus-based shared memory switches. Input queueing. Output queueing. Multistage switching fabrics: Banyan networks, omega networks, Batcher sorting networks. LAN-based switches.
• Event driven simulations. Discussion of an OPNET simulation model.
• Classical stochastic models for performance analysis: Bernoulli and Poisson processes.Geometric, exponential, binomial, Poisson, and Gaussian random variables.
• Elementary queueing theory via ergodic arguments. Little's law. Average delay in M/M/1 and M/G/1 queueing systems.
• Basic theory of Markov chains. Analysis of classical Markovian queueing systems.
• Analysis of networks of queues via Kleinrock's independence assumption.
• Deterministic traffic models. Burstiness contraints. Leaky buckets. Reich's result.
• Bounds on work conserving scheduling algorithms. Accumulation of burstiness. End-to-end delay bounds in networks of queues.
• Deterministic service models. Strong service envelopes. Service curves.
• Traffic shaping. Leaky bucket flow control. Service curves of traffic shapers. Impact on buffer requirements and maximum end-to-end delay in virtual circuit networks. Window flow control.
• Deterministic network service calculus. Convolution in the min-plus algebra. Transforms and transfer functions.
• Weighted Fair Queueing, Service Aggregation into Classes.
• Scheduling and quality of service for diverse traffic types. Service curve scheduling.

ECE 158 Home Page