Computational Markets to Regulate Mobile-Agent Systems

  • Jonathan Bredin
  • David Kotz
  • Daniela Rus
  • Rajiv T. Maheswaran
  • Cagri Imer
  • Tamer Basar
Article

Abstract

Mobile-agent systems allow applications to distribute their resource consumption across the network. By prioritizing applications and publishing the cost of actions, it is possible for applications to achieve faster performance than in an environment where resources are evenly shared. We enforce the costs of actions through markets, where user applications bid for computation from host machines.

We represent applications as collections of mobile agents and introduce a distributed mechanism for allocating general computational priority to mobile agents. We derive a bidding strategy for an agent that plans expenditures given a budget, and a series of tasks to complete. We also show that a unique Nash equilibrium exists between the agents under our allocation policy. We present simulation results to show that the use of our resource-allocation mechanism and expenditure-planning algorithm results in shorter mean job completion times compared to traditional mobile-agent resource allocation. We also observe that our resource-allocation policy adapts favorably to allocate overloaded resources to higher priority agents, and that agents are able to effectively plan expenditures, even when faced with network delay and job-size estimation error.

mobile agents market-based control resource allocation 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    T. Başar and G. J. Olsder, Dynamic Noncooperative Game Theory. SIAM, Classics in Applied Mathematics, 1999.Google Scholar
  2. 2.
    M. Baldi, G. P. Picco, and F. Risso, “Designing a Videoconference System for Active Networks, ” in Proceedingsof the Second International Workshop, Mobile Agents'98, Stuttgart: Germany, pp. 273–284, 1998.Google Scholar
  3. 3.
    A. Bieszczad, B. Pagurek, and T. White, “Mobile Agents for Network Management, ” IEEE CommunicationsSurveys, vol. 1, pp. 2–9, 1998.Google Scholar
  4. 4.
    C. Boutilier, M. Goldszmidt, and B. Sabata, “Sequential Auctions for the Allocation of Resources withComplementarities, ” in Proceedingsof the International Joint Conference on Artificial Intelligence, Stockholm: Sweden, pp. 527–523, 1999.Google Scholar
  5. 5.
    J. Bredin, D. Kotz, and D. Rus, “Utility Driven Mobile-Agent Scheduling, ” Technical Report PCSTR98–331, DartmouthCollege, 1998.Google Scholar
  6. 6.
    K. Calvert and E. Zegura, “GT-ITM: Georgia Tech Internetwork Topology Models, ” http://www.cc.gatech.edu/fac/Ellen.Zegura/gt-itm/gt-itm.tar.gz, 1996.Google Scholar
  7. 7.
    A. Chavez, A. Moukas, and P. Maes, “Challenger: A Multiagent System for Distributed Resource Allocation, ” in Proceedings of the First International Conference on Autonomous Agents, ACM Press: Marina Del Ray, CA, pp. 323–331, 1997.Google Scholar
  8. 8.
    J. Q. Cheng and M. P. Wellman, “The WALRAS Algorithm: A Convergent Distributed Implementation of General Equilibrium Outcomes, ” Journal of Computational Economics, vol. 12, pp. 1–23, 1998.Google Scholar
  9. 9.
    S. H. Clearwater (ed.), Market-Based Control, Singapore: World Scientific, 1996.Google Scholar
  10. 10.
    S. H. Clearwater, R. Costanza, M. Dixon, and B. Schroeder, “Saving Energy Using Market-Based Control, ” in Clearwater, 1996, pp. 253–273, 1996.Google Scholar
  11. 11.
    R. Gagliano, M. Fraser, and M. Shaefer, “Auction Allocation of Computer Resources, ” Communications of the ACM, vol. 38, no.6, pp. 88–102, 1995.Google Scholar
  12. 12.
    S. Glassman, M. Manasse, M. Abadi, P. Gauthier, and P. Sobalvarro, “The Millicent Protocol for Inexpensive Electronic Commerce, ” World Wide Web Journal, pp. 603–618, 1995.Google Scholar
  13. 13.
    J. Hu and M. P. Wellman, “Online Learning about Other Agents in a Dynamic Multiagent System, ” in Proceedingsof the Second International Conference on AutonomousAgents, Minneapolis, MN, pp. 239–246, 1998.Google Scholar
  14. 14.
    D. Johansen, “Mobile Agent Applicability, ” in Proceedingsof the Second International Workshop, Mobile Agents'98, Stuttgart: Germany, pp. 80–98, 1998.Google Scholar
  15. 15.
    D. Kotz and R. S. Gray, “Mobile Agents and the Future of the Internet, ” ACM Operating Systems Review, vol. 33, no.3, pp. 7–13, 1999.Google Scholar
  16. 16.
    J. Kurose and R. Simha, “A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems, ” IEEE Transactions on Computers, vol. 38, no.5, pp. 705–717, 1989.Google Scholar
  17. 17.
    C. Langton, R. Burkhart, M. Daniels, and A. Lancaster, “The Swarm Simulation System, ” http://www.santafe.edu/projects/swarm, 1999.Google Scholar
  18. 18.
    R. T. Maheswaran, çagri Imer, and T. Başar, “Agent Mobility Under Price Incentives, ” in Proceedings of 38th IEEE Conference on Decision and Control, Phoenix, AZ, pp. 4020–4025, 1999.Google Scholar
  19. 19.
    A. Mohindra, A. Purakayastha, and P. Thati, “Exploiting Non-Determinism for Reliability of Mobile Agent Systems, ” in Proceedingsof the International Conference on Dependable Systemsand Networks, New York, NY, pp. 144–156, 2000.Google Scholar
  20. 20.
    T. Muldner, “Mobile Computing at Acadia University, ” Dartmouth College Computer Science Colloquium Slides at http://evilqueen.acadiau.ca/presentations/mobileagents.ppt., 1998.Google Scholar
  21. 21.
    Object Management Group, “Mobile Agent System Interoperability Facility, ” ftp://ftp.omg.org/-pub/docs/orbos/98–3–9.pdf., 1998.Google Scholar
  22. 22.
    T. Poutanene, H. Hinton, and M. Stumm, “NetCents: A Lightweight Protocol for Secure Micropayments, ” in USENIX Workshop on Electronic Commerce, USENIX Association, pp. 25–36, 1998.Google Scholar
  23. 23.
    O. Regev and N. Nisan, “The POPCORN Market·An Online Market for Computational Resources, ” in Proceedingsof the First International Conference on Information and Computation Economies, ACM Press: Charleston, SC, pp. 148–157, 1998.Google Scholar
  24. 24.
    O. Shehory, K. Sycara, P. Chalasani, and S. Jha, “Agent Cloning: An Approach to Agent Mobility and Resource Allocation, ” IEEE Communications, vol. 36, no.7, pp. 58–67, 1998.Google Scholar
  25. 25.
    I. E. Sutherland, “A Futures Market in Computer Time, ” Communicationsof the ACM, vol. 11, no.6, pp. 449–451, 1968.Google Scholar
  26. 26.
    C. F. Tschudin, “Open Resource Allocation for Mobile Code, ” in Proceedings of The First Workshop on Mobile Agents, Berlin, pp. 186–197, 1997.Google Scholar
  27. 27.
    C. A. Waldspurger, T. Hogg, B. A. Huberman, J. O. Kephart, and W. S. Stornetta, “Spawn: A Distributed Computational Economy, ” IEEE Transactions on Software Engineering, vol. 18, no.2, pp. 103–117, 1992.Google Scholar
  28. 28.
    J. E. White, “Telescript Technology: Mobile Agents, ” General Magic White Paper, 1996.Google Scholar

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Jonathan Bredin
    • 1
  • David Kotz
    • 1
  • Daniela Rus
    • 1
  • Rajiv T. Maheswaran
    • 2
  • Cagri Imer
    • 2
  • Tamer Basar
    • 2
  1. 1.Department of Computer ScienceDartmouth CollegeHanover
  2. 2.Coordinated Science LaboratoryUniversity of IllinoisUrbana

Personalised recommendations