SDN-P4原版完整课件.pptx

《SDN-P4原版完整课件.pptx》由会员分享，可在线阅读，更多相关《SDN-P4原版完整课件.pptx（38页珍藏版）》请在淘文阁 - 分享文档赚钱的网站上搜索。

1、P4:Programming Protocol-Independent Packet ProcessorsP.Bosshart,D.Daly,G.Gibb,M.Izzard,N.McKeown,J.Rexford,C.Schlesinger,D.Talayco,A.Vahdat,G.Varghese,D.WalkerSIGCOMM CCR,2014Presented by Ye Tian for Course CS05112OverviewMotivationAbstract Forwarding ModelA Programming LanguageAn ExampleReviewMotiv

2、ationOver the past five years,OpenFlow has grown increasingly more complicatedThe proliferation of new header fields shows no signs of stopping.MotivationRather than repeatedly extending the OpenFlow specification,we argue that future switches should support flexible mechanisms for parsing packets a

3、nd matching header fields,allowing controller applications to leverage these capabilities through a common,open interface(i.e.,a new“OpenFlow 2.0”API).Such a general,extensible approach would be simpler,more elegant,and more future-proof than todays OpenFlow 1.x standard.MotivationP4:a higher-level

4、language for Programming Protocol-independent Packet ProcessorsConfigure a switch,telling it how packets are to be processedPopulate the forwarding tables in fixed function switchesThree goalsReconfigurableRedefine the packet parsing and processing in the field.Protocol independentthe controller sho

5、uld be able to specify a packet parser for extracting header fields with particular names and types anda collection of typed match+action tables that process these headerTarget independentCompiler should take the switchs capabilities into account when turning a target-independent description(written

6、 in P4)into a target-dependent programOverviewMotivationAbstract Forwarding ModelA Programming LanguageAn ExampleReviewAbstract Forwarding ModelA programming parserAllow new headers to be definedMultiple stages of match+actionIn series,parallel,or combination of bothCompare with OpenFlowFixed parser

7、Fixed series of actionsAbstract Forwarding ModelTwo types of operations:Configure operations program the parser,set the order of match+action stages,and specify the header fields processed by each stage.Static,offline wayPopulate operations add(and remove)entries to the match+action tables that were

8、 specified during configuration.Runtime Abstract Forwarding ModelArriving packets are first handled by the parser.Recognize and extract fields from the headerThe extracted header fields are then passed to the match+action tables.Ingress match+action table:determines the egress port(s)and determines

9、the queue into which the packet is placed.The packet may be forwarded,replicated,dropped,or trigger flow control.Egress match+action table:performs per-instance modifications to the packet headerAbstract Forwarding ModelPackets can carry additional information between stages,called metadata,which is

10、 treated identically to packet header fields.Example:inport,timestamp,etcQueueing:an action maps a packet to a queueOverviewMotivationAbstract Forwarding ModelA Programming LanguageAn ExampleReviewA Programming LanguageDependencies between the fieldsDetermine which table can be executed in parallelT

11、able Dependency Graphs(TDG)TDG nodes map directly to match+action tables,and a dependency analysis identifies where each table may reside in the pipeline.an example table dependency graph for an L2/L3 switch.A Programming LanguageTwo-step compilationAt the highest level,programmers express packet pr

12、ocessing programs using an imperative language representing the control flow(P4);Below this,a compiler translates the P4 representation to TDGs to facilitate dependency analysis and then maps the TDG to a specific switch target.OverviewMotivationAbstract Forwarding ModelA Programming LanguageAn Exam

13、pleReviewAn ExampleConsider an example L2 network deployment with top-of-rack(ToR)switches at the edge connected by a two-tier core.mTag:a combination of PortLand and MPLS.The routes through the core are encoded by a 32-bit tag composed of four single-byte fields.Each core switch need only examine o

14、ne byte of the tag and switch on that information.The tag is added by the first edge switch.P4 ConceptsA P4 program contains the following key componentsHeaders:describes the sequence and structure of a series of fields.Parsers:specify how to identify headers and valid header sequences within packet

15、s.Tables:Match+action tables are the mechanism for performing packet processing.Actions:Construction of complex actions from simpler protocol-independent primitives.Control Programs:determine the order of match+action tables that are applied to a packet.Header FormatsAn ordered list of names togethe

16、r with their widthEthernet and VLANHeader FormatsThe mTag header can be added without altering existing declarations.Each core switch is programmedwith rules to examine one of these bytes determined by its location in the hierarchy and the direction of travel.Output port on first and second levels u

17、p switch Output port on first and second levels down switchThe Packet ParserP4 assumes the underlying switch can implement a state machine that traverses packet headers from start to finish,extracting field values as it goes.P4 describes this state machine directly as the set of transitions from one

18、 header to the next.The Packet ParserStarts in the start state and proceeds until an explicit stop state is reached or an unhandled case is encounteredTable SpecificationThe edge switch matches on the L2 destination and VLAN ID,and selects an mTag to add to the header.The reads attribute declares wh

19、ich fields to match,qualified by the match type(exact,ternary,etc).The actions attribute lists the possible actions which may be applied to a packet by the table.The max size attribute specifies how many entries the table should support.The table specification allows a compiler to decide how much me

20、mory it needs,and the memory type(e.g.,TCAM or SRAM)to implement the table.Note that this is NOT the run-time packet processing logic.Table SpecificationBrief denfitions of other tablesBrief defitions of other tablesAction SpecificationP4 defines a collection of primitive actions from which more com

21、plicated actions are built.Action SpecificationIf an action needs parameters(e.g.,the up1 value for the mTag),it is supplied from the match table at runtime.P4s primitive actions include:set field:Set a specific field in a header to a value.copy field:Copy one field to another.add header:Set a speci

22、fic header instance(and all its fields)as valid.remove header:Delete(“pop”)a header(and all its fields)from a packet.increment:Increment or decrement the value in a field.checksum:Calculate a checksum over some set of header fields(e.g.,an IPv4 checksum).The Control ProgramSpecify the flow of contro

23、l from one table to the next.The Control ProgramThe source check table verifies consistency between the received packet and the ingress port.It also strips mTags from the packet,recording whether the packet had an mTag in metadata.The local switching table is then executed.If this table“misses“,it i

24、ndicates that the packet is not destined for a locally connected host.The mTag table is applied to the packet.Both local and core forwarding control can be processed by the egress check table which handles the case of an unknown destination by sending a notification up the SDN control stack.The Cont

25、rol ProgramCompiling packet parserThe compiler translates the parser description into a parsing state machineCompiling control programControl program:not explicitly call out dependencies between tables or opportunities for concurrency.Employ a compiler to analyze the control program to identify depe

26、ndencies and look for opportunities to process header fields in parallel.Finally,the compiler generates the target configuration for the switch.Compiling control programHow mTag can compiled on different targetsSoftware switch:The compiler directly maps the mTag table graph to switch tables.Hardware

27、 switches with RAM and TCAM:perform efficient exact-matching using RAM,matches on a subset of bits with TCAM.Switches supporting parallel tables:the tables mTag table and local switching can execute in parallel up to the execution of the action of setting an mTag.Compiling control programSwitches th

28、at apply actions at the end of the pipeline:In the mTag example,whether the mTag is added or removed could be represented in metadata.Switches with a few tables:Map a large number of P4 tables to a smaller number of physical tables.In the mTag example,the local switching could be combined with the mTag table.P4 forumThe newest specificationCompiler&switch sourcecodehttp:/p4.org/ReviewWhat motivates P4.What is the key differences with OpenFlow 1.x.The components of the abstract forwarding model of a switch in P4.The P4 language:The major components.