Solution_manual-_Computer_Networks_by_Peterson_and_Davie

Solution_manual-_Computer_Networks_by_Peterson_and_Davie -...

Info iconThis preview shows pages 1–4. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: Dear Instructor: This Instructors’ Manual contains solutions to almost all of the exercises in the second edition of Peterson and Davie’s Computer Networks: A Systems Approach . The goal of the exercise program for the second edition has been to provide a wide range of exercises supporting the text that are both accessible and interesting. When applicable, exercises were chosen that attempt to illuminate why things are done the way they are, or how they might be done differently. It is hoped that these exercises will prove useful to: support mastery of basic concepts through straightforward examples provide a source of classroom examples and discussion topics provide a study guide and source of exam problems introduce occasional supplemental topics support an exercise-intensive approach to the teaching of networks. Exercises are sorted (roughly) by section, not difficulty. While some exercises are more difficult than others, none are intended to be fiendishly tricky. A few exercises (notably, though not exclusively, the ones that involve calculating simple probabilities) require a modest amount of mathematical background; most do not. There is a sidebar summarizing much of the applicable basic probability theory in Chapter 2. An occasional exercise ( eg 4.21) is awkwardly or ambiguously worded in the text. This manual sometimes suggests better versions; see also the errata at the web site, below. Where appropriate, relevant supplemental files for these solutions ( eg programs) have been placed on the textbook web site, www.mkp.com/pd2e . Useful other material can also be found there, such as errata, sample programming assignments, PowerPoint lecture slides, EPS figures, and the-kernel code and tutorial. If you have any questions about these support materials, please con- tact your Morgan Kaufmann sales representative. If you would like to contribute your own teach- ing materials to this site, please contact Karyn Johnson, Morgan Kaufmann Editorial Department, kjohnson@mkp.com . We welcome bug reports and suggestions as to improvements for both the exercises and the solu- tions; these may be sent to netbugs@mkp.com . Peter Lars Dordal pld@cs.luc.edu Loyola University of Chicago September, 1999 Problems worthy of attack prove their worth by hitting back. Piet Hein Solutions for Chapter 1 3. Success here depends largely on the ability of ones search tool to separate out the chaff. I thought a naive search for Ethernet would be hardest, but I now think it’s MPEG. Mbone www.mbone.com ATM www.atmforum.com MPEG try searching for “mpeg format”, or (1999) drogo.cselt.stet.it/mpeg IPv6 playground.sun.com/ipng, www.ipv6.com Ethernet good luck. 5. We will count the transfer as completed when the last data bit arrives at its destination. An alternative interpretation would be to count until the last ACK arrives back at the sender, in which case the time would be half an RTT (50 ms) longer....
View Full Document

This note was uploaded on 12/01/2010 for the course CS 6390 taught by Professor Sarac during the Fall '10 term at University of Texas at Dallas, Richardson.

Page1 / 107

Solution_manual-_Computer_Networks_by_Peterson_and_Davie -...

This preview shows document pages 1 - 4. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online