A Composition Algorithm for the SILO Cross-Layer Optimization Service Architecture

We have previously proposed a software architecture for the future Internet called SILO that is specifically targeted to accommodate cross-layering gracefully. In such an architecture, composing the services that make up the software layers for specific data flow requirements emerges as an essential part of the architectural system. We provide a minimal set of precedence constraints to express service interactions, and an algorithm that obtains correct compositions under this set. The algorithm appears to have a super-polynomial worst case running time, and we conjecture that the problem is NP-complete. We show that under some further simplifications of the set of constraints, the problem is polynomial.