The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.10 - October (2007 vol.18)
pp: 1407-1419
ABSTRACT
This paper proposes a novel and simple adaptive control algorithm for the effective delay control and resource utilization of EMcast when the traffic load becomes heavy in a multi-group network with real-time flows constrained by (σ, ρ) regulators. The control algorithm is implemented at the overlay networks, and provides more regulations through a novel (σ, ρ, λ) regulator at each group end host who suffers from heavy input traffic. To our knowledge, it is the first work to incorporate traffic regulators into the end host multicast to control heavy traffic output. Our further contributions include theoretical analysis and a set of results. We prove the existence and calculate the value of the rate threshold ρ* such that for a given set of K groups, when the average rate of traffic entering the group end hosts ρ‾ > ρ*, the ratio of the worst-case multicast delay bound of the proposed (σ, ρ, λ) regulator over the traditional (σ, ρ) regulator is Ο(1/K^n) for any integer n. We also prove the efficiency of the novel algorithm and regulator in decreasing worst-case delays by conducting computer simulations.
INDEX TERMS
Worst-case delay control, overlay multicast, multiple groups, traffic control
CITATION
Cormac J. Sreenan, Wanqing Tu, "Worst-Case Delay Control in Multigroup Overlay Networks", IEEE Transactions on Parallel & Distributed Systems, vol.18, no. 10, pp. 1407-1419, October 2007, doi:10.1109/TPDS.2007.1074
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool