3-Switching Flashcards

1
Q

How does a host learn the MAC address of another host?

A

ARP - Address Resolution Protocol

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Host queries with an IP Address:
“Who has IP address 130.207.160.47?”
Response is the MAC address corresponding to 130.207.160.47. Once the host receives the reply, it starts to build the ARP table.

A

ARP - Address Resolution Protocol

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

(When hosts wants to send a packet to a destination with a IP address… the hosts puts the IP packet and encapsulates it within an Ethernet frame with the corresponding destination MAC address.

A

ARP - Address Resolution Protocol

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

What are the queries and responses in ARP?

A

Query: Broadcast asking about IP
Response: Unicast with MAC address

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Creates a broadcast medium and is now replaced by switches in todays networks

A

Hubs

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Issues with Hubs

A

flooding, collisions of frames ->latency, failures/misconfig

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Perform some amount of traffic isolation by partitioning the LAN into separate segments. This type of isolation maps destination MAC to output port.

A

Switches

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Maintains a table between destination addresses and output ports on a switch.

A

Learning Switched

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Initially, the forwarding table is empty.

1) If no entry in forwarding table, the host would simply flood
2) Otherwise, send to output port in table
3) Switches in turn forward broadcast frames (e.g. ARP queries)

A

Learning switch

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Cycles

A

1) forwarding loops

2) Broadcast storms

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Solution for cycles?

A

Spanning trees - a loop free topology

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Construct Spanning Tree part 1

A

1) Elect root(switch with smallest ID)
2) Each switch must decide which of its links to include in the spanning tree. Excludes link if not on shortest path to root.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Construct Spanning Tree part 2 (determining the root)

A

Initially: every node thinks it is the root!

1) Each switch run an election process to determine smallest ID
2) Once smallest ID learned, it updates the view of root
3) Compute distance to new root

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Switches

A

Operate at layer 2 - common protocol at layer 2 is ethernet

  • auto-configuring
  • forwarding tends to be fast
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Routers

A

Typically operate at layer 3 where IP is the typical protocol
*Not restricted to spanning tree

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

SDN

A

Blurring the lines between layer 2 and layer 3 (Software defined networking)

17
Q

Buffer Sizing

A

B = 2T*C

18
Q

The more variables that we have, the narrower the gaussian will be

A

Central Limit Theorem (CLT)

19
Q

If TCP flows are synchronized

A

B=2T*C/square root of N