Speed-up and application distributed constraint satisfaction to communication network path assignments

Yoshiyasu Nishibe, Kazuhiro Kuwabara, Makoto Yokoo, Toru Ishida

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

The distributed constraint satisfaction algorithm is considered. It attempts to improve the processing speed by introducing the ordering based on heuristics. The ordering is a technique which suppresses the expansion of search space by ordering the variables and the value assignments. The communication path allocation problem is considered as an application of the distributed constraint satisfaction. The presented method is evaluated through the problems derived from the actual data of the communication network, and the effectiveness of the ordering is demonstrated.

Original languageEnglish
Pages (from-to)54-67
Number of pages14
JournalSystems and Computers in Japan
Volume25
Issue number12
Publication statusPublished - 1994 Nov 1

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Hardware and Architecture
  • Computational Theory and Mathematics

Fingerprint Dive into the research topics of 'Speed-up and application distributed constraint satisfaction to communication network path assignments'. Together they form a unique fingerprint.

  • Cite this