dl-breadcrumbs__homedl-breadcrumb-item__separatorConfiguration and programmingdl-breadcrumb-item__separatorProgramming with CODESYSdl-breadcrumb-item__separatorAutomation Builderdl-breadcrumb-item__separator...dl-breadcrumb-item__separatorWorking with Controller Networks dl-breadcrumb-item__separatorNetwork and Addressing dl-breadcrumb-item__separatorAddress Structures dl-breadcrumb-item__separatorNode addresses
dl-pagination__prev-inactivedl-pagination__prev-activedl-pagination__next-inactivedl-pagination__next-active
Node addresses dl-permalink__symbolPermalink

The node address indicates the absolute address of a node within a control network and is therefore unique within the whole "network tree". The address is composed of up to 15 address components, each of which occupies 2 bytes. The lower a node is located within the network hierarchy, the longer its address.

The complete node address consists of the partial addresses of all preceding nodes and the partial address of the node itself. Each partial address consists of one or more address components. The length is therefore always a multiple of 2 bytes. The partial address of a node is formed from the network address of the node in its main network and the subnet index of the main network in the case of the parent node. The bits required for the subindex are determined by the router of the parent node. Filler bits can be inserted between the subnet index and the network address in order to ensure that the length of the partial address is a multiple of 2 bytes.

Special cases:

  • Node without network: This means that there is neither a subnet index nor a network address in the main network. In this case the address is set to 0x0000.

  • Node in main network without parent: In this case, a subnet index with 0 length is assumed. The partial address corresponds to the network address, if necessary extended by filler bits.

Example of node addresses

_cds_img_node_addressing.png

The node address is always specified in hexadecimal. The individual address components (two bytes in each case) are separated by a colon ":". Since this represents an array of bytes and not a 16-bit value, the components are not displayed in the Intel format. For manually input addresses, missing parts in an address component are supplemented by leading zeros: "‎274‎" = "‎0274‎". In order to improve the legibility, the display should also always contain the leading zeros.

Absolute and relative addresses

Communication between two nodes can be based on relative or absolute addresses. Absolute addresses are identical to node addresses. Relative addresses specify a path from the sender to the receiver. They consist of an address offset and the descending path to the receiver.

The (negative) address offset describes the number of address components by which a package must be passed upwards in the tree before it can be passed back down by the common parent node. Since nodes can use partial addresses that consist of more than one component, the number of parent components to be passed is always equal to the address offset. This means that the demarcation between the parent nodes is no longer clear. For that reason the common start of the address of the communication partners is used as the parent address. Each address component is counted as an upward step, independent of the current parent node. Each error resulting from this assumption can be detected by the corresponding parent node and must be handled by it accordingly.

After reaching the common parent node the relative path, as an array of address components, is followed downwards as usual. Formally: The node address of the receiver is formed by removing the last address offset components from the node address of the sender and by appending the relative path to the remaining address.

Example of the formation of node addresses

In the following example each address component is represented by a letter; in each case a dot separates nodes from each other. Since a node can carry several address components, there are some in the example that are represented with several letters.

Node A: ‎a.bc.d.ef.g‎

Node B: ‎a.bc.i.j.kl.m‎

  • Address of the least common parent: ‎a.bc‎

  • Relative address from A to B: ‎-4/i.j.kl.m‎

    The number 4 results from the 4 components – ‎d‎, ‎e‎, ‎f‎ and ‎g‎ – which has to forward the data package in the upwards.

In order to guarantee correct operation of the routing, the relative address must be adapted each time it passes an intermediate node. It is sufficient to adapt the address offset. This is always done by the parent node. If a node receives a data package from one of its subnets, the address offset is increased by the length of the address component of this subnet.

  • If the new address offset is < 0, then the data package must be passed further upward.

  • If the address offset is >= 0, then the data package must be passed on to the child node whose local address corresponds to the relative path, starting from the address offset. First of all, however, the address offset must be increased by the length of the local address of the child node, so that the child node sees the correct address.

A special situation results if the error mentioned above occurs during the determination of the common parent node. In this case the address offset of the actual parent node is negative, but this value is larger than the length of the partial address of the subnet from which the package originated. So that the next node sees a correct relative address in this case, the relevant node has to do the following: discover the error, calculate the local address of the child node on the basis of the address of the predecessor node and the length difference, and adapt the address offset accordingly. In this case, too, the address components as such remain unchanged; only the offset is changed.