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.
This course is part of the Computer Communications Specialization
Packet Switching Networks and Algorithms
Offered By
Syllabus - What you will learn from this course
Week
14 hours to complete
Frame Switching and Packet Switching
This module introduces LAN bridges and data link layer switching, and then focuses on packet switching at the network layer. It discusses datagram, one basic packet switching approaches.
4 videos (Total 21 min), 5 readings, 2 quizzes
4 videos
Welcome2m
Bridges and Data Link Layer Switching6m
Network Layer Services and Topology6m
Packet Switching: Datagrams5m
5 readings
Reference Books10m
Lecture Slide - Bridges and Data Link Layer Switching30m
Lecture Slide - Network Layer Services and Topology30m
Lecture Slide - Packet Switching: Datagrams30m
End-to-end argument in system design (Required)1h
2 practice exercises
Practice Assessment - Frame Switching and Packet Switching20m
Graded Assessment - Frame Switching and Packet Switching20m
Week
25 hours to complete
Routing in Packet Networks
This module examines the other basic packet switching approach - virtual circuit, introduces basic approaches for selecting routes across the network, discusses the Bellman-ford algorithm for distance vector based shortest path routing.
3 videos (Total 18 min), 4 readings, 2 quizzes
3 videos
Routing in Packet Networks6m
Shortest Path Routing- Distance Vector5m
4 readings
Lecture Slide - Packet Switching: Virtual Circuits30m
Lecture Slide - Routing in Packet Networks30m
Lecture Slide - Shortest Path Routing: Distance Vector30m
The Network Layer (Required)2h
2 practice exercises
Practice Assessment - Routing in Packet Networks16m
Graded Assessment - Routing in Packet Networks20m
Week
33 hours to complete
Shortest-Path Routing
This module introduces the link state routing, examines the Dijkstra algorithm for shortest-path routing, and discusses the applications of the distance vector and link state routing in real Internet protocols.
4 videos (Total 22 min), 4 readings, 2 quizzes
4 videos
Dijkstra Algorithm4m
Link State Routing, ATM Networks5m
RIP and OSPF6m
4 readings
Lecture Slide - Shortest Path Routing- Link State30m
Lecture Slide - Dijkstra Algorithm30m
Lecture Slide - Link State Routing, ATM Networks30m
Lecture Slide - RIP and OSPF30m
2 practice exercises
Practice Assessment - Shortest-Path Routing20m
Graded Assessment - Shortest-Path Routing20m
Week
44 hours to complete
Traffic Management
This module discusses packet-level traffic management operating in a short time scale, continues with traffic management at the flow level operating in a medium time scale. Common approaches including scheduling, queuing, admission control, and congestion control are discussed.
4 videos (Total 24 min), 5 readings, 2 quizzes
4 videos
Packet level – Fair Queueing and RED6m
Flow level – Leaky Bucket Policing6m
Traffic Shaping by Token Bucket5m
5 readings
Lecture Slide - Packet level: Scheduling and QoS30m
Lecture Slide - Packet level: Fair Queueing and RED30m
Lecture Slide - Flow level: Leaky Bucket Policing30m
Lecture Slide - Traffic Shaping by Token Bucket30m
Random early detection gateways for congestion avoidance30m
2 practice exercises
Practice Assessment - Traffic Management30m
Graded Assessment - Traffic Management30m
4.5
4 ReviewsTop reviews from Packet Switching Networks and Algorithms
This course was well presented and I got more skills which met my target..Thank you very much for this course. Hope will enjoy more courses to come. I am very very grateful for this course.
Instructor
Xiaobo Zhou
Professor, Interim DeanCollege of Engineering and Applied Sciences
About University of Colorado System
The University of Colorado is a recognized leader in higher education on the national and global stage. We collaborate to meet the diverse needs of our students and communities. We promote innovation, encourage discovery and support the extension of knowledge in ways unique to the state of Colorado and beyond.
About the Computer Communications Specialization
This specialization is developed for seniors and fresh graduate students to understand fundamental network architecture concepts and their impacts on cyber security, to develop skills and techniques required for network protocol design, and prepare for a future of constant change through exposure to network design alternatives. Students will require a prior knowledge of C programming, an understanding of math probability and a computer science background is a plus.
Frequently Asked Questions
When will I have access to the lectures and assignments?
Once you enroll for a Certificate, you’ll have access to all videos, quizzes, and programming assignments (if applicable). Peer review assignments can only be submitted and reviewed once your session has begun. If you choose to explore the course without purchasing, you may not be able to access certain assignments.
What will I get if I subscribe to this Specialization?
When you enroll in the course, you get access to all of the courses in the Specialization, and you earn a certificate when you complete the work. Your electronic Certificate will be added to your Accomplishments page - from there, you can print your Certificate or add it to your LinkedIn profile. If you only want to read and view the course content, you can audit the course for free.
What is the refund policy?
Is financial aid available?
More questions? Visit the Learner Help Center.
Coursera provides universal access to the world’s best education,
partnering with top universities and organizations to offer courses online.
© 2019 Coursera Inc. All rights reserved.
