Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Internetworking, Issues, Our Path - Lecture Slides | CMSC 150, Study notes of Computer Science

Material Type: Notes; Class: INTRODUCTN TO COMPUTING LAB; Subject: Computer Science; University: University of Richmond; Term: Fall 2008;

Typology: Study notes

Pre 2010

Uploaded on 08/18/2009

koofers-user-d8r
koofers-user-d8r 🇺🇸

10 documents

1 / 4

Toggle sidebar

This page cannot be seen from the preview

Don't miss anything!

bg1
1
Fall 2008 CMSC 150 1
Internetworking
Fall 2008 CMSC 150 2
Assumptions
Data pipe from every machine to every other
machine.
Need not be single link (and in most cases will
involve several links and several networks).
Pipe can lose or corrupt messages (think postal
system analogy – vast majority of time it arrives, but
not always).
So what info do we need to build a single
“logical” network (either reliable or
unreliable)?
Fall 2008 CMSC 150 3
Issues
Getting various technologies to work with one
another (I.e. creating a single “network” from
many heterogeneous systems).
Problem magnified since packet may need to
traverse several different networks (and network
technologies), each with their own addressing
schemes, service models, media access protocols,
etc.
Scale: It’s the big issue
How can you find an efficient path through a network
with millions (and perhaps billions eventually) of
nodes?
How do you provide addressing for a network with
this many nodes?
Fall 2008 CMSC 150 4
Our Path
The Internet Protocol (IP) Version 4
Routing
IPv6
Multicast The present set of slides.
Fall 2008 CMSC 150 5
Internetwork:
Arbitrary collection of possibly heterogeneous
networks interconnected to provide host-to-
host packet delivery service.
Network: Directly connected or switched
network that uses a single technology (i.e.
ATM, 802.5, Ethernet).
Could be many physical networks creating a single
logical network.
E.g. several Ethernet networks connected on a
university campus
Fall 2008 CMSC 150 6
Internetwork
Internet—THE internetwork.
Runs the Internet Protocol (Kahn-Cerf)
Interesting because it has faced the problems of
scale
internet—abstract internetwork
pf3
pf4

Partial preview of the text

Download Internetworking, Issues, Our Path - Lecture Slides | CMSC 150 and more Study notes Computer Science in PDF only on Docsity!

Fall 2008 CMSC 150 1

Internetworking

Fall 2008 CMSC 150 2

Assumptions

  • Data pipe from every machine to every other machine. - Need not be single link (and in most cases will involve several links and several networks). - Pipe can lose or corrupt messages (think postal system analogy – vast majority of time it arrives, but not always).
  • So what info do we need to build a single “logical” network (either reliable or unreliable)? Fall 2008 CMSC 150 3

Issues

  • Getting various technologies to work with one another (I.e. creating a single “network” from many heterogeneous systems). - Problem magnified since packet may need to traverse several different networks (and network technologies), each with their own addressing schemes, service models, media access protocols, etc.
  • Scale: It’s the big issue
    • How can you find an efficient path through a network with millions (and perhaps billions eventually) of nodes?
    • How do you provide addressing for a network with this many nodes? Fall 2008 CMSC 150 4

Our Path

  • The Internet Protocol (IP) Version 4
  • Routing
  • IPv
  • Multicast (^) The present set of slides. Fall 2008 CMSC 150 5

Internetwork:

  • Arbitrary collection of possibly heterogeneous networks interconnected to provide host-to- host packet delivery service.
  • Network: Directly connected or switched network that uses a single technology (i.e. ATM, 802.5, Ethernet). - Could be many physical networks creating a single logical network. - E.g. several Ethernet networks connected on a university campus Fall 2008 CMSC 150 6

Internetwork

  • Internet—THE internetwork.
    • Runs the Internet Protocol (Kahn-Cerf)
    • Interesting because it has faced the problems of scale
  • internet—abstract internetwork

Fall 2008 CMSC 150 7

IP Internet

  • Concatenation of Networks Note Hn denotes host, Rn denotes router. Fall 2008 CMSC 150 8

IP Internet

  • Protocol Stack R ETH FDDI IP IP ETH TCP (^) R FDDI PPP IP R PPP ETH IP H IP ETH TCP H Fall 2008 CMSC 150 9

The Internet

Outline Best Effort Service Model Global Addressing Scheme Fall 2008 CMSC 150 10

Service Model

  • Connectionless (datagram-based)
    • So each packet must be “self-contained”
  • Best-effort delivery (unreliable service) - packets are lost - packets are delivered out of order - duplicate copies of a packet are delivered (?!) - packets can be delayed for a long time Fall 2008 CMSC 150 11

Why?!

  • Best Effort service model is as simple a model as you could want, and this is a strong point! - If you provide best effort service over a network technology that provides reliable delivery, you’re fine - If you provide reliable delivery over a network technology that is unreliable, then you’ve got a problem: you need lots of extra functionality in the routers to handle the network deficiencies, and keeping the routers as simple as possible was an IP design goal. (Why?)
  • Note: IP today runs over many technologies that were not in existence when IP was invented! Fall 2008 CMSC 150 12

IP Datagram Format

V ersion HLen TOS Length Ident Flags Offset TTL Protocol Checksum SourceAddr DestinationAddr Options (variable) (^) (variable)Pad 0 4 8 16 19 31 Data In 32 bit words In bytes Note: fields aligned on 32 bit boundaries

Fall 2008 CMSC 150 19

IP Internet

Note Hn denotes host, Rn denotes router. Routers need two All hosts on same^ IP addresses. network have same network part of IP address Fall 2008 CMSC 150 20

Terminology

  • Routing Mechanism: How a router selects the link over which to forward a packet
  • Routing Protocol: Policies that determine what is placed in the routing tables. These are not the same thing! Fall 2008 CMSC 150 21

Datagram Forwarding

  • Strategy
    • every datagram contains destination’s address
    • if directly connected to destination network, then forward to host
    • if not directly connected to destination network, then forward to some router
    • forwarding table maps network number into next hop
    • each host has a default router
    • each router maintains a forwarding table
  • Example (R2) Network Number Next Hop 1 R 2 R 3 interface 1 4 interface 0 Fall 2008 CMSC 150 22

Recall:

R R H H H1 H2 H Network 2 (Ethernet) Network 1 (Ethernet) H Network 3 (FDDI) (point-to-point)^ Network 4 H7 R3 H Fall 2008 CMSC 150 23

Pseudocode

if (networknum dest = networknum my interface) deliver packet over that interface else if (networknum in my routing table) deliver packet to next hop router else deliver packet to default router