<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>05362437</id>
  <dt>a</dt>
  <an>05362437</an>
  <augroup>
    <au>Barolli, Leonard</au>
    <au>Ikeda, Makoto</au>
    <au>Durresi, Arjan</au>
    <au>Xhafa, Fatos</au>
    <au>Koyama, Akio</au>
  </augroup>
  <ti>Performance evaluation of two search space reduction methods for a distributed network architecture.</ti>
  <so>Takizawa, Makoto (ed.) et al., Network-based information systems. 2nd international conference, NBiS 2008, Turin, Italy, September 1--5, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-85692-4/pbk). Lecture Notes in Computer Science 5186, 49-59 (2008).</so>
  <py>2008</py>
  <pu>Berlin: Springer</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1007/978-3-540-85693-1_7</li>
  </ligroup>
  <abgroup>
    <ab>Summary: 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.</ab>
    <rv></rv>
  </abgroup>
</item>