Scholarlink

Cloud-edge applications often require data flows to meet stringent latency requirements, ensuring punctual IP packet delivery within specific time windows. To this end, the guaranteed Latency Based Forwarding (gLBF) approach features per-hop bounded delays to meet the target latency requirements of data flows based on end-to-end application needs. This article introduces a Prolog-based specification of gLBF for path selection and delay configuration. Our prototype determines paths and delays to meet data flow latency targets, offering a concise and extendable solution to the considered problem. We illustrate the scalability of our approach on real and random network topologies, with up to 1000 nodes and flows to be placed.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

Towards Declarative Traffic Engineering for Guaranteed Latency-Based Forwarding

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Jacopo Massa,
  • Stefano Forti,
  • Federica Paganelli,
  • Patrizio Dazzi,
  • Antonio Brogi,
  • Alexander Clemm,
  • Toerless Eckert

摘要

Cloud-edge applications often require data flows to meet stringent latency requirements, ensuring punctual IP packet delivery within specific time windows. To this end, the guaranteed Latency Based Forwarding (gLBF) approach features per-hop bounded delays to meet the target latency requirements of data flows based on end-to-end application needs. This article introduces a Prolog-based specification of gLBF for path selection and delay configuration. Our prototype determines paths and delays to meet data flow latency targets, offering a concise and extendable solution to the considered problem. We illustrate the scalability of our approach on real and random network topologies, with up to 1000 nodes and flows to be placed.