

University of Colorado Boulder - Packet Switching Networks and Algorithms
- Offered byCoursera
- Public/Government Institute
Packet Switching Networks and Algorithms at Coursera Overview
Duration | 18 hours |
Total fee | Free |
Mode of learning | Online |
Difficulty level | Intermediate |
Official Website | Explore Free Course |
Credential | Certificate |
Packet Switching Networks and Algorithms at Coursera Highlights
- This Course Plus the Full Specialization.
- Shareable Certificates.
- Graded Programming Assignments.
Packet Switching Networks and Algorithms at Coursera Course details
- In this course, we deal with the general issues regarding packet switching networks. We discuss packet networks from two perspectives. One perspective involves external view of the network, and is concerned with services that the network provides to the transport layer that operates above it at the end systems. The second perspective is concerned with the internal operation of a network, including approaches directing information across the network, addressing and routing procedures, as well as congestion control inside the network.
Packet Switching Networks and Algorithms at Coursera Curriculum
Frame Switching and Packet Switching
Welcome
Bridges and Data Link Layer Switching
Network Layer Services and Topology
Packet Switching: Datagrams
Reference Books
Lecture Slide - Bridges and Data Link Layer Switching
Lecture Slide - Network Layer Services and Topology
Lecture Slide - Packet Switching: Datagrams
End-to-end argument in system design (Required)
Practice Assessment - Frame Switching and Packet Switching
Graded Assessment - Frame Switching and Packet Switching
Routing in Packet Networks
Packet Switching: Virtual Circuits
Routing in Packet Networks
Shortest Path Routing- Distance Vector
Lecture Slide - Packet Switching: Virtual Circuits
Lecture Slide - Routing in Packet Networks
Lecture Slide - Shortest Path Routing: Distance Vector
The Network Layer (Required)
Practice Assessment - Routing in Packet Networks
Graded Assessment - Routing in Packet Networks
Shortest-Path Routing
Shortest Path Routing- Link State
Dijkstra Algorithm
Link State Routing, ATM Networks
RIP and OSPF
Lecture Slide - Shortest Path Routing- Link State
Lecture Slide - Dijkstra Algorithm
Lecture Slide - Link State Routing, ATM Networks
Lecture Slide - RIP and OSPF
Practice Assessment - Shortest-Path Routing
Graded Assessment - Shortest-Path Routing
Traffic Management
Packet level ? Scheduling and QoS
Packet level ? Fair Queueing and RED
Flow level ? Leaky Bucket Policing
Traffic Shaping by Token Bucket
Lecture Slide - Packet level: Scheduling and QoS
Lecture Slide - Packet level: Fair Queueing and RED
Lecture Slide - Flow level: Leaky Bucket Policing
Lecture Slide - Traffic Shaping by Token Bucket
Random early detection gateways for congestion avoidance
Practice Assessment - Traffic Management
Graded Assessment - Traffic Management
Course Project - Packet Switching Networks and Algorithms