检索结果-内蒙古大学图书馆

Analysis on a mobile agent-based algorithm for network routing and management

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2003年第3期14卷 193-202页

作者： Sum, J Shen, H Leung, CS Young, G Hong Kong Polytech Univ Dept Comp Hong Kong Hong Kong Peoples R China Japan Adv Inst Sci & Technol Grad Sch Informat Sci Tatsunokuchi Ishikawa 9231292 Japan City Univ Hong Kong Dept Elect Engn Kowloon Hong Kong Peoples R China Calif State Polytech Univ Pomona Dept Comp Sci Pomona CA 91768 USA

Ant routing is a method for network routing in the agent technology. Although its effectiveness and efficiency have been demonstrated and reported in the literature, its properties have not yet been well studied. This paper presents some preliminary analysis on an ant algorithm in regard to its population growing property and jumping behavior. For synchronous networks, three main results are shown. First, the expected number of agents in a node is shown to be no more than (1 + max(i){\Omega(i)\})km, where \Omega(i)\ is the number of neighboring hosts of the ith host, k is the number of agents generated per request, and m is the average number of requests. Second, the expected number of jumps of an agent is shown to be no larger than (1 + max(i){\Omega(i)\}). Third, it is shown that for all p greater than or equal to (1 + max(i){\Omega(i)\})km, the probability of the number of agents in a node exceeding p is not greater than integral(p)(infinity) P(x)dx, where P(x) is a normal distribution function with mean and variance given by Mean = (1 + max(i){\Omega(i)\})km,Var. = 2km(1 + max(i){\Omega(i)\}) + (km(2)(1 + max(i){\Omega(i)\})(2) / (1+2 max(i){\Omega(i)\}). The first two results are also valid for the case when the network is operated in asynchronous mode. All these results conclude that as long as the value max(i){\Omega(i)\}) is known, the practitioner is able to design the algorithm parameters, such as the number of agents being created for each request, k, and the maximum allowable number of jumps of an agent, in order to meet the network constraint.

关键词： mobile agents routing algorithms networking routing ant algorithm

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：