Data & Network Communication Final

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/60

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 5:11 AM on 4/30/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

61 Terms

1
New cards

Link layer

Responsible for transferring data grams from one node to another directly connected node through a link

2
New cards

Node

A device in the network - hosts and routers

3
New cards

Frame

Link-layer packet - takes datagram from network layer and wraps it in a frame

4
New cards

Framing

Encapsulating a datagram into a packet - add header/tailer

5
New cards

MAC address

link layer address used to identify devices on the same network - used to locally deliver frames vs. IP address global routing (think SSN vs postal address). EX: 1A-2F-BB…

  • 48 bits long

  • Usually written in hexadecimal (0-9, A-F)

6
New cards

half/full duplex

Half - both can transmit, but not at the same time. Full - both can transmit at the same time

7
New cards

Network Interface Card (NIC)

Where the link layer is implemented in a host, hardware that connects device to network

8
New cards

EDC

Error detection and correction bits - extra bits added to data so the receiver can check if the data was corrupted

9
New cards

Parity Bit

A single bit added to data to make the number of 1’s either even or odd

10
New cards

Single bit parity

Can detect a single bit error - if one bit flips, the number of 1’s will go from even to odd - usually even parity (adding a 1 to the end if its odd, and a 0 if its even already)

11
New cards

Two dimensional parity

Arranges data in rows and columns, then adds parity bits for each row and column. Allows the receiver to find the bad row AND the bad column to correct it

12
New cards

Internet checksum

Value calculated from the data. Sender sends data + checksum (ones complement), receiver recalculates checksum from data and compares w/ sent checksum. Goal is to detect flipped bits

13
New cards

Cyclic Redundancy Check (CRC)

More powerful at error detecting. Goal: Choose CRC bits, R, such that <D(the date), R> is exactly divisible by G (mod 2) - go over this arithmetic later

14
New cards

Point to point link

Connects one sender to one receiver (ex. host and Ethernet switch)

15
New cards

Broadcast links/shared medium

Link shared by multiple devices - when one device sends, other devices might hear it

16
New cards

Collision

When a node receives 2+ signals at the same time

17
New cards

Multiple access protocol

Determines when each node is allowed to transmit on a shared channel. Ideal: One node transmits at rate R, M nodes transmit at rate R/M

18
New cards

MAC (Medium Access Control) Protocol

Decides how devices share access to a communication medium. Three types:

  1. Channel partitioning: divides channel into smaller pieces, and each node gets one for its personal use (TDMA, FDMA)

  2. Random access: Devices transmit when they have data. Collisions can happen but there are protocols for recovery (ALOHA, CSMA, etc)

  3. Taking turns: Nodes take turns transmitting, but those with more data can take longer turns (polling, token passing)

19
New cards

TDMA (Time Division Multiple Access)

Channel partitioning protocol. Divides channel by time - Access happens in rounds, each round has several slots, and each station gets its own slots. Avoids collisions, but some slots might get wasted.

20
New cards

FDMA (Frequency Division Multiple Access)

Channel partitioning protocol. Divides channel into frequency bands, and each station gets its own frequency band (think radios). Avoids collisions, but some frequency bands might get wasted if there is nothing to send.

21
New cards

Slotted ALOHA

Random access protocol. Time is divided into slots, and nodes may only start transmitting at the start of a slot. Node gets fresh frame —> transmits in next slot. If no collision, success. If colission, tries again in later slots with probability p. Simple and decentralized, but collisions waste slots and clock synchronization must occur

22
New cards

Pure ALOHA

Random access protocol. Like Slotted ALOHA, except devices don’t have to wait until the start of a new slot to start transmitting. Causes more collisions, less efficient than Slotted ALOHA

23
New cards

CSMA (Carrier Sense Multiple Access)

Random access protocol. Listen before transmit - a device checks whether channel seems idle before sending.

CSMA/CD (collision detection): Devices listening before transmitting AND detecting if a collision happened. Stops transmitting if there is one.

24
New cards

Binary Exponential Backoff

A retry strategy where, after more collisions, the device chooses from a larger range of random wait times.

25
New cards

Polling

Taking turns protocol. Master node asks each other node, one at a time, if it wants to transmit. Avoids collisions, but creates overhead, delay, and risk if master node fails.

26
New cards

Token passing

Taking turns protocol. A special control message, called a token, is passed from one node to the next. Node can only transmit when it has the token. Avoids collisions, but has overhead, can cause delay, and risky if token is broken.

27
New cards

ARP (Address Resolution Protocol)

Used to find a device’s MAC address when you already know its IP address.

  • Each node has an ARP table, which stores mappings between IP addresses and MAC addresses.

Host A will broadcast an ARP request to everyone on the LAN. Every device on the LAN receives the request, but only Host B recognizes the target IP address as its own, and sends an ARP reply back with the MAP address. A stores that in its ARP table.

28
New cards

bus topology

Formerly used by Ethernet. All devices share the same communication medium, like one shared cable. All can collide with each other.

29
New cards

switched topology

Currently used by Ethernet. Device connects to central switch, and each device has its own separate link to the switch.

30
New cards

Switch

Link-layer deicde that receives Ethernet frames, looks at the MAC addresses, and decides where to forward them. Allow multiple simultaneous transmissions and reduce collisions.

  • Each switch has a switch forwarding table that maps a host’s MAC address to the switch interface needed to reach that host. Each entry usually has a MAC address, interface #, and timestamp.

31
New cards

Flooding

When the switch forwards the frames out of all interfaces except the one it came in on.

32
New cards

Switches vs routers

Switches: Work at link layer and use MAC addresses

Routers: Work at the network layer and use IP addresses

Both: Store and forward devices - receive data, examine it, and forward it to the correct interface

33
New cards

VLAN (Virtual LAN)

A way to split one physical LAN into multiple logical LANS.

34
New cards

Trunk port

Switch port that carries traffic for multiple VLANs between switches.

35
New cards

802.1Q

The standard that adds VLAN tag information to Ethernet frames.

36
New cards

Infarstructure Mode

Wireless device connects through a base station/access point (how normal Wi-Fi works)

37
New cards

Ad hoc mode

Wireless devices communicate directly with each other without base stations

38
New cards

CDMA (Code Division Multiple Access)

A technique where different users share the same frequency at the same time, but each user has a unique code.

39
New cards

BSS (Basic Service Set)

A group of wireless hosts connected to the same access point.

40
New cards

802.11

Family of Wi-Fi standards

  • Passive scanning: Access point sends beacon frames, and the host listens for them

  • Active scanning: Host sends a probe request, and access points respond

41
New cards

CSMA/CA (Carrier Sense Multiple Access w/ Collision Avoidance)

  • Devices listen before sending and try to avoid collisions before they happen

  • Used by Wi-Fi

42
New cards

Rate adaptation

Wi-Fi can change its transmission speed depending on the quality of the wireless signal.

43
New cards

Power management

Allows a device to go to sleep when it does not need to send or receive right away

44
New cards

Beacon frame

A message sent by the access point to announce information about the wireless network

45
New cards

Base station

The cellular network device that mobile users connect to over the wireless link. Connects into the core network, which handles authentication, mobility, etc

46
New cards

Data plane

Carries the user’s actual data, like videos, messages, etc

47
New cards

Control plane

Carries management information, like authentication, mobility updates, etc

48
New cards

Indirect routing

Traffic goes through the mobile device’s home network first, then gets forwarded to wherever the device currently is.

49
New cards

Direct routing

The sender learns the mobile device’s current temportary address and sends directly to that visited network,

50
New cards

Home network

Network where the mobile device “belongs” (ex. If your cellular provider is Verizon, that is your home network)

51
New cards

Visited network

A different network the device is using while away from home

52
New cards

Registration

When the mobile device tells the network where it currently is

53
New cards

Triangle Routing

When traffic takes an indirect path through the home network instead of going directly between the sender and the mobile device.

54
New cards

Network security

Four big goals - confidentiality, authentication, messeage integrity (msg wasn’t changed), access/availability

55
New cards

Symmetric key cryptography

Sender and receiver use the same key to decrypt

56
New cards

DES (Data Encryption Standard)

Uses a 56-bit symmetric key and works on 64-bit plaintext input blocks - no longer considered secure b/c key is too short

57
New cards

AES (Advanced Encryption Standard)

Uses 128-biy blocks and can use 128, ,192, or 256-bit keys. Stronger than DES

58
New cards

Public key cryptography

Uses two different keys: a public and a private. If someone wants to send Bob a message, they can encrypt it with Bob’s public key, but only his private key can decrypt it.

59
New cards

RSA

Public key encryption method based on the difficulty of factoring large numbers.

  • Mod = 14 mod 10 = 4 —> 14/10 = remainder 4

  • choose two very large prime numbers, p and q. p * q = n

  • public key = n and another number e

  • private key = n and another number d

  • ciphertext = message^e mod n

  • message = c^d mod n

60
New cards

Digital signature

A cryptographic way to prove who created a message and that the message was not changed.

61
New cards

Message digest

Fixed size output of a hash function - acts like a fingerprint of the message