Informacja

Drogi użytkowniku, aplikacja do prawidłowego działania wymaga obsługi JavaScript. Proszę włącz obsługę JavaScript w Twojej przeglądarce.

Wyszukujesz frazę "Wasielewska, K." wg kryterium: Autor


Wyświetlanie 1-3 z 3
Tytuł:
Consideration of a general model of stochastic service curve for communication networks
Autorzy:
Wasielewska, K.
Borys, A.
Powiązania:
https://bibliotekanauki.pl/articles/117055.pdf
Data publikacji:
2019
Wydawca:
Uniwersytet Morski w Gdyni. Wydział Nawigacyjny
Tematy:
communication networks
stochastic service
communication system
maritime telecommunications area
Quality of Service (QoS)
stochastic network calculus
modelling of model of stochastic service curve
stochastic service curve
Opis:
In this paper, a general framework for modelling stochastic service curves for communication networks is presented. It connects with each other two approaches to the traffic analysis and performance evaluation of communication systems, namely, the one which is called a deterministic network calculus with its stochastic counterpart. Thereby, it enables to treat any communication traffic in a consistent way. Further, as we show here, it enables also achieving new results. Derivation of the above model is presented in details in this paper. Finally, some hints are given how the method presented in this article could be applied in maritime telecommunications area.
Źródło:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation; 2019, 13, 1; 159-164
2083-6473
2083-6481
Pojawia się w:
TransNav : International Journal on Marine Navigation and Safety of Sea Transportation
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
A Contribution to the System : Theoretic Approach to Bandwidth Estimation
Autorzy:
Borys, A.
Wasielewska, K.
Rybarczyk, D.
Powiązania:
https://bibliotekanauki.pl/articles/226012.pdf
Data publikacji:
2013
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
network calculus
rate chirps
bandwidth estimation
nonlinear and/or linear parametric traffic systems
Opis:
The network calculus provides a theoretical background for description of traffic in computer networks. Using this tool in explanation of the so-called pathchirp method of measuring the available bandwidth, the validity and range of application of some relationships exploited are verified in this paper. The derivations are carried out in a wider context than that considered in a recent paper by Liebeherr et al. published in IEEE/ACM Transactions on Networking on network bandwidth estimation, providing thereby new insights and outcomes. These results, summarized in a table, show a means of bounding the service curve, depending upon its convexity or non-convexity property assumed and upon the linearity or non-linearity of a network considered. Moreover, it is shown here that the nonlinear network example analyzed by Liebeherr et al. can be viewed equivalently as a linear parametric network. For this network, the behaviour of the cross traffic is considered in a more detail, too.
Źródło:
International Journal of Electronics and Telecommunications; 2013, 59, 2; 141-149
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
Tytuł:
Some Principles of Network Calculus Revisited
Autorzy:
Borys, A.
Aleksiewicz, M.
Rybarczyk, D.
Wasielewska, K.
Powiązania:
https://bibliotekanauki.pl/articles/226229.pdf
Data publikacji:
2011
Wydawca:
Polska Akademia Nauk. Czytelnia Czasopism PAN
Tematy:
greedy shapers
network calculus
service curve
Opis:
Network calculus is a mathematical theory dealing with queueing problems in packet-switched computer networks. It provides algorithms to determine resource requirements of traffic flows using arrival and service curves and describes delays and backlogs in network systems. Network calculus framework is based on a min-plus algebra which allows to transform complex network optimization problems into analytically tractable ones. Recently, a fundamental book on principles, tools, techniques, and applications of network calculus, entitled: Network Calculus. A Theory of Deterministic Queuing Systems for the Internet, has been published by J. Y. Le Boudec and P. Thiran. Here, we refer to it in our refinements of proof of one important theorem and its extension. The objective of this paper is twofold. First, we complete one of basic results regarding a network element that is called in network calculus a greedy shaper. Second, we present also the results of some illustrative calculations and measurements of network service curve. They aim in better understanding of its properties.
Źródło:
International Journal of Electronics and Telecommunications; 2011, 57, 3; 279-284
2300-1933
Pojawia się w:
International Journal of Electronics and Telecommunications
Dostawca treści:
Biblioteka Nauki
Artykuł
    Wyświetlanie 1-3 z 3

    Ta witryna wykorzystuje pliki cookies do przechowywania informacji na Twoim komputerze. Pliki cookies stosujemy w celu świadczenia usług na najwyższym poziomie, w tym w sposób dostosowany do indywidualnych potrzeb. Korzystanie z witryny bez zmiany ustawień dotyczących cookies oznacza, że będą one zamieszczane w Twoim komputerze. W każdym momencie możesz dokonać zmiany ustawień dotyczących cookies