cs 3700
play

CS 3700 Networks and Distributed Systems Bridging (From Hub to - PowerPoint PPT Presentation

Feb 12, 2023 •201 likes •1.44k views

CS 3700 Networks and Distributed Systems Bridging (From Hub to Switch by Way of Tree) Revised 8/19/15 Just Above the Data Link Layer 2 Bridging How do we connect LANs? Application Function: Presentation Route packets

  1. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 AA 1 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  2. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 AA 1 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  3. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 AA 1 AA 1 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  4. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 AA 1 AA 1 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  5. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 AA 1 AA 1 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  6. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 � <Src=CC, Dest=AA> AA 1 AA 1 CC 2 CC 1 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  7. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 � <Src=CC, Dest=AA> AA 1 AA 1 CC 2 CC 1 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  8. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 � <Src=CC, Dest=AA> AA 1 AA 1 CC 2 CC 1 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  9. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 � <Src=CC, Dest=AA> AA 1 AA 1 CC 2 CC 1 � <Src=EE, Dest=CC> Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  10. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 � <Src=CC, Dest=AA> AA 1 AA 1 CC 2 CC 1 � <Src=EE, Dest=CC> EE 2 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  11. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 � <Src=CC, Dest=AA> AA 1 AA 1 CC 2 CC 1 � <Src=EE, Dest=CC> EE 2 EE 2 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  12. Complicated Learning Example 11 � <Src=AA, Dest=FF> Bridge 1 Bridge 2 � <Src=CC, Dest=AA> AA 1 AA 1 CC 2 CC 1 � <Src=EE, Dest=CC> EE 2 EE 2 Port 1 Port 2 Port 1 Port 2 Hub Hub Hub AA BB CC DD EE FF

  13. The Danger of Loops 12 CC DD � <Src=AA, Dest=DD> Hub Port 2 Port 2 Port 1 Port 1 Hub AA BB

  14. The Danger of Loops 12 CC DD � <Src=AA, Dest=DD> Hub Port 2 Port 2 Port 1 Port 1 Hub AA BB

  15. The Danger of Loops 12 CC DD � <Src=AA, Dest=DD> Hub Port 2 Port 2 AA 1 AA 1 Port 1 Port 1 Hub AA BB

  16. The Danger of Loops 12 CC DD � <Src=AA, Dest=DD> Hub Port 2 Port 2 AA 1 AA 1 Port 1 Port 1 Hub AA BB

  17. The Danger of Loops 12 CC DD � <Src=AA, Dest=DD> Hub Port 2 Port 2 AA 1 AA 1 Port 1 Port 1 Hub AA BB

  18. The Danger of Loops 12 CC DD � <Src=AA, Dest=DD> Hub Port 2 Port 2 AA AA 1 2 AA 1 AA 2 Port 1 Port 1 Hub AA BB

  19. The Danger of Loops 12 CC DD � <Src=AA, Dest=DD> Hub Port 2 Port 2 AA AA 1 2 AA 1 AA 2 Port 1 Port 1 Hub AA BB

  20. The Danger of Loops 12 CC DD � <Src=AA, Dest=DD> Hub Port 2 Port 2 AA AA 2 1 AA 1 AA 1 AA AA 2 1 Port 1 Port 1 Hub AA BB

  21. The Danger of Loops 12 CC DD � <Src=AA, Dest=DD> � This continues to infinity � How do we stop this? Hub Port 2 Port 2 AA AA 1 2 AA 1 AA 1 AA AA 2 1 Port 1 Port 1 Hub AA BB

  22. The Danger of Loops 12 CC DD � <Src=AA, Dest=DD> � This continues to infinity � How do we stop this? Hub � Remove loops from the topology Port 2 Port 2 � Without physically unplugging AA AA 2 1 AA 1 AA 1 AA AA 2 1 cables Port 1 Port 1 � 802.1 uses an algorithm to Hub build and maintain a spanning tree for routing AA BB

  23. Spanning Tree Definition 13 1 2 3 5 4 6 7

  24. Spanning Tree Definition 13 1 1 2 3 5 4 4 6 7

  25. Spanning Tree Definition 13 1 1 2 3 5 5 4 4 6 7

  26. Spanning Tree Definition 13 1 1 2 2 3 5 5 4 4 6 6 7

  27. Spanning Tree Definition 13 1 1 2 2 3 3 5 5 4 4 6 6 7 7

  28. Spanning Tree Definition 13 � A subset of edges in a graph that: � Span all nodes � Do not create any cycles � This structure is a tree 1 1 2 2 3 3 5 5 4 4 6 6 7 7

  29. Spanning Tree Definition 13 � A subset of edges in a graph that: � Span all nodes � Do not create any cycles � This structure is a tree 5 1 1 2 2 3 3 4 6 2 3 5 5 1 4 4 7 6 6 7 7

  30. Spanning Tree Poem 14 Algorhyme I think that I shall never see a graph more lovely than a tree. A tree whose crucial property is loop-free connectivity. A tree that must be sure to span so packet can reach every LAN. First, the root must be selected. By ID, it is elected. Least-cost paths from root are traced. In the tree, these paths are placed. A mesh is made by folks like me, then bridges find a spanning tree. - Radia Perlman

  31. 802.1 Spanning Tree Approach 15 Elect a bridge to be the root of the tree 1. Every bridge finds shortest path to the root 2. Union of these paths becomes the spanning tree 3.

  32. 802.1 Spanning Tree Approach 15 Elect a bridge to be the root of the tree 1. Every bridge finds shortest path to the root 2. Union of these paths becomes the spanning tree 3. � Bridges exchange Configuration Bridge Protocol Data Units (BPDUs) to build the tree � Used to elect the root bridge � Locate the next hop closest to the root, and its port � Select ports to be included in the spanning trees

  33. Definitions 16 � Bridge ID (BID) = <Random Number> � Root Bridge: bridge with the lowest BID in the tree � Path Cost: cost (in hops) from a transmitting bridge to the root � Each port on a bridge has a unique Port ID � Root Port: port that forwards to the root on each bridge � Designated Bridge: the bridge on a LAN that provides the minimal cost path to the root � The designated bridge on each LAN is unique

  34. Determining the Root 17 � Initially, all hosts assume they are the root � Bridges broadcast BPDUs: Root ID Path Cost to Root Bridge ID � Based on received BPDUs, each switch chooses: � A new root (smallest known Root ID) � A new root port (what interface goes towards the root) � A new designated bridge (who is the next hop to root)

  35. Comparing BPDUs 18 BPDU1 BPDU2 R1 Cost1 B1 R2 Cost2 B2 if R1 < R2: use BPDU1 else if R1 == R2 and Cost1 < Cost2: use BPDU1 else if R1 == R2 and Cost1 == Cost 2 and B1 < B2: use BPDU1 else: use BPDU2

  36. Comparing BPDUs 18 BPDU1 BPDU2 R1 Cost1 B1 R2 Cost2 B2 if R1 < R2: use BPDU1 else if R1 == R2 and Cost1 < Cost2: use BPDU1 else if R1 == R2 and Cost1 == Cost 2 and B1 < B2: use BPDU1 else: use BPDU2

  37. Comparing BPDUs 18 BPDU1 BPDU2 R1 Cost1 B1 R2 Cost2 B2 if R1 < R2: use BPDU1 else if R1 == R2 and Cost1 < Cost2: use BPDU1 else if R1 == R2 and Cost1 == Cost 2 and B1 < B2: use BPDU1 else: use BPDU2

  38. Comparing BPDUs 18 BPDU1 BPDU2 R1 Cost1 B1 R2 Cost2 B2 if R1 < R2: use BPDU1 else if R1 == R2 and Cost1 < Cost2: use BPDU1 else if R1 == R2 and Cost1 == Cost 2 and B1 < B2: use BPDU1 else: use BPDU2

  39. Comparing BPDUs 18 BPDU1 BPDU2 R1 Cost1 B1 R2 Cost2 B2 if R1 < R2: use BPDU1 else if R1 == R2 and Cost1 < Cost2: use BPDU1 else if R1 == R2 and Cost1 == Cost 2 and B1 < B2: use BPDU1 else: use BPDU2

  40. Spanning Tree Construction 19 3: 3/0 0: 0/0 12: 12/0 41: 41/0 27: 27/0 68: 68/0 9: 9/0

  41. Spanning Tree Construction 19 3: 3/0 0: 0/0 12: 12/0 12: 0/1 27: 0/1 41: 41/0 27: 27/0 68: 68/0 9: 9/0

  42. Spanning Tree Construction 19 3: 3/0 0: 0/0 12: 12/0 12: 0/1 41: 3/1 27: 0/1 41: 41/0 27: 27/0 68: 68/0 9: 9/0

  43. Spanning Tree Construction 19 3: 3/0 0: 0/0 12: 12/0 12: 0/1 41: 3/1 27: 0/1 41: 41/0 27: 27/0 68: 9/1 68: 68/0 9: 9/0

  44. Spanning Tree Construction 19 3: 3/0 0: 0/0 12: 12/0 12: 0/1 41: 3/1 27: 0/1 41: 41/0 27: 27/0 68: 9/1 68: 3/2 9: 3/2 68: 68/0 9: 9/0

  45. Spanning Tree Construction 19 3: 0/2 3: 3/0 0: 0/0 12: 12/0 12: 0/1 41: 3/1 27: 0/1 41: 41/0 41: 0/2 27: 27/0 68: 3/2 68: 9/1 9: 3/2 68: 68/0 9: 9/0

  46. Spanning Tree Construction 19 3: 3/0 3: 0/2 0: 0/0 12: 12/0 12: 0/1 41: 3/1 27: 0/1 41: 41/0 41: 0/2 27: 27/0 68: 9/1 68: 3/2 68: 0/3 9: 3/2 9: 0/3 68: 68/0 9: 9/0

  47. Spanning Tree Construction 19 3: 3/0 3: 0/2 0: 0/0 12: 12/0 12: 0/1 41: 3/1 27: 0/1 41: 41/0 41: 0/2 27: 27/0 68: 9/1 68: 3/2 68: 0/3 9: 3/2 9: 0/3 68: 68/0 9: 9/0

  48. Designated Bridges 20 � Ultimately, each bridge must decide to enable or disable each port � Reasons to keep a port enabled: You receive no BPDUs on that port 1. ■ Indicates there are no other bridges 0 The port is a root port 2. ■ You need to be able to forward packets to the root of the spanning tree You are the designated bridge for that LAN 3. 9 27 ■ All other bridges on that LAN have a longer path to the root, or their bridge ID is higher than yours

  49. Designated Bridges 20 � Ultimately, each bridge must decide to ? enable or disable each port � Reasons to keep a port enabled: You receive no BPDUs on that port 1. ■ Indicates there are no other bridges 0 The port is a root port 2. ■ You need to be able to forward packets to the root of the spanning tree You are the designated bridge for that LAN 3. 9 27 ■ All other bridges on that LAN have a longer path to the root, or their bridge ID is higher than yours

  50. Designated Bridges 20 � Ultimately, each bridge must decide to ? enable or disable each port On, 1 � Reasons to keep a port enabled: You receive no BPDUs on that port 1. ■ Indicates there are no other bridges 0 The port is a root port 2. ■ You need to be able to forward packets to the root of the spanning tree You are the designated bridge for that LAN 3. 9 27 ■ All other bridges on that LAN have a longer path to the root, or their bridge ID is higher than yours

  51. Designated Bridges 20 � Ultimately, each bridge must decide to ? enable or disable each port On, 1 � Reasons to keep a port enabled: You receive no BPDUs on that port 1. ■ Indicates there are no other bridges 0 The port is a root port 2. ■ You need to be able to forward packets to the root of the spanning tree You are the designated bridge for that LAN 3. ? 9 27 ■ All other bridges on that LAN have a longer path ? to the root, or their bridge ID is higher than yours

  52. Designated Bridges 20 � Ultimately, each bridge must decide to ? enable or disable each port On, 1 � Reasons to keep a port enabled: You receive no BPDUs on that port 1. ■ Indicates there are no other bridges 0 The port is a root port 2. ■ You need to be able to forward packets to the root of the spanning tree You are the designated bridge for that LAN 3. ? 9 27 ■ All other bridges on that LAN have a longer path On, 2 ? On, 2 to the root, or their bridge ID is higher than yours

  53. Designated Bridges 20 � Ultimately, each bridge must decide to ? enable or disable each port On, 1 � Reasons to keep a port enabled: ? ? You receive no BPDUs on that port 1. ■ Indicates there are no other bridges 0 The port is a root port 2. ■ You need to be able to forward packets to the root of the spanning tree You are the designated bridge for that LAN 3. ? 9 27 ■ All other bridges on that LAN have a longer path On, 2 ? On, 2 to the root, or their bridge ID is higher than yours

Recommend

CS 3700 Networks and Distributed Systems Logistics (a.k.a. The boring slides) Revised

CS 3700 Networks and Distributed Systems Logistics (a.k.a. The boring slides) Revised

CS 3700 Networks and Distributed Systems Logistics (a.k.a. The boring slides) Revised 1/5/2020 Hello! 2 Welcome to CS 3700 Are you in the right classroom? Okay, good. Who am I? Professor Alden Jackson

861 views • 29 slides
CS 3700 Networks and Distributed Systems NAT (You Better Forward Those Ports) Revised

CS 3700 Networks and Distributed Systems NAT (You Better Forward Those Ports) Revised

CS 3700 Networks and Distributed Systems NAT (You Better Forward Those Ports) Revised 10/7/16 The IPv4 Shortage 2 Problem: consumer ISPs typically only give one IP address per-household Additional IPs cost extra More IPs may not

1.03k views • 53 slides
CS 3700 Networks and Distributed Systems Overlay Networks (P2P DHT via KBR FTW) Revised

CS 3700 Networks and Distributed Systems Overlay Networks (P2P DHT via KBR FTW) Revised

CS 3700 Networks and Distributed Systems Overlay Networks (P2P DHT via KBR FTW) Revised 10/26/2016 Outline 2 Consistent Hashing Structured Overlays / DHTs Key/Value Storage Service 3 Imagine a simple service that stores

1.8k views • 177 slides
CS 3700 Networks and Distributed Systems Internet Architecture (Layer cake and an hourglass)

CS 3700 Networks and Distributed Systems Internet Architecture (Layer cake and an hourglass)

CS 3700 Networks and Distributed Systems Internet Architecture (Layer cake and an hourglass) Revised 1/08/2020 Last class recap... 2 This is not a history course Communication is fundamental to human nature Key concepts have

1.91k views • 131 slides
H1 / Q2-FY19 Earnings Presentation At a Glance 2 One of the largest content houses with 3700+

H1 / Q2-FY19 Earnings Presentation At a Glance 2 One of the largest content houses with 3700+

SHEMAROO ENTERTAINMENT LIMITED H1 / Q2-FY19 Earnings Presentation At a Glance 2 One of the largest content houses with 3700+ Offering content to most Bollywood services across Over 55 years experience as a Household Media Brand content

402 views • 18 slides
CS 3700 Networks and Distributed Systems P2P and BitTorrent (Why is Lars Ulrich So Angry?)

CS 3700 Networks and Distributed Systems P2P and BitTorrent (Why is Lars Ulrich So Angry?)

CS 3700 Networks and Distributed Systems P2P and BitTorrent (Why is Lars Ulrich So Angry?) Revised 10/21/16 Traditional Internet Services Model 2 Client-server Many clients, 1 (or more) server(s) Web servers, DNS, file

2.25k views • 190 slides
Laurie Adelhardt | ag@owlcreek.net | 410.705.3700 Susanne Zilberfarb | susanne@hammondmedia.com |

Laurie Adelhardt | ag@owlcreek.net | 410.705.3700 Susanne Zilberfarb | susanne@hammondmedia.com |

Laurie Adelhardt | ag@owlcreek.net | 410.705.3700 Susanne Zilberfarb | susanne@hammondmedia.com | 410.430.2613 GOAL: Introduce the face behind the farm to build consumer trust in Maryland farming. www.mymdfarmers.com @mymdfarmers

657 views • 26 slides
ANALYSIS OF CREDIT PORTFOLIO FCERA May 2014 SEATTLE | 206.622.3700 LOS ANGELES | 310.297.1777

ANALYSIS OF CREDIT PORTFOLIO FCERA May 2014 SEATTLE | 206.622.3700 LOS ANGELES | 310.297.1777

ANALYSIS OF CREDIT PORTFOLIO FCERA May 2014 SEATTLE | 206.622.3700 LOS ANGELES | 310.297.1777 www.wurts.com E X E C U T I V E S U M M A R Y Since the asset liability study was presented in mid-2013, spreads for High Yield (HY) and

308 views • 9 slides
REAL EST REAL ESTATE TE Over Rs.100,000 CR. Rs. 3700 cr. Sales recorded Estimated revenue

REAL EST REAL ESTATE TE Over Rs.100,000 CR. Rs. 3700 cr. Sales recorded Estimated revenue

THE ONE OF INDIAS INCREDIBLE GROWTH STORY Over 130 lacs sq. ft. Over 100 lacs sq. ft. of projects delivered of area under development REAL EST REAL ESTATE TE Over Rs.100,000 CR. Rs. 3700 cr. Sales recorded Estimated revenue potential

745 views • 47 slides
Community Arts Advisory Committee Meeting #1 July 15, 2019 | 6:30 8:30 p.m. 3700 South Four

Community Arts Advisory Committee Meeting #1 July 15, 2019 | 6:30 8:30 p.m. 3700 South Four

Community Arts Advisory Committee Meeting #1 July 15, 2019 | 6:30 8:30 p.m. 3700 South Four Mile Run Drive agenda INTRODUCTIONS MOVING FORWARD Welcome Story Circle Introductions Interview Findings Planning the Work

490 views • 27 slides
Community Arts Advisory Committee Meeting #3 August 29, 2019 | 6:30 8:30 p.m. 3700 South

Community Arts Advisory Committee Meeting #3 August 29, 2019 | 6:30 8:30 p.m. 3700 South

Community Arts Advisory Committee Meeting #3 August 29, 2019 | 6:30 8:30 p.m. 3700 South Four Mile Run Drive agenda INTRODUCTIONS 5 minutes MOVING FORWARD 90 minutes Subcommittee Report Out (Scenic Welcome Shop/Costume

535 views • 26 slides
CS 3700 Networks and Distributed Systems Inter Domain Routing (Its all about the Money)

CS 3700 Networks and Distributed Systems Inter Domain Routing (Its all about the Money)

CS 3700 Networks and Distributed Systems Inter Domain Routing (Its all about the Money) Revised 10/03/19 Network Layer, Control Plane 2 Function: Set up routes between networks Data Plane Key challenges: Application

942 views • 66 slides
CS 3700 Networks and Distributed Systems Intro to Distributed Systems Revised 10/01/15

CS 3700 Networks and Distributed Systems Intro to Distributed Systems Revised 10/01/15

CS 3700 Networks and Distributed Systems Intro to Distributed Systems Revised 10/01/15 Application Layer 2 Function: Application Whatever you want Presentation Implement your app using the network Session Key challenges:

862 views • 32 slides
Real Assets Outlook Table of contents VERUSINVESTMENTS.COM SEATTLE 206-622-3700 LOS ANGELES

Real Assets Outlook Table of contents VERUSINVESTMENTS.COM SEATTLE 206-622-3700 LOS ANGELES

JULY 2017 Real Assets Outlook Table of contents VERUSINVESTMENTS.COM SEATTLE 206-622-3700 LOS ANGELES 310-297-1777 SAN FRANCISCO 415-362-3484 Executive summary 3 U.S. economics - Inflation 6 Outlook summary 7 Current conditions and 10

647 views • 36 slides
The Cottages-3700 Cedar Hill Road Dawson Heights Housing Ltd. Neighbourhood Association Meeting-

The Cottages-3700 Cedar Hill Road Dawson Heights Housing Ltd. Neighbourhood Association Meeting-

The Cottages-3700 Cedar Hill Road Dawson Heights Housing Ltd. Neighbourhood Association Meeting- January 11, 2018 1. Project Overview 2. About the Applicant 3. Site Context Presentation 4. Planning Framework &amp; Policies Outline 5.

279 views • 17 slides
Community Arts Advisory Committee Meeting #2 August 8, 2019 | 6:30 8:30 p.m. 3700 South

Community Arts Advisory Committee Meeting #2 August 8, 2019 | 6:30 8:30 p.m. 3700 South

Community Arts Advisory Committee Meeting #2 August 8, 2019 | 6:30 8:30 p.m. 3700 South Four Mile Run Drive agenda INTRODUCTIONS 20 minutes MOVING FORWARD 85 minutes Welcome Overview of Tools &amp; Models Introductions

160 views • 15 slides
CS 3700 Networks and Distributed Systems Crash Course in C Sockets (Prepare yourself for

CS 3700 Networks and Distributed Systems Crash Course in C Sockets (Prepare yourself for

CS 3700 Networks and Distributed Systems Crash Course in C Sockets (Prepare yourself for Project 1) Revised 8/19/15 Socket Programming 2 Goal: familiarize yourself with socket programming Why am I presenting C sockets? Because

823 views • 49 slides
How we treat Cruise Ship` Diamond Princess` with 3700 passengers Ichiro Takeuchi Chief Professor

How we treat Cruise Ship` Diamond Princess` with 3700 passengers Ichiro Takeuchi Chief Professor

How we treat Cruise Ship` Diamond Princess` with 3700 passengers Ichiro Takeuchi Chief Professor Yokohama City University E-mail itake@myad.jp Japanese Corona(+) 1 st case In Japan COVID-19 1 st case was January 16 and then, we have made

723 views • 29 slides
CS 3700 Networks and Distributed Systems Data Link (The Etherknot Notwork) Revised 9/14/16

CS 3700 Networks and Distributed Systems Data Link (The Etherknot Notwork) Revised 9/14/16

CS 3700 Networks and Distributed Systems Data Link (The Etherknot Notwork) Revised 9/14/16 Data Link Layer 2 Function: Send blocks of data (frames) between Application physical devices Regulate access to the physical media

2.65k views • 195 slides
CS 3700 Networks and Distributed Systems Network Layer (Putting the Net in Internet) Revised

CS 3700 Networks and Distributed Systems Network Layer (Putting the Net in Internet) Revised

CS 3700 Networks and Distributed Systems Network Layer (Putting the Net in Internet) Revised 10/3/19 Network Layer 2 Function: Route packets end-to-end on a Application network, through multiple hops Key challenge:

2.19k views • 172 slides
CS 3700 Networks and Distributed Systems Time and Logical Clocks Revised 3/24/16 Global

CS 3700 Networks and Distributed Systems Time and Logical Clocks Revised 3/24/16 Global

CS 3700 Networks and Distributed Systems Time and Logical Clocks Revised 3/24/16 Global Time 2 In practice, we act like there is a global notion of time But, time is relative Einstein showed speed of light constant for all

1.15k views • 49 slides
CS 3700 Networks and Distributed Systems Physical Layer (The layer for EE majors) Revised

CS 3700 Networks and Distributed Systems Physical Layer (The layer for EE majors) Revised

CS 3700 Networks and Distributed Systems Physical Layer (The layer for EE majors) Revised 8/19/15 Physical Layer 2 Function: Get bits across a physical medium Application Key challenge: Presentation How to represent

589 views • 21 slides
CS 3700 Networks and Distributed Systems A Brief History of the Internet (Hint: Al Gore is

CS 3700 Networks and Distributed Systems A Brief History of the Internet (Hint: Al Gore is

CS 3700 Networks and Distributed Systems A Brief History of the Internet (Hint: Al Gore is not involved) Revised 9/5/19 What is a Communications Network? 2 What is a Communications Network? 2 Pair up with a neighbor (or two)

810 views • 57 slides
The Photometric Performance of NICMOS L. Colina 1 Space Telescope Science Institute, 3700 San

The Photometric Performance of NICMOS L. Colina 1 Space Telescope Science Institute, 3700 San

1997 HST Calibration Workshop Space Telescope Science Institute, 1997 S. Casertano, et al., eds. The Photometric Performance of NICMOS L. Colina 1 Space Telescope Science Institute, 3700 San Martin Drive, MD 21218 M.J. Rieke University of

483 views • 10 slides

More recommend