Self configuring peer to peer inter process messaging system
First Claim
1. A method for peer-to-peer messaging between network resources comprising:
- communicating with a first process by writing a first text file in a first scratch space, where the first text file describes at least one of at least a first set of information that a second process has generated and at least a first action to be performed on the first set of information;
detecting, by a first arbiter, the first text file, wherein the first arbiter is implemented by the first process; and
performing at least one of;
implementing, by the first arbiter, the first action; and
applying, by the first arbiter, logic embedded within the first arbiter to determine actions to be performed on the first text file.
0 Assignments
0 Petitions
Accused Products
Abstract
A method for peer-to-peer messaging between network resources is described. The method includes communicating with a first process by writing a first text file in a first scratch space, where the first text file describes at least one of at least a first set of information that a second process has generated and at least a first action to be performed on the first set of information, detecting, by a first arbiter, the first text file, where the first arbiter is implemented by the first process, and performing at least one of implementing, by the first arbiter, the first action, and applying, by the first arbiter, logic embedded within the first arbiter to determine actions to be performed on the first text file.
-
Citations
35 Claims
-
1. A method for peer-to-peer messaging between network resources comprising:
-
communicating with a first process by writing a first text file in a first scratch space, where the first text file describes at least one of at least a first set of information that a second process has generated and at least a first action to be performed on the first set of information;
detecting, by a first arbiter, the first text file, wherein the first arbiter is implemented by the first process; and
performing at least one of;
implementing, by the first arbiter, the first action; and
applying, by the first arbiter, logic embedded within the first arbiter to determine actions to be performed on the first text file. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17)
-
-
18. A method for peer-to-peer messaging between network resources comprising:
-
reading a text file received within a scratch space to find a digital signature within the text file;
comparing the digital signature to the contents of the text file to determine whether the digital signature is valid;
moving the text file to a queue designated for improper files on determining that the digital signature is invalid; and
processing the text file on determining that the digital signature is valid. - View Dependent Claims (19, 20)
-
-
21. A method for peer-to-peer messaging between network resources comprising:
-
reading a text file to find at least one portion of the text file and to find a digital signature within the portion, wherein the portion is designated for processing;
comparing the digital signature to the contents of the portion of the text file to determine whether the digital signature is valid;
moving the portion of the text file to a queue designated for improper portions of files on determining that the digital signature is invalid; and
processing the portion of the text file on determining that the digital signature is valid. - View Dependent Claims (22, 23)
-
-
24. A method for peer-to-peer messaging between network resources comprising:
-
obtaining, by a first arbiter, a first output of a first process;
parsing information within the first output into a first set of text files;
writing the first set of text files into a first text file in at least one of a first scratch space and a second scratch space;
detecting, by a second arbiter of a second process, the first text file;
reading, by the second arbiter, the first text file; and
performing an independent operation on the first text file based on rules in the second arbiter to obtain a second output. - View Dependent Claims (25, 26, 27, 28, 29, 30, 31)
-
-
32. A network system comprising:
-
an originating arbiter configured to communicate with a first process by writing a first text file in a first scratch space, wherein the first text file describes at least one of at least a first set of information that a second process has generated and at least a first action to be performed on the first set of information; and
a first arbiter implemented by the first process, the first arbiter configured to;
detect the first text file; and
perform at least one of;
implementation of the first action; and
application of logic embedded within the first arbiter to determine actions to be performed on the first text file.
-
-
33. A network system comprising:
an arbiter configured to;
read a text file received within a scratch space to find the digital signature within the text file;
compare the digital signature to the contents of the text file to determine whether the digital signature is valid;
move the text file to a queue designated for improper files on determining that the digital signature is invalid; and
process the text file on determining that the digital signature is valid.
-
34. A network system comprising:
an arbiter configured to;
read a text file to find at least one portion of the text file and to find a digital signature within the portion, wherein the portion is designated for processing;
compare the digital signature to the contents of the portion of the text file to determine whether the digital signature is valid;
move the portion of the text file to a queue designated for improper portions of files on determining that the digital signature is invalid; and
process the portion of the text file on determining that the digital signature is valid.
-
35. A network system comprising:
-
a first arbiter configured to;
obtain a first output of a first process;
parse information within the first output into a first set of text files; and
write the first set of text files into a first text file in at least one of a first scratch space and a second scratch space; and
a second arbiter configured to;
detect the first text file;
read the first text file; and
perform an independent operation on the first text file based on rules in the second arbiter to obtain a second output.
-
Specification