0% found this document useful (0 votes)
15 views4 pages

Networking Answers Detailed

Ppl

Uploaded by

shivuninishnath
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)
15 views4 pages

Networking Answers Detailed

Ppl

Uploaded by

shivuninishnath
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/ 4

1. Explain Dijkstra's algorithm for shortest path routing with an example.

- Dijkstra's algorithm finds the shortest path from a source node to all other nodes in a weighted graph.

- Steps:

1. Initialize distances of all nodes as infinity, except the source node (set to 0).

2. Mark all nodes as unvisited.

3. Select the unvisited node with the smallest distance and update distances to its neighbors.

4. Repeat until all nodes are visited.

- Example: In a graph with nodes A, B, C, D, and weights on edges, the algorithm calculates the shortest p

repeatedly updating the smallest distances.

2. Explain details about flooding and its drawbacks.

- Flooding: A packet is sent to all neighbors except the one it arrived from.

- Advantages: Simple to implement, ensures delivery, useful for discovering unknown routes.

- Drawbacks:

- Redundancy: Same packet transmitted multiple times.

- Resource Wastage: Wastes bandwidth and processing power.

- Congestion: Increases network traffic, leading to bottlenecks.

- Lack of Control: No efficient way to terminate flooding.

3a. Explain the link-state algorithm.

- Definition: Each router maintains information about all links in the network.

- Process:

1. Routers gather link-state information and share it using Link-State Advertisements (LSAs).

2. Each router builds a topology map of the network.

3. Algorithms like Dijkstra's are used to compute shortest paths.

- Advantages: Accurate routing decisions, reduced routing loops.


- Disadvantages: High overhead and computational cost.

3b. What are services provided by the transport layer?

- Main Services:

1. Reliable Data Transfer: Ensures delivery of data without loss or duplication.

2. Segmentation and Reassembly: Breaks data into smaller packets and reassembles them at the destina

3. Flow Control: Manages data flow to prevent sender from overwhelming the receiver.

4. Error Detection and Correction: Detects and corrects errors during transmission.

5. Multiplexing: Supports multiple connections over a single link.

3c. What is congestion? Mention its causes.

- Congestion: When the demand for network resources exceeds capacity, causing delays and packet loss.

- Causes:

1. Insufficient bandwidth.

2. High traffic load.

3. Poorly managed queues at routers.

4. Excessive retransmissions due to packet loss.

4. What are transport layer protocols? Compare and contrast TCP & UDP.

- Transport Layer Protocols: TCP (Transmission Control Protocol) and UDP (User Datagram Protocol).

- TCP:

- Connection-oriented.

- Reliable, ensures data order and integrity.

- Used in applications like HTTP, FTP, and email.

- UDP:

- Connectionless, faster but unreliable.

- Suitable for real-time applications like video streaming and gaming.


- Comparison:

- Reliability: TCP is reliable, UDP is not.

- Speed: UDP is faster.

- Overhead: TCP has higher overhead due to acknowledgments and retransmissions.

5. Explain 3-way handshake protocol to establish the transport-level connection.

- Steps:

1. SYN: Client sends synchronization request.

2. SYN-ACK: Server acknowledges and sends a synchronization request.

3. ACK: Client acknowledges, establishing the connection.

- Importance: Ensures both client and server are ready for communication, avoids collisions, and synchroni

numbers.

6a. Write a note on multiplexing and demultiplexing.

- Multiplexing: Combining multiple data streams and transmitting them over a single medium.

- Demultiplexing: Extracting individual streams from the combined data.

- Examples: Port numbers in TCP/UDP are used for multiplexing and demultiplexing.

- Benefits: Efficient use of resources, supports multiple applications over one connection.

6b. HTTP request and response.

- HTTP Request:

- Sent by a client (browser) to a server.

- Methods include GET (retrieve data), POST (submit data), PUT, DELETE, etc.

- Contains headers, method, and URL.

- HTTP Response:

- Sent by the server to the client.

- Includes status codes (e.g., 200 OK, 404 Not Found).


- Contains response body (HTML, JSON).

6c. DNS (Domain Name System).

- Function: Maps human-readable domain names (e.g., www.google.com) to IP addresses.

- Process:

1. Client sends a query to a DNS server.

2. Server resolves the domain name to an IP address.

- Benefits: Simplifies navigation, supports scalability.

You might also like