Networking and Computer Architecture Lecture Notes

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

1/45

flashcard set

Earn XP

Description and Tags

Comprehensive vocabulary flashcards covering computer networking, layered communication protocols, and fundamental computer hardware architectures from the lecture notes.

46 Terms

1
New cards

ServerSocket

A socket that runs on the server, listening for incoming network connections on a particular port on the host running it.

2
New cards

Traffic Control Plane

The mechanism where the ServerSocket controls which sockets get spawned; the first requirements for communication take place here.

3
New cards

Data Plane

Communication between two sockets; once a ServerSocket spawns a socket, all communications take place here.

4
New cards

Modulation

Sending a pair of distinguishable signals by varying frequency, amplitude, or phase, expressed by x(t)=Asin(2πft+θ)x(t) = A \text{sin}(2\pi ft + \theta).

5
New cards

Duplexity

A measure of how many bit streams can be encoded on a link at a given time (e.g., full-duplex or half-duplex).

6
New cards

Non-Return to Zero (NRZ)

An encoding scheme that maps binary 1 to a high signal and binary 0 to a low signal.

7
New cards

Baseline Wander

A phenomenon where signal strength continually changes, requiring signal averages to distinguish between low and high states.

8
New cards

Manchester Encoding

An encoding scheme where 0 is represented by a low-to-high transition and 1 is represented by a high-to-low transition, eliminating clock synchronization issues because every bit sent contains a transition.

9
New cards

Non-Return to Zero Inverted (NRZI)

An encoding method that makes a transition from the current signal to encode a 1, and stays at the current signal level to encode a 0.

10
New cards

4B/5B Encoding

An encoding technique that inserts extra bits into a bitstream to break up long sequences by encoding 4 bits of data into a 5-bit code, requiring no more than one leading zero and no more than two trailing zeros.

11
New cards

Circuit Switched Network

A network that establishes a dedicated circuit across a set of links for one use at a time to send a continuous stream of bits, such as Plain Old Telephone System (POTS).

12
New cards

Packet Switched Network

A network where nodes send discrete data blocks (packets) using a store-and-forward mechanism.

13
New cards

Store-and-Forward

A three-step networking process: (1) receive a packet over a link, (2) store the packet in internal memory, and (3) forward the packet to another node.

14
New cards

Statistical Multiplexing

A resource-sharing technique where a physical link is shared over time and data is transmitted from each flow dynamically on demand.

15
New cards

Delay x Bandwidth Product

The calculation (Bandwidth×Latency\text{Bandwidth} \times \text{Latency}) indicating how many bits can fit into the network pipe at a time.

16
New cards

Demultiplexing Key (Demux Key)

An 8-, 16-, or 32-bit field used at protocol stack levels to identify the higher-level protocol to which incoming data belongs.

17
New cards

Media Access Control (MAC) Address

A link-layer hardware identifier used exclusively by devices communicating on the same local network.

18
New cards

Network Prefix

The leading bits of an IP address that are shared by all devices located on the same subnet.

19
New cards

Host Identifier

The portion of an IP address that uniquely identifies a specific host machine on its subnet.

20
New cards

Transmission Control Protocol (TCP)

A reliable, connection-oriented transport layer protocol that delivers segments, ensures minimal errors, and includes flow and congestion control.

21
New cards

User Datagram Protocol (UDP)

A connectionless, best-effort transport layer protocol preferred for speed that transmits datagrams and adds basic port demultiplexing.

22
New cards

Well-Known Ports

Network port numbers in the range 0 to 1023, typically reserved for standardized server services so clients can easily connect.

23
New cards

Maximum Transmission Unit (MTU)

The largest IP datagram that a specific network link type can carry within its physical frame.

24
New cards

Flow Label

A 20-bit IPv6 header field that hints to routers and switches with multiple paths to keep certain packets on the same outbound path to avoid reordering.

25
New cards

Automatic Repeat reQuest (ARQ)

A reliable delivery mechanism implemented using acknowledgements (ACKs) and timeouts to trigger retransmissions when packets are lost.

26
New cards

Stop-and-Wait

The simplest ARQ mechanism where the sender transmits a single frame and pauses until receiving an ACK before sending the next frame.

27
New cards

Maximum Segment Size (MSS)

The largest segment size a host can handle, defined as the largest IP datagram minus IP and TCP header sizes (536 bytes536\text{ bytes} for IPv4; 1220 bytes1220\text{ bytes} for IPv6).

28
New cards

AdvertizedWindow

A TCP flow-control parameter selected by the receiver that limits the number of bytes of unacknowledged data the sender is permitted to transmit.

29
New cards

Selective Acknowledgements (SACK)

A TCP feature that informs the sender of non-contiguous blocks of data that have been received and queued successfully.

30
New cards

Network Address Translation (NAT)

An internet-layer service that enables multiple devices on a private network to share a single public IP address on the internet.

31
New cards

Fully Qualified Domain Name (FQDN)

A complete, unambiguous domain name that specifies a computer's exact position within the DNS hierarchy.

32
New cards

CNAME (Canonical Name)

A DNS record that maps an alias hostname to another canonical hostname.

33
New cards

Arithmetic Logic Unit (ALU)

A digital circuit inside the CPU that performs fundamental, low-level arithmetic and logical operations.

34
New cards

Program Counter

A dedicated register that stores the memory address of the instruction that should be fetched and executed next.

35
New cards

Instruction Register

A CPU register that holds the machine instruction currently being decoded and executed.

36
New cards

Processor Starvation

A performance bottleneck that occurs when a high-speed CPU is forced to wait on sluggish memory or data storage to deliver inputs or consume outputs.

37
New cards

Northbridge Chipset

A motherboard chipset responsible for managing communications between the CPU and high-speed components like main memory and PCI-E buses.

38
New cards

Southbridge Chipset

A motherboard chipset that manages communication with slower peripheral buses and devices such as USB, hard disks, and keyboards.

39
New cards

Memory Mapped I/O

An architecture where CPU accesses peripheral I/O devices through allocated locations in regular system memory address space using regular memory instructions.

40
New cards

Instruction Set Architecture (ISA)

The abstract interface defining the set of machine-level instructions and operations supported by a CPU family (such as x86 or ARM).

41
New cards

Moore's Law

The empirical observation that the number of transistors packed into a dense integrated circuit doubles approximately every two years.

42
New cards

Dennard Scaling

The principle stating that as transistors shrink, power density remains constant because operating voltage and current scale downwards in proportion to physical size.

43
New cards

Dark Silicon

The portion of a multicore processor's surface area that must remain unpowered or throttled during execution to avoid exceeding thermal and power thresholds.

44
New cards

Harvard Architecture

A computer design featuring physically separated buses and storage areas for instruction memory and data memory, allowing simultaneous access to both.

45
New cards

Calling Chain

The sequence of functions currently active in a program's execution, where the very last function invoked is the current active function.

46
New cards

Frame (Activation Record)

A segment of stack memory containing the pointer values and temporary variables required to save, run, and reinstate a function's execution state.