DRT(Data flow Routing Table) for Efficient Routing of Mobile Code
A mobile agent carries instructions and performs computation at databases. This paper proposes the use of a DRT along with the route generated by the agent scheduler so that an agent can decide what it sould do when it encounters an inaccessible database. The DRT is generated using the data flow graph of the instructions carried by the agent. We present an algorithm that uses the DRT to generate a robust schedule for the mobile agent in the event of dtabase node failure. This makes it possible for the mobile agent to retrieve partial results even when some dtabase notes are inaccessible.