Performance Evaluation of Two Search Space Reduction Methods for a Distributed Network Architecture

  • Authors:
  • Leonard Barolli;Makoto Ikeda;Arjan Durresi;Fatos Xhafa;Akio Koyama

  • Affiliations:
  • Department of Information and Communication Engineering, Fukuoka Institute of Technology (FIT), Fukuoka, Japan 811-0295;Graduate School of Engineering, Fukuoka Institute of Technology (FIT), Fukuoka, Japan 811-0295;Department of Computer and Information Science, Indiana University Purdue University Indianapolis, Indianapolis, USA IN 46202;Department of Languages and Informatics Systems, Polytechnic University of Catalonia, Barcelona, Spain 08034;Department of Informatics, Yamagata University, Yamagata, Japan 992-8510

  • Venue:
  • NBiS '08 Proceedings of the 2nd international conference on Network-Based Information Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.01

Visualization

Abstract

In our previous work, we proposed a distributed network architecture which integrates routing and CAC strategies using cooperative agents. However, in the previous research, we did not evaluated the performance of all agents. In this paper, we evaluate the performance of two search space reduction methods which are used for reduction of the search space of a GA-based routing approach. Thus, the GA can find a feasible route very fast.