首页    期刊浏览 2024年10月06日 星期日
登录注册

文章基本信息

  • 标题:Identifying M-shortest Optimal Paths and Incorporating Load Balancing over these Paths with Negligible Overhead
  • 本地全文:下载
  • 作者:Shuchita Upadhyaya , Richa Setiya
  • 期刊名称:Journal of Theoretical and Applied Information Technology
  • 印刷版ISSN:1992-8645
  • 电子版ISSN:1817-3195
  • 出版年度:2009
  • 卷号:6
  • 期号:01
  • 出版社:Journal of Theoretical and Applied
  • 摘要:

    Antnet is an agent based routing algorithm based on real ants' behavior. Ants are able to find shortest path to food source .In real life, ants drop some kind of chemical substances to mark the path that they used. Then on their way back they choose the path with the highest pheromones which becomes the shortest path. But Antnet Algorithms may cause the network congestion and stagnation. Here, M-shortest optimal paths are proposed with negligible overhead in spite of single optimal path in Antnet routing algorithm and consequently the load is distributed over those paths with some strategy.

  • 关键词:Load Balancing;Food Sources;Chemical Substances;Network Congestion;Routing Algorithms;Stagnation
国家哲学社会科学文献中心版权所有