Abstract: A virtual machine (VM) instance is generated based on a received template. The VM instance is assigned a MAC address from the pool of MAC addresses and an IP address based on the MAC address of the VM instance. A routing identifier of the routing identifiers is extracted from the assigned IP address or the assigned MAC address. Software of the VM is configured to receive data using a port number corresponding to the extracted routing identifier based on a one-to-one mapping.

Abstract: A virtual machine (VM) instance is generated based on a received template. The VM instance is assigned a MAC address from the pool of MAC addresses and an IP address based on the MAC address of the VM instance. A routing identifier of the routing identifiers is extracted from the assigned IP address or the assigned MAC address. Software of the VM is configured to receive data using a port number corresponding to the extracted routing identifier based on a one-to-one mapping.

Abstract: A computer system may generate a lineage graph for a data processing system. The lineage graph may contain one or more nodes, and it may identify the flow of data through the data processing system. The computer system may determine that a first node in the lineage graph defunct. The computer system may then generate a report for the data processing system and provide the report to a user. The report may include an explanation of why the first node is defunct. The computer system may insert an indication that the first node is defunct into metadata for the first node. The indication may also include the explanation of why the first node is defunct.

Abstract: A computer system may generate a lineage graph for a data processing system. The lineage graph may contain one or more nodes, and it may identify the flow of data through the data processing system. The computer system may determine that a first node in the lineage graph defunct. The computer system may then generate a report for the data processing system and provide the report to a user. The report may include an explanation of why the first node is defunct. The computer system may insert an indication that the first node is defunct into metadata for the first node. The indication may also include the explanation of why the first node is defunct.

Abstract: A computer system may generate a lineage graph for a data processing system. The lineage graph may contain one or more nodes, and it may identify the flow of data through the data processing system. The computer system may determine that a first node in the lineage graph defunct. The computer system may then generate a report for the data processing system and provide the report to a user. The report may include an explanation of why the first node is defunct. The computer system may insert an indication that the first node is defunct into metadata for the first node. The indication may also include the explanation of why the first node is defunct.

Abstract: A computer system may generate a lineage graph for a data processing system. The lineage graph may contain one or more nodes, and it may identify the flow of data through the data processing system. The computer system may determine that a first node in the lineage graph defunct. The computer system may then generate a report for the data processing system and provide the report to a user. The report may include an explanation of why the first node is defunct. The computer system may insert an indication that the first node is defunct into metadata for the first node. The indication may also include the explanation of why the first node is defunct.

Abstract: A computer system may generate a lineage graph for a data processing system. The lineage graph may contain one or more nodes, and it may identify the flow of data through the data processing system. The computer system may determine that a first node in the lineage graph defunct. The computer system may then generate a report for the data processing system and provide the report to a user. The report may include an explanation of why the first node is defunct. The computer system may insert an indication that the first node is defunct into metadata for the first node. The indication may also include the explanation of why the first node is defunct.

Abstract: A computer system may generate a lineage graph for a data processing system. The lineage graph may contain one or more nodes, and it may identify the flow of data through the data processing system. The computer system may determine that a first node in the lineage graph defunct. The computer system may then generate a report for the data processing system and provide the report to a user. The report may include an explanation of why the first node is defunct. The computer system may insert an indication that the first node is defunct into metadata for the first node. The indication may also include the explanation of why the first node is defunct.

Abstract: As disclosed herein a method determining whether a tree graph operation is a cutting operation. The method further includes, responsive to determining that the tree graph operation is a cutting operation, determining a cutting zone for the cutting operation, and identifying a developed node in the cutting zone that is to be retained in the tree graph, wherein the developed node is a root node of a shared subtree. The method further includes, responsive to determining the tree graph operation is not a cutting operation, attaching each child of the developed node to a parent of the developed node, and responsive to determining the developed node is a shared subtree with one or more children, attaching a reference to each child of the developed node to a parent of remaining undeveloped nodes. A computer program product and a computer system corresponding to the above method are also disclosed herein.

Abstract: As disclosed herein a method determining whether a tree graph operation is a cutting operation. The method further includes, responsive to determining that the tree graph operation is a cutting operation, determining a cutting zone for the cutting operation, and identifying a developed node in the cutting zone that is to be retained in the tree graph, wherein the developed node is a root node of a shared subtree. The method further includes, responsive to determining the tree graph operation is not a cutting operation, attaching each child of the developed node to a parent of the developed node, and responsive to determining the developed node is a shared subtree with one or more children, attaching a reference to each child of the developed node to a parent of remaining undeveloped nodes. A computer program product and a computer system corresponding to the above method are also disclosed herein.

Abstract: A computer system may generate a lineage graph for a data processing system. The lineage graph may contain one or more nodes, and it may identify the flow of data through the data processing system. The computer system may determine that a first node in the lineage graph defunct. The computer system may then generate a report for the data processing system and provide the report to a user. The report may include an explanation of why the first node is defunct. The computer system may insert an indication that the first node is defunct into metadata for the first node. The indication may also include the explanation of why the first node is defunct.

Abstract: A computer system may generate a lineage graph for a data processing system. The lineage graph may contain one or more nodes, and it may identify the flow of data through the data processing system. The computer system may determine that a first node in the lineage graph defunct. The computer system may then generate a report for the data processing system and provide the report to a user. The report may include an explanation of why the first node is defunct. The computer system may insert an indication that the first node is defunct into metadata for the first node. The indication may also include the explanation of why the first node is defunct.