All Courses
Explore Courses UPSC Exam UPSC Test Series Free Notes EduRev Infinity Get the App Login Join for Free
Sign in Open App
Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Questions  >  Consider network with three routers P, Q, and... Start Learning for Free
SaveJoin the Discussion on the App
Consider network with three routers P, Q, and R. All links have cost of unit, the routers exchange distance vector routing information & converge on routing tables. After some time link Q-R fails, assume P & Q send out routing update at random time, each at same average rate. The probability of routing loop form (Rounded off to one decimal place) between P & Q leading to count to infinity problem is_____.
    Correct answer is '0.5'. Can you explain this answer?
    FREE This question is part of
    Download PDF Attempt Test
    		Download PDF Attempt this Test
    Most Upvoted Answer
    Consider network with three routers P, Q, and R. All links have cost o...

    The link between the Q - R is broken, so the probability after the convergence depends on the sharing of information between nodes P and Q, if the node Q share the information first then there will be no looping, if node P shares the information then there will be chance of looping so the probability will be 0.5 
    So, P = 1/2 = 0.5
    < Previous Question Next Question >
    Explore Courses for Computer Science Engineering (CSE) exam

    Similar Computer Science Engineering (CSE) Doubts

    Consider a network with five nodes, N1 to N5, as shown belowThe net work uses a Distance Vector Routing protocol. Once the routes have stabilized, the distance vectors at different nodes are as followingEach distance vector is the distance of the best known path at that instance to nodes, N1 to N5, where the distance to itself is 0. Also, all links are symmetric and the cost is identical in both directions. In each round, all nodes exchange their distance vectors with their respective neighbors. Then all nodes update their distance vectors. In between two rounds, any change in cost of a link will cause the two incident nodes to change only that entry in their distance vectorsQ.After the update in the previous question, the link N1-N2 goes down. N2 will reflect this change immediately in its distance vector as cost, . After the NEXT ROUND of update, what will be the cost to N1 in the distance vector of N3?

    Consider a network with five nodes, N1 to N5, as shown belowThe net work uses a Distance Vector Routing protocol. Once the routes have stabilized, the distance vectors at different nodes are as followingEach distance vector is the distance of the best known path at that instance to nodes, N1 to N5, where the distance to itself is 0. Also, all links are symmetric and the cost is identical in both directions. In each round, all nodes exchange their distance vectors with their respective neighbors. Then all nodes update their distance vectors. In between two rounds, any change in cost of a link will cause the two incident nodes to change only that entry in their distance vectorsQ.The cost of link N2-N3 reduces to 2 in (both directions). After the next round of updates, what will be the new distance vector at node, N3?

    Top Courses for Computer Science Engineering (CSE)View all

    Top Courses for Computer Science Engineering (CSE)

    Consider network with three routers P, Q, and R. All links have cost of unit, the routers exchange distance vector routing information & converge on routing tables. After some time link Q-R fails, assume P & Q send out routing update at random time, each at same average rate. The probability of routing loop form (Rounded off to one decimal place) between P & Q leading to count to infinity problem is_____.Correct answer is '0.5'. Can you explain this answer?
    Question Description
    Consider network with three routers P, Q, and R. All links have cost of unit, the routers exchange distance vector routing information & converge on routing tables. After some time link Q-R fails, assume P & Q send out routing update at random time, each at same average rate. The probability of routing loop form (Rounded off to one decimal place) between P & Q leading to count to infinity problem is_____.Correct answer is '0.5'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about Consider network with three routers P, Q, and R. All links have cost of unit, the routers exchange distance vector routing information & converge on routing tables. After some time link Q-R fails, assume P & Q send out routing update at random time, each at same average rate. The probability of routing loop form (Rounded off to one decimal place) between P & Q leading to count to infinity problem is_____.Correct answer is '0.5'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for Consider network with three routers P, Q, and R. All links have cost of unit, the routers exchange distance vector routing information & converge on routing tables. After some time link Q-R fails, assume P & Q send out routing update at random time, each at same average rate. The probability of routing loop form (Rounded off to one decimal place) between P & Q leading to count to infinity problem is_____.Correct answer is '0.5'. Can you explain this answer?.
    Solutions for Consider network with three routers P, Q, and R. All links have cost of unit, the routers exchange distance vector routing information & converge on routing tables. After some time link Q-R fails, assume P & Q send out routing update at random time, each at same average rate. The probability of routing loop form (Rounded off to one decimal place) between P & Q leading to count to infinity problem is_____.Correct answer is '0.5'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE). Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
    Here you can find the meaning of Consider network with three routers P, Q, and R. All links have cost of unit, the routers exchange distance vector routing information & converge on routing tables. After some time link Q-R fails, assume P & Q send out routing update at random time, each at same average rate. The probability of routing loop form (Rounded off to one decimal place) between P & Q leading to count to infinity problem is_____.Correct answer is '0.5'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of Consider network with three routers P, Q, and R. All links have cost of unit, the routers exchange distance vector routing information & converge on routing tables. After some time link Q-R fails, assume P & Q send out routing update at random time, each at same average rate. The probability of routing loop form (Rounded off to one decimal place) between P & Q leading to count to infinity problem is_____.Correct answer is '0.5'. Can you explain this answer?, a detailed solution for Consider network with three routers P, Q, and R. All links have cost of unit, the routers exchange distance vector routing information & converge on routing tables. After some time link Q-R fails, assume P & Q send out routing update at random time, each at same average rate. The probability of routing loop form (Rounded off to one decimal place) between P & Q leading to count to infinity problem is_____.Correct answer is '0.5'. Can you explain this answer? has been provided alongside types of Consider network with three routers P, Q, and R. All links have cost of unit, the routers exchange distance vector routing information & converge on routing tables. After some time link Q-R fails, assume P & Q send out routing update at random time, each at same average rate. The probability of routing loop form (Rounded off to one decimal place) between P & Q leading to count to infinity problem is_____.Correct answer is '0.5'. Can you explain this answer? theory, EduRev gives you an ample number of questions to practice Consider network with three routers P, Q, and R. All links have cost of unit, the routers exchange distance vector routing information & converge on routing tables. After some time link Q-R fails, assume P & Q send out routing update at random time, each at same average rate. The probability of routing loop form (Rounded off to one decimal place) between P & Q leading to count to infinity problem is_____.Correct answer is '0.5'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
    Explore Courses for Computer Science Engineering (CSE) exam

    Top Courses for Computer Science Engineering (CSE)

    Explore Courses

    Suggested Free Tests

    Signup for Free!
    Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
    10M+ students study on EduRev
    Get App
    © EduRev
    Education Revolution
    Signup to see your scores go up within 7 days!
    Access 1000+ FREE Docs, Videos and Tests
    Takes less than 10 seconds to signup