Paper
Data Dimmensioning Algorithms for Delay Differentiation Services in Regular Plans for Mobile Clients
- Authors:
- John Tsiligaridis
- Abstract
- The broadcast problem including the plan design is considered. The data is inserted and numbered into customized size relations at a predefined order. The server’s ability to create a full, regular Broadcast Plan (RBP) with a single and multiple channels after some data transformations are performed is studied. The Basic Regular Algorithm (BRA) prepares an RBP and enables users to catch their items while avoiding wasting energy due to their devices. In the case of multiple channels a dynamic grouping solution is proposed, called the Partition Value Algorithm with Less Dimension (PVALD), under a multiplicity constraint. In order to provide an RBP under relative delays, two Dimensioning Algorithms (DA) are developed. The DA1, with the criterion of ratio, offers the desired differentiation of service using the available number of channels. The Extended DA (EXDA) discovers the attainable differentiation of services using the minimum number of channels. This last property, in addition to self-monitoring, and self-organizing, can be offered by servers today providing channel availability and lower energy consumption by using a smaller number of channels of equal bandwidth. Conditions for having the same delay ratio for RBPs and the unification of RBPs are also examined. Simulation results are provided.
- Keywords
- Broadcasting; Broadcast Plan; Mobile Computing
- StartPage
- 20
- EndPage
- 27
- Doi