Informacja

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

English (EN)·Polski (PL)·Yкраїнський (UK)
Przejdź do strony domowej biblioteki Centralna Biblioteka Wojskowa Link otwiera się w nowym oknie Logo biblioteki Prolib Integro - strona głównaCentralna Biblioteka Wojskowa

Wyszukujesz frazę "network calculus" wg kryterium: Temat

  Lista filtrów
Wyrównaj
    Wyświetlanie 1-6 z 6
    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ł
    Tytuł:
    On Bounds on Cumulative Teletraffic Using Min-Plus Convolution
    Autorzy:
    Borys, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/226426.pdf
    Data publikacji:
    2012
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    network calculus
    bounds on cumulative teletraffic curve
    min-plus convolution
    Opis:
    Ideas and results published in two papers by R. L. Cruz in IEEE Transactions on Information Theory in 1991 gave rise to what is called now network calculus. A key role in it plays a certain inequality characterizing the behaviour of cumulative traffic curves. It defines the so-called burstiness constraint by which many kinds of traffics can be described, as for example those occurring in computer networks. Interpretation of this constraint, which can be expressed in two equivalent forms: with and without the use of min-plus convolution, can be found in papers of R. L. Cruz. Nothing however was said about how to obtain it practically, for example, for each of representatives of a family of measured cumulative traffic curves being upperbounded. This problem is tackled in this paper, and as a result, a relation between the Cruz's constraining function and an upper-bounding function of measured traffic curves is found. The relation obtained is quite general and valid also for the case of non-fulfilment of the so-called sub-additivity property by traffic curves. For the purpose of its derivation, a notion of sub-additivity property with some tolerance Δ was introduced, and the corresponding theorem exploiting it formulated and proved. Further, to complement discussion of the above relation, a minimal burstiness constraint was added to the original Cruz's inequality and related with a lower bound of a family of measured cumulative traffic curves. The derivations presented in this paper are illustrated by examples.
    Źródło:
    International Journal of Electronics and Telecommunications; 2012, 58, 4; 315-322
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
    Tytuł:
    Detailed Consideration of Graphical Calculation of Min-Plus Convolution in Deterministic Network Calculus
    Autorzy:
    Borys, A.
    Powiązania:
    https://bibliotekanauki.pl/articles/226084.pdf
    Data publikacji:
    2018
    Wydawca:
    Polska Akademia Nauk. Czytelnia Czasopism PAN
    Tematy:
    convolution
    network calculus
    min-plus algebra
    graphical construction of min-plus convolution
    Opis:
    The convolution operation used in deterministic network calculus differs from its counterpart known from the classic systems theory. A reason for this lies in the fact that the former is defined in terms of the so-called min-plus algebra. Therefore, it is oft difficult to realize how it really works. In these cases, its graphical interpretation can be very helpful. This paper is devoted to a topic of construction of the min-plus convolution curve. This is done here in a systematic way to avoid arriving at non-transparent figures that are presented in publications. Contrary to this, our procedure is very transparent and removes shortcomings of constructions known in the literature. Some examples illustrate its usefulness.
    Źródło:
    International Journal of Electronics and Telecommunications; 2018, 64, 2; 217-222
    2300-1933
    Pojawia się w:
    International Journal of Electronics and Telecommunications
    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ł:
    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ł:
    Comparison of descriptions of continuous-time and teletraffic systems
    Porównanie opisów systemów teleinformatycznych oraz ciągłych w czasie
    Autorzy:
    Borys, A.
    Aleksiewicz, M.
    Powiązania:
    https://bibliotekanauki.pl/articles/389811.pdf
    Data publikacji:
    2012
    Wydawca:
    Politechnika Bydgoska im. Jana i Jędrzeja Śniadeckich. Wydawnictwo PB
    Tematy:
    network calculus
    basic properties teletraffic systems
    linearity
    causality
    time-invariance
    associativity
    commutativity
    infimum convolutions
    rachunek sieciowy
    liniowe i niezależne od czasu systemy teleinformatyczne
    własności splotu w algebrze min-plus
    Opis:
    In a fundamental book [5] on the so-called network calculus and research papers using this technique, as for example those cited in this paper, the notion of causal linear time-invariant teletraffic systems (networks) is used. It has been mentioned in [5] that these systems are analogous to the causal linear time-invariant systems (circuits) described by integral convolution (or convolution sum in the case of discrete ones) in classical systems theory. Note that networks considered in the network calculus are described by other type of convolution that uses the infimum operation. Moreover, the algebra used in the above technique is also different. This is the so-called min-plus (or max-plus) algebra. Therefore, it is not obvious that the teletraffic systems (networks) described by the infimum convolution fulfill the following basic properties: linearity, causality, time-invariance, associativity and commutativity of their convolution operator, known from the classical theory of systems. The objective of this paper is to prove or show in detail that the above properties hold.
    W znanej monografii nt. rachunku sieciowego (network calculus), napisanej przez J.-Y. Le Boudeca i P. Thirana, zostało wprowadzone pojęcie liniowych systemów teleinformatycznych niezależnych od czasu. Wskazano w niej na podobieństwa istniejące pomiędzy powyższą klasą systemów a liniowymi systemami analogowymi niezależnymi od czasu, jednakże zrobiono to w sposób dosyć pobieżny. W tym artykule podobieństwa te są przeanalizowane w sposób systematyczny, a także bez uciekania się do bardzo abstrakcyjnej teorii systemów opisywanych za pomocą algebry min-plus – jedynie przy wykorzystaniu elementarnych pojęć matematyki wyższej. Wiele przedstawionych tutaj wyprowadzeń nie było dotychczas nigdzie publikowanych, jak na przykład twierdzenie 1.
    Źródło:
    Zeszyty Naukowe. Telekomunikacja i Elektronika / Uniwersytet Technologiczno-Przyrodniczy w Bydgoszczy; 2012, 16; 5-15
    1899-0088
    Pojawia się w:
    Zeszyty Naukowe. Telekomunikacja i Elektronika / Uniwersytet Technologiczno-Przyrodniczy w Bydgoszczy
    Dostawca treści:
    Biblioteka Nauki
    Artykuł
      Wyświetlanie 1-6 z 6

      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