Analysis and Design of an Agent Searching Algorithm for e-Marketplaces

  • Authors:
  • Chi Sing Leung;John Pui-Fai Sum;Hong Shen;Jie Wu;G. Young

  • Affiliations:
  • Department of Electronic Engineering, City University of Hong Kong, Tat Chee Avenue, Kowloon, Hong Kong;Department of Computing, Hong Kong Polytechnic University, Hung Hom, KLN, Hong Kong;Graduate School of Information Science, Japan Advanced Institute of Science and Technology, Tatsunokuchi, Ishikawa, Japan;Department of Computer Science and Engineering, Florida Atlantic University, 777 W. Glades Rd., Boca Raton, FL 33431-6498, USA;Department of Computer Science, CAL POLY, USA

  • Venue:
  • Cluster Computing
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, agent techniques in electronic marketplaces (e-marketplaces) bring B-to-B trading into a new era. However, not much analysis on the behavior of agents has been reported. In this paper, based on the ant algorithm in network routing, we introduce a jumping (searching) model for agents in an e-marketplace network. However, we should be aware that if there are too many agents in the e-marketplace network, they will use up all communication bandwidth and computing resource. It is inevitable to investigate the behavior of agents, such as agent population. Based on the existing results in the ant algorithm in network routing, we present the behavior of agents in an e-marketplace network. Hence, we can control the agent population by setting the appropriate agent generation rate.