Modeling and Analysis of Computer Communications Networks

Paperback (Softcover reprint of the original 1st ed. 1984)
$93.10
BN.com price
(Save 5%)$99.00 List Price
Other sellers (Paperback)
  • All (3) from $92.17   
  • New (2) from $92.17   
  • Used (1) from $141.16   
Sending request ...

Product Details

  • ISBN-13: 9781468448436
  • Publisher: Springer US
  • Publication date: 7/28/2013
  • Series: Applications of Communications Theory Series
  • Edition description: Softcover reprint of the original 1st ed. 1984
  • Pages: 399
  • Product dimensions: 6.00 (w) x 9.00 (h) x 0.85 (d)

Table of Contents

1. Basic Orientation.- 1.1. Modeling and Analysis of Computer Communication Networks.- 1.2. Computer Communications Networks.- 1.3. Summary of Text.- 2. Protocols and Facilities.- 2.1. Introduction.- 2.2. Properties of Data Traffic.- 2.3. Protocols.- 2.4. The Telephone Network.- 2.5. Data Transmission.- 2.6. Data Networks.- 2.7. Local Area Networks.- 2.8. Alternative Facilities: Satellites and Cable Television.- 3. Pure Birth and Birth-Death Processes: Applications to Queueing.- 3.1. Introduction.- 3.2. Bernoulli Trials—Markov Chains.- 3.3. The Poisson Process.- 3.4. Pure Birth Processes.- 3.5. Birth-Death Processes.- 3.6. Queueing Models.- 3.7. Delay—Little’s Formula.- 3.8. Burke’s Theorem.- 3.9. Communications Example.- 3.10. Method of Stages.- Exercises.- 4. Imbedded Markov Chain: The M/G/1 Queue.- 4.1. Introduction.- 4.2. The M/G/1 Queue.- 4.3. Variation for the Initiator of a Busy Period.- 4.4. Numerical Results.- Exercises.- 5. Imbedded Markov Chain Analysis of Time-Division Multiplexing.- 5.1. Introduction.- 5.2. Simple and Compound Poisson Arrival.- 5.3. Asynchronous Time-Division Multiplexing.- 5.4. Synchronous Time-Division Multiplexing.- 5.5. Message Delay.- 5.6. Alternate Derivation Average Delay in STDM.- 5.7. “Come Right In” Strategy.- 5.8. Automatic Repeat Request.- Exercises.- 6. Intermittently Available Server, Priority Queues: Application to Ring Systems.- 6.1. Interrupted Service, Priority Queues.- 6.2. Preemptive Resume Discipline.- 6.3. Nonpreemptive Priorities.- 6.4. Application to Local Area Networks with the Ring Topology.- Exercises.- 7. Polling.- 7.1. Basic Model: Applications.- 7.2. Average Cycle Time: Infinite Buffer.- 7.3. Single-Message Buffers.- 7.4. Analysis: Infinite Buffer.- 7.5. Review of Literature.- Exercises.- 8. Random Access Systems.- 8.1. ALOHA and Slotted ALOHA.- 8.2. Carrier Sense Multiple Access.- 8.3. Delay Calculations CSMA/CD.- 8.4. Performance Comparisons.- 8.5. Reservation Techniques.- Exercises.- 9. Probing and Tree Search Techniques.- 9.1. Overhead and Information Theory.- 9.2. Probing.- 9.3. Cycle Time in Probing.- 9.4. Message Delay.- 9.5. More Complete State Information.- Exercises.- 10. Networks of Queues.- 10.1. Introduction—Jackson Networks.- 10.2. Multidimensional Birth-Death Processes; Queues in Tandem.- 10.3. Networks of Queues—Product Form Distribution.- 10.4. The Departure Process—Time Reversal.- 10.5. Store-and-Forward Communication Networks.- 10.6. Capacity Allocation.- Exercises.- 11. Congestion and Flow Control.- 11.1. Introduction.- 11.2. Link Level Flow Control—HDLC.- 11.3. Flow Control and Jackson Networks.- 11.4. Computational Techniques—Closed Networks.- 11.5. Networks with Blocking.- Exercises.- 12. Routing-Flow Allocation.- 12.1. Introduction.- 12.2. Routing Model.- 12.3. Shortest-Path Algorithms.- 12.4. Capacity Constraints.- 12.5. Flow Control and Routing.- 12.6. Routing in Practice.- Exercises.- 13. Network Layout and Reliability.- 13.1. Introduction.- 13.2. Trees.- 13.3. Distributed Networks.- 13.4. Network Reliability.- Exercises.- Appendix A: Review of Probability Theory.- ?.1. Axioms of Probability.- A.2. Conditional Probability.- A.3. Random Variables—Probability Distributions and Densities.- A.4. Joint Distributions of Random Variables.- A.5. Expectation of a Random Variable—Moments.- A.6. Probability-Generating Functions and Characteristic Functions.- A.7. Bounds and Limit Theorems.- Appendix B: Review of Markov Chains.- B.1. Example: Bernoulli Trials.- B.2. State Transition Matrix.- B.3. Steady-state Distribution.
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)