IP Library Granted Patent US 12,373,511
Granted Patent B2
US 12,373,511 · App. 18/678,126 · Granted Jul 29, 2025

Tailored messaging

Inventor: Bevan Jacob Brookfield (Evanston, IL)
Assignee: Trading Technologies International, Inc.
G06F16/957G06F16/23G06Q40/04
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,373,511
App. No.
18/678,126
Granted
Jul 29, 2025
Kind
B2
Abstract

The disclosed embodiments generally relate to techniques for tailoring messages for network communication. More specifically, the disclosed embodiments relate to systems and methods to provide customized information updates based on recipient preferences. For example, a recipient may prefer receiving updates less frequently than the system creates updates and/or may prefer to receive different levels of data in the updates. In some embodiments, a deltasnap technique is provided which allows for more efficient tailoring of the rate that update messages are provided. In some embodiments, a partitioning technique is provided which allows for more efficient tailoring of the content of update messages. In some embodiments, the deltasnap technique is provided in combination with the partitioning technique which allows for more efficient tailoring of the rate and content of the update messages.

Claims (23)

1. A data distribution method comprising:

configuring, by a data formatter, a buffer in a memory to store data in a plurality of partitionable data levels, the plurality of partitionable data levels being organized in descending levels of interest;

sending, by a data sender, to at least one of a plurality of subscriber devices, from the buffer, a first message comprising a first requested data level and all data levels having a level of interest that is greater than or equal to the level of interest of the first requested data level; and

sending, by the data sender, to at least a further one of the plurality of subscriber devices, from the buffer, a second message comprising a second requested data level and all data levels having a level of interest that is greater than or equal to the level of interest of the second requested data level, wherein the second message is sent without remarshaling of the data in the buffer by the data formatter.

2. The data distribution method of claim 1 , further comprising: storing a header, the header including bookkeeping information associated with the plurality of partitionable data levels.

3. The data distribution method of claim 2 , wherein the bookkeeping information comprises a number of the partitionable data levels.

4. The data distribution method of claim 1 , wherein, to send the first message, the data sender places a socket write call referencing the buffer and a length to include the first requested data level and all of the levels having a level of interest that is greater than or equal to the level of interest of the first requested data level.

5. The data distribution method of claim 1 , further including generating a first partition table, the first partition table to indicate a first partitionable location of the plurality of partitionable data levels and a second partitionable location of the plurality of partitionable data levels.

6. A non-transitory computer readable medium comprising instructions which, when executed, cause a machine to at least:

configure a buffer in a memory to store data in a plurality of partitionable data levels, the plurality of partitionable data levels being organized in descending levels of interest;

send, to at least one of a plurality of subscriber devices, from the buffer, a first message comprising a first requested data level and all data levels having a level of interest that is greater than or equal to the level of interest of the first requested data level; and

send, to at least a further one of the plurality of subscriber devices, from the buffer, a second message comprising a second requested data level and all data levels having a level of interest that is greater than or equal to the level of interest of the second requested data level, wherein the second message is sent without remarshaling of the data in the buffer by the data formatter.

7. The non-transitory computer readable medium of any one of claim 6 , wherein the instructions further cause the machine to store a header, the header including bookkeeping information associated with the plurality of partitionable data levels.

8. The non-transitory computer readable medium of claim 7 , wherein the bookkeeping information comprises a number of the partitionable data levels.

9. The non-transitory computer readable medium of any one of claim 6 , wherein, to send the first message, the instructions cause the machine to place a socket write call referencing the buffer and a length to include the first requested data level and all of the levels having a level of interest that is greater than or equal to the level of interest of the first requested data level.

10. The non-transitory computer readable medium of any one of claim 6 , wherein the instructions further cause the machine to generate a first partition table, the first partition table to indicate a first partitionable location of the plurality of partitionable data levels and a second partitionable location of the plurality of partitionable data levels.

11. A data distribution system for distributing data to a plurality of subscriber devices, the data distribution system comprising:

a memory;

a data formatter to configure a buffer in the memory to store data in a plurality of partitionable data levels, the plurality of partitionable data levels being organized in descending levels of interest; and

a data sender to send to at least one of the subscriber devices, from the buffer, a first message comprising a first requested data level and all data levels having a level of interest that is greater than or equal to the level of interest of the first requested data level and to send to at least a further one of the plurality of subscriber devices, from the buffer, a second message comprising a second requested data level and all data levels having a level of interest that is greater than or equal to the level of interest of the second requested data level, wherein the second message is sent without remarshaling of the data in the buffer.

12. The data distribution system of claim 11 , wherein the data formatter further configures the buffer to store a header, the header including bookkeeping information associated with the plurality of partitionable data levels.

13. The data distribution system of claim 12 , wherein the bookkeeping information comprises a number of the partitionable data levels.

14. The data distribution system of claim 11 , wherein, to send the first message, the data sender places a socket write call referencing the buffer and a length to include the first requested data level and all of the levels having a level of interest that is greater than or equal to the level of interest of the first requested data level.

Assignments (2)
SECURITY INTEREST Recorded Nov 7, 2025
From: TRADING TECHNOLOGIES INTERNATIONAL, INC.
To: HPS INVESTMENT PARTNERS, LLC, AS COLLATERAL AGENT
Reel/Frame 073510/0758 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 30, 2024
From: BROOKFIELD, BEVAN JACOB
To: TRADING TECHNOLOGIES INTERNATIONAL, INC.
Reel/Frame 067566/0323 →
Continuity (8)
Continuation 18314902 · May 10, 2023
Continuation 17717488 · Apr 11, 2022
Continuation 17226906 · Apr 9, 2021
Continuation 16849453 · Apr 15, 2020
Continuation 14329602 · Jul 11, 2014
Provisional Application 62022736 · Jul 10, 2014
Provisional Application 61845613 · Jul 12, 2013
Related Publication 20240320287A1 · Sep 26, 2024
References Cited (259)
US 3253263A · Lee et al. · 1966 [cited by applicant]
US 3962685A · Belle Isle · 1976 [cited by applicant]
US 4412287A · Braddock, III · 1983 [cited by applicant]
US 4677552A · Sibley · 1987 [cited by applicant]
US 4692600A · Takahashi · 1987 [cited by applicant]
US 4740958A · Duxbury et al. · 1988 [cited by applicant]
US 4868866A · Williams, Jr. · 1989 [cited by applicant]
US 4903201A · Wagner · 1990 [cited by applicant]
US 4980826A · Wagner · 1990 [cited by applicant]
US 4995056A · Fogg, Jr. et al. · 1991 [cited by applicant]
US 5077665A · Silverman et al. · 1991 [cited by applicant]
US 5136501A · Silverman et al. · 1992 [cited by applicant]
US 5297031A · Gutterman et al. · 1994 [cited by applicant]
US 5297032A · Trojan et al. · 1994 [cited by applicant]
US 5339392A · Risberg et al. · 1994 [cited by applicant]
US 5515359A · Zheng · 1996 [cited by applicant]
US 5522037A · Kitagawa et al. · 1996 [cited by applicant]
US 5604866A · Kolb et al. · 1997 [cited by applicant]
US 5680116A · Hashimoto et al. · 1997 [cited by applicant]
US 5727165A · Ordish et al. · 1998 [cited by applicant]
US 5790642A · Taylor et al. · 1998 [cited by applicant]
US 5802310A · Rajaraman · 1998 [cited by applicant]
US 5826244A · Huberman · 1998 [cited by applicant]
US 5905868A · Baghai et al. · 1999 [cited by applicant]
US 5911137A · Lin et al. · 1999 [cited by applicant]
US 5916307A · Piskiel et al. · 1999 [cited by applicant]
US 5924083A · Silverman et al. · 1999 [cited by applicant]
US 5953708A · Midorikawa et al. · 1999 [cited by applicant]
US 5995980A · Olson et al. · 1999 [cited by applicant]
US 6006206A · Smith et al. · 1999 [cited by applicant]
US 6039245A · Symonds et al. · 2000 [cited by applicant]
US 6058389A · Chandra et al. · 2000 [cited by applicant]
US 6073180A · Onoda et al. · 2000 [cited by applicant]
US 6097399A · Bhatt et al. · 2000 [cited by applicant]
US 6144669A · Williams et al. · 2000 [cited by applicant]
US 6167445A · Gai et al. · 2000 [cited by applicant]
US 6192029B1 · Averbuch et al. · 2001 [cited by applicant]
US 6260025B1 · Silverman et al. · 2001 [cited by applicant]
US 6269399B1 · Dyson et al. · 2001 [cited by applicant]
US 6278982B1 · Korhammer et al. · 2001 [cited by applicant]
US 6311144B1 · Abu El Ata · 2001 [cited by applicant]
US 6338047B1 · Wallman · 2002 [cited by applicant]
US 6343278B1 · Jain et al. · 2002 [cited by applicant]
US 6370569B1 · Austin · 2002 [cited by applicant]
US 6389016B1 · Sabaa et al. · 2002 [cited by applicant]
US 6408000B1 · Lamberg et al. · 2002 [cited by applicant]
US 6421653B1 · May et al. · 2002 [cited by applicant]
US 6516339B1 · Potts, Jr. et al. · 2003 [cited by applicant]
US 6553035B1 · Schwartz et al. · 2003 [cited by applicant]
US 6574234B1 · Myer et al. · 2003 [cited by applicant]
US 6606607B1 · Martin et al. · 2003 [cited by applicant]
US 6675153B1 · Cook et al. · 2004 [cited by applicant]
US 6772132B1 · Kemp, II et al. · 2004 [cited by applicant]
US 6973623B2 · Little et al. · 2005 [cited by applicant]
US 6993507B2 · Meyer et al. · 2006 [cited by applicant]
US 7069551B2 · Fong et al. · 2006 [cited by applicant]
US 7124110B1 · Kemp, II et al. · 2006 [cited by applicant]
US 7127424B2 · Kemp, II et al. · 2006 [cited by applicant]
US 7130824B1 · Amanat et al. · 2006 [cited by applicant]
US 7133460B2 · Bae et al. · 2006 [cited by applicant]
US 7167923B2 · Lo · 2007 [cited by applicant]
US 7212997B1 · Pine et al. · 2007 [cited by applicant]
US 7222096B2 · Anaya et al. · 2007 [cited by applicant]
US 7305483B2 · Yao et al. · 2007 [cited by applicant]
US 7310615B2 · Lewis · 2007 [cited by applicant]
US 7318045B2 · Baecker et al. · 2008 [cited by applicant]
US 7366691B1 · Kemp, II et al. · 2008 [cited by applicant]
US 7389268B1 · Kemp, II et al. · 2008 [cited by applicant]
US 7392219B2 · Singer et al. · 2008 [cited by applicant]
US 7398244B1 · Keith · 2008 [cited by applicant]
US 7412462B2 · Margolus et al. · 2008 [cited by applicant]
US 7426491B1 · Singer et al. · 2008 [cited by applicant]
US 7454382B1 · Triplett · 2008 [cited by applicant]
US 7552077B1 · Schluetter et al. · 2009 [cited by applicant]
US 7562044B1 · Tenorio · 2009 [cited by applicant]
US 7567927B2 · Boglaev · 2009 [cited by applicant]
US 7567930B1 · Schluetter et al. · 2009 [cited by applicant]
US 7599867B1 · Monroe et al. · 2009 [cited by applicant]
US 7680721B2 · Cutler · 2010 [cited by applicant]
US 7685049B1 · Singer · 2010 [cited by applicant]
US 7685055B2 · Brumfield et al. · 2010 [cited by applicant]
US 7742962B1 · Singer · 2010 [cited by applicant]
US 7752123B2 · Brookfield et al. · 2010 [cited by applicant]
US 7783546B2 · Saulys et al. · 2010 [cited by applicant]
US 7783558B1 · Schwarz et al. · 2010 [cited by applicant]
US 7783559B1 · Schwarz et al. · 2010 [cited by applicant]
US 7797207B1 · Dilip et al. · 2010 [cited by applicant]
US 7809841B1 · Crouch · 2010 [cited by applicant]
US 7827091B2 · Cutler et al. · 2010 [cited by applicant]
US 7835972B2 · Almeida et al. · 2010 [cited by applicant]
US 7882018B2 · Schwarz et al. · 2011 [cited by applicant]
US 7890415B1 · Keith · 2011 [cited by applicant]
US 7908204B2 · Boglaev · 2011 [cited by applicant]
US 7945846B2 · Beauchamp et al. · 2011 [cited by applicant]
US 7970697B2 · Schwarz et al. · 2011 [cited by applicant]
US 7991847B2 · Cadoret et al. · 2011 [cited by applicant]
US 8010679B2 · Low et al. · 2011 [cited by applicant]
US 8069402B2 · Myers et al. · 2011 [cited by applicant]
US 8082304B2 · Ho et al. · 2011 [cited by applicant]
US 8090637B2 · Schluetter et al. · 2012 [cited by applicant]
US 8090645B1 · Silverman et al. · 2012 [cited by applicant]
US 8090839B2 · Kumar et al. · 2012 [cited by applicant]
US 8229823B2 · Schluetter et al. · 2012 [cited by applicant]
US 8230056B2 · Bishop et al. · 2012 [cited by applicant]
US 8249975B1 · Keith · 2012 [cited by applicant]
US 8301546B2 · Schwarz et al. · 2012 [cited by applicant]
US 8332354B1 · Chatterjee et al. · 2012 [cited by applicant]
US 8352344B2 · Schluetter et al. · 2013 [cited by applicant]
US 8417618B2 · Milne et al. · 2013 [cited by applicant]
US 8423373B2 · Singer · 2013 [cited by applicant]
US 8468082B2 · Doornebos et al. · 2013 [cited by applicant]
US 8468199B2 · Tomkow · 2013 [cited by applicant]
US 8489496B2 · Angle et al. · 2013 [cited by applicant]
US 8571979B1 · Schluetter et al. · 2013 [cited by applicant]
US 8583541B2 · Schwarz et al. · 2013 [cited by applicant]
US 8589948B2 · Kemp, II et al. · 2013 [cited by applicant]
US 10565646B2 · Brookfield · 2020 [cited by applicant]
US 10664548B2 · Brookfield · 2020 [cited by applicant]
US 11048772B2 · Brookfield · 2021 [cited by applicant]
US 11334641B2 · Brookfield · 2022 [cited by applicant]
US 20010041579A1 · Smith et al. · 2001 [cited by applicant]
US 20010042040A1 · Keith · 2001 [cited by applicant]
US 20010042041A1 · Moshal et al. · 2001 [cited by applicant]
US 20010044767A1 · Madoff et al. · 2001 [cited by applicant]
US 20010049649A1 · Baecker et al. · 2001 [cited by applicant]
US 20020013753A1 · Marks De Chabris et al. · 2002 [cited by applicant]
US 20020019795A1 · Madoff et al. · 2002 [cited by applicant]
US 20020026528A1 · Lo · 2002 [cited by applicant]
US 20020082967A1 · Kaminsky et al. · 2002 [cited by applicant]
US 20020095369A1 · Kaplan et al. · 2002 [cited by applicant]
US 20020097697A1 · Bae et al. · 2002 [cited by applicant]
US 20020111922A1 · Young · 2002 [cited by applicant]
US 20020120546A1 · Zajac · 2002 [cited by applicant]
US 20020138399A1 · Hayes et al. · 2002 [cited by applicant]
US 20020143981A1 · Delima et al. · 2002 [cited by applicant]
US 20020152446A1 · Fleming · 2002 [cited by applicant]
US 20020184237A1 · McFeely · 2002 [cited by applicant]
US 20030004859A1 · Shaw et al. · 2003 [cited by applicant]
US 20030069834A1 · Cutler · 2003 [cited by applicant]
US 20030083977A1 · Syed et al. · 2003 [cited by applicant]
US 20030172091A1 · Norcot · 2003 [cited by applicant]
US 20030204585A1 · Yao et al. · 2003 [cited by applicant]
US 20030225674A1 · Hughes, Jr. et al. · 2003 [cited by applicant]
US 20040019554A1 · Merold et al. · 2004 [cited by applicant]
US 20040153390A1 · Saulys et al. · 2004 [cited by applicant]
US 20040162772A1 · Lewis · 2004 [cited by applicant]
US 20040225592A1 · Churquina · 2004 [cited by applicant]
US 20050091148A1 · Rotondo · 2005 [cited by applicant]
US 20050228743A1 · Warsaw et al. · 2005 [cited by applicant]
US 20050243722A1 · Liu et al. · 2005 [cited by applicant]
US 20050283415A1 · Studnitzer et al. · 2005 [cited by applicant]
US 20060069635A1 · Ram et al. · 2006 [cited by applicant]
US 20060080227A1 · Boglaev · 2006 [cited by applicant]
US 20060259414A1 · Singer et al. · 2006 [cited by applicant]
US 20060265305A1 · Schluetter et al. · 2006 [cited by applicant]
US 20060265314A1 · Singer et al. · 2006 [cited by applicant]
US 20070079117A1 · Bhogal · 2007 [cited by examiner]
US 20070192230A1 · Meacham et al. · 2007 [cited by applicant]
US 20070226730A1 · Coyle et al. · 2007 [cited by applicant]
US 20080046568A1 · Broda et al. · 2008 [cited by applicant]
US 20080082142A1 · Clark et al. · 2008 [cited by applicant]
US 20080155009A1 · Jensen et al. · 2008 [cited by applicant]
US 20080162324A1 · West · 2008 [cited by applicant]
US 20080243675A1 · Parsons · 2008 [cited by examiner]
US 20080248876A1 · Adiraju et al. · 2008 [cited by applicant]
US 20080281669A1 · Pratt et al. · 2008 [cited by applicant]
US 20080301135A1 · Alves et al. · 2008 [cited by applicant]
US 20090135723A1 · Davidson et al. · 2009 [cited by applicant]
US 20090164386A1 · Greenfield et al. · 2009 [cited by applicant]
US 20090240633A1 · Schluetter et al. · 2009 [cited by applicant]
US 20090322518A1 · Liang et al. · 2009 [cited by applicant]
US 20100082542A1 · Feng et al. · 2010 [cited by applicant]
US 20100100475A1 · Callaway et al. · 2010 [cited by applicant]
US 20100100830A1 · Singer · 2010 [cited by applicant]
US 20100121757A1 · McNicholas · 2010 [cited by applicant]
US 20100174665A1 · Lanng · 2010 [cited by examiner]
US 20100211529A1 · Neri · 2010 [cited by applicant]
US 20100274705A1 · Schwarz et al. · 2010 [cited by applicant]
US 20100318673A1 · Kemp, II et al. · 2010 [cited by applicant]
US 20110016123A1 · Pandey et al. · 2011 [cited by applicant]
US 20110040668A1 · Lee et al. · 2011 [cited by applicant]
US 20110060677A1 · Almeida et al. · 2011 [cited by applicant]
US 20110093381A1 · Schwarz et al. · 2011 [cited by applicant]
US 20110178912A1 · Parsons · 2011 [cited by examiner]
US 20110178918A1 · Parsons · 2011 [cited by examiner]
US 20110184844A1 · Parsons · 2011 [cited by examiner]
US 20110196778A1 · Vinokour et al. · 2011 [cited by applicant]
US 20110218904A1 · Schwarz et al. · 2011 [cited by applicant]
US 20110225448A1 · Morosan et al. · 2011 [cited by applicant]
US 20110251942A1 · Rosenthal et al. · 2011 [cited by applicant]
US 20110252208A1 · Ali et al. · 2011 [cited by applicant]
US 20120011046A1 · Nalbandian et al. · 2012 [cited by applicant]
US 20120072325A1 · Schluetter et al. · 2012 [cited by applicant]
US 20120095898A1 · Kaminsky et al. · 2012 [cited by applicant]
US 20120203687A1 · Schwarz et al. · 2012 [cited by applicant]
US 20120221462A1 · De Verdier · 2012 [cited by applicant]
US 20120254221A1 · Lai et al. · 2012 [cited by applicant]
US 20120259767A1 · Schluetter et al. · 2012 [cited by applicant]
US 20120290685A1 · Garza et al. · 2012 [cited by applicant]
US 20120311089A1 · Reed et al. · 2012 [cited by applicant]
US 20120317011A1 · Duquette · 2012 [cited by applicant]
US 20130030977A1 · Andrews · 2013 [cited by applicant]
US 20130054530A1 · Baker et al. · 2013 [cited by applicant]
US 20130060887A1 · Bradnick et al. · 2013 [cited by applicant]
US 20130085923A1 · Schluetter · 2013 [cited by applicant]
US 20130110693A1 · Genetski et al. · 2013 [cited by applicant]
US 20130211997A1 · Singer · 2013 [cited by applicant]
US 20130318107A1 · Asaad · 2013 [cited by examiner]
US 20140164202A1 · Singer · 2014 [cited by applicant]
US 20140351113A1 · Jensen et al. · 2014 [cited by applicant]
US 20140359036A1 · Blakers et al. · 2014 [cited by applicant]
US 20150019618A1 · Brookfield · 2015 [cited by applicant]
US 20150127515A1 · Studnitzer et al. · 2015 [cited by applicant]
US 20160224995A1 · Brookfield · 2016 [cited by applicant]
US 20200242176A1 · Brookfield · 2020 [cited by applicant]
US 20210224340A1 · Brookfield · 2021 [cited by applicant]
CN 101617334A · 2009 [cited by applicant]
CN 101675448A · 2010 [cited by applicant]
JP H0784728A · 1995 [cited by applicant]
JP 2002278862A · 2002 [cited by applicant]
JP 2008503839A · 2008 [cited by applicant]
JP 2010514033A · 2010 [cited by applicant]
JP 2012230680A · 2012 [cited by applicant]
WO 1999027476A2 · 1999 [cited by applicant]
WO 2001077957A1 · 2001 [cited by applicant]
WO 2002017193A1 · 2002 [cited by applicant]
WO 2002050747A1 · 2002 [cited by applicant]
WO 2006000991A1 · 2006 [cited by applicant]
WO 2008042111A2 · 2008 [cited by applicant]
WO 2008074623A1 · 2008 [cited by applicant]
WO 2008140950A2 · 2008 [cited by applicant]
“Bristol Releases Enterprise Transaction Monitor,” Midrange Stuff, http://www.midrangeserver.com/mso021902-story04.html, printed Feb. 19, 2002. [cited by applicant]
“Financial Messaging Middleware,” Solid Data, wysiwyg://310/http://www.soliddata.com/companylbroker_case.html, printed Jul. 11, 2002. [cited by applicant]
Amir, Y., “Distributed Systems 600.437 Multicast Protocols,” The Johns Hopkins University, Baltimore, Maryland, USA, 2010, 16 pages. [cited by applicant]
Bradshaw, et al., “Oracle 9i Application Developer's Guide—Advanced Queuing, Release 2 (9.2),” Oracle Corporation, [Online] Retrieved from the Internet on Nov. 2, 2005: http://www.oracle.com, pp. I-XXII, 1.1-1.28, 7.1-7… [cited by applicant]
Chockler, G.V., “An Implementation of Reliable Multicast Services in the Transis Group Communication System,” Lab Project, The Hebrew University of Jerusalem, Jerusalem, Israel, Oct. 5, 1997, 31 pages. [cited by applicant]
Dolev, D., “The Transis Approach to High Availability Cluster Communication,” Communications of the ACM, Apr. 1996, vol. 39, 13 pages. [cited by applicant]
Extended European Search Report in European Patent Application No. 14823358.8 dated Jan. 19, 2017, mailed Jan. 26, 2017. [cited by applicant]
Extended European Search Report in European Patent Application No. 19156431.9 dated Sep. 17, 2019, mailed Sep. 25, 2019. [cited by applicant]
Gemmell, J., et al., “In Search of an API for Scalable Reliable Multicast,” Technical Report MSR-TR-97-17, Microsoft Corporation, Jun. 23, 1997, pp. 1-14. [cited by applicant]
Guerraoui, R., et al., “Total Order Multicast to Multiple Groups,” Proceedings of the 17th IEEE International Conference on Distributed Computing Systems, Baltimore, Maryland, USA, May 27-30, 1997, IEEE Computer Society… [cited by applicant]
Kitsuregawa, M. “Understanding Storage Networking,” 1st Edition, Storage Networking, Japan, Ohmsha Co., May 20, 2011, p. 67-69. [cited by applicant]
International Search Report for International Application PCT/US03/21776 dated Sep. 5, 2003. [cited by applicant]
International Search Report and Written Opinion of International Application No. PCT/US2012/053169, dated Jan. 15, 2013 (mailed Jan. 22, 2013). [cited by applicant]
International Search Report and Written Opinion of International Application No. PCT/US2014/046486, dated Jan. 7, 2015 (mailed Jan. 21, 2015). [cited by applicant]
IWay Intelligent Adapter for SWIFT product literature, iWay Software. Printed Feb. 24, 2003. [cited by applicant]
Koifman, A., et al., “RAMP: A Reliable Adaptive Multicast Protocol,” ASC, Inc., 1996, 27 pages. [cited by applicant]
Koifman, A., et al., “RAMP: A Reliable Adaptive Multicast Protocol,” Proceedings of the INFOCOM 1996, 151h Annual Joint Conference of the IEEE Computer Societies, San Francisco, California, USA, Mar. 24-28, 1996, IEEE C… [cited by applicant]
Microsoft Computer Dictionary, Microsoft Press, 5th Ed., 2002, p. 518. [cited by applicant]
Paul, et al. “Course 24: OpenGL and Window System Integration” Presented at Special Interest Group on Graphics and Interactive Techniques (SIGGRAPH), Los Angeles, Aug. 3-8, 1997. http://www.siggraph.org/s97/conference/c… [cited by applicant]
Rachlevsky-Reich, et al., “GEM: A Global Electronic Market System,” [Online] Retrieved from the Internet on Nov. 2, 2005: http//citeseer.ist.psu.edu/rd/80691485, Ch. 3—A Generic Market Framework, pp. 1-125 (Jul. 1999). [cited by applicant]
Sabata, B., et al., “Transport Protocol for Reliable Multicast: TRM,” Proceedings of the International Conference on Networks, Jan. 8-10, 1996, Orlando, Florida, USA, 1996, 3 pages. [cited by applicant]
Singapore Application No. 11201600229W, Search Report and Written Opinion issued Aug. 30, 2016 (10 Pages). [cited by applicant]
Singapore Application No. 11201600229W, Written Opinion issued Jun. 19, 2017 (6 Pages). [cited by applicant]
Speakman, T., et al., “PGM Reliable Transport Specification,” Network Working Group, Request for Comments No. 3208, The Internet Society, 2001, 112 pages. [cited by applicant]
Steiert, et al., “JPMQ—an advanced persistent message queuing service,” Advances in Databases. British National Conference on Databases, pp. 1-18 (Jul. 6, 1998). [cited by applicant]
Supplementary European Search Report EP 03764538, dated Nov. 2, 2005. [cited by applicant]
Taylor, P., “Second Quarter Sales Surge but Competition Depresses Margins” [online], Financial Times, London, United Kingdom, Jul. 28, 1998, p. 4. [Retrieved on Aug. 28, 2008] from the Internet: http://proquest.umi.com/… [cited by applicant]
Extended European Search Report in European Patent Application No. 23192531.2 dated Dec. 6, 2023, mailed Jan. 16, 2024. [cited by applicant]