Content router processing

• US 20070028000A1
• Filed: 10/31/2005
• Published: 02/01/2007
• Est. Priority Date: 07/14/2005
• Status: Abandoned Application

• Current Assignee: Oath Inc. (Verizon Communications Inc.)
• Original Assignee: Yahoo! Inc. (Apollo Global Management, Inc.)
• Inventors: Ebbesen, Bjorn, Smyka, Szymon
• Application Number:
  US11/264,121
• Publication Number:
  US 20070028000A1
• Time in Patent Office: Days
• US Class Current: 709/238
• CPC Class Codes: H04L 45/00 Routing or path finding of packets in data switching networks routing or path finding in wireless networks H04W40/00
• CPC Class Codes: H04L 45/306 Route determination based on the nature of the carried application
• CPC Class Codes: H04L 67/63 Routing a service request depending on the request content or context

Abstract

A method, apparatus, and system for routing changes to information between a plurality of content nodes and a command memory of a content router. Content nodes may be user devices (such as mobile phones) and user accounts (such as email accounts). Content nodes may hold one or more content types such as email, contacts, tasks, events and library items. A command memory centralizes conflict detection, resolution and error handling within a content routing system.

Claims

1. A content routing system for routing changes to information between a plurality of content nodes, the content routing system comprising:

store and forward logic comprising logic for;

selecting a set of destination content nodes based on a content type of an incoming command and one or more routing parameters;

modifying the incoming command with data modulation logic operable to generate at least one outgoing command, wherein each outgoing command corresponds to a selected content node; and

a connected data set configuration, coupled to the processing logic, for holding the one or more routing parameters.

2. The content routing system of claim 1, wherein the data modulation logic comprises at least one data module for modifying at least one data field of the incoming data field.

3. The content routing system of claim 1, wherein the incoming command comprises an XML-tree data structure schema.

4. The content routing system of claim 3, wherein the data modulation logic is operable to modify a particular node of the XML-tree data structure.

5. The content routing system of claim 1, wherein the data modulation logic is operable to divide a first incoming command associated with a first content entry into multiple outgoing commands associated with second multiple content entries.

6. The content routing system of claim 5, wherein the data modulation logic is operable to maintain integrity between the first content entry and the second multiple content entries.

7. The content routing system of claim 1, wherein the data modulation logic is operable to merge multiple first incoming commands associated with first content entries into a smaller number of second commands associated with second content entries.

8. The content routing system of claim 7, wherein the data modulation logic is operable to maintain integrity between the first content entries and the second content entries.

9. The content routing system of claim 1, further comprising data consolidation logic operable to identify potential duplicate content entries based on comparing a hash-value of the incoming command to a list of hash-values.

10. The content routing system of claim 9, wherein the list of hash-values is generated from content associated with at least one content node.

11. The content routing system of claim 9, wherein the hash-value is determined from less than all content of the incoming command.

12. The content routing system of claim 9, wherein the hash-value is determined from at least one predefined significant property of the incoming command.

13. A method of routing changes to information between a plurality of content nodes and a command memory, the method comprising, at a content router:

receiving an incoming command from a first content node;

storing the incoming command in a command memory;

selecting a set of destination content nodes based on a content type of the incoming command and a routing parameter associated with the destination content node and the content type;

modulating the incoming command based on capabilities of the destination content node, wherein the modulating comprises modifying at least one data field of the incoming command to generate of an outgoing command.

14. The method of claim 13, wherein the incoming command comprises an XML-tree data structure schema.

15. The method of claim 14, wherein the field comprises a particular node of the XML-tree data structure.

16. The method of claim 13, further comprising dividing a first incoming command associated with a first content entry into multiple outgoing commands associated with second multiple content entries.

17. The method of claim 16, wherein integrity is maintained between the first content entry and the second multiple content entries.

18. The method of claim 13, further comprising merging multiple first incoming commands associated with first content entries into a smaller number of second commands associated with second content entries.

19. The method of claim 18, wherein integrity is maintained between the first content entries and the second content entries.

20. The method of claim 13, further comprising identifying potential duplicate content entries based on comparing a hash-value of the incoming command to a list of hash-values.

21. The method of claim 20, wherein the list of hash-values is generated from content associated with at least one content node.

22. The method of claim 20, wherein the hash-value is determined from less than all content of the incoming command.

23. The method of claim 20, wherein the hash-value is determined from at least one predefined significant property of the incoming command.

24. A computer program product comprising program code for use in a content routing system comprising processing logic and a command memory, the content routing system for routing changes to information between a plurality of content nodes and the command memory, the computer program product comprising:

program code for receiving an incoming command from a first content node;

program code for selecting a set of destination content nodes based on a content type of the incoming command and a routing parameter associated with the destination content node and the content type;

program code for modifying the incoming command to generate at least one outgoing command, wherein each outgoing command corresponds to a selected content node.

25. The computer program product of claim 24, further comprising program code for at least one data module for modifying at least one data field of the incoming command.

26. The computer program product of claim 25, wherein the incoming command comprises an XML-tree data structure schema.

27. The computer program product of claim 26, wherein the data modulation logic is operable to modify a particular node of the XML-tree data structure.

28. The computer program product of claim 24, wherein program code for modifying is operable to divide a first incoming command associated with a first content entry into multiple outgoing commands associated with second multiple content entries.

29. The computer program product of claim 28, wherein integrity is maintained between the first content entry and the second multiple content entries.

30. The computer program product of claim 24, wherein the program code for modifying is operable to merge multiple first incoming commands associated with first content entries into a relatively smaller number of second commands associated with second content entries.

31. The computer program product of claim 30, wherein integrity is maintained between the first content entries and the second content entries.

32. The computer program product of claim 24, further comprising data consolidation logic operable to identify potential duplicate content entries based on comparing a hash-value of the incoming command to a list of hash-values.

33. The computer program product of claim 32, wherein the list of hash-values is generated from content associated with at least one content node.

34. The computer program product of claim 32, wherein the hash-value is determined from less than all of the incoming command.

35. The computer program product of claim 32, where the hash-value is determined from at least one predefined significant property of the incoming command.