| Internet-Draft | SDN and Semantic Routing | February 2022 |
| Boucadair, et al. | Expires 6 August 2022 | [Page] |
Semantic Routing is the process of making routing and forwarding decisions based, not only on the destination IP address, but on other information carried in an IP packet. The intent is to facilitate enhanced routing decisions based on this information in order to provide differentiated forwarding paths for specific packet flows.¶
Software Defined Networking (SDN) places control of network elements (including all or some of their forwarding decisions) within external software components called controllers and orchestrators. This approach differs from conventional approaches that solely rely upon distributed routing protocols for the delivery of advanced connectivity services. By doing so, SDN aims to enable network elements to be simplified while still performing (some high level) forwarding function.¶
This document examines the applicability of SDN techniques to Semantic Routing and provides considerations for the development of Semantic Routing solutions in the context of SDN.¶
This Internet-Draft is submitted in full conformance with the provisions of BCP 78 and BCP 79.¶
Internet-Drafts are working documents of the Internet Engineering Task Force (IETF). Note that other groups may also distribute working documents as Internet-Drafts. The list of current Internet-Drafts is at https://datatracker.ietf.org/drafts/current/.¶
Internet-Drafts are draft documents valid for a maximum of six months and may be updated, replaced, or obsoleted by other documents at any time. It is inappropriate to use Internet-Drafts as reference material or to cite them other than as "work in progress."¶
This Internet-Draft will expire on 6 August 2022.¶
Copyright (c) 2022 IETF Trust and the persons identified as the document authors. All rights reserved.¶
This document is subject to BCP 78 and the IETF Trust's Legal Provisions Relating to IETF Documents (https://trustee.ietf.org/license-info) in effect on the date of publication of this document. Please review these documents carefully, as they describe your rights and restrictions with respect to this document. Code Components extracted from this document must include Revised BSD License text as described in Section 4.e of the Trust Legal Provisions and are provided without warranty as described in the Revised BSD License.¶
Service differentiation in the network can be enforced by manipulating a set of parameters that belong to distinct dimensions (e.g., forwarding, routing, traffic classification, resource partitioning). Among the techniques to achieve such differentiation, this document focuses on Semantic Routing, which refers to a process that is meant to provide differentiated forwarding paths for specific packet flows distinct from simple shortest path first routing and, thus, satisfy specific service/application requirements.¶
More concretely, Semantic Routing is the process of making routing and forwarding decisions based, not only on the destination IP address of a packet, but also by taking into account other information that is carried in the packet such as (but not limited to):¶
Section 3 provides more details about Semantic Routing.¶
Software Defined Networking (SDN) places (partial or full) control of network elements and their forwarding decisions within dedicated software components called controllers and orchestrators. This approach differs from those that solely rely upon distributed routing protocols. An ambition of SDN is to enable network elements to be simplified while the network is optimized to deliver value-added connectivity services. Refer to Section 2 for an overview of SDN.¶
This document examines the applicability of SDN to Semantic Routing (Section 4) and provides considerations for the development of Semantic Routing solutions in the context of SDN.¶
This version of the document does not elaborate on specific SDN protocols.¶
SDN refers to an approach for network programmability, that is, the capacity to initialize, control, and manage network behavior dynamically via open interfaces. Such programmability should facilitate the delivery of services in a deterministic, dynamic, and scalable manner.¶
SDN emphasizes the role of software in running networks by endorsing the separation between data and control planes. Even if such a separation has been adopted by most routing processes for decades (Section 2.1 of [RFC7149]), SDN focuses more on the power of "central" controllers to optimize route computation within a network before populating the Forwarding Information Base (FIB) of involved network elements.¶
The separation between control and data planes allows faster innovation in both planes, and enables a dynamic and flexible approach to implementing new network behaviors and reacting to changes in network state and traffic demands.¶
SDN has been discussed in many places during the last decade. For example, within the IRTF, [RFC7426] provides a concise reference for the SDN research community to address the questions of what SDN is, what the layer structure of an SDN architecture is, and how layers interface with each other within that architecture. [RFC7149] (published in the IETF stream) offers a service provider's perspective of the SDN landscape by describing requirements, issues, and other considerations about SDN. In particular, [RFC7149] classifies SDN techniques into the following functional domains:¶
SDN can be deployed following a recursive model that involves dedicated interfaces for both network and service optimization. Indeed, [RFC8597] differentiates the control functions associated with transport from those related to services in an approach called Cooperating Layered Architecture for Software-Defined Networking (CLAS).¶
In an SDN context, domain-specific controllers can be deployed with specific interactions between them as discussed in Section 4 of [RFC8309].¶
As described in [I-D.farrel-irtf-introduction-to-semantic-routing], Semantic Routing is the process of achieving enhanced routing decisions based on semantics added to IP headers to provide differentiated paths for different packet flows distinct from simple shortest path first routing. The additional information or "semantics" may be placed in existing header fields (such as the IPv6 Traffic Class field or the destination address) or may be achieved by adding fields to the header. Furthermore, it may be encoded in the payload or additional headers (such as in the port number fields or in an IPv6 Extension Header).¶
The application of Semantic Routing allows packets from different flows (even between the same applications on the same devices) to be marked for different treatment in the network. The packets may then be routed onto different paths according to the capabilities and states of the network links in order to meet the requirements of the flows. For example, one flow may need low latency, while another may require ultra low jitter, and a third may demand very high bandwidth.¶
Three elements are needed to achieve Semantic Routing:¶
All these elements can be matched to the SDN functional domains listed in Section 2. From that standpoint, this document provides more details on how SDN can be used to satisfy specific Semantic Routing needs.¶
Programmable Forwarding is the term applied to the use of control techniques to instruct network devices how to forward packets in a programmatic way.¶
Modern networks are designed to carry traffic that belongs to a variety of services/applications that have distinct traffic performance requirements, reliability and robustness expectations, and service-specific needs [RFC7665][RFC8517]. Such expectations, and other forwarding requirements that can be captured in a Service Level Agreement (SLA) [RFC7297], can be considered by providers when designing their networks in order to be able to deliver differentiated forwarding behaviors. However, conventional routing and forwarding procedures do not always offer the required functionalities for such differentiated service delivery. Thus, additional means have to be enabled in these networks for the sake of innovative service delivery while minimizing the induced complexity to operate such networks. Also, these means should be tweaked to ensure consistent forwarding behaviors network-wide.¶
The aforementioned means are not only extensions to routing protocols, but include other mechanisms that affect the forwarding behaviors within a network. An non-exhaustive list of sample capabilities that can be offered by appropriately controlling forwarding elements is provided below:¶
A network may host dedicated functions that implement resource pooling among many available paths or control which path is used to steer traffic as a function of the observed RTT (e.g., enable MPTCP converters [RFC8803] in specific network segments, including data centers as detailed in Section 2.1 of [RFC8041]).¶
There is a need to interact with the underlying forwarding elements to communicate a set forwarding policies that will ensure that such a differentiated service is provided to the specific flows. These forwarding policies include, for example, a set of rules that characterize the flows that are eligible to the resource pooling service or the scheduling policies (maximize link utilization, grab extra resources only when needed, etc.).¶
These polices are then enforced by programmable forwarders.¶
Some applications may have strict traffic performance requirements (e.g., a low one-way delay [RFC7679]), however the underlying network elements may not support a mechanism to disseminate performance metrics associated with specific paths and/or perform performance-based route selection (e.g., [I-D.ietf-idr-performance-routing]).¶
As an alternative, an off-line Semantic Routing approach can be used to collect measurement data to reach a given content (e.g., one-way delay to reach specific data centers), perform route selection based on this data, and then program the appropriate forwarding elements accordingly.¶
An important effort was made in the past to optimize the energy consumption of network elements. However, such optimization is node-specific and no standard means are supported to optimize the energy consumption at the scale of the network. For example, many nodes (also, service cards) are deployed as backups.¶
A controller-based approach can be implemented so that the route selection process optimizes the overall energy consumption of a path. Such a process takes into account the current load, avoids waking nodes/cards for handling "few" traffic (i.e., minor portion of traffic), considers node-specific data (e.g., [RFC7460]), etc. This off-line Semantic Routing approach will transition specific cards/nodes to "idle", wake them, etc., without breaking service objectives. Moreover, such an approach will have to maintain an up-to-date topology even if a node is in an "idle" state (such nodes may be removed from adjacency tables if they don't participate to routing advertisements).¶
In order to rationalize the delivery of advanced connectivity services, a network may need to be partitioned in order to address specific forwarding requirements of groups of services/applications. Network slicing [I-D.ietf-teas-ietf-network-slices] can be considered to deliver these services. However, an intelligence is needed to decide the criteria to be used to partition the available resources, filter them, decide whether network extensions are needed, ensure whether/how resource preemption is adequately implemented, etc.¶
These tasks are better achieved using a central intelligence that has direct visibility into the intents of applications, underlying network capabilities, local policies and guidelines, etc. As an output of processing these various inputs, a set of node-specific policies are generated, and then pushed using available SDN interface.¶
The next subsection further details which elements are needed when interacting with programmable forwarders in an SDN context.¶
SDN minimizes the required changes to legacy (interior) routing protocols. More concretely, SDN can be used to provide the intended Semantic Routing behavior, especially:¶
Program a subset of nodes (called boundary nodes) with the required classification and marking policies to bind flows with their intended Semantic Routing behavior.¶
In order to adequately process the application flows that require specific differentiated forwarding, SDN controllers maintain a table that allows to unambiguously identify such flows. The content of that table is used to derive the appropriate classification/match rules that are then communicated by an SDN controller to a set of forwarding elements.¶
When volatile data (e.g., dynamic IP addresses) is used to build such rules, it is the responsibility of the SDN controllers to update the rules whenever a new identifier is used. Failure to maintain "fresh" classification rules will lead to service failure/degradation.¶
At least three approaches can be considered by an SDN controller to accomplish the above tasks:¶
A hierarchical SDN design can also be considered, where specific controllers are enabled in each domain with dedicated interfaces to share data (e.g., radio bottleneck, expectations). These domains do not need to support the same technological implementation. The interaction between the SDN controllers eases the delivery of consistent Semantic Routing behaviors without requiring common domain configuration.¶
TBD¶
**SDN techniques as a whole are an instantiation of the policy-based management framework.***¶
Given the focus of SDN is the use within IP networks, semantic information that can be used in SDN-based semantic routing is limited to those fields being defined in related SDN specifications; see Section 2 for more information.¶
With this, SDN aligns with the concept of semantic routing [I-D.farrel-irtf-introduction-to-semantic-routing] in that it allows for range of packet header fields beyond mere IP addresses to be used in forwarding actions.¶
However, solutions have also been devised that "overwrite" existing protocol fields in order for them to be used in an SDN forwarding action outside their original semantics. [POINT2015][POINT2016] outline an example for such solution in which SDN is used for a path-based forwarding decision; while no "path" information is foreseen as an actionable packet header field in IPv6.¶
Here, the path is constructed by a path-computation element (PCE) that matches a given service name against previously announced locations where said service name is located. The path is represented as a concatenation of individual link information, which in turn is used to SDN node locally forward the packet after arrival. Given the binary structure of the end-to-end path information, the SDN forwarding operation can be implemented in a standard-compliant manner with its realization described in [ICC2016] as a arbitrary wildcard matching operation.¶
However, the constraint of acting only on limited packet fields requires that the path information needs transfer in one of those standard-defined packet header fields; thereby overwriting any existing packet header field. As described in [POINT2016], the IPv6 address fields are used for this purpose, representing the longest continuous binary field in the IPv6 header (256 bit in total), thereby allowing for representing topologies with up to 256 links.¶
Given the approach chosen in [POINT2016], any IPv6 address information, if needed, is provided in the encapsulated payload, leading to repetitive encapsulation overhead by carrying two IP headers in a single packet, one used for path-based forwarding and one for the operations in arriving endpoint. Only newer forwarding plane architectures, such as P4, would allow for removing such overhead by placing the path information into another packet header field (or even the payload as an extended header of sort) to act upon.¶
The programmability of SDN provides a fertile ground for forwarding decision that go beyond the reachability information provided through IPv4/v6 addresses, e.g., by using other packet header fields. This not only allows for extending the simple reachability-driven forwarding decision with richer, e.g., policy-based, decisions (as discussed in Section 5), it may also enable new forwarding paradigms per se, such as those in [POINT2016], which in turn may realize forwarding behaviours like multicast at much lower cost points and higher efficiency (see [ICC2016]).¶
However, SDN specifications have limited capabilities when it comes to the additional packet header fields that may be used for forwarding actions. As a consequence, "true" semantic routing on any semantic enhancement, which is included in the packet, is only possible in a manner limited to those fields.¶
Solutions such as those in [POINT2016], using methods outlined in [ICC2016], attempt to break this limitation albeit by overwriting standard-defined packet header fields, thereby changing the semantics of those fields within the realm of where the "re-defined" semantics are defined.¶
This limits any solution to a limited domain [RFC8799]. More importantly, the redefinition of packet fields poses the danger of exposing this (non standard compliant) semantic to elements outside the limited domain; semantic leakage may occur, requiring appropriate methods such as dedicated gateways for preventing such leakage. This can be seen in [POINT2016], where the boundaries to IP-compliant end devices and other domains alike are delimited by dedicated gateway elements. Those gateways usually act at higher layers than the SDN forwarding layer, thereby incurring complexity and often delay.¶
See also [I-D.king-irtf-challenges-in-routing] for a discussion of issues and concerns that need to be examined when applying a new routing or forwarding paradigm to a self-contained network or Internet.¶
SDN-related considerations are discussed in Section 5 of [RFC7149].¶
This document makes no requests for IANA action.¶
Thanks to George Polyzos for helpful comments on this work.¶
George Xylomenos Email: xgeorge@aueb.gr¶