Abstract
We present a model of the edge router between electronic and all optical networks. Arriving electronic packets of variable sizes are stored at a buffer the volume of which is equal to the fixed size of optical packet. When the buffer is filled, its content becomes an optical buffer and dispatched to optical network. To avoid excessive delays, the optical packet is sent also after a specified deadline. The model is based on diffusion approximation and validated by discrete event simulation. Its goal is to determine the probability distribution of the effective optical packet sizes an distribution of their interdeparture times as a function of the interarrival time distribution, distribution of the electronic packet sizes, the value of deadline and the size of buffer. We use real traffic data from the CAIDA (Center for Applied Internet Data Analysis) repositories.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
https://data.caida.org/datasets/passive-2016/equinix-chicago/20160218-130000.UTC/
Cox, R.P., Miller, H.D.: The Theory of Stochastic Processes. Chapman and Hall, London (1965)
Domańska, J., Kotuliak, I., Atmaca, T., Czachórski, T.: Optical packet filling, In: 10th Polish Teletraffic Symposium PSRT2003 (2003)
Kuaban, G.S.: Markovian queuing model for performance evaluation of the edge node in IP over all-optical networks, Masters thesis, Silesian University of Technology (2017)
Suila, K.G., Czachórski, T., Rataj, A.: A queueing model of the edge node in ip over all-optical networks. In: Gaj, P., Sawicki, M., Suchacka, G., Kwiecień, A. (eds.) CN 2018. CCIS, vol. 860, pp. 258–271. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-92459-5_21
Kotuliak, I.: Feasibility study of optical packet switching: performance evaluation. Ph.D. thesis, University of Versailles-St-Quentin-en-Yveline (2003)
Li, H., Thng, I.: Edge node buffer usage in optical burst switching networks, Photonic Netw. Commun. 13(1), 31–51. Springer Science+Business Media, LLC (2006)
Toksöz, M.A., Akar, N.: Dynamic threshold-based assembly algorithms for optical burst switching networks subject to burst rate constraints. Photonic Netw. Commun. 20(2), 120–130. Springer Science+Business Media, LLC (2010)
Czachórski, T.: A diffusion process with instantaneous jumps back and its application, Archiwum informatyki Teoretycznej i Stsowanej, t.2 (z.1-2) 27–46 (1990)
Czachórski, T., Domański, A., Domańska, J., Rataj, A.: A study of IP router queues with the use of markov models. In: Gaj, P., Kwiecień, A., Stera, P. (eds.) CN 2016. CCIS, vol. 608, pp. 294–305. Springer, Cham (2016). https://doi.org/10.1007/978-3-319-39207-3_26
Gelenbe, E.: On approximate computer systems models. J. ACM 22(2), 261–269 (1975)
Gelenbe, E.: Diffusion approximations: waiting times and batch arrival. Acta Inf. 12, 285–303 (1979)
Atmaca, T., Kamli, A., Rataj, A.: Adaptation of the NGREEN architecture for a bursty traffic. In: Proceedings of CN 2018. Institut Mines-Telecom, Gliwice, France
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer Nature Switzerland AG
About this paper
Cite this paper
Kuaban, G.S., Anyam, E., Czachórski, T., Rataj, A. (2018). Performance of a Buffer Between Electronic and All-Optical Networks, Diffusion Approximation Model. In: Czachórski, T., Gelenbe, E., Grochla, K., Lent, R. (eds) Computer and Information Sciences. ISCIS 2018. Communications in Computer and Information Science, vol 935. Springer, Cham. https://doi.org/10.1007/978-3-030-00840-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-030-00840-6_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-00839-0
Online ISBN: 978-3-030-00840-6
eBook Packages: Computer ScienceComputer Science (R0)