24小时热门版块排行榜

>论坛更新日志 (2908)
>虫友互识 (676)
>文献求助 (148)
>导师招生 (132)
>休闲灌水 (129)
>考博 (122)
>教师之家 (78)
>硕博家园 (71)
>找工作 (70)
>博后之家 (69)
>论文投稿 (68)
>论文道贺祈福 (64)
>基金申请 (59)
>考研 (53)
>公派出国 (48)
>招聘信息布告栏 (31)

返回列表

当前主题已经存档。

xu301

应助: (幼儿园)
在线:
虫号: 226911

[交流] 计算机网络（第4版）习题答案（英文版）

COMPUTER NETWORKS
FOURTH EDITION
PROBLEM SOLUTIONS
ANDREW S. TANENBAUM
Vrije Universiteit
Amsterdam, The Netherlands
PRENTICE HALL PTR
UPPER SADDLE RIVER, NJ 07458

. 2003 Pearson Education, Inc.
Publishing as Prentice Hall PTR
Upper Saddle River, New Jersey 07458
All rights reserved. No part of this book may be reproduced, in any form or by any means,
without permission in writing from the publisher.
Printed in the United States of America
10 9 8 7 6 5 4 3 2 1
ISBN 0-13-046002-8
Pearson Education LTD.
Pearson Education Australia PTY, Limited
Pearson Education Singapore, Pte. Ltd.
Pearson Education North Asia Ltd.
Pearson Education Canada, Ltd.
Pearson Educación de Mexico, S.A. de C.V.
Pearson Education — Japan
Pearson Education Malaysia, Pte. Ltd.

PROBLEM SOLUTIONS 1
SOLUTIONS TO CHAPTER 1 PROBLEMS
1. The dog can carry 21 gigabytes, or 168 gigabits. A speed of 18 km/hour
equals 0.005 km/sec. The time to travel distance x km is x /0.005 = 200x sec,
yielding a data rate of 168/200x Gbps or 840/x Mbps. For x < 5.6 km, the
dog has a higher rate than the communication line.
2. The LAN model can be grown incrementally. If the LAN is just a long cable.
it cannot be brought down by a single failure (if the servers are replicated) It
is probably cheaper. It provides more computing power and better interactive
interfaces.
3. A transcontinental fiber link might have many gigabits/sec of bandwidth, but
the latency will also be high due to the speed of light propagation over
thousands of kilometers. In contrast, a 56-kbps modem calling a computer in
the same building has low bandwidth and low latency.
4. A uniform delivery time is needed for voice, so the amount of jitter in the network
is important. This could be expressed as the standard deviation of the
delivery time. Having short delay but large variability is actually worse than
a somewhat longer delay and low variability.
5. No. The speed of propagation is 200,000 km/sec or 200 meters/μsec. In 10
μsec the signal travels 2 km. Thus, each switch adds the equivalent of 2 km
of extra cable. If the client and server are separated by 5000 km, traversing
even 50 switches adds only 100 km to the total path, which is only 2%. Thus,
switching delay is not a major factor under these circumstances.
6. The request has to go up and down, and the response has to go up and down.
The total path length traversed is thus 160,000 km. The speed of light in air
and vacuum is 300,000 km/sec, so the propagation delay alone is
160,000/300,000 sec or about 533 msec.
7. There is obviously no single correct answer here, but the following points
seem relevant. The present system has a great deal of inertia (checks and balances)
built into it. This inertia may serve to keep the legal, economic, and
social systems from being turned upside down every time a different party
comes to power. Also, many people hold strong opinions on controversial
social issues, without really knowing the facts of the matter. Allowing poorly
reasoned opinions be to written into law may be undesirable. The potential
effects of advertising campaigns by special interest groups of one kind or
another also have to be considered. Another major issue is security. A lot of
people might worry about some 14-year kid hacking the system and falsifying
the results.

[ Last edited by 幻影无痕 on 2006-11-2 at 07:49 ]

回复此楼

» 猜你喜欢

1楼 2006-03-26 11:17:10

已阅回复此楼关注TA 给TA发消息送TA红花 TA的回帖

xu301

应助: (幼儿园)
在线:
虫号: 226911

2 PROBLEM SOLUTIONS FOR CHAPTER 1
8. Call the routers A, B, C, D, and E. There are ten potential lines: AB, AC,
AD, AE, BC, BD, BE, CD, CE, and DE. Each of these has four possibilities
(three speeds or no line), so the total number of topologies is 410 = 1,048,576.
At 100 ms each, it takes 104,857.6 sec, or slightly more than 29 hours to
inspect them all.
9. The mean router-router path is twice the mean router-root path. Number the
levels of the tree with the root as 1 and the deepest level as n. The path from
the root to level n requires n . 1 hops, and 0.50 of the routers are at this level.
The path from the root to level n . 1 has 0.25 of the routers and a length of
n . 2 hops. Hence, the mean path length, l, is given by
l = 0.5 × (n . 1) + 0.25 × (n . 2) + 0.125 × (n . 3) + . . .
or
l =
i =1
Σ ∞
n (0.5)i .
i =1
Σ ∞
i(0.5)i
This expression reduces to l = n . 2. The mean router-router path is thus
2n . 4.
10. Distinguish n + 2 events. Events 1 through n consist of the corresponding
host successfully attempting to use the channel, i.e., without a collision. The
probability of each of these events is p(1 . p)n . 1. Event n + 1 is an idle
channel, with probability (1 . p)n. Event n + 2 is a collision. Since these
n + 2 events are exhaustive, their probabilities must sum to unity. The probability
of a collision, which is equal to the fraction of slots wasted, is then just
1 . np(1 . p)n . 1 . (1 . p)n.
11. Among other reasons for using layered protocols, using them leads to breaking
up the design problem into smaller, more manageable pieces, and layering
means that protocols can be changed without affecting higher or lower ones,
12. No. In the ISO protocol model, physical communication takes place only in
the lowest layer, not in every layer.
13. Connection-oriented communication has three phases. In the establishment
phase a request is made to set up a connection. Only after this phase has been
successfully completed can the data transfer phase be started and data transported.
Then comes the release phase. Connectionless communication does
not have these phases. It just sends the data.
14. Message and byte streams are different. In a message stream, the network
keeps track of message boundaries. In a byte stream, it does not. For example,
suppose a process writes 1024 bytes to a connection and then a little later
writes another 1024 bytes. The receiver then does a read for 2048 bytes.
With a message stream, the receiver will get two messages, of 1024 bytes

PROBLEM SOLUTIONS FOR CHAPTER 1 3
each. With a byte stream, the message boundaries do not count and the
receiver will get the full 2048 bytes as a single unit. The fact that there were
originally two distinct messages is lost.
15. Negotiation has to do with getting both sides to agree on some parameters or
values to be used during the communication. Maximum packet size is one
example, but there are many others.
16. The service shown is the service offered by layer k to layer k + 1. Another
service that must be present is below layer k, namely, the service offered to
layer k by the underlying layer k . 1.
17. The probability, Pk , of a frame requiring exactly k transmissions is the probability
of the first k . 1 attempts failing, pk . 1, times the probability of the k-th
transmission succeeding, (1 . p). The mean number of transmission is then
just
k =1
Σ ∞
kPk =
k =1
Σ ∞
k(1 . p)pk . 1 =
1 . p
1 33333
18. (a) Data link layer. (b) Network layer.
19. Frames encapsulate packets. When a packet arrives at the data link layer, the
entire thing, header, data, and all, is used as the data field of a frame. The
entire packet is put in an envelope (the frame), so to speak (assuming it fits).
20. With n layers and h bytes added per layer, the total number of header bytes
per message is hn, so the space wasted on headers is hn. The total message
size is M + nh, so the fraction of bandwidth wasted on headers is
hn /(M + hn).
21. Both models are based on layered protocols. Both have a network, transport,
and application layer. In both models, the transport service can provide a
reliable end-to-end byte stream. On the other hand, they differ in several
ways. The number of layers is different, the TCP/IP does not have session or
presentation layers, OSI does not support internetworking, and OSI has both
connection-oriented and connectionless service in the network layer.
22. TCP is connection oriented, whereas UDP is a connectionless service.
23. The two nodes in the upper-right corner can be disconnected from the rest by
three bombs knocking out the three nodes to which they are connected. The
system can withstand the loss of any two nodes.
24. Doubling every 18 months means a factor of four gain in 3 years. In 9 years,
the gain is then 43 or 64, leading to 6.4 billion hosts. My intuition says that is
much too conservative, since by then probably every television in the world
and possibly billions of other appliances will be on home LANs connected to

4 PROBLEM SOLUTIONS FOR CHAPTER 1
the Internet. The average person in the developed world may have dozens of
Internet hosts by then.
25. If the network tends to lose packets, it is better to acknowledge each one
separately, so the lost packets can be retransmitted. On the other hand, if the
network is highly reliable, sending one acknowledgement at the end of the
entire transfer saves bandwidth in the normal case (but requires the entire file
to be retransmitted if even a single packet is lost).
26. Small, fixed-length cells can be routed through switches quickly, and completely
in hardware. Small, fixed-size cells also make it easier to build
hardware that handles many cells in parallel. Also, they do not block
transmission lines for very long, making it easier to provide quality-of-service
guarantees.
27. The speed of light in coax is about 200,000 km/sec, which is 200 meters/μsec.
At 10 Mbps, it takes 0.1 μsec to transmit a bit. Thus, the bit lasts 0.1 μsec in
time, during which it propagates 20 meters. Thus, a bit is 20 meters long
here.
28. The image is 1024 × 768 × 3 bytes or 2,359,296 bytes. This is 18,874,368
bits. At 56,000 bits/sec, it takes about 337.042 sec. At 1,000,000 bits/sec, it
takes about 18.874 sec. At 10,000,000 bits/sec, it takes about 1.887 sec. At
100,000,000 bits/sec, it takes about 0.189 sec.
29. Think about the hidden terminal problem. Imagine a wireless network of five
stations, A through E, such that each one is in range of only its immediate
neighbors. Then A can talk to B at the same time D is talking to E. Wireless
networks have potential parallelism, and in this way differ from Ethernet.
30. One disadvantage is security. Every random delivery man who happens to be
in the building can listen in on the network. Another disadvantage is reliability.
Wireless networks make lots of errors. A third potential problem is battery
life, since most wireless devices tend to be mobile.
31. One advantage is that if everyone uses the standard, everyone can talk to
everyone. Another advantage is that widespread use of any standard will give
it economies of scale, as with VLSI chips. A disadvantage is that the political
compromises necessary to achieve standardization frequently lead to poor
standards. Another disadvantage is that once a standard has been widely
adopted, it is difficult to change,, even if new and better techniques or
methods are discovered. Also, by the time it has been accepted, it may be
obsolete.
32. There are many examples, of course. Some systems for which there is international
standardization include compact disc players and their discs, Walkman
tape players and audio cassettes, cameras and 35mm film, and automated