All Courses

Networking and Data Communication

CS339  —  Networking and Data Communication
Sacred Heart University  ·  Computer Science
Professor Chris Rosa
Professor Chris Rosa
CS339  ·  Sacred Heart University
Course Description  ·  Undergraduate Catalog

Students study networks and data communication concentrating on the Internet model. This is a laboratory-based course that includes projects implemented on both Unix and Windows machines. Topics such as the Internet protocol stack, hardware, routing, circuit-switching and packet-switching networks, multiplexing, error handling, and WiFi are among those studied. Students use packet sniffing tools to design and simulate networks.

3 Credits
Prereq: CS-112
Lab-Based
Powered by Claude · answers scoped to CS339 topics · recommends tools when relevant
General Interactive Tools
TCP / IP Stack — Interactive Tools
No interactive tools planned for this layer
Application layer protocols are well-suited to lecture and discussion — the concepts of request/response, DNS resolution, and session management tend to land without requiring animated visualizations. These topics are covered in CS339 through lecture, Wireshark labs, and hands-on exercises.
HTTP / HTTPS DNS SMTP / IMAP FTP TLS Handshake Client-Server Model P2P Architecture CDNs
IP Addressing & Subnetting
CIDR Teaching Tool

Explore IP addresses at the bit level. Understand CIDR notation, subnet masks, block sizes, and address allocation through live interactive visualizations.

32-bit IP and mask display with decimal octets
8 stat cards with step-by-step calc overlays
Compare tab — same-subnet AND bit math
Aggregation tab — route summarization
12-step guided tour from first principles
Network Design & NAT
Subnet Topology Builder

Build dynamic topologies with routers, subnets, and hosts. Visualize packet routing, NAT / PAT translation tables, and /30 point-to-point links on an interactive canvas.

Drag-and-drop topology canvas with auto-layout
Animated packet simulation host-to-host
NAT / PAT with live translation table
Echo-back packet with port mapping
Per-node bit display and calc overlays
Forwarding & Routing Tables
Router Visualizer

Interactive router with live forwarding table lookups, longest-prefix matching, and per-interface inspection. Trace how a datagram is forwarded hop-by-hop.

Forwarding table with longest-prefix match
Per-interface IP & MAC inspection
Live packet trace with TTL decrement
Static route configuration walkthrough
Link-State & Distance Vector
Routing Algorithm Visualizer

Step through Dijkstra (Link-State) and Bellman-Ford (Distance Vector) algorithms on configurable network graphs. Watch routing tables converge in real time.

Dijkstra LS — step-by-step shortest paths
Bellman-Ford DV — iterative table updates
Animated graph with cost labels
Edit topology & rerun convergence
Graph & LS Topology
Graph Algorithm Visualizer

General-purpose graph visualizer for exploring network topology as a graph. Build arbitrary topologies, apply shortest-path algorithms, and visualize the LS flooding model.

Drag-and-drop node & edge construction
Weighted edge cost simulation
Shortest-path highlight & traversal trace
Supports LS flooding thought experiments
No interactive tools planned for this layer
Physical layer concepts — signal propagation, encoding schemes, and transmission media — are well served by lecture, diagrams, and lab exercises. CS339 covers these topics as foundational context before moving up the stack, where the interactive tools in this collection are focused.
Bit Transmission Signal Encoding Copper / Twisted Pair Fiber Optic Wireless / RF Bandwidth Attenuation Nyquist / Shannon
CS339 Assistant