Networking Answers Detailed
Networking Answers Detailed
- 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).
3. Select the unvisited node with the smallest distance and update distances to its neighbors.
- Example: In a graph with nodes A, B, C, D, and weights on edges, the algorithm calculates the shortest p
- 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:
- 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).
- Main Services:
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.
- Congestion: When the demand for network resources exceeds capacity, causing delays and packet loss.
- Causes:
1. Insufficient bandwidth.
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.
- UDP:
- Steps:
- Importance: Ensures both client and server are ready for communication, avoids collisions, and synchroni
numbers.
- Multiplexing: Combining multiple data streams and transmitting them over a single medium.
- Examples: Port numbers in TCP/UDP are used for multiplexing and demultiplexing.
- Benefits: Efficient use of resources, supports multiple applications over one connection.
- HTTP Request:
- Methods include GET (retrieve data), POST (submit data), PUT, DELETE, etc.
- HTTP Response:
- Process: