|
Synopsis |
This research aims to design and analyze a generalized regulator (s, r, l) with network calculus (NC) to effectively regulate and calculate the tight delay bound for high rate aggregate real-time traffic flows in the Internet. To minimize the worst-case delay bound, extended network calculus (ENC) is a generalization of network calculus based on a traditional well-known (s, r)-regulator. The new control algorithm operates like the traditional regulator under the normal loading situation, but provides more regulation for a heavy load of aggregate multimedia flows. With their new regulator, the researchers will be able to provide more effective regulation and tight delay bound for heavy real-time flows than with the traditional regulator. More specifically, for a set of aggregated flows R, they aim to achieve Dr(R)£D(R) where Dr(R) and D(R) are the worst-case delay bounds derived based on their control algorithm and ENC and on the (s, r)-regulator and NC, respectively. They intend to prove that an optimal (i.e., minimum) flow traffic rate threshold (lower bound) r* exists such that Dr(R)= D(R) for r £ r* and Dr(R)<D(R) for r > r*. Such a lower bound is important for industrial applications. |