WAN Technologies. 2 Large Spans and Wide Area Networks MAN networks: Have not been commercially successful.

Slides:



Advertisements
Similar presentations
Internetworking II: MPLS, Security, and Traffic Engineering
Advertisements

William Stallings Data and Computer Communications 7 th Edition (Selected slides used for lectures at Bina Nusantara University) Internetworking.
Chapter 8: Local Area Networks: Internetworking. 2 Objectives List the reasons for interconnecting multiple local area network segments and interconnecting.
IP: The Internet Protocol
© 2007 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved.1 Computer Networks and Internets with Internet Applications, 4e By Douglas.
© 2009 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved.1 Computer Networks and Internets, 5e By Douglas E. Comer Lecture PowerPoints.
Chapter 10 Introduction to Wide Area Networks Data Communications and Computer Networks: A Business User’s Approach.
1 Chapter 8 Local Area Networks - Internetworking.
CMPE 80N - Introduction to Networks and the Internet 1 CMPE 80N Winter 2004 Lecture 15 Introduction to Networks and the Internet.
CMPE 80N - Introduction to Networks and the Internet 1 CMPE 80N Winter 2004 Lecture 12 Introduction to Networks and the Internet.
CS335 Networking & Network Administration Tuesday, April 20, 2010.
1 Chapter 8 Local Area Networks - Internetworking Data Communications and Computer Networks: A Business User’s Approach.
Local Area Networks Part II. 2 Introduction Many times it is necessary to connect a local area network to another local area network or to a wide area.
CSCI 4550/8556 Computer Networks Comer, Chapter 13: WAN Technologies and Routing.
1 25\10\2010 Unit-V Connecting LANs Unit – 5 Connecting DevicesConnecting Devices Backbone NetworksBackbone Networks Virtual LANsVirtual LANs.
WAN Technologies.
1 LAN switching and Bridges Relates to Lab 6. Covers interconnection devices (at different layers) and the difference between LAN switching (bridging)
WAN Technologies & Topologies Lecture 8 October 4, 2000.
Chapter 13 WAN Technologies and Routing. LAN Limitations Local Area Network (LAN) spans a single building or campus. Bridged LAN is not considered a Wide.
Chapter 13: WAN Technologies and Routing 1. LAN vs. WAN 2. Packet switch 3. Forming a WAN 4. Addressing in WAN 5. Routing in WAN 6. Modeling WAN using.
CECS 474 Computer Network Interoperability WAN Technologies & Routing
LECTURE 9 CT1303 LAN. LAN DEVICES Network: Nodes: Service units: PC Interface processing Modules: it doesn’t generate data, but just it process it and.
Lecture 2 TCP/IP Protocol Suite Reference: TCP/IP Protocol Suite, 4 th Edition (chapter 2) 1.
1 Chapter Wide Area Networks (WANs), Routing, and Shortest Paths.
WAN technologies and routing Packet switches and store and forward Hierarchical addresses, routing and routing tables Routing table computation Example.
CS3502: Data and Computer Networks Local Area Networks - 4 Bridges / LAN internetworks.
18-WAN Technologies and Dynamic routing Dr. John P. Abraham Professor UTPA.
FALL, 2005CSI Part 2.3 Internetworking & Addressing (Concept, IP Addressing, IP Routing, IP Datagrams, Address Resolution Robert L. Probert, SITE,
Day 12 Chapter 13 WAN Technologies and Routing. Classification of Networks LAN – spans a single building or campus MAN – Spans a city WAN – Spans multiple.
Chapter 8 Local Area Networks: Internetworking Data Communications and Computer Networks: A Business User’s Approach.
Local Area Networks: Internetworking
Internetworking – What is internetworking? Connect multiple networks of one or more organizations into a large, uniform communication system. The resulting.
1 WAN Technologies and Routing. 2 Motivation Connect multiple computers Span large geographic distance Cross public right-of-way –Streets –Buildings –Railroads.
Review: –Ethernet What is the MAC protocol in Ethernet? –CSMA/CD –Binary exponential backoff Is there any relationship between the minimum frame size and.
Internetworking Concept and Architectural Model
Ethernet (LAN switching)
15.1 Chapter 15 Connecting LANs, Backbone Networks, and Virtual LANs Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or.
CMPE 80N - Introduction to Networks and the Internet 1 CMPE 80N Winter 2004 Lecture 16 Introduction to Networks and the Internet.
Internet Protocol: Routing IP Datagrams Chapter 8.
© 2009 Pearson Education Inc., Upper Saddle River, NJ. All rights reserved. © The McGraw-Hill Companies, Inc. Internetworking, WANs, and Dynamic Routing.
Data Communications & Computer Networks, Second Edition1 Chapter 8 Local Area Networks: Internetworking.
Rehab AlFallaj.  Network:  Nodes: Service units: PC Interface processing Modules: it doesn’t generate data, but just it process it and do specific task.
2.1 Chapter 2 Network Models – cont. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
18-WAN Technologies and Dynamic routing Dr. John P. Abraham Professor UTPA.
1 LAN switching and Bridges Relates to Lab Outline Interconnection devices Bridges/LAN switches vs. Routers Bridges Learning Bridges Transparent.
15.1 Chapter 15 Connecting LANs, Backbone Networks, and Virtual LANs Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or.
COMPUTER NETWORKS CS610 Lecture-17 Hammad Khalid Khan.
Spring Ch 17 Internetworking Concepts, Architecture, and Protocols Part III Internetworking.
Chapter 9 Introduction To Data-Link Layer 9.# 1
Datagram Forwarding.
Link Layer 5.1 Introduction and services
Chapter 4 Introduction to Network Layer
The Underlying Technologies
Ch 13 WAN Technologies and Routing
Connecting Devices LANs or WANs do not normally operate in isolation. They are connected to one another or to the Internet. To connect LANs or WANs, we.
Scaling the Network: The Internet Protocol
Chapter 4 Data Link Layer Switching
CT1303 LAN Rehab AlFallaj.
Internetworking & Address Resolution
WAN Technologies and Routing
18-WAN Technologies and Dynamic routing
Chapter 4 Introduction to Network Layer
Protocols 1 Key Revision Points.
Wide Area Networks (WANs), Routing, and Shortest Paths
Scaling the Network: The Internet Protocol
Wide Area Networks (WANs), Routing, and Shortest Paths
Wide Area Networks (WANs), Routing, and Shortest Paths
Wide Area Networks (WANs), Routing, and Shortest Paths
COMPUTER NETWORKS CS610 Lecture-16 Hammad Khalid Khan.
Presentation transcript:

WAN Technologies

2 Large Spans and Wide Area Networks MAN networks: Have not been commercially successful

3 Key issues in WAN technologies Long distance: Span sites in multiple cities Scalability: Grow as needed to connect many sites Deliver reasonable performance for a large scale network

Forming a WAN: Scalability A packet switch provides local connections for computers at the site and connections to other sites. – A small computer system with a processor, memory, and I/O devices used to send and receive packets. – Earlier than LAN technologies and the switch used in LAN

Forming a WAN: Long distance WANs use leased data circuits from phone companies

6 Modern WAN (Internet) Architecture Most WANs separate a packet switch into two parts: – A Layer 2 switch that connects local computers – Local connections – A router that connects to other sites – Global connections Communication with local computers can be separated from transmission across a WAN.

WAN Store and Forward Paradigm To allow as many computers as possible to send packets simultaneously, WANs can store and forward packets

WAN Store and Forward Paradigm In order to correctly forward the packets, each packet switch needs to know the MAC address of every computer on the network Not feasible. Billions of devices are connected to the Internet today  need better routing mechanism

9 Addressing in a WAN WANs addresses follow a hierarchical addressing mechanism: (site, computer at the site) In practice, instead of identifying a site, each packet switch is assigned a unique number First part of an address identifies a packet switch Second part identifies a specific computer

10 Addressing in a WAN When a packet arrives, a packet switch P examines the destination address in the packet and extracts the packet switch number Q of the targeted computer. – Packets targeted for a local computer (P = Q) The switch sends the packet directly to the computer. – Otherwise (P ≠ Q) The packet is forwarded over to another switch Using only one part of a two-part hierarchical address  Much faster forwarding

11 Next-Hop Forwarding More generally, a WAN can be modeled as a graph. – Packet switches as nodes and connections between them as links or edges. (k, j): a link from node k to node j

12 Next-Hop Forwarding A packet switch only needs to compute the next hop for a packet. Forwarding table

13 Forwarding Table Computation Forwarding table must guarantee the following: Universal communication: Contain a valid next-hop route for each possible destination address Optimal routes Point to the shortest path to the destination Example: Computing the forwarding table for node 3: 100m 700m 300m 100m 500m 300m (3,4)

Exercise m 240m 200m 120m 100m 300m Computing the forwarding table for node 1: In a network with millions or even billions of computers, efficient algorithms are needed After class reading: Section 18.13

What are “Shortest” paths anyhow? 100m 500m 300m

16 Default Routes To eliminate duplicate entries, a single entry is used for a long list of entries that have the same next-hop value Only one default entry is allowed The entry has lower priority

Discussion Consider a WAN with two packet switches. Assume each switch uses a default entry that points to the other switch. Under what circumstances will the scheme fail? To reachNext hop 1-- *(1,2) To reachNext hop 2-- *(2,1)

Summary: WAN Technologies Hardware 1.Scalability: packet switches 2.Long distance: leased circuits Software / Efficient forwarding scheme 1.Hierarchical address 2.Next-hop forwarding 3.Default routes

One More Problem Suppose computer [1,2] wants to send a message to [3,5]. From previous chapters we know that NIC of computer [3,5] uses its MAC address (say, 78:DF:4C:84:BB:F2) to do addressing filtering. But if we use the new hierarchical address [3,5] to forward the packet, the packet would fail the addressing filtering.

We Need Both Address Layering: – Layer 3 (hierarchical) address: for routing – Layer 2 (MAC) address: for address filtering Compose a frame 54:DD:91 11:CA:3B E8:25:32 46:C2:8F I like you[3,5][1,2] Layer 3 header Layer 3 payload Layer 2 header

From LAN/WAN to Internet When there are several LANs or WANs wanting to connect with each other, we will get an internetwork. The largest internetwork is the Internet. – Router: A hardware system dedicated to interconnecting networks

From LAN/WAN to Internet Problem: there may be several computer [1,1] on the Internet, one for each WAN Solution: for every router and computer on the internet, we need a unique hierarchical address for routing Next class: IP Address