Answer Posted / dev kumar

Distance vector-based routing algorithms (also known as
Bellman-Ford algorithms) pass periodic copies of a routing
table from router to router.
When the topology in a distance vector protocol
internetwork changes, routing table updates must occur. As
with the network discovery process, topology change updates
proceed step-by-step from router to router.
When maintaining the routing information, inconsistencies
can occur if the internetwork’s slow convergence on a new
configuration causes incorrect routing entries.

please forward Apache server and tomcat server questions and answers

2852

---

What are the different states of STP?

2187

---

What is nat?

1061

---

Have you worked in an assignment based environment, e.g. work request or trouble ticket system, and if so, describe that environment?

2762

---

What can be considered as good passwords?

986

---

What characterizes a professional network administrator?

953

---

Explain client/server?

1154

---

Define ipconfig?

1166

---

Is it possible to connect two computers for file sharing without using a hub or router?

1071

---

List the functions of a network administrator?

1034

---

Define multicast routing?

1139

---

Describe vpn?

1085

---

how to set tunneling in putty when any portno blocked from firewall to use resources with that portno like ssh 22

2459

---

Do you know about the job of the network layer under the osi reference model?

998

---

how to add additional instances sar r3, what are the steps to take server is down.

1995

---