Search Results

ECEC 632 Performance Analysis of Computer Networks 3.0 Credits

Covers probability theory and its applications to networks, random variable and random processes; Markov chains, multi-dimensional Markov chains; M/M/1, M/M/m, M/M/m/m, M/G/1 and G/G/1 queueing systems and their applications in computer networks; analysis of networks of queues: Kleinrock Independence Approximation; Time-reversibility and Burke's theorem; Jackson's theorem; the phenomenon of long-range dependence and its implications in network design and traffic engineering.

College/Department: College of Engineering
Repeat Status: Not repeatable for credit
Prerequisites: ECEC 631 [Min Grade: C] or ECEC 531 [Min Grade: C]

  • Schedule of Classes
  • All Course Descriptions
  • Co-op
  • Academic Advising
  • Admissions
  • Tuition & Fees