Week 3

Question 1

What are some key underlying techniques of networking?

Answer 1

Switching
Routing
TCP/IP
Ethernet
Wireless Networking
Firewalls & Security Protocols
DNS
QoS
Subnetting

Question 2

Packet Switching def:

Answer 2

Packet switching is how data is sent across a network. It breaks down information into small chunks, called packets, and sends each one separately.

Question 3

Advantages of packet switching?

Answer 3

-Life efficiency
-Conversion of data rate
-Packets are still accepted during network congestion, but their delivery may experience delays.
-Possible to apply priorities
-Packets are processed in two manners – Datagram and Virtual Circuit.

Question 4

Routing - Circuit Switched Network def:

Answer 4

Routing is the process of deciding how data should travel from one device to another across a network (like the internet). It’s done by routers, which are devices that direct the flow of data packets to their destination.

Question 5

Crucial Aspects in Packet Switched Network Routing:

Answer 5

Correctness
Simplicity
Robustness
Stability
Fairness
Optimality
Efficiency

Question 6

Types of Routing Strategies:

Answer 6

**Fixed (the paths that data packets take are predefined and do not change. Once the routes are set, they stay the same).
**Flooding (a router sends the data packet to all of its neighbours (every possible path), hoping the packet will eventually reach the destination).
**Random (routers send data packets along a random path, not based on a fixed route or algorithm).
**Adaptive (Adaptive routing dynamically changes the route of the data based on current network conditions, like traffic, network failures, or congestion).

Question 7

Why Adaptive Routing is Preferred Ahead of Others?

Answer 7

-Improved Performance
-Aid Congestion Control
-Complex System
-May Not Realize Theoretical Benefits

Question 8

Dijkstra’s Algorithm Definitions:

Answer 8

Dijkstra’s Algorithm is a method used to find the shortest path between two points (or nodes) in a network or graph. It helps find the quickest route from a starting point to a destination, considering all possible paths and their “costs” (such as distance or time).

Question 9

Definition: Bellman-Ford Algorithm

Answer 9

The Bellman-Ford Algorithm is a method used to find the shortest path from a starting point to all other points in a network (or graph), especially useful for graphs that have negative-weight edges (where some paths may have negative values).

Question 10

Comparison:

Answer 10

Bellman-Ford: Nodes only need info from their neighbors to update paths.

Dijkstra: Every node needs the full network’s link information to make decisions.