Multiplexed demand signaled distributed messaging

• US 10,367,852 B2
• Filed: 09/02/2016
• Issued: 07/30/2019
• Est. Priority Date: 09/04/2015
• Status: Active Grant

• Current Assignee: Swim.it Inc.
• Original Assignee: Swim.it Inc.
• Inventors: Sachs, Christopher David
• Primary Examiner(s): Henderson, Esther B.
• Application Number:
  US15/256,112
• Publication Number:
  US 20170070457A1
• Time in Patent Office: 1,061 Days
• Field of Search: None
• CPC Class Codes: G06F 16/22 Indexing; Data structures therefor; Storage structures
• CPC Class Codes: G06F 21/121 Restricting unauthorised execution of programs
• CPC Class Codes: G06F 21/31 User authentication
• CPC Class Codes: G06F 21/604 Tools and structures for managing or administering access control systems
• CPC Class Codes: G06F 21/6254 by anonymising data, e.g. decorrelating personal data from the owner's identification
• CPC Class Codes: G06F 2221/2141 Access rights, e.g. capability lists, access control lists, access tables, access matrices
• CPC Class Codes: G06F 2221/2149 Restricted operating environment
• CPC Class Codes: G06Q 30/0277 Online advertisement
• CPC Class Codes: H04L 43/0894 Packet rate
• CPC Class Codes: H04L 45/70 Routing based on monitoring results
• CPC Class Codes: H04L 47/125 by balancing the load, e.g. traffic engineering
• CPC Class Codes: H04L 51/04 Real-time or near real-time messaging, e.g. instant messaging [IM]
• CPC Class Codes: H04L 51/212 using filtering or selective blocking
• CPC Class Codes: H04L 51/214 using selective forwarding
• CPC Class Codes: H04L 51/234 for tracking messages
• CPC Class Codes: H04L 61/4541 Directories for service discovery
• CPC Class Codes: H04L 61/5069 for group communication, multicast communication or broadcast communication
• CPC Class Codes: H04L 63/0227 Filtering policies mail message filtering H04L51/212
• CPC Class Codes: H04L 63/0407 wherein the identity of one or more communicating identities is hidden cryptographic mechanisms or cryptographic arrangements for anonymous credentials or for identity based cryptographic systems H04L9/00
• CPC Class Codes: H04L 63/205 involving negotiation or determination of the one or more network security mechanisms to be used, e.g. by negotiation between the client and the server or between peers or by selection according to the capabilities of the entities involved negotiation of communication capabilities H04L69/24
• CPC Class Codes: H04L 67/101 : based on network conditions
• CPC Class Codes: H04L 67/104 : Peer-to-peer [P2P] networks
• CPC Class Codes: H04W 12/02 : Protecting privacy or anonymity, e.g. protecting personally identifiable information [PII]

Abstract

A multiplexed demand signaled distributed messaging (MDSDM) system and method enables high capacity real-time messaging between application services by generating and utilizing innovative techniques for message management such as lanes, links and message distribution-related functionality.

Claims

1. A method programmed in a non-transitory memory of a device comprising:

a. establishing one or more network connections for peer-to-peer real-time message distribution; and

b. routing one or more messages to an appropriate destination using the one or more network connections utilizing load balancing and routing functions, wherein when the one or more messages go to multiple subscribers on a single host, the one or more messages from a publisher are only sent once over the one or more network connections, and the one or more messages are broadcast locally without explicit involvement of a publisher and a subscriber to each subscriber of the multiple subscribers on the single host, wherein routing utilizes one or more links and one or more lanes, wherein at least one of the links is a synced link which enables the subscriber to receive the one or more messages from the publisher that existed prior to generation of the link.

2. The method of claim 1, wherein the peer-to-peer message distribution is implemented without a centralized hub/gateway/device between the publisher and the subscriber.

3. The method of claim 1, wherein an existing network connection of the one or more network connections is reused between the publisher and the subscriber transparently without involvement of application services.

4. The method of claim 1, wherein the appropriate destination is determined using universal addressing of messaging end-points.

5. The method of claim 4, wherein the universal addressing of messaging endpoints utilizes a format of a universal resource locator and a service reference.

6. The method of claim 1, further comprising self-monitoring of messaging software and regulation of the messaging software based on the self-monitoring.

7. The method of claim 6, wherein self-monitoring includes computing analysis including analyzing how long processing of a task takes and networking analysis including transfer rates.

8. The method of claim 1, further comprising managing back pressure by detecting subscriber message consumption, analyzing network bandwidth and analyzing network issues, and throttling message publishing based on the detecting and analyzing.

9. The method of claim 8, wherein throttling message publishing includes not publishing messages if a blockage of messages is detected.

10. The method of claim 9, wherein when a blockage of messages is detected, only a most recent message of the one or more messages is published.

11. The method of claim 1, further comprising utilizing one or more custom filters for message transformation, filtering, security, and/or privacy.

12. The method of claim 1, further comprising subscribing to a hierarchy of services to receive messages from a plurality of services without a subscriber explicitly identifying each messaging end-point in the hierarchy.

13. The method of claim 1, further comprising publishing a message of the one or more messages, recording the message and searching links to identify the subscribers, and delivering the message based on the identified subscribers.

14. The method of claim 1, wherein a message of the one or more messages is not forwarded when there are no active links.

15. The method of claim 1, further comprising unlinking a link of the one or more links when a service does not want a message of the one or more messages.

16. The method of claim 1, further comprising receiving a preexisting message from a lane of one or more lanes by establishing a link in the lane after the preexisting message has been generated.

17. The method of claim 1, wherein routing the one or more messages occurs in real-time.

18. An apparatus comprising:

a. a non-transitory memory for storing a service, the service configured for;

i. establishing one or more network connections for peer-to-peer real-time message distribution; and

ii. routing one or more messages to an appropriate destination using the one or more network connections utilizing load balancing and routing functions, wherein when the one or more messages go to multiple subscribers on a single host, the one or more messages from a publisher are only sent once over the one or more network connections, and the one or more messages are broadcast locally without explicit involvement of a publisher and a subscriber to each subscriber of the multiple subscribers on the single host, wherein routing utilizes one or more links and one or more lanes, wherein at least one of the links is a synced link which enables the subscriber to receive the one or more messages from the publisher that existed prior to generation of the link; and

b. a processor for processing the service.

19. The apparatus of claim 18, wherein the peer-to-peer message distribution is implemented without a centralized hub/gateway/device between the publisher and the subscriber.

20. The apparatus of claim 18, wherein an existing network connection of the one or more network connections is reused between the publisher and the subscriber transparently without involvement of application services.

21. The apparatus of claim 18, wherein the appropriate destination is determined using universal addressing of messaging end-points.

22. The apparatus of claim 21, wherein the universal addressing of messaging endpoints utilizes a format of a universal resource locator and a service reference.

23. The apparatus of claim 18, wherein the apparatus implements self-monitoring of messaging software and regulation based on the self-monitoring.

24. The apparatus of claim 23, wherein self-monitoring includes computing analysis including analyzing how long processing of a task takes and networking analysis including transfer rates.

25. The apparatus of claim 18, wherein the apparatus manages back pressure by detecting subscriber message consumption, analyzing network bandwidth and analyzing network issues, and throttling message publishing based on the detecting and analyzing.

26. The apparatus of claim 25, wherein throttling message publishing includes not publishing messages if a blockage of messages is detected.

27. The apparatus of claim 26, wherein when a blockage of messages is detected, only a most recent message of the one or more messages is published.

28. The apparatus of claim 18, wherein the apparatus utilizes one or more custom filters for message transformation, filtering, security, and/or privacy.

29. The apparatus of claim 18, wherein the apparatus implements subscribing to a hierarchy of services to receive messages from a plurality of services without a subscriber explicitly identifying each messaging end-point in the hierarchy.

30. The apparatus of claim 18, wherein the apparatus publishes a message of the one or more messages, records the message and searches links to identify the subscribers, and delivers the message based on the identified subscribers.

31. The apparatus of claim 18, wherein a message of the one or more messages is not forwarded when there are no active links.

32. The apparatus of claim 18, wherein the apparatus unlinks a link of the one or more links when a service does not want a message of the one or more messages.

33. The apparatus of claim 18, wherein the apparatus receives a preexisting message from a lane of one or more lanes by establishing a link in the lane after the preexisting message has been generated.

34. The apparatus of claim 18, wherein routing the one or more messages occurs in real-time.

35. A system comprising:

a. a first device configured for;

i. establishing one or more network connections for peer-to-peer real-time message distribution; and

ii. routing one or more messages to an appropriate destination using the one or more network connections utilizing load balancing and routing functions, wherein when the one or more messages go to multiple subscribers on a single host, the one or more messages from a publisher are only sent once over the one or more network connections, and the one or more messages are broadcast locally without explicit involvement of a publisher and a subscriber to each subscriber of the multiple subscribers on the single host, wherein routing utilizes one or more links and one or more lanes, wherein at least one of the links is a synced link which enables the subscriber to receive the one or more messages from the publisher that existed prior to generation of the link, further wherein a lane manager for a back pressure-managed lane detects an availability signal before attempting to write the one or more messages; and

b. a second device configured for receiving the one or more messages.

36. The system of claim 35, wherein the peer-to-peer message distribution is implemented without a centralized hub/gateway/device between the publisher and the subscriber, wherein the first device comprises the publisher, and the second device comprises the subscriber.

37. The system of claim 35, wherein an existing network connection of the one or more network connections is reused between the publisher and the subscriber transparently without involvement of application services.

38. The system of claim 35, wherein the appropriate destination is determined using universal addressing of messaging end-points.

39. The system of claim 38, wherein the universal addressing of messaging endpoints utilizes a format of a universal resource locator and a service reference.

40. The system of claim 35, wherein the first device implements self-monitoring of messaging software and regulation of the messaging software based on the self-monitoring.

41. The system of claim 40, wherein self-monitoring includes computing analysis including analyzing how long processing of a task takes and networking analysis including transfer rates.

42. The system of claim 35, wherein the first device manages back pressure by detecting subscriber message consumption, analyzing network bandwidth and analyzing network issues, and throttling message publishing based on the detecting and analyzing.

43. The system of claim 42, wherein throttling message publishing includes not publishing messages if a blockage of messages is detected.

44. The system of claim 43, wherein when a blockage of messages is detected, only a most recent message of the one or more messages is published.

45. The system of claim 35, wherein the first device utilizes one or more custom filters for message transformation, filtering, security, and/or privacy.

46. The system of claim 35, wherein the second device subscribes to a hierarchy of services to receive messages from a plurality of services without a subscriber explicitly identifying each messaging end-point in the hierarchy.

47. The system of claim 35, wherein the first device publishes a message of the one or more messages, recording the message and searching links to identify the subscribers, and delivering the message based on the identified subscribers.

48. The system of claim 35, wherein a message of the one or more messages is not forwarded when there are no active links.

49. The system of claim 35, wherein the first device unlinks a link of the one or more links when a service does not want a message of the one or more messages.

50. The system of claim 35, wherein the second device receives a preexisting message from a lane of one or more lanes by establishing a link in the lane after the preexisting message has been generated.

51. The system of claim 35, wherein routing the one or more messages occurs in real-time.