Which of the following statements are true about network layer routing? (Select all that apply.) The distance vector algorithm can suffer from count-to-infinity problem when the cost of one of the...

2 DO NOT COPY FROM OTHER WEBSITES

Upvote guarenteed for a correct and detailed answer. Thank you for !!!

Extracted text: Which of the following statements are true about network layer routing? (Select all that apply.) The distance vector algorithm can suffer from count-to-infinity problem when the cost of one of the links goes down. İBGP is used as intra-domain routing protocol. Link-state algorithm is used for intra-domain routing. OSPF computes routes iteratively with each node sending and receiving routes from neighbor nodes only. Ocillations or frequent changes in routes can be prevented by using link costs such that each link's cost is proportional to the congestion on that link. İBGP is used for intra-domain routing. Distance vector algorithm is used for intra-domain routing. Intra-domain routing algorithms are used to compute routes within an autonomous system. İBGP is used to disseminate AS paths to routers within an autonomous system. Inter-domain routing protocols are used to compute routes across multiple autonomous systems. EBGP is used for intra-domain routing for the Internet. RIP is a link-state based intra-domain routing protocol.