A numerical approach of the analysis of optical container filling

Abstract : We study the performance of the optical network architecture NGreen which is based on an optical slotted ring. The random part of the end to end delay comes from the times needed to build an optical container from arriving Data Units and the insertion of the optical container on the ring. Here, to study the first problem, we build a Discrete Time Markov Chain to model the filling of the optical container with Data Units. We take into account a deadline (to have a small latency) and a constraint on a minimal filling of the container (to be energy efficient). We obtain through a numerical analysis using an ad-hoc algorithm we proved, the distribution of the container filling and the distribution of the time needed to build a container. We also compare the algorithm speed with two well known algorithms to compute the steady-state distribution of Markov chains
Document type :
Conference papers
Complete list of metadatas

https://hal.uvsq.fr/hal-02168221
Contributor : Jean-Michel Fourneau <>
Submitted on : Friday, June 28, 2019 - 3:07:25 PM
Last modification on : Thursday, October 17, 2019 - 12:36:53 PM

Identifiers

Citation

Youssef Ait El Mahjoub, Jean-Michel Fourneau, Hind Castel-Taleb. A numerical approach of the analysis of optical container filling. VALUETOOLS 2019: 12th EAI International Conference on Performance Evaluation Methodologies and Tools, Mar 2019, Palma, Spain. pp.159-162, ⟨10.1145/3306309.3306333⟩. ⟨hal-02168221⟩

Share

Metrics

Record views

23