Network devices, methods and system for communication
By rearranging destination address bits to create a changed destination address within network devices, the need for a segment routing header is eliminated, enabling efficient segment routing with zero overhead and preserving path information, addressing the overhead issues in existing segment routing technologies.
Patent Information
- Application Number
- PCT/EP2023/062911
- Authority / Receiving Office
- WO · WO
- Patent Type
- Applications
- Current Assignee / Owner
- Filing Date
- 2023-05-15
- Publication Date
- 2024-11-21
AI Technical Summary
The overhead associated with segment routing headers in IPv4 and IPv6 packets is significant due to the need to include a list of routers, which can be reduced by compressing router addresses into segment identifiers, but this still requires a segment routing header to convey path information.
A network device rearranges the destination address bits to create a changed destination address that preserves path information without the need for a segment routing header, allowing segment routing with zero overhead by shifting and rearranging the bits of the destination address, enabling path determination without a segment routing header.
This approach allows for efficient segment routing without the overhead of a segment routing header, enabling path determination and compatibility with conventional network devices, thus facilitating hybrid networks and preserving information about the transmission path.
Smart Images

Figure EP2023062911_21112024_PF_FP_ABST
Abstract
Description
[0001] NETWORK DEVICES, METHODS AND SYSTEM FOR COMMUNICATION
[0002] TECHNICAL FIELD
[0003] The present disclosure relates to network devices for communication, methods for communicating and a system for communication.
[0004] BACKGROUND
[0005] The internet protocol version 4 (IPv4) and internet protocol version 6 (IPv6) are examples of a network protocol for communication between network devices that enables an optional feature called source routing. Source routing is a routing approach in which the source of a packet (e.g. network device transmitting the packet, may be referred to as sender) determines the path of the packet (to the destination, i.e. the intended network device) by incorporating a list of routers in the header (packet header) of the transmitted packet. The source of the packet may be referred to as source network device or sender. The destination of the packet may be referred to as destination network device or (intended) receiver. A variant of source routing is called segment routing (SR), in which the source of a packet may incorporate a segment routing header (SRH) as an extension header of a packet (e.g. IPv4 packet or IPv6 packet), and the SRH includes the list of routers along the path from the source to the destination. Each router on the list is represented by a segment identifier (SID), which may be for example 32 bits long (in the case of IPv4) or 128 bits long (in the case of IPv6).
[0006] A list of routers, where each router is represented by 32 bits or 128 bits, may incur a large overhead on IPv4 packets or IPv6 packets, respectively, that include a SRH. Therefore, SRH compression is intended to reduce the overhead by compressing several router addresses into a single segment identifier (SID). Thus, an SRH may include multiple SIDs, where each SID is comprised of multiple compressed segment identifiers (C-SIDs).
[0007] The structure of a SID that includes a list of C-SIDs may comprise a prefix (may be referred to as Locator-Block) that specifies the network (or location) address and the list of C-SIDs.
[0008] SUMMARY
[0009] In view of the above, this disclosure aims to provide network devices and methods for communication that are improved with regard to segment routing (SR). An objective of this disclosure may be to provide network devices and methods for communication of a data structure (e.g. packet) that allow SR without a segment routing header (SRH); and allow a destination of the data structure to know which path was used (from the source of the data structure).
[0010] These and other objectives are achieved by the solution of this disclosure as described in the independent claims. Advantageous implementations are further defined in the dependent claims.
[0011] A first aspect of this disclosure provides a network device for communication. The network device is configured to receive a data structure; and determine whether B + C most significant bits of a destination address of M bits of the data structure equal an address of the network device. The network device is configured to, in case the B + C most significant bits of the destination address equal the address of the network device, generate a changed destination address of the received data structure by rearranging the bits of the destination address such that
[0012] B most significant bits of the changed destination address equal B most significant bits of the destination address,
[0013] M - (B + R) bits of the changed destination address, which are adjacent to the B most significant bits of the changed destination address, equal M - (B + R) least significant bits of the destination address, and
[0014] R least significant bits of the changed destination address equal R least significant bits of the B + R most significant bits of the destination address.
[0015] The network device is configured to transmit the data structure with the changed destination address to a network device identified by the B + C most significant bits of the changed destination address. M, B, C and R are each an integer greater than zero, R is greater than or equal to C, and M - (B + R) is greater than zero.
[0016] In other words, according to the first aspect a network device is proposed that does not delete information of the destination address of a received data structure for transmitting (retransmitting or routing) the received data structure. The term “pop” may be used as a synonym for the term “delete”. In contrast, the network device is configured to rearrange the information of the destination address, i.e. generate a changed destination address comprising all information of the destination address that is rearranged. That is, by rearranging the bits of the destination address (for generating a changed destination address) the information of the destination address is preserved and, thus, information about the path via which the data structure was sent is preserved. The path may be understood as one or more other network devices via which the received data structure has been sent from the source of the received data structure. A part of the path between two network devices (e.g. the source and a network device being a router; two network devices each being a router or a network device and the destination) may be referred to as “segment”.
[0017] Thus, the network device according to the first aspect is improved with regard to segment routing (SR), because a path (and, thus, segments) via which the data structure is transmitted may be determined using the changed destination address of the data structure so that there is no need of a segment routing header (SRH), i.e. no header options are needed. That is, the network device according to the first aspect allows segment routing with zero overhead in a header of the data structure. The network device according to the first aspect allows a network device receiving the data structure with the changed destination address to know the path of the data structure from the changed destination address, without the use of a SRH.
[0018] Further, since the rearrangement of the bits removes the R least significant bits of the B + R most significant bits of the destination address and places them at the end of the changed destination address (i.e. as the R least significant bits of the change destination address) loose segment routing may be performed. That is, the data structure may be transmitted by the network device to a conventional network device, such as a conventional router. This allows establishing a hybrid network with network devices according to this disclosure and conventional network devices.
[0019] The network device may be configured to communicate according to a network protocol. That is, the network device may be a network device for communication according to a network protocol. The network protocol may be the internet protocol (IP). For example, the network protocol may be IPv4 or IPv6. IPv4 stands for “internet protocol version 4” and IPv6 stands for “internet protocol version 6”. The destination address may be abbreviated by the term “address”. The destination address may be an IP address (e.g. IPv4 address or IPv6 address). The network device may be a node of a network, i.e. it may be part of the network. The network device may be a computer. The network device may be a network interface card (NIC). The network device may be a router. The network device may be a switch (e.g. network switch). The destination address of the data structure comprises information on a destination network device (for which the data structure is intended) and on the path (to the destination network device). The destination address of the data structure comprises information on routing the data structure to a destination network device. The routing may be a segment routing, such as a compressed segment routing. The network device may be configured to perform segment routing (e.g. compressed segment routing) by generating the changed destination address, as described herein. The network device may be configured to provide or allow segment routing (SR), such as compressed segment routing. The network device may be configured to generate the changed destination address of the data structure according to a segment routing scheme (SR scheme), such as compressed segment routing scheme, and transmit the data structure. In other words, the network device may be configured to transmit the data structure according to the segment routing scheme.
[0020] The data structure may be a packet, e.g. a data packet. For example, the data structure may be an IPv4 packet or an IPv6 packet. The network device may be a router. That is, the network device may be configured to function or act as a router for routing the data structure with the changed destination address.
[0021] For example, the integer M may be 128 bits (e.g. when the network protocol is IPv6) or 32 bits (e.g. when the network protocol is IPv4).
[0022] The R bits adjacent to the B most significant bits of the destination address may be a network device identifier (e.g. router identifier). The network device identifier may comprise location information (e.g. a location field) and optionally function information (e.g. a function field). In case the network device identifier comprises location information and function information, C most significant bits of the R bits may be the location information (e.g. location field) of the network device identifier and the (R - C) least significant bits of the R bits may be the function information (e.g. function field) of the network device identifier. In the aforementioned case, the integer R is greater than the integer C. In case the network device identifier comprises only location information, the integer R equals to the integer C, and the R bits adjacent to the B most significant bits of the destination address are the location information (e.g. location field). The term “network device identifier” and “identifier of a network device” may be used as synonyms. Thus, the terms “router network device identifier” and “destination network device identifier” may be used as synonyms for the term “identifier of a router network device” and “identifier of a destination network device”, respectively. The term “router network device” may be abbreviated by “router”. The term “destination network device” may be abbreviated by “destination”. Thus, the terms “router network device identifier” and “destination network device identifier” may be abbreviated by the terms “router identifier” and “destination identifier”, respectively.
[0023] The value of M may be defined by a network protocol (according to which the network device may be configured to communicate). That is, the integer M may have a pre-set value that may be defined by the network protocol. The value of M may be pre-known to the network device. The value of M may be stored in a storage of the network device or an external storage associated with the network device. The network device may be configured to receive the value of M from outside, such as from an external device. The above description with regard to the integer M is correspondingly valid for the integers B, C and R. For example, the M - B least significant bits may be two or more network device identifiers (e.g. one destination network device identifier and one or more router network device identifiers), wherein optionally at least two of the identifiers may have a different length (i.e. equal to a different number of bits). In this case, the value of R of the R bits adjacent to the B most significant bits representing a network device identifier of the destination address and the value of R of the R bits adjacent to the B most significant bits representing a network device identifier of the changed destination address may be different. Optionally, each network device identifier may have a different length.
[0024] The network device identified by the B + C most significant bits of the changed destination address may be a network device according to this disclosure, such as a network device according to the first aspect or a network device according to the second aspect.
[0025] In an implementation form of the first aspect, the network device is configured to rearrange the bits of the destination address by removing the R least significant bits of the B + R most significant bits of the destination address, shifting, after the removal of the removed R bits, the M - (B + R) least significant bits of the destination address adjacent to the B most significant bits of the destination address, and setting, after the shift of the shifted M - (B + R) bits, the R least significant bits of the destination address to the removed R bits. In other words, the network device may be configured to perform a cyclic shift operation on the destination address of the received data structure in case the B + C most significant bits of the destination address equal the address of the network device. For this, the network device may be configured to update the destination address by removing the R least significant bits of the B + R most significant bits of the destination address, which correspond to its address, from the destination address, and pushing these R least significant bits in the least significant bits of the destination address. That is, the network device may be configured to pop the R least significant bits of the B + R most significant bits of the destination address; shift the M — (B + R) least significant bits of the destination address adjacent to the B most significant bits of the destination address; and append the popped R least significant bits at the end of the destination address.
[0026] The above described cyclic shift operation allows the data structure to be routed through the next network device indicated by the updated (i.e. changed) destination address, without loosing information about previous hops, i.e. previous one or more network devices via which the data structure has been already transmitted.
[0027] In an implementation form of the first aspect, the network device is configured to be triggered by information of the B + C most significant bits of the destination address to, in case the B + C most significant bits of the destination address equal the address of the network device, generate the changed destination address and transmit the data structure with the changed destination address.
[0028] The network device may be configured to be triggered by information of C least significant bits of the B + C most significant bits of the destination address to, in case the B + C most significant bits of the destination address equal the address of the network device, generate the changed destination address and transmit the data structure with the changed destination address. Generating the changed destination address and transmitting the data structure (i.e. the received data structure) with the changed destination address may be referred to as “routing function” or “router function”. Thus, the network device may be configured to be triggered by information of the B + C most significant bits of the destination address to perform a routing function in case the B + C most significant bits of the destination address equal the address of the network device. In other words, the network device may be configured to be triggered by information of the B + C most significant bits of the destination address to function or act as a router (that rearranges the bits of the destination address of the received data structure for transmitting (i.e. routing) the received data structure) in case the B + C most significant bits of the destination address equal the address of the network device. That is, the network device may be configured to determine, based on information of the B + C most significant bits of the destination address, that it is a router for routing the received data structure according to this disclosure.
[0029] In an implementation form of the first aspect, the network device is configured to determine whether the B + C most significant bits of the destination address equal the address of the network device by comparing the B + C most significant bits of the destination address and the address of the network device with each other.
[0030] In an implementation form of the first aspect, the network device is configured to, in case the B + C most significant bits of the destination address do not equal the address of the network device, determine, using the destination address, a network device, to which the data structure is to be transmitted; and transmit the received data structure with the destination address to the determined network device.
[0031] In other words, the network device may be configured to, in case the B + C most significant bits of the destination address do not equal the address of the network device, to perform conventional routing.
[0032] In an implementation form of the first aspect, the network device is configured to communicate according to a network protocol being IPv4 or IPv6.
[0033] In an implementation form of the first aspect, the destination address comprises B most significant bits for an identifier of a network, and M - B least significant bits for identifiers of two or more network devices of the network.
[0034] In other words, the B most significant bits of the destination address may be an identifier of a network. The M - B least significant bits may be identifiers of two or more network devices of the network, i.e. two or more network device identifiers. The two or more network device identifiers may be an identifier of a destination network device (for which the data structure is intended) and one or more router network device identifiers. The identifier of the network may be a prefix of the destination address. The identifier of the network may be referred to as “locator block” or “location”. The identifier of the network may comprise or may be a network identifier (network ID or net ID), e.g. the IPv4 network identifier in case the network device is configured to communicate according to the IPv4 network protocol or the IPv6 network identifier in case the network device is configured to communicate according to the IPv6 network protocol. The network device may be configured for segment routing, such as compressed segment routing. The two or more network device identifiers may be compressed segment identifiers (C-SIDs). The M - B least significant bits of the destination address may comprise or may be a segment list of two or more C-SIDs.
[0035] The two or more network device identifiers may have the same length of bits. Optionally, at least two identifiers of the two or more network device identifiers may have a different lengths of bits. Optionally, each of the two or more network device identifiers may have a different lengths of bits.
[0036] The data structure may not comprise or may not be associated to a segment routing header. That is, the network device may be configured to receive the data structure without a segment routing header.
[0037] In order to achieve the network device according to the first aspect of the disclosure, some or all of the implementation forms and optional features of the first aspect, as described above, may be combined with each other.
[0038] A second aspect of this disclosure provides a network device for communication. The network device is configured to receive a data structure; and determine whether B + C most significant bits of a destination address of M bits of the data structure equal an address of the network device. The network device is configured to, in case the B + C most significant bits of the destination address equal the address of the network device, extract M - (B + R) least significant bits of the destination address. M, B, C and R are each an integer greater than zero, R is greater than or equal to C, and M - (B + R) is greater than zero.
[0039] The network device may be configured to communicate according to a network protocol. That is, the network device may be a network device for communication according to a network protocol. The network device may be a host. The network device may be a node of a network, i.e. it may be part of the network. The network device may be a computer. The network device may be a server. The network device may be a network interface card (NIC). The network device may be referred to as “destination” or “destination network device”.
[0040] The above description of the network device according to the first aspect, such as the description of the data structure, the type of communication, the type of network protocol, the integers M, B, C and R and so on, is correspondingly valid for the network device of the second aspect. The network device of the second aspect may be the network device of the first aspect.
[0041] The M - (B + R) least significant bits of the destination address may comprise or may be one or more C-SIDs of a segment list of two or more C-SIDs being the M - B least significant bits of the destination address. Thus, the network device may be configured to extract one or more C-SIDs by extracting the M - (B + R) least significant bits of the destination address.
[0042] In an implementation form of the second aspect, the network device is configured to store the extracted M - (B + R) bits in a storage of the network device and / or an external storage associated with the network device.
[0043] In an implementation form of the second aspect, the network device is configured to determine, using the extracted M - (B + R) bits, a path via which the data structure has travelled from a source network device to the network device.
[0044] In an implementation form of the second aspect, the network device is configured to be triggered by information of the B + C most significant bits of the destination address to, in case the B + C most significant bits of the destination address equal the address of the network device, extract the M - (B + R) least significant bits of the destination address.
[0045] The network device may be configured to be triggered by information of C least significant bits of the B + C most significant bits of the destination address to, in case the B + C most significant bits of the destination address equal the address of the network device, extract M - (B + C) least significant bits of the destination address. The network device may be configured to be triggered by information of the B + C most significant bits of the destination address to function or act as a destination network device (for which the data structure is intended) in case the B + C most significant bits of the destination address equal the address of the network device. For example, the network device may be configured to determine, using the B + C most significant bits of the destination address, that it is the destination (for which the data structure is intended). The B most significant bits of the destination address may be a prefix of the destination address. Thus, the network device may be configured to determine, using the prefix of the destination address, that it is the destination for which the received data structure is intended.
[0046] In an implementation form of the second aspect, the network device is configured to determine whether the B + C most significant bits of the destination address equal the address of the network device by comparing the B + C most significant bits of the destination address and the address of the network device with each other.
[0047] In an implementation form of the second aspect, the network device is configured to, in case the B + C most significant bits of the destination address do not equal the address of the network device, determine, using the destination address, a network device, to which the data structure is to be transmitted; and transmit the received data structure with the destination address to the determined network device.
[0048] In other words, the network device may be configured to, in case the B + C most significant bits of the destination address do not equal the address of the network device, to perform conventional routing.
[0049] In an implementation form of the second aspect, the network device is configured to communicate according to a network protocol being IPv4 or IPv6.
[0050] In an implementation form of the second aspect, the destination address comprises B most significant bits for an identifier of a network, and M - B least significant bits for identifiers of two or more network devices of the network.
[0051] In other words, the B most significant bits of the destination address may be an identifier of a network. The M - B least significant bits may be identifiers of two or more network devices of the network, i.e. two or more network device identifiers. The two or more network device identifiers may be an identifier of a destination network device (for which the data structure is intended) and one or more router network device identifiers. The identifier of the network may be a prefix of the destination address. The identifier of the network may be referred to as “locator block” or “location”. The identifier of the network may comprise or may be a network identifier (network ID or net ID), e.g. the IPv4 network identifier in case the network device is configured to communicate according to the IPv4 network protocol or the IPv6 network identifier in case the network device is configured to communicate according to the IPv6 network protocol. The network device may be configured for segment routing, such as compressed segment routing. The two or more network device identifiers may be compressed segment identifiers (C-SIDs). The M - B least significant bits of the destination address may comprise or may be a segment list of two or more C-SIDs.
[0052] The two or more network device identifiers may have the same length of bits. Optionally, at least two identifiers of the two or more network device identifiers may have a different lengths of bits. Optionally, each of the two or more network device identifiers may have a different lengths of bits.
[0053] The data structure may not comprise or may not be associated to a segment routing header. That is, the network device may be configured to receive the data structure without a segment routing header.
[0054] In order to achieve the network device according to the second aspect of the disclosure, some or all of the implementation forms and optional features of the second aspect, as described above, may be combined with each other.
[0055] The above description of the network device according to the second aspect may be correspondingly valid for the network device of the first aspect.
[0056] The network device of the second aspect and its implementation forms and optional features achieve the same advantages as the network device of the first aspect and its respective implementation forms and respective optional features.
[0057] In order to achieve the network device according to the second aspect of the disclosure, some or all of the implementation forms and optional features of the second aspect, as described above, may be combined with each other. A third aspect of the disclosure provides a method for communicating. The method comprises receiving a data structure; and determining whether B + C most significant bits of a destination address of M bits of the data structure equal an address of a network device. The method comprises, in case the B + C most significant bits of the destination address equal the address of the network device, generating a changed destination address of the received data structure by rearranging the bits of the destination address such that
[0058] B most significant bits of the changed destination address equal B most significant bits of the destination address,
[0059] M - (B + R) bits of the changed destination address, which are adjacent to the B most significant bits of the changed destination address, equal M - (B + R) least significant bits of the destination address, and
[0060] R least significant bits of the changed destination address equal R least significant bits of the B + R most significant bits of the destination address.
[0061] The method comprises transmitting the data structure with the changed destination address to a network device identified by the B + C most significant bits of the changed destination address. M, B, C and R are each an integer greater than zero, R is greater than or equal to C, and M - (B + R) is greater than zero.
[0062] The method may be a method for communicating according to a network protocol.
[0063] In an implementation form of the third aspect, the method comprises rearranging the bits of the destination address by removing the R least significant bits of the B + R most significant bits of the destination address, shifting, after the removal of the removed R bits, the M - (B + R) least significant bits of the destination address adjacent to the B most significant bits of the destination address, and setting, after the shift of the shifted M - (B + R) bits, the R least significant bits of the destination address to the removed R bits.
[0064] In an implementation form of the third aspect, the method comprises being triggered by information of the B + C most significant bits of the destination address to, in case the B + C most significant bits of the destination address equal the address of the network device, generate the changed destination address and transmit the data structure with the changed destination address.
[0065] In an implementation form of the third aspect, the method comprises determining whether the B + C most significant bits of the destination address equal the address of the network device by comparing the B + C most significant bits of the destination address and the address of the network device with each other.
[0066] In an implementation form of the third aspect, the method comprises, in case the B + C most significant bits of the destination address do not equal the address of the network device, determining, using the destination address, a network device, to which the data structure is to be transmitted; and transmit the received data structure with the destination address to the determined network device.
[0067] In an implementation form of the third aspect, the method comprises communicating according to a network protocol being IPv4 or IPv6.
[0068] In an implementation form of the third aspect, the destination address comprises B most significant bits for an identifier of a network, and M - B least significant bits for identifiers of two or more network devices of the network.
[0069] In an implementation form of the third aspect, the method comprises generating and transmitting the data structure such that the data structure does not comprise or is not associated to a segment routing header.
[0070] The description of the network device of the first aspect is correspondingly valid for the method of the third aspect.
[0071] The method of the third aspect and its implementation forms and optional features achieve the same advantages as the network device of the first aspect and its respective implementation forms and respective optional features. In order to achieve the method according to the third aspect of the disclosure, some or all of the implementation forms and optional features of the third aspect, as described above, may be combined with each other.
[0072] A fourth aspect of the disclosure provides a method for communicating. The method comprises receiving a data structure; and determining whether B + C most significant bits of a destination address of M bits of the data structure equal an address of a network device. The method comprises, in case the B + C most significant bits of the destination address equal the address of the network device, extracting M - (B + R) least significant bits of the destination address. M, B, C and R are each an integer greater than zero, R is greater than or equal to C, and M - (B + R) is greater than zero.
[0073] The method may be a method for communicating according to a network protocol.
[0074] In an implementation form of the fourth aspect, the method comprises storing the extracted M - (B + R) bits in a storage of a network device and / or an external storage associated with the network device.
[0075] In an implementation form of the fourth aspect, the method comprises determining, using the extracted M - (B + R) bits, a path via which the data structure has travelled from a source network device to a network device.
[0076] In an implementation form of the fourth aspect, the method comprises being triggered by information of the B + C most significant bits of the destination address to, in case the B + C most significant bits of the destination address equal the address of the network device, extract the M - (B + R) least significant bits of the destination address.
[0077] In an implementation form of the fourth aspect, the method comprises determining whether the B + C most significant bits of the destination address equal the address of the network device by comparing the B + C most significant bits of the destination address and the address of the network device with each other.
[0078] In an implementation form of the fourth aspect, the method comprises, in case the B + C most significant bits of the destination address do not equal the address of the network device, determining, using the destination address, a network device, to which the data structure is to be transmitted; and transmit the received data structure with the destination address to the determined network device.
[0079] In an implementation form of the fourth aspect, the method comprises communicating according to a network protocol being IPv4 or IPv6.
[0080] In an implementation form of the fourth aspect, the destination address comprises B most significant bits for an identifier of a network, and M - B least significant bits for identifiers of two or more network devices of the network.
[0081] In an implementation form of the fourth aspect, the method comprises generating and transmitting the data structure such that the data structure does not comprise or is not associated to a segment routing header.
[0082] The description of the network device of the second aspect is correspondingly valid for the method of the fourth aspect.
[0083] The method of the fourth aspect and its implementation forms and optional features achieve the same advantages as the network device of the first aspect and its respective implementation forms and respective optional features.
[0084] In order to achieve the method according to the fourth aspect of the disclosure, some or all of the implementation forms and optional features of the fourth aspect, as described above, may be combined with each other.
[0085] A fifth aspect of the disclosure provides a system for communication. The system comprises a network device according to the first aspect or the second aspect of the disclosure, as described above, and a second network device. The second network device is configured to generate and transmit the data structure to the network device such that the data structure does not comprise or is not associated to a segment routing header.
[0086] The system may be a system for communication according to a network protocol. The second network device may be a host. The second network device may be a server. The second network device may be a network interface card (NIC). The second network device may be a node of a network, i.e. it may be part of the network. The second network device may be a computer. The second network device may be implemented according to the network device of the first aspect and / or the network device of the second aspect. The system may be a network, and the network device and the second network device may be nodes of the network.
[0087] The description of the network device of the first aspect and the description of the network device of the second aspect is correspondingly valid for the system of the fifth aspect.
[0088] The system of the fifth aspect and its implementation forms and optional features achieve the same advantages as the network device of the first aspect and its respective implementation forms and respective optional features.
[0089] In order to achieve the system according to the fifth aspect of the disclosure, some or all of the implementation forms and optional features of the fifth aspect, as described above, may be combined with each other.
[0090] It has to be noted that all devices, elements, units and means described in the present application could be implemented in software or hardware elements or any kind of combination thereof. All steps which are performed by the various entities described in the present application as well as the functionalities described to be performed by the various entities are intended to mean that the respective entity is adapted to or configured to perform the respective steps and functionalities. Even if, in the following description of specific embodiments, a specific functionality or step to be performed by external entities is not reflected in the description of a specific detailed element of that entity which performs that specific step or functionality, it should be clear for a skilled person that these methods and functionalities can be implemented in respective software or hardware elements, or any kind of combination thereof.
[0091] BRIEF DESCRIPTION OF DRAWINGS
[0092] The above described aspects and implementation forms will be explained in the following description of specific embodiments in relation to the enclosed drawings, in which
[0093] Fig- 1 shows an example of a network device according to this disclosure.
[0094] Fig- 2 shows an example of a network device according to this disclosure. Fig- 3 shows a destination address that may be received and / or transmitted by an example of a network device according to this disclosure.
[0095] Fig- 4 shows an example of a system according to this disclosure.
[0096] Fig- 5 shows an example of a method according to this disclosure.
[0097] Fig. 6 shows an example of a method according to this disclosure.
[0098] Fig. 7 shows an example of transmitting, according to this disclosure, a data structure in a network.
[0099] In the Figures, corresponding elements are labeled with the same reference sign.
[0100] DETAILED DESCRIPTION OF EMBODIMENTS
[0101] Fig. 1 shows an example of a network device according to this disclosure. The network device of Fig. 1 is an example of the network device according to the first aspect of this disclosure. The description of the network device according to the first aspect of this disclosure is correspondingly valid for the network device of Fig. 1. In the Figures, the reference sign “MSB” indicates the most significant bit, and the reference sign “LSB” indicates the least significant bit.
[0102] The network device la of Fig. 1 is a network device for communication. The network device la is configured to receive a data structure DS; and determine whether B + C most significant bits of a destination address 100 of M bits of the data structure DS equal an address of the network device la.
[0103] As shown in Fig. 1, the destination address 100 of the received data structure DS comprises, starting from the most significant bit MSB, B bits 101, R bits 102 following the B bits 101, and M - (B +R) bits 103 following the R bits 102.
[0104] The network device la may be configured to, in case the B + C most significant bits of the destination address 100 equal the address of the network device la, generate a changed destination address 200 of the received data structure DS by rearranging the bits of the destination address 100 such that
[0105] B most significant bits 201 of the changed destination address 200 equal B most significant bits 101 of the destination address 100, M - (B + R) bits 202 of the changed destination address 200, which are adjacent to the B most significant bits 201 of the changed destination address 200, equal M - (B + R) least significant bits 103 of the destination address 100, and
[0106] R least significant bits 203 of the changed destination address 200 equal R least significant bits 102 of the B + R most significant bits of the destination address 100.
[0107] In other words, as shown in Fig. 1, the generated changed destination address 200 comprises, starting from the most significant bit MSB,
[0108] B most significant bits 201 equaling the B most significant bits 101 of the destination address 100;
[0109] M - (B + R) bits 202 following the B most significant bits 201 and equaling the M - (B + R) least significant bits 103 of the destination address 100; and
[0110] R least significant bits 203 equaling the R least significant bits 102 of the B + R most significant bits of the destination address 100.
[0111] The network device la is configured to transmit the data structure DS with the changed destination address 200 to a network device 1 ’ identified by the B + C most significant bits of the changed destination address. M, B, C and R are each an integer greater than zero, R is greater than or equal to C, and M - (B + R) is greater than zero.
[0112] In the light of the above, the R bits 102 of the destination address 100 may indicate the network device la. Thus, the R bits 102 may be an identifier of a network device, i.e. a network device identifier. The M - (B + R) bits 103 of the destination address 100 may indicate one or more network devices. Thus, the M - (B + R) bits 103 may be one or more network device identifiers. For example, in case the M - (B + R) bits 103 are one network device identifier, the network device identifier may be a destination network device identifier indicating a destination (destination network device) for which the data structure DS is intended.
[0113] For example, in case the M - (B + R) bits 103 are two network device identifiers, least significant bits (e.g. R least significant bits) of the M - (B + R) bits 103 may be a destination network device identifier indicating a destination for which the data structure DS is intended. The most significant bits (e.g. R most significant bits) of the M - (B + R) bits 103 may be a router network device identifier indicating a network device intended to route the data structure DS to the destination. Since the R bits 102 of the destination address 100 are not only deleted for generating the change destination address 200, but are appended at the end of the changed destination address 200 as least significant bits, the information that the data structure DS has been transmitted (retransmitted or routed) by the network device la is preserved, so that the network device receiving the data structure DS from the network device la may determine that the data structure DS has been transmitted via the network device la from the source. In other words, the information that the network device la is a part of the path from the source to the destination is preserved in the changed destination address 200.
[0114] For example, in case a source (source network device) initially transmits the data structure DS to a destination (destination network device) via two routers (router network devices), then the M - B least significant bits of the destination address 100 of the data structure initially (i.e. at the time of the data structure DS leaving the source) may comprise a list of three network device identifiers; wherein, starting from the most significant bit of the M - B least significant bits of the destination address 100, a first network device identifier of the list may indicate a first router, a second network device identifier of the list may indicate a second router and a third network device identifier of the list may indicate the destination. Assuming that the first router and the second router are network devices according to the first aspect, i.e. route the data structure by generating a changed destination address according to this disclosure, the M - (B + R) least significant bits of the destination address received by the destination comprise the first router network device identifier and the second router network device identifier. Thus, the destination may determine based on the M - (B + R) least significant bits of the received destination address the path, via which the received data structure has been transmitted from the source.
[0115] The network device la may comprise a processor or processing circuitry (not shown) configured to perform, conduct or initiate the various operations of the network device la described herein. The processing circuitry may comprise hardware and / or the processing circuitry may be controlled by software. The hardware may comprise analog circuitry or digital circuitry, or both analog and digital circuitry. The digital circuitry may comprise components such as applicationspecific integrated circuits (ASICs), field-programmable arrays (FPGAs), digital signal processors (DSPs), or multi-purpose processors. The network device la may further comprise memory circuitry, which stores one or more instruction(s) that can be executed by the processor or by the processing circuitry, in particular under control of the software. For instance, the memory circuitry may comprise a non-transitory storage medium storing executable software code which, when executed by the processor or the processing circuitry, causes the various operations of the network device la to be performed. In one example, the processing circuitry comprises one or more processors and a non-transitory memory connected to the one or more processors. The non-transitory memory may carry executable program code which, when executed by the one or more processors, causes the network device la to perform, conduct or initiate the operations or methods described herein.
[0116] For further information on the network device of Fig. 1 reference is made to the description of the network device according to the first aspect of this disclosure.
[0117] Fig- 2 shows an example of a network device according to this disclosure. The network device of Fig. 2 is an example of the network device according to the second aspect of this disclosure. The description of the network device according to the second aspect of this disclosure is correspondingly valid for the network device of Fig. 2.
[0118] The network device lb of Fig. 2 is a network device for communication. The network device lb is configured to receive a data structure DS2; and determine whether B + C most significant bits of a destination address 300 of M bits of the data structure DS2 equal an address of the network device lb.
[0119] As shown in Fig. 2, the destination address 300 of the received data structure DS2 comprises, starting from the most significant bit MSB, B bits 301, R bits 302 following the B bits 301, and M - (B +R) bits 303 following the R bits 302.
[0120] The network device lb is configured to, in case the B + C most significant bits of the destination address 300 equal the address of the network device lb, extract M - (B + R) least significant bits 303 of the destination address 300 (as indicated in Fig. 2 by the dashed arrow). M, B, C and R are each an integer greater than zero, R is greater than or equal to C, and M - (B + R) is greater than zero.
[0121] Thus, assuming that the data structure DS2 has been transmitted from a source via one or more routers each being the network device la of Fig. 1 to the network device lb as the destination, the network device lb may determine, using the extracted M - (B + R) bits 303, a path via which the data structure DS2 has travelled from the source to the network device lb.
[0122] The description of Fig. 1 is correspondingly valid for describing the elements, such as the network device lb, the destination address and so on, of Fig. 2.
[0123] The network device lb may comprise a processor or processing circuitry (not shown) configured to perform, conduct or initiate the various operations of the network device lb described herein. The processing circuitry may comprise hardware and / or the processing circuitry may be controlled by software. The hardware may comprise analog circuitry or digital circuitry, or both analog and digital circuitry. The digital circuitry may comprise components such as applicationspecific integrated circuits (ASICs), field-programmable arrays (FPGAs), digital signal processors (DSPs), or multi-purpose processors. The network device lb may further comprise memory circuitry, which stores one or more instruction(s) that can be executed by the processor or by the processing circuitry, in particular under control of the software. For instance, the memory circuitry may comprise a non-transitory storage medium storing executable software code which, when executed by the processor or the processing circuitry, causes the various operations of the network device lb to be performed. In one example, the processing circuitry comprises one or more processors and a non-transitory memory connected to the one or more processors. The non-transitory memory may carry executable program code which, when executed by the one or more processors, causes the network device lb to perform, conduct or initiate the operations or methods described herein.
[0124] For further information on the network device of Fig. 2 reference is made to the description of the network device according to the second aspect of this disclosure.
[0125] Fig- 3 shows a destination address that may be received and / or transmitted by an example of a network device according to this disclosure. For example, the destination address of Fig. 3 may be received and / or transmitted by the network device of Fig. 1. For example, the destination address of Fig. 3 may be received and / or transmitted by the network device of Fig. 2. The reference sings of Fig. 3 refer to reference signs of Figs. 1 and 2.
[0126] As shown in Fig. 3, the destination address 100, 200, 300 may comprises B most significant bits 101, 201, 301 for an identifier “Net-ID” of a network, and M - B least significant bits 102, 103; 202, 203; 302, 303 for identifiers “ND-IDs” of two or more network devices of the network. In other words, the B most significant bits 101, 201, 301 of the destination address 100, 200, 300 may be an identifier “Net-ID” of a network, e.g. a network identifier. The M - B least significant bits 102, 103; 202, 203; 302, 303 of the destination address 100, 200, 300 may be two or more network device identifiers.
[0127] For further information on the destination address of Fig. 3 reference is made to the description of the network device according to the first aspect of this disclosure, and the description of the network device according to the second aspect of this disclosure.
[0128] Fig- 4 shows an example of a system according to this disclosure. The system of Fig. 4 is an example of the system according to the fifth aspect of this disclosure. The description of the system according to the fifth aspect of this disclosure is correspondingly valid for the system of Fig. 4.
[0129] The system 3 of Fig. 4 is a system for communication. The system 3 comprises the network device la of Fig. 1 or the network device lb of Fig. 2. In addition, the system 3 comprises a second network device 2. The second network device 2 is configured to generate and transmit the data structure DS, DS2 to the network device la, lb such that the data structure DS, DS2 does not comprise or is not associated to a segment routing header. The second network device 2 may be configured to generate the destination address 100, 300 of the data structure D S, DS2.
[0130] For further information on the system of Fig. 4 reference is made to the description of the system according to the fifth aspect of this disclosure.
[0131] Fig- 5 shows an example of a method according to this disclosure. The method of Fig. 5 is an example of the method according to the third aspect of this disclosure. The description of the method according to the third aspect of this disclosure is correspondingly valid for the method ofFig. 5.
[0132] The method ofFig. 5 is a method for communicating. As shown in Fig. 5, the method comprises, in a step SI, receiving a data structure. The method comprises, in a step S2 following the step SI, determining whether B + C most significant bits of a destination address of M bits of the data structure equal an address of a network device. The method comprises, in a step S3 following the step S2, in case the B + C most significant bits of the destination address equal the address of the network device, generating a changed destination address of the received data structure by rearranging the bits of the destination address such that
[0133] B most significant bits of the changed destination address equal B most significant bits of the destination address,
[0134] M - (B + R) bits of the changed destination address, which are adjacent to the B most significant bits of the changed destination address, equal M - (B + R) least significant bits of the destination address, and
[0135] R least significant bits of the changed destination address equal R least significant bits of the B + R most significant bits of the destination address.
[0136] The method comprises, in a step S4 following the step S3, transmitting the data structure with the changed destination address to a network device identified by the B + C most significant bits of the changed destination address. M, B, C and R are each an integer greater than zero, R is greater than or equal to C, and M - (B + R) is greater than zero.
[0137] The network device la of Fig. 1 may be configured to perform the method of Fig. 5. The network device lb of Fig. 2 may be configured to perform the method of Fig. 5.
[0138] For further information on the method of Fig. 5 reference is made to the description of the method according to the third aspect of this disclosure.
[0139] Fig- 6 shows an example of a method according to this disclosure. The method of Fig. 6 is an example of the method according to the fourth aspect of this disclosure. The description of the method according to the fourth aspect of this disclosure is correspondingly valid for the method of Fig. 6.
[0140] The method of Fig. 6 is a method for communicating. As shown in Fig. 6, the method comprises, in a step S10, receiving a data structure. The method comprises, in a step S20 following the step S10, determining whether B + C most significant bits of a destination address of M bits of the data structure equal an address of a network device. The method comprises, in a step S30 following the step S20, in case the B + C most significant bits of the destination address equal the address of the network device, extracting M - (B + R) least significant bits of the destination address. M, B, C and R are each an integer greater than zero, R is greater than or equal to C, and M - (B + R) is greater than zero.
[0141] The network device la of Fig. 1 may be configured to perform the method of Fig. 6. The network device lb of Fig. 2 may be configured to perform the method of Fig. 6.
[0142] For further information on the method of Fig. 6 reference is made to the description of the method according to the fourth aspect of this disclosure.
[0143] Fig- 7 shows an example of transmitting, according to this disclosure, a data structure in a network.
[0144] In the example of Fig. 7, it is assumed that in a network comprising the network devices Hl, H2, RO, Rl, R2, R3, R4 communication is performed according to the IPv6 protocol. This is only by way of example and, thus, the following description is correspondingly valid in case of another communication protocol, such as IPv4. Further, it is assumed that the network device Hl is a source that transmits a data structure (e.g. packet) to the network device H2. Thus, the network device H2 is assumed to be a destination. The network devices RO, Rl, R2, R3 and R4 are network devices that are assumed to be routers. It is assumed that the network devices RO, Rl, R2, R3 and R4 are each the network device according to Fig. 1, and the network device H2 is the network device according to Fig. 2. Further it is assumed that the network devices Hl, H2, RO, Rl, R2, R3 and R4 perform segment routing without using a segment routing header (SGH). In the example of Fig. 7, it is assumed that the source Hl intends to transmit the data structure via the routers RO, Rl, R4 and R3 to the destination H2. For each segment the IPv6 header is indicated wherein the source address (SA) and the destination address (DA) are shown. The source is the network device Hl and, thus, for all segments the source address equals to the address of the network device Hl (SA = Hl).
[0145] The destination address (DA) is shown in hexadecimal. Since the network protocol is exemplarily assumed to be IPv6, the destination address comprises 128 bits. Thus, the 128 bits correspond to the M bits of the destination address used in the description of Figs. 1, 2 and 3. Starting from the most significant bit, the first 48 bits “K:0:0” of the destination address are the network identifier (may be referred to as locator block). These 48 bits correspond to the B most significant bits of the destination address used in the description of Figs. 1, 2 and 3. The 80 bits, following the first 48 bits, of the destination address comprise a list of five network device identifiers. It is assumed that each identifier of the five network device identifiers has the same length, i.e. same number of bits. Thus, according to the example of Fig. 7, each identifier of the five network device identifiers is 16 bits long. This may be different and the following description is accordingly valid for a different example. The list of five network device identifiers may be a list of five C-SIDs. The 80 bits of the destination address correspond to the M - B least significant bits of the destination address used in the description of Figs. 1, 2 and 3. The 16 bits of each network device identifier correspond to the R bits adjacent to the B most significant bits of the of the destination address used in the description of Figs. 1, 2 and 3. Optionally, at least two network device identifiers may have a different length (not shown in Fig. 7). The description of Fig. 7 is correspondingly valid for the aforementioned optional case.
[0146] The network device identifier identifying the router RO is represented by “X0”. The network device identifier identifying the router R1 is represented by “XI”. The network device identifier identifying the router R4 is represented by “X4”. The network device identifier identifying the router R3 is represented by “X3”. The network device identifier identifying the destination H2 is represented by “X2”.
[0147] As shown in Fig. 7, the destination address of the data structure received by the first router RO from the source Hl reads “K:0:0:X0:Xl :X4:X3 :X2”. Thus, the router RO compares the network identifier “K:0:0” and the identifier “X0” with its address. Since this is a match, the router RO changes the destination address by removing the identifier “X0” (i.e. removing the R least significant bits of the B + R most significant bits) of the destination address, shifting the identifiers “X1:X4:X3:X2” adjacent to the network identifier “K:0:0” (i.e. shifting the M - (B + R) least significant bits adjacent to the B most significant bits); and appending the removed identifier “X0” to the end of the list of identifiers ““XI :X4:X3 :X2” (i.e. setting the R least significant bits of the destination address to the removed R bits). As a result, the destination address of the data structure received by the second router R1 from the first router RO reads “K:0:0:Xl :X4:X3 :X2:X0”. Each router Rl, R4 and R3 processes the destination address in line with the above description of processing the destination address by the first router RO. Thus, the destination address received by the third router R4 reads “K:0:0:X4:X3:X2:X0:Xl”, the destination address received by the fourth router R3 reads “K:0:0:X3:X2:X0:Xl:X4”, and the destination address received by the destination H2 reads “K:0:0:X2:X0:Xl:X4:X3”. As can be seen from the destination address received by the destination H2 the path “XO:X1 :X4:X3”, via which the data structure is transmitted from the source Hl to the destination H2, is part of the destination address “K:0:0:X2:X0:Xl :X4:X3”. Therefore, the destination H” may extract the corresponding least significant bits of the destination address “XO:X1 :X4:X3” and use these extracted bits to determine the path via which the data structure has travelled from the source Hl to the destination H2. This corresponds to extracting M - (B + R) least significant bits of the destination address and determine, using the extracted M - (B + R) bits, the path, as described with regard to Fig. 2. Thus, the destination H2 may determine, using the bits “K:0:0:X2” that the data structure is destined to the destination H2; and may have access to the full path in the remaining bits “XO:X1:X4:X3” of the destination address. The terms “destined” and “intended” may be used as synonyms.
[0148] The present disclosure has been described in conjunction with various embodiments as examples as well as implementations. However, other variations can be understood and effected by those persons skilled in the art and practicing the claimed matter, from the studies of the drawings, this disclosure and the independent claims. In the claims as well as in the description the word “comprising” does not exclude other elements or steps and the indefinite article “a” or “an” does not exclude a plurality. A single element or other unit may fulfill the functions of several entities or items recited in the claims. The mere fact that certain measures are recited in the mutual different dependent claims does not indicate that a combination of these measures cannot be used in an advantageous implementation.
Claims
CLAIMS1. A network device (la) for communication, the network device (la) being configured to receive a data structure (DS); determine whether B + C most significant bits of a destination address (100) of M bits of the data structure (DS) equal an address of the network device (la); in case the B + C most significant bits of the destination address (100) equal the address of the network device (la), generate a changed destination address (200) of the received data structure (DS) by rearranging the bits of the destination address such thatB most significant bits (201) of the changed destination address (200) equal B most significant bits (101) of the destination address (100),M - (B + R) bits (202) of the changed destination address (200), which are adjacent to the B most significant bits (201) of the changed destination address (200), equal M - (B + R) least significant bits (103) of the destination address (100), andR least significant bits (203) of the changed destination address (200) equal R least significant bits (102) of the B + R most significant bits (101, 102) of the destination address (100); and transmit the data structure (DS) with the changed destination address (200) to a network device (L) identified by the B + C most significant bits of the changed destination address (200); whereinM, B, C and R are each an integer greater than zero, R is greater than or equal to C, and M - (B + R) is greater than zero.
2. The network device (la) according to claim 1, wherein the network device (la) is configured to rearrange the bits of the destination address (100) by removing the R least significant bits (102) of the B + R most significant bits (101, 102) of the destination address (100), shifting, after the removal of the removed R bits (102), the M - (B + R) least significant bits (103) of the destination address (100) adjacent to the B most significant bits (101) of the destination address (100), and setting, after the shift of the shifted M - (B + R) bits (103), the R least significant bits of the destination address (100) to the removed R bits (102).
3. The network device (la) according to claim 1 or 2, wherein the network device (la) is configured to be triggered by information of the B + C most significant bits of the destination address (100) to, in case the B + C most significant bits of the destination address (100) equal the address of the network device (la), generate the changed destination address (200) and transmit the data structure (DS) with the changed destination address (200).
4. A network device (lb) for communication, the network device (lb) being configured to receive a data structure (DS2); determine whether B + C most significant bits of a destination address (300) of M bits of the data structure (DS2) equal an address of the network device (lb); and in case the B + C most significant bits of the destination address (300) equal the address of the network device (lb), extract M - (B + R) least significant bits (303) of the destination address (300); whereinM, B, C and R are each an integer greater than zero, R is greater than or equal to C, and M - (B + R) is greater than zero.
5. The network device (lb) according to claim 4, wherein the network device (lb) is configured to store the extracted M - (B + R) bits (303) in a storage of the network device (lb) and / or an external storage associated with the network device (lb).
6. The network device (lb) according to claim 4 or 5, wherein the network device (lb) is configured to determine, using the extracted M - (B + R) bits (303), a path via which the data structure (300) has travelled from a source network device to the network device (lb).
7. The network device (lb) according to any one of claims 4 to 6, wherein the network device (lb) is configured to be triggered by information of the B + C most significant bits of the destination address (300) to, in case the B + C most significant bits of the destination address (300) equal the address of the network device, extract the M - (B + R) least significant bits (303) of the destination address (300).
8. The network device (la, lb) according to any one of the previous claims, wherein the network device (la, lb) is configured to determine whether the B + C most significantbits of the destination address (100, 300) equal the address of the network device (la, lb) by comparing the B + C most significant bits of the destination address (100, 300) and the address of the network device (la, lb) with each other.
9. The network device (la, lb) according to any one of the previous claims, wherein the network device (la, lb) is configured to, in case the B + C most significant bits of the destination address (100, 300) do not equal the address of the network device (la, lb), determine, using the destination address (100, 300), a network device, to which the data structure (DS, DS2) is to be transmitted; and transmit the received data structure (DS, DS2) with the destination address (100, 300) to the determined network device.
10. The network device (la, lb) according to any one of the previous claims, wherein the network device (la, lb) is configured to communicate according to a network protocol being IPv4 or IPv6.
11. The network device (la, lb) according to any one of the previous claims, wherein the destination address (100, 300) comprisesB most significant bits (101, 301) for an identifier of a network, and M - B least significant bits for identifiers of two or more network devices of the network.
12. A method for communicating, wherein the method comprises receiving (SI) a data structure; determining (S2) whether B + C most significant bits of a destination address of M bits of the data structure equal an address of a network device; in case the B + C most significant bits of the destination address equal the address of the network device, generating (S3) a changed destination address of the received data structure by rearranging the bits of the destination address such thatB most significant bits of the changed destination address equal B most significant bits of the destination address,M - (B + R) bits of the changed destination address, which are adjacent to the B most significant bits of the changed destination address, equal M - (B + R) least significant bits of the destination address, andR least significant bits of the changed destination address equal R least significant bits of the B + R most significant bits of the destination address; and transmitting (S4) the data structure with the changed destination address to a network device identified by the B + C most significant bits of the changed destination address; whereinM, B, C and R are each an integer greater than zero, R is greater than or equal to C, and M - (B + R) is greater than zero.
13. A method for communicating, wherein the method comprises receiving (SI 0) a data structure; determining (S20) whether B + C most significant bits of a destination address of M bits of the data structure equal an address of a network device; and in case the B + C most significant bits of the destination address equal the address of the network device, extracting (S30) M - (B + R) least significant bits of the destination address; whereinM, B, C and R are each an integer greater than zero, R is greater than or equal to C, and M - (B + R) is greater than zero.
14. The method of claim 12 or 13, wherein the method comprises generating and transmitting the data structure such that the data structure does not comprise or is not associated to a segment routing header.
15. A system (3) for communication, the system (3) comprising a network device (la, lb) according to any one of claims 1 to 11 and a second network device (2); wherein the second network device (2) is configured to generate and transmit the data structure (DS, DS2) to the network device (la, lb) such that the data structure (DS, DS2) does not comprise or is not associated to a segment routing header.
Citation Information
Patent Citations
SRv6 with Micro Segment Identifiers
US20220029918A1
SRv6 SEGMENT IDENTIFIERS AND MICRO SEGMENTS INVOKING NETWORK BEHAVIOR INCLUDING REALIZATION OF NETWORK SLICES
WO2022192001A1
