Abstract
An active message is a message that can interact with the recipient, as opposed to a 'conventional' message, which only carries data from one place to another. As a result of the response obtained from the recipient, an active message can decide to send copies of itself to other destinations. The coordination of these copies is a problem, especially in large networks, because the copies can be sent to destinations anywhere in a network. In this article we present a model that establishes coordination between the distributed copies of an active message in a dynamic network topology, dynamic in the sense that nodes may go down or new nodes can be added to the network. We elaborate on an earlier version of the model, which was only applicable to networks with a static topology.
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have