Abstract We consider the problem of routing packets with end-to-end hard deadlines in multihop communication networks. This is a challenging problem due to the complex spatial–temporal correlation among flows with different deadlines. To tackle this problem, we introduce the concepts of virtual links and virtual routes to incorporate end-to-end deadline constraints into routing and propose a novel virtual queue architecture to guide the spatial–temporal routing where the routing algorithm specifies where and when a packet should be routed. For the frame-based periodic traffic, the proposed policies can support any arrival within throughput region when the ratio between the link capacity and the packet size is sufficiently large. For the general traffic, we integrate a constrained resource-pooling heuristic into the spatial–temporal routing, which improves the delivery ratio and performs well. Our extensive simulations show that the policies outperform traditional policies such as backpressure and earliest-deadline-first (EDF) for more general traffic flows in multihop communication networks.

中文翻译：

---

用于支持多跳网络中端到端硬期限的时空路由

摘要 我们考虑在多跳通信网络中路由具有端到端硬期限的数据包的问题。由于具有不同截止日期的流之间复杂的时空相关性，这是一个具有挑战性的问题。为了解决这个问题，我们引入了虚拟链路和虚拟路由的概念，将端到端的截止时间约束合并到路由中，并提出了一种新颖的虚拟队列架构来指导时空路由，其中​​路由算法指定数据包的位置和时间应该路由。对于基于帧的周期性流量，当链路容量和数据包大小之间的比率足够大时，所提出的策略可以支持吞吐量区域内的任何到达。对于一般流量，我们将受限资源池启发式集成到时空路由中，这提高了交付率并且表现良好。我们广泛的模拟表明，对于多跳通信网络中更一般的流量，这些策略优于传统策略，例如背压和最早截止日期优先 (EDF)。