miswiring models for autonomic naming in a data center fabric

16
Miswiring models for autonomic naming in a data center fabric Keith Marzullo, UC San Diego Dept of CSE with Pardis Miri, Meg Walraed-Sullivan, and Amin Vahdat ... and others of the PortLand project Sunday, January 16, 2011

Upload: others

Post on 09-Jun-2022

1 views

Category:

Documents


0 download

TRANSCRIPT

Page 1: Miswiring models for autonomic naming in a data center fabric

Miswiring models for autonomic naming in a data center fabric

Keith Marzullo, UC San Diego Dept of CSEwith Pardis Miri, Meg Walraed-Sullivan, and Amin Vahdat

... and others of the PortLand project

Sunday, January 16, 2011

Page 2: Miswiring models for autonomic naming in a data center fabric

Architecture

with three levels and k port switches: 5k2/4 switches, k3/4 hostsSunday, January 16, 2011

Page 3: Miswiring models for autonomic naming in a data center fabric

UNRP: Autonomic naming

L3

L2

L1

Sunday, January 16, 2011

Page 4: Miswiring models for autonomic naming in a data center fabric

UNRP: Autonomic naming

L2

Sunday, January 16, 2011

Page 5: Miswiring models for autonomic naming in a data center fabric

UNRP: Autonomic naming

22 55 11 44

21 31 32 23

Sunday, January 16, 2011

Page 6: Miswiring models for autonomic naming in a data center fabric

Miswiring

Sunday, January 16, 2011

Page 7: Miswiring models for autonomic naming in a data center fabric

Modeling miswirings

First idea: use a threshold modelAssume graphs are d-deficient:

In n × n bipartite graph, each node has at least n − d edges

Sunday, January 16, 2011

Page 8: Miswiring models for autonomic naming in a data center fabric

The good and bad with this model

k-deficiency is a nice mathematical abstractionn and k are large, and so a large d should indicate many failures => unlikelydiameter of bipartite graphs are easily bounded in terms of d-deficiency

... but we rejected ithard to instantiateissues of fabric startup

Sunday, January 16, 2011

Page 9: Miswiring models for autonomic naming in a data center fabric

Model we used

Assume l levels; hosts connected to one (lowest) level

Assign addresses quickly and using few messagesThe closer to a fat tree, the better the addressesTwo hosts separated by more than 2 l −1 won’t be able to communicate with each otherDo diagnostics separately

Transfer risk of loss of reliability from instantiation to quality of immediate result

Reminiscent of graceful degradation

Sunday, January 16, 2011

Page 10: Miswiring models for autonomic naming in a data center fabric

In action

Sunday, January 16, 2011

Page 11: Miswiring models for autonomic naming in a data center fabric

In action

L2 L2L2 L2L2 L2L2

L3 L3 L2 L2

L1L1 L1L1 L1L1 L1L1

L1

Sunday, January 16, 2011

Page 12: Miswiring models for autonomic naming in a data center fabric

In action

L2 L2L2 L2L2 L2L2

L3 L3 L2 L2

L1L1 L1L1 L1L1 L1L1

L1

Sunday, January 16, 2011

Page 13: Miswiring models for autonomic naming in a data center fabric

In action

L2 L2L2 L2 L2L2

L3 L3

L1L1 L1L1 L1 L1L1L1

Sunday, January 16, 2011

Page 14: Miswiring models for autonomic naming in a data center fabric

In action

2 51 4 66

21 21,1 1 21

Sunday, January 16, 2011

Page 15: Miswiring models for autonomic naming in a data center fabric

In action

2 51 4 66

21 21,1 1 21

Sunday, January 16, 2011

Page 16: Miswiring models for autonomic naming in a data center fabric

Current work and questions

Allowing for hosts to be connected at any level

Level assignment becomes harderMiswiring model still appropriate?

DiagnosticsCan we be more precise about the closer to a fat tree, the better the addresses?

Sunday, January 16, 2011