Asynchronous data transmission

Multiplex communications – Pathfinding or routing – Switching a message which includes an address header

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S429000, C370S474000

Reexamination Certificate

active

07852845

ABSTRACT:
A method of, and system for, asynchronous data transmission are disclosed which have application in the transmission of stock exchange data or replicated memory data. Later transmitted data is used to overwrite earlier transmitted and received data. However, earlier transmitted data which is received later than later transmitted data (for example due to network latency) does not overwrite the later transmitted data. Transmitted data packets include a count value indicative of the sequence position of each data packet in a transmitted sequence of data packets. A transmitter and receiver for asynchronous data transmission and reception, and a packet signal structure are also disclosed.

REFERENCES:
patent: 4969092 (1990-11-01), Shorter
patent: 5214776 (1993-05-01), Bagnoli et al.
patent: 5291597 (1994-03-01), Shorter
patent: 5418966 (1995-05-01), Madduri
patent: 5434994 (1995-07-01), Shaheen et al.
patent: 5488723 (1996-01-01), Baradel et al.
patent: 5544345 (1996-08-01), Carpenter et al.
patent: 5568609 (1996-10-01), Sugiyama et al.
patent: 5612865 (1997-03-01), Dasgupta
patent: 5802585 (1998-09-01), Scales et al.
patent: 5918248 (1999-06-01), Newell et al.
patent: 6049809 (2000-04-01), Raman et al.
patent: 6148377 (2000-11-01), Carter et al.
patent: 6163801 (2000-12-01), O'Donnell et al.
patent: 6192514 (2001-02-01), Lurndal
patent: 6314558 (2001-11-01), Angel et al.
patent: 6324587 (2001-11-01), Trenbeath et al.
patent: 6327630 (2001-12-01), Carroll et al.
patent: 6370625 (2002-04-01), Carmean et al.
patent: 6389423 (2002-05-01), Sakakura
patent: 6425016 (2002-07-01), Banavar et al.
patent: 6571278 (2003-05-01), Negishi et al.
patent: 6574628 (2003-06-01), Kahn et al.
patent: 6574674 (2003-06-01), May et al.
patent: 6611955 (2003-08-01), Logean et al.
patent: 6625751 (2003-09-01), Starovic et al.
patent: 6668260 (2003-12-01), Zoltan
patent: 6757896 (2004-06-01), Cohen et al.
patent: 6760903 (2004-07-01), Morshed et al.
patent: 6775831 (2004-08-01), Carrasco et al.
patent: 6779093 (2004-08-01), Gupta
patent: 6782492 (2004-08-01), Nakaso
patent: 6823511 (2004-11-01), McKenney et al.
patent: 6862608 (2005-03-01), Buhlman et al.
patent: 6954794 (2005-10-01), Rudd et al.
patent: 6968372 (2005-11-01), Thompson et al.
patent: 7010576 (2006-03-01), Bae
patent: 7020736 (2006-03-01), Cherukuri
patent: 7031989 (2006-04-01), Elmendorf et al.
patent: 7047341 (2006-05-01), Jung
patent: 7047521 (2006-05-01), Bunnell
patent: 7058826 (2006-06-01), Fung
patent: 7082604 (2006-07-01), Schneiderman
patent: 7206827 (2007-04-01), Viswanath et al.
patent: 7228543 (2007-06-01), Baylis
patent: 2002/0199172 (2002-12-01), Bunnell
patent: 2003/0004924 (2003-01-01), Williams
patent: 2003/0005407 (2003-01-01), Hines
patent: 2003/0067912 (2003-04-01), Mead et al.
patent: 2003/0105816 (2003-06-01), Goswami
patent: 2004/0073828 (2004-04-01), Bronstein
patent: 2004/0085963 (2004-05-01), Ying
patent: 2004/0093588 (2004-05-01), Gschwind et al.
patent: 2004/0158819 (2004-08-01), Cuomo et al.
patent: 2004/0163077 (2004-08-01), Dimpsey et al.
patent: 2005/0039171 (2005-02-01), Avakian et al.
patent: 2005/0086384 (2005-04-01), Ernst
patent: 2005/0108481 (2005-05-01), Iyengar et al.
patent: 2005/0240737 (2005-10-01), Holt
patent: 2005/0257219 (2005-11-01), Holt
patent: 2005/0262313 (2005-11-01), Holt
patent: 2005/0262513 (2005-11-01), Holt
patent: 2006/0020913 (2006-01-01), Holt
patent: 2006/0080389 (2006-04-01), Powers et al.
patent: 2006/0095483 (2006-05-01), Holt
patent: 2006/0143350 (2006-06-01), Miloushev et al.
patent: 2006/0167878 (2006-07-01), Hartman
patent: 2006/0242464 (2006-10-01), Holt
patent: 2006/0253844 (2006-11-01), Holt
patent: 2006/0265703 (2006-11-01), Holt
patent: 2006/0265704 (2006-11-01), Holt
patent: 2006/0265705 (2006-11-01), Holt
patent: 2008/0072238 (2008-03-01), Monnie et al.
patent: 2008/0189700 (2008-08-01), Schmidt et al.
patent: 0969377 (2000-01-01), None
patent: WO95/08809 (1995-03-01), None
patent: WO98/58330 (1998-12-01), None
patent: WO02/44835 (2002-06-01), None
patent: WO03/083614 (2003-10-01), None
patent: WO03084116 (2003-10-01), None
patent: WO2005/103924 (2005-11-01), None
patent: WO2005/103925 (2005-11-01), None
patent: WO2005/103926 (2005-11-01), None
patent: WO2005/103927 (2005-11-01), None
patent: WO2005/103928 (2005-11-01), None
patent: WO2006/110937 (2006-10-01), None
patent: WO2006/110957 (2006-10-01), None
Abdullahi, et al., “Garbage Collection for Internet: A Survey of Distributed Garbage Collection”, ACM Computing Surveys [Online], vol. 30, No. 3, Sep. 1998, pp. 330-373, XP002504741 ISSN:0360-0300 Retrieved from the Internet URL:http://portal.acm.org/citation.cfm?doid=292469.292471>.
Aridor, et al. “cJVM: a single System Image of a JVM on a Cluster” Proceedings of the International Conference on Parallel Processing , pp. 21-24, Sep. 21-24, 1999.
Bal, et al., “A Distributed Implementation of the Shared Data-Object Model”, Proc. USENIX Workshop on Experiences with Distributed and Multiprocessor Systems pp. 1-19 , Oct. 1998, Fort Lauderdale, FL.
Bal, et al., “Experience with Distributed Programming in Orca”,IEEE CS International Conference on Computer Languages, pp. 1-23 , Mar. 1990, New Orleans, Louisiana.
Bal, et al., “Object Distribution in ORCA Using Compile-Time and Run-Time Techniques”, Proc. Conference on Object-Oriented Programming Systems, Languages and Applications pp. 162-177, Sep. 26, 1993-Oct. 1, 1993.
Bal, et al., “Orca: A Language for Paralell Programming of Distributed Systems”,IEEE Transactions on Software Engineering, 18(3): pp. 1-33, Oct. 1989.
Bal, et al., “Replication Techniques for Speeding Up Parallel Applications on Distributed Systems”,Concurrency Practice&Experience, 4(5):337-355 (1992).
Bellew, et al., “Update propagation in distributed memory hierarchy.” Data Engr. 1990. Proc. 6th Int'l Conf., pp. 521-528, Feb. 1990.
Bennett, et al. “Munin: Distributed Shared Memory Based on Type Specific Memory Coherence.” Dept. Elec & Computer Engr. pp. 1-9 ACM, PPOPP'90, Feb. 1990.
Bressoud, T.C. TFT: “A Software System for Application-Transparent Fault Tolerance. Proc.”, 28thAnnual International Symposium on Fault-Tolerant Computing, pp. 128-137, Jun. 1998, Munich, Germany.
Chen, et al., “Multi-Jav: a distributed shared memory system based on multiple Java virtual machines.” Proc. Of Conf. on Parallel & Distrib. Proc. Techn. & Appls., Las Vegas, NV, Jun. 1998.
Dasilva, et al. “An evaluation of cJava system architecture.” IEEE Prc. 15th Symposium on Computer Architecture & High Performance Computing, pp. 1-9, Nov. 10-12, 2003, San Paulo, Brazil.
Dmitriev, “Profiling Java applications using code hotswapping and dynamic call graph revelation.” Jan. 14-16, 2004, ACM WOSP '04, pp. 139-150.
Dwarkadas, et al., “Evaluation of Release Consistent Software Distributed Shared Memory on Emerging Network Technology”, Proc of the 20th Annual International Symposium on Computer Architecture (ISCA '93), pp. 144-155, May 16-19, 1993, San Diego, CA.
Gothe, et al., “The Distributed Ada Run-Time System DARTS.” Software Prac. & Experience, vol. 21, No. 1, pp. 1249-1263, Aug. 4, 1989.
Haumacher, et al., “Transparent distributed threads for Java,” Parallel & Distributed Proc. Symposium 2003, Proc. Int'l. pp. 22-26, Apr. 2003.
Puatu, “Distributed Garbage Collection of Active Objects with No Global Synchonisation”—Lecture Notes in Computer Science, Memory Management [online], XP008098868 ISSN: 0302-9743 ISBN: 978-3-540-55940-5-Retrieved from the internet URL:http//www.springerlink.com/content/5v 028411810p6m700/>, vol. 637, pp. 148-4694, Sep. 17-19, 1992, IWMM 92, St. Malo, France.
Larus, et al. “EEL: machine-independent executable editing. 1995 ACM SIGGPLAN '95.” pp. 291-300, Jun. 21-22, 1995.
Little, et al., “Maintaining Information About Persistent Replicated Objects in a

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Asynchronous data transmission does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Asynchronous data transmission, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Asynchronous data transmission will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-4210489

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.