BN.com Gift Guide

Communication and Computer Networks: Modelling with discrete-time queues / Edition 1

Hardcover (Print)
Used and New from Other Sellers
Used and New from Other Sellers
from $1.99
Usually ships in 1-2 business days
(Save 97%)
Other sellers (Hardcover)
  • All (13) from $1.99   
  • New (6) from $59.46   
  • Used (7) from $1.99   
Close
Sort by
Page 1 of 1
Showing All
Note: Marketplace items are not eligible for any BN.com coupons and promotions
$59.46
Seller since 2008

Feedback rating:

(4517)

Condition:

New — never opened or used in original packaging.

Like New — packaging may have been opened. A "Like New" item is suitable to give as a gift.

Very Good — may have minor signs of wear on packaging but item works perfectly and has no damage.

Good — item is in good condition but packaging may have signs of shelf wear/aging or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Acceptable — item is in working order but may show signs of wear such as scratches or torn packaging. All specific defects should be noted in the Comments section associated with each item.

Used — An item that has been opened and may show signs of wear. All specific defects should be noted in the Comments section associated with each item.

Refurbished — A used item that has been renewed or updated and verified to be in proper working condition. Not necessarily completed by the original manufacturer.

New
New Book. Shipped from UK within 4 to 14 business days. Established seller since 2000.

Ships from: Horcott Rd, Fairford, United Kingdom

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
$68.57
Seller since 2008

Feedback rating:

(17777)

Condition: New
Brand New, Perfect Condition, Please allow 4-14 business days for delivery. 100% Money Back Guarantee, Over 1,000,000 customers served.

Ships from: Westminster, MD

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
$68.58
Seller since 2009

Feedback rating:

(10533)

Condition: New
New Book. Shipped from US within 4 to 14 business days. Established seller since 2000

Ships from: Secaucus, NJ

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
$71.13
Seller since 2011

Feedback rating:

(51)

Condition: New
Ships next business day! Brand New!

Ships from: Vancouver, WA

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
  • Express, 48 States
  • Express (AK, HI)
$97.18
Seller since 2009

Feedback rating:

(94)

Condition: New
Hardcover New 0818651725 Special order direct from the distributor.

Ships from: Victoria, Canada

Usually ships in 1-2 business days

  • Canadian
  • International
  • Standard, 48 States
  • Standard (AK, HI)
  • Express, 48 States
  • Express (AK, HI)
$99.65
Seller since 2006

Feedback rating:

(318)

Condition: New
ABSOLUTELY BRAND NEW! Ships out within 24 hours! Multiple quantities available! International and expedited shipping available.

Ships from: Camden, NY

Usually ships in 1-2 business days

  • Standard, 48 States
  • Standard (AK, HI)
Page 1 of 1
Showing All
Close
Sort by

Overview

This book presents a unified approach to developing accurate discrete-time models of communication and computer networks, using discrete-time queuing theory and approximation techniques to obtain solutions. The first chapter outlines the basic aims and philosophy of the book and introduces discrete-time queues at the simplest possible level. The chapters that follow cover probability theory and discrete-time Markov chains, delve into discrete-time queues and queuing networks, and focus on applications for satellite and local area networks. In addition, the book gives examples of specific modeling techniques, and covers handling statistically different users, finite channel delays, timing delays, and unsolvable traffic equations.

Read More Show Less

Editorial Reviews

Booknews
A text that presents a unified method for modeling any network access protocol as a discrete-time queuing network, and develops efficient solution techniques for these models. A significant number of the models and their solutions have not previously appeared in the open literature. The treatment is self-contained and progresses from basic probability theory and discrete-time Markov chains, through to discrete-time queues, and discrete-time queuing networks. These latter are applied to model the performance of numerous wide area satellite networks and local area networks, ranging in complexity from simple Aloha schemes to the timed token protocol of the FDDI network. Annotation c. Book News, Inc., Portland, OR (booknews.com)
Read More Show Less

Product Details

  • ISBN-13: 9780818651724
  • Publisher: Wiley
  • Publication date: 1/13/1994
  • Series: Systems Series , #14
  • Edition number: 1
  • Pages: 216
  • Product dimensions: 5.96 (w) x 8.98 (h) x 0.67 (d)

Meet the Author

Michael Woodward is currently a Senior Lecturer in the Department of Electronic and Electrical Engineering at Loughborough University of Technology, U.K. He obtained a first class honours degree in Electrical Engineering from the University of Nottingham, U.K., in 1967, and was awarded a Ph.D at the same institution in 1971 for research into decomposition of sequential logic systems. He currently teaches both undergraduate and postgraduate courses in Software Engineering, Digital Communications, and Communication and Computer Networks, and has had over fifty research papers published in these and related areas. His present research interests include discrete-time queueing systems and the performance modeling of ATM networks.
Dr. Woodward is a Fellow of the Institute of Mathematics and its Applications, and is Chartered Mathematician.

Read More Show Less

Read an Excerpt

http://catalogimages.wiley.com/images/db/pdf/0818651725.excerpt.pdf
Read More Show Less

Table of Contents

1. Networks, Queues and Performance Modelling.

1.1 Introduction.

1.2 Network tyes.

1.3 Multiple-access protocols.

1.4 Discrete-time queues.

1.5 Performance measures.

2. Probability, Random Variables, and Distributions.

2.1 Probability.

2.2 Random variables.

2.3 Distributions.

2.4 Conditional distributions.

3. Stochastic Process and Markov Chains.

3.1 Poisson process.

3.2 Properties of the Poisson process.

3.3 Markov chains.

3.4 Markov chain models.

3.5 Exercises.

4. Discrete-Time Queues.

4.1 Performance measures and Litte's result.

4.2 Discrete-time queueing conventions.

4.3 Discrete-time M/M/1 queue.

4.4 Discrete-time M/M/1/J queue.

4.5 Discrete-time M-an/M/1

4.6 Discrete-time M-an/M-dm/ infinity queue.

4.7 S-queues.

4.8 Exercises.

5. Discrete-Time Queueing Networks.

5.1 Tandem S-queues.

5.2 Network of S-queues.

5.3 Discrete-time queueing network models for multiple access protocols.

5.4 Equilibrium point analysis.

5.5 Different customer classes.

5.6 Exercises.

6. Satellite Networks.

6.1 Time-division multiple access.

6.2 Slotted Aloha.

6.3 Code division multiple access.

6.4 Buffered slotted Aloha

6.5 Exercises.

7. Local Area Networks.

7.1 Carrier sensing networks.

7.2 Token passing networks.

7.3 Slotted rings.

7.4 Exercises.

Appendix.

References.

Index.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)