Chapter 2 Getting Connected - Elsevier · 2011-03-04 · Copyright © 2012, Elsevier Inc. All...

1Copyright © 2012, Elsevier Inc. All rights Reserved

Chapter 2

Computer Networks, 5th Edition

Getting Connected


FIGURE 2.1 An end-user’s view of the Internet.


FIGURE 2.2 Electromagnetic spectrum.


FIGURE 2.3 Signals travel between signalling components; bits flow between adaptors.


FIGURE 2.4 NRZ encoding of a bit stream.


FIGURE 2.5 Different encoding strategies.


FIGURE 2.6 Bits flow between adaptors, frames between hosts.


FIGURE 2.7 BISYNC frame format.


FIGURE 2.8 PPP frame format.


FIGURE 2.9 DDCMP frame format.


FIGURE 2.10 HDLC frame format.


FIGURE 2.11 A SONET STS-1 frame.


FIGURE 2.12 Three STS-1 frames multiplexed onto one STS-3c frame.


FIGURE 2.13 SONET frames out of phase.


FIGURE 2.14 Two-dimensional parity.


FIGURE 2.15 CRC calculation using polynomial long division.


FIGURE 2.16 CRC calculation using shift register.


FIGURE 2.17 Timeline showing four different scenarios for the stop-and-wait algorithm. (a) The ACK is received before the timer expires; (b) the original frame is lost; (c) the ACK is lost; (d) the timeout fires too soon.


FIGURE 2.18 Timeline for stop-and-wait with 1-bit sequence number.


FIGURE 2.19 Timeline for the sliding window algorithm.


FIGURE 2.20 Sliding window on sender.


FIGURE 2.21 Sliding window on receiver.


FIGURE 2.22 Ethernet transceiver and adaptor.


FIGURE 2.23 Ethernet repeater.


FIGURE 2.24 Ethernet hub.


FIGURE 2.25 Ethernet frame format.


FIGURE 2.26 Worst-case scenario: (a) A sends a frame at time t; (b) A’s frame arrives at B at time t + d; (c) B begins transmitting at time t + d and collides with A’s frame; (d) B’s runt (32-bit) frame arrives at A at time t + 2d.


FIGURE 2.27 Example 4-bit chipping sequence.


FIGURE 2.28 A wireless network using a base station.


FIGURE 2.29 A wireless ad hoc or mesh network.


FIGURE 2.30 The hidden node problem. Although A and C are hidden from each other, their signals can collide at B. (B’s reach is not shown.)


FIGURE 2.31 The exposed node problem. Although B and C are exposed to each other’s signals, there is no interference if B transmits to A while C transmits to D. (A and D’s reaches are not shown.)


FIGURE 2.32 Access points connected to a distribution system.


FIGURE 2.33 Node mobility.


FIGURE 2.34 802.11 frame format.


FIGURE 2.35 A Bluetooth piconet.


FIGURE 2.36 Diagram for Exercise 1.


FIGURE 2.37 Diagram for Exercises 36 to 38.

Chapter 2 Getting Connected - Elsevier · 2011-03-04 · Copyright © 2012, Elsevier Inc. All...

Documents

Transcript of Chapter 2 Getting Connected - Elsevier · 2011-03-04 · Copyright © 2012, Elsevier Inc. All...