SYSTEM AND METHOD FOR UNMARSHALLED ROUTING
First Claim
1. A method for communicating a message from a source node to a destination node via one or more intermediate nodes, the method comprising:
- determining a node list that specifies a routing sequence of nodes between the source node and the destination node;
generating a message envelope comprising a node list field that specifies the determined node list; and
transmitting the message from the source node.
4 Assignments
0 Petitions
Accused Products
Abstract
In distributed object computing, messages from a source node to a destination node are often required to be routed via one or more intermediate nodes. In order to enhance efficiency of the relay process, a message envelope of a message may include a node list field that specifies the routing path of the message. The communication protocol for communicating the message may specify that when a message is received into a particular node, the node analyzes the node list field. If the identity of the node is last in the node list field, then the node is the destination node and thus the node unmarshals the message. Otherwise, the node forwards the message to the next node in the field list without unmarshalling the message.
-
Citations
20 Claims
-
1. A method for communicating a message from a source node to a destination node via one or more intermediate nodes, the method comprising:
-
determining a node list that specifies a routing sequence of nodes between the source node and the destination node; generating a message envelope comprising a node list field that specifies the determined node list; and transmitting the message from the source node. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8)
-
-
9. A method for receiving a message sent from a source node toward a destination node at a node on a routing path between the source node and the destination node, the method comprising:
-
receiving the message at the node on the routing path; processing a node list field of a message envelope of the message to determine whether a node identity of the node is last in the node list; if the node identity is last in the node list, unmarshalling the message; and if the node identity is not the last in the node list, forwarding the message to the next node in the node list. - View Dependent Claims (10, 11, 12, 13)
-
-
14. A computer network comprising a plurality of nodes, each node configured to execute a communication protocol, wherein each node is configured to:
-
a. generate a message according to the communication protocol; b. transmit a message according to the communication protocol; and c. receive a message according to the communication protocol; d. wherein the communication protocol specifies that a received message is unmarshalled at a node only if the node is a destination node for the message. - View Dependent Claims (15, 16, 17, 18, 19, 20)
-
Specification