Computer Networks - Peterson and Davie - 4e Solution Manual

Computer Networks -Peterson and Davie - 4e Solution Manual
http://www.facebook.com/plugins/like.php?api_key=136494494209&locale=en_US&sdk=joey&channel_url=http%3A%2F%2Fstatic.ak.facebook.com%2Fconnect%2Fxd_arbiter.php%3Fversion%3D11%23cb%3Df21211ee15d2954%26origin%3Dhttp%253A%252F%252Fwww.scribd.com%252Ff35d8f70924f77%26domain%3Dwww.scribd.com like http://www.scribd.com/doc/45905524/Computer-Networks-Peterson-and-Davie-4e-Solution-Manual AQCzzjKC

Link Embed of 122
Readcast Like 86 Tweet
0
Download
Comment
Share
Search
Explore
Upload
Download and print this document

Choose a format to download in
.PDF .TXT
Download
More From This User
Next
Computer Networks Peterson and Davie - 4e Solution Manual

4 edition CN solutions manual
Download or Print
Add To Collection
12.7K
READS
48
READCASTS
317
EMBED VIEWS
Published by
14 p. 4 p. 4 p.
nsk6
Follow
ROC Introduction
Sharath Kumar N 264 Reads
Uniform Noise & All Salt & Pepper Noise Filters(Matlab Code) & All Filters(Matlab Code) Sharath Kumar N
418 Reads Sharath Kumar N 449 Reads
Search
TIP Press Ctrl-F to search anywhere in the document.
Searching for solutions computer networks a system...?
Related
Next
108 p.
107 p.
107 p.
Info and Rating

Category: School Work > Study Guides, Notes, & Quizzes Rating: Upload 12/26/2010 Date: Copyright: Attribution Non-commercial
Pd3esolutions Manual
api_user_11797_P Doshi 8076 Reads
cn_sol
Gohar Ali 243 Reads
ACN net
Muhammad Zubair 226 Reads
Leave a Comment
You must be logged in to leave a comment.
Tags:
computer networks cn solutions manual computer networks peterson and davie
Free download as PDF File (.pdf), text file (.txt) or read online for free. Flag document for inapproriate content
Characters: 400
Submit
About
About Scribd Blog Join our team! Contact Us
Advertise with us
Get started AdChoices
Support
Help FAQ Press
Partners
Publishers Developers / API
Legal
Advertisement Terms Privacy
The secret of how to learn a foreign language in just 10 days. Read here to find out...
Copyright ( Illinois): Obey this 1 weird "loophole" to get car insurance as low as $7
Copyright 2012 Scribd Inc.
Language:
English
If you are a smoker and live in [ Illinois] you need to read this...
Top cruise lines are giving away their unsold cabins at up to 75% off...
http://www.scribd.com/doc/45905524/Computer-Networks-Peterson-and-Davie-4e-Solution-Manual[10/25/2012 5:21:40 PM]
The webpage c
Chapter 6
93
guarantee anything on an end-to-end basis. In other words, congestion management is an end-to-end issue. If IP operates exclusively over ATM, then congestion management at the ATM level may indeed address total congestion (although if partial packet discard is
not implemented then dropped cells do not correspond very well to dropped packets). In this setting, congestion control at the TCP level has the drawback that it doesnt address other protocols, and doesnt take into account the switches Chapter 6 knowledge of virtual circuits. 44.
94
(a) Robot control is naturally realtime-intolerant: the robot can not wait indefTime, steering control if 2 is 3 4 to 5 0 1 it about crash, and it can not afford to initely for secs Bucket volume 1 0 2 2 0 stun, or even switch to blue lose messages such as halt, set phasars on 2 paint. Such an represent lling the bucket, andin a setting where we have application could be adaptive it turns out that due to this Entries in italic the freedom to slow the robot down. truncation we scrape the bottom at T=4 as well. However, the depth of 2 does sufce. (b) If an application tolerates a loss rate of x , 0 < x < 1, then it is only receiv-
ing fraction 1 x of the original bandwidth and can tolerate a reduction to 46. The answer is in the book. that bandwidth over a lossless link. 47. (a) If the router queuebeing transmitted three ows dump their buckets at the (c) Suppose the data is empty and all are positioning coordinates for some sameof robotic burst amounts to 15must follow a maximum delay of 1.5 sec. kind time, the device. The device packets for the positions plotted, though Since deviation is permitted. We can tolerate to steady-state trafc alone, intersome the router can keep up with packets due occasional lost Solutions for Chapter(there isdumps fasterassumption here);get data, by 7 and can drain any earlier bucket a continuity than the buckets this would relled, polating the correct path such a burst is in fact the maximum queue. qualify the application as loss-tolerant. (b) In 2.0 seconds thebe ablecan claim that the application is nonadaptive. So We also want to router to forward 20 packets. If ow1 sends an initial ssn burst of suppose that too much transmission delay means ow2 sends 4 at another we will 10 at T=0 and name single packet at T=1, and the robot cannot T=0 and 2 at T=1, that amounts to 17at least notall. This leaves a minimum follow the path closely enough (or packets in with the required speed), 7 R I C H Over 4376 capacitythe 3 packets for ow3. A Rthe D A signicantcourse, ow3 is making of application non-delay-adaptive.long term, of rate reduction, guaranteed an averagethe 8 packets perkeep to within the required tolerance similarly, might mean of device cant 2.0 seconds. perhaps it requires at least 80%day the coordinates and so it would of month 48. (a) If the router was initially combining both reserved and year nonreserved trafc qualify as non-rate-adaptive. into a single FIFO queue, then reserved ows before the loss were not get3 M 1996 8. (a) If we is in the book.A Ybucket but 5the loss the router is still to become ting start with an empty 45. The answergenuine service guarantees. Afterallow the bucket volumehandling all trafc via a single FIFO queue; the only difference is that alltable of is now negative (while still providingpackets), we get the following trafc bucket 9. Here are the encodings. considered nonreserved. for state loss should salary indebtedness: At T=0, Theexample, we withdraw 5 packets and deposit num_raises+1 elements of thus make no difference. 101 be 00000000 00000000 00000000 01100101 2. the router used weighted fair queuing to segregate reserved trafc, then (b) If 101 le 01100101 00000000 00000000 00000000 Time, secs 14000 1 2 4 3 35000 5 27000 a state loss may lead0to considerable3degradation in service, because the 10120 be 00000000 00000000 00100111 10001000 Bucket trafc now -3 forced to-5 -3 on an equal footing with volume is -6 -7 -6 reserved compete hoi polloi 10120 le 10001000 00100111 00000000 00000000 We thus need an initial bucket depth of 7, so as not to run out at T=4. trafc. num_raises 16909060 be 00000001 00000010 00000011 00000100 bucket with depth 7 never Because all the volumes above are negative, the (c) Suppose new reservations from some third parties reach the router before 16909060 le 00000100 00000011 00000010 00000001 overows. 2 the periodic refresh requests are received to renew the original reservations; For more on big-endian versus little-endian we quote Jonathan Swift,router may (b) If we bitsthe same withoutuse up all the reservable capacity the writing in if these new reservations notication to the sender). For inbound strings, high-order do (with or thing as above we get Gullivers Time,to :book. 0 1 2 be forced secs 2. The answerTravels turn down the renewals.3 by default, make a ag available to is in the one approach might be to strip them to 7 bits 4 5 indicateBucket volume the eighth bits had been set, and,to so, make available a whether any of -1 -2 1 5 3 6 ...Which two suggest that, have, in was going if setting, use en5. Limited measurementsmighty powersat leastas Ione particulartell you, beenof htonl A bucket depth obstinate war for per word) ofmoons past. thewith upon of 2 will thus accommodate re-reading lossless mechanism (perhaps one bytesix and thirtyT=1. If we startbegan an initially data. gaged in a most slows full array-converting2, we down by about a factor of two.It the bucket of depth loop get the following occasion. It is allowed on all hands, that the primitive way of 14. Here is a C++ solution, in which we make netint int an automatic conversion. 6. The following eggs before we eat them, wason a 300MHz Intel system,present breaking measurements were made upon the larger end: but his compiling To avoid potential ambiguity, we make use of the explicit keyword in the conwith Microsofts Visual C++ 6.0 he was a boy, going turnedan egg, and break- to Majestys grandfather, while and optimizations to eat off. We normalize structor converting int to netint , so that this does not also become an automatic the case of a loop that repeatedly assigns the same integer variable tongers. ing it according to the ancient practice, happened to cut one of his another: conversion. (Note that the ambiguity would require additional code to realize.) 1.
for (i= 0;i< the Emperor his father published an edict, commanding all his Whereupon N;i++) j= k
To support assignment penalties, to break introduce an assignment operator. subjects, loop body netint = int , we the smaller end of theirloop take about 2.9 Replacing the upon great above with made the eggs. The
{ }
19.
(a) people encoding letter times longer.so highly resented this law, that our histories tell ustook about beentimes The following homemade byte-swapping code there have 3.7 class six rebellions raised on that account.... Many hundred large volumes have netint a 1 longer: public: bpublished01 this controversy: but the books of the Big-Endians have been upon char * p = (char return ntohl( netint); * ) & k; operator int() 001 and the whole party rendered incapable by law of holdbeenclong forbidden, char q = (char * ) & j; netint() : * netint(0) // default constructor d 000 ing employments.
j=htonl(k)
(b) 1 0.5 + 2 0.3 + 3 0.1 + 3 0.1 = 1.7 q[1]=p[2]; 10. The answer is inoperator=(int n) netint & the book. q[2]=p[1];is the (c) The table netint same, although we could now give either a or b the 1-bit = htonl(n); q[3]=p[0];that average compression is now 11. The problem isreturn we dont know whether the RPCVersion eld is in bigencoding. The 1 0.4 + 2 0.4 + 3 0.15 + * this; endian or little-endian this informa3 0.05 replacing the loop body with an array copy For comparison, = 1.8format until after we extract it, but we need A[i]=B[i] took about tiontimes raw()on which extraction to do. to decide 2.8 int longer. return netint; // th place of (c) Here is a table listing, for each i for testing i , the 2N strings of in the 20. (a) This is a counting argument: theres are percentage error length N and only It would nal1result. to work around N for private: 0 be possible The smallest error is problem provided 7; the largestall for i = 1 N 1 the + 2 + are as follows: = 2 this 1 strings of length < N . Some string, i = 0 and that among is the 2 +2 7. ASN.1 encodings version IDs assigned, the big-endian representation of one ID never happened to int netint; and 6. therefore, cannot get shorter. INT 4 101 be identical to the little-endian representation of another. This would be the 7 case ; 0 1 2 3 4 5 6 i INT example, future (c) We 4error 10120 versions of39.6 continued to use39.6 53.1 format for let if, for % XDR 45.0 45.0 big-endian 12.3 12.3 53.1 INT 4 16909060 but 0 c(s) if length( c(s)) < length( s) the RPCVersion celd,= not necessarily elsewhere. (s) 24. The all-white image generates 1 all within the DCT phase. The quantization otherwise The above strategy doesnt help all s at zeros pointers, and not much with structures phase leaves the to address alignment problems, for example. knows some12. It is often possible 8 do grid of 0s unchanged; the encoding phase then compresses 8 a better job of compressing the data if one and arrays. It doesnt is c(s) with a zero-bit prepended). The initial bit is a ag (where 0 c(s) 95 thing about nothing. of the data. This applies even to lossless compression; it is it to almost the type to indicate whether the remainder was compressed or not. particularly true order is the province of be contemplated. Once encoded in a 15. Transmission bit if lossy compression canthe network adapter, which addresses 25. Here is the rst row of an 8 8 pixmap consisting of a black line (value 0) in the message transmits or a run encoding 1 we represent all looks alike, and a the handed to this that occur receives each layer, all the with themselves. If only a 21. Bytesas it and andwith restthe length ofbyte. Generallydatanumeric formats onbyte rst column, the all white: generic, lossless compression of ints, oats, it applied. same bit same machine of more than 1, we represent etc) use the occurs in a run (different sizesalgorithm can be with the three bytesorder; only if 00 FF FF FF FF FF FF FF they didnt would the programmer have to make distinctions. [ESC] [count] [byte] 13. [The DEC-20 was perhaps the best-known example of 36-bit architecture.] Here is the image after any agreed-upon cjpeg -quality it ) JPEG compression The byte [ESC] can be default-quality ( escape character; if75occurs alone it 16. For big-endian network byte order the average number of conversions iswith FC, p2 + 0 and decompression; as are some faint Incoming 32-bit integers[ESC][ESC]. vertical are outbound character might be representedthere is no problem; neitherfringing (the columns strings. For receiver-makes-right this is 1 and FE would appeareitherp) 2 .sent as 64-bit integers, or else couldare iden- + 1 2 p(1 integers could(1 progressively fainter grey lines). All rows lose the p) + 2 0 p2 FD, as be Outbound 2 samplep) + 0 rst: (1 p) 2 ; the is, if both it generated the following data. 22. A p(1 hereprogram appears on that web page;sender and receiver are little-endian tical; is the then no FC FF FD of These791 is 94892 below: are FE FF The uncompressed is done. RFCFF evaluated bytes. There are 11,243 words 01 conversion size FF p 0 .1 96 90 , and p = 0 .9 in all; -quality 100 , or even=words isp2255 .5 fringing is gone; theis 18226 With the number of distinct -quality = 0 the the dictionary size image after big-endian and decompression is identical to the 0.20 12 1.80 1.00 bytes. The encoded size of the non-dictionary partoriginal. bits per word is thus with compression network receiver-makes-right 0.18 0.50 dictionary we get a compressed (12 11243)/ 8 = 16865 bytes; together with the 0.18 26. We start with an example specically generated for the 8 8 grid; note that the size of 35091 bytes, 37% of the original size. There are 132 words appearing at 17. letters change the markup tag text with corresponding originalOne or two bytes (a) Replace gradually in both directions. Here is the codes. data: least 13 times, with a total frequency count of 6689. This means the 128 most a would sufce e most XML h b c d for f g languages. common words appear a total of 6637 times; this gives a compressed size of b Representenumerical data using a numerical representation instead of text. c d f g h i (b) (8 6637 + 13 (11243 6637)) / 8 = 14122 bytes, plus the dictionary; the c d e f g h i j total is now 34% of the original size. Note that exact numbers are sensitive to d e f g h j k 18. Try data les with lots ofibyte-string-level redundancy. the precise denition of a word used. e f g h i j k l f Excel spreadsheet forkthis, l m is available at the web site. g h i j 23. An dct.xls, 97 g h i j k l m n (a) For symmetric data such as this, coefcients DCT (i) for i = 1 , 3, 5, 7 h i j k l m n o (starting the indexing default-quality (quality=75) near-zero. We get the following after at i = 0 ) should be zero orjpeg compression and decompression; no letter is off by the maximum error value. pixel (i) after applying (b) If we keep six coefcients, more than 1 ASCII in b the DCT d e inversehis about 0.7%, for b c and its g h i = 1 and i = 2 . If we keep b only d e ve coefcients (note that both choices lead to the same values c four or f g h h c for the inverse DCT), then the maximum error is 6%, at d d f g h i i i = 0 ; the error at d i = 1 is 5.6%. e f g h i j j
q[0]=p[3]; explicit netint (int n) :
netint(ntohl(n))
{ }
{}
f f g h i j k l g g h i j l l m h h i j k l m n 98 h h i k l m n n At quality=100 the text is preserved exactly. However, this is the best case. Here is the rst line of Lincolns Gettysburg Address, Fourscore and seven years ago our fathers brought forth on this continent.... , compressed and decompressed. With spaces between words eliminated and everything made lowercase, at quality=75 we get: 99

Computer Networks - Peterson and Davie - 4e Solution Manual

Încărcat de

Informații document

Descriere originală:

Titlu original

Drepturi de autor

Formate disponibile

Partajați acest document

Partajați sau inserați document

Opțiuni de partajare

Vi se pare util acest document?

Este necorespunzător acest conținut?

Drepturi de autor:

Formate disponibile

Computer Networks - Peterson and Davie - 4e Solution Manual

Încărcat de

Drepturi de autor:

Formate disponibile

Computer Networks -Peterson and Davie - 4e Solution Manual

Download and print this document

More From This User