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

John Tsiligaridis

Abstract

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.

References

  1. Acharya, S., Zdonik, F., Alonso, R., 1995. “Broadcast disks: Data management for asymmetric communications environments“, Proc. of the ACM SIGMOD Int. Conf. on Management of Data, San Jose, May 1995, 199-210
  2. Yee, W., Navathe, S., Omiecinski, E., Jemaine, C., 2002. ” Efficient Data llocation over Multiple Channels of Broadcast Servers”, IEEE Trans. on Computers, vol. 51, No.10,Oct 2002.
  3. Ardizzoni, E., Bertossi. A., Pinotti, M., Ramaprasad, S., Rizzi, R., Shashanka, M., 2005. ” Optimal Skewed Data Allocation on Multiple Channels with Flat per Channel”, IEEE Trans. on Computers , Vol. 54, No. 5, May 2005
  4. Bertossi. A., Pinotti, M., Ramaprasad, S., Rizzi, R., Shashanka, M., 2004. “Optimal multi-channel data allocation with flat broadcast per channel”, Proceedings of IPDS'04, 2004, 18-27
  5. Peng, W., Chen. M., 2000. ” Dynamic Generation of data Broadcasting Programs for a Broadcast disk Array in a Mobile Computing Environment”, Proc. of the 9th ACM International Conference on Information and Knowledge Management (CIKM 2000), pp. 38-45
  6. Yao, G., Zhu, D., Li, H., Ma. S., 2008. “ A polynomial algorithm to compute the minimum degree spanning trees of directed acyclic graphs with applications to the broadcast problem”, Discrete Mathematics, 308(17), 3951-3959.
  7. Hashemi, S., Rezapour, M., Moradi, A.,2007. ”Two new algorithms for the Min-Power Broadcast problem in static ad hoc networks” , Applied Mathematics and Computation, 190(2) 1657-1668, 2007
Download


Paper Citation


in Harvard Style

Tsiligaridis J. (2012). Data Dimensioning for Delay Differentiation Services in Regular Plans for Mobile Clients . In Proceedings of the International Conference on Data Communication Networking, e-Business and Optical Communication Systems - Volume 1: DCNET, (ICETE 2012) ISBN 978-989-8565-23-5, pages 69-74. DOI: 10.5220/0004119500690074


in Bibtex Style

@conference{dcnet12,
author={John Tsiligaridis},
title={Data Dimensioning for Delay Differentiation Services in Regular Plans for Mobile Clients},
booktitle={Proceedings of the International Conference on Data Communication Networking, e-Business and Optical Communication Systems - Volume 1: DCNET, (ICETE 2012)},
year={2012},
pages={69-74},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004119500690074},
isbn={978-989-8565-23-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the International Conference on Data Communication Networking, e-Business and Optical Communication Systems - Volume 1: DCNET, (ICETE 2012)
TI - Data Dimensioning for Delay Differentiation Services in Regular Plans for Mobile Clients
SN - 978-989-8565-23-5
AU - Tsiligaridis J.
PY - 2012
SP - 69
EP - 74
DO - 10.5220/0004119500690074