Bulk data transfer

Details Bulk data transfer Bulk data transfer

2005-12-23

2011-12-27

Zhou, Yong (Department: 2477)

Multiplex communications

Pathfinding or routing

Switching a message which includes an address header

Reexamination Certificate

active

08085781

ABSTRACT:
This disclosure relates to network data communication. Some embodiments include initiating a network connection between an original source and an ultimate destination, transmitting a block of data from the original source to the ultimate destination on the network, requesting retransmission of lost blocks from the ultimate destination to the source and retransmitting the lost blocks from source to the ultimate destination. These embodiments further include measuring round-trip time of a retransmit request, the round-trip time measured from a time of transmission of a retransmit request from the ultimate destination to a time of reception at the ultimate destination after retransmission from the original source and setting the round-trip time as a minimum retransmission request time for the network connection, wherein the round-trip time includes latencies of the network connection and in data processes at the original source and at the ultimate destination.

REFERENCES:
patent: 4422171 (1983-12-01), Wortley et al.
patent: 5001628 (1991-03-01), Johnson et al.
patent: 5805920 (1998-09-01), Sprenkle et al.
patent: 6078564 (2000-06-01), Lakshman et al.
patent: 6110382 (2000-08-01), Wiemers et al.
patent: 6404739 (2002-06-01), Gonno
patent: 7496330 (2009-02-01), Toyoda et al.
patent: 2002/0044528 (2002-04-01), Pogrebinsky et al.
patent: 2003/0012212 (2003-01-01), Earnshaw et al.
patent: 2003/0032391 (2003-02-01), Schweinhart et al.
patent: 2003/0223430 (2003-12-01), Lodha et al.
patent: 2003/0231661 (2003-12-01), DePietro et al.
patent: 2004/0179477 (2004-09-01), Lincoln et al.
patent: 2005/0018617 (2005-01-01), Jin et al.
patent: 2009/0006920 (2009-01-01), Munson et al.
patent: WO-2006071866 (2006-07-01), None
patent: WO-2006071866 (2006-07-01), None
“Advanced Network Management Lab—Tsunami”, http://anml.iu.edu/research.shtml?prim=lab researc, (2005).
“Aspera Technology: “The Aspera FASP Solution””, www.asperasoft.com/technology-fasp.htm, (May 1, 2004), 1-4.
“HyperIP”, http://www.netex.com/products/hyperip.html, (2005).
“International Search Report and Written Opinion for Application No. PCT/US2005/047076, date mailed Jul. 28, 2006”, 22 Pages.
“Invitation to Pay Additional Fees for Application No. PCT/US2005/047076, date mailed May 22, 2006”, 5 Pages.
“Orbital Data 5500 product”,Product Data Sheet,http://www.orbitaldata.com/pdf/Orbital—5500.pdf#search=%22Orbital%20Data%205500%20%22,(2004), 2 pages.
Byers, J. W., et al., “A digital fountain approach to reliable distribution of bulk data”,ACM SIGCOMM Computer Communication Review, 28(4), (1998), 56-67.
Clark, D. D., et al., “NETBLT: A Bulk data transfer protocol”,Network Working Group Request for Comments, RFC 998, (Mar. 1987), 21 pages.
Dunigan, Tom, “Faster Bulk Transfer Starring UDP”, http://www.csm.ornl.gov/˜dunigan
et100/udp/ (Sep. 2003).
Floyd, Sally, et al., “Equation-based congestion control for unicast applications”,Proc. ACM SIGCOMM, (Sep. 2000), 43-56.
Floyd, Sally, “HighSpeed TCP for Large Congestion Windows”,RFC 3649, Experimental, http://www.icir.org/floyd/hstcp.html,(Dec. 2003), 25.
Grieco, Luigi A., et al., “Performance evaluation and comparison of Westwood+, New Reno, and Vegas TCP congestion control”,ACM SIGCOMM Computer Communication Review, 34(2), Apr. 2004 , 25-38.
Gu, Y., et al., “Experiences in Design and Implementation of a High Performance Transport Protocol”,Proceedings of the 2004 ACM/IEEE conference on Supercomputing, (2004), 14 pages.
Gu, Y., et al., “UDT:A transport protocol for Data intensive applications”,Internet Engineering Task Force, Internet Draft, (Aug. 2004).
Handley, S. F., et al., “Friendly rate control (TFRC):protocol specifications”, http://citeseer.ist.psu.edu/handley03tcp.html, (2001).
He, E., et al., “Reliable Blast UDP: Predictable High Performance Bulk Data Transfer”,Proceedings of the IEEE International Conference on Cluster Computing., (Sep. 23-26, 2002), 317-324.
Jacobson, V., et al., “Congestion avoidance and control”,Proc. of SIGCOMM88, ACM, (Aug. 1988), 314-329.
Jin, Cheng, et al., “Fast TCP”,57th IETF Meeting, Transport Area WG,Vienna, Austria, Available from http:/
etlab.caltech.edu/FAST/,(Jul. 18, 2003) , 73 pages.
Jin, Cheng, et al., “Fast TCP for high-speed long-distance networks”, http:/
etlab.caltech.edu/pub/papers/draft-jwl-tcp-fast-01.txt, (Jun. 30, 2003), 8 pages.
Jin, Cheng, et al., “Fast TCP: Motivation, Architecture, Algorithms, Performance”,Proceedings of IEEE INFOCOM, (Mar. 2004), 12 pages.
Jin, Cheng, et al., “Fast TCP: Motivation, Architecture, Algorithms, Performance”,Caltech CS Technical Report, available at http:/
etlab.caltech.edu/Fast/, (Aug. 2, 2004), 44 pages.
Jin, Cheng, et al., “Fast TCP: Motivation, Architecture, Algorithms, Performance”,Presentation for Infocom 2004, available at http:/
etlab.caltech.edu/Fast/2004/, 31.
Kelly, T., “Scalable TCP: improving performance in highspeed wide area networks”,ACM SIGCOMM Computer Communication Review, 33(2), (2003), 83-91.
Lakshman, T. V., et al., “The performance of TCP/IP for networks with high bandwidth-delay products and random loss”,IEEE/ACM Transactions on Networking, 5(3), (Jun. 1997), 336-350.
Liebeherr, J., et al., “A Protocol for Relative Quality-of-Service in TCP/IP-based Internetworks”,Proceedings of 3rd IEEE Workshop on the Architecture and Implementation of High Performance Communication Subsystems(HPCS'95), (Aug. 23, 1995), 62-65.
Mathis, M., et al., “The macroscopic behavior of the TCP congestion avoidance algorithm”,ACM SIGCOMM Computer Communication Review, 27(3), (1997).
Maymounkov, P., et al., “Rateless Codes and Big Downloads”,Proc. of the 2nd International Workshop on Peer-to-Peer Syst, (2003), 6 pages.
Meiss, M. R., “Tsunami: A High-Speed Rate-Controlled Protocol for File Transfer”, http://steinbeck.ucs.indiana.edu/˜mmeiss/papers/tsunami.pdf, (2003), 1-10.
Postel, J., et al., “File Transfer Protocol (FTP)”,IETF RFC 959, (Oct. 1985).
Wu, R. X., et al., “GTP: Group transport Protocol for lambda-grids”,IEEE Symposium on Cluster Computing and the Grid(CCGrid), (Apr. 19, 2004), 228-238.
Xu, L., et al., “Binary increase congestion control for fast long-distance networks”,Proceedings of IEEE INFOCOM, (2004), 11 pages.
05855603.6, “European Application No. 05855603.6 Office Action Mailed May 4, 2009”, 3 pgs.
“European Application No. 09175853.2, Office Action Mailed Dec. 22, 2009”, 5 pgs.
Yunhong, G., “A Transport Protocol for Data Intensive Applications draft”,IETF Standard-Working-Draft, Internet Engineering Task Force, (2004).
Chinese Application Serial No. 200580044742.3 ,Office Action Mailed Dec. 11, 2009, 5 pgs.
European Application Serial No. 05855603.6, Communication dated Feb. 27, 2008, 5 pgs.
European Application Serial No. 05855603.6, Response filed Jun. 4, 2009 to Communication mailed May 4, 2009, 3 pgs.
European Application Serial No. 05855603.6, Response filed Sep. 5, 2008 to Communication dated Feb. 27, 2008, 24 pgs.
“Australian Application No. 2005322044, Response to First Examiner Report filed on Oct. 13, 2010”, 23 pgs.
“Australian Application No. 2005322044, Subsequent Examiner Report mailed Nov. 22, 2010”, 2 Pgs.
“Chinese Application No. 200580044742.3, Response filed May 26, 2010 to Office Action Mailed Dec. 11, 2009”, 21 pgs.
“European Application No. 09175853.2, Office Action mailed Jul. 29, 2010”, 1 Pg.
“Japanese Application No. 2007-548581, Notice of Allowance mailed Aug. 10, 2010”, 3 Pgs.
“The Aspera FASP Solution”, Aspera Technology, URL, http://web.archive.org/web/2004101501373

Affiliated with

Also associated with

Rating

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

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

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4311606