The guaranteed Latency Based Forwarding approach features per-hop bounded delays to meet the target latency requirements of data flows based on end-to-end application needs. dGLBF introduces a Prolog-based specification of gLBF for path selection and delay configuration. The prototype determines paths and delays to meet data flow latency targets, offering a concise and extendable solution to the considered problem.

MultiDIPS is an extension of DIPS that allows to model and process multiple VNF-based service provisioning intents.

EdgeWise shows a declarative programming and a Mixed-Integer Linear Programming (MILP) approach to determine eligible placements that minimise operational costs and reduce the number of used nodes to contain the amount of data transfers. After assessing the performance of both approaches, it reconcile them into a methodology that combines the best of the two worlds by exploiting a declarative pre-processing step to boost the MILP solver while determining optimal solutions.

DIPS enables users (i.e. application providers) to specify their desired VNF chain requirements in a high-level language that captures their intent, such as the type of service to be provided, possible location constraints (e.g. at the edge), Quality of Service (QoS) (e.g. latency and bandwidth), but also non-functional requirements (e.g. privacy and logging).

DAPlacer proposes a declarative solution that accounts for (non-)functional aspects so as to determine service placements and SDN data routings that meet all application requirements. Such a solution employs a Prolog reasoner and continuous reasoning to speed-up placement and routing decisions at runtime.