Computer Networks: Master Networking Fundamentals End-To-End

Explore how IPv4 enables unique identification of internet-connected devices using logical addressing, mirroring real-world address hierarchies, to support reliable data exchange between source and destination across networks.

Explain how IPv4 uses a 32-bit address divided into four eight-bit octets, dot-separated, with each octet ranging from 0 to 255, representing binary to decimal conversions.

Explore IPv4 classification into five classes and how class b and c use a network part and a host part, while class d and e have no such division.

Explore class A addressing in IPv4, where 8 network bits and 24 host bits yield 2^24 possible hosts per network, about 16.7 million.

Explore class B addressing by examining the network and host parts, 16-bit blocks, and 2^16 possible networks and 65,536 hosts, illustrating use by large and medium organizations.

Class c addressing divides the network into 24 bits and hosts into 8 bits, yielding many networks and 256 hosts per network.

Identify the network part and host part in IPv4, note that addresses with all zeros or all ones are not allocated to devices, and preview the three classes.

Explains why theoretical class a, b, and c subnetting cannot be implemented directly. Uses decimal examples to illustrate networks and hosts per class and outlines practical class ranges.

Identify the ip class from the first octet ranges (class a to e) and determine the network and host parts accordingly, using 167.x.x.x as a class b example.

Explain Class A addressing by identifying the 1–126 network range and 24-bit host part, exclude all zeros and ones, yielding 126 networks and 2^24−2 hosts.

Explain class b addressing by identifying the 128 to 191 range and the fixed network bits. Show that 2^14 networks exist and each network offers 2^16 minus 2 hosts.

Explain Class D addresses, ranging from 224 to 239, which are allocated for multicast with no host part, and how to identify multicast addresses in IP networks.

Decode class e ip addresses through practical bit patterns, examining 8-bit positions, the 240 to 255 range, and the fixed parts that define class e networks.

Identify ip classes from decimal ranges or binary prefixes to classify IPv4 addresses into a, b, c, d, and e; explain each class’s network and host parts.

Explore how IPv4 allocates addresses across class A, B, and C networks and hosts, calculating the total possible IP addresses as roughly 4 billion.

Identify ip address classes and determine the network part and host part. Derive the network address by zeroing the host part, and the host address by keeping the host part.

Identify the network part and set all host bits to one to derive the broadcast ip address for a network; recognize direct broadcast and limited broadcast, using 255.255.255.255 for latter.

Explore why subnetting matters to divide a single network into secure, isolated subnets, reduce broadcast traffic, and simplify troubleshooting across department networks.

Learn the definition of subnetting, the process of dividing a single network into multiple subnet blocks, illustrated by class c networks and subdividing into four subnets.

Determine the minimum bits needed for subnetting by applying log base 2 to the number of subnets, and take the ceiling to ensure unique subnet identification.

Learn how to create subnets by borrowing bits from the host part of a class c address, turning a 192.168.x.x network into four subnets through binary bit selection.

Analyze subnet ranges and determine usable hosts per subnet in a class 1 network, revealing four 64-address subnets with 62 usable hosts each.

Explore how to identify subnets by separating the network portion and host portion of an IP address, determine the subnetwork IDs, and derive subnetwork ranges through example calculations.

Explore how to create subnets by selecting two host bits, determine subnet ranges, and identify subnet numbers in IPv4 addressing.

Understand why subnet masks are essential to identify subnets within a network using IP addresses, source and destination addresses, and host bits to route incoming packets.

Discover how a 32 bit subnet mask defines borrowed bits from the host part and helps routers determine the destination subnetwork for incoming packets.

Demonstrates subnet mask 255.255.255.0 on a class C network, with ones in the network portion and zeros in the host portion, and zero bits borrowed, yielding eight host bits.

Analyze how a class C network uses 255.255.255.224 to borrow three host bits, creating eight subnets and up to 30 usable hosts per subnet.

Explore subnetting for class B networks by analyzing subnet masks and network versus host parts, and count subnets and hosts with practical calculations.

Explore how to construct a class C subnet mask by borrowing host bits, determine the number of subnets and hosts, and illustrate masks such as 255.255.255.224 through bit selection.

Explains representing subnet masks with IP addresses using dotted decimal and slash notation, covers class C networks, borrowing host bits for subnets, and counting ones such as /24 and /27.

Identify the destination subnet and host within a class c network by applying a subnet mask, extracting the subnet id, and deriving the host id from the address.

Identify the broadcast IP address for a given subnetwork by applying the subnet mask and placing ones in the host bits, enabling directed broadcasting to all hosts in that subnetwork.

Analyze the given ip and subnet mask to identify the subnetwork, calculate the host range, and determine the last usable ip address in a /27 subnet as 158.

Explore why variable length subnet masks are needed to tailor subnets within a class c network. The lecture shows subnet masks, host ranges, and how VLSM enables flexible subnetting.

Demonstrate variable length subnet masking (VLSM) on a class C network by borrowing host bits to create subnets of 128 and 64 addresses, with masks 255.255.255.128 and 255.255.255.192.

Extract subnetwork ids by applying variable length subnet masks to destination IPs, illustrating how main network, subnetwork, and sub-subnet ranges are identified in IPv4.

Explore advanced vlsm concepts by analyzing how to borrow bits, divide networks into subnets and sub-subnets, and determine hosts and network parts with tailored subnet masks.

Explore how datagram fragmentation splits large packets to fit a link's mtu, adds a 20-byte ip header to each fragment, and uses offsets and mf flags for reassembly.

This lecture explains IPv4 fragmentation: all fragments share a 16-bit id, the MF bit marks more fragments, the last fragment sets MF to 0, and 8-byte offsets enable reassembly.

Explain how destination hosts reassemble ip fragments using id and offset fields, identify first and last fragments, and handle missing fragments with the mf flag.

Understand how IP fragmentation and reassembly occur when MTU is exceeded, including MF and offset fields, and fragment sizing with 176 bytes of data plus 20-byte headers.

Explore Ethernet characteristics, including connectionless communication, no flow control or packet-level error control, and no acknowledgments, with bus topology and CSMA/CD access control, plus frame format and efficiency insights.

Explain how csma/cd enables access to a shared ethernet bus via carrier sense and multiple access, and how collisions trigger jam signals and retries.

Explore how Ethernet CSMA/CD sets a minimum packet length to detect collisions, deriving length ≥ 2 × distance/velocity × bandwidth to guarantee a round-trip propagation.

Compute the minimum frame size for csma/cd ethernet by applying transmission delay equals round trip time, using a one kilometer link and two numerical problems.

Explain the characteristics of the stop and wait protocol, including throughput per RTT, a one packet window, propagation versus transmission delay, and how sequence numbers and bandwidth affect efficiency.

Increase the window size to enable pipelining and boost sender and link utilization beyond stop-and-wait. Apply this to go-back-n and selective repeat, with more sequence numbers and buffers.

Go back n is a sliding window protocol where the receiver never accepts out-of-order packets. It uses cumulative acknowledgments and piggybacking, with sequence numbers 0–7 and retransmission from n-th packet.

Explore sequence numbers in go-back-n, detailing total numbers and window sizes. Learn how k bits and ceil of log base two determine representation.

See how sequence number definitions determine go-back-n window sizes: n total numbers give n/2 windows; n max gives (n+1)/2; k bits give 2^k−1 windows.

Explore tcp characteristics: it provides a reliable byte stream with per-byte sequence numbers, port-based service points, and cumulative acknowledgments, enabling full duplex flow control via sliding window.

Explore tcp connection phases: connection establishment, data transmission, and connection termination, covering client and server roles, initiation, acknowledgement, and full/half duplex behavior.

Explore the tcp header and its six flags—sin flag, asec flag, push flag, reset flag, erg flag, and fin flag—to understand connection establishment, data transmission, and termination with both cumulative and immediate acknowledgments.

Explore how the tcp urg flag and urg pointer enable partial data forwarding to reduce router waiting time and review syn, ack, and fin roles in connection setup and termination.

Discover how tcp headers use 32-bit sequence and acknowledgement numbers, chosen randomly for the first byte and preserved across all data packets within range 0 to 2^32−1.

Learn the wraparound sequence number concept in TCP, using a finite sequence number space to show how values cycle and how to estimate wraparound time from bandwidth and sequence length.

Explore tcp connection management from end to end, detailing sequence and acknowledgement numbers, syn and fin handshakes, piggybacking, and full duplex data transmission during establishment and termination.