Computer Networking CNS Chapter 2 Quiz
23 Questions
0 Views

Choose a study mode

Play Quiz
Study Flashcards
Spaced Repetition
Chat to lesson

Podcast

Play an AI-generated podcast conversation about this lesson

Questions and Answers

Which of the following is a characteristic of slotted ALOHA?

  • Nodes can transmit at any random time.
  • Transmissions must start at multiples of transmission intervals. (correct)
  • Each node has equal chances to transmit.
  • It eliminates all collisions.
  • In 1-persistent CSMA, a node always waits for the medium to be free before starting to transmit.

    True

    What is the approximate efficiency of slotted ALOHA?

    37%

    In CSMA, nodes must ___ before they start transmitting.

    <p>listen</p> Signup and view all the answers

    Match the following CSMA variants with their characteristics:

    <p>1-persistent CSMA = Always transmits immediately if idle p-persistent CSMA = Transmits with probability p non-persistent CSMA = Waits a random amount of time before trying again</p> Signup and view all the answers

    What happens during a collision in ALOHA?

    <p>Multiple nodes transmit simultaneously.</p> Signup and view all the answers

    The efficiency of ALOHA is higher than that of slotted ALOHA.

    <p>False</p> Signup and view all the answers

    What does CSMA stand for?

    <p>Carrier Sense Multiple Access</p> Signup and view all the answers

    What does RTS stand for in the context of transmission control?

    <p>Request to Send</p> Signup and view all the answers

    In IEEE 802.11, a transmission is never successful unless an acknowledgment is received.

    <p>False</p> Signup and view all the answers

    Name the two types of access methods mentioned in the document.

    <p>CSMA and ALOHA</p> Signup and view all the answers

    The acknowledgment for a successful unicast transmission is sent after a ______.

    <p>Short Interframe Space (SIFS)</p> Signup and view all the answers

    What happens in IEEE 802.11 if a node wants to send data but detects a busy medium?

    <p>It will defer access to the medium.</p> Signup and view all the answers

    Match the following terms with their corresponding descriptions:

    <p>CSMA/CA = Collision Avoidance Protocol RTS/CTS = Request and Clear to Send Mechanism DIFS = Distributed Interframe Space SIFS = Short Interframe Space</p> Signup and view all the answers

    What is the role of the base station in infrastructure mode?

    <p>To control transmissions and manage communication between nodes.</p> Signup and view all the answers

    CSMA/CD can operate efficiently in wireless networks.

    <p>False</p> Signup and view all the answers

    What is a characteristic of CSMA/CD?

    <p>It detects and manages collisions in the network.</p> Signup and view all the answers

    ALOHA can be classified as a controlled access method.

    <p>False</p> Signup and view all the answers

    In ___________ Ring, token passing is used to prevent collisions.

    <p>Token</p> Signup and view all the answers

    Match the following access methods with their descriptions:

    <p>ALOHA = First come, first served access CSMA/CD = Collision detection and handling CSMA/CA = Prevention of collisions in wireless Token Passing = Controlled access method to reduce collisions</p> Signup and view all the answers

    Which of the following protocols is used in IEEE 802.11 WLAN? (Select all that apply)

    <p>CSMA/CA with RTS/CTS</p> Signup and view all the answers

    Data frames can vary in size and do not require special boundary detection mechanisms.

    <p>False</p> Signup and view all the answers

    Name one security consideration related to data link layer protocols.

    <p>Error detection</p> Signup and view all the answers

    Study Notes

    Computer Networking and IT Security (CNS)

    • Course: INHH0012
    • Semester: WiSe 2024/25
    • Instructor: Prof. Dr.-Ing. Stephan Günther
    • Institution: Technical University of Munich (TUM)
    • Date: Saturday 2nd November, 2024
    • Focuses on Local Area Networks (LANs)
    • Characterizes connections, multiple access, and access control
    • Includes framing, addressing, and error detection
    • Covers connecting nodes on Layers 1 and 2
    • Discusses security considerations
    • Presents a summary of the chapter content
    • Uses graphs to represent networks
    • Includes directed graphs and undirected graphs
    • Explains paths in networks and network topologies
    • Introduces adjacency and distance matrices
    • Explains how to create tree structures

    Directed Graphs

    • Commonly used to represent network topologies and node connections
    • An asymmetric network can be represented as a directed graph G = (N, A)
    • N: Set of nodes/vertices
    • A: Set of directed arcs {i, j} | i, j ∈ N ∧ i, j are connected by a directed arc}
    • Example: N = {1, 2, 3, 4}, A = {(1, 2), (2, 3), (2, 4), (1, 4)}

    Undirected Graphs

    • Represents a symmetric network as an undirected graph G = (N, E)
    • N: Set of nodes
    • E: Set of (undirected) edges {i, j} | i, j ∈ N ∧ i, j are connected undirectedly}
    • Example: N = {1, 2, 3, 4}, E = {{1, 2}, {2, 3}, {2, 4}, {1, 4}}

    Paths in Networks

    • A path between two nodes s, t ∈ N is a set Pst = {(s, i), (i, j),...,(k, l),(l, t)} of edges connecting s and t
    • Path cost: Sum of costs of used edges: c(Pst) = ΣCij (i,j)∈Pst
    • Path length: Number of intermediate nodes: I(Pst) = |Pst|
    • Layer 3 path costs are often referred to as hop counts which are less common on Layer 2.
    • Source and destination are commonly denoted as 's' and 't' respectively

    Network Topologies

    • Descriptions of how nodes are interconnected in a network
    • Well-known Topologies: Point-to-point, Chain, Star, Mesh, Tree, Bus

    Adjacency and Distance Matrix

    • Adjacency matrix (A) represents connections between nodes in a network
      • A(i, j) = 1 if there's a connection from node i to node j, otherwise 0
      • Symmetric if A = AT
    • Distance matrix (D) shows the shortest path cost between all node pairs.
      • D(i, j) = cost of the shortest path of length 1 between nodes i and j
      • D(i, i)= 0, dij= ∞ if no direct connection

    Question and Answer About Adjacency and Distance Matrix

    • Question: How do we get a matrix of the shortest path costs between any pair of nodes?
    • Answer: Calculate powers of D with respect to the min-plus product
      • (Dn with d = min {di-1 + dkj} for i, j, k ∈ N)
      • The nth power (Dn) contains costs of shortest paths of length n hops or less.

    Creating Tree Structures

    • Trees are connected, loop-free graphs
    • Two special types are discussed: Shortest Path Tree (SPT) and Minimum Spanning Tree (MST)
    • SPT connects a root to all other nodes with minimum total cost.
    • MST connects all nodes with minimum total cost for the needed arcs (unrooted tree).

    Characterizing Connections, Media Access, ALOHA, CSMA, CSMA/CD, CSMA/CA, Token Passing

    • Data rate, transmission delay, direction of transmission, and multiple access
    • Different media access control methods:
      • ALOHA (early wireless networking protocol)
      • Slotted ALOHA
      • CSMA/CSMA/CD
      • CSMA/CA
      • Token Passing

    Addressing and Error Detection

    • Unique node identification
    • Broadcast and multicast addresses
    • MAC addresses (Media Access Control)
    • Error detection codes (e.g., checksums/cyclic redundancy checks (CRC)) are used to increase reliability)
    • Handling of frame boundaries and code transparency (essential for reliable transmission and receiver recognition)

    Security Considerations (Layer 2)

    • CAM (Content Addressable Memory) poisoning, an attack where an attacker can forge MAC addresses and disrupt network communications.
    • Denial of Service (DoS) attack is performed by flooding the switch with a large number of requests from arbitrary source addresses
    • Mitigations for layer 2 attacks (e.g. Allowed source address, dynamic port security, automatic removal of obsolete entries)
    • Cable and wireless security considerations (limiting access to the medium, authentication, wireless security standards, like WEP, WPA, WPA2, and WPA3)

    Studying That Suits You

    Use AI to generate personalized quizzes and flashcards to suit your learning preferences.

    Quiz Team

    Related Documents

    Description

    Test your knowledge on Chapter 2 of Computer Networking and IT Security, focusing on the Data Link Layer. This quiz covers topics such as Local Area Networks (LANs), framing, addressing, error detection, and network representation using graphs. Prepare to demonstrate your understanding of both theoretical concepts and practical applications.

    More Like This

    Network Layer Data Plane Quiz
    10 questions
    Data Link Layer Quiz
    10 questions

    Data Link Layer Quiz

    EnticingIguana avatar
    EnticingIguana
    Data Link Layer vs Physical Layer
    34 questions
    Use Quizgecko on...
    Browser
    Browser