SharpEdge: an asynchronous and core-agnostic solution to guarantee bounded-delays

Abstract

What are the key properties that a network should have to provide bounded-delay guarantees for the packets? In this paper, we attempt to answer this question. To that end, we explore the theory of bounded-delay networks and provide the necessary and the sufficient conditions required to have deterministic bounded-delays in the network. We prove that as long as a network is work-conserving, independent of the packet scheduling and queue management algorithms used in the switches, it is sufficient to shape the traffic~\textit{properly} at the edge of the network to meet hard bounded-delays in the network. Using the derived theorems, we present SharpEdge, a novel design to meet deterministic bounded-delays in the network. To the best of our knowledge, SharpEdge is the first scheme that can meet all following key properties: 1) it supports coexistence of different classes of traffic, while it can guarantee their different required bounded-delays 2) it does not require any changes in the core of the network, 3) it supports both periodic and bursty traffic patterns, and 4) it does not require any time synchronization between network devices.