Stochastic Network Calculus (Computer Communications and Networks),Used

Stochastic Network Calculus (Computer Communications and Networks),Used

In Stock
SKU: DADAX1848001266
Brand: Springer
$65.29
Quantity
Add to wishlist
Add to compare

Processing time: 1-3 days

US Orders Ships in: 3-5 days

International Orders Ships in: 8-12 days

Return Policy: 15-days return on defective items

Payment Option
Payment Methods

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

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 minplus 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 tracksdeterministic 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 interarrival 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) upperbounds the cumulative arrival and by some service curve that (maybe probabilistically) lowerbounds 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.

⚠️ WARNING (California Proposition 65):

This product may contain chemicals known to the State of California to cause cancer, birth defects, or other reproductive harm.

For more information, please visit www.P65Warnings.ca.gov.

Recently Viewed