Graduate Computer Science

CS G150: Fundamentals of Computer Networking

Studies network protocols and architectures. Focuses on modeling and analysis of networks and network protocols. Introduces modeling concepts, with emphasis on queuing theory including Little’s theorem, M/M/1, M/M/m, M/D/1, and M/G/1 queuing systems. Discusses issues of performance evaluation of computer networks including performance metrics, evaluation tools and methodology, simulation techniques, and limitations. Presents the different harmonizing functions needed for the communication and efficient operation of computer networks, and discusses examples of Ethernet, FDDI, and Wireless networks. Topics include link layer protocols including HDLC, PPP, and SLIP; packet framing; spanning tree and learning bridges, error detection techniques, and automatic repeat request algorithms; sliding window and reliable/ordered services; and queuing disciplines including FQ and WFQ. Introduces flow control schemes such as window flow control and leaky bucket rate control schemes; and discusses congestion control and fairness.
Prerequisites:
Knowledge of probability theory.
Credit hours: 4