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 - Nov 1 1994
Externally publishedYes

Fingerprint

Constraint Satisfaction
Distributed Applications
Communication Networks
Telecommunication networks
Speedup
Assignment
Path
Communication
Processing
Search Space
Heuristics

All Science Journal Classification (ASJC) codes

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

Cite this

Speed-up and application distributed constraint satisfaction to communication network path assignments. / Nishibe, Yoshiyasu; Kuwabara, Kazuhiro; Yokoo, Makoto; Ishida, Toru.

In: Systems and Computers in Japan, Vol. 25, No. 12, 01.11.1994, p. 54-67.

Research output: Contribution to journalArticle

Nishibe, Yoshiyasu ; Kuwabara, Kazuhiro ; Yokoo, Makoto ; Ishida, Toru. / Speed-up and application distributed constraint satisfaction to communication network path assignments. In: Systems and Computers in Japan. 1994 ; Vol. 25, No. 12. pp. 54-67.
@article{fd2c156363af4a7b89748372abd90b75,
title = "Speed-up and application distributed constraint satisfaction to communication network path assignments",
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.",
author = "Yoshiyasu Nishibe and Kazuhiro Kuwabara and Makoto Yokoo and Toru Ishida",
year = "1994",
month = "11",
day = "1",
language = "English",
volume = "25",
pages = "54--67",
journal = "Systems and Computers in Japan",
issn = "0882-1666",
publisher = "John Wiley and Sons Inc.",
number = "12",

}

TY - JOUR

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

AU - Nishibe, Yoshiyasu

AU - Kuwabara, Kazuhiro

AU - Yokoo, Makoto

AU - Ishida, Toru

PY - 1994/11/1

Y1 - 1994/11/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0028547832&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0028547832&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0028547832

VL - 25

SP - 54

EP - 67

JO - Systems and Computers in Japan

JF - Systems and Computers in Japan

SN - 0882-1666

IS - 12

ER -