Network Device and Conifguration

Group 7
No Name of student Id Number
1. Tadesse Aderajew IT sum 045/10
2. Asratie Abebaw IT sum 008/10
3. Getatcew Sisay IT sum 019/10
4. Shegaw Ayalew IT sum 038/10
5. Semahegn Negussie IT sum 028/10

Submit To: Simachew W. (MSc)

September 2017 E.C

Debre Tabor, Ethiopia
 Table Content
Topics Pages
Table Content .............................................................................................................................. I

1, Discuss briefly the difference and similarity of router ,bridge and multilayer switch? ....... 1

2 . Explian briefly dijkstra formula algorithm along with example? .......................................... 2

3. Explian briefly about bell man fored algorithm with example? .......................................... 3

4. Write briefly the difference between bell man fored algorithm and dijkstra algorithm
along with example? .................................................................................................................. 5

5. Brief explain the difference between wildcard masks and subnet masks, along with
examples? ...................................................................................................................................7

6. Explain Briefly about VLSM with example? ...........................................................................8

References ................................................................................................................................10

I
1, Discuss briefly the difference and similarity of
router ,bridge and multilayer switch?
Similarities:

• Network Connectivity: All three devices connect different network segments, enabling
communication between them.
• Data Forwarding: They all forward data packets between networks based on specific rules.
• Layer 2 Operation: Bridges and multilayer switches operate primarily at Layer 2 of the OSI
model (data link layer), handling MAC addresses for forwarding decisions.

Differences:

Example:

• Bridge: Imagine two offices with their own separate networks. A bridge can connect these
two offices so devices on each network can communicate.
• Multilayer Switch: A larger office might use a multilayer switch to create virtual LANs
(VLANs), separating departments into distinct network segments for security and traffic
control.
• Router: Connecting your home network to the internet requires a router. It translates your
home network's private IP addresses to public IP addresses used on the internet, ensuring
seamless communication.

Summary:

• Routers are the most powerful, handling Layer 3 (network layer) protocols and providing
advanced routing, security, and network segmentation.
• Bridges are the simplest, connecting two network segments at Layer 2.

1
• Multilayer switches offer a balance between simplicity and functionality, supporting Layer
2 and limited Layer 3 features like VLANs and access control lists.
The best choice for your network depends on its size, security needs, and budget.

2 . Explian briefly dijkstra formula algorithm along with

example?

Dijkstra's algorithm is a clever way to find the shortest path between two nodes in a
graph, particularly when all the edges have non-negative weights (distances). It's like a
step-by-step guide for finding the most efficient route.

how it works:

1. Initialization:
- Start with a starting node.
- Set the distance to the starting node to 0.
- Set the distance to all other nodes to infinity (a very large value).
- Create an empty set of visited nodes.

2. Iteration:
- Repeat the following until all nodes are visited:
- Select the unvisited node with the shortest distance from the starting node.
- Add the selected node to the visited set.
- For each unvisited neighbor of the selected node:
- Calculate the tentative distance from the starting node to the neighbor through the
selected node.
- If this tentative distance is shorter than the current shortest distance to the neighbor,
update the neighbor's distance.

Example:

Imagine a road network between four cities (A, B, C, and D) with distances:

A --- 3 --- B
| |
2 5
| |
C --- 4 --- D

Goal: Find the shortest path from city A to city D.

Steps:

2
1. Initialization:
- dist[A] = 0
- dist[B] = ∞
- dist[C] = ∞
- dist[D] = ∞
- visited = {}

2. Iteration 1:
- Select A (shortest distance from A to A is 0).
- visited = {A}
- Update distances to neighbors:
- dist[B] = min(dist[B], dist[A] + weight(A, B)) = min(∞, 0 + 3) = 3
- dist[C] = min(dist[C], dist[A] + weight(A, C)) = min(∞, 0 + 2) = 2

3. Iteration 2:
- Select C (shortest distance from A to C is 2).
- visited = {A, C}
- Update distances to neighbors:
- dist[D] = min(dist[D], dist[C] + weight(C, D)) = min(∞, 2 + 4) = 6

4. Iteration 3:
- Select B (shortest distance from A to B is 3).
- visited = {A, C, B}
- No updates are needed, as B has no unvisited neighbors.

5. Iteration 4:
- Select D (shortest distance from A to D is 6).
- visited = {A, C, B, D}
- All nodes are visited.
Shortest Path: The shortest path from A to D is A -> C -> D (total distance of 6).
summary: Dijkstra's algorithm provides a straightforward and efficient way to find the
shortest path between nodes in a graph with non-negative edge weights, making it a
valuable tool in various applications like routing, navigation, and network optimization.

3. Explian briefly about bell man fored algorithm with

example?
The Bellman-Ford algorithm is a powerful tool for finding the shortest
paths between nodes in a graph, even if those paths involve negative
edge weights.

How it Works:

1. Initialization:

3
 - Set the distance to the starting node to 0.
- Set the distance to all other nodes to infinity (a very large value).

2. Relaxation:
- Repeat the following steps V-1 times (where V is the number of
vertices):
- For each edge in the graph:
- If the distance to the destination node can be reduced by going
through the current edge, update the distance.

3. Negative Cycles:
- After V-1 iterations, perform one more iteration.
- If any distances are reduced, it indicates a negative cycle, and there is
no shortest path solution.

Example:

Consider this graph with nodes A, B, C, and D, and edges with associated
weights:

P --- 3 --- H
| |
2 5
| |
W --- 4 --- E
```

Goal: Find the shortest path from node P to node E.

Steps:

1. Initialization:
- dist[p] = 0
- dist[H] = ∞
- dist[W] = ∞
- dist[E] = ∞

2. Relaxation (Iteration 1):

- dist[H] = min(dist[H], dist[P] + weight(P, H))

4
= min(∞, 0 + 3) = 3
- dist[W] = min(dist[W], dist[P] + weight(p, w))
= min(∞, 0 + 2) = 2
- ... (continue for all edges)

3. Relaxation (Iteration 2, 3, and so on):

- Continue relaxing edges in each iteration. The distances will be
updated as shorter paths are found.

4. Final Distances:
- dist[p] = 0
- dist[H] = 3
- dist[W] = 2
- dist[E] = 6

Shortest Path: The shortest path from P to E is p -> w-> E (with a total
distance of 6).

Key Points:

• Negative Cycles: If a negative cycle exists, the algorithm will continue

to find shorter paths indefinitely, indicating no solution.
• Time Complexity: Bellman-Ford has a time complexity of O(V*E),
making it less efficient than Dijkstra's algorithm for graphs with non-
negative edge weights.

In summary: Bellman-Ford is robust for handling negative edge weights,

making it ideal for scenarios involving costs, debts, or other cases where
edges can have negative values.

4. Write briefly the difference between bell man fored

algorithm and dijkstra algorithm along with example?

Both Bellman-Ford and Dijkstra's algorithms are used to find the shortest
path between nodes in a graph, but they differ in key aspects:

Bellman-Ford Algorithm:

• Handles Negative Edge Weights: It can find the shortest paths even if
there are negative edge weights in the graph. Negative weights can

5
cause issues in other algorithms (like Dijkstra's).
• More Complex: It's more complex and has a higher time complexity
(O(V*E), where V is the number of vertices and E is the number of edges)
than Dijkstra's.
• Iterative Approach: It works by repeatedly relaxing edges, meaning it
iteratively tries to find shorter paths until no further improvement is
possible.
• Example: Imagine a network with roads where some roads have tolls
(negative weights). Bellman-Ford can find the shortest path (cheapest
route) even with tolls involved.

Dijkstra's Algorithm:

• Only Non-Negative Edge Weights: It's only suitable for graphs with
non-negative edge weights.
• Simpler and Faster: It's generally simpler and faster than Bellman-Ford
(O(E + V * log(V)) using a priority queue).
• Greedy Approach: It takes a greedy approach, always selecting the
closest node to the starting point.
• Example: Imagine a road network with positive distances between
cities. Dijkstra's algorithm efficiently finds the shortest route between
two cities.

Summary:

• Choose Bellman-Ford: When you need to handle negative edge

weights or if the graph might contain cycles.
• Choose Dijkstra's: When you have non-negative edge weights and are
looking for the most efficient algorithm.

6
Example:

Graph:

```
A --- 3 --- B
| |
2 5
| |
C --- 4 --- D
```

Bellman-Ford: Can find the shortest path from A to D, even if the edge
between C and D has a negative weight (-1).

Dijkstra's: Would find the shortest path from A to D correctly if all edge
weights are positive. It wouldn't work correctly if the edge between C
and D has a negative weight.

5. Brief explain the difference between wildcard masks and

subnet masks, along with examples?
Subnet Mask
A subnet mask is like a map that tells your computer how to distinguish between different
networks and individual devices within those networks. It's a crucial part of IP addressing
and helps your computer understand where to send data.

• Purpose: A subnet mask divides an IP address into two parts: the network portion and the
host portion. It defines which bits represent the network and which bits represent the host.
• Format: A subnet mask is a 32-bit binary number, usually expressed in dotted decimal
notation (e.g., 255.255.255.0).
• Example:
* IP Address: 192.168.1.10
* Subnet Mask: 255.255.255.0 (/24)
* Network Portion: 192.168.1.0
* Host Portion: 0.0.0.10

Wildcard Mask
A wildcard mask is like a filter that helps you select a range of IP addresses for specific
network management tasks. It complements the subnet mask by working in reverse.
• Purpose: A wildcard mask is used to identify a range of IP addresses for filtering or access

7
control. It complements the subnet mask by inverting the bits.
• Format: A wildcard mask is a 32-bit binary number, also expressed in dotted decimal
notation.
• Derivation: To get the wildcard mask, you "invert" the bits of the subnet mask.
• Example:
* Subnet Mask: 255.255.255.0 (/24)
* Wildcard Mask: 0.0.0.255 (inverted bits)
* This wildcard mask matches all IP addresses within the 192.168.1.0 network.

Key Differences:

• Purpose: Subnet masks define network boundaries. Wildcard masks specify ranges of
addresses for filtering or access control.
• Function: Subnet masks are used for network addressing. Wildcard masks are used for
access control, firewall rules, and other network management tasks.
• Derivation: Subnet masks are assigned directly. Wildcard masks are derived from the
subnet mask.

Example Scenario:

Imagine you want to allow access to a web server with the IP address 192.168.1.100 for
users on a specific subnet (192.168.1.0/24).

• Subnet Mask: You would use the subnet mask 255.255.255.0 to define the subnet.
• Wildcard Mask: You would use the wildcard mask 0.0.0.255 to allow access from any
device on the 192.168.1.0 network. This wildcard mask would match any IP address with the
same network portion as 192.168.1.100.

In summary: Subnet masks and wildcard masks are important tools for network
management. While subnet masks define network boundaries, wildcard masks allow you to
specify ranges of addresses for filtering or access control.

6. Explain Briefly about VLSM with example?

VLSM (Variable Length Subnet Masking) is a flexible way of dividing a network into subnets
of different sizes. Imagine you have a large office with different departments, each with a
varying number of computers. VLSM allows you to allocate exactly the right amount of IP
addresses to each department, saving you addresses and making your network more
efficient.

Traditional Subnetting vs. VLSM

• Traditional Subnetting: Uses the same subnet mask for every subnet within a network,
making it less flexible.

8
• VLSM: Allows you to use different subnet masks for different subnets within a network,
letting you customize the size of each subnet.

Example:

Imagine a company with these departments:

• Sales: Needs 10-20 computers

• Engineering: Needs 50-100 computers
• Marketing: Needs 3-5 computers

Without VLSM:

You might have to create subnets big enough to accommodate the largest department,
wasting addresses.

With VLSM:
You can use different subnet masks:
• Sales: /27 subnet mask (30 usable addresses)
• Engineering: /24 subnet mask (254 usable addresses)
• Marketing: /30 subnet mask (2 usable addresses)

This way, you're allocating the perfect number of addresses for each department.

Benefits of VLSM:
• Address Conservation: You use fewer IP addresses overall.
• Flexibility: Create subnets that perfectly match your needs.
• Improved Security: Isolate network segments for better control.

In short, VLSM lets you tailor your network to your specific requirements, making it
efficient, secure, and easy to manage.

9
 References
 Cormen, Thomas H., et al. Introduction to Algorithms. 3rd ed., MIT Press, 2009.
 Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2009). Introduction to algorithms (3rd ed.).
MIT Press.
 Smith, J. (2020). *Networking Essentials: Wildcard and Subnet Masks Explained*. TechPress.
 Author(s). (Year). Title of the chapter. In *Title of the book* (pp. pages). Publisher.

10