Internet and Intranet Protocols and Applications Lecture 1a: Introduction to Internet and Intranet Protocols and Applications January 17, 2006 Arthur Goldberg Computer Science Department New York University artg@cs.nyu.edu 02/07/06 1 Why Study Internet and Intranet Protocols and Applications? Same systems used in the two major types of networks, the public Internet and internal (corporate) Intranets Accessible for study, because protocol standards are published and their design is publicly debated 02/07/06 2 Growth of the Internet Log Growth of the Internet 1,000,000,000 100,000,000 10,000,000 1,000,000 100,000 10,000 host table DNS/domain survey Adjusted IP active domain survey 1,000 100 1980 1985 1990 1995 2000 2005 Source: Internet Software Consortium ; available at http://www.isc.org/ds/hosts.html Survey data obtained: 87-97: walking the DNS Tree(s). See RFC1296 for details 97-present: checking which IP addresses are valid; see http://www.isc.org/ds/new-survey.html 02/07/06 3 Source: Internet Software Consortium ; available at http://www.isc.org/ds/hosts.html Note exponential growth; recent slowing. 02/07/06 4 1
Systems to study Protocols Web (HTTP, SSL) Email (STP, POP3, IAP) File Transfer (FTP) Reliable ulticast (PG) Client and server software (and intermediate systems, like caching proxies, gateways and firewalls) Object formats for documents and programs (embedded in protocols) Challenges Heterogeneity Client and server system architecture Performance (in protocols and applications) Interoperability (with existing protocols and applications) End-user application design 02/07/06 5 02/07/06 6 Highly Heterogeneous Computing Environment Issue Smallest Largest log 10 (L/S) CPU speed 50 IPS 5000 3 RA 10 B 10 GB 3 BW 10 3 bps 10 9 6 Num CPUs 2 2 x 10 7 7 Latency 1 micro sec 1 sec 6 Other Heterogeneous Dimensions OS Palm Pilot DOS VS WAP phone Architecture x86 CRAY Spoken language Legal entity 02/07/06 7 02/07/06 8 2
Let s begin... What is: The Internet? A protocol? What s the Internet: A Nuts and Bolts View illions of connected computing devices: hosts, end-systems PCs, workstations, servers PDAs, phones, toasters running network apps Communication links fiber, copper, radio, satellite Routers: forward packets (chunks) of data thru network router server local ISP workstation mobile regional ISP 02/07/06 9 company network 02/07/06 From Computer Networking: A Top-Down Approach Featuring the Internet by Kurose & Ross 10 What s the Internet: A Nuts and Bolts View Protocols: control sending & receiving of messages e.g., TCP, IP, HTTP, FTP, PPP Internet: network of networks loosely hierarchical public Internet versus private intranet Internet standards RFC: Request for comments IETF: Internet Engineering Task Force router server local ISP workstation mobile regional ISP What s the Internet: A Service View Communication infrastructure enables distributed applications: WWW, email, games, e- commerce, database, voting more? Communication services provided: connectionless connection-oriented Cyberspace [Gibson]: a consensual hallucination experienced daily by billions of operators, in every nation,..." company network 02/07/06 From Computer Networking: A Top-Down Approach Featuring the Internet by Kurose & Ross 11 02/07/06 From Computer Networking: A Top-Down Approach Featuring the Internet by Kurose & Ross 12 3
Internet structure: network of networks roughly hierarchical national/international backbone providers (NBPs) e.g. Sprint, CI (previously UUNet/WorldCom), AT&T, Level3 (which acquired Genuity), Qwest and Cable & Wireless interconnect (peer) with each other privately, or at public Network Access Point (NAPs) regional ISPs connect into NBPs local ISP, company connect into regional ISPs NAP regional ISP local ISP NBP B NBP A local ISP regional ISP NAP Human protocols: what s the time? I have a question introductions specific msgs sent specific actions taken when msgs received, or other events What s a protocol? Network protocols: machines rather than humans all communication activity in Internet governed by protocols protocols define format, order of messages sent and received among network entities, and actions taken on messages receipt 02/07/06 From Computer Networking: A Top-Down Approach Featuring the Internet by Kurose & Ross 13 02/07/06 From Computer Networking: A Top-Down Approach Featuring the Internet by Kurose & Ross 14 What s a protocol? A human protocol and a computer network protocol: In Summary, a protocol is... Hi Hi Got the time? 2:00 time TCP connection request TCP connection reply. Get http://www.cs.nyu.edu/index.htm <file> An agreement about communication between two or more entities It specifies Format of messages eaning of messages Rules for exchange Procedures for handling problems 02/07/06 From Computer Networking: A Top-Down Approach Featuring the Internet by Kurose & Ross 15 02/07/06 16 4
Protocol Specification Space-Time Diagrams As designers, we typically specify a protocol in a document, such as an Internet RFC any formal and semi-formal representations can describe protocols Space-Time Diagrams Finite State achines (FS) 02/07/06 17 Describes causal ordering Defines indication/request/response actions This diagram shows send and wait protocol 02/07/06 18 Networking Review Layered protocol model of computer networks Finite State achine Transition Diagram for TCP Defines States Input (the event that causes transition) Transitions (to new states) Reduce complexity by layering protocols Solve at most a few challenges in each layer E.g. Lower layer (link) eliminates all physical noise errors Upper layer (transport in TCP) resends lost messages Each layer offers services to the layer above Enable improvements to PART of the network 02/07/06 19 02/07/06 20 5
Why layering? Dealing with complex systems: explicit structure allows identification, relationship of complex system s pieces layered reference model for discussion modularization eases maintenance, updating of system change of implementation of layer s service transparent to rest of system e.g., change in gate procedure doesn t affect rest of system layering considered harmful? Layers And Protocol Software Protocol software follows layering model One software module per layer odules cooperate Incoming or outgoing data passes from one module to another Entire set of modules known as stack 02/07/06 From Computer Networking: A Top-Down Approach Featuring the Internet by Kurose & Ross 21 02/07/06 22 Internet protocol stack Protocol layering and data application: supporting network applications ftp, STP, HTTP transport: host-host data transfer TCP, UDP network: routing of datagrams from source to destination IP, routing protocols link: data transfer between neighboring network elements PPP, ethernet physical: bits on the wire, in the fiber, or as electromagnetic waves application transport network link physical Each layer takes data from above adds header information to create new data unit passes new data unit to layer below Ht HnHt Hl HnHt source application transport network link physical destination application transport network link physical Ht HnHt Hl HnHt message segment datagram frame 02/07/06 From Computer Networking: A Top-Down Approach Featuring the Internet by Kurose & Ross 23 02/07/06 From Computer Networking: A Top-Down Approach Featuring the Internet by Kurose & Ross 24 6
Potential Drawbacks to Layering Internet Protocol (IP) Some researchers and networking engineers are vehemently opposed to layering [Wakeman 1992]. Potential drawbacks:a layer may duplicate lower-layer functionality (the classic End to End issue). A layer may need information that is present in another layer (violates isolation principle). Only data transmission protocol at Layer 3 Defines Internet addressing Internet packet format Internet routing 02/07/06 25 02/07/06 26 IP Address Details IP Addresses given notion of network, let s examine IP addresses: 32 Bits - divided into two parts Prefix identifies network Suffix identifies host Global authority assigns unique prefix to network (IANA) Local administrator assigns unique suffix to host class-full addressing: class A 0network host B 10 network host C 110 network host D 1110 multicast address 32 bits 1.0.0.0 to 127.255.255.255 128.0.0.0 to 191.255.255.255 192.0.0.0 to 223.255.255.255 224.0.0.0 to 239.255.255.255 02/07/06 27 02/07/06 28 7
Classes And Network Sizes IP Addressing Example aximum network size determined by class of address Class A large Class B medium Class C small 02/07/06 29 02/07/06 30 IP addressing: CIDR classful addressing: inefficient use of address space, address space exhaustion e.g., class B net allocated enough addresses for 65K hosts, even if only 2K hosts in that network CIDR: Classless InterDomain Routing network portion of address of arbitrary length address format: a.b.c.d/x, where x is # bits in network portion of address network host part part 11001000 00010111 0001000 000000000 200.23.16.0/23 Internet Packets Contains sender and destination addresses Size depends on data being carried Called IP datagram Two Parts Of An IP Datagram Header Contains source and destination address Fixed-size fields Data Area (Payload) Variable size up to 64K No minimum size 02/07/06 31 02/07/06 32 8
IP protocol version number header length (bytes) type of data max number remaining hops (decremented at each router) upper layer protocol to deliver payload to IP V4 Datagram format 32 bits ver head. type of length len service fragment 16-bit identifier flgs offset time to upper Internet live layer checksum 32 bit source IP address 32 bit destination IP address Options (if any) data (variable length, typically a TCP or UDP segment) total datagram length (bytes) for fragmentation/ reassembly E.g. timestamp, record route taken, specify list of routers to visit. IP Semantics IP is connectionless Datagram contains identity of destination Each datagram sent/handled independently Routes can change at any time 02/07/06 From Computer Networking: A Top-Down Approach Featuring the Internet by Kurose & Ross 33 02/07/06 34 IP Semantics (continued) Requests For Comment (RFC) IP allows datagrams to be Delayed Duplicated Delivered out-of-order Lost Called best effort delivery otivation: accommodate all possible networks Describe formally (and sometimes not so formally) everything about the Internet. Actually, RFCs are really a form of emo. For amusement, try RFC 968 ( Twas the Night Before Startup ) All are available on-line: www.ietf.org/rfc.html We use RFCs to learn about STP (2821), HTTP (2616), for example. 02/07/06 35 02/07/06 36 9
RFC Characteristics RFC Statuses (2026) Standard track PS - proposed standard DS - draft standard S - standard Non-standards track E - experimental I - information only H - Historic BC - Best current practices Example Network Working Group D. Waitzman Request for Comments: 1149 BBN STC 1 April 1990 A Standard for the Transmission of IP Datagrams on Avian Carriers Status of this emo This memo describes an experimental method for the encapsulation of IP datagrams in avian carriers. This specification is primarily useful in etropolitan Area Networks. This is an experimental, not recommended standard. Overview and Rational Avian carriers can provide high delay, low throughput, and low altitude service. The connection topology is limited to a single point-to-point path for each carrier, used with standard carriers, but many carriers can be used without significant interference with each other, outside of early spring. This is because of the 3D ether space available to the carriers, in contrast to the 1D ether used by IEEE802.3. The carriers have an intrinsic collision avoidance system, which increases Frame Format The IP datagram is printed, on a small scroll of paper, in hexadecimal, with each octet separated by whitestuff and blackstuff. The scroll of paper is wrapped around one leg of the avian carrier. A band of duct tape is used to secure the datagram's edges. The bandwidth is limited to the leg length. 02/07/06 37 02/07/06 38 RFC citations RFC citations appear in this format: #### Title of RFC. Author 1, Author 2, Author 3. Issue date. (Format: ASCII) (Obsoletes xxx) (Obsoleted by xxx) (Updates xxx) (Updated by xxx) (Also FYI ####) (Status: ssssss) Good searchable index http://www.rfc-editor.org/rfcsearch.html 02/07/06 39 Internet Engineering task Force IETF Open organization - anyone may join Primarily dedicated to development of the Internet protocols. Ideas are presented as RFCs and go through a review process RFC standards described in RFC 1602 Proposed Draft Standard 02/07/06 40 10
ore Alphabet Soup IAB - Internet Architecture Board IANA - Internet Assigned Numbers Authority IESG - Internet Engineering Standards Group Conclusions Layering a key concept in computer network design Determines design and modularity of network software ajor design decision in building a network architecture Connection-oriented vs. connectionless Both popular This course focuses on Application layer software 02/07/06 41 02/07/06 42 EXTRA SLIDES Finite State achine Representation Visualize as a 2D Array of functions Rows represent states Columns represent events Current State is an index i New Event is some index j For each State/Event pair specify An action to take (a function to execute) A next state 02/07/06 43 02/07/06 44 11
Protocol odel Intended for protocol designers Divides protocols into layers Each layer devoted to one sub-problem Example: ISO 7-layer reference model OSI Layered protocol model Application (We focus on activity here) Presentation - Data representation Session - Login and passwords Transport - Reliability Network - Packet forwarding Data Link - Hardware frame definitions Physical - Underlying hardware 02/07/06 45 02/07/06 46 TCP/IP odel vs. OSI IP Fragmentation & Reassembly network links have TU (max.transfer size) - largest possible link-level frame. different link types, different TUs large IP datagram divided ( fragmented ) within net one datagram becomes several datagrams reassembled only at final destination IP header bits used to identify, order related fragments reassembly fragmentation: in: one large datagram out: 3 smaller datagrams TF 1-9 02/07/06 47 02/07/06 From Computer Networking: A Top-Down Approach Featuring the Internet by Kurose & Ross 48 12
IP Fragmentation and Reassembly length =4000 ID =x fragflag =0 offset =0 One large datagram becomes several smaller datagrams length =1500 length =1500 length =1040 ID =x ID =x ID =x fragflag =1 offset =0 fragflag offset =1 =1480 fragflag offset =0 =2960 02/07/06 From Computer Networking: A Top-Down Approach Featuring the Internet by Kurose & Ross 49 13