Purchase Solution

Point to point links AND reverse path flooding

Not what you're looking for?

Ask Custom Question

Assume we have a network of nodes connected via point to point links, and a source S sends a message that will be broadcast to all nodes using Reverse-Path-Flooding. Assume that routers do not keep track of broadcast messages they have seen earlier.

Assume also that routing tables change frequently, however, when a node changes its next-hop neighbor towards S, it is always ensured that the spanning tree used in RPF is loop-free (i.e. all nodes remain connected to the tree and there are no loops, the integrity of the tree is preserved)

Show that even with the above restrictions, it is possible that a message traverses the network and never stops (well, it will stop when its time-to-live expires, but assume messages don't have a time-to-live limit)

Purchase this Solution
Solution Summary

Point to point links AND reverse path flooding are shown.

Solution Preview

Please see the attached files.

When a router receives a multicast packet with a given source address, it will broadcast the packet to all of its port except on the link on which the packet originally arrived, only if the packet arrived on its own link which is the at the shortest path back to the source; otherwise it simply discards the packet without forwarding it. Because the router knows that either it has already received the packet or will be receiving a copy of the packet from the sender on one of its shortest links back to the sender.

Since the network is using spanning tree protocol so that there are no loops then also it is possible that the message ...

Purchase this Solution
Free BrainMass Quizzes
Basic Computer Terms

We use many basic terms like bit, pixel in our usual conversations about computers. Are we aware of what these mean? This little quiz is an attempt towards discovering that.

Basic Networking Questions

This quiz consists of some basic networking questions.

C++ Operators

This quiz tests a student's knowledge about C++ operators.

Inserting and deleting in a linked list

This quiz tests your understanding of how to insert and delete elements in a linked list. Understanding of the use of linked lists, and the related performance aspects, is an important fundamental skill of computer science data structures.

Java loops

This quiz checks your knowledge of for and while loops in Java. For and while loops are essential building blocks for all Java programs. Having a solid understanding of these constructs is critical for success in programming Java.

View More Free Quizzes
Related BrainMass Solutions

  • displacement as a function of time.

    Instantaneously, the crew and ship find themselves flying towards the point at which they detected this disturbance but from the opposite direction. Once again Captain Picard orders Data to reverse course and explain what has happened.

  • Precedence set by Regents of the University of California v. Bakke in Reverse Discrimination

    The media dubbed the issue "reverse discrimination", and the euphemism endures to this day in reference to aspects of affirmative action.

  • Colligative properties of solutions

    Reverse osmosis is related to colligative properties of solution since in order to carry it out, the amount of pressure to be applied should be greater than the osmotic pressure of the solution.

  • Permeability

    In the reverse process, the path followed is STUP. The B-H curve OPQRSTUP is known as the four quadrant B-H curve or the hysteresis curve. To determine the value of permeability from the B-H curve, we have to find the ratio B/H.

  • property rights and resource allocation

    Total revenue at this point would be $180 - $140 = $40. If it purchased the spark protector, it could increase its trips to three per day again to obtain MR greater than MC. Its cost at that point would be $220 and its revenue would be $240.

  • Business Management - Reverse Logistics

    Reverse logistics refers to product or service after the point of sale. Reverse logistics is the process of planning, implementing, and controlling the flow from the point of consumption to the point of origin for the purpose of recapturing value.

  • Minimization, maximization (Calculus)

    Describe and find the length of the shortest possible path the ant could take to get from point A to point G. 2. Describe and find the length of the longest path the ant could take to get from A to G. 3.

  • What does interference really mean? Path length difference.

    Path length difference. At a particular point on a screen illuminated by two slits, the path length from that point to the bottom slit is greater than to the top slit.

  • Motiron in two dimension: Motion on a verticle Circle.

    Here just after the string becomes slack the ball moves tangential to the circular path makes an angle with the horizontal and hence it will further rise to a height h1 = v12sin2 /2g = (Lg/3)(1- 4/9)/2g = 5L/54 and the maximum height from the center

View More Related Solutions