All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Virtual Network Embedding as Boolean Satisfiability

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F24%3A00381975" target="_blank" >RIV/68407700:21240/24:00381975 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1109/ICTAI62512.2024.00063" target="_blank" >https://doi.org/10.1109/ICTAI62512.2024.00063</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/ICTAI62512.2024.00063" target="_blank" >10.1109/ICTAI62512.2024.00063</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Virtual Network Embedding as Boolean Satisfiability

  • Original language description

    We address the Virtual Network Embedding (VNE) problem in which the task is to map a virtual network onto a given physical substrate network so that the CPU and bandwidth capacity constraints are met. Following the success of Boolean Satisfiability (SAT) methods in areas such as Multi-Agent Path Finding (MAPF), we propose in this paper a novel SAT-based approach for solving the VNE problem. As in MAPF, the various constraints that define the VNE problem are encoded into the SAT models incrementally and via lazy refinements so as to keep the models simple. We also propose various model relaxations and concomitant solution extraction post-processing procedures. Through experiments, we show that our SAT-based approach outperforms other state-of-the-art approaches on a number of VNE instances.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    <a href="/en/project/GA22-31346S" target="_blank" >GA22-31346S: logicMOVE: Logic Reasoning in Motion Planning for Multiple Robotic Agents</a><br>

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2024

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    Proceedings of the 2024 IEEE 36th International Conference on Tools with Artificial Intelligence (ICTAI)

  • ISBN

    979-8-3315-2724-2

  • ISSN

    1082-3409

  • e-ISSN

    2375-0197

  • Number of pages

    9

  • Pages from-to

    387-395

  • Publisher name

    IEEE Computer Society

  • Place of publication

    Los Alamitos

  • Event location

    Washington, DC

  • Event date

    Oct 28, 2024

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article