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

Slides:



Advertisements
Similar presentations
Chapter 3 The Data Link Layer.
Advertisements

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.
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.
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.
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.
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.
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 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.
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.
CS 4396 Computer Networks Lab
McGraw-Hill©The McGraw-Hill Companies, Inc., 2004 Data Link Control and Protocols.
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.
The data link layer. Data Link Layer Design Issues Services Provided to the Network Layer Framing Error Control Flow Control.
The Data Link Layer. Functions of the Data Link Layer Provide service interface to the network layer Dealing with transmission errors Error detection.
The Data Link Layer Chapter 3 10/28/2015www.noteshit.com1.
1 Other LANs Token Rings Wireless –Wireless LAN (802.11, WiFi) –Broadband Wireless (802.16) –Bluetooth.
1 CHAPTER 2 HARDWARE BUILDING BLOCK ENCODING FRAMING ERROR DETECTION.
Spring 2001CS 5851 Outline Building Blocks Shannon’s Theorem Encoding 11. Physical Layer.
Ch 14. Wireless LANs IEEE Specification for a wireless LAN – Cover physical and data link layers Basic service sets (BSS) and extended service.
9-Jan-164/598N: Computer Networks Overview Performance metrics - Section 1.5 Direct link networks –Hardware building blocks - Section 2.1 –Encoding - Section.
The Data Link Layer Chapter 3 1/21/2016www.ishuchita.com1.
1 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 5 End-to-End Protocols Computer Networks, 5th Edition.
Computer Networks, Fifth Edition by Andrew Tanenbaum and David Wetherall, © Pearson Education-Prentice Hall, 2011 The Data Link Layer Chapter 3.
CS440 Computer Networks 1 Wireless LAN (IEEE ) Neil Tang 10/01/2008.
1 Computer Networks: A Systems Approach, 5e Larry L. Peterson and Bruce S. Davie Chapter 2 Getting Connected Copyright © 2010, Elsevier Inc. All rights.
The Data Link Layer RIS 251 Dr. ir. S.S. Msanjila.
The Data Link Layer Chapter
The University of Adelaide, School of Computer Science
The University of Adelaide, School of Computer Science
Underlying Technology
The University of Adelaide, School of Computer Science
Chapter 3 – Part 2 The Data Link Layer.
EEC-484/584 Computer Networks
Point-to-Point Links Outline Encoding Framing Error Detection
Copyright © 2016 Elsevier Inc. All rights reserved.
Copyright © 2012, Elsevier Inc. All rights Reserved.
Chapter 11.
EEC-484/584 Computer Networks
Copyright © 2012, Elsevier Inc. All rights Reserved.
Copyright © 2013 Elsevier Inc. All rights reserved.
Copyright © 2012, Elsevier Inc. All rights Reserved.
Chapter 10.
Copyright © 2012, Elsevier Inc. All rights Reserved.
Copyright © 2013 Elsevier Inc. All rights reserved.
Copyright © 2013 Elsevier Inc. All rights reserved.
© 2012 Elsevier, Inc. All rights reserved.
Modeling Text-Based Requirements and their Relationship to Design
Modeling Functionality with Use Cases
Ethernet 16EC351 Computer networks unit II Mr.M.Jagadesh,AP/ECE.
Copyright © 2012, Elsevier Inc. All rights Reserved.
Chapter 12.
Chapter 6.
Copyright © 2012, Elsevier Inc. All rights Reserved.
© 2012 Elsevier, Inc. All rights reserved.
Chapter 01.
Copyright © 2013 Elsevier Inc. All rights reserved.
Copyright © 2012, Elsevier Inc. All rights Reserved.
Chapter 15 Contraception
Copyright © 2013 Elsevier Inc. All rights reserved.
Chapter 15.
Chapter 20 Assisted Reproductive Technologies
Chapter 3.
Presentation transcript:

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.18 Timeline for stop-and-wait with 1-bit sequence number.

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

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

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

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

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

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

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

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 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.27 Example 4-bit chipping sequence.

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

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

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 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 Copyright © 2012, Elsevier Inc. All rights Reserved Chapter 2 FIGURE 2.32 Access points connected to a distribution system.

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

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

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

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

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

Feedback: Privacy Policy Feedback
Do Not Sell My Personal Information
About project: SlidePlayer Terms of Service

© 2025 SlidePlayer.com. Inc. All rights reserved.