0% found this document useful (0 votes)
1 views3 pages

Network Protocols Assignment Answers

The document outlines key concepts in network protocols and security, including the operation of DHCP, TCP three-way handshake, link-state routing, congestion control techniques, Dijkstra's algorithm, ACL guidelines, and the functions of UDP, RIP, and ARP. It details the steps involved in each process and provides insights into their significance in network management. The information is structured as answers to a home assignment for the academic year 2024-25.

Uploaded by

ramanakv719
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
1 views3 pages

Network Protocols Assignment Answers

The document outlines key concepts in network protocols and security, including the operation of DHCP, TCP three-way handshake, link-state routing, congestion control techniques, Dijkstra's algorithm, ACL guidelines, and the functions of UDP, RIP, and ARP. It details the steps involved in each process and provides insights into their significance in network management. The information is structured as answers to a home assignment for the academic year 2024-25.

Uploaded by

ramanakv719
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Home Assignment-III Answers

Subject: 23EC2210R - Network Protocols & Security

Academic Year: 2024-25

1. Operation of DHCP:

DHCP assigns IP addresses dynamically.

Steps:

- DHCPDISCOVER (Client -> Broadcast)

- DHCPOFFER (Server -> Client)

- DHCPREQUEST (Client -> Server)

- DHCPACK (Server -> Client)

Diagram:

Client Server

| -----> DHCPDISCOVER -----> |

| <----- DHCPOFFER <----- |

| -----> DHCPREQUEST -----> |

| <----- DHCPACK <----- |

2. TCP Three-Way Handshake:

Used for connection establishment.

Steps:

- Client sends SYN

- Server replies with SYN-ACK

- Client responds with ACK

Sketch:
Client Server

| --SYN--> |

| <--SYN+ACK-- |

| --ACK--> |

Connection Established

Window Size Justification:

It helps in flow control, allowing each side to manage data volume it can handle.

3. Link-State Routing Algorithm Steps:

1. Each router discovers neighbors and link costs.

2. Build a Link-State Packet (LSP).

3. Flood LSP to all routers.

4. Construct complete topology.

5. Use Dijkstra's algorithm to compute shortest path.

4. Congestion Control Techniques:

- Open-loop: Prevent congestion (e.g., traffic shaping)

- Closed-loop: Detect and react (e.g., backpressure, choking)

Leaky Bucket: Fixed rate output; smooth traffic flow.

Token Bucket: Allows bursts; more flexible.

5. Dijkstra's Algorithm:

You need the actual network diagram to compute this. Please provide the image or describe the

nodes and links.


6. Access Control List (ACL) Guidelines:

- Define security policy first.

- Use specific rules over general ones.

- Order matters: Top rules are evaluated first.

- Regularly update and audit ACLs.

- Apply at appropriate interface (inbound/outbound).

- Use least privilege principle.

7. Function of UDP in Transport Layer:

- Provides connectionless, fast transmission

- No guarantee of delivery or order

- Used in real-time apps (e.g., VoIP, streaming)

8. Function of RIP in Network Layer:

- Uses hop count as metric (max 15)

- Updates every 30 sec

- Based on distance-vector routing

- Simple, best for small networks

9. Function of ARP:

- Resolves IP address to MAC address

- Works within local network

- Sends ARP request -> receives ARP reply

- Stored in ARP cache for reuse

You might also like