Agent-based Multicast Routing

        Agent systems are elegant, but it is difficult to find application of practical importance that gain from being implemented with agent technology as opposed to conventional means: the prevailing opinion is that agents are a solution in search of a problem. In this short paper we state our definition of agents, briefly describe the Aglet agent system, and give details of an application that we believe is of practical importance and is more easily implemented with agent technology than other techniques: we introduce an agent that roams a network of arbitrary topology and configures a multicast network equivalent to the minimum spanning tree between the sender and the receivers

By: S.G. Hild and J.H. Bischof

Published in: RZ2975 in 1998

LIMITED DISTRIBUTION NOTICE:

This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.

rz2975.ps.Z

Questions about this service can be mailed to reports@us.ibm.com .