DOC PREVIEW
Berkeley ELENG 122 - Lecture Notes

This preview shows page 1-2 out of 5 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 5 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 5 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 5 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

1EE 122: Switching and ForwardingKevin LaiSeptember 23, [email protected] 2Direct Link Network ReviewData link layer presents a single media (e.g., single wire) network modelProblem and solutions-Framing• character stuffing, byte counting, bit stuffing, clocked framing- Error detection• parity, checksum, CRC- Reliability• stop and go, sliding window- solutions also apply to similar problems in higher layers• problems can not be completely solved at data link layer• only implemented in data link layer as [email protected] 3Limitations of Direct Link Networksdistance- distance increases propagation delay- large propagation delay causes large coordination delay- e.g., Ethernet collision detection requires 2*prop_delaynumber of hosts- More hosts increases the probability of collisions- collisions decrease efficiency of linkbandwidth- bandwidth of link is shared among all connected nodessingle media type- different media (e.g., fiber, Ethernet, wireless) have different tradeoffs for performance, cost, [email protected] 4Direct Link Networks v.s. SwitchingDirect Link Network Switched NetworkSingle linkn linksSwitch [email protected] 5Definitionsswitch (aka bridge)- does switching- operates at data link layer- router also does switching, but at network layerswitching consists of- forwarding• read data from input links,• decide which output link to forward on, and❢examine packet header or incoming circuit, and❢look up in forwarding table• transmit it on one of the output links (unicast)- routing• how the switch/router builds up its forwarding [email protected] 6Propertiesspans larger physical area than direct link network (DLN)- can connect multiple switches togethersupports more hosts than DLN- hosts on separate links can transmit at same timehigher aggregate bandwidth than DLN- approaches (n/2)*b instead of b, n = number of switched links, b = bandwidth of one linksupports more than one media type- more expensive for bridge than [email protected] 7Bridge/Router ComparisonRouter interconnects different link layer protocols more easilyEthernet802.11bATMSONETEthernet802.11bATMSONETE-to-8E-to-AE-to-SO(n2) convertersn = different link typesEthernet802.11bATMSONETEthernet802.11bATMSONETSwitchRouterO(n) convertersE-to-IP IP-to-E8-to-IPS-to-IPA-to-IPIP-to-8IP-to-SIP-to-AE-to-Elaik@cs.berkeley.edu 8Forwarding Techniquespacket switching- aka [packet|datagram|connectionless] [switching|forwarding]source routingvirtual circuit switching- aka virtual circuit forwardingcircuit switchingdespite names, all ways for switch to decide which output port to forward [email protected] 9Packet SwitchingData is separated into packetsEach packet is forwarded independently of previous packets- packets between two hosts can follow different pathsOn link failure, adjoining switches select new route and continue forwarding packetsStatistical multiplexing- any one host may use 100% of a link’s [email protected] 10Statistical Multiplexing v.s. Resource ReservationsReserve explicit amount of resources (e.g., bandwidth)- get exactly that amountStatistical multiplexing: get whatever is available...SH9H010Mb/s / 10Mb/s......StatisticalMultiplexingResourceReservationsAdvantage Problem10Mb/s...SH9H0congestion,packet loss......10Mb/s10Mb/s10Mb/s 10Mb/s10Mb/s...SH9H0......1Mb/s1Mb/s10Mb/s1Mb/s...SH9H0......1Mb/s1Mb/s10Mb/s0Mb/s10Mb/s / 10Mb/s10Mb/s / 10Mb/s1Mb/s / 10Mb/slow [email protected] 11Packet Switching OperationEach switch maintains a forwarding table- forwarding entry: (address, output port)Upon packet arrival - input port forwards the packet to the output port whose address matches packet’s destination address• exact matchlongest prefix match- forwarding entry: (address prefix, output port)- forward packet to the output port whose address matches packet’s destination address in the longest number of bits212.xxx.xxx.xxx112.82.xxx.xxx1128.16.120.11112128.16.120.11112.82.100.101laik@cs.berkeley.edu 12Packet Switching PropertiesExpensive forwarding- forwarding table size depends on number of different destinations- must lookup in forwarding table for every packetRobust- link and router failure may be transparent for end-hostsHigh bandwidth utilization- statistical multiplexingNo service guarantees- Network allows hosts to send more packets than available bandwidth → congestion → dropped [email protected] 13Source RoutingEach packet specifies the sequence of routers, or alternatively the sequence of output ports, from source to destination 1234123412341234123412344source3 44 3 44 3 [email protected] 14Source Routing (cont’d)Gives the source control of the pathNot scalable- Packet overhead proportional to the number of routers- Typically, require variable header length which is harder to implementHard for source to have complete informationLoose source routing Æ sender specifies only a subset of routers along the [email protected] 15Virtual Circuit (VC) SwitchingPackets not switched independently- establish virtual circuit before sending dataForwarding table entry- (input port, input VCI, output port, output VCI)- VCI – Virtual Circuit IdentifierEach packet carries a VCI in its headerUpon a packet arrival at interface i - Input port uses i and the packet’s VCI v to find the routing entry (i, v, i’, v’)- Replaces v with v’ in the packet header- Forwards packet to output port i’[email protected] 16VC Forwarding: Example1234123412341234123412345……114………3…inoutin-VCI11out-VCI……5……73………2…inoutin-VCIout-VCI……117……14………1…inoutin-VCI out-VCI……[email protected] 17VC Forwarding (cont’d)A signaling protocol is required to set up the state for each VC in the routing table - A source needs to wait for one RTT (round trip time) before sending the first data packetCan provide per-VC QoS- When we set the VC, we can also reserve bandwidth and buffer resources along the [email protected] 18Virtual Circuit Switching PropertiesLess expensive forwarding- forwarding table size depends on number of different circuits- must lookup in forwarding table for every packetMuch higher delay for short flows- 1 RTT delay for connection setupLess Robust- end host must spend


View Full Document

Berkeley ELENG 122 - Lecture Notes

Documents in this Course
Lecture 6

Lecture 6

22 pages

Wireless

Wireless

16 pages

Links

Links

21 pages

Ethernet

Ethernet

10 pages

routing

routing

11 pages

Links

Links

7 pages

Switches

Switches

30 pages

Multicast

Multicast

36 pages

Switches

Switches

18 pages

Security

Security

16 pages

Switches

Switches

18 pages

Lecture 1

Lecture 1

56 pages

OPNET

OPNET

5 pages

Lecture 4

Lecture 4

16 pages

Ethernet

Ethernet

65 pages

Models

Models

30 pages

TCP

TCP

16 pages

Wireless

Wireless

48 pages

Load more
Download Lecture Notes
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Lecture Notes and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Lecture Notes 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?