Stability and Delay Bounds in Heterogeneous Networks of Aggregate Schedulers

—Aggregate scheduling is one of the most promising solutions to the issue of scalability in networks, like DiffServ networks and high speed switches, where hard QoS guarantees are required. For networks of FIFO aggregate schedulers, the main existing sufficient conditions for stability (the possibility to derive bounds to delay and backlog at each node) are of little practical utility, as they are either relative to specific topologies, or based on strong ATM-like assumptions on the network (the so-called ”RIN” result), or they imply an extremely low node utilization. We use a deterministic approach to this problem. We identify a nonlinear operator on a vector space of finite (but large) dimension, and we derive a first sufficient condition for stability, based on the super-additive closure of this operator. Second, we use different upper bounds of this operator to obtain practical results. We find new sufficient conditions for stability, valid in an heterogeneous environm...

• Type: Conference
• Year: 2008
• Where: INFOCOM
• Authors: Gianluca Rizzo, Jean-Yves Le Boudec
• Keywords: Communications, FIFO Aggregate Schedulers, INFOCOM 2008, Strong Atm-like Assumptions, Sufficient Conditions