Résumé: Unlike conventional deterministic bounding curve characterization, quality-of-service (QoS) dependent (e.g., the portion of buffer-overflow time intervals) curve characterization allows bound-violation for a certain portion of time and results in flexible, pointwisely smaller constraint functions to utilize valuable network resources. Our derivations show that the portion of bound-violation for an L<superscript>p-sense (1 < p < oo) constraint function has a normalized tail bound decaying with x<superscript>-<superscript>p, and L<superscript>p-sense constraint functions reduce to deterministic ones when p = <Infinity>. Therefore, our QoS-dependent constraint functions are obvious generalizations of conventional deterministic constraint functions. We further apply L<superscript>p-sense constraint functions to reduce buffer requirements for multi-hop connections according to the required bound on the portion of time prone to buffer overflows.

Langue: Anglais