Resource finding in store-and-forward networks

DOI10.1007/BF01178681MaRDI QIDQ758183zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• Deterministic resource discovery in distributed networks
• Asynchronous resource discovery
• Asynchronous resource discovery
• Distributed resource discovery in sub-logarithmic time
• A Deterministic Worst-Case Message Complexity Optimal Solution for Resource Discovery

Cites work

• scientific article; zbMATH DE number 3650583 (Why is no real title available?)
• scientific article; zbMATH DE number 4110447 (Why is no real title available?)
• Distributed match-making
• Optimal Search Using Uninterrupted Contact Investigation
• Optimal Search of a Moving Target
• Technical Note—The Complexity of the Optimal Searcher Path Problem
• The complexity of searching a graph
• Theory of optimal search

Cited in

(2)

• Optimal search path for service in the presence of disruptions
• Locating resources in a programmable networking environment

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q758183)