Planesforthe Internet
Seminar inDistributedComputing ETHZürich
SamuelPasquier– psamuel@student.ethz.ch
Planesforthe Internet Seminar inDistributedComputing ETHZrich - - PowerPoint PPT Presentation
Planesforthe Internet Seminar inDistributedComputing ETHZrich SamuelPasquier psamuel@student.ethz.ch AboutaVision Motivation Increasingreliance onIPnetworks Increasingcomplexity of IP
Seminar inDistributedComputing ETHZürich
SamuelPasquier– psamuel@student.ethz.ch
handles individual packets
implements the distributed routing algorithm
monitorsthe network configuresDataPlanemechanism and Control
next-hop forwarding next-hop forwarding, tunneling, access control, address translation, queuing
FrontOffice DataCenter
i1.1 i3.1 i2.1 i2.2 i4.1 i4.2 i3.2 i1.2
R1 R3 R2 R5 R4
AFSubnet BFSubnet
KeithLowry, vicepresidentofsecurityoperations fornetworkconsultingfirmPilotNetworkServices
Today:objectivesexpressed inlow=level
Principle:Objectivesshould be expressed
Objectivesconcerning performance,reliability
R1 R3 R2 R5 R4 AFSubnet BFSubnet
Purpose:abstraction→ arobust network
Today:measurement supportadded asan
Principle:coherent snapshot of the stateof each
Timeand space dependant Informationabouttopology,traffic,events Purpose:arobust network
Today:Mgmt Planehas only indirectcontrol
Principle:only Controland Mgmt system
Nodecision logic should be hardwired Purpose:meet Network=level objectives
makes all the decisions (reachability,load
needs Network=wide view usesstandardalgorithms toturn Network=
Communicationsubstrate Disseminationpaths independant from data
Decision Plane Data Plane
Managementinformation states
Discovery Plane
Discovery of physical componentsand their
creates identifiers torepresent them
handles individual packets
Decision Planesatisfies network=level objectives
Decision Planeoperates onnetwork=wide view
Decision Planehas directcontrolover the
Collecting informationaboutnetworkelements Evaluating statements aboutnetwork’s state Reacting according toconclusiondrawn
+ Noaprioriassumption aboutpossiblestatesof the system + Programms and dataareequivalent
Tradeoff between most up
Ability tospecify evaluation times inthe past
Ability tospecify evaluation time inthe future
Analogy:Query planningindatabase systems Maybe better toevaluate some expressionsat some
Canrewriteoriginalexpressiontoobtain many
Network=wide view Unifiedapproach Sensor=Actuator principle
Explicitencoutering forcompositional
example:merging perspectivesand activities of two previous unconnected networks
Source:Niko Matsakis
Becausethey require:
… learn and reason:
= CSimproves when newsituationsarerecognized,new actionsperformed: the knowledge basegrows inuseful ways
… gainexperience and trust:
= CSis ultimately abletorecognize problems and toact
Distributed Constraint driven (system may adopt any behavior
Bottom=up (composition/decomposition of simple
Who would controlthis unified system? Aretraditional algorithms abletohandle such