Study on a Dynamic Resource Allocation for a Communication Network Based on a Market-based Model

Conference paper


This paper describes a market-based model for network resource allocation combining forward market with agent-based approach. In our model, market participants observe only market prices, decide to buy or sell their network resources, and order their requests consisting of limit price and volume. The proposed model has two key properties, ‘forward’ market and call market of double auction type called ‘Itayose’ method. Time to certain future is divided into many time-slots, and markets for the future bandwidth use are opened in all the time-slots. Thus the agents can try to maximize their utilities over time. Itayose is an auction mechanism under which bids and offers are matched at a single price according to the principle of price priority, and the amount of transaction and contracted price are determined at the intersection of the demand curve and the supply curve. Compared to the Walrasian type auction which market-based models commonly use, agents have to decide both order prices and quantities. Hence the market can gather richer information from the agents. It is expected to be more advantageous in fast resource allocation. Further, we also discuss optimization technique for agents and simulation results which demonstrate the function of the proposed model.

Key words

market-based model multi-agent system network resource allocation forward market 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Clearwater, S. H. (Ed.) (1996) Market-Based Control: A Paradigm for Distributed Resource Allocation, World Scientific Google Scholar
  2. Ferguson, D. F., Yemini, Y. and Nikolaou, C. (1988) Microeconomic Algorithms for Load Balancing in Distributed Computer Systems, Proceedings of 8th International Conference on Distributed Computing Systems, pp. 491–499Google Scholar
  3. Parunak, H. V. D., Ward, A. C. and Sauter, J. A.: The MarCon Algorithm (1999) A Systematic Market Approach to Distributed Constraint Problems, Artificial Intelligence for Engineering Design, Analysis and Manufacturing, Vol. 13, pp. 217–234CrossRefGoogle Scholar
  4. Chavez, A., Moukas, A. and Maes, P (1997) Challenger: A Multi-agent System for Distributed Resource Allocation, Proceedings of the First International Conference on Autonomous Agents, pp. 323–331Google Scholar
  5. Kurose, J. F. and Simha, R. (1989) A Microeconomic Approach to Optimal Resource Allocation in Distributed Computer Systems, IEEE Transactions on Computers, No. 38, Vol. 5, pp. 705–717CrossRefGoogle Scholar
  6. Wellman, M. P. (1993) A Market-Oriented Programming Environment and Its Application to Distributed Multicommodity Flow Problems, Journal of Artificial Intelligence Research, Vol. 1, pp. 1–22zbMATHGoogle Scholar
  7. Mas-Crell, A., Whinstone, M. D. and Green, J. R. (1991) Microeconomic Theory, Oxford University PressGoogle Scholar
  8. Yamaki, H., Wellman, M. P. and Ishida, T. (1996) A market-based approach to allocating QoS for multimedia applications, Proceedings of the Second International Conference on Multi-Agent Systems ICMAS′96, pp. 385–392Google Scholar
  9. Fulp, E. W. and Reeves, D. S. (2000) QoS Rewards and Risks: A Multi-market Approach to Resource Allocation, NETWORKING 2000 (G. Pujolle et al.(Eds.)), LNCS 1815, Springer-Verlag, pp.945–956Google Scholar

Copyright information

© Springer Japan 2003

Authors and Affiliations

  1. 1.Tokyo Institute of TechnologyMidori, YokohamaJapan
  2. 2.National Institution for Academic DegreesBunkyo, TokyoJapan

Personalised recommendations