Coursera

Packet Switching Networks and Algorithms (Coursera)

Offered by University of Colorado System,
Packet Switching Networks and Algorithms (Coursera)

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.

Class Deals by MOOC List - Click here and see Coursera's Active Discounts, Deals, and Promo Codes.

Course 3 of 4 in the Computer Communications Specialization.

Syllabus

WEEK 1
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.

WEEK 2
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.

WEEK 3
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.

WEEK 4
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.

WEEK 5
Course Project - Packet Switching Networks and Algorithms
This is a comprehensive peer review assessment

Go to Class
MOOC List is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

Related Courses

Problem Solving Using Computational Thinking (Coursera) Coursera
University of Michigan

Problem Solving Using Computational Thinking (Coursera)

CS: Theory Computer Science

Have you ever heard that computers "think"? Believe it or not, computers really do not think. Instead, they do exactly what we tell them to do. Programming is, "telling the computer what to do and how to do it." Before you can think about programming a computer, you need to work out exactly what it is you want to tell the computer to do. Thinking through problems this way is Computational Thinking. Computational Thinking allows us to take complex problems, understand what the problem is, and develop solutions. We can present these solutions in a way that both computers and people can understand.

Oct 12th 2026
5-12 Weeks
Programming Algorithms Computational Thinking
Details
Practical Steps for Building Fair AI Algorithms (Coursera) Coursera
Fred Hutchinson Cancer Center

Practical Steps for Building Fair AI Algorithms (Coursera)

Computer Science

Algorithms increasingly help make high-stakes decisions in healthcare, criminal justice, hiring, and other important areas. This makes it essential that these algorithms be fair, but recent years have shown the many ways algorithms can have biases by age, gender, nationality, race, and other attributes. This course will teach you ten practical principles for designing fair algorithms. It will emphasize real-world relevance via concrete takeaways from case studies of modern algorithms, including those in criminal justice, healthcare, and large language models like ChatGPT. You will come away with an understanding of the basic rules to follow when trying to design fair algorithms, and assess algorithms for fairness.

Oct 12th 2026
4 Weeks
Algorithms Algorithm Design Bias
Details
Digital Signal Processing 1: Basic Concepts and Algorithms (Coursera) Coursera
École Polytechnique Fédérale de Lausanne

Digital Signal Processing 1: Basic Concepts and Algorithms (Coursera)

Engineering

Digital Signal Processing is the branch of engineering that, in the space of just a few decades, has enabled unprecedented levels of interpersonal communication and of on-demand entertainment. By reworking the principles of electronics, telecommunication and computer science into a unifying paradigm, DSP is a the heart of the digital revolution that brought us CDs, DVDs, MP3 players, mobile phones and countless other devices.

Oct 12th 2026
4 Weeks
Algorithms Electrical Engineering Fourier Transform
Details
Excel/VBA for Creative Problem Solving, Part 2 (Coursera) Coursera
University of Colorado Boulder

Excel/VBA for Creative Problem Solving, Part 2 (Coursera)

CS: Theory CS: Programming

Excel/VBA for Creative Problem Solving, Part 2" builds off of knowledge and skills obtained in "Excel/VBA for Creative Problem Solving, Part 1" and is aimed at learners who are seeking to augment, expand, optimize, and increase the efficiency of their Excel spreadsheet skills by tapping into the powerful programming, automation, and customization capabilities available with Visual Basic for Applications (VBA).

Oct 5th 2026
4 Weeks
Algorithms Spreadsheets Excel
Details
Reclaiming the Street for Livable Urban Spaces (Coursera) Coursera
University of Amsterdam,EIT Urban Mobility

Reclaiming the Street for Livable Urban Spaces (Coursera)

Social Sciences

In Reclaiming the Street, you will learn about the mechanisms of change and challenges you to apply this knowledge to start creating vibrant streetscapes in your neighbourhood. This six week course will guide you through seminal academic work on the topics of transition management and street experiments while providing practical insights from practitioners from around the world. A final peer-reviewed project integrates key takeaways from each module of this course to help you write an actionable plan for change.

Oct 12th 2026
5-12 Weeks
Urban Planning Mobility Traffic
Details
Build a Modern Computer from First Principles: Nand to Tetris Part II (project-centered course) (Coursera) Coursera
Hebrew University of Jerusalem

Build a Modern Computer from First Principles: Nand to Tetris Part II (project-centered course) (Coursera)

CS: Software Engineering CS: Programming

In this project-centered course you will build a modern software hierarchy, designed to enable the translation and execution of object-based, high-level languages on a bare-bone computer hardware platform. In particular, you will implement a virtual machine and a compiler for a simple, Java-like programming language, and you will develop a basic operating system that closes gaps between the high-level language and the underlying hardware platform.

Oct 12th 2026
5-12 Weeks
Programming Java Operating Systems
Details
Algorithms, Part II (Coursera) Coursera
Princeton University

Algorithms, Part II (Coursera)

CS: Software Engineering CS: Theory

This course covers the essential information that every serious programmer needs to know about algorithms and data structures, with emphasis on applications and scientific performance analysis of Java implementations. Part I covers elementary data structures, sorting, and searching algorithms. Part II focuses on graph- and string-processing algorithms.

Oct 12th 2026
5-12 Weeks
Java Algorithms Data Structures
Details