Networking Concepts Quiz
54 Questions
1 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

What is a disadvantage of simple flooding in network communication?

  • It only works for small networks.
  • It can lead to inefficiency by sending multiple copies of a packet. (correct)
  • It requires minimal packets to be sent.
  • It guarantees the packet will reach the destination.

In a flooding network design, a packet can be forwarded back to the node that just sent it.

False (B)

What is the purpose of including a hop limit in a packet?

To limit the number of times a packet can be forwarded through the network.

In selective flooding, packets are sent to a selection of ______.

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

Match the following strategies to their descriptions:

<p>Don’t send back = Prevents routing loops Only forward once = Avoids duplicate packets Duplicate detection = Discards multiple copies Hop limit = Controls packet forwarding</p> Signup and view all the answers

Which of the following is NOT a part of the flooding strategy protocol?

<p>Data compression. (A)</p> Signup and view all the answers

Adaptive routing algorithms do not adjust based on network conditions.

<p>False (B)</p> Signup and view all the answers

What method is used to determine routes in adaptive routing?

<p>Least-cost routing algorithm.</p> Signup and view all the answers

What is used to create a dedicated communications path between two stations?

<p>Circuit Switching (B)</p> Signup and view all the answers

In packet switching, data is transmitted through dedicated paths only.

<p>False (B)</p> Signup and view all the answers

Which routing design strategy involves using a single permanent route for each source to destination pair?

<p>Fixed Routing (B)</p> Signup and view all the answers

Name one technology used in wide area switched networks.

<p>Circuit Switching or Packet Switching</p> Signup and view all the answers

Fixed routing can respond to traffic changes in the network.

<p>False (B)</p> Signup and view all the answers

Switching nodes in a network are not concerned with the __________ of data.

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

Name one advantage of fixed routing.

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

Match the following terms with their definitions:

<p>Circuit Switching = Dedicated path for communication Packet Switching = Data sent in packets Switching Nodes = Routing points in a network Stations = Devices attached to the network</p> Signup and view all the answers

Routes in fixed routing are determined using least cost algorithms such as ______ and ______.

<p>Dijkstra, Bellman-Ford</p> Signup and view all the answers

What is a typical characteristic of packet switching?

<p>Messages sent as a series of packets (A)</p> Signup and view all the answers

Match the following routing strategies with their characteristics:

<p>Fixed Routing = Uses a single permanent route for each source-destination pair Dynamic Routing = Adapts to changes in network topology Adaptive Routing = Changes routes based on network load Hybrid Routing = Combines features of fixed and dynamic routing</p> Signup and view all the answers

All nodes in a switched network must be fully connected to each other.

<p>False (B)</p> Signup and view all the answers

What is a disadvantage of fixed routing?

<p>Inability to respond to network load changes (B)</p> Signup and view all the answers

What information is typically stored in a routing table?

<p>Next node in path and optionally cost of path</p> Signup and view all the answers

What are the devices attached to a switched network called?

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

In a circuit switching system, the logical channel is __________ to a connection on each physical link.

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

Fixed routing is the most flexible routing design strategy.

<p>False (B)</p> Signup and view all the answers

Which of the following is NOT a phase in circuit switching?

<p>Packet Fragmentation (A)</p> Signup and view all the answers

What is an advantage of adaptive routing?

<p>Improved performance through suited path selection (B)</p> Signup and view all the answers

Adaptive routing always leads to the best routing decisions.

<p>False (B)</p> Signup and view all the answers

Name one routing protocol used for determining the least-cost routes.

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

A routing protocol specifies the routing algorithm, routing information, and formats of ______.

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

Match the following routing protocols with their characteristics:

<p>OSPF = Link-state routing protocol RIP = Distance-vector routing protocol BGP = Path vector protocol EIGRP = Hybrid routing protocol</p> Signup and view all the answers

Which of the following is a disadvantage of adaptive routing?

<p>Complex decision-making processes (A)</p> Signup and view all the answers

What can happen if adaptive routing reacts too quickly to network changes?

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

Increasing the amount of information for routing decisions decreases network overhead.

<p>False (B)</p> Signup and view all the answers

Which algorithm is used in link state routing to determine the least-cost routes?

<p>Dijkstra's algorithm (D)</p> Signup and view all the answers

In link state routing, each node only needs to know the state of its immediate neighbors.

<p>False (B)</p> Signup and view all the answers

What is a primary function of the link state packet in link state routing?

<p>To send the state of the node's links to every other node.</p> Signup and view all the answers

In link state routing, a node builds a routing table based on the _____ created from its shortest path tree.

<p>shortest path</p> Signup and view all the answers

Match the following components of link state routing to their descriptions:

<p>Link State Packet = Contains the node's link information Flooding = Method to send link state packets Hop Count = Indicates the age of the packet Routing Table = Stores the least-cost paths</p> Signup and view all the answers

What must be reserved in circuit switching before data transfer begins?

<p>Path (D)</p> Signup and view all the answers

In circuit switching, resources are released immediately after the data transfer is complete.

<p>False (B)</p> Signup and view all the answers

What are the two main types of packet switching?

<p>Datagram packet switching and virtual circuit packet switching</p> Signup and view all the answers

In packet switching, data is broken into ________ before transmission.

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

Which of the following is NOT a characteristic of circuit switching?

<p>Processes each packet independently (B)</p> Signup and view all the answers

In virtual circuit packet switching, all packets take the same path across the network.

<p>True (A)</p> Signup and view all the answers

What is a common issue associated with circuit switching resources?

<p>Inefficiency if applications do not utilize the reserved capacity</p> Signup and view all the answers

In ________ packet switching, packets may arrive out of order and take different paths across the network.

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

Which of the following is an example of a circuit switching network?

<p>Private telephone network (D)</p> Signup and view all the answers

Packet switching is generally seen as more efficient for data connections compared to circuit switching.

<p>True (A)</p> Signup and view all the answers

What guarantees are provided in circuit switching concerning data transfer?

<p>Guaranteed data rate and delay</p> Signup and view all the answers

Match the following types of switching with their characteristics:

<p>Circuit Switching = Reserves resources for a dedicated connection Packet Switching = Sends data in small packets Datagram Packet Switching = Processes each packet independently Virtual Circuit Packet Switching = Maintains the same path for all packets</p> Signup and view all the answers

What happens during circuit disconnection?

<p>Resources are de-allocated (C)</p> Signup and view all the answers

In packet switching, each packet contains headers that inform the switches where to send the packets.

<p>True (A)</p> Signup and view all the answers

What is a major benefit of packet switching over circuit switching?

<p>Efficiency in resource utilization</p> Signup and view all the answers

Flashcards

Switched Networks

A network where data is transmitted through a series of interconnected switching nodes. These nodes are responsible for forwarding data packets without looking at their content.

Circuit Switching

A type of network where a dedicated communication path is established between two stations. This path involves a sequence of physical links between switching nodes.

Packet Switching

A network technology where data is broken into smaller packets and transmitted independently across a network. Each packet contains destination information and is routed individually through the network.

What is established in a Circuit Switching network?

A dedicated communication path between two stations in a network. This path is a sequence of links between nodes, with a logical channel allocated on each physical link.

Signup and view all the flashcards

What are the three phases of Circuit Switching?

Three phases: Connection Establishment, Data Transfer, and Connection Release are involved.

Signup and view all the flashcards

How does Packet Switching transmit data?

Data is broken down into packets, each with a destination address. These packets are sent independently through the network and reassembled at the destination.

Signup and view all the flashcards

Is there continuous use of the dedicated path in Circuit Switching?

In Circuit Switching, a dedicated path is established for the entire duration of the communication, regardless of whether data is being transmitted or not.

Signup and view all the flashcards

What type of network traffic is Packet Switching efficient for?

Packet Switching is more efficient for networks with intermittent traffic, as it only uses resources when data is being transmitted.

Signup and view all the flashcards

How does a network node failure affect Circuit Switching and Packet Switching?

If a network node fails, the entire connection is disrupted in Circuit Switching, while in Packet Switching, other paths can be used if a node fails.

Signup and view all the flashcards

When should Circuit Switching or Packet Switching be used?

Circuit Switching is suitable for real-time applications like voice calls where continuous, dedicated connections are required. Packet Switching is suitable for applications with intermittent communication, such as email or file transfers.

Signup and view all the flashcards

Fixed Routing

A routing strategy where each source-destination pair has a single, permanent route determined using an algorithm like Dijkstra's or Bellman-Ford.

Signup and view all the flashcards

Least Cost Algorithm

A routing algorithm like Dijkstra's or Bellman-Ford to determine the shortest path between nodes in a network.

Signup and view all the flashcards

Network Topology Change

A change in network topology (e.g., node or link added/removed) that triggers a need for new routes.

Signup and view all the flashcards

Routing Table

A table within a router that maps destinations to the next hop in the path and optional path cost.

Signup and view all the flashcards

Traffic Changes

A change in traffic load (e.g., congestion on one link) that might warrant a different route, but fixed routing won't adapt.

Signup and view all the flashcards

Fixed Routing Advantages & Disadvantages

Simpler to implement as routes are pre-defined, but less flexible as they don't adapt to changes in network conditions.

Signup and view all the flashcards

Adaptive Routing

A routing strategy that dynamically adapts to changes in network conditions, such as traffic load or topology changes.

Signup and view all the flashcards

Distributed Routing

A routing strategy where all routers share information about their network state, such as congestion or topology changes, to adapt routes.

Signup and view all the flashcards

Flooding

A simple way to route packets using a fixed path, where each packet is sent to every neighboring node in the network.

Signup and view all the flashcards

Duplicate Detection

A technique used in flooding to prevent infinite loop scenario. Each node keeps a list of packets it has forwarded before, thereby avoiding forwarding the same packet multiple times.

Signup and view all the flashcards

Hop Limit

A method to limit the number of hops a packet takes to reach its destination. Each packet carries a counter that gets decremented with each hop. When the counter reaches zero, the packet is discarded.

Signup and view all the flashcards

Selective Flooding

A variation of flooding where a packet is sent to selected neighboring nodes instead of all of them. Selection criteria can be based on factors like randomness, round-robin, or probabilities.

Signup and view all the flashcards

Network Status Information

A key component of Adaptive Routing. It involves gathering and analyzing information about the network topology and conditions to make informed routing decisions.

Signup and view all the flashcards

Inefficiency of Flooding

A major disadvantage of Flooding. Sending packets to all neighboring nodes, even if only one destination is required, consumes network resources inefficiently.

Signup and view all the flashcards

Non-guaranteed Delivery in Flooding

Another disadvantage of Flooding. Packet might not reach its intended destination because of a combination of Hop Limit and how packets are forwarded in non-optimal ways.

Signup and view all the flashcards

Link State Routing

A routing design strategy where each node learns the complete network topology and calculates the shortest path to every other node.

Signup and view all the flashcards

Dijkstra's Algorithm

An algorithm for determining the shortest path between nodes in a graph. In the context of link state routing, it is used to calculate the shortest paths from a node to every other node in the network.

Signup and view all the flashcards

Link State Packet

A message broadcast by a node in a link state network to inform other nodes about its directly connected links and their costs.

Signup and view all the flashcards

Shortest Path Tree

A data structure used in link state routing to represent the shortest path from a source node to every other node in the network. It helps determine the best way to reach each destination.

Signup and view all the flashcards

Datagram Packet Switching

A type of packet switching where each packet is treated independently, with no pre-determined paths. This offers flexibility but can lead to packet loss or out-of-order delivery.

Signup and view all the flashcards

Virtual Circuit Packet Switching

A type of packet switching where a virtual circuit (logical path) is established before data transfer. Packets follow the same route and are delivered in order, offering reliable data transmission but less flexibility than datagram switching.

Signup and view all the flashcards

Circuit Establishment

The process of establishing a connection between two communication endpoints in a circuit-switched network by allocating resources (bandwidth, circuit capacity) along the path.

Signup and view all the flashcards

Data Transfer (Circuit Switching)

The process of transferring data from one endpoint to another in a circuit-switched network. This involves sending data over the dedicated path established during circuit establishment.

Signup and view all the flashcards

Circuit Disconnect

The process of terminating a connection and releasing the resources used in a circuit-switched network after data transfer is completed.

Signup and view all the flashcards

Routing

A method of routing data packets across a network. Routing algorithms and protocols determine the optimal path for each packet based on network conditions and destination.

Signup and view all the flashcards

Routing Design

The process of designing and configuring the network infrastructure to support efficient routing. This involves choosing appropriate routing algorithms, defining routing policies, and managing the network topology.

Signup and view all the flashcards

Routing Strategies

Different strategies used by routing algorithms to determine the best path for data packets. These strategies can prioritize different factors like bandwidth, delay, and cost.

Signup and view all the flashcards

Routing Protocols

The set of rules and procedures used by routers to exchange routing information and update their routing tables. Protocols ensure efficient and reliable communication between routers.

Signup and view all the flashcards

Routing protocols in networks

A routing protocol is used by nodes to automatically determine the routes in the network.

Signup and view all the flashcards

What does a routing protocol define?

A routing protocol specifies how to determine the best paths in a network, how to exchange routing information, the format of messages used, and other important details.

Signup and view all the flashcards

What is a routing algorithm?

A routing algorithm determines the least-cost routes between nodes. Examples include Dijkstra, Bellman-Ford, and their variations.

Signup and view all the flashcards

How does routing information flow between nodes?

Routing protocols specify the information that needs to be exchanged between nodes. This includes network topology, link costs, and other data relevant to route optimization.

Signup and view all the flashcards

Format of routing messages

Routing protocols define the structure and content of messages used to exchange routing information between nodes. This helps maintain consistency and facilitates communication.

Signup and view all the flashcards

Rules for sending and receiving routing messages

Rules governing when to send routing messages, and what to do upon receiving them, ensure efficient information exchange and timely updates.

Signup and view all the flashcards

Metrics used in routing algorithms

Routing protocols employ metrics like hop count and bandwidth to evaluate and prioritize different paths. This helps determine the most efficient route based on network constraints.

Signup and view all the flashcards

Default values in routing protocols

Some routing protocols offer default values for specific parameters, providing flexibility and simplifying configuration.

Signup and view all the flashcards

Study Notes

Communication Networks

  • Communication networks are formed by connecting devices across multiple links.
  • Switching is the method of delivering data between a source and destination across multiple links.
  • Stations (end-user devices) act as sources and destinations of data.
  • Switches connect links and forward data between source and destination.

Circuit and Packet Switching

  • Circuit switching techniques determine how to deliver data across one or more paths between source and destination.
  • Packet switching determines the path taken between source and destination.
  • There are different routing metrics, strategies, algorithm, and protocols available.

Routing

  • Routing is a key design issue in switched networks.
  • The question is what path (route) should be taken from the source to the destination.
  • The answer is to choose the "best" path.
  • What is "best" and how to choose it?
  • Real networks may contain hundreds to hundreds of thousands of nodes with many possible paths.
  • Routing is needed in circuit-switched and packet-switched networks.

Requirements of Routing Algorithms

  • Correctness: the path must be from the intended source to the intended destination.
  • Simplicity: easy and cheap to implement.
  • Robustness: able to deliver in the presence of errors or overload.
  • Stability: path changes should not be too frequent.
  • Optimality: choose the best paths.
  • Fairness: ensuring all stations obtain equal performance.
  • Efficiency: minimizing processing and transmission overhead.

Routing Terminology

  • Link: direct connection between two nodes.
  • Path: a way between two nodes via one or more links.
  • Hop: to traverse a link.
  • Neighbor: A node at the other end of a link.
  • Cost: value assigned to a link indicating the cost of using that link.
  • Topology: the arrangement of nodes and links in a network.
  • Least-cost routing is the practice of selecting a path with the lowest cost.

Strategy 1: Fixed Routing

  • Use a single permanent route for each source-destination pair.
  • Routes are determined using a least-cost algorithm (e.g., Dijkstra, Bellman-Ford).
  • The route is fixed until a change in network topology (e.g. node/link added/deleted).
  • Fixed routing cannot respond to traffic changes.
  • It is simple but lacks flexibility.

Strategy 2: Flooding

  • Instead of choosing a route before sending data, just send the data to everyone.
  • A copy of the original packet is sent to all neighbours of the Source.
  • Each node receiving the packet forwards a copy to all its neighbours.
  • Advantages: all possible routes are tried. At least one packet will take the minimum hop route. All nodes are visited; distributing network status information. Simple.
  • Disadvantages: inefficient; needs many copies to get one to the destination. Using hop limits and selective flooding can prevent packets from reaching the destination.

Flooding Extensions

  • Don't resend messages back to the sender node.
  • Only forward packets once.
  • Duplicate detection avoids duplicate copies.
  • Hop limits prevent packets from traversing too many hops.
  • Selective flooding sends packets to a selection of neighbours (e.g., random, round-robin).

Strategy 3: Adaptive Routing

  • Uses a least-cost routing algorithm to determine a route.
  • Adapts the route as network conditions change.
  • Used in almost all packet switching networks (e.g., the Internet).
  • Requires network status information from the local node, adjacent nodes, or all nodes.

Characteristics of Adaptive Routing

  • Advantages: improved performance; potentially better paths; balanced traffic.
  • Disadvantages: decisions are more complex; trade-off between quality of network information and overhead. Reacting too quickly can cause instability. Reacting too slowly means information may be irrelevant.

Routing Protocols

  • A routing protocol is used by nodes to automatically determine routes in the network.
  • Routing protocols specify: a routing algorithm (e.g., Dijkstra's, Bellman-Ford); routing information exchanged between nodes; the format of routing messages.
  • Metrics include hop count and bandwidth.
  • Examples of real routing protocols include OSPF, RIP, BGP, IGRP, EIGRP, PNNI, IS-IS, DSDV, and AODV.
  • Uses Dijkstra's algorithm to determine least-cost routes.
  • Each node learns the topology of the network.
  • Calculates the least-cost route from itself to every other node.
  • Steps for each node:
    1. Record its own link state (e.g., source/destination, metric).
    2. Flood the link state packet to all other nodes.
    3. Create shortest path tree.
    4. Build a routing table based on the tree.

Studying That Suits You

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

Quiz Team

Related Documents

CS461 Switching PDF

Description

Test your knowledge on various networking concepts including flooding, routing strategies, and adaptive routing. This quiz covers topics such as packet switching, hop limits, and dedicated communication paths. Challenge yourself and see how well you understand the intricacies of network communication!

More Like This

Test Your Network Communication Knowledge
14 questions

Test Your Network Communication Knowledge

ReformedPinkTourmaline avatar
ReformedPinkTourmaline
Mastering Network Interface Cards (NICs)
30 questions

Mastering Network Interface Cards (NICs)

GreatAntigorite avatar
GreatAntigorite
VLAN: ROUTING VLAN
11 questions

VLAN: ROUTING VLAN

OptimalGold avatar
OptimalGold
Introducción a OSPF (Open Shortest Path First)
10 questions

Introducción a OSPF (Open Shortest Path First)

TransparentIodine avatar
TransparentIodine
Use Quizgecko on...
Browser
Open
Browser
Browser