Presentation is loading. Please wait.

Presentation is loading. Please wait.

1 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 Computer Networks, 5th Edition Getting Connected.

Published byLeslie Wilkerson Modified over 8 years ago

Similar presentations

Presentation on theme: "1 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 Computer Networks, 5th Edition Getting Connected."— Presentation transcript:

1 1 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 Computer Networks, 5th Edition Getting Connected

2 2 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.1 An end-user’s view of the Internet.

3 3 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.2 Electromagnetic spectrum.

4 4 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.3 Signals travel between signalling components; bits flow between adaptors.

5 5 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.4 NRZ encoding of a bit stream.

6 6 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.5 Different encoding strategies.

7 7 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.6 Bits flow between adaptors, frames between hosts.

8 8 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.7 BISYNC frame format.

9 9 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.8 PPP frame format.

10 10 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.9 DDCMP frame format.

11 11 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.10 HDLC frame format.

12 12 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.11 A SONET STS-1 frame.

13 13 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.12 Three STS-1 frames multiplexed onto one STS-3c frame.

14 14 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.13 SONET frames out of phase.

15 15 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.14 Two-dimensional parity.

16 16 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.15 CRC calculation using polynomial long division.

17 17 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.16 CRC calculation using shift register.

18 18 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 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.

19 19 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.18 Timeline for stop-and-wait with 1-bit sequence number.

20 20 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.19 Timeline for the sliding window algorithm.

21 21 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.20 Sliding window on sender.

22 22 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.21 Sliding window on receiver.

23 23 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.22 Ethernet transceiver and adaptor.

24 24 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.23 Ethernet repeater.

25 25 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.24 Ethernet hub.

26 26 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.25 Ethernet frame format.

27 27 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 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.

28 28 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.27 Example 4-bit chipping sequence.

29 29 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.28 A wireless network using a base station.

30 30 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.29 A wireless ad hoc or mesh network.

31 31 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 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.)

32 32 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 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.)

33 33 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.32 Access points connected to a distribution system.

34 34 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.33 Node mobility.

35 35 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.34 802.11 frame format.

36 36 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.35 A Bluetooth piconet.

37 37 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.36 Diagram for Exercise 1.

38 38 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.37 Diagram for Exercises 36 to 38.

Download ppt "1 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 Computer Networks, 5th Edition Getting Connected."

Similar presentations

Chapter 3 The Data Link Layer.

Chapter 3 The Data Link Layer.
The Data Link Layer Chapter 3. Data Link Layer Design Issues Services Provided to the Network Layer Framing Error Control Flow Control.

The Data Link Layer Chapter 3. Data Link Layer Design Issues Services Provided to the Network Layer Framing Error Control Flow Control.
1 Chapter 2 Agenda Announcements / updates Gayle Laakman McDowell, 10/11, 4:30pm, UW2-005 GUIs / IDEs for remotely accessing uw1-320-lab Other references.

1 Chapter 2 Agenda Announcements / updates Gayle Laakman McDowell, 10/11, 4:30pm, UW2-005 GUIs / IDEs for remotely accessing uw1-320-lab Other references.
Chapter 11 Data Link Control (DLC) Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

Chapter 11 Data Link Control (DLC) Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Error-Detecting Codes Calculation of the polynomial code checksum.

Error-Detecting Codes Calculation of the polynomial code checksum.
14.1 Chapter 14 Wireless LANs Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.

14.1 Chapter 14 Wireless LANs Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Spring 2002CS 4611 Outline Encoding Framing Error Detection Sliding Window Algorithm Point-to-Point Links.

Spring 2002CS 4611 Outline Encoding Framing Error Detection Sliding Window Algorithm Point-to-Point Links.
11-6 HDLC High-level Data Link Control (HDLC) is a bit-oriented protocol for communication over point-to-point and multipoint links. It implements the.

11-6 HDLC High-level Data Link Control (HDLC) is a bit-oriented protocol for communication over point-to-point and multipoint links. It implements the.
The Data Link Layer Chapter 3. Position of the data-link layer.

The Data Link Layer Chapter 3. Position of the data-link layer.
1 Outline Encoding Framing Error Detection Sliding Window Algorithm Point-to-Point Links.

1 Outline Encoding Framing Error Detection Sliding Window Algorithm Point-to-Point Links.
Spring 2003CS 4611 Outline Encoding Framing Error Detection Sliding Window Algorithm Point-to-Point Links.

Spring 2003CS 4611 Outline Encoding Framing Error Detection Sliding Window Algorithm Point-to-Point Links.
The Data Link Layer Chapter 3. Data Link Layer Design Issues Services Provided to the Network Layer Framing Error Control Flow Control.

The Data Link Layer Chapter 3. Data Link Layer Design Issues Services Provided to the Network Layer Framing Error Control Flow Control.
20101 The Data Link Layer Chapter 3. 20102 Design Issues Controls communication between 2 machines directly connected by “wire”-like link Services Provided.

20101 The Data Link Layer Chapter Design Issues Controls communication between 2 machines directly connected by “wire”-like link Services Provided.
Adapted from Tanenbaum's Slides for Computer Networking, 4e The Data Link Layer Chapter 3.

Adapted from Tanenbaum's Slides for Computer Networking, 4e The Data Link Layer Chapter 3.
ECE 4450:427/527 - Computer Networks Spring 2015

ECE 4450:427/527 - Computer Networks Spring 2015
CECS 474 Computer Network Interoperability Notes for Douglas E. Comer, Computer Networks and Internets (5 th Edition) Tracy Bradley Maples, Ph.D. Computer.

CECS 474 Computer Network Interoperability Notes for Douglas E. Comer, Computer Networks and Internets (5 th Edition) Tracy Bradley Maples, Ph.D. Computer.
CS 4396 Computer Networks Lab

CS 4396 Computer Networks Lab
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Data Link Control and Protocols.

McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Data Link Control and Protocols.
CHAPTER 2 HARDWARE BUILDING BLOCK ENCODING FRAMING ERROR DETECTION.

CHAPTER 2 HARDWARE BUILDING BLOCK ENCODING FRAMING ERROR DETECTION.
27-Oct-15Computer Networks1 Outline Chapter 2: Direct Link Networks Encoding Framing Error Detection Sliding Window Algorithm Point-to-Point Links.

27-Oct-15Computer Networks1 Outline Chapter 2: Direct Link Networks Encoding Framing Error Detection Sliding Window Algorithm Point-to-Point Links.

Similar presentations

Ads by Google