An Efficient Agent Control Method for Time-constrained Applications with Heterogeneous Work Demand

Mobile agent is an efficient technology that makes it much easier to handle large scale and complex network systems. Especially in information retrieval, agents can search effectively with the ability of migrating autonomously through the networks. To find better results for such applications, it is important for agents to complete their tasks on as many nodes as possible by their deadlines. However, most existing agent systems using processor sharing as scheduling disciplines do not take such time constraints into account. Therefore, agents are likely to miss their deadlines on many nodes. In this paper, we propose an efficient and robust control method of agents with heterogeneous work demand under time constraint. When there are multiple agents running on a node, the mutual influence among them may cause to make the time for each agent to complete its task longer. When each agent has different work demand, the mutual influence among them is also different. The proposed method takes such different mutual influences into account to calculate the estimated value of the number of agents that can complete their tasks before their deadlines, and uses this value to control the dispatching and execution of agents. By using simulation experiments, we have proved that the proposed method can keep the fairness among all the agents and improve the number of nodes where agents can complete their tasks within their deadlines.

[1]  Tom Holvoet,et al.  Intelligent Buildings: A Multi-Agent System Approach , 2003 .

[2]  Jimmy J. Lin,et al.  Quantitative evaluation of passage retrieval algorithms for question answering , 2003, SIGIR.

[3]  Hideo Miyahara,et al.  A load balancing algorithm on multiprocessor time-sharing systems , 1990, Systems and Computers in Japan.

[4]  Nicu Sebe,et al.  Content-based multimedia information retrieval: State of the art and challenges , 2006, TOMCCAP.

[5]  Hideki Tode,et al.  An efficient agent control method for time constraint applications , 2005, The 2005 Symposium on Applications and the Internet.

[6]  Vijay Sivaraman,et al.  Achieving high utilization in guaranteed services networks using early-deadline-first scheduling , 1998, 1998 Sixth International Workshop on Quality of Service (IWQoS'98) (Cat. No.98EX136).

[7]  George Cybenko,et al.  Mobile agents in distributed information retrieval , 1999 .

[8]  Santanu Chaudhury,et al.  Distributed and reactive query planning in R-MAGIC: an agent-based multimedia retrieval system , 2004, IEEE Transactions on Knowledge and Data Engineering.

[9]  Ichiro Satoh.  An Architecture for Next Generation Mobile Agent Infrastructure , 2000 .

[10]  Ahmed Karmouch,et al.  Mobile software agents: an overview , 1998, IEEE Commun. Mag..

[11]  Lei Li,et al.  Accurate long-tailed network traffic approximation and its queueing analysis by hyper-Erlang distributions , 2005, The IEEE Conference on Local Computer Networks 30th Anniversary (LCN'05)l.

[12]  Agostino Poggi,et al.  Extending JADE for agent grid applications , 2004, 13th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises.

[13]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[14]  Ichiro Satoh.  MobileSpaces: a framework for building adaptive distributed applications using a hierarchical mobile agent system , 2000, Proceedings 20th IEEE International Conference on Distributed Computing Systems.

[15]  BERNARD M. WAXMAN,et al.  Routing of multipoint connections , 1988, IEEE J. Sel. Areas Commun..

[16]  Alistair Moffat,et al.  Simplified similarity scoring using term ranks , 2005, SIGIR '05.

[17]  Samuel Pierre,et al.  Mobile agents and their use for information retrieval: a brief overview and an elaborate case study , 2002, IEEE Netw..