1. BUILDING EFFICIENT SUPPORT FOR SEMANTICS IN NETWORKED INFRASTRUCTURE SYSTEMS I.Baldin, Y.Xin RENCI/UNC Chapel Hill [ibaldin,yxin]@renci.org CNS-1526964, 1526113

2. What is SERPENT (Semantically-Enabled Programmable NeTworked systems) about Software-defined networking (SDN) and infrastructure (SDI) Programmatically define the structure and behavior of virtual infrastructure Multi-tenant, multi-use Clouds and networking combined Declarative resource specifications using semantic web mechanisms Mechanisms for reasoning on resource allocations over the specifications using a query language Use queries as building blocks for more complex algorithms to allocate and manage the resources Collaboration with Kemafor Ogan of NCSU CS Dept 2

3. Why SERPENT Today cyber infrastructure representation is fragmented Many players Many languages, mostly XML/JSON dialects No way to reason or query in a systematic way Graph databases offer some path query capabilities, no semantics Semantic web offers mechanisms (RDF, OWL) to help describe resources in extensible manner Inference engines Query engines Doesn’t operate efficiently on typical problems in SDN/SDI Typically a variety of path problems Shortest path, disjoint paths, multi-layered paths Constrained path problems 3

4. Structural Path goes/does not go through nodes or links with certain property ContainsAny()/ContainsAll()/DoesNotContain() Semantic Objects and properties have classes according to schema/ontology Assist resource matching Perform path finding. Especially in multi-technology/multi-layer environment Raw-pc ExoGENI- M4 d820pc3000 linkedTo connectedTo

5. Example

6. Research questions How to efficiently operate on these? Using algebraic representations for paths with structural constraints and semantic constraints Combine them? Define query languages for expressing common path queries Optimize query planning and execution How to define typical path problems as queries How to build Software Defined Networking (SDN) controllers that take advantage of the queries 6

7. Thank you!