Method for routing of messages within a data network
AssigneeInternational Business Machines Corporation
InventorsUrs Hunkeler, Hong Linh Truong, Beat Weiss
Life of this patent
Estimating the term…
Abstract
A data network includes a plurality of source nodes, at least one sink node, and at least one intermediate node, wherein routing of a reverse message from the sink node to a source node via at least one intermediate node is performed by the intermediate node using reverse path routing information data comprising a combination of source routing information data and transparent bridging information data, wherein the reverse path routing information data is constructed during propagation of a forward message from the source node to the sink node via the intermediate node.
Claims12
A method for routing a reverse message from a sink node to a source node via at least one intermediate node of a network comprising steps of:
- constructing reverse path routing information data comprising a combination of source routing information data accompanying a forward message, by appending a node address of the respective intermediate node to a source routing data field of the forward message unless a size of the source routing data field exceeds a maximum length and transparent bridging information data stored at a forwarding table in the at least one intermediate node during propagation of a forward message from the source node to the sink node via at least one intermediate node;
- receiving the forward message with reverse path routing information data;
- and
- routing the reverse message using the reverse path routing information data,
- wherein, when the size of the source routing data field exceeds a maximum length, an intermediate node removes a first address of the source routing data field and appends its node address to the end of the source routing data field.
A data network comprising:
- a plurality of source nodes and at least one sink node;
- at least one intermediate node between said plurality of source nodes and the at least one sink node,
- wherein routing of a reverse message from said sink node to a source node via at least one intermediate node of said network is performed by said intermediate node using reverse path routing information data comprising a combination of source routing information data and transparent bridging information data, and
- wherein said reverse path routing information data is constructed during propagation of a forward message from said source node to said sink node via said intermediate node wherein source routing information data is provided by appending a node address of the respective intermediate node to a source routing data field of the forward message unless a size of the source routing data field exceeds a maximum length and transparent bridging information is stored at a forwarding table in each intermediate node and wherein, when the size of the source routing data field exceeds a maximum length, an intermediate node removes a first address of the source routing data field and appends its node address to the end of the source routing data field.
Dependencies are inferred from the claim text.