hrcak mascot   Srce   HID

Izvorni znanstveni članak
https://doi.org/10.2498/cit.2006.02.04

Convergence of the Key Algorithm of Traffic-Flow Analysis

László Muka
Gábor Lencse

Puni tekst: engleski, pdf (209 KB) str. 133-139 preuzimanja: 204* citiraj
APA 6th Edition
Muka, L. i Lencse, G. (2006). Convergence of the Key Algorithm of Traffic-Flow Analysis. Journal of computing and information technology, 14 (2), 133-139. https://doi.org/10.2498/cit.2006.02.04
MLA 8th Edition
Muka, László i Gábor Lencse. "Convergence of the Key Algorithm of Traffic-Flow Analysis." Journal of computing and information technology, vol. 14, br. 2, 2006, str. 133-139. https://doi.org/10.2498/cit.2006.02.04. Citirano 24.02.2020.
Chicago 17th Edition
Muka, László i Gábor Lencse. "Convergence of the Key Algorithm of Traffic-Flow Analysis." Journal of computing and information technology 14, br. 2 (2006): 133-139. https://doi.org/10.2498/cit.2006.02.04
Harvard
Muka, L., i Lencse, G. (2006). 'Convergence of the Key Algorithm of Traffic-Flow Analysis', Journal of computing and information technology, 14(2), str. 133-139. https://doi.org/10.2498/cit.2006.02.04
Vancouver
Muka L, Lencse G. Convergence of the Key Algorithm of Traffic-Flow Analysis. Journal of computing and information technology [Internet]. 2006 [pristupljeno 24.02.2020.];14(2):133-139. https://doi.org/10.2498/cit.2006.02.04
IEEE
L. Muka i G. Lencse, "Convergence of the Key Algorithm of Traffic-Flow Analysis", Journal of computing and information technology, vol.14, br. 2, str. 133-139, 2006. [Online]. https://doi.org/10.2498/cit.2006.02.04

Sažetak
The traffic-flow analysis (TFA) [1] is a novel method for the performance estimation of communication systems. TFA contains an important algorithm called "correction for the finite capacity". The convergence of that algorithm is proven in this paper. The speed of convergence is also examined.

Hrčak ID: 44663

URI
https://hrcak.srce.hr/44663

Posjeta: 333 *