Identyfikatory
Warianty tytułu
Języki publikacji
Abstrakty
The problem of calculating routing probabilities in packet synchronous networks, such as optically-switched packet networks, involves enumerating packet arrangements. Previously we published a method for enumerating the most probable packet arrangements, and in this article we present its novel graph interpretation and evaluate the method for several stop conditions and for the Poisson and geometric probability distributions of arriving packets.
Słowa kluczowe
Rocznik
Tom
Strony
147--152
Opis fizyczny
Bibliogr. 4 poz., rys.
Twórcy
autor
- Institute of Computer and Information Sciences Częstochowa University of Technology ul. Dąbrowskiego 73, 42-200 Częstochowa, Poland
Bibliografia
- [1] R. Nejabati, G. Zervas, D. Simeonidou, M.J. O'Mahony, D. Klonidis. The OPORON project: demonstration of a fully functional end-to-end asynchronous optical packet-switched network. Journal of Lightwave Technology, 25(11), 3495-3510, 2007.
- [2] S. Das, G. Parulkar, N. McKeown. Unifying packet and circuit switched networks. In: 2009 IEEE GLOBECOM Workshops, pp. 1-6, December 2009.
- [3] I. Szcześniak, T. Czachórski. Performance evaluation of a bufferless packet-switched node. In: Proceedings of the Ninth International Conference on Transparent Optical Networks, ICTON 2007, vol. 3, pp. 117-120, 2007.
- [4] I. Szcześniak. The website of OPUS, the Optical Packet Switching Universal Solver. http://www.irkos.org/opus, April, 2011.
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-585f1b67-ccec-410d-960c-119a3593e6fc