- Home
- Computers
- Programming
- Performance Analysis of Queuing and Computer Networks
Performance Analysis of Queuing and Computer Networks
List Price:
$87.99
- Availability: Confirm prior to ordering
- Branding: minimum 50 pieces (add’l costs below)
- Check Freight Rates (branded products only)
Branding Options (v), Availability & Lead Times
- 1-Color Imprint: $2.00 ea.
- Promo-Page Insert: $2.50 ea. (full-color printed, single-sided page)
- Belly-Band Wrap: $2.50 ea. (full-color printed)
- Set-Up Charge: $45 per decoration
- Availability: Product availability changes daily, so please confirm your quantity is available prior to placing an order.
- Branded Products: allow 10 business days from proof approval for production. Branding options may be limited or unavailable based on product design or cover artwork.
- Unbranded Products: allow 3-5 business days for shipping. All Unbranded items receive FREE ground shipping in the US. Inquire for international shipping.
- RETURNS/CANCELLATIONS: All orders, branded or unbranded, are NON-CANCELLABLE and NON-RETURNABLE once a purchase order has been received.
Product Details
Author:
G.R. Dattatreya
Format:
Paperback
Pages:
472
Publisher:
CRC Press (September 19, 2019)
Language:
English
ISBN-13:
9780367387228
Weight:
22.5oz
Dimensions:
6.125" x 9.1875"
File:
TAYLORFRANCIS-TayFran_260121055423912-20260121.xml
Folder:
TAYLORFRANCIS
List Price:
$87.99
Country of Origin:
United States
Series:
Chapman & Hall/CRC Computer and Information Science Series
Case Pack:
10
As low as:
$83.59
Publisher Identifier:
P-CRC
Discount Code:
H
Pub Discount:
30
Imprint:
Chapman and Hall/CRC
Overview
With examples and exercises, this text develops simple models and analyticalmethods from first principles to evaluate performance metrics of various configurations of computer systems and networks. It includes simple, analytically tractable models, such as optimization of saturated CSMA/CD and CSMA/CA LANs; presents models for complex systems as analyzable modifications and/or interconnections of simple models; and contains a wide variety of queuing models, including bursty, MMPP, approximate self-similar traffic, and fluid flow. The author also discusses timing and synchronization in the analysis of discrete time (slotted) networks.
