• Home
  • Search
  • The message management asynchronous backtracking algorithm
  • Cite Icon2
  • https://doi.org/10.1080/09528130701478629Copy DOI Icon

The message management asynchronous backtracking algorithm

  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In this paper we show how the asynchronous backtracking algorithm, a well-known distributed constraint satisfaction algorithm, produces unnecessary messages and introduce our optimized algorithm, message management asynchronous backtracking, which reduces the number of messages the agents send. The message management mechanism removes the redundant messages, keeps the message queue updated, and handles messages by package instead of individually in order to improve efficiency. Our test results shows that the algorithm significantly reduces the total number of messages sent and drastically reduces the number of cycles used when solving instances of the graph colouring problem.

Similar Papers
  • Research Article
  • Citations674

The distributed constraint satisfaction problem: formalization and algorithms

  • Jan 01, 1998
  • IEEE Transactions on Knowledge and Data Engineering
  • M Yokoo +3
  • Conference Article
  • Citations5

DOC

  • Jan 01, 2008
  • Kais Ben Salah +1
  • Research Article
  • Citations1

Cooperative Problem Solving against Adversary: Quantified Distributed Constraint Satisfaction Problem

  • Jan 01, 2011
  • Transactions of the Japanese Society for Artificial Intelligence
  • Satomi Baba +5
  • Book Chapter
  • Citations20

Dynamic Ordering for Asynchronous Backtracking on DisCSPs

  • Jan 01, 2005
  • Roie Zivan +1
  • Book Chapter
  • Citations1

Effect of DisCSP Variable-Ordering Heuristics in Scale-Free Networks

  • Jan 01, 2012
  • Tenda Okimoto +2
  • Conference Article
  • Citations2

Asynchronous Network Coded Multicast

  • May 01, 2010
  • D Traskov +3
  • Research Article

A new distributed algorithm for efficient generalized arc-consistency propagation

  • May 10, 2018
  • Autonomous Agents and Multi-Agent Systems
  • Shufeng Kong +2
  • Conference Article

Adaptive Runtime Features for Distributed Graph Algorithms

  • Dec 01, 2018
  • Jesun Sahariar Firoz +3
  • Research Article
  • Citations64

Information integration: A new generation of information technology

  • Jan 01, 2002
  • IBM Systems Journal
  • M A Roth +3
  • Research Article
  • Citations15

An asynchronous distributed optimization method for energy saving of parallel-connected pumps in HVAC systems

  • Oct 05, 2020
  • Results in Control and Optimization
  • Xuetao Wang +2
  • Research Article
  • Citations253

The MIMO Iterative Waterfilling Algorithm

  • Dec 12, 2008
  • IEEE Transactions on Signal Processing
  • G Scutari +2
  • Research Article
  • Citations67

ADMM Optimization Strategies for Wide-Area Oscillation Monitoring in Power Systems Under Asynchronous Communication Delays

  • Jul 01, 2016
  • IEEE Transactions on Smart Grid
  • Jianhua Zhang +3
  • Research Article
  • Citations4

A parallel asynchronous garbage collection algorithm for distributed systems

  • Mar 01, 1991
  • IEEE Transactions on Knowledge and Data Engineering
  • N Bagherzadeh +2
  • Conference Article
  • Citations8

Eigenvector Computation and Community Detection in Asynchronous Gossip Models

  • Jul 01, 2018
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Frederik Mallmann-Trenn +2
  • Research Article

Dynamic vs. static agent ordering in distributed arc consistency

  • Jan 01, 2018
  • International Journal of Advanced Intelligence Paradigms
  • El Houssine Bouyakhf +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.