Worst-case delay control in multigroup overlay networks
No Thumbnail Available
Sreenan, Cormac J.
This paper proposes a novel and simple adaptive control algorithm for the effective delay control and resource utilization of end host multicast (EMcast) when the traffic load becomes heavy in a multigroup network with real-time flows constrained by (sigma, rho) regulators. The control algorithm is implemented at the overlay networks and provides more regulations through a novel (sigma, rho, lambda) 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 a theoretical analysis and a set of results. We prove the existence and calculate the value of the rate threshold rho* such that for a given set of K groups, when the average rate of traffic entering the group end hosts rho macr > rho*, the ratio of the worst-case multicast delay bound of the proposed (sigma, rho, lambda) regulator over the traditional (sigma, rho) regulator is O(1/Kn) for any integer n. We also prove the efficiency of the novel algorithm and regulator in decreasing worst-case delays by conducting computer simulations.
Worst-case delay control , Overlay multicast , Multiple groups , Traffic control , Regulators , Communication system traffic control , Multicast algorithms , Multicast protocols , Telecommunication traffic , Traffic control , Propagation delay , Adaptive control , Delay effects , Resource management , Telecommunication traffic , Adaptive control , Delays , Multicast communication , Resource allocation , Telecommunication control
Tu, W., Sreenan, C. J. and Ji, W. (2007) 'Worst-Case Delay Control in Multigroup Overlay Networks', IEEE Transactions on Parallel and Distributed Systems, 18(10), pp. 1407-1419. doi: 10.1109/TPDS.2007.1074
© 2007 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.