CS 105 “Tour of the Black Holes of Computing”

Slides:



Advertisements
Similar presentations
Programming with UDP – I Covered Subjects: IPv4 Socket Address Structure Byte Ordering Functions Address Access/Conversion Functions Functions: 1.socket()
Advertisements

Carnegie Mellon 1 Internetworking : Introduction to Computer Systems 19 th Lecture, Oct. 28, 2010 Instructors: Randy Bryant and Dave O’Hallaron.
Quick Overview. 2 ISO/OSI Reference Model Application Application Presentation Presentation Session Session Transport Transport Network Network Data Link.
Networks and Network Programming June 2, 2008 Topics Client-server programming model Networks A programmer’s view of the Internet.
Internetworking Nov 19, 2002 Topics Client-server programming model Networks Internetworks Global IP Internet IP addresses Domain names Connections class25.ppt.
1 Socket Interfaces Professor Jinhua Guo CIS527 Fall 2003.
Client Server Model The client machine (or the client process) makes the request for some resource or service, and the server machine (the server process)
1 Advanced Name and Address Conversions getaddrinfo, getnameinfo, gai_strerror, freeaddrinfo host_serv, tcp_connect, tcp_listen, udp_client, udp_connect,
Chris Riesbeck, Fall 2007 Internetworking Topics –Client-server programming model –Networks –Internetworks –Global IP Internet IP addresses Domain names.
Internetworking Topics Client-server programming model Networks Internetworks Global IP Internet IP addresses Domain names Connections CS 105 “Tour of.
Operating Systems Chapter 9 Distributed Communication.
CS 105 “Tour of the Black Holes of Computing”
Socket Programming. Introduction Sockets are a protocol independent method of creating a connection between processes. Sockets can be either – Connection.
Client-Side Network Programming
Class A Addresses The 1 st bit of a class A address is 0 The 1 st byte has a value from (128.x.x.x would not be a class A) 127.x.x.x is reserved.
Week 13 - Monday.  What did we talk about last time?  Low level file I/O practice  File systems.
Carnegie Mellon Internetworking /18-213: Introduction to Computer Systems 20 th Lecture, March 31st, 2015 Instructors: Franz Franchetti, Seth Goldstein,
1 Networking Chapter Distributed Capabilities Communications architectures –Software that supports a group of networked computers Network operating.
Carnegie Mellon 1 Internetworking / : Introduction to Computer Systems 20 th Lecture, July 10, 2014 Instructors: Greg Kesden.
Carnegie Mellon Introduction to Computer Systems /18-243, fall th Lecture, Nov. 3 rd Instructors: Roger Dannenberg and Greg Ganger.
Networking Tutorial Special Interest Group for Software Engineering Luke Rajlich.
UNIX Sockets COS 461 Precept 1. Socket and Process Communication The interface that the OS provides to its networking subsystem application layer transport.
TELE 402 Lecture 6: Name and address conversions 1 Overview Last Lecture –Socket Options and elementary UDP sockets This Lecture –Name and address conversions.
Internetworking Topics Client-server programming model Networks Internetworks Global IP Internet IP addresses Domain names Connections CS 105 “Tour of.
Internetworking Topics Client-server programming model Networks Internetworks Global IP Internet IP addresses Domain names Connections CS 105 “Tour of.
Internetworking Topics Client-server programming model Networks Internetworks Global IP Internet IP addresses Domain names Connections net1.ppt CS 105.
CSCI 330 UNIX and Network Programming Unit XIV: User Datagram Protocol.
1 Networking Programming (I). 2 Outline Client-Server Programming Model Networks The Global IP Internet Suggested Reading: –11.1, 11.2, 11.3.
1 Spring Semester 2008, Dept. of Computer Science, Technion Internet Networking recitation #7 Socket Programming.
Chapter 11 Advanced Name and Address Conversion. Introduction gethostbyname, gethostbyaddr: protocol dependent getaddrinfo: –a function providing protocol.
Socket Programming(1/2). Outline  1. Introduction to Network Programming  2. Network Architecture – Client/Server Model  3. TCP Socket Programming.
CSE 333 – SECTION 8 Client-Side Network Programming.
Computer networks Name: K.SUDHA Designation: Lecturer Department: Electrical and Electronics Engineering Subject code: CS2361 Year: III Unit: V Title:
Ad Hoc – Wireless connection between two devices Backbone – The hardware used in networking Bandwidth – The speed at which the network is capable of sending.
Transport Protocols Relates to Lab 5. An overview of the transport protocols of the TCP/IP protocol suite. Also, a short discussion of UDP.
Instructors: Gregory Kesden
Network Programming: Part I
UNIX Sockets COS 461 Precept 1.
Network Programming: Part I : Introduction to Computer Systems 21st Lecture, March 31, 2016 Instructors: Seth Copen Goldstein, Franz Franchetti,
CS 105 “Tour of the Black Holes of Computing”
Socket Programming (Cont.)
Internet Address Routines
Class A Addresses The 1st bit of a class A address is 0
Week 13 - Friday CS222.
Network Programming with Sockets
Internet Topics Client-server programming model Networks in general
Name and Address Conversions Part I
“The course that gives CMU its Zip!”
Transport layer API: Socket Programming
Packet Switching To improve the efficiency of transferring information over a shared communication line, messages are divided into fixed-sized, numbered.
POWERPOINT PRESENTATION ON NETWORKING Presented by Ms
תקשורת ומחשוב תרגול 3-5 סוקטים ב-C.
Basic Internet Components
Network Programming Chapter 12
Chapter Goals Compare and contrast various technologies for home Internet connections Explain packet switching Describe the basic roles of various network.
IP Addresses, DNS CSE 333 Spring 2018
System-Level I/O.
Networking Programming
IP Addresses, DNS CSE 333 Summer 2018
IP Addresses, DNS CSE 333 Autumn 2018
Network Programming: Part I CSCI 380: Operating Systems
IP Addresses, DNS CSE 333 Winter 2019
Socket Programming(1/2)
Sockets Programming Socket to me!.
Sockets Programming Socket to me!.
Internet Networking recitation #8
Internetworking April 17, 2003
16EC Computer networks unit II Mr.M.Jagadesh
Lecture 23: Networking and IP
Transport Protocols Relates to Lab 5. An overview of the transport protocols of the TCP/IP protocol suite. Also, a short discussion of UDP.
Presentation transcript:

CS 105 “Tour of the Black Holes of Computing” Internetworking Topics Client-server programming model Networks Internetworks Global IP Internet IP addresses Domain names Connections

Computer Networks A network is a hierarchical system of boxes and “wires” organized by geographical proximity LAN (local area network) spans building or campus Ethernet 802.11 (wireless) WAN (wide-area network) spans country or world Different, usually faster technology An internetwork (internet) is an interconnected set of networks Global IP Internet (uppercase “I”) is most famous example of an internet (lowercase “i”)

What Does an internet Protocol Do? 1. Provides naming scheme Defines uniform format for host addresses Each host (and router) is assigned at least one internet address that uniquely identifies it 2. Provides delivery mechanism An internet protocol defines a standard transfer unit (packet) Packet consists of header and payload Header: contains info such as packet size, source and destination addresses Payload: contains data bits sent from source host Encapsulation—key to network messages

Transferring Data via an internet Host A Host B client server (1) (8) data data protocol software protocol software internet packet (2) (7) data PH data PH LAN1 adapter LAN2 adapter Frame Router (3) (6) data PH FH1 data PH FH2 LAN1 adapter LAN2 adapter LAN1 LAN2 LAN2 frame (4) data PH FH1 (5) data PH FH2 protocol software

Global IP Internet Most famous example of an internet Based on TCP/IP protocol family IP (Internet protocol) : Provides basic naming scheme and unreliable delivery capability of packets (datagrams) from host to host UDP (Unreliable Datagram Protocol) Uses IP to provide unreliable datagram delivery from process to process TCP (Transmission Control Protocol) Uses IP to provide reliable byte streams from process to process over connections …and several more Accessed via mix of Unix file I/O and functions from the sockets interface

Programmer’s View of Internet 1. Hosts are mapped to a set of 32-bit IP(v4) addresses 134.173.42.100 is Knuth 128-bit IPv6 addresses also used; we will ignore those 2. IP addresses are mapped to set of identifiers called Internet domain names 134.173.42.2 is mapped to www.cs.hmc.edu 128.2.203.164 is mapped to www.cs.cmu.edu Mapping is many-to-many 3. Process on one Internet host can communicate with process on another via a connection—IP Address, Port Number

1. IP (v4) Addresses 32-bit IP addresses are stored in IP address struct Always stored in memory in network byte order (big-endian) True in general for any integer transferred in packet header from one machine to another. E.g., port number used to identify Internet connection /* Internet address structure */ struct in_addr { unsigned int s_addr; /* network byte order (big-endian) */ }; Handy network byte-order conversion functions (no-ops on some machines): htonl: convert int from host to network byte order htons: convert short int from host to network byte order ntohl: convert int from network to host byte order ntohs: convert short int from network to host byte order

Dotted-Decimal Notation By convention, each byte in 32-bit IP address is represented by its decimal value and separated by period IP address 0x8002C2F2 = 128.2.194.242 IPv6 addresses uglier: 2001:1878:301:902:218:8bff:fef9:a407 Functions for converting between binary IP addresses and dotted decimal strings: inet_pton: converts dotted-decimal string to IP address in network byte order inet_ntop: converts IP address in network byte order to its corresponding dotted-decimal string “n” denotes network representation; “p” denotes printable representation

2. Internet Domain Names unnamed root mil edu gov com Top-level domain names mit hmc berkeley amazon Second-level domain names cs math www 208.216.181.15 Third-level domain names wilkes 134.173.42.167 Knuth 134.173.42.100

Domain Naming System (DNS) Internet tracks mapping between IP addresses and domain names in worldwide many-to-many distributed database called DNS. Conceptually, programmers can view DNS database as collection of millions of address information structures: Functions for retrieving host entries from DNS: getaddrinfo: query key is DNS domain name getnameinfo: query key is IP address (V4 or V6) /* Address information structure (DNS only has + entries) */ struct addrinfo { int ai_flags; /* Various options */ int ai_family; /* + AF_INET or AF_INET6 */ int ai_socktype; /* Preferred socket type */ int ai_protocol; /* Preferred protocol */ size_t ai_addrlen; /* Length of address */ struct sockaddr *ai_addr; /* + Encoded IP address */ char *ai_canonname; /* + Canonical host name */ struct addrinfo *ai_next; /* Link to next answer */ };

Properties of DNS Host Entries Each host entry is equivalence class of domain names and IP addresses Each host has a locally defined domain name localhost, which always maps to loopback address 127.0.0.1 Different kinds of mappings are possible: Simple case: 1-1 mapping between domain name and IP addr: www.cs.hmc.edu maps to 134.173.42.2 Multiple domain names mapped to the same IP address: cs.hmc.edu and knuth.cs.hmc.edu both map to 134.173.42.100 Multiple domain names mapped to multiple IP addresses: aol.com and www.aol.com map to multiple IP addresses Some valid domain names don’t map to any IP address: For example: research.cs.hmc.edu

A Program That Queries DNS int main(int argc, char **argv) { /* argv[1] is a domain name */ struct addrinfo hints, *host, *firsthost = NULL; struct sockaddr_in *addr; char buf[80]; memset(&hints, 0, sizeof hints); hints.ai_flags = AI_CANONNAME; hints.ai_family = AF_INET; /* Or AF_INET6 or AF_UNSPEC */ if (getaddrinfo(argv[1], NULL, &hints, &firsthost) != 0) exit(1); printf("official hostname: %s\n", firsthost->ai_canonname); /* CHANGES NEEDED BELOW FOR AF_INET6 or AF_UNSPEC: see handout */ for (host = firsthost; host != NULL; host = host->ai_next) { addr = (struct sockaddr_in *)host->ai_addr; inet_ntop(addr->sin_family, &addr->sin_addr, buf, sizeof buf); printf("address: %s\n", buf); } freeaddrinfo(firsthost); exit(0);