Answer Posted / ba

Distance vector protocol uses the bellman-fort algorithm.
it has 6 steps

1.increments the materic of the incoming route in the
advertisement.(counts the hops values)
2.Compare the n/w address in routing updaate from the
neighbor to wt the router has in the routing table.
3.if the neighbor information is better. it places the new
update in routing table, and delete the old entry.
4.if neighbor's information is worse, it ignors that.
5.if the neighbor update same as in routing table it resets
the timer for entry in the routing table.
6. if the neighbor's information is different path to same
destination, it stores the route in the routing table.

in the distance RIP doesnt support the un-equal paths.

Explain the major disadvantage of a star topology?

921

---

What is the last major networking problem you troubleshot and solved on your own in the last year?

1954

---

Which application protocol can not be blocked by the Switch?

2970

---

What are the fields of VLAN tag?

1929

---

How do you manage multiple concurrent high level projects?

2436

---

Tell me what can be done to fix signal attenuation problems?

979

---

What is 10base-t?

1157

---

Describe point to point link?

1005

---

Is there any website? Which can theft or watch any system or computer hardware drives(memory)while they are accessing Internet.If it is avilable what is it? Please answer me.Advance thanks

1917

---

please forward Apache server and tomcat server questions and answers

2857

---

Define network topology?

1095

---

Define data encapsulation?

1161

---

senario: There are two switches connected via trunk port.One end station is connected to each switch via access port. All the ports are in same VLAN.All the ports have same speed 1Gbps.Start sending 1Gbps traffic from one end station to other. Determine percentage of traffic received by destination end station.

2512

---

Define peer to peer?

1208

---

when affected the system from virus , which paths will be it stored in system ?

1895

---