论文标题

基于NDN的计算网络中的最佳动态编排

Optimal Dynamic Orchestration in NDN-based Computing Networks

论文作者

Feng, Hao, Zhang, Yi, Srikanteswara, Srikathyayani, Spoczynski, Marcin, Arrobo, Gabriel, Zhu, Jing, Himayat, Nageen

论文摘要

命名的数据网络(NDN)在部署下一代服务应用程序上比分布式计算网络提供了有希望的优势。我们考虑了基于NDN的计算网络上动态编排的问题,其中节点可以配备通信,计算和数据生成资源。给定一组带有功能链接结构的服务,我们解决了分布式在线算法的设计,该算法控制每个节点以对流动服务请求,进行功能实现和/或生成数据做出自适应决策。我们设计了一种服务发现辅助动态编排(SDADO)算法,该算法减少了交付服务的端到端(E2E)延迟,同时提供最佳的吞吐量性能。提出的算法混合动力基于排队的灵活性和基于拓扑的纪律,其中拓扑信息不是预先提供的,而是通过我们提出的服务发现机制获得的。我们为SDADO提供了吞吐量 - 优先分析,然后提供数值结果来确认我们的分析并证明往返E2E延迟减少。

Named Data Networking (NDN) offers promising advantages in deploying next-generation service applications over distributed computing networks. We consider the problem of dynamic orchestration over a NDN-based computing network, in which nodes can be equipped with communication, computation, and data producing resources. Given a set of services with function-chaining structures, we address the design of distributed online algorithm that controls each node to make adaptive decisions on flowing service requests, committing function implementations, and/or producing data. We design a Service Discovery Assisted Dynamic Orchestration (SDADO) algorithm that reduces the end-to-end (E2E) delay of delivering the services, while providing optimal throughput performance. The proposed algorithm hybrids queuing-based flexibility and topology-based discipline, where the topological information is not pre-available but obtained through our proposed service discovery mechanism. We provide throughput-optimality analysis for SDADO, and then provide numerical results that confirm our analysis and demonstrates reduced round-trip E2E delay.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源