Abstract
We consider the problem of routing packets with end-to-end hard deadlines in communication networks. The problem is challenging due to the complex spatial-temporal correlation among flows with different deadlines. To tackle this challenging problem, we introduce the concepts of virtual links/routes to incorporate end-to-end deadline constraints into routing and propose a novel virtual queue architecture to guide the spatial-temporal routing which specifies where and when a packet should be routed. The proposed policy can support any periodic constant traffic within the network throughput region. Our simulations further show that the policy outperforms traditional policies such as backpressure and earliest-deadline-first (EDF) for general traffic flows.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.