Académique Documents
Professionnel Documents
Culture Documents
Dr. G. A. Marin
1-1
1970s
Business Environment: IBM's S NA
Hierarchical, orderly, reliable Hi hi l d l li bl S ysdef for Topology and Paths Connection-oriented and guaranteed service at link layer (data l ) (d t only) Low-speed (unreliable) leased lines
1980s
NS FNet Backbone to Interconnect S uper Computers
TCP/IP official protocol of Arpanet in 1983 ffi i l t l fA ti 56 kbps backbone for 6 super computer centers Thousands of researchers connect their subnets Version 2 (IBM RS 6000s and Fiber) ran at 448 kbps By 1990 1.5 Mbps ANS takes ANStakes over and upgrades to 45 Mbps (Merit MCI IBM) (Merit, MCI,
1990s
Internet
1990: 200,000 computers and 3,000 networks 1995: multiple backbones, 100s regional nets, 10s of thousands of LANS millions of hosts , Doubles yearly!? WWW application (CERN) brings internet to non-academics (mosaic) NREN Gigabit Network funded by ARPA & NS F
Internet S ociety Founded 1992! Commercially Cisco uses IP to grow to Billions in revenue
Network Analysis: Foundation 1-4
Foundat on Foundation
Goals:
Lay foundation for understanding how to build a network
Required connectivity Required services Terminology Layered architecture
TCP/IP & OSI
Overview: Applications Concepts & Terminology Network Architecture Performance Channel Multiplexing
1-6
1-7
request
reply l
application transport network data l link physical
Server:
provides requested service to client e.g., Web server sends requested Web page, mail server delivers e-mail l d l l
1-8
1-9
1-10
http is stateless p
server maintains no information about p past client requests q Protocols that maintain state are complex! state past history (state) must be maintained if server/client crashes, / li t h their views of state may be inconsistent, must be reconciled
Network Analysis: Foundation
aside
1-11
http example
Suppose user enters URL
www.someSchool.edu/someDepartment/home.index 1a. http client initiates TCP
(contains text, references to 10 jpeg images)
connection to http server (process) at www.someSchool.edu. Port 80 is default for http server.
S h l d iti www.someSchool.edu waiting for TCP connection at port 80. accepts connection, notifying client
3. http server receives request message, message forms response message containing requested
time
1-13
E Electronic Mail
Three major components: j p
user agents mail servers simple mail transfer p protocol: smtp
mail server user agent
SMTP SMTP
mail server
User Agent a.k.a. il reader k mail d composing, editing, reading mail messages e.g., E d Eudora, Outlook, elm, O tl k l Netscape Messenger outgoing, incoming messages stored on server
SMTP
user agent
user agent
user agent
1-14
SMTP SMTP
mail server
SMTP
user agent
user agent
user agent
1-15
1-16
1-17
1-18
1-19
Foundation
Goals:
Lay foundation for understanding how to build a network
Required connectivity Required services Terminology Layered architecture
TCP/IP & OSI
Overview: Applications Concepts & Terminology Network Architecture Network Software Performance Papers p Problems
1-20
Connect v ty Connectivity
Network exists to connect computers May support a y pp strictly limited number or many If supports t growth, it is said to scale scale.
workstation mobile
regional ISP
company network n t k
Network Analysis: Foundation 1-21
1-22
1-23
Switched Network
1-24
A working network
RSVP/IS-C MSS-C RSVP/IS-C MSS-C
ES
8210
RSVP/IS-C MSS-C
ES
Token Ring
PSTN
LAN
ISDN
8260/8265
HUBS
RSVP/IS-C MSS-C MSS-S ARIS/GSMP RSVP/IS VLAN DHCP DDNS
8260/8265
8260/8265
HUBS
MSS-S ARIS/GSMP RSVP/IS VLAN DHCP DDNS
HUBS
MSS-S ARIS/GSMP RSVP/IS VLAN DHCP DDNS
LAN
HUBS
MSS-S ARIS/GSMP RSVP/IS VLAN DHCP DDNS
Token Ring
ROUTER 2210/2216
ARIS RSVP/IS DDNS-S DDNS S DHCP-S Firewall IP Sec.
ROUTER 2210
ARIS RSVP/IS DDNS-S DHCP-S Firewall IP Sec.
ATM
390
39xx, 374X OSA, MAE
SP-2
BUT COMPLEXITY!
AS/400
1-25
Basic Concepts
Host: a node that uses the network (outside the ( network) S witch: a node that implements the network (inside the network) ) Internetwork: A set of independent networks that are interconnected Router/Gateway: a node connected to two or more networks Address: a byte string that identifies a node Routing: a process of forwarding packets across a network based on source and destination addresses. Unicast and Multicast Addresses: addresses assigned to single or multiple destinations destinations.
Network Analysis: Foundation 1-28
Foundat on Foundation
Goals:
Lay foundation for understanding how to build a network
Required connectivity Required services Terminology Layered architecture
TCP/IP & OSI
Overview: Applications Concepts & Terminology Network Architecture Performance Papers Problems
1-29
Network designer cares that network resources are used efficiently and allocated to users f i l ll d fairly. Network provider wants ease of administration and fault management management.
Network Analysis: Foundation 1-31
Again: A network architecture is a blueprint f a way of building a network bl i t for f b ildi t k that will satisfy all its requirements.
Philosophy, algorithms flows Philosophy algorithms, flows, and formats
Network Analysis: Foundation 1-32
Application
Presentation
Layer Protocol
Presentation
S ession
Layer Protocol
S ession
Transport
Layer Protocol
Transport
Network
Network
Network
Network
Data Link
Data Link
Data Link
Data Link
Physical
Physical
Physical
Physical
Network Analysis: Foundation 1-33
1-35
Course
Transport Layer Transport Layer
TCP/IP
Network Layer
Internet Layer
1-37
Telnet virtual terminal protocol FTP file transfer protocol S MTP S imple Mail Transfer Protocol DNS Domain DNSDomain Name S ervice HTTP W orld-W ide-W eb page trasfer protocol
Network Analysis: Foundation 1-39
Hybrid Model
The hybrid reference model to be used in this course.
1-41
Connectionless service
UDP service:
unreliable data transfer between sending and receiving process gp does not provide: connection setup, reliability, flow control, y congestion control, timing, or bandwidth guarantee Q: why bother? Why is there a UDP?
required between client, server reliable transport b l bl between sending and receiving process flow control: sender wont overwhelm receiver congestion control: throttle sender when network overloaded does not provide: timing, minimum bandwidth guarantees
1-43
Example N etworks
S ystem Network Architecture (S NA)
IBM's networking architecture used by 10,000+ business networks Mainframe model of computing...hierarchical Followed by Advanced Peer-to-Peer Networking Peer to Peer (APPN) architecture
Novell Netware
Predominant PC-based network architecture...client/server model...downsizing Proprietary protocol stack derived from XNS ...similarities to IP IPX uses 10-byte vs 4-byte (IP) addresses Network Core Protocol (NCP) for connection-oriented transport
Network Analysis: Foundation 1-44
X .25 N etworks
A standard developed by CCITT (now IS in 1970s O) Defines the user/network (or host/network) interface Physical layer is X.21 - mostly analog RS -232 used instead Network layer handles addressing, flow-control, delivery confirmation User establishes a "virtual circuit" and sends max 128 byte packets reliably and in order.
both permanent and switched virtual circuits (PVC S (PVC,S VC)
Flow control ensures fast sender does not swamp receiver For non X 25 terminals a Packet assembler/disassembler non-X.25 is used (PAD)
Terminal - X.28 - PAD - X.29 standards also defined.
Frame Relay y
Also connection-oriented standaard for moving bits g generally across a p y public network. Takes advantage of fact that leased lines are now fast, digital, reliable --> simple protocols. Predominantly a virtual leased line (PVC) today today. Frames can be up to 1600 bytes and carry a number (dlci) identifying the virtual circuit. Contract ith C t t with carrier f an average service i for i
burst allowed as in S MDS
Generally operates at T1 ( y (1.5mbps) or above ) FR determines start and end of frame, detects some transmission errors, discards bad frames. No flow control yet defined only a CI bit bit.
Network Analysis: Foundation 1-49
BISDN Architecture - AT M
- envisioned for universal networking...
- integrated networking * voice, video, data, and image in the same network - scaleable in distance * LAN, MAN, WAN - scaleable in bandwidth * 1.5 Mbps to several Gbps Asynchronous Transfer Mode
Network Analysis: Foundation 1-50
Motivations
Why connection oriented? - providing service guarantees require idi i t i resources to be reserved in the network - simpler network management Why fixed size cells? - efficient switching - hardware switching Why small size cell? - mainly for voice
1-51
Connectionless
S ession setup without reserving bandwidth across network network. First-come, first-served and no performance guarantees (changing now). f t ( h i ) No call-admission decision. All users accepted if connected. t d t d Packet waits in queue if needed to be transmitted on next li k i d link. Advantage is that data can be sent without any connection-setup protocols.
Network Analysis: Foundation 1-53
E x a m p le P ro to c o l G ra p h
FTP HTTP V id e o TFTP
TCP
UDP
IP
E th e rn e t
ATM
O th e r N e t A rc h
N o te : O n e a rc h ite c tu re m a y rid e o n to p o f a n o th e r.
1-54
1-55
Foundat on Foundation
Goals:
Lay foundation for understanding how to build a network
Required connectivity Required services Terminology Layered architecture
TCP/IP & OSI
Overview: Applications Concepts & Terminology Network Architecture Performance Channel Multiplexing
1-56
Throughput g p
Usually implies achievable performance for the data unit of interest (user data,packet,etc.). Typical measures are bits/sec pkts/sec, etc. bits/sec, pkts/sec etc Depends on input rate to the channel Influenced by protocol and protocol data unit overhead. h d
Network Analysis: Foundation 1-57
Performance (delay)
Delay or latency is the lapsed time between the start and end of an event of interest.
Retrieving data from a disk g Sending a frame on an ethernet link Sending an IP datagram across the Internet.
Measured in time (e.g. 24 milliseconds to send a packet from US east to west coast.) May be interested in one-way or in RTT (round-trip-time).
Network Analysis: Foundation 1-58
Link Delay=Queue+Transmit+Propagate (time) y Q p g ( ) Q Queue time is time a p m m packet/bit waits to begin transmission from a node Transmit time
Size (bits)/Bandwidth (bits per sec)
Propagation time
Distance ( k f t miles) / P Di t (m, km, feet, il ) Propagation S d ti Speed
Propagation speed
3 108 m/sec in a vacuum ( 3.33 ) ( 4.35 ) 2.3 108 m/sec in a cable (5 ) 2 108 m/sec in fiber
sec km k
sec
kn
sec km
1-59
8 meters
sec
1-60
Problem
Calculate the latency (from first bit sent to last bit received) of the following: 10-Mbps Ethernet with a single store-and-forward switch in the path and a packet size of 5,000 bits. Assume that each link introduces a propagation delay of 10 s and that the switch begins retransmitting immediately after it has finished receiving the packet.
10-Mbps
10x10-6 sec
1. Transmit:
10x10-6 sec
Total = 1.02 ms. 5,000 bits 3. Transmit: = 500 106 sec. 6 bits 10 10 sec 6 4. Propagate last bit on second link = 10 10 sec. 5,000 bits = 500 106 sec. bits 10 106 bi sec 2. Propagate last bit on first link = 10 10 6 sec.
1-61
Problem
Two nodes, A and B, are separated by 2000km and are connected by a fiber 10 Mbps point-to-point link. Suppose that node A transmits 1,000 packets per second to node B and that each packet is 1,000 bytes long. Also assume that each packet is delayed for 1 ms in node A. 1. Wh i h d l h 1 What is the delay that each packet experiences from arrival at A to h k i f i l arrival at B? 2. 2 What is the bandwidth of the link? What is the throughput of the link? The ratio of these two quantities determines link "utilization" usually defined as: c c is capacity or bandwidth (bps). Find the utilization of the link. (bps) link
Network Analysis: Foundation 1-62
Solut on Solution
The link delay is given by: 8, 000bits 2, 000km d = qt + tt + pd = 1ms + + m 10 Mbps 2.0 108 sec 80 102 2 106 = 0.001sec+ sec+ sec = 0.0118sec = 11.8ms. 6 8 10 10 2 10
The bandwidth of the link is 10Mbps. Node A transmits 1000 pps with each packet 8,000 bits 8.0Mbps; thus, the throughput is 8Mbps. The utilization is clearly 0.8 (notice NO dimension).
1-63
10 106 bps
Propagation Speed 2.0 108 m / sec 20 BitLength = = = 20 meters bit 6 BandWidth 10 10 bps
2,000,000m This implies that = 100, 000 bits can be 20m/bit held or "stored" on this link at one time.
Network Analysis: Foundation 1-65
1-67
1-68
Suppose that a file is to be transferred from A to B over a d km fiber link of bw bps. The total size of the file is fs bytes. HOWEVER, the file cannot be transmitted in a single packet; it must be divided into packet that have a maximum size of ps bytes. How long does it take to transfer the entire file? (Here we have no concerns about errors in transmission.) Example: Suppose a file is to be transferred over a 3000 km link of 155 Mbps. File size is 100 MB and max packet size is 1500 bytes. How much time is required to transfer the file? bytes
1-69
First packet arrives after transfer time + propagation delay (1st train car). n 1 packets (cars) remain and one will arrive for each new interval of transfer time. TOTAL transfer time will be one propagation delay plus n (transfertime).
1-70
transfer time
1-72
Foundat on Foundation
Goals:
Lay foundation for understanding how to build a network
Required connectivity Required services Terminology Layered architecture
TCP/IP & OSI
Overview: Applications Concepts & Terminology Network Architecture Performance Channel Multiplexing
1-73
C lie n t
1-74
distributed algorithm that determines how stations share g channel, i.e., determine when station can transmit communication about channel sharing must use channel itself! what to look for in multiple access protocols: p p synchronous or asynchronous information needed about other stations robustness (e.g., to channel errors) ( g, ) performance
1-75
TDMA: time division multiple access access to channel in "rounds" each station gets fixed length slot (length = pkt trans time) in each round ) unused slots go idle example: 6-station LAN, 1,3,4 have pkt, slots 2,5,6 idle TDM (Time Division Multiplexing): channel divided into N time slots, one per user; inefficient with low duty slots cycle users and at light load. FDM (Frequency Division Multiplexing): frequency subdivided.
Network Analysis: Foundation 1-77
1-78
two or more trasnmitting nodes -> llisi t t s itti d s collision, random access MAC protocol specifies:
how to detect collisions how to recover from collisions (e.g., via delayed retransmissions)
Slotted Aloha
time is divided into equal size slots ( p trans. time) q (= pkt ) node with new arriving pkt: transmit at beginning of next slot if collision: retransmit pkt in future slots with probability p, until successful.
1-81
1-82
1-83
1-84
Solut on Solution
The random variable X has a geometric distribution and p X ( k ) = e k 1 (1 e ) , for k = 1, 2,
kek 1 (1 e ) =
k =1
1 e
(1 e )
1 . 1 e
1-85
2 1 and p ( H = 2 ) = . 3 3
n 1
n 1
n 1
( n 1) n .
2
The
n last expression equals , which is the total ways to pick pairs from n nodes. 2 From this it follows that the probability that a random packet is on a route of length k is p ( H = k ) = 2 (n k ) nk = . ( n 1) n ( n 1) n 2
n 1 k =1
( n 1) n 2 i ( n 1) n ( 2n 1) = n 2n 1 = n + 1 . 2n i 6 3 3 ( n 1) n 2 ( n 1) n
Network Analysis: Foundation 1-87
1-88
frequency time
1-89
1-90
P[ X = k]=
k e
1-94
For (c): The throughput is 2e 2 = 0.27 frames per slot (assuming slotted ALOHA).
Network Analysis: Foundation
1-95