Convergence of the Key Algorithm of Traffic-Flow Analysis
|
| Title | Convergence of the Key Algorithm of Traffic-Flow Analysis |
| Authors | |
| Abstract | 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. |
| Publisher | University of Zagreb, University Computing Centre - SRCE |
| Date | 1970-01-01 |
| Source | Journal of Computing and Information Technology Vol 14, No 2 (2006) |
| Rights | CIT. Journal of Computing and Information Technology is an open access journal.Authors who publish with this journal agree to the following terms:Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License that allows others to share the work with an acknowledgement of the work´s authorship and initial publication in this journal.Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal´s published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access). |