WSEAS Transactions on Computers
Print ISSN: 1109-2750, E-ISSN: 2224-2872
Volume 13, 2014
Compound Regular Plans and Delay Differentiation Services for Mobile Clients
Author:
Abstract: The broadcast problem including the plan design is considered. Data can be reached at any time and place. A larger number of users are asking for services. The Regular Broadcast Plan (RBP) can be created with single or multiple channels after some data transformations are examined. A server with the data-parallelism can administrate more than one plans and before broadcasting any of the plans it can consider the case of union ready or candidate RBPs. The case of union of several candidate or ready RBPs is examined and useful results are provided. A new RBP algorithm based on the group length is introduced (RBPG). A set of algorithms related to the creation of a compound regular broadcast plan (CO_RBP) and their possibilities are developed. CO_RBP is based on the “hot” and “near hot” sets. The conditions of preferring CO_RBP to separate RBPs is also presented. Two types of CO_RBP are examined; the additive RBPs (ARBPs) and the union RBPs (URBPs). This proposed framework gives service priority to the “hot or “near hot” sets. In addition, a Dimensioning algorithm (DA) based on the delay differentiation services and conditions that can guarantee the desired ratio for the CO_RBP are developed. In this way the server, has an increasing of broadcasting capability ,by deciding on the union of RBPs using single or multiple channels. This ability can enrich the server infrastructure for self-monitoring, self-organizing and channel availability. Simulation results are provided.
Search Articles
Pages: 34-42
WSEAS Transactions on Computers, ISSN / E-ISSN: 1109-2750 / 2224-2872, Volume 13, 2014, Art. #4