Progress in Systems and Telecommunication Engineering

DLINE Journals portal

Home

New Journals

Browse Journals

Journal Prices

For Authors

Print ISSN:
Online ISSN:

About JIO
	DLINE Portal Home Home Aims & Scope Editorial Board Current Issue Next Issue Previous Issue Sample Issue Upcoming Conferences Self-archiving policy Alert Services Be a Reviewer Publisher Paper Submission Subscription Contact us

How To Order
	Order Online Price Information Request for Complimentary Print Copy

For Authors
	Guidelines for Contributors Online Submission Call for Papers Author Rights

RELATED JOURNALS

Journal of Digital Information Management (JDIM)

Journal of Multimedia Processing and Technologies (JMPT)

International Journal of Web Application (IJWA)

Progress in Systems and Telecommunication Engineering

Pareto Distributed Inter-arrival Time Assessment

Seferin Mirtchev, Rossitza Goleva, Georgi Balabanov and Velko Alexiev
The Faculty of Telecommunications at Technical University of Sofia 8 Kl. Ohridski Blvd Sofia 1000 Bulgaria

Abstract: To define the peaked arrival processes, we have outlined the Polya and Pareto distribution processes. We are able to assess the actual loss of data in telecommunication systems. This is a fully accessible loss system with Polya input flow that is the negative binomial distributed number of arrivals in a fixed time interval, general allocated service time and Ã¢â‚¬Å“nÃ¢â‚¬Â servers. We have assessed the model with Pareto distributed inter-arrival time using simulation data. We have developed an algorithm for the calculation of the state probabilities and outlined the blocking. We found that the input stream changes influence the loss system properties.

Keywords: Polya Distribution, Pareto Distribution, Loss System, Peaked Flow Pareto Distributed Inter-arrival Time Assessment

DOI:

Full_Text PDF 1.47 MB Download: 24 times

References:

[1] Chandrasekaran, B. Survey of Network Traffic Models. Retrieved from http://www.cse.wustl.edu/~jain/cse567-06/traffic_models3.htm

[2] Ramos, H., Almorza, D., and Garcia-Ramos, J. (2002). On Characterizing the Polya Distribution. ESAIM: Probability and Statistics, 6, 105-112. URL: http://www.emath.fr/ps/

[3] Muscariello, L., Mellia, M., Meo, M., Ajmone Marsan, M., and Lo Cigno, R. (2004). An MMPP-Based Hierarchical Model of
Internet Traffic. IEEE ICC 2004, 27(1), 2143-2147.

[4] Moltchanov, D., Koucheryavy, Y., and Harju, J. (2005). Non-preemptive _iD-BMAPi/D/1/K queuing system modelling the frametransmission process over wireless channels. ITC 19, 6a, 1335-1344.

[5] Iversen, V. B. (2004). Teletraffic Engineering Handbook. ITU-D and ITC. Retrieved from http://www.com.dtu.dk/education/
34340/

[6] Psounis, K., Molinero-Fernandez, P., Prabhakar, B., and Papadopoulos, F. (2005). Systems with Multiple Servers Under Heavy-Tailed Workloads. Performance Evaluation, 62, 456-474.

[7] Yang, X. (2002). Designing Traffic Profiles for Bursty Internet Traffic. In: Proceedings of IEEE Global Internet.

[8] Siriwong, K., Lipsky, L., and Ammar, R. (2007). Study of Bursty Internet Traffic. In: Sixth IEEE International Symposium on
Network Computing and Applications (NCA 2007) (p 53-60).

[9] Korn, G., Korn, T. (1968). Mathematical Handbook for Scientists and Engineers. McGraw-Hill, p. 575.

DLINE Journals portal