Level crossing ordering of Markov chains: Computing end to end delays in an all optical network

VALUETOOLS 2007 - 2nd International ICST Conference on Performance Evaluation Methodologies and Tools

Volumn , Issue , 2007, Pages

  Bušić, Ana ^a   Czachórski, Tadeusz ^b   Fourneau, Jean Michel ^c   Grochla, Krzysztof ^b  

^a UNIVERSITY OF VERSAILLES   (France)

^b POLISH ACADEMY OF SCIENCES   (Poland)

^c UNIV GRENOBLE ALPES   (France)

Author keywords

Deflection routing; End to end delay; Level crossing comparison of Markov chains; Stochastic ordering

Indexed keywords

ALGORITHMS; DEFLECTION (STRUCTURES); PACKET NETWORKS; RAILROAD CROSSINGS; STOCHASTIC MODELS; STOCHASTIC SYSTEMS; TOOLS; TOPOLOGY;

ABSORBING MARKOV CHAIN; ALL- OPTICAL NETWORKS; DEFLECTION PROBABILITY; DEFLECTION ROUTINGS; END TO END DELAY; LEVEL CROSSING; NUMERICAL ALGORITHMS; STOCHASTIC ORDER;

MARKOV PROCESSES;

EID: 84896985499     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (14)

1. J. Bannister, F. Borgonovo, L. Fratta, and M. Gerla. A versatile model for predicting the performance of deflection routing networks. Performance Evaluation, 16:201-222, 1992.
2. P. Baran. On distributed communication networks. IEEE Transactions on Communication Systems, CS-12:1-9, 1964.
3. A. Bonnoni and P. P. Prucnal. Analytical evaluation of improved access techniques in deflection routing networks. IEEE/ACM Trans. on Networking, 4(5), 1996.
4. A. Borrero, J. Fourneau, and F. Quessette. Packet selection in a deflection routing algorithm. In ISCIS 2002, Orlando, USA. CRC Press, 2002.
5. A. Busic, J. M. Fourneau, and D. Nott. Deflection routing on a torus is monotone. In Positive Systems, Proceedings of the Second Multidisciplinary International Symposium on Positive Systems: Theory and Applications (POSTA 06), Volume 341 of LNCIS, pages 161-168. Springer, 2006.
6. J. Fabrega and X. Munoz. A study of network capacity under deflection routing schemes. In Europar 03, Volume 2790 of LNCS, pages 989-994, 2003.
7. F. Ferreira and A. Pacheco. Level-crossing ordering of semi-Markov processes and Markov chains. Journal of Applied Probability, 42:989-1002, 2005.
8. J.-M. Fourneau and T. Czachórski. Transport time distribution for deflection routing on an odd torus. In Europar 05, Portugal, Volume 3648 of LNCS, pages 975-983. Springer Verlag, 2005.
9. P. Gravey, S. Gosselin, C. Guillemot, D. Chiaroni, N. L. Sauze, A. Jourdan, E. Dotaro, D. Barth, P. Berthomé, C. Laforest, S. Vial, T. Atmaca, G. Hébuterne, H. E. Biaze, R. Laalaoua, E. Gangloff, and I. Kotuliak. Multiservice optical network: Main concepts and first achievements of the ROM program. Journal of Ligthwave Technology, 19:23-31, 2001.
10. A. Irle and J. Gani. The detection of words and an ordering for Markov chains. Journal of Applied Probability, 38:66-77, 2001.
11. S. Mneimeh and F. Quessette. Minimum deflection routing algorithm, alcatel patent application #135945, 2002.
12. D. Stoyan. Comparison Methods for Queues and Other Stochastic Models. Wiley, 1983.
13. K. S. Trivedi. Probability and Statistic with Reliability, Queueing and Computer Science Applications, Second Edition. Wiley, 2002.
14. S. Yao, B. Mukherjee, and S. Dixit. Plato: a generic modeling technique for optical packet switched networks. International Journal on Wireless and Optical Communications, 1(1):91-101, 2003.