Data Dimensioning for Delay Differentiation Services in Regular Plans for Mobile Clients

摘要

The broadcast problem including the plan design is considered. The data are inserted and numbered into customized size relations at a predefined order. The server ability to create a full, regular Broadcast Plan (RBP) with single and multiple channels after some data transformations is examined. The Basic Regular Algorithm (BRA) prepares an RBP and enables users to catch their items while avoiding wasting energy by 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 a Dimensioning Algorithm (DA) is developed. The DA, with the criterion of ratio, offers the differentiation of service. This last property, in addition to the self-monitoring, and self-organizing, can be offered by servers today providing also channel availability and lower energy consumption by using a smaller, number of channels, of equal bandwidth. Simulation results are provided.