Stochastic Network Calculus. Cet article n’est pas disponible.
Langue : anglais
Edité par Springer, 2010
- Livre broché
- Neuf



Image de l’article 1 de 2
Vendeur : preigu, Osnabrück, Allemagnepreigu
Vendeur avec une évaluation de 5 étoiles
Vendeur AbeBooks depuis 5 août 2024
Indisponible
Livre broché
Etat: Neuf
EUR 50,45
A propos de cet article
Stochastic Network Calculus | Yuming Jiang (u. a.) | Taschenbuch | xix | Englisch | 2010 | Springer | EAN 9781849967327 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
N° de réf. du vendeur 107145433
- Titre
- Stochastic Network Calculus
- Auteur
- Yuming Jiang (u. a.)
- Éditeur
- Springer
- Année de publication
- 2010
- État de l'article
- Neu
- Reliure
- Taschenbuch
- Langue
- anglais
- ISBN à 10 chiffres
- 1849967326
- ISBN à 13 chiffres
- 9781849967327
- Poids de l'article
- 388 grammes
- Dimensions
- 235 x 155 x 14 mm
- Catalogues du vendeur
- Bücher
Network calculus is a theory dealing with queuing systems found in computer networks. Its focus is on performance guarantees. Central to the theory is the use of alternate algebras such as the min-plus algebra to transform complex network systems into analytically tractable systems. To simplify the ana- sis, another idea is to characterize tra?c and service processes using various bounds. Since its introduction in the early 1990s, network calculus has dev- oped along two tracks—deterministic and stochastic. This book is devoted to summarizing results for stochastic network calculus that can be employed in the design of computer networks to provide stochastic service guarantees. Overview and Goal Like conventional queuing theory, stochastic network calculus is based on properly de?ned tra?c models and service models. However, while in c- ventional queuing theory an arrival process is typically characterized by the inter-arrival times of customers and a service process by the service times of customers, the arrival process and the service process are modeled in n- work calculus respectively by some arrival curve that (maybe probabilis- cally) upper-bounds the cumulative arrival and by some service curve that (maybe probabilistically) lower-bounds the cumulative service. The idea of usingboundstocharacterizetra?candservicewasinitiallyintroducedfor- terministic network calculus. It has also been extended to stochastic network calculus by exploiting the stochastic nature of arrival and service processes.
« Synopsis » peut appartenir à une autre édition de cet ouvrage.
Présentation de l'éditeur
The development of an information theory for stochastic service guarantee analysis has been identified as a grand challenge for future networking research. Towards it, Stochastic Network Calculus, the probabilistic version or generalization of the (deterministic) Network Calculus, has been recognized by researchers as a crucial step. This book is devoted to a comprehensive treatment of this active research area, which covers the results from the authors as well as other researchers in this area. This book presents an overall picture for the state of the art of stochastic QoS analysis research by providing basic introductory material on the subject as well as discussing the most recent research in the area. Topics covered include Traffic Models and Server Models for Stochastic Network Calculus, and Independent Case Analysis and its applications. Researchers and graduates in the area of performance evaluation of computer communication networks will benefit hugely from this comprehensive volume.
« A propos de ce titre » peut appartenir à une autre édition de cet ouvrage.
Résultats de recherche pour Stochastic Network Calculus
Il reste 5 exemplaires de ce livre.Afficher tous les résultats