IP Library Granted Patent US 12,361,489
Granted Patent B2
US 12,361,489 · App. 18/416,326 · Granted Jul 15, 2025

Distribution of market data based on price level transitions

Inventor: Scott F. Singer (Green Oaks, IL)
Assignee: TRADING TECHNOLOGIES INTERNATIONAL, INC.
G06Q40/04G06Q10/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,361,489
App. No.
18/416,326
Granted
Jul 15, 2025
Kind
B2
Abstract

A system and method for distributing market data in response to price level transitions is disclosed. The system and method provide a mechanism for detecting when a price level transition has occurred. Detection of a price level transition results in the distribution of market data and may include displaying the results.

Claims (33)

1. A method including:

in response to receiving a first market data related to a quantity available for a tradeable object at a plurality of price levels that includes a best bid and a best ask, beginning a coalescing period, wherein the coalescing period represents a time interval during which coalescing will occur without sending updated market data to a trading device until the end of the time interval;

coalescing, during the coalescing period, any subsequent market data received related to the tradeable object to generate coalesced market data;

identifying, during the coalescing period, in any of the subsequent market data received related to the tradeable object whether a price level transition has occurred, wherein a price level transition is identified when at least one of the best bid and the best ask in a current one of the subsequent market data received related to the tradeable object has changed from a previously market update;

sending the coalesced market data to the trading device in response to identifying the price level transition has occurred, and at the coalescing period end time when the price level transition is not identified.

2. The method of claim 1 , wherein the price level transition is further identified when quantity available at a price level of the plurality of price levels in the previously received market data has changed to no quantity available at the price level in the currently received market data.

3. The method of claim 1 , wherein the price level transition is further identified when no quantity available at a price level of the plurality of price levels in the previously received market update has changed to quantity available at the price level in the currently received market data.

4. The method of claim 1 , wherein the price level transition is further identified when an overall quantity available at the plurality of price levels in the currently received market data exceeds a threshold.

5. The method of claim 1 , wherein the price level transition is further identified when at least one of the low price level and the high price level for a trading session for the tradeable object has changed in the currently received market data.

6. The method of claim 1 , wherein the price level transition is further identified when quantity available at a price level of the plurality of price levels in the currently received market data has changed from quantity available at the price level in the previously received market data by an amount that exceeds a threshold.

7. The method of claim 1 , wherein the coalescing period end time occurs at an expiration of a defined period of time.

8. A non-transitory computer readable medium having stored therein instructions executable by a processor, including instructions executable to:

in response to receiving a first market data related to a quantity available for a tradeable object at a plurality of price levels that includes a best bid and a best ask, begin a coalescing period, wherein the coalescing period represents a time interval during which coalescing will occur without sending updated market data to a trading device until the end of the time interval;

coalesce, during the coalescing period, any subsequent market data received related to the tradeable object to generate coalesced market data;

identify, during the coalescing period, in any of the subsequent market data received related to the tradeable object whether a price level transition has occurred, wherein a price level transition is identified when at least one of the best bid and the best ask in a current one of the subsequent market data received related to the tradeable object has changed from a previously market update;

send the coalesced market data to the trading device in response to identifying the price level transition has occurred, and at the coalescing period end time when the price level transition is not identified.

9. The non-transitory computer readable medium of claim 8 , wherein the price level transition is further identified when quantity available at a price level of the plurality of price levels in the previously received market data has changed to no quantity available at the price level in the currently received market data.

10. The non-transitory computer readable medium of claim 8 , wherein the price level transition is further identified when no quantity available at a price level of the plurality of price levels in the previously received market update has changed to quantity available at the price level in the currently received market data.

11. The non-transitory computer readable medium of claim 8 , wherein the price level transition is further identified when an overall quantity available at the plurality of price levels in the currently received market data exceeds a threshold.

12. The non-transitory computer readable medium of claim 8 , wherein the price level transition is further identified when at least one of the low price level and the high price level for a trading session for the tradeable object has changed in the currently received market data.

13. The non-transitory computer readable medium of claim 8 , wherein the price level transition is further identified when quantity available at a price level of the plurality of price levels in the currently received market data has changed from quantity available at the price level in the previously received market data by an amount that exceeds a threshold.

14. The non-transitory computer readable medium of claim 8 , wherein the coalescing period end time occurs at an expiration of a defined period of time.

15. A system including:

a computing device having a processor and a memory storing instructions executable by the processor, including instructions executing the steps of:

in response to receiving a first market data related to a quantity available for a tradeable object at a plurality of price levels that includes a best bid and a best ask, begin a coalescing period, wherein the coalescing period represents a time interval during which coalescing will occur without sending updated market data to a trading device until the end of the time interval;

coalescing, during the coalescing period, any subsequent market data received related to the tradeable object to generate coalesced market data;

identifying, during the coalescing period, in any of the subsequent market data received related to the tradeable object whether a price level transition has occurred, wherein a price level transition is identified when at least one of the best bid and the best ask in a current one of the subsequent market data received related to the tradeable object has changed from a previously market update;

sending the coalesced market data to the trading device in response to identifying the price level transition has occurred, and at the coalescing period end time when the price level transition is not identified.

16. The system of claim 15 , wherein the price level transition is further identified when quantity available at a price level of the plurality of price levels in the previously received market data has changed to no quantity available at the price level in the currently received market data.

17. The system of claim 15 , wherein the price level transition is further identified when no quantity available at a price level of the plurality of price levels in the previously received market update has changed to quantity available at the price level in the currently received market data.

18. The system of claim 15 , wherein the price level transition is further identified when an overall quantity available at the plurality of price levels in the currently received market data exceeds a threshold.

19. The system of claim 15 , wherein the price level transition is further identified when at least one of the low price level and the high price level for a trading session for the tradeable object has changed in the currently received market data.

20. The system of claim 15 , wherein the price level transition is further identified when quantity available at a price level of the plurality of price levels in the currently received market data has changed from quantity available at the price level in the previously received market data by an amount that exceeds a threshold.

Assignments (4)
SECURITY INTEREST Recorded Nov 7, 2025
From: TRADING TECHNOLOGIES INTERNATIONAL, INC.
To: HPS INVESTMENT PARTNERS, LLC, AS COLLATERAL AGENT
Reel/Frame 073510/0758 →
RELEASE OF SECURITY INTEREST Recorded Nov 5, 2025
From: JPMORGAN CHASE BANK, N.A., AS ADMINISTRATIVE AGENT
To: TRADING TECHNOLOGIES INTERNATIONAL, INC.
Reel/Frame 073470/0597 →
SECURITY INTEREST Recorded May 3, 2024
From: TRADING TECHNOLOGIES INTERNATIONAL, INC.
To: JPMORGAN CHASE BANK, N.A.
Reel/Frame 067310/0496 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 18, 2024
From: SINGER, SCOTT F.
To: TRADING TECHNOLOGIES INTERNATIONAL, INC.
Reel/Frame 066171/0414 →
Continuity (4)
Continuation 18187066 · Mar 21, 2023
Continuation 17465600 · Sep 2, 2021
Continuation In Part 13709769 · Dec 10, 2012
Related Publication 20240161192A1 · May 16, 2024
References Cited (210)
US 3253263A · Lee et al. · 1966 [cited by applicant]
US 3962685A · Belle Isle · 1976 [cited by applicant]
US 4868866A · Williams, Jr. · 1989 [cited by applicant]
US 4903201A · Wagner · 1990 [cited by applicant]
US 5297032A · Trojan et al. · 1994 [cited by applicant]
US 5339392A · Risberg et al. · 1994 [cited by applicant]
US 5440564A · Ovadia et al. · 1995 [cited by applicant]
US 5515359A · Zheng · 1996 [cited by applicant]
US 5588009A · Will · 1996 [cited by applicant]
US 5680116A · Hashimoto et al. · 1997 [cited by applicant]
US 5758097A · Debe et al. · 1998 [cited by applicant]
US 5802310A · Rajaraman · 1998 [cited by applicant]
US 5809483A · Broka et al. · 1998 [cited by applicant]
US 5832496A · Anand et al. · 1998 [cited by applicant]
US 5905868A · Baghai et al. · 1999 [cited by applicant]
US 5913202A · Motoyama · 1999 [cited by applicant]
US 5915209A · Lawrence · 1999 [cited by applicant]
US 5982771A · Caldara et al. · 1999 [cited by applicant]
US 5995943A · Bull 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 6026406A · Huang 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 6278982B1 · Korhammer et al. · 2001 [cited by applicant]
US 6366899B1 · Kernz · 2002 [cited by applicant]
US 6370569B1 · Austin · 2002 [cited by applicant]
US 6408000B1 · Lamberg et al. · 2002 [cited by applicant]
US 6501950B1 · Smith 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 6675153B1 · Cook et al. · 2004 [cited by applicant]
US 6772132B1 · Kemp, II · 2004 [cited by examiner]
US 6904596B1 · Clark et al. · 2005 [cited by applicant]
US 6925493B1 · Barkan et al. · 2005 [cited by applicant]
US 6938011B1 · Kemp, II et al. · 2005 [cited by applicant]
US 6993507B2 · Meyer et al. · 2006 [cited by applicant]
US 7127424B2 · Kemp, II 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 · 2007 [cited by examiner]
US 7228289B2 · Brumfield et al. · 2007 [cited by applicant]
US 7272118B1 · Yarkosky · 2007 [cited by applicant]
US 7310615B2 · Lewis · 2007 [cited by applicant]
US 7389265B2 · Lawrence et al. · 2008 [cited by applicant]
US 7389268B1 · Kemp, II et al. · 2008 [cited by applicant]
US 7412462B2 · Margolus et al. · 2008 [cited by applicant]
US 7426491B1 · Singer et al. · 2008 [cited by applicant]
US 7462491B2 · Thompson · 2008 [cited by applicant]
US 7552077B1 · Schluetter · 2009 [cited by examiner]
US 7555485B2 · Soulanille · 2009 [cited by applicant]
US 7567930B1 · Schluetter · 2009 [cited by examiner]
US 7586484B2 · Sampsell et al. · 2009 [cited by applicant]
US 7599867B1 · Monroe et al. · 2009 [cited by applicant]
US 7606761B2 · Acki et al. · 2009 [cited by applicant]
US 7627682B2 · Uthe · 2009 [cited by applicant]
US 7685049B1 · Singer · 2010 [cited by examiner]
US 7685052B2 · Waelbroeck et al. · 2010 [cited by applicant]
US 7685616B2 · Virdi et al. · 2010 [cited by applicant]
US 7742962B1 · Singer · 2010 [cited by applicant]
US 7747510B1 · Burns et al. · 2010 [cited by applicant]
US 7747513B2 · Duquette et al. · 2010 [cited by applicant]
US 7873065B1 · Mukerji et al. · 2011 [cited by applicant]
US 7945508B2 · Duquette · 2011 [cited by examiner]
US 7970697B2 · Schwarz · 2011 [cited by examiner]
US 8036977B1 · Mintz et al. · 2011 [cited by applicant]
US 8041624B2 · Buckwalter et al. · 2011 [cited by applicant]
US 8082573B2 · Miyamoto et al. · 2011 [cited by applicant]
US 8090637B2 · Schluetter · 2012 [cited by examiner]
US 8229823B2 · Schluetter · 2012 [cited by examiner]
US 8290850B1 · Singer · 2012 [cited by examiner]
US 8301546B2 · Schwarz · 2012 [cited by examiner]
US 8352344B2 · Schluetter et al. · 2013 [cited by applicant]
US 8407135B2 · Singer · 2013 [cited by applicant]
US 8423373B2 · Singer · 2013 [cited by examiner]
US 8571959B2 · Schluetter et al. · 2013 [cited by applicant]
US 8589948B2 · Kemp, II · 2013 [cited by examiner]
US 8606690B2 · Singer · 2013 [cited by applicant]
US 8762257B2 · Singer · 2014 [cited by examiner]
US 8799135B2 · Duquette · 2014 [cited by examiner]
US 9197428B1 · Lebedev · 2015 [cited by examiner]
US 10026122B2 · West · 2018 [cited by examiner]
US 10037570B2 · Duquette · 2018 [cited by examiner]
US 10055790B2 · Singer · 2018 [cited by applicant]
US 10248999B2 · Singer · 2019 [cited by applicant]
US 10453134B2 · Zhou · 2019 [cited by applicant]
US 10467691B2 · Singer · 2019 [cited by examiner]
US 10572941B2 · West · 2020 [cited by examiner]
US 10726486B2 · Singer · 2020 [cited by applicant]
US 10776871B2 · Singer · 2020 [cited by applicant]
US 10937095B2 · West · 2021 [cited by applicant]
US 11138525B2 · Singer · 2021 [cited by examiner]
US 11282141B2 · Singer · 2022 [cited by applicant]
US 11636543B2 · Singer · 2023 [cited by examiner]
US 11941697B2 · Singer · 2024 [cited by examiner]
US 20020026528A1 · Lo · 2002 [cited by applicant]
US 20020097697A1 · Bae et al. · 2002 [cited by applicant]
US 20020120546A1 · Zajac · 2002 [cited by applicant]
US 20020161883A1 · Mantheny et al. · 2002 [cited by applicant]
US 20020184237A1 · McFeely · 2002 [cited by applicant]
US 20030009550A1 · Taylor et al. · 2003 [cited by applicant]
US 20030009553A1 · Benfield et al. · 2003 [cited by applicant]
US 20030055768A1 · Anaya et al. · 2003 [cited by applicant]
US 20030061069A1 · Silverman et al. · 2003 [cited by applicant]
US 20030065598A1 · Bunda · 2003 [cited by applicant]
US 20030126068A1 · Hauk et al. · 2003 [cited by applicant]
US 20040019554A1 · Merold · 2004 [cited by examiner]
US 20040039733A1 · Soulanille · 2004 [cited by applicant]
US 20040153533A1 · Lewis · 2004 [cited by applicant]
US 20040162772A1 · Lewis · 2004 [cited by applicant]
US 20040244045A1 · Miyamoto et al. · 2004 [cited by applicant]
US 20040254877A1 · Buckwalter et al. · 2004 [cited by applicant]
US 20050027629A1 · De Breed et al. · 2005 [cited by applicant]
US 20050044037A1 · Lawrence et al. · 2005 [cited by applicant]
US 20050177657A1 · Pope et al. · 2005 [cited by applicant]
US 20050187855A1 · Brennan · 2005 [cited by examiner]
US 20050198437A1 · Mukherjee · 2005 [cited by applicant]
US 20050203825A1 · Angle et al. · 2005 [cited by applicant]
US 20060039293A1 · Uthe · 2006 [cited by applicant]
US 20060047849A1 · Mukherjee · 2006 [cited by applicant]
US 20060066503A1 · Sampsell et al. · 2006 [cited by applicant]
US 20060069635A1 · Ram et al. · 2006 [cited by applicant]
US 20060200404A1 · Stearns · 2006 [cited by applicant]
US 20060265309A1 · Sweeting et al. · 2006 [cited by applicant]
US 20060287934A1 · Rowe, III · 2006 [cited by applicant]
US 20070005481A1 · Kedia et al. · 2007 [cited by applicant]
US 20070078700A1 · Lenzmann et al. · 2007 [cited by applicant]
US 20070100733A1 · Huizing et al. · 2007 [cited by applicant]
US 20070208647A1 · Gemuenden et al. · 2007 [cited by applicant]
US 20080097887A1 · Duquette · 2008 [cited by examiner]
US 20080097893A1 · Walsky et al. · 2008 [cited by applicant]
US 20080162324A1 · West · 2008 [cited by examiner]
US 20080232364A1 · Beverly · 2008 [cited by applicant]
US 20090240633A1 · Schluetter et al. · 2009 [cited by applicant]
US 20100005022A1 · DePetris et al. · 2010 [cited by applicant]
US 20100100830A1 · Singer · 2010 [cited by applicant]
US 20100131398A1 · Molloy et al. · 2010 [cited by applicant]
US 20100138335A1 · Kemp, II et al. · 2010 [cited by applicant]
US 20100228833A1 · Diqiette et al. · 2010 [cited by applicant]
US 20110184849A1 · Duquette et al. · 2011 [cited by applicant]
US 20110218904A1 · Schwarz et al. · 2011 [cited by applicant]
US 20120072325A1 · Schluetter et al. · 2012 [cited by applicant]
US 20120259767A1 · Schluetter · 2012 [cited by examiner]
US 20120317011A1 · Duquette · 2012 [cited by applicant]
US 20130006841A1 · Singer · 2013 [cited by applicant]
US 20130085923A1 · Schluetter · 2013 [cited by examiner]
US 20130151395A1 · Singer · 2013 [cited by applicant]
US 20130211997A1 · Singer · 2013 [cited by examiner]
US 20130212001A1 · Duquette · 2013 [cited by examiner]
US 20140143119A1 · Singer · 2014 [cited by applicant]
US 20140164202A1 · Singer · 2014 [cited by examiner]
US 20140236795A1 · Schluetter et al. · 2014 [cited by applicant]
US 20140316966A1 · Singer · 2014 [cited by applicant]
US 20180293652A1 · West · 2018 [cited by applicant]
US 20180330441A1 · Singer · 2018 [cited by applicant]
US 20190172135A1 · Singer · 2019 [cited by applicant]
US 20200143472A1 · West · 2020 [cited by applicant]
US 20200311813A1 · Singer · 2020 [cited by applicant]
US 20200364793A1 · Singer · 2020 [cited by applicant]
US 20210103986A1 · West · 2021 [cited by applicant]
AU 2007340076A · 2007 [cited by applicant]
CN 103400296A · 2013 [cited by applicant]
EP 1422641A1 · 2004 [cited by applicant]
JP H06004544A · 1994 [cited by applicant]
JP H06250947A · 1994 [cited by applicant]
JP 2000132464A · 2000 [cited by applicant]
JP 2010527477A · 2010 [cited by applicant]
WO 199913426A1 · 1999 [cited by applicant]
WO 200209454A2 · 2002 [cited by applicant]
WO 2002017193A1 · 2002 [cited by applicant]
WO 2006012284A2 · 2006 [cited by applicant]
WO 2008140950A2 · 2008 [cited by applicant]
WO 2012145532A2 · 2012 [cited by applicant]
H. Subramoni, F. Petrini, V. Agarwal and D. Pasetto, “Streaming, low-latency communication in on-line trading systems,” 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IP… [cited by examiner]
Berrada, T., “Incomplete Information, Heterogeneity, and Asset Pricing” [online], Journal of Financial Econometrics, Oxford: Winter 2006, vol. 4, Iss. 1, p. 136 (Abstract Only). [Retrieved on Jun. 21, 2012] from the Int… [cited by applicant]
Bigrigg, “Survivable Information Storage Systems,” Computer (Aug. 2000). [cited by applicant]
Buckley, Chris, “Implementation of the SMART Information Retrieval System,” Department of Computer Science, Cornell University, Ithaca, New York, (May 1985). [cited by applicant]
Canadian Application No. 2,671,394, Office Action issued Nov. 29, 2011 (4 pages). [cited by applicant]
Canter, M.S., Ph.D., “Price Discovery in Futures Markets” [online], Ph.D. Dissertation, Columbia University, New York: 1996, 134 Pages (Abstract only), AAT 9631673. [Retrieved on Jun. 21, 2012] from the Internet: http:/… [cited by applicant]
Chen, Ling and Chen, Gen-Cai. “Fuzzy DR Algorithm for Data Distribution Management,” Journal of Zhejiang University, Sep. 2006, pp. 1521-1525 (Abstract only). [cited by applicant]
Chakravarty, et al., “Decimal Trading and Market Impact.” Mar. 26, 2001. [cited by applicant]
Clemons & Weber, “Restructuring Institutional Block Trading: An Overview of the Opti-Mark System.” Journal of Management Information Systems. vol. 15, Issue 2, pp. 41-60 (Fall 1998). [cited by applicant]
Das, S., et al. “TeleMIP: telecommunications-enhanced mobil IP architecture for fast intradomain mobility,” in IEEE Personal Communications, vol. 7, No. 4, pp. 59058, Aug. 2000. (Year: 2000). [cited by applicant]
European Application No. 07855266.8, Extended Search Report mailed Dec. 2, 2010 (7 pages). [cited by applicant]
European Application No. 07855266.8, Office Action mailed Nov. 17, 2011 (4 pages). [cited by applicant]
European Application No. 07855266.8, Official Communication mailed Apr. 20, 2012 (3 pages). [cited by applicant]
Fahringer, T., Buffer-Safe Communication Optimization based on Data Flow Analysis and Performance Prediction. Institute for Software Technology and Parallel Systems, University of Vienna Liechtensteinstr. 22, A-1090, Vi… [cited by applicant]
Garcia, Albert B. “Estimating Computer Communication Network Performance Using Network Simulations,” The University of Dayton, UMI Dissertation Publishing, 1985 (Abstract). [cited by applicant]
Hunter, J., “LAN Bridges Bridging the Gap” [online], Network World, vol. 6, No. 27, Jul. 10, 1989, ProQuest Central, p. 39. [cited by applicant]
IBM, GEAC System 21, Concept and tasks associated with AS/400 system, http://www.redbooks.ibm.com/redbooks/pdfs/sg245967.pdf, pp. 3-15, Section 1.1; 2001. [cited by applicant]
International Search Report and Written Opinion of International Application No. PCT/US2007/088143 dated Mar. 1, 2008 (mailed Apr. 28, 2008) (10 pages). [cited by applicant]
Johnson, T.D., Ph.D., “Connection Level Priority/Pre-Emption Service for Asynchronous Transfer Mode Communication Networks” [online], Ph.D. Dissertation, ProQuest Dissertations and Theses (PQDT) , 1997, 422 pages. [cited by applicant]
Lakshmanan, G.T., et al., “Placement Strategies for Internet-Scale Data Stream Systems,” in IEEE Internet Computing, vol. 12, No. 6, pp. 50-60, Nov.-Dec. 2008. (Year: 2008). [cited by applicant]
Lizy, J., Code Coalescing Unit: A Mechanism to Facilitate Load Store Data Communication. Electrical and Computer Engineering Department, the University of Texas at Austin Austin, TX 78712, [email protected]., (Year: … [cited by applicant]
Marshall, D. “Thread programming examples”, https://users.cs.cf.ac.uk/Dave.Marshall/C/node32.html; Jan. 5, 1999. [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]
Preliminary Examination Instructions in view of the Supreme Court Decision in [cited by applicant]
Raghavan, Gopalakrishna. “Industrial Strength Formalization of Object-Oriented Real Time Systems,” Florida Atlantic University, UMI Dissertation Publishing, 2000. [cited by applicant]
Sable, et al., “Evolution to the Advanced Intelligent Network,” Evolution to the Advanced Intelligent Networks, AT & T, Apr. 5, 1992, pp. 103-113 (Document No. XP000684008). [cited by applicant]
Sarin et al., “Using History Information to Process Delayed Database Updates,” Proceedings of the Twelfth International Conference on Very Large Databases, Kyoto-Japan (Aug. 1986). [cited by applicant]
Scarborough, B., “Distributed Database Gives More Data Independence and Sharing” [online], Computing Canada, Willowdale: May 30, 1985, vol. 11, Iss. 11, Pg. Software (Abstract only). [Retrieved on Jun. 21, 2012] from th… [cited by applicant]
Shaikh, A., Traffic Characteristics of Bulk Data Transfer using TCP/IP over Gigabit Ethernet. Department of Computer Science and Engineering University of South Florida Tampa, FL 33620 {ashaikh, christen) @csee.usf.edu.… [cited by applicant]
Singapore Application No. 11201504196Q, Written Opinion issued by Austrian Patent Office Mar. 3, 2016 (mailed Apr. 1, 2016). [cited by applicant]
Singapore Application No. 2009-04177-3, Written Opinion issued by Austrian Patent Office (mailed Nov. 16, 2009) (4 pages). [cited by applicant]
Singapore Application No. 2009-04177-3, Examination Report issued by Austrian Patent Office (mailed Oct. 13, 2010) (4 pages). [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]
Ye, J., Ph. D., “An Investigation of Market Fragmentation and the Specialist's Quotation Strategy,” [online], Ph.D. Dissertation, ProQuest Dissertations and Theses (PQDT) , 1995, 110 pages. [cited by applicant]