Resource finding in store-and-forward networks

DOI10.1007/BF01178681zbMath0724.68007OpenAlexW2100623518MaRDI QIDQ758183

Mostafa H. Ammar, José M. Bernabéu-Aubán, Mustaque Ahamad

Publication date: 1991

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01178681

zbMATH Keywords

distributed systemresource finding

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10)

Related Items (1)

Optimal search path for service in the presence of disruptions

Cites Work

• Unnamed Item
• Unnamed Item
• Distributed match-making
• Theory of optimal search
• The complexity of searching a graph
• Optimal Search of a Moving Target
• Technical Note—The Complexity of the Optimal Searcher Path Problem
• Optimal Search Using Uninterrupted Contact Investigation

This page was built for publication: Resource finding in store-and-forward networks