]> SCION Control Plane SCION Association
c_de_kater@gmx.ch
SCION Association
nic@scion.org
Anapaya Systems
hitz@anapaya.net
Internet-Draft This document describes the Control Plane of the path-aware, inter-domain network architecture SCION (Scalability, Control, and Isolation On Next-generation networks). A fundamental characteristic of SCION is that it gives path control to SCION-capable endpoints that can choose between multiple path options, thereby enabling the optimization of network paths. The Control Plane is responsible for discovering these paths and making them available to the endpoints. The SCION Control Plane creates and securely disseminates path segments between SCION Autonomous Systems (AS) which can then be combined into forwarding paths to transmit packets in the data plane. This document describes mechanisms of path exploration through beaconing and path registration. In addition, it describes how Endpoints construct end-to-end paths from a set of possible path segments through a path lookup process. This document contains new approaches to secure path aware networking. It is not an Internet Standard, has not received any formal review of the IETF, nor was the work developed through the rough consensus process. The approaches offered in this work are offered to the community for its consideration in the further evolution of the Internet. About This Document The latest revision of this draft can be found at . Status information for this document may be found at . Source for this draft and an issue tracker can be found at .
Introduction SCION is a path-aware internetworking routing architecture as described in . It allows endpoints and applications to select paths across the network to use for traffic, based on trustworthy path properties. SCION is an inter-domain network architecture and is therefore not concerned with intra-domain forwarding. SCION has been developed with the following goals: Availability - to provide highly available communication that can send traffic over paths with optimal or required characteristics, quickly handle inter-domain link or router failures (both on the last hop or anywhere along the path), and provide continuity in the presence of adversaries. Security - to introduce a new approach to inter-domain path security that leverages path awareness in combination with a unique trust model. The goal is to provide higher levels of trustworthiness in routing information to prevent traffic hijacking, and enable users to decide where their data travels based on routing information that can be unambiguously attributed to an AS, ensuring that packets are only forwarded along authorized path segments. A particular use case is to enable geofencing. Security properties are further discussed in . Scalability - to improve the scalability of the inter-domain control plane and data plane, avoiding existing limitations related to convergence and forwarding table size. The advertising of path segments is separated into a beaconing process within each Isolation Domain (ISD) and between ISDs which incurs minimal overhead and resource requirements on routers. SCION relies on three main components: PKI - To achieve scalability and trust, SCION organizes existing ASes into logical groups of independent routing planes called Isolation Domains (ISDs). All ASes in an ISD agree on a set of trust roots called the Trust Root Configuration (TRC) which is a collection of signed root certificates in X.509 v3 format . The ISD is governed by a set of core ASes which typically manage the trust roots and provide connectivity to other ISDs. This is the basis of the public key infrastructure used for the authentication of messages used by the SCION Control Plane. Control Plane - performs inter-domain routing by discovering and securely disseminating path information between ASes. The core ASes use Path-segment Construction Beacons (PCBs) to explore intra-ISD paths, or to explore paths across different ISDs. Data Plane - carries out secure packet forwarding between SCION-enabled ASes over paths selected by endpoints. A SCION border router reuses existing intra-domain infrastructure to communicate to other SCION routers or SCION endpoints within its AS. This document describes the SCION Control Plane component. It should be read in conjunction with the other components and . The SCION architecture was initially developed outside of the IETF by ETH Zurich with significant contributions from Anapaya Systems. It is deployed in the Swiss finance sector to provide resilient connectivity between financial institutions. The aim of this document is to document the existing protocol specification as deployed, to encourage interoperability among implementations, and to introduce new concepts that can potentially be further improved to address particular problems with the current Internet architecture. This document is not an Internet Standards Track specification; it does not have IETF consensus and it is published for informational purposes. Note (to be removed before publication): this document, together with the other components and , deprecates .
Terminology Autonomous System (AS): An Autonomous System is a network under a common administrative control. For example, the network of an Internet service provider, company, or university can constitute an AS. Beaconing: The Control Plane process where an AS discovers paths to other ASes. Control Plane: The SCION Control Plane is responsible for the propagation and discovery of network paths, i.e., for the exchange of routing information between SCION nodes. The Control Plane thus determines where traffic can be sent and deals with questions such as how paths are discovered, which paths exist, how they are disseminated to endpoints, etc. Within a SCION AS, such functionalities are carried out by the Control Service whereas packet forwarding is a task carried out by the data plane. Control Service: The Control Service is the main control plane infrastructure component within a SCION AS. It is responsible for the path exploration and registration processes that take place within the Control Plane. Core AS: Each Isolation Domain (ISD) is administered by a set of distinguished autonomous systems (ASes) called core ASes, which are responsible for initiating the path-discovery and -construction process (in SCION called "beaconing"). Each ISD MUST have at least one Core AS. Endpoint: An endpoint is the start or the end of a SCION path, as defined in . Forwarding Path: A forwarding path is a complete end-to-end path between two SCION endpoints which is used to transmit packets in the data plane. It can be created with a combination of up to three path segments (an up segment, a core segment, and a down segment). Hop Field (HF): As they traverse the network, Path Segment Construction Beacons (PCBs) accumulate cryptographically protected AS-level path information in the form of Hop Fields. In the data plane, Hop Fields are used for packet forwarding: they contain the incoming and outgoing Interface IDs of the ASes on the forwarding path. Info Field (INF): Each Path Segment Construction Beacon (PCB) contains a single Info field, which provides basic information about the PCB. Together with Hop Fields (HFs), these are used to create forwarding paths. Isolation Domain (ISD): In SCION, Autonomous Systems (ASes) are organized into logical groups called Isolation Domains or ISDs. Each ISD consists of ASes that span an area with a uniform trust environment (e.g. a common jurisdiction). Leaf AS: An AS at the "edge" of an ISD, with no other downstream ASes. Message Authentication Code (MAC). In the rest of this document, "MAC" always refers to "Message Authentication Code" and never to "Medium Access Control". When "Medium Access Control address" is implied, the phrase "Link Layer Address" is used. Path Segment: Path segments are derived from Path Segment Construction Beacons (PCBs). A path segment can be (1) an up segment (i.e. a path between a non-core AS and a core AS in the same ISD), (2) a down segment (i.e. the same as an up segment, but in the opposite direction), or (3) a core segment (i.e. a path between core ASes). Up to three path segments can be used to create a forwarding path. Path Segment Construction Beacon (PCB): Core AS control planes generate PCBs to explore paths within their isolation domain (ISD) and among different ISDs. ASes further propagate selected PCBs to their neighboring ASes. These PCBs traverse each AS accumulating information, including Hop Fields (HFs) which can subsequently be used for traffic forwarding. SCION Control Message Protocol (SCMP): A signaling protocol analogous to the Internet Control Message Protocol (ICMP). This is described in . Trust Root Configuration (TRC): A Trust Root Configuration or TRC is a signed collection of certificates pertaining to an isolation domain (ISD). TRCs also contain ISD-specific policies.
Conventions and Definitions The key words "MUST", "MUST NOT", "REQUIRED", "SHALL", "SHALL NOT", "SHOULD", "SHOULD NOT", "RECOMMENDED", "NOT RECOMMENDED", "MAY", and "OPTIONAL" in this document are to be interpreted as described in BCP 14 when, and only when, they appear in all capitals, as shown here.
Paths and Links SCION routers and endpoints connect to each other via links. A link refers to a physical or logical connection between two SCION nodes (e.g., router or endpoint). A SCION path between two endpoints traverses one or more links. In SCION, Autonomous Systems (ASes) are organized into logical groups called Isolation Domains or ISDs. Each ISD consists of ASes that are part of a uniform trust environment (i.e. a common jurisdiction) and is administered by a set of distinguished ASes called core ASes. SCION distinguishes three types of links between ASes: (1) core links, (2) parent-child links, and (3) peering links.
  • Core links connect two core ASes, which are either within the same or in different ISDs. Core links can exist for various reasons, including provider-customer (where the customer pays the provider for traffic) and peering relationships.
  • Parent-child links create a hierarchy between the parent and the child AS within the same ISD. ASes with a parent-child link typically have a provider-customer relationship.
  • Peering links exist between ASes with a (settlement-free or paid) peering relationship. They can be established between any two ASes (core or non-core) and can cross ISD boundaries.
SCION paths are comprised of at most three path segments: an up segment, traversing links from child to parent, then a core segment consisting of core links, followed by a down segment traversing links from parent to child. Each path segment is established over one or more links. SCION paths are always "valley free" whereby a child AS does not carry transit traffic from a parent AS to another parent AS. These paths can contain at most one peering link which can be used as shortcut between two path segments containing two peer ASes. shows the three types of links for one small ISD with two core ASes A and C, and four non-core ASes D,E,F, and G.
The three types of SCION links in one ISD. Each node in the figure is a SCION AS. ISD Core parent-child link AS A c c AS C c c core link p p peering link AS D p p AS E AS G AS F
Each link connecting SCION routers is bi-directional and is identified by its corresponding egress and ingress Interface IDs. An Interface ID is a 16-bit identifier as described in in section Terminology. It is required to be unique within each AS and can therefore be chosen without any need for coordination between ASes.
Routing SCION provides path-aware inter-domain routing between ASes across the Internet. The SCION Control Plane is responsible for discovering these inter-domain paths and making them available to the endpoints within the ASes. SCION inter-domain routing operates on two levels: within a ISD which is called intra-ISD routing, and between ISD which is called inter-ISD routing. Both levels use Path Segment Construction Beacons (PCBs) to explore network paths. A PCB is initiated by a core AS and then disseminated either within an ISD to explore intra-ISD paths, or among core ASes to explore core paths across different ISDs. The PCBs accumulate cryptographically protected path and forwarding information at an AS level and store this information in the form of Hop Fields. Endpoints use information from these Hop Fields to create end-to-end forwarding paths for data packets that carry this information in their headers. This also supports multi-path communication among endpoints. The creation of an end-to-end forwarding path consists of the following processes:
  1. Path exploration (or beaconing): This is the process where an AS discovers paths to other ASes. See also .
  2. Path registration: This is the process where an AS selects a few PCBs, according to defined policies, turns the selected PCBs into path segments, and adds these path segments to the relevant path infrastructure, thus making them available to other ASes. See also .
  3. Path resolution: This is the process of actually creating an end-to-end forwarding path from the source endpoint to the destination. For this, an endpoint performs (a) a path lookup step to obtain path segments, and (b) a path combination step to combine the forwarding path from the segments. This last step takes place in the data plane. See also .
All processes operate concurrently. The Control Service is responsible for the path exploration and registration processes in the Control Plane. It is the main control plane infrastructure component within each SCION AS and has the following tasks:
  • Generating, receiving, and propagating PCBs. Periodically, the Control Service of a core AS generates a set of PCBs, which are forwarded to the child ASes or neighboring core ASes. In the latter case, the PCBs are sent over policy compliant paths to discover multiple paths between any pair of core ASes.
  • Selecting and registering the set of path segments via which the AS wants to be reached.
  • Managing certificates and keys to secure inter-AS communication. Each PCB contains signatures of all on-path ASes and each time the Control Service of an AS receives a PCB, it validates the PCB's authenticity. When the Control Service lacks an intermediate certificate, it can query the Control Service of the neighboring AS that sent the PCB through the API described in .
Note: The Control Service of an AS is decoupled from SCION border routers. The Control Service of a specific AS is part of the Control Plane, is responsible for finding and registering suitable paths, and can be deployed anywhere inside the AS. Border routers are deployed at the edge of an AS and their main tasks are to forward data packets.
Path Segments SCION distinguishes the following types of path segments:
  • A path segment from a non-core AS to a core AS is an up segment.
  • A path segment from a core AS to a non-core AS is a down segment.
  • A path segment between core ASes is a core segment.
Each path segment starts and/or ends at a core AS. Path segments are not created between non-core ASes. All path segments may be reversed: a core segment can be used bidirectionally, an up segment can be converted into a down segment, and a down segment can be converted into an up segment depending on the direction of the end-to-end path. This means that all path segments can be used to send data traffic in both directions. The cryptographic protection of PCBs and path segments is based on the Control Plane PKI. The signatures are structured such that the entire message sequence constituting the path segment can be authenticated by anyone with access to this PKI. For fast validation of the path information carried in individual packets during packet forwarding, symmetric key cryptography is used and the Hop Fields contain a MAC. These MACs are structured to allow verification of the sequence of hops, but in contrast to the PCBs can only be validated by the border routers of the respective AS.
Addressing Inter-domain SCION routing is based on an <ISD, AS> tuple. Although a complete SCION address is composed of the <ISD, AS, endpoint address> 3-tuple, the endpoint address is not used for inter-domain routing or forwarding. The endpoint address is of variable length, does not need to be globally unique, and can thus be an IPv4, IPv6, or link layer address. Note: As a consequence of the fact that SCION relies on existing routing protocols (e.g. IS-IS, OSPF, SR) and communication fabric (e.g. IP, MPLS) for intra-domain forwarding, existing internal routers do not need to be changed to support SCION.
ISD Numbers An ISD number is the 16-bit global identifier for an ISD and MUST be globally unique. The following table gives an overview of the ISD number allocation: ISD number allocations
ISD Description
0 The wildcard ISD
1 - 15 Reserved for documentation and sample code (analogous to ).
16 - 63 Private use (analogous to ) - can be used for testing and private deployments
64 - 4094 Public ISDs - should be allocated in ascending order, without gaps and "vanity" numbers
4095 - 65535 Unallocated
The wildcard ISD is not directly used by the control or data plane. It may, however, be used by implementations to represent any ISD, for example in path filters. ISD numbers are currently allocated by Anapaya, a provider of SCION-based networking software and solutions (see ). This function is being transitioned to the SCION Association ().
SCION AS Numbers A SCION AS number is the 48-bit identifier for an AS. Although they play a similar role, there is no relationship between SCION AS numbers and BGP ASNs as defined by . For historical reasons some SCION Autonomous Systems use a SCION AS number where the first 16 bits are 0 and the remaining 32 bits are identical to their BGP ASN, but there is no technical requirement for this.
Wildcard Addressing SCION endpoints use wildcard AS 0 to designate any core AS, e.g. to place requests for core segments or down segments during path lookup. These wildcard addresses are of the form I-0, to designate any AS in ISD I. For more information, see .
SCION AS numbers AS number allocations
AS Size Description
0 1 The wildcard AS
1 - 4294967295 ~4.3 billion Public SCION AS numbers
1:0:0 - 1:ffff:ffff ~4.3 billion Unallocated
2:0:0 - 2:ffff:ffff ~4.3 billion Public SCION AS numbers
3:0:0 - feff:ffff:ffff ~280 trillion Unallocated
ff00:0:0 - ff00:0:ffff 65536 Reserved for documentation and sample code (analogous to )
ff00:1:0 - ffa9:ffff:ffff ~730 billion Unallocated
ffaa:0:0 - ffaa:ff:ffff ~16.8 million Reserved for private use (analogous to ) - these numbers can be used for testing and private deployments
ffaa:100:0 - ffff:ffff:fffe ~369 billion Unallocated
ffff:ffff:ffff 1 Reserved
Text Representation
ISD numbers The text representation of SCION ISD numbers MUST be its decimal ASCII representation.
AS numbers The text representation of SCION AS numbers is as follows:
  • SCION AS numbers in the lower 32-bit range MUST be printed as decimal by implementations. Implementations may parse AS numbers in the lower 32-bit range in hexadecimal notation too (e.g., a program may accept AS number '0:1:f' for AS 65551).
  • SCION AS numbers in the higher 32-bit range MUST be printed using big-endian hexadecimal notation in 3 groups of 4, in the range 1:0:0 to ffff:ffff:ffff. Leading zeros in each group are omitted, with the exception that one zero MUST be notated if a group is entirely zeros (e.g., 1:0:1). The :: zero-compression feature of IPv6 MUST NOT be used.
  • A range of AS numbers can be shortened with a notation similar to the one used for CIDR IP ranges (). In such case, hexadecimal notation MUST be used. For example, the range of the lowest 32-bit AS numbers (0-4294967295) can be represented as 0:0:0/16.
<ISD, AS> tuples The text representation of SCION addresses MUST be <ISD>-<AS>, where <ISD> is the text representation of the ISD number, <AS> is the text representation of the AS number, and - is the literal ASCII character 0x2D. This text representation is used for the ISD-AS number attribute in the certificates (see ). For example, the text representation of AS number ff00:0:1 in ISD number 15 is 15-ff00:0:1.
Bootstrapping ability A secure and reliable routing architecture has to be designed specifically to avoid circular dependencies during network bootstrapping. One goal is that the SCION network can start up even after large outages or attacks, in addition to avoiding cascades of outages caused by fragile interdependencies. This section lists the concepts SCION uses to prevent circular dependencies:
  • Neighbor-based path discovery: Path discovery in SCION is performed by the beaconing mechanism. In order to participate in this process, an AS only needs to be aware of its direct neighbors. As long as no path segments are available, communicating with the neighboring ASes is possible with the one-hop path type which does not rely on any path information. SCION uses these one-hop paths to propagate PCBs to neighboring ASes to which no forwarding path is available yet. The One-Hop Path Type is described in more detail in .
  • Path reversal: In SCION, every path is reversible. That is, the receiver of a packet can reverse the path in the packet header in order to produce a reply packet without having to perform a path lookup. Such a packet follows the original packet's path backwards.
  • Availability of certificates: In SCION, every entity is required to be in possession of all cryptographic material (including the ISD's TRC and certificates) that is needed to verify any message it sends. This (together with the path reversal) means that the receiver of a message can always obtain all this material by contacting the sender. This avoids circular dependencies between the PKI and connectivity.
Note: For a detailed description of a TRC and more information on the availability of certificates and TRCs, see .
Resistance to partitioning Partitioning occurs when a network splits into two because of link failures. Partitioning of the global SCION inter-domain network is much less likely to happen, thanks to its path awareness that exposes multiple paths between SCION ASes. Even during failures there is no special failure mode required as SCION-enabled ASes can always switch to already known paths that use other links. Recovering from a partitioned network is also seamless as only coarse time synchronization between the partitions is required to resume normal operation and move forward with updates of the cryptographic material. further describes the impact of time synchronization and path discovery time.
Communication Protocol All communication between the Control Services in different ASes is expressed in terms of RPC remote procedure calls. Service interfaces and messages are defined in the Protocol Buffer "proto3" interface definition language (for details, see ). The RPC messages are transported via 's RPC protocol that carries messages over HTTP/3 (see )), which in turn uses QUIC/UDP () as a transport layer. Connect is backwardly compatible with which is supported but deprecated. In case of failure, RPC calls return an error as specified by the RPC framework. That is, a non-zero status code and an explanatory string. provides details about the establishment of the underlying QUIC connections.
Path Exploration or Beaconing
Introduction and Overview Path Exploration is the process where an AS discovers paths to other ASes. In SCION, this process is referred to as beaconing and this section provides a detailed explanation of this. In SCION, the Control Service of each AS is responsible for the beaconing process. The Control Service generates, receives, and propagates the Path Segment Construction Beacons (PCBs) on a regular basis, to iteratively construct path segments. PCBs contain inter-domain topology and authentication information, and can also include additional metadata that helps with path management and selection. The beaconing process itself is divided into routing processes on two levels, where core or inter-ISD is based on the (selective) sending of PCBs without a defined direction, and intra-ISD beaconing on top-to-bottom propagation. Beaconing is initiated by core ASes, therefore each ISD MUST have at least one core AS.
  • Core or Inter-ISD beaconing is the process of constructing path segments between core ASes in the same or in different ISDs. During core beaconing, the Control Service of a core AS either initiates PCBs or propagates PCBs received from neighboring core ASes to other neighboring core ASes. PCBs are periodically sent over policy compliant paths to discover multiple paths between any pair of core ASes.
  • Intra-ISD beaconing creates path segments from core ASes to non-core ASes. For this, the Control Services of core ASes create PCBs and sends them to the non-core child ASes (typically customer ASes) at regular intervals. The Control Service of a non-core child AS receives these PCBs and forwards them to its child ASes, and so on until the PCB reaches an AS without any children (leaf AS). As a result, all ASes within an ISD receive path segments to reach the core ASes of their ISD and register reciprocal segments with the Control Service of the associated core ASes.
On its way, a PCB accumulates cryptographically protected path and forwarding information per traversed AS. At every AS, metadata as well as information about the AS's ingress and egress interfaces is added to the PCB. The full PCB message format is described in . PCBs are used to construct path segments. ASes register them to make them available to other ASes, as described in .
Peering Links PCBs do not traverse peering links. Instead, peering links are announced along with a regular path in a PCB. If both ASes at either end of a peering link have registered path segments that include this specific peering link, then it is possible to use this peering link during segment combination to create the end-to-end path.
Appending Entries to a PCB Every propagation interval (as configured by the AS), the Control Service:
  • selects the best combinations of PCBs and interfaces connecting to a neighboring AS (i.e. a child AS or a core AS). This is described in .
  • propagates each selected PCB to the selected egress interface(s) associated with it. This is described in .
For every selected PCB and egress interface combination, the AS appends an AS entry to the selected PCB. This includes a Hop Field that specifies the ingress and egress interface for the packet forwarding through this AS, in the beaconing direction. The AS entry can also contain peer entries.
PCB Propagation - Illustrated Examples The following three figures show how intra-ISD PCB propagation works, from the ISD's core AS down to child ASes. Interface identifiers of each AS are numbered with integer values while ASes are described with an upper case letter for the sake of illustration. In below, core AS X sends the two different PCBs "a" and "b" via two different links to child AS Y: PCB "a" leaves core AS X via egress interface "2", whereas PCB "b" is sent over egress interface "1". Core AS X adds the respective egress information to the PCBs when sending them off, as can be seen in the figure (the entries "Core - Out:2" and "Core - Out:1", respectively).
Intra-ISD PCB propagation from the ISD core to child ASes - Part 1 Core AS X 2 1 PCB a PCB b PCB a PCB b Core Core - Out:2 - Out:1 AS Y +========+ | Core | +--+--+ | | +--+--+ |Core | |- Out:2 | | | | | |- Out:1 | +--------+ v | | v +--------+ o o +----+---+----+ | AS Y | ]]>
AS Y receives the two PCBs "a" and "b" through two different (ingress) interfaces, namely "2" and "3", respectively (see below). Additionally, AS Y forwards to AS Z four PCBs that were previously sent by core AS X. For this, AS Y uses the two different (egress) links "5" and "6". AS Y appends the corresponding ingress and egress interface information to the four PCBs. As can be seen in the figure, AS Y also has two peering links to its neighboring peers V and W, through the interfaces "1" and "4", respectively - AS Y includes this information in the PCBs, as well. Thus, each forwarded PCB cumulates path information on its way "down" from core AS X.
Intra-ISD PCB propagation from the ISD core to child ASes - Part 2 PCB a PCB b 2 3 p p 1 AS V AS Y AS W 4 p p 6 5 PCB c PCB d Core X Core X - Out:2 - Out:2 PCB e AS Y <- PCB c PCB d -> AS Y PCB f -In:2 -In:2 Core X -Out:6 -Out:5 Core X - Out:1 -PeerV:1 -PeerV:1 - Out:1 -PeerW:4 -PeerW:4 AS Y AS Y -In:3 -In:3 -Out:6 PCB e PCB f -Out:5 -PeerV:1 -PeerV:1 -PeerW:4 -PeerW:4 AS Z |AS Y | | PCB f | +========+ |-In:2 | +--+--+ | | +--+--+ |-In:2 | +========+ |Core X | |-Out:6 | | | | | |-Out:5 | |Core X | |- Out:1 | |-PeerV:1| v | | v |-PeerV:1| |- Out:1 | +--------+ |-PeerW:4| | | |-PeerW:4| +--------+ |AS Y | +--------+ | | +--------+ |AS Y | |-In:3 | +-----+ | | +-----+ |-In:3 | |-Out:6 | <------------|PCB e| | | |PCB f|------------> |-Out:5 | |-PeerV:1| +--+--+ | | +--+--+ |-PeerV:1| |-PeerW:4| | | | | |-PeerW:4| +--------+ v | | v +--------+ o o +----+---+----+ | AS Z | ]]>
The following figure shows how the four PCBs "c", "d", "e", and "f", coming from AS Y, are received by AS Z over two different links: PCBs "c" and "e" reach AS Z over ingress interface "5", whereas PCBs "d" and "f" enter AS Z via ingress interface "1". Additionally, AS Z propagates PCBs "g", "h", "i", and "j" further down, all over the same link (egress interface "3"). AS Z extends the PCBs with the relevant information, so that each of these PCBs now includes AS hop entries from core AS X, AS Y, and AS Z.
Intra-ISD PCB propagation from the ISD core to child ASes - Part 3 PCB c PCB d PCB e PCB f 5 1 AS Z PCB g 3 PCB h Core X Core X - Out:2 - Out:2 PCB i PCB j AS Y AS Y Core X -In:2 -In:2 Core X - Out:1 -Out:6 -Out:5 - Out:1 -PeerV:1 <- PCB g PCB h -> -PeerV:1 AS Y -PeerW:4 -PeerW:4 AS Y -In:3 -In:3 -Out:6 AS Z AS Z Out:5 -PeerV:1 -In:5 -In:1 -PeerV:1 -PeerW:4 -Out:3 -Out:3 -PeerW:4 AS Z AS Z -In:5 PCB i PCB j -In:1 -Out:3 -Out:3 |-PeerV:1| +--------+ |AS Y | |-PeerW:4| +--+--+ | +--+--+ |-PeerW:4| |AS Y | |-In:3 | +--------+ | | | +--------+ |-In:3 | |-Out:6 | |AS Z | v | v |AS Z | |Out:5 | |-PeerV:1| |-In:5 | | |-In:1 | |-PeerV:1| |-PeerW:4| |-Out:3 | | |-Out:3 | |-PeerW:4| +--------+ +--------+ | +--------+ +--------+ |AS Z | +-----+ | +-----+ |AS Z | |-In:5 | <-------------|PCB i| | |PCB j|------------> |-In:1 | |-Out:3 | +--+--+ | +--+--+ |-Out:3 | +--------+ | | | +--------+ v o v | ]]>
Based on the figures above, one could say that a PCB represents a single path segment. However, there is a difference between a PCB and a registered path segment as a PCB is a so-called "travelling path segment" that accumulates AS entries when traversing the Internet. A registered path segment is instead a "snapshot" of a travelling PCB at a given time T and from the vantage point of a particular AS A. This is illustrated by . This figure shows several possible path segments to reach AS Z, based on the PCBs "g", "h", "i", and "j" from above. It is up to AS Z to use all of these path segments or just a selection of them.
Possible up- or down segments for AS Z AS Entry Core AS Entry Y AS Entry Z Core AS X AS Y AS Z Path Segment 1 1 3 5 1 2 2 6 5 Egress 2 Ingress 2 - Egress 6 Ingress 5 Core AS X AS Y AS Z 1 3 5 1 Path Segment 2 2 2 6 5 Egress 2 Ingress 2 - Egress 5 Ingress 1 Core AS X AS Y AS Z 1 3 5 1 Path Segment 3 2 2 6 5 Egress 1 Ingress 3 - Egress 6 Ingress 5 Core AS X AS Y AS Z 1 3 5 1 Path Segment 4 2 2 6 5 Egress 1 Ingress 3 - Egress 5 Ingress 1
PCB Message Format Each PCB is comprised of a message containing the following top-level fields:
PCB Top-Level Message Format Segment Info AS Entry 0 AS Entry 1 ... AS Entry N
Each PCB MUST consist of at least:
  • An information field with an identifier and a timestamp.
  • Entries of all ASes on the path segment represented by this PCB.
The following code block defines the PCB at the top level in Protobuf message format.
  • segment_info: This field is used as input for the PCB signature. It is the encoded version of the component SegmentInformation, which provides basic information about the PCB. The SegmentInformation component is specified in detail in .
  • as_entries: Contains the ASEntry component of all ASes on the path segment represented by this PCB.
    • ASEntry: The ASEntry component contains the complete path information of a specific AS that is part of the path segment represented by the PCB. The ASEntry component is specified in detail in .
The information to be included in each of these fields is described below.
Segment Information
Segment Information Component Segment Info Timestamp Seg ID
Each PCB MUST include an information component with basic information about the PCB. In the Protobuf message format, the information component of a PCB is called the SegmentInformation message. The following code block shows the Protobuf message definition for the SegmentInformation message.
  • timestamp: The 32-bit timestamp indicates the creation time of this PCB. It is set by the originating core AS and the expiration time of each Hop Field in the PCB is computed relative to this timestamp. The timestamp is encoded as the number of seconds elapsed since the POSIX Epoch (1970-01-01 00:00:00 UTC).
  • segment_id: The 16-bit identifier of this PCB and the corresponding path segment. The segment ID is REQUIRED for the computation of the message authentication code (MAC) of an AS's Hop Field. The MAC is used for Hop Field verification in the data plane and the originating core AS MUST fill this field with a cryptographically random number.
Note: See for more information on the Hop Field message format. provides a detailed description of the computation of the MAC and the verification of the Hop Field in the data plane.
AS Entry
AS Entry AS Entry Unsigned Extension Signed AS Entry
Each PCB MUST also contain the entries of all ASes included in the corresponding path segment. This means that the originating core AS MUST add its AS entry to each PCB it creates, and each traversed AS MUST attach its AS entry to the PCB. One AS entry contains the complete hop information for this specific AS in this specific path segment. It consists of a signed and an unsigned component. The code block below defines an AS entry ASEntry in Protobuf message format. It includes the following components:
  • SignedMessage: The AS entry signed component.
  • PathSegmentUnsignedExtensions: Optional unsigned PCB extensions, further described in .
AS Entry Signed Component Signed AS Entry Signature Header Body
Each AS entry of a PCB MUST include a signed component as well as a signature computed over the signed component. Each AS entry MUST be signed with the Control Plane AS Certificate (see ). The signed component of an AS entry MUST include the following elements:
  • a header,
  • a body, and
  • a signature.
In the Protobuf message format implementation, the signed component of an AS entry is specified by the SignedMessage. It consists of a header-and-body part (header_and_body) and a raw signature (signature). See also the code block below. Protobuf definition of the HeaderAndBody message used for signature computation input.
  • For the specification of the signed header, see .
  • For the specification of the signed body, see .
  • For the specification of the signature field, see .
AS Entry Signed Header
AS Entry Signed Header Header Sig. Alg. Verification Key ID Timestamp Metadata AssocDataLen ISD-AS TRC Base TRC Serial Subject Key ID
The header part carries information that is relevant to the computation and verification of the signature. It contains the following fields:
  • signature_algorithm: Specifies the algorithm to compute the signature. This field is REQUIRED. Possible types are defined by the SignatureAlgorithm definition. An unspecified signature algorithm is never valid. Other algorithms or curves MAY be used in the future. Signature algorithms are further discussed in .
  • verification_key_id: Contains a VerificationKeyID message, carrying information relevant to signing and verifying PCBs and other control-plane messages. This field is REQUIRED.
  • timestamp: Defines the signature creation timestamp. This field is OPTIONAL.
  • metadata: it may include metadata. This field is OPTIONAL. While it is part of the generic Header message format, it MUST be empty in an AS entry signed header.
  • associated_data_length: Specifies the length of the data covered by the signature but not included within the header or body. This data contains information about preceding AS entries, as described in . The value of this field is zero if no associated data is covered by the signature.
The Header and SignatureAlgorithm protobuf message definitions are: The VerificationKeyID message contains the following REQUIRED fields:
  • isd_as: The ISD-AS number of the current AS.
  • subject_key_id: Refers to the certificate that contains the public key needed to verify this PCB's signature.
  • trc_base: Defines the base number of the latest Trust Root Configuration (TRC) available to the signer at the time of the signature creation.
  • trc_serial: Defines the serial number of the latest TRC available to the signer at the time of the signature creation.
Its protobuf message definition is: For more information on signing and verifying control plane messages (such as PCBs), see 'Signing and Verifying Control Plane Messages' in . For more information on the TRC base and serial number, see 'Trust Root Configuration Specification' in .
AS Entry Signed Body
AS Entry Signed Body Body ISD-AS Next ISD-AS Hop Entry Peer Entry 0 ... Peer Entry N MTU Ext.
The body of an AS entry MUST consist of the signed component ASEntrySignedBody of all ASes in the path segment represented by the PCB, up until and including the current AS. The following code block defines the signed body of one AS entry in Protobuf message format (called the ASEntrySignedBody message).
  • isd_as: The ISD-AS number of the AS that created this AS entry.
  • next_isd_as: The ISD-AS number of the downstream AS to which the PCB MUST be forwarded. The presence of this field prevents path hijacking attacks, as further discussed in .
  • hop_entry: The hop entry (HopEntry) with the information required to forward this PCB through the current AS to the next AS. This information is used in the data plane. For a specification of the hop entry, see .
  • peer_entries: The list of optional peer entries (PeerEntry). For a specification of one peer entry, see .
  • mtu: The maximum transmission unit (MTU) that is supported by all intra-domain links within the current AS. This value is set by the control service when adding the AS entry to the beacon. How the control service obtains this information is implementation dependent. Current practice is to make it a configuration item.
  • extensions: List of (signed) extensions (optional). PCB extensions defined here are part of the signed AS entry. This field SHOULD therefore only contain extensions that include important metadata for which cryptographic protection is required. For more information on PCB extensions, see .
Hop Entry
Hop Entry Hop Entry Ingress MTU Hop Field
Each body of an AS entry MUST contain exactly one hop entry component. The hop entry component specifies forwarding information which the data plane requires to create the hop through the current AS (in the direction of the beaconing). The following code block defines the hop entry component HopEntry in Protobuf message format:
  • hop_field: Contains the authenticated information about the ingress and egress interfaces in the direction of beaconing. Routers need this information to forward packets through the current AS. For further specifications, see .
  • ingress_mtu: Specifies the maximum transmission unit (MTU) of the ingress interface (in beaconing direction) of the hop being described. The MTU of paths constructed from the containing beacon is necessarily less than or equal to this value. How the control service obtains the MTU of an inter-AS link is implementation dependent. It may be discovered or configured. Current practice to make it a configuration item. Path MTU is further discussed in .
In this description, MTU and packet size are to be understood in the same sense as in . That is, exclusive of any layer 2 framing or packet encapsulation (for links using an underlay network).
Peer Entry
Peer Entry Peer Entry Hop Field Peer MTU Peer ISD-AS Peer Interface
By means of a peer entry, an AS can announce that it has a peering link to another AS. A peer entry is an optional component of a PCB - it is only included if there is a peering link to a peer AS. The following code block defines the peer entry component PeerEntry in Protobuf message format:
  • peer_isd_as: The ISD-AS number of the peer AS. This number is used to match peering segments during path construction.
  • peer_interface: The 16-bit interface identifier of the peering link on the peer AS side. This identifier is used to match peering segments during path construction.
  • peer_mtu: Specifies the maximum transmission unit (MTU) of the peering link being described. The MTU of paths via such link is necessarily less than or equal to this value. How the control service obtains the MTU of an inter-AS link is implementation dependent. It may be discovered or configured, but current practice is to make it a configuration item.
  • hop_field: Contains the authenticated information about the ingress and egress interfaces in the current AS (coming from the peering link, in the direction of beaconing - see also ). The data plane needs this information to forward packets through the current AS. For further specifications, see .
In this description, MTU and packet size are to be understood in the same sense as in . That is, exclusive of any layer 2 framing or packet encapsulation (for links using an underlay network).
Peer entry information, in the direction of beaconing Parent AS ASE.HF.ingress_interface PE.peer_ interface p p Peer AS PE.HF.ingress_ interface PE.HF.egress_interface ASE.HF.egress_interface Child AS
Hop Field
Hop Field Hop Entry Ingress Egress Expiration Time MAC
The Hop Field, part of both hop entries and peer entries, is used directly in the data plane for packet forwarding and specifies the incoming and outgoing interfaces of the ASes on the forwarding path. This information is authenticated with a Message Authentication Code (MAC) which is used by the Control Service of an AS to authenticate path segments with its border routers during packet forwarding. The algorithm used to compute the Hop Field MAC is an AS-specific choice, although the Control Services and border routers within an AS MUST use the same algorithm. Implementations MUST also support the Default Hop Field MAC algorithm. See section "Authorizing Segments through Chained MACs") for more information including configuration. Endpoints do not compute MACs. The following code block defines the Hop Field component HopField in Protobuf message format:
  • ingress: The 16-bit ingress interface identifier (in the direction of the path construction, that is, in the direction of beaconing through the current AS).
Note: For the core AS that initiates the PCB, the ingress interface identifier MUST be set to the "unspecified" value (see section Terminology).
  • egress: The 16-bit egress interface identifier (in the direction of beaconing).
  • exp_time: The 8-bit encoded expiration time of the Hop Field, indicating its validity. This field expresses a duration in seconds according to the formula: duration = (1 + exp_time) * (24*60*60/256). The minimum duration is therefore 337.5 s. This duration is relative to the PCB creation timestamp set in the PCB's segment information component (see also ). Therefore, the absolute expiration time of the Hop Field is the sum of these two values.
  • mac: The message authentication code (MAC) used in the data plane to verify the Hop Field, as described in .
AS Entry Signature Each AS entry MUST be signed with the AS certificate's private key Ki. The certificate MUST have a validity period that is longer than the Hop Field absolute expiration time (described in ). The signature Sigi of an AS entry ASEi is computed over the AS entry's signed component. This is the input for the computation of the signature:
  • The signed header and body of the current AS (header_and_body).
  • The segment_info component of the current AS. This is the encoded version of the SegmentInformation component containing basic information about the path segment represented by the PCB. For the specification of SegmentInformation, see .
  • The signed header_and_body/signature combination of each previous AS on this specific path segment.
The signature Sigi of an AS entry ASEi is now computed as follows: Sigi = Ki( ASEi(signed) || SegInfo || ASE0(signed) || Sig0 || ... || ASEi-1(signed) || Sigi-1 ) The signature metadata minimally contains the ISD-AS number of the signing entity and the key identifier of the public key to be used to verify the message. For more information on signing and verifying control plane messages, see 'Signing and Verifying Control Plane Messages' in . Some of the data used as an input to the signature comes from previous ASes in the path segment. This data is therefore called "associated data" and it gives the signature a nested structure. The content of associated data defined in Protobuf is:
PCB Extensions AS entries in PCBs may carry a number of optional extensions that accumulate information while traveling across ASes. Extensions can be:
  • Unsigned extensions PathSegmentUnsignedExtensions. They are part of the AS entry component (the ASEntry message, see also ).
  • Signed extensions PathSegmentExtensions. They are part of the signed body component of an AS entry (the ASEntrySignedBody message, see also ).
It is recommended to keep the size of signed extensions small, since they are an integral part of the input to every AS’s signature. The example below contains the Protobuf definition of the StaticInfoExtension. It is a signed extension that is used to carry path segment metadata, such as segment latency, bandwidth, router coordinates, link type, number of internal hops. This and other extensions are at time of writing experimental. We therefore omit definitions of the StaticInfoExtension message format and refer to .
PCB Validity To be valid (that is, usable to construct a valid path), a PCB MUST:
  • Contain valid AS Entry signatures ().
  • Have a timestamp () that is not later than the current time at the point of validation, plus an allowance for differences between the clocks of the validator and originator.
  • Contain only unexpired hops ().
It is recommend to use the hopfield expiration time (that is 337.5 seconds, see ) as the allowance for differences between the clocks of the validator and originator. For the purpose of validation, a hop is considered expired if its absolute expiration time, calculated as defined in , is later than the current time + allowance at the point of validation.
Configuration For the purpose of constructing and propagating path segments, an AS Control Service must be configured with links to neighboring ASes. Such information may be conveyed to the Control Service in an out-of-band fashion (e.g in a configuration file). For each link, these values MUST be configured:
  • Local Interface ID. This MUST be unique within each AS.
  • Neighbor type (core, parent, child, peer), depending on link type (see ). Link type depends on mutual agreements between the organizations operating the ASes at each end of each link.
  • Neighbor ISD-AS number
  • Neighbor interface underlay address
The maximum MTU supported by all intra-AS links may also be configured by the operator.
Propagation of PCBs This section describes how PCBs are received, selected and further propagated in the path exploration process.
Reception of PCBs Upon receiving a PCB, the Control Service of an AS performs the following checks:
  1. PCB validity: It verifies the validity of the PCB (see ) and invalid PCBs MUST be discarded. The PCB contains the version numbers of the TRC(s) and certificate(s) that MUST be used to verify its signatures which enables the Control Service to check whether it has the relevant TRC(s) and certificate(s). If not, they can be requested from the Control Service of the sending AS through the API described in .
  2. Loop avoidance: If it is a core AS, the Control Service MUST check whether the PCB includes duplicate hop entries created by the core AS itself or by other ASes. If so, the PCB MUST be discarded in order to avoid loops. This step is necessary because core beaconing is based on propagating PCBs to all AS neighbors. Additionally, core ASes SHOULD discard PCBs that were propagated at any point by a non-core AS. Ultimately, core ASes MAY make a policy decision to propagate beacons containing path segments that traverse the same ISD more than once as this can be legitimate, e.g. if the ISD spans a large geographical area, a path between different ASes transiting another ISD may constitute a shortcut.
  3. Incoming Interface: the last ISD-AS entry in a received PCB (in its AS Entry Signed Body) MUST coincide with the ISD-AS neighbor of the interface where the PCB was received. In addition, the corresponding link MUST be core or parent. If not, the PCB MUST be discarded.
  4. Continuity: when a PCB contains two or more AS entries, the receiver Control Service MUST check every AS entry except the last and discard beacons where the ISD-AS of an entry does not equal the ISD-AS of the next entry.
If the PCB verification is successful, the Control Service decides whether to store the PCB as a candidate for propagation based on selection criteria and polices specific for each AS.
Storing Candidate PCBs An AS stores candidate PCBs in a temporary storage called the Beacon Store. The management of this storage is implementation defined. Current practice is to retain all PCBs until expired or replaced by one describing the same path with a later origination time.
PCB Selection Policies An AS MUST select which PCBs to propagate further. The selection process can inspect and compare the properties of the candidate PCBs (e.g. length, disjointness across different paths, age, expiration time) and/or take into account which PCBs have been propagated in the past. The PCBs to select or eliminate is determined by the policy of the AS. In order to avoid excessive overhead on the path discovery system in bigger networks, an AS should only propagate those candidate PCBs with the highest probability of meeting the needs of the endpoints that will perform path construction, in accordance with . As SCION does not provide any in-band signal about the intentions of endpoints nor about the policies of downstream ASes, the policy will typically select a somewhat diverse set optimized for multiple, generic parameters. Selection may be based on criteria such as:
  • AS path length: from the originator core AS to the child (non-core) AS.
  • Expiration time: the maximum value for the expiration time when extending the segment.
  • ISD or AS exclusion lists: certain ASes or ISD that may not appear in a segment.
  • ISD loops: if permitted, they allow core AS to reach other core ASes in the same ISD via a third party ISDs.
  • Availability of peering links: that is the number of different peering ASes from all non-core ASes on the PCB or path segment. A greater number of peering ASes increases the likelihood of finding a shortcut on the path segment.
  • Path disjointness: Paths can be either AS disjointed or link disjointed. AS disjointed paths have no common upstream/core AS for the current AS, whereas link disjointed paths do not share any AS-to-AS link. AS disjointness allows path diversity in the event that an AS becomes unresponsive, and link disjointness provides resilience in case of link failure. Both criteria can be used depending on the objective of the AS. The relative disjointness of two PCBs A and B may be calculated by assigning a disjointness score, calculated as the number of links in A that don't appear in B. For example, the beacon that has the highest disjointness score and is not the shortest path should be selected, but if this not better than what has already been selected, then the beacon with the shortest path yet to be selected should be chosen instead.
A PCB Selection Policy can be expressed as a stateful filter of segments, i.e., a function which indicates whether to accept or deny a given segment. This filter is stateful in that it can be updated each time its AS registers a new segment. Naturally, an AS's policy selects PCBs corresponding to paths that are commercially or otherwise operationally viable. To ensure reachability, PCB selection policies should forward as many PCBs as possible. PCB selection is not intended as a mechanism for traffic engineering (e.g., by excluding specific PCBs for that purpose).
Propagation Interval and Best PCBs Set Size PCBs are propagated in batches to each neighboring AS at a fixed frequency known as the propagation interval which happens for both intra-ISD beaconing () and core beaconing (). At each propagation event, each AS selects a set of the best PCBs from the candidates in the Beacon Store according to the AS's selection policy. This set should have a fixed size, the best PCBs set size. The best PCBs set size should be:
  • For intra-ISD beaconing (i.e. propagating to children ASes): at most 50.
  • For core beaconing (i.e. propagation between core ASes): at most 5 per immediate neighbor core AS. Current practice is that each set is chosen among the PCBs received from each neighbor.
These values reflect a tradeoff between scalability —limited by the computational overhead of signature verification—and the amount of paths discovered. The PCBs set size should not be too low, to make sure that beaconing can discover a wide amount of paths. Further discussion on these trade-offs is provided in . In current practice the intra-ISD set size is typically 20. Current practice also showed that in small SCION core networks, higher values of the core best PCBs set size (e.g., 20) can be used. Depending on the selection criteria, it may be necessary to keep more candidate PCBs than the best PCBs set size in the Beacon Store in order to determine the best set of PCBs. If this is the case, an AS should have a suitable pre-selection of candidate PCBs in place in order to keep the Beacon Store capacity limited.
  • The propagation interval should be at least "5" (seconds) for intra-ISD beaconing and at least "60" (seconds) for core beaconing.
Note that to ensure establish quick connectivity, an AS MAY attempt to forward a PCB more frequently ("fast recovery"). Current practice is to increase the frequency of attempts if no PCB propagation is known to have succeeded within the last propagation interval:
  • because the corresponding RPC failed;
  • or because no beacon was available to propagate.
Propagation of Selected PCBs To bootstrap the initial communication with a neighboring beacon service, ASes use one-hop paths. This special kind of path handles beaconing between neighboring ASes for which no forwarding path may be available yet. It is the task of beaconing to discover such forwarding paths and the purpose of one-hop paths is to break this circular dependency. The One-Hop Path Type is described in more detail in .
Propagation of PCBs in Intra-ISD Beaconing The propagation process in intra-ISD beaconing includes the following steps:
  1. From the candidate PCBs stored in the Beacon Store, the Control Service of an AS selects the best PCBs to propagate to its neighboring child ASes, based on a selection algorithm specific for this AS.
  2. The Control Service MUST add a new AS entry (see ), including any Peer Entry information (see ) the AS is configured to advertise to every selected PCB.
  3. The Control Service MUST sign each selected, extended PCB and append the computed signature.
  4. As a final step, the Control Service propagates each extended PCB to the neighboring AS specified in the new AS entry by invoking the SegmentCreationService.Beacon remote procedure call (RPC) in the Control Services of the neighboring ASes (see also ).
Propagation of PCBs in Core Beaconing The propagation process in core beaconing includes the following steps:
  1. The core Control Service selects the best PCBs to forward to neighboring core ASes observed so far.
  2. The service adds a new AS entry to every selected PCB which MUST include:
    • The egress interface to the neighboring core AS in the Hop Field component.
    • The ISD_AS number of the neighboring core AS in the signed body component of the AS entry.
  3. The core Control Service MUST sign the extended PCBs and append the computed signature.
  4. As a final step, the service propagates the extended PCBs to the neighboring core ASes by invoking the SegmentCreationService.Beacon remote procedure call (RPC) in the Control Services of the neighboring core ASes (see also ).
Propagation of PCBs in Protobuf Message Format The last step of the above described core and intra-ISD propagation procedures is implemented as follows in Protobuf message format: The propagation procedure includes the following elements:
  • SegmentCreationService: Specifies the service via which the extended PCB is propagated to the Control Service of the neighboring AS.
    • Beacon: Specifies the method that calls the Control Service at the neighboring AS in order to propagate the extended PCB.
  • BeaconRequest: Specifies the request message sent by the Beacon method to the Control Service of the neighboring AS. It contains the following element:
    • PathSegment: Specifies the path segment to propagate to the neighboring AS. For more information on the Protobuf message type PathSegment, see .
  • BeaconResponse: An empty message returned as an acknowledgement upon success.
Distribution of Cryptographic Material Control Services distribute cryptographic material for the PKI (see ) using the following protobuf messages through the TrustMaterialService RPCs:
  • Chains(ChainsRequest): Returns the certificate chains that match the request.
  • TRC(TRCRequest): Returns a specific TRC that matches the request.
The corresponding protobuf message formats are: A ChainsRequest message includes the following fields:
  • isd_as: Returns ISD-AS of Subject in the AS certificate.
  • subject_key_id: Returns SubjectKeyID in the AS certificate.
  • at_least_valid_until: Point in time at which the AS certificate must still be valid - in seconds since UNIX epoch.
  • at_least_valid_since: Point in time at which the AS certificate must be or must have been valid - in seconds since UNIX epoch.
A ChainsResponse includes the following fields:
  • chains: Lists the certificate chains that match the request. A Chain contains:
    • as_cert: Returns the AS certificate in the chain.
    • ca_cert: Returns the CA certificate in the chain.
For requesting TRCs, the protobuf messages are: A TRCRequest includes the following fields:
  • isd: Returns the ISD number of the TRC.
  • base: Returns the base number of the TRC.
  • serial: Returns the serial number of the TRC.
The returned trc contains the raw TRC.
Deployment Considerations
Destination Mapping The mechanism by which endpoints determine the destination ISD-AS corresponding to a given destination address is outside the scope of this document. One option, still experimental in existing deployments, is that SCION-aware endpoints may resolve destination SCION addresses using a naming system (e.g. DNS). SCION-unaware endpoints may interface with a SCION network through a SCION IP Gateway (SIG), which tunnels IP traffic over SCION. In such cases, the source SIG is responsible for mapping destination IPs to the appropriate destination ISD-AS and gateway. More information can be found at .
Monitoring Considerations In order to maintain service availability, an AS SHOULD monitor the following aspects when deploying the SCION control plane:
  • For routers (to enable correlation with link states): state of configured links (core, child, parent)
  • For any control service:
    • Fraction of path lookups served successfully (see )
    • Time synchronization offset with other ASes (see )
    • Fraction of ASes found in non-expired segments for which a non-expired certificate exists
  • For a core AS:
    • Fraction of core ASes (preferably only those to which the link is up) that can be found in non-expired core segments
    • Fraction of ASes, core or children, (preferably only those to which the link is up) whereto a beacon was initiated during the last propagation interval
    • Fraction of freshly propagated beacons for which at least one corresponding down segment has been registered (see )
  • For a non-core AS:
    • Number of up segments available (may be just 0/non-0) younger than the propagation interval (or some multiple thereof).
    • Fraction of up segments that were successfully registered as down segments (see ).
    • Fraction of children ASes (preferably only those to which the link is up) whereto a beacon was propagated during the last propagation interval
Effects of Clock Inaccuracy A PCB originated by a given Control Service is validated by all the Control Services that receive it. All have different clocks and their differences affect the validation process:
  • A fast clock at origination or a slow clock at reception will yield a lengthened expiration time for hops, and possibly an origination time in the future.
  • A slow clock at origination or a fast clock at reception will yield a shortened expiration time for hops, and possibly an expiration time in the past.
This bias comes in addition to a structural delay: PCBs are propagated at a configurable interval - typically around one minute. As a result of this and the way they are iteratively constructed, PCBs with N hops may be validated up to N intervals (so maximally N minutes) after origination which creates a constraint on the expiration of hops. Hops of the minimal expiration time (337.5 seconds - see ) would make any PCB describing a path longer than 5 hops expire. For this reason it is unadvisable to create hops with a short expiration time - they SHOULD be around 6 hours. The Control Service and its clients authenticate each-other according to their respective AS's certificate. Path segments are authenticated based on the certificates of the ASes that they refer to. The RECOMMENDED expiration time of a SCION AS certificate is between 3h and 3 days. Some deployments use up to 5 days. In comparison to these time scales, clock offsets in the order of minutes are immaterial. Each administrator of a SCION Control Service is responsible for maintaining sufficient clock accuracy. No particular method is assumed by this specification.
Path Discovery Time and Scalability The path discovery mechanism balances the number of discovered paths and the time it takes to discover them versus resource overhead of the discovery. The resource costs for path discovery are as follows:
  • Communication overhead is transmitting the PCBs and occasionally obtaining the required PKI material.
  • Processing overhead is validating the signatures of the AS entries, signing new AS entries, and to a lesser extent, evaluating the beaconing policies.
  • Storage overhead is both the temporary storage of PCBs before the next propagation interval, and the storage of complete discovered path segments.
All of these are dependent on the number and length of the discovered path segments, i.e. the total number of AS entries of the discovered path segments. These, in turn, depend on the configured best PCBs set size (). Interesting metrics for scalability and speed of path discovery are the time until all discoverable path segments have been discovered after a network bootstrap, and the time until a new link is usable. In general, the time until a specific PCB is built depends on its length, the propagation interval, and whether on-path ASes use "fast recovery". At each AS, the PCB will be processed and propagated at the subsequent propagation event. As propagation events are not synchronized between different ASes, a PCB arrives at a random point in time during the interval and may be buffered before potentially being propagated. With a propagation interval T at each AS, the mean time until the PCB is propagated in one AS therefore is T / 2 and the mean total time for the propagation steps of a PCB of length L is at worst L * T / 2 (with a variance of L * T^2 / 12). Note that link removal is not part of path discovery in SCION. For scheduled removal of links, operators let path segments expire. On link failures, endpoints route around the failed link by switching to different paths in the data plane (see section "Handling Link Failures"). To achieve scalability, SCION partitions ASes into ISDs and in an ideal topology the inter-ISD core network should be kept to a moderate size. For more specific observations, we distinguish between intra-ISD and core beaconing.
Intra-ISD Beaconing In the intra-ISD beaconing, PCBs are propagated top down along parent-child links from core to leaf ASes. Each AS discovers path segments from itself to the core ASes of its ISD. This typically produces an acyclic graph which is narrow at the top, widens towards the leafs, and is relatively shallow. Intermediate provider ASes will have a large number of children, while they only have a small number of parents and the chain of intermediate providers from a leaf AS to a core AS is typically not long (e.g. local, regional, national provider, then core). Each AS potentially receives PCBs for all down path segments from the core to itself. While the number of distinct provider chains to the core is typically moderate, the multiplicity of links between provider ASes has multiplicative effect on the number of PCBs. Once this number grows above the maximum recommended best PCB set size of 50, ASes SHOULD trim the set of PCBs propagated. Ultimately, the number of PCBs received by an AS per propagation interval remains bounded by 50 for each parent link of an AS, and at most 50 PCBs per child link are propagated. The length of these PCBs and thus the number of AS entries to be processed and stored, is expected to be moderate and not grow considerably with network size. The total resource overhead for beacon propagation is easily manageable even for highly connected ASes. To illustrate this, an AS with a rather large number of 100 parent links receives at most 5000 PCBs during a propagation interval. Assuming a generous average length of 10 AS entries for these PCBs, this corresponds to 50000 AS entries. Due to the variable length fields in AS entries, the sizes for storage and transmission cannot be predicted exactly, but assume an average of 250 bytes per AS entry. At the shortest recommended propagation interval of 5 seconds, this corresponds to an average bandwidth of around 2.5 MB/s and the processing of 10000 signature verifications per second. If the same AS has 1000 child links, the propagation of the beacons will require signing one new AS entry for each of the propagated PCBs for each link (at most 50 per link), i.e. at most 50000 signatures per propagation event. The total bandwidth for the propagation of these PCBs for all 1000 child links would, be roughly around 25 MB/s which is manageable with even modest consumer hardware. On a network bootstrap, path segments to each AS are discovered within a number of propagation steps proportional to the longest path. With a 5 second propagation interval and a generous longest path of length 10, all path segments are discovered after 25 seconds on average. When all ASes start propagation just after they've received the first PCBs from any of their upstreams (see 'fast recovery'), the construction of a first path to connect each AS to the ISD core is accelerated. When a new parent-child link is added to the network, the parent AS will propagate the available PCBs in the next propagation event. If the AS on the child side of the new link is a leaf AS, path discovery is thus complete after at most one propagation interval. Otherwise, child ASes at distance D below the new link, learn of the new link after at worst D further propagation intervals.
Core Beaconing In core beaconing (typically inter-ISD), PCBs are propagated omnidirectionally along core links. Each AS discovers path segments from itself to any other core AS. The number of distinct paths through the core network is typically very large. To keep the overhead manageable, at most 5 path segments to every destination AS are discovered and the propagation frequency is slower than in the intra-ISD beaconing (at least 60 seconds between propagation events). Without making strong assumptions on the topology of the core network, we can assume that shortest paths through real world networks are relatively short, e.g. the Barabási-Albert random graph model predicts a diameter of log(N)/log(log(N)) for a network with N nodes and the average distance scales in the same way. Whilst we cannot assume that the selected PCBs are strictly the shortest paths through the network, they are likely to be not very much longer than the shortest paths either. With N the number of participating core ASes, an AS receives up to 5 * N PCBs per propagation interval per core link interface. For highly connected ASes, the number of PCBs received thus becomes rather large and in a network of 1000 ASes, a AS with 300 core links receives up to 1.5 million PCBs per propagation interval. Assuming an average PCB length of 6 and the shortest propagation interval of 60 seconds, this corresponds to roughly 150 thousand signature validations per second or roughly 38 MB/s. For much larger, more highly connected ASes, the path discovery tasks of the Control Service can be distributed over many instances in order to increase the PCB throughput. On a network bootstrap, full connectivity is obtained after a number of propagation steps corresponding to the diameter of the network. Assuming a network diameter of 6, this corresponds to roughly 3 minutes on average. When a new link is added to the network, it will be available to connect two ASes at distances D1 and D2 from the link, respectively, at worst after a mean time (D1+D2)*T/2.
Registration of Path Segments Path registration is the process where an AS transforms selected PCBs into path segments, and adding these segments to the relevant path databases thereby making them available to other ASes. As mentioned previously, a non-core AS typically receives several PCBs representing several path segments to the core ASes of the ISD the AS belongs to. Out of these PCBs, the non-core AS selects those down path segments through which it wants to be reached, based on AS-specific selection criteria. The next step is to register the selected down segments with the Control Service of the relevant core ASes in accordance with a process called intra-ISD path segment registration. As a result, a core AS's Control Service contains all intra-ISD path segments registered by the non-core ASes of its ISD. In addition, each core AS Control Service also stores the preferred core path segments to other core ASes during the core segment registration process. Both processes are described below.
Intra-ISD Path Segment Registration Every registration period (determined by each AS), the AS's Control Service selects two sets of PCBs to transform into two types of path segments:
  • Up segments, which allow the infrastructure entities and endpoints in this AS to communicate with core ASes; and
  • Down segments, which allow remote entities to reach this AS.
The up segments and down segments do not have to be equal as AS may want to communicate with core ASes via one or more up segments that differ from the down segment(s) through which it wants to be reached. Therefore, an AS can define different selection policies for the up segment and down segment sets. In addition, the processes of transforming a PCB in an up segment or a down segment differ slightly.
Terminating a PCB Both the up segments and down segments end at the AS, so by transforming a PCB into a path segment, an AS "terminates" the PCB for this AS ingress interface and at that moment in time. The Control Service of a non-core performs the following steps to "terminate" a PCB:
  1. The Control Service adds a new AS entry to the PCB which MUST be defined as follows:
    • The next AS MUST NOT be specified.
      • In Protobuf message format, this means that the value of the next_isd_as field in the ASEntrySignedBody component MUST be "0".
    • The egress interface in the Hop Field component MUST NOT be specified.
      • In Protobuf message format, this means that the value of the egress field in the HopField component MUST be "0".
  2. If the AS has peering links, the Control Service MAY add corresponding peer entry components to the signed body of the AS entry - one peer entry component for each peering link that the AS wants to advertise. The egress Interface ID in the Hop Field component of each added peer entry MUST NOT be specified.
    • In Protobuf message format, this means that the value of the egress field in the HopField component MUST be "0".
  3. The Control Service MUST sign the modified PCB and append the computed signature.
Note:
  • For more information on the signed body component of an AS entry, see .
  • For more information on a peer entry, see .
  • For more information on the Hop Field component, see .
  • For more information on signing an AS entry, see .
Transforming a PCB into an Up Segment Every registration period, the Control Service of a non-core AS performs the following steps to transform PCBs into up segments:
  1. The Control Service selects the PCBs that it wants to transform into up segments from the candidate PCBs in the Beacon Store.
  2. The Control Service "terminates" the selected PCBs by performing the steps described in . From this moment on, the modified PCBs are called up segments.
  3. The Control Service adds the newly created up segments to its own path database.
Note: For more information on possible selection strategies of PCBs, see .
Transforming a PCB into a Down Segment Every registration period, the Control Service of a non-core AS performs the following steps to transform PCBs into down segments:
  1. The Control Service selects the PCBs that it wants to transform into down segments from the candidate PCBs in the Beacon Store.
  2. The Control Service "terminates" the selected PCBs by performing the steps described in . From this moment on, the modified PCBs are called down segments.
  3. The Control Service registers the newly created down segments with the Control Services of the core ASes that originated the corresponding PCBs. This is done by invoking the SegmentRegistrationService.SegmentsRegistration remote procedure call (RPC) in the Control Services of the relevant core ASes (see also ). The first ISD-AS entry of the path segment SHOULD be equal to the core ISD-AS where the segment is being registered. If not, the core AS MUST reject the segment.
Note: For more information on possible selection strategies of PCBs, see .
Core Path Segment Registration The core beaconing process creates path segments from core AS to core AS. These core segments are then added to the Control Service path database of the core AS that created the segment, so that local and remote endpoints can obtain and use these core segments. In contrast to the intra-ISD registration procedure, there is no need to register core segments with other core ASes as each core AS will receive PCBs originated from every other core AS. In every registration period, the Control Service of a core AS performs the following operations:
  1. The core Control Service selects the best PCBs towards each core AS observed so far.
  2. The core Control Service "terminates" the selected PCBs by performing the steps described in . From this moment on, the modified PCBs are called core segments.
  3. The Control Service adds the newly created core segments to its own path database.
Note: For more information on possible selection strategies of PCBs, see .
Path Segment Registration RPC API The Control Service of a non-core AS has to register the newly created down segments with the Control Services of the core ASes that originated the corresponding PCBs. This registration step is implemented as follows in Protobuf message format: segments = 1; } message SegmentsRegistrationResponse {} ]]>
  • SegmentType: Specifies the type of the path segment to be registered. Currently, only the following type is used:
    • SEGMENT_TYPE_DOWN: Specifies a down segment.
  • map<int32, Segments> segments: Represents a separate list of segments for each path segment type. The key is the integer representation of the corresponding SegmentType.
  • SegmentRegistrationResponse: an empty message returned as an acknowledgement upon success.
Path MTU SCION paths represent a sequence of ASes and inter-AS links; each with possibly different MTUs. As a result, the path MTU is the minimum of the MTUs of each inter-AS link and intra-AS networks it traverses. Such MTU information is disseminated during path construction:
  • The MTU of each intra-AS network traversed (represented by the MTU field of the corresponding AS Entries)
  • The MTU of each inter-AS link or peering link (indicated by the ingress_mtu field of each or the peer_mtu field of each used)
Such information is then made available to source endpoints during the path lookup process (See ). Note that the destination endpoint does not receive such information, therefore when using path reversibility, it should use mechanisms to estimate the reverse path MTU (e.g., MTU discovery or estimate MTU from the largest packet received). SCION endpoints are oblivious to the internal topology of intermediate ASes. When looking up a path they should therefore assume that all hops are also constrained by the intra-AS MTU of each AS traversed.
Path Lookup The path lookup is a fundamental building block of SCION's path management as it enables endpoints to obtain path segments found during path exploration and registered during path registration. This allows the endpoints to construct end-to-end paths from the set of possible path segments returned by the path lookup process. The lookup of paths still happens in the control plane, whereas the construction of the actual end-to-end paths happens in the data plane.
Lookup Process An endpoint (source) that wants to start communication with another endpoint (destination) requires up to three path segments:
  • An up segment to reach the core of the source ISD (only if the source endpoint is a non-core AS);
  • a core segment to reach
    • another core AS in the source ISD, in case the destination AS is in the same source ISD, or;
    • a core AS in a remote ISD, if the destination AS is in another ISD, and;
  • a down segment to reach the destination AS.
The actual number of required path segments depends on the location of the destination AS as well as on the availability of shortcuts and peering links. More information on combining and constructing paths is provided by . The process to look up and fetch path segments consists of the following steps:
  1. The source endpoint queries the Control Service in its own AS (i.e. the source AS) for the required segments by sending a SegmentsRequest. The Control Service has up segments stored in its path database and additionally checks if it has appropriate core segments and down segments stored as well - in this case it returns them immediately in a SegmentsResponse.
  2. If there are no appropriate core segments and down segments, the Control Service in the source AS queries the Control Services of the reachable core ASes in the source ISD for core segments to core ASes in the destination ISD. To reach the core Control Services, the Control Service of the source AS uses the locally stored up segments.
  3. The Control Service of the source AS combines up segments with the newly retrieved core segments. The Control Service then queries the Control Services of the remote core ASes in the destination ISD to fetch down segments to the destination AS. To reach the remote core ASes, the Control Service of the source AS uses the previously obtained and combined up segments and core segments.
  4. The Control Service of the source AS returns all retrieved path segments to the source endpoint.
  5. Once it has obtained all path segments, the source endpoint combines them into an end-to-end path in the data plane.
  6. The destination endpoint, once it receives the first packet, MAY revert the path in the received packet in order to construct a response. This ensures that traffic flows on the same path bidirectionally.
below shows which Control Service provides the source endpoint with which type of path segment. Control services responsible for different types of path segments
Segment Type Responsible Control Service(s)
Up-segment Control service of the source AS
Core-segment Control service of core ASes in source ISD
Down-segment Control service of core ASes in destination ISD (either the local ISD or a remote ISD)
Sequence of Lookup Requests The overall sequence of requests to resolve a path SHOULD be as follows:
  1. Request up segments for the source endpoint at the Control Service of the source AS.
  2. Request core segments, which start at the core ASes that are reachable with up segments, and end at the core ASes in the destination ISD. If the destination ISD coincides with the source ISD, this step requests core segments to core ASes that the source endpoint cannot directly reach with an up segment.
  3. Request down segments starting at core ASes in the destination ISD.
Lookup Requests Message Format Control Services provide paths to endpoints through the SegmentLookupService RPC. This API is exposed on the SCION dataplane by the control services of core ASes and exposed on the intra-domain protocol network. They use the following protobuf messages: a SegmentsRequest, which includes:
  • src_isd_as: The source ISD-AS of the segment.
  • dst_isd_as: The destination ISD-AS of the segment.
The corresponding SegmentsResponse returns:
  • segments: a list of PathSegment matching the request.
  • a mapping from path segment type to path segments, where the key is the integer representation of the SegmentType enum defined in .
segments = 1; } ]]>
Caching For the sake of efficiency, the Control Service of the source AS SHOULD cache each returned path segment request. Caching ensures that path lookups are fast for frequently used destinations and is also essential to ensure that the path lookup process is scalable and can be performed with low latency. In general, to improve overall efficiency, the Control Services of all ASes SHOULD do the following:
  • Cache the returned path segments.
  • Send requests in parallel when requesting path segments from other Control Services.
Behavior of Actors in the Lookup Process As described above, the source endpoint resolves paths with a sequence of segment requests to the Control Service of the source AS. The Control Service in the source AS either answers directly or forwards these requests to the responsible Control Services of core ASes. In SCION, the instances that handle these segment requests at the Control Services are called source AS segment-request handler and core AS segment-request handler, respectively. This section specifies the behavior of the segment request handlers in the lookup process.
Use of Wildcard Addresses in the Lookup Process Endpoints can use wildcard addresses to designate any core AS in path segment requests. The segment request handlers MUST expand these wildcard addresses and translate them into one or more actual addresses. below shows who is responsible for what. Note: For general information on the use of wildcard addresses in SCION, see . Use of wildcards in path segments requests
Segment Request Wildcard Represents Expanded/Translated By Translated Into
Up segment "Destination" core AS (where up segment ends) Control service of the source AS Actual address destination core AS in source ISD
Core segment Source core AS (where core segment starts)1 Control service of the source AS Actual address source core AS in source ISD
Core segment Destination core AS (where core segment ends) Control service of the source core AS Actual address destination core AS in destination ISD
Down segment "Source" core AS (where down segment starts)2 Control service of the source AS Actual address source core AS in destination ISD
1) Includes all core ASes for which an up segment from the source AS exists.
2) Includes all core ASes in destination ISD with a down segment to destination AS.
Segment-Request Handler of a Non-Core Source AS When the segment request handler of the Control Service of a non-core source AS receives a path segment request, it MUST proceed as follows:
  1. Determine the requested segment type.
  2. In the case of an up segment request, look up matching up segments in the path database and return them.
  3. In the case of a core segment request from a source core AS to a destination core AS:
    • Expand the source wildcard into separate requests for each reachable core AS in the source ISD.
    • For each core segment request;
      • If possible, return matching core segments from cache;
      • Otherwise, request the core segments from the Control Services of each reachable core AS at the source of the core segment, and then add the retrieved core segments to the cache.
  4. In the case of a down segment request:
    • Expand the source wildcard into separate requests for every core AS in the destination ISD (destination ISD refers to the ISD to which the destination endpoint belongs).
    • For each segment request;
      • If possible, return matching down segments from cache;
      • Otherwise, request the down segment from the Control Services of the core ASes at the source of the down segment. Sending the request may require looking up core segments to the source core AS of the down segment, and then adding the retrieved down segments to the cache.
Segment-Request Handler of a Core AS When the segment request handler of a core AS Control Service receives a path segment request, it MUST proceed as follows:
  1. Validate the request:
    • The source of the path segment MUST be this core AS.
    • The request MUST either be;
      • for a core segment to a core AS in this ISD or another ISD, or;
      • for a down segment to an AS in this ISD.
  2. If the destination is a core or wildcard address, then load matching core segments from the path database and return.
  3. Otherwise, load the matching down segments from the path database and return.
shows by means of an illustration how the lookup of path segments in SCION works.
Control Service Discovery The Control Plane RPC APIs rely on QUIC connections over UDP/SCION (see . Establishing such connection requires the initiator to identify the relevant peer (service resolution) and to select a path to it. Since the Control Service is itself the source of path segment information, the following bootstrapping processes apply:
  • Neighboring ASes craft one-hop paths directly. They are described in more detail in
  • Paths to non-neighboring ASes are obtained from neighboring ASes which allows multihop paths to be constructed and propagated incrementally.
  • Constructed multi-hop paths are registered with the Control Service at the origin core AS.
  • Control Services respond to requests from remote ASes by reversing the path via which the request came.
Clients find the relevant Control Service at a given AS by resolving a 'service address' as follows:
  1. A client sends a ServiceResolutionRequest RPC (which has no parameters) to an endpoint address in the format:
    • Common Header:
      • Path type: SCION (0x01)
      • DT/DL: "Service" (0b0100)
    • Address Header:
      • DstHostAddr: "SVC_CS" (0x0002)
    • UDP Header:
      • DstPort: 0
    A ServiceResolutionRequest MUST fit within a UDP datagram, otherwise clients and servers won't be able to establish control-plane reachability.
  2. The ingress border router at the destination AS resolves the service destination to an actual endpoint address. This document does not mandate any specific method for this resolution.
  3. The ingress border router forwards the message to the resolved address.
  4. The destination service responds to the client with a ServiceResolutionResponse. It contains one or more transport options and it MUST fit within a UDP datagram. Known transports are "QUIC". Unknown values MUST be ignored by clients. The response includes a Transport message containing supported addresses and port to reach the service. Supported address formats for QUIC are IPv4 and IPv6. An example of the corresponding address format is: 192.0.2.1:80 and [2001:db8::1]:80. A missing, zero or non-existent port value MUST be treated by clients as an error.
  5. The client uses the address and port from the "QUIC" option to establish a QUIC connection, which can then be used for other RPCs.
The following code block provides the service resolution API Protobuf messages. transports = 1; } message Transport { string address = 1; } ]]>
SCMP The SCION Control Message Protocol (SCMP) provides functionality for network diagnostics, such as traceroute, and error messages that signal packet processing or network-layer problems. SCMP is a helpful tool for network diagnostics and, in the case of External Interface Down and Internal Connectivity Down messages, a signal for endpoints to detect network failures more rapidly and fail-over to different paths. However, SCION nodes should not strictly rely on the availability of SCMP, as this protocol may not be supported by all devices and/or may be subject to rate limiting. This document only specifies the messages used for the purposes of path diagnosis and recovery. An extended specification can be found in . Its security considerations are discussed in . Note: There is not currently a defined mechanism for converting ICMP messages to SCMP messages, or vice-versa.
General Format Every SCMP message is preceded by a SCION header and zero or more SCION extension headers (see section "SCION Header Specification"). The SCMP header is identified by a NextHdr value of 202 in the immediately preceding header. The messages have the following general format:
SCMP message format 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 Type Code Checksum Type-dependent Block ( variable length )
  • Type: it indicates the type of SCMP message. Its value determines the format of the type-dependent block.
  • Code: it provides additional granularity to the SCMP type.
  • Checksum: it is used to detect data corruption.
  • Type-dependent Block: optional field of variable length which format is dependent on the message type.
Message Types SCMP messages are grouped into two classes: error messages and informational messages. Error messages are identified by a zero in the high-order bit of the type value. I.e., error messages have a type value in the range of 0-127. Informational messages have type values in the range of 128-255. This specification defines the message formats for the following SCMP messages: Error Message Types
Type Meaning
1 Reserved for future use
2 Packet Too Big
3 Reserved for future use
4 Reserved for future use
5 External Interface Down
6 Internal Connectivity Down
   
100 Private Experimentation
101 Private Experimentation
   
127 Reserved for expansion of SCMP error messages
Informational Message Types
Type Meaning
128 Echo Request
129 Echo Reply
130 Traceroute Request
131 Traceroute Reply
200 Private Experimentation
201 Private Experimentation
   
255 Reserved for expansion of SCMP informational messages
Type values 100, 101, 200, and 201 are reserved for private experimentation. All other values are reserved for future use.
Checksum Calculation The checksum is the 16-bit one's complement of the one's complement sum of the entire SCMP message, starting with the SCMP message type field, and prepended with a "pseudo-header" consisting of the SCION address header and the Layer 4 protocol type as defined in section "SCION Header Specification/Pseudo Header for Upper-Layer Checksum".
Processing Rules The following rules apply when processing SCMP messages:
  • If an SCMP error message of unknown type is received at its destination, it MUST be passed to the upper-layer process that originated the packet that caused the error, if it can be identified.
  • If an SCMP informational message of unknown type is received, it MUST be silently dropped.
  • Every SCMP error message MUST include as much of the offending SCION packet as possible. The error message packet - including the SCION header and all extension headers - MUST NOT exceed 1232 bytes in order to fit into the minimum MTU (see section "Deployment Considerations/MTU").
  • In case the implementation is required to pass an SCMP error message to the upper-layer process, the upper-layer protocol type is extracted from the original packet in the body of the SCMP error message and used to select the appropriate process to handle the error. In case the upper-layer protocol type cannot be extracted from the SCMP error message body, the SCMP message MUST be silently dropped.
  • An SCMP error message MUST NOT be originated in response to any of the following:
    • An SCMP error message.
    • A packet which source address does not uniquely identify a single node. E.g., an IPv4 or IPv6 multicast address.
The maximum size 1232 bytes is chosen so that the entire datagram, if encapsulated in UDP and IPv6, does not exceed 1280 bytes (L2 Header excluded). 1280 bytes is the minimum MTU required by IPv6 and it is assumed that, nowadays, this MTU can also be safely expected when using IPv4.
Error Messages
Packet Too Big
Packet Too Big format 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 Type Code Checksum Reserved MTU As much of the offending packet as possible without the SCMP packet exceeding 1232 bytes.
Error Message field values
Name Value
Type 2
Code 0
MTU The Maximum Transmission Unit of the next-hop link.
A Packet Too Big message SHOULD be originated by a router in response to a packet that cannot be forwarded because the packet is larger than the MTU of the outgoing link. The MTU value is set to the maximum size a SCION packet can have to still fit on the next-hop link, as the sender has no knowledge of the underlay.
External Interface Down
External Interface Down format 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 Type Code Checksum ISD AS Interface ID As much of the offending packet as possible without the SCMP packet exceeding 1232 bytes.
Error Message field values
Name Value
Type 5
Code 0
ISD The 16-bit ISD identifier of the SCMP originator
AS The 48-bit AS identifier of the SCMP originator
Interface ID The interface ID of the external link with connectivity issue.
A External Interface Down message SHOULD be originated by a router in response to a packet that cannot be forwarded because the link to an external AS is broken. The ISD and AS identifier are set to the ISD-AS of the originating router. The Interface ID identifies the link of the originating AS that is down. Recipients can use this information to route around broken data-plane links.
Internal Connectivity Down
Internal Connectivity Down format 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 Type Code Checksum ISD AS Ingress Interface ID Egress Interface ID As much of the offending packet as possible without the SCMP packet exceeding 1232 bytes.
Error Message field values
Name Value
Type 6
Code 0
ISD The 16-bit ISD identifier of the SCMP originator
AS The 48-bit AS identifier of the SCMP originator
Ingress ID The interface ID of the ingress link.
Egress ID The interface ID of the egress link.
A Internal Connectivity Down message SHOULD be originated by a router in response to a packet that cannot be forwarded inside the AS because the connectivity between the ingress and egress routers is broken. The ISD and AS identifier are set to the ISD-AS of the originating router. The ingress Interface ID identifies the interface on which the packet enters the AS. The egress Interface ID identifies the interface on which the packet is destined to leave the AS, but the connection is broken to. Recipients can use this information to route around a broken data plane inside an AS.
Informational Messages
Echo Request
Echo Request format 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 Type Code Checksum Identifier Sequence Number Data ( variable Len. )
Informational Message field values
Name Value
Type 128
Code 0
Identifier A 16-bit identifier to aid matching replies with requests
Sequence Nr. A 16-bit sequence number to aid matching replies with requests
Data Variable length of arbitrary data
Every node SHOULD implement a SCMP Echo responder function that receives Echo Requests and originates corresponding Echo replies.
Echo Reply
Echo Reply format 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 Type Code Checksum Identifier Sequence Number Data ( variable Len. )
Informational Message field values
Name Value
Type 129
Code 0
Identifier The identifier of the Echo Request
Sequence Nr. The sequence number of the Echo Request
Data The data of the Echo Request
Every node SHOULD implement a SCMP Echo responder function that receives Echo Requests and originates corresponding Echo replies. The data received in the SCMP Echo Request message MUST be returned entirely and unmodified in the SCMP Echo Reply message.
Traceroute Request
Traceroute Request format 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 Type Code Checksum Identifier Sequence Number ISD AS Interface ID
Given a SCION path constituted of hop fields, traceroute allows to identify the corresponding on-path ISD-ASes. Informational Message field values
Name Value
Type 130
Code 0
Identifier A 16-bit identifier to aid matching replies with requests
Sequence Nr. A 16-bit sequence number to aid matching replies with request
ISD Place holder set to zero by SCMP sender
AS Place holder set to zero by SCMP sender
Interface ID Place holder set to zero by SCMP sender
A border router is alerted of a Traceroute Request message through the Ingress or Egress Router Alert flag set to 1 in the hop field that describes the traversal of that router in a packet's path (see section "SCION Header Specification"). When such a packet is received, the border router SHOULD reply with a Traceroute Reply message.
Traceroute Reply
Traceroute Reply format 0 1 2 3 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 Type Code Checksum Identifier Sequence Number ISD AS Interface ID
Informational Message field values
Name Value
Type 131
Code 0
Identifier The identifier set in the Traceroute Request
Sequence Nr. The sequence number of the Tracroute Request
ISD The 16-bit ISD identifier of the SCMP originator
AS The 48-bit AS identifier of the SCMP originator
Interface ID The interface ID of the SCMP originating router
The identifier is set to the identifier value from the Traceroute Request message. The ISD and AS identifiers are set to the ISD-AS of the originating border router.
Security Considerations As described previously, the goal of SCION’s beaconing process in the control plane is to securely discover and disseminate paths between any two ASes. This section describes security considerations for SCION's Control Plane that focuses on inter-domain routing. SCION does not provide intra-domain routing, nor does it provide end-to-end payload encryption so these topics lie outside the scope of this section. This section discusses three kinds of threats to the control plane:
  1. When an adversary controls one or all core ASes of an ISD and tries to manipulate the beaconing process from the top down (see ).
  2. When "ordinary" (non-core) adversaries try to manipulate the beaconing process (see ).
  3. Denial of Services (DoS) attacks where attackers overload different parts of the infrastructure (see ).
Security Properties The SCION control plane provides various security properties, as discussed below. Here, an AS is described as 'honest' if its private keys are unknown to the attacker and it correctly performs operations in accordance with this specification (e.g. uses a unique interface identifier for each link). An honest path is one that only traverses honest ASes. An honest segment is the one created by an honest AS. Security properties are:
  • Connectivity - For every pair of honest ASes X and Y, X will eventually register enough segments to build at least one path (of any length) leading to Y.
  • Forwarding Path Consistency - For every honest path segment registered in any AS
    • its sequence of AS entries corresponds to a continuous SCION forwarding path in the network of inter-domain links
    • the inter-domain network topology remains unchanged since the segment was first generated.
  • Loop Freedom - For every honest path segment registered in any AS, its sequence of AS entries contains no duplicates, including current and next ISD-AS and Interface IDs.
  • Path Authorization - For every honest path segment registered in any AS and any AS X appearing on that segment (except for the previous one), AS X propagated a PCB corresponding to the segment portion ending in its own entry to its successor AS on the segment.
To ensure that the properties hold across the overall SCION network, these are the prerequisites to follow: - all core ASes MUST be able to reach each other with some sequence of core links - and all non-core ASes MUST have at least one path up to a core AS. Furthermore, to ensure that the properties hold within a single ISD, all core ASes of the ISD MUST be able to reach each other without leaving the ISD, i.e, for every pair of cores in an ISD there is a sequence of SCION links that only traverse the ISD members. A core AS may reach other core ASes in the same ISD via other ISDs. This may be permitted, depending on the ISD's policies.
Manipulation of the Beaconing Process by a Core Adversary The first risk to the beaconing process comes from an adversary controlling one or more core ASes in an ISD. If the adversary stops all core AS(es) within an ISD from propagating PCBs, the discovery of new paths will halt. In this case, downstream ASes will notice that PCBs are no longer being propagated, but all previously discovered and still valid paths remain usable for data plane forwarding until they expire. This is an unlikely scenario, as it would require compromise of all core ASes within an ISD.
Manipulation of the Beaconing Process by a Non-Core Adversary This section examines several possible approaches that could be taken by an "ordinary" non-core adversary to manipulate the beaconing process in the Control Plane. For each case it shows to what extent SCION's design can prevent the corresponding attack or help mitigate it.
Path Hijacking through Interposition A malicious AS M might try to manipulate the beaconing process between two neighbor ASes A and B, with the goal to hijack traffic to flow via M. If M can interpose itself on the path between A and B, then it could attempt several potential attacks:
  • The adversary M could intercept and disseminate a PCB on its way from A to the neighboring AS B, and inject its own AS entry into the PCB toward downstream ASes.
  • The adversary could modify the Hop Fields of an already existing path in order to insert its own AS in the path.
  • The adversary could fully block traffic between AS A and AS B in order to force traffic redirection through an alternate path that includes its own AS.
The first type of attack is detectable and blocked by downstream ASes (e.g. B) because a PCB disseminated by AS A towards AS B contains the "Next ISD AS" field in the entry of AS A, pointing to AS B, and protected by A's signature. If M manipulates the PCB while in flight from A to B, then verification of the manipulated inbound PCBs will fail at AS B, as the adversary's PCBs cannot contain A's correct signature (see ). The second type of attack is made impossible by the Hop Field's MAC which protects the Hop Field's integrity and chains it with the previous Hop Fields on the path. The third type of attack generally cannot be prevented. However the alternate path would be immediately visible to endpoints as traffic MUST include Hop Fields from AS M.
Creation of Spurious ASes and ISDs An alternative scenario is when an adversary tries to introduce and spoof a non-existent AS. This would enable the adversary to send traffic with the spoofed AS as a source, allowing the adversary to complicate the detection of its attack and to plausibly deny the misbehavior. However, spoofing a new AS requires a registration of that AS with the ISD core to obtain a valid AS certificate, otherwise the adversary cannot construct valid PCBs. As this registration should include a thorough check and authentication by a CA, this cannot be done stealthily which defeats the original purpose. Similarly to creating a fake AS, an adversary could try to introduce a new malicious ISD. This involves the generation of its own TRC, finding core ASes to peer with, and convincing other ISDs of its legitimacy to accept the new TRC. Although this setup is not entirely impossible, it requires substantial time and effort and may need the involvement of more than one malicious entity. Here the "costs" of setting up the fake ISD may outweigh the benefits.
Peering Link Misuse The misuse of a peering link by an adversary represents another type of attack. Consider the case where AS A wants to share its peering link only with one of its downstream neighbors AS B, and therefore selectively includes the peering link only in PCBs sent to B. An adversary may now try to gain access to this peering link by prepending the relevant PCBs to its own path. For this, the adversary needs to be able to (1) eavesdrop on the link from A to B, and (2) obtain the necessary Hop Fields by querying a Control Service and extracting the Hop Fields from registered paths. Even if an adversary succeeds in misusing a peering link as described above, SCION is able to mitigate this kind of attack. Each AS includes an egress interface as well as specific “next hop” information to the PCB before disseminating it further downstream. If a malicious entity tries to misuse a stolen PCB by adding it to its own segments, verification will fail upstream as the egress interface mismatches. Therefore, the peering link can only be used by the intended AS.
Manipulation of the Path-Selection Process SCION endpoints select inter-domain forwarding paths. This section discusses some mechanisms with which an adversary can attempt to trick endpoints downstream (in the direction of beaconing) into choosing non-optimal paths. The goal of such attacks is to make paths that are controlled by the adversary more attractive than other available paths. In SCION, overall path selection is the result of three steps. Firstly, each AS selects which PCBs are further forwarded to its neighbors. Secondly, each AS chooses the paths it wants to register at the local Control Service (as up segments) and at the core Control Service (as down segments). Thirdly, the endpoint performs path selection among all available paths resulting from a path lookup process. These attacks are only successful if the adversary is located within the same ISD and upstream relative to the victim AS. It is not possible to attract traffic away from the core as traffic travels upstream towards the core. Furthermore, the attack may either be discovered downstream (e.g., by seeing large numbers of paths becoming available), or during path registrations. After detection, non-core ASes will be able to identify paths traversing the adversary AS and avoid these paths. Announcing Large Numbers of Path Segments
This attack is possible if the adversary controls at least two ASes. The adversary can create a large number of links between the ASes under its control which do not necessarily correspond to physical links. This allows the adversary to multiply the number of PCBs forwarded to its downstream neighbor ASes and in turn increases the chance that one or several of these forwarded PCBs are selected by the downstream ASes. In general, the number of PCBs that an adversary can announce this way scales exponentially with the number of consecutive ASes the adversary controls. However, this also decreases their chance of being chosen by a downstream AS for PCB dissemination or by an endpoint for path construction as these relatively long paths have to compete with other shorter paths. Furthermore, both endpoints and downstream ASes can detect poorer quality paths in the data plane and switch to better paths. Wormhole Attack
A malicious AS M1 can send a PCB not only to their downstream neighbor ASes, but also out-of-band to another non-neighbor colluding malicious AS M2. This creates new segments to M2 and M2's downstream neighbor ASes, simulating a link between M1 and M2 which may not correspond to an actual link in the network topology. Similarly, a fake path can be announced through a fake peering link between two colluding ASes even if in different ISDs. An adversary can advertise fake peering links between the two colluding ASes, thus offering short paths to many destination ASes. Downstream ASes might have a policy of preferring paths with many peering links and thus are more likely to disseminate PCBs from the adversary. Endpoints are also more likely to choose short paths that make use of peering links. In the data plane, whenever the adversary receives a packet containing a fake peering link, it can transparently exchange the fake peering Hop Fields with valid Hop Fields to the colluding AS. To avoid detection of the path alteration by the receiver, the colluding AS can replace the added Hop Fields with the fake peering link Hop Fields the sender inserted. To defend against this attack, methods to detect the wormhole attack are needed. Per link or path latency measurements can help reveal the wormhole and render the fake peering link suspicious or unattractive. Without specific detection mechanisms these so-called wormhole attacks are unavoidable in routing. Rogue SCMP Error Messages
SCMP External Interface Down () and Internal Connectivity Down () can potentially be abused by an attacker to to disrupt forwarding of information and/or force the traffic through a different paths. Endpoints should therefore consider them weak hints and apply heuristics to detect fraudulent SCMP messages (e.g. by actively probing whether the affected path is actually down). Note that this would be mitigated through authentication of SCMP messages. Authentication is not specified here since it is currently still experimental.
Denial of Service Attacks The beaconing process in the SCION Control Plane relies on control plane communication. ASes exchange control plane messages within each other when propagating PCBs to downstream neighbors, when registering PCBs as path segments, or during core path lookup. Volumetric DoS attacks, where attackers overload a link may make it difficult to exchange these messages. SCION limits the impact of such attacks which aim to exhaust network bandwidth on links as ASes can switch to alternative paths that do not contain the congested links. Reflection-based attacks are also prevented as response packets are returned on the same path to the actual sender. Other mechanisms are required to avoid transport protocol attacks where the attacker tries to exhaust the resources on a target server, such as for the Control Services, by opening many connections to this. The means to mitigate these kind of DoS attacks are basically the same as for the current Internet, e.g. filtering, geo-blocking or using cookies. Thanks to its path awareness, SCION enables more fine-grained filtering mechanisms based on certain path properties. For example, control plane RPC methods that are available to endpoints within an AS are strictly separate from methods available to endpoints from other ASes. Specifically, expensive recursive path segment and trust material lookups are thus shielded from abuse by unauthorized entities. For RPC methods exposed to other ASes, the Control Service implementation minimizes its attack surface by rejecting illegitimate callers based on ISD/AS, path type and length and any other available data points as soon as possible, i.e. immediately after determining the request type. For example:
  • SegmentCreationService.Beacon can only be called by direct neighbors and thus calls from peers with a path length greater than one can immediately be discarded.
  • SegmentRegistrationService.SegmentsRegistration can only be called from within the same ISD, thus the source address MUST match the local ISD and the number of path segments MUST be 1.
A combination of the mechanism above is used to prevent flooding attacks on the Control Service. In addition, the Control Service SHOULD be deployed in a distributed and replicated manner so that requests can be balanced and a single instance failure does not result in a complete failure of the control plane of a SCION AS.
IANA Considerations This document has no IANA actions. The ISD and SCION AS number are SCION-specific numbers. They are currently allocated by Anapaya Systems, a provider of SCION-based networking software and solutions (see ). This task is being transitioned from Anapaya to the SCION Association (see ).
References Normative References SCION Data Plane Independent SCION Association Independent Anapaya Systems This document describes the data plane of the path-aware, inter- domain network architecture SCION (Scalability, Control, and Isolation On Next-generation networks). One of the basic characteristics of SCION is that it gives path control to endpoints. The SCION Control Plane is responsible for discovering these paths and making them available as path segments to the endpoints. The role of the SCION Data Plane is to combine the path segments into end-to-end paths, and forward data between endpoints according to the specified path. The SCION Data Plane fundamentally differs from today's IP-based data plane in that it is _path-aware_: In SCION, interdomain forwarding directives are embedded in the packet header. This document provides a detailed specification of the SCION data packet format as well as the structure of the SCION header. SCION also supports extension headers, which are additionally described. The document continues with the life cycle of a SCION packet while traversing the SCION Internet, followed by a specification of the SCION path authorization mechanisms and the packet processing at routers. This document contains new approaches to secure path aware networking. It is not an Internet Standard, has not received any formal review of the IETF, nor was the work developed through the rough consensus process. The approaches offered in this work are offered to the community for its consideration in the further evolution of the Internet. SCION Control Plane PKI SCION Association SCION Association Anapaya Systems This document presents the trust concept and design of the SCION _Control Plane Public Key Infrastructure (CP-PKI)_. SCION (Scalability, Control, and Isolation On Next-generation networks) is a path-aware, inter-domain network architecture where the Control Plane PKI handles cryptographic material and lays the foundation for the authentication procedures in SCION. It is used by SCION's Control Plane to authenticate and verify path information, and provisions SCION's trust model based on Isolation Domains. This document describes the trust model behind the SCION Control Plane PKI, including specifications of the different types of certificates and the Trust Root Configuration. It also specifies how to deploy the Control Plane PKI infrastructure. This document contains new approaches to secure path aware networking. It is not an Internet Standard, has not received any formal review of the IETF, nor was the work developed through the rough consensus process. The approaches offered in this work are offered to the community for its consideration in the further evolution of the Internet. Classless Inter-domain Routing (CIDR): The Internet Address Assignment and Aggregation Plan This memo discusses the strategy for address assignment of the existing 32-bit IPv4 address space with a view toward conserving the address space and limiting the growth rate of global routing state. This document obsoletes the original Classless Inter-domain Routing (CIDR) spec in RFC 1519, with changes made both to clarify the concepts it introduced and, after more than twelve years, to update the Internet community on the results of deploying the technology described. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements. Internet X.509 Public Key Infrastructure Certificate and Certificate Revocation List (CRL) Profile This memo profiles the X.509 v3 certificate and X.509 v2 certificate revocation list (CRL) for use in the Internet. An overview of this approach and model is provided as an introduction. The X.509 v3 certificate format is described in detail, with additional information regarding the format and semantics of Internet name forms. Standard certificate extensions are described and two Internet-specific extensions are defined. A set of required certificate extensions is specified. The X.509 v2 CRL format is described in detail along with standard and Internet-specific extensions. An algorithm for X.509 certification path validation is described. An ASN.1 module and examples are provided in the appendices. [STANDARDS-TRACK] QUIC: A UDP-Based Multiplexed and Secure Transport This document defines the core of the QUIC transport protocol. QUIC provides applications with flow-controlled streams for structured communication, low-latency connection establishment, and network path migration. QUIC includes security measures that ensure confidentiality, integrity, and availability in a range of deployment circumstances. Accompanying documents describe the integration of TLS for key negotiation, loss detection, and an exemplary congestion control algorithm. HTTP/3 The QUIC transport protocol has several features that are desirable in a transport for HTTP, such as stream multiplexing, per-stream flow control, and low-latency connection establishment. This document describes a mapping of HTTP semantics over QUIC. This document also identifies HTTP/2 features that are subsumed by QUIC and describes how HTTP/2 extensions can be ported to HTTP/3. gRPC, an open-source universal RPC framework Protocol Buffers Language Guide version 3 Connect Protocol Reference Key words for use in RFCs to Indicate Requirement Levels In many standards track documents several words are used to signify the requirements in the specification. These words are often capitalized. This document defines these words as they should be interpreted in IETF documents. This document specifies an Internet Best Current Practices for the Internet Community, and requests discussion and suggestions for improvements. Ambiguity of Uppercase vs Lowercase in RFC 2119 Key Words RFC 2119 specifies common key words that may be used in protocol specifications. This document aims to reduce the ambiguity by clarifying that only UPPERCASE usage of the key words have the defined special meanings. Informative References SCION Overview SCION Association SCION Association ETH Zuerich The Internet has been successful beyond even the most optimistic expectations and is intertwined with many aspects of our society. But although the world-wide communication system guarantees global reachability, the Internet has not primarily been built with security and high availability in mind. The next-generation inter-network architecture SCION (Scalability, Control, and Isolation On Next- generation networks) aims to address these issues. SCION was explicitly designed from the outset to offer security and availability by default. The architecture provides route control, failure isolation, and trust information for end-to-end communication. It also enables multi-path routing between hosts. This document discusses the motivations behind the SCION architecture and gives a high-level overview of its fundamental components, including its authentication model and the setup of the control- and data plane. As SCION is already in production use today, the document concludes with an overview of SCION deployments. For detailed descriptions of SCION's components, refer to [I-D.dekater-scion-pki], [I-D.dekater-scion-controlplane], and [I-D.dekater-scion-dataplane]. A more detailed analysis of relationships and dependencies between components is available in [I-D.rustignoli-scion-components]. SCION ISD and AS Assignments SCION Registry The Complete Guide to SCION ETH Zuerich ETH Zuerich ETH Zuerich Otto von Guericke University Magdeburg Anapaya Systems ETH Zuerich ETH Zuerich Requirements for Internet Hosts - Communication Layers This RFC is an official specification for the Internet community. It incorporates by reference, amends, corrects, and supplements the primary protocol standards documents relating to hosts. [STANDARDS-TRACK] A Border Gateway Protocol 4 (BGP-4) This document discusses the Border Gateway Protocol (BGP), which is an inter-Autonomous System routing protocol. The primary function of a BGP speaking system is to exchange network reachability information with other BGP systems. This network reachability information includes information on the list of Autonomous Systems (ASes) that reachability information traverses. This information is sufficient for constructing a graph of AS connectivity for this reachability from which routing loops may be pruned, and, at the AS level, some policy decisions may be enforced. BGP-4 provides a set of mechanisms for supporting Classless Inter-Domain Routing (CIDR). These mechanisms include support for advertising a set of destinations as an IP prefix, and eliminating the concept of network "class" within BGP. BGP-4 also introduces mechanisms that allow aggregation of routes, including aggregation of AS paths. This document obsoletes RFC 1771. [STANDARDS-TRACK] Autonomous System (AS) Number Reservation for Documentation Use To reduce the likelihood of conflict and confusion when relating documented examples to deployed systems, two blocks of Autonomous System numbers (ASNs) are reserved for use in examples in RFCs, books, documentation, and the like. This document describes the reservation of two blocks of ASNs as reserved numbers for use in documentation. This memo provides information for the Internet community. Autonomous System (AS) Reservation for Private Use This document describes the reservation of Autonomous System Numbers (ASNs) that are for Private Use only, known as Private Use ASNs, and provides operational guidance on their use. This document enlarges the total space available for Private Use ASNs by documenting the reservation of a second, larger range and updates RFC 1930 by replacing Section 10 of that document. Current Open Questions in Path-Aware Networking In contrast to the present Internet architecture, a path-aware internetworking architecture has two important properties: it exposes the properties of available Internet paths to endpoints, and it provides for endpoints and applications to use these properties to select paths through the Internet for their traffic. While this property of "path awareness" already exists in many Internet-connected networks within single domains and via administrative interfaces to the network layer, a fully path-aware internetwork expands these concepts across layers and across the Internet. This document poses questions in path-aware networking, open as of 2021, that must be answered in the design, development, and deployment of path-aware internetworks. It was originally written to frame discussions in the Path Aware Networking Research Group (PANRG), and has been published to snapshot current thinking in this space. A Vocabulary of Path Properties Path properties express information about paths across a network and the services provided via such paths. In a path-aware network, path properties may be fully or partially available to entities such as endpoints. This document defines and categorizes path properties. Furthermore, the document identifies several path properties that might be useful to endpoints or other entities, e.g., for selecting between paths or for invoking some of the provided services. This document is a product of the Path Aware Networking Research Group (PANRG). PCB Path Metadata Extension Anapaya Systems ETH Zuerich SCION Association The diameter of a scale-free random graph n.d. SCMP Documentation Anapaya Systems ETH Zuerich SCION Association SCIONLAB - A Next-Generation Internet Testbed ETH Zuerich ETH Zuerich ETH Zuerich ETH Zuerich ETH Zuerich Otto von Guericke University Magdeburg ETH Zuerich SCION IP Gateway Documentation Anapaya Systems ETH Zuerich SCION Association
Acknowledgments Many thanks go to Alvaro Retana (Futurewei), Joel M. Halpern (Ericsson), William Boye (Swiss National Bank), Matthias Frei (SCION Association), Kevin Meynell (SCION Association), Juan A. Garcia Prado (ETH Zurich), and Roger Lapuh (Extreme Networks), for reviewing this document. We also thank Daniel Galán Pascual and Christoph Sprenger from the Information Security Group at ETH Zurich for their inputs based on their formal verification work on SCION. We are also very grateful to Adrian Perrig (ETH Zurich), for providing guidance and feedback about every aspect of SCION. Finally, we are indebted to the SCION development teams of Anapaya, ETH Zurich, and the SCION Association for their practical knowledge and for the documentation about the SCION Control Plane, as well as to the authors of - the book is an important source of input and inspiration for this draft.
Deployment Testing: SCIONLab SCIONLab is a global research network that is available to test the SCION architecture. You can create and use your ASes using your own computation resources which allows you to gain real-world experience of deploying and managing a SCION network. More information can be found on the SCIONLab website and in the paper.
Path-Lookup Examples To illustrate how the path lookup works, we show two path-lookup examples in sequence diagrams. The network topology of the examples is represented in below. In both examples, the source endpoint is in AS A. shows the sequence diagram for the path lookup process in case the destination is in AS D, whereas shows the path lookup sequence diagram if the destination is in AS G. ASes B and C are core ASes in the source ISD, while E and F are core ASes in a remote ISD. Core AS B is a provider of the local AS, but AS C is not, i.e. there is no up-segment from A to C. "CS" stands for Control Service.
Topology used in the path lookup examples Core Core c AS F AS C c c AS B c c c c AS E c AS D AS A AS G ISD 1 ISD 2
Sequence diagram illustrating a path lookup for a destination D in the source ISD. The request (core, 0, 0) is for all pairs of core ASes in the source ISD. Similarly, (down, 0, D) is for down segments between any core AS in the source ISD and destination D. Endpoint Source AS Core AS Core AS CS (A) CS (B) CS (C) Send Requests in parallel request (up) -- -- -- -- -- -- reply (up,[A->B]) request (core,0,0) request (core,B,0) -- -- -- -- -- - reply(core,[B->C]) -- -- -- -- -- - reply (core,[B->C]) request (down,0,D) send requests in parallel request (down,B,D) -- -- -- -- -- reply(down,[B->D]) request (down,C,D) -- -- -- -- -- -- -- -- -- -- -- reply(down,[C->D]) -- -- -- -- reply (down,[B->D, C->D]) Combine Segments | | | |<-- -- -- -- -- -- -- + | | | | | reply (up,[A->B])| | | | | | | | | | | | | | | | | |request (core,0,0)| | | | +------------------->| | | | | | |request (core,B,0) | | | | | +------------------->| | | | | |<-- -- -- -- -- -- -+ | | | | | reply(core,[B->C])| | | |<-- -- -- -- -- -- -+ | | | | | reply (core,[B->C]) | | | | | | | | | | | | | | | | |request (down,0,D)| | | | | | +------+------+ | | | | +---------->|send requests| | | | | | | in parallel | | | | | | +-----+-+-----+ | | | | | | | | | | | | | |request (down,B,D) | | | | | +-------------------->| | | | | |<-- -- -- -- -- -- --+ | | | | | | reply(down,[B->D])| | | | | | | | | | | | | | |request (down,C,D) | | | | | +-------------------------------------->| | | | | |<-- -- -- -- -- -- -- -- -- -- -- -- --+ | | | | | | reply(down,[C->D])| | | | | | | | | | |<--- -- -- -- -- +-+ | | | | | reply (down,[B->D, C->D]) | | | | | | | | +--+-+-+---------+ | | | |Combine Segments| | | | +----+-----------+ | | | | | | | | | | | | | | | ]]>
Sequence diagram illustrating a path lookup for a destination G in a remote ISD. The request (core, 0, (2, 0)) is for all path segments between a core AS in the source ISD and a core AS in ISD 2. Similarly, (down, (2, 0), G) is for down segments between any core AS in ISD 2 and destination G. Endpoint Source AS Core AS Core AS Core AS CS (A) CS (B) CS (E) CS (F) Send Requests in parallel request (up) | | -- -- -- -- - reply (up,[A->B]) request (core 0,(2,0)) request (core,0 (2,0)) <- -- -- -- -- reply (core,[B->E,B->F]) <- -- -- -- -- reply (core,[B->E,B->F]) request (down,(2,0),G) send requests in parallel request (down,E G) -- -- -- -- -- -- -- -- -- - reply (down,[E->G]) request (down,F G) <- -- -- -- -- -- -- -- -- -- -- -- -- -- -- - reply (down,[F->G]) <- -- -- -- reply (down,[E->G,F->G]) Combine Segments | | | | | | | | | | | |<-- -- -- -- -- -+ | | | | | | reply (up,[A->B]) | | | | | | | | | | | | | | | | | | | |request (core,0,(2,0)) | | | | +-------------->| | | | | | | |request (core,0,(2,0)) | | | | | +-------------->| | | | | | |<- -- -- -- -- + | | | | | | reply (core,[B->E,B->F]) | | | |<- -- -- -- -- + | | | | | | reply (core,[B->E,B->F]) | | | | | | | | | | | | | | | | | | | | request (down,(2,0),G) | | | | | | +-------------. | | | | | +----->|send requests| | | | | | | | in parallel | | | | | | | +-----+-+-----+ | | | | | | | | |request (down,E,G) | | | | +------------------------------->| | | | | |<-- -- -- -- -- -- -- -- -- -- -+ | | | | | | | reply (down,[E->G]) | | | | | | | | | | | | | | | | | | | | | | | |request (down,F,G) | | | | +--------------------------------------------->| | | | | |<- -- -- -- -- -- -- -- -- -- -- -- -- -- -- -+ | | | | | | | reply (down,[F->G]) | | |<- -- -- -- +-+ | | | | | | reply (down,[E->G,F->G]) | | | | | | | | | | +--+-+-+---------+ | | | | |Combine Segments| | | | | +----+-----------+ | | | | | | | | | | | | | | | | | | | ]]>
Change Log Changes made to drafts since ISE submission. This section is to be removed before publication.
draft-dekater-scion-controlplane-11
  • Clarify use of wildcard ISD and ISD-AS text representation
  • Remove redundant PCB overview figure 6 and reorganized paragraphs in 2.2. PCBs
  • Small clarifications and nits
  • Figures: small changes to use aasvg in all figures
  • Appendix "Path-Lookup Examples": use wildcard AS 0 instead of * in figures in
draft-dekater-scion-controlplane-10 Major changes:
  • New section "Distribution of Cryptographic Material" containing definitions formerly in the gRPC API appendix
  • New section "Destination Mapping" including a SIG reference
  • New section "Lookup Requests Message Format" containing definitions formerly in the gRPC API appendix
  • Move appendix "Use of the SCION Data Plane" to new section "Control Service Discovery"
  • Mention ConnectRPC as main RPC method instead of gRPC
  • Remove appendix "Full Control Service gRPC API" and move corresponding protobuf definitions in new sections mentioned above
Minor changes:
  • Rename Inter-ISD Beaconing into Core Beaconing for consistency
  • Clarify descriptions of fields in the HeaderAndBody message and that metadata must be empty
  • AS Entry Signature: fix order of terms in one formula, clarify validity and meaning of associated data
  • PCB Extensions: clarified text, added example of the StaticInfoExtension and informative reference
  • PCB Validity: clarify text on timestamp validity and time allowances
  • Reception of PCBs: mention that incoming link MUST be core or parent
  • PCB selection policies: discourage use for traffic engineering
  • Best PCBs Set Size: clarify tradeoffs and avoid normative language when unnecessary
  • Path reversibility: mention that destination endpoints should estimate MTU
  • Move considerations on SCMP Authentication to the security considerations section (Rogue SCMP Error Messages)
  • Security Properties: use normative language to clarify assumptions
draft-dekater-scion-controlplane-09 Major changes:
  • "SCION AS numbers": make text representation for lower 32-bit ASes consistent with PKI draft, add reference to allocation.
Minor changes:
  • Nits and wording improvements
  • Reviewed use of normative language
  • Figures: redraw and use aasvg when possible
  • "Paths and Links": clarify relationship between path segments and links
  • Ensure consistent use of example ranges
draft-dekater-scion-controlplane-08 Major changes:
  • Abstract: reword, mention goal and that document is not an Internet Standard
  • "Propagation of PCBs" section:
    • clarify checks at reception
    • introduce criteria for PCB selection policies
    • remove superfluous policy example figure
    • Propagation Interval and Best PCBs Set Size: mention tradeoff between scalability and amount of paths discovered.
    • reorganize order of paragraphs
  • New section "Security Properties" in Security considerations, based on formal model of SCION
  • New figure: Control Service RPC API - Trust Material definitions
Minor changes:
  • Moved "Special-Purpose SCION AS Numbers" table later in text
  • Split "Circular dependencies and partitioning" into two sections: "Bootstrapping ability" and "Resistance to partitioning".
  • Explain why PCBs have a next_isd_as field
  • Qualified better the choice of time allowance in the definition of segment from the future in section "PCB Validity".
draft-dekater-scion-controlplane-07
  • Moved SCMP specification from draft-dekater-scion-dataplane-03 to this document
draft-dekater-scion-controlplane-06 Major changes:
  • New section: Path MTU
  • New section: Monitoring Considerations
  • Completed description of Control Services RPC API in appendix
Minor changes:
  • Introduction: clarify goal of the document
  • Clarify typical vs recommended-limits values for best PCB set size and for certificate validity duration.
  • Clarify text representation of ISD-AS
  • General rewording
  • Added reference to SCIONLab as a testbed for implementors
  • Introduced this change log
draft-dekater-scion-controlplane-05 Minor changes:
  • Clarify beaconing fast retry at bootstrapping
draft-dekater-scion-controlplane-04 Major changes:
  • Clarified selection of MAC including a default algorithm
  • New section: PCB validity
  • New section: configuration
  • New section: Path Discovery Time and Scalability
  • New section: Effects of Clock Inaccuracy
  • New appendix: Control Service RPC API
Minor changes:
  • Introduction: Added overview of SCION components
  • Clarified path reversibility, link types, Interface IDs
  • Fixed private AS range typo
  • Clarified PCB selection policies and endpoint requirements
  • Clarified PCB propagation
  • General edits to make terminology consistent, remove duplication and rationalize text
  • Removed forward references
  • Added RFC2119 compliant terminology