Source: http://www.google.com/patents/US7965729?dq=5998925
Timestamp: 2017-02-25 19:22:02
Document Index: 457569688

Matched Legal Cases: ['§119', '§112', '§1', '§1', '§1', '§1', '§1', '§1', '§1', '§4', '§4', '§4', '§4', '§4', '§4', '§4', '§4', '§4', '§4', '§4', '§4', '§4', '§4', '§4', '§4', '§4', '§4', '§4', '§4', '§4', '§4', '§4', '§4', '§4', '§4']

Patent US7965729 - Transferring data such as files - Google PatentsSearch Images Maps Play YouTube News Gmail Drive More »Sign inPatentsTransferring data (such as files) on an end-to-end, high-speed packet-switched network connection (a “virtual circuit”) or on a circuit. An out-of-band path is used for signaling and status messages (control). The same, or a separate, out-of-band path may be used to retransmit chunks of data that...http://www.google.com/patents/US7965729?utm_source=gb-gplus-sharePatent US7965729 - Transferring data such as filesAdvanced Patent SearchTry the new Google Patents, with machine-classified Google Scholar results, and Japanese and South Korean patents.Publication numberUS7965729 B2Publication typeGrantApplication numberUS 10/155,832Publication dateJun 21, 2011Filing dateMay 23, 2002Priority dateMay 23, 2001Fee statusPaidAlso published asUS20030053475Publication number10155832, 155832, US 7965729 B2, US 7965729B2, US-B2-7965729, US7965729 B2, US7965729B2InventorsMalathi Veeraraghavan, Timothy Christopher MoorsOriginal AssigneePolytechnic UniversityExport CitationBiBTeX, EndNote, RefManPatent Citations (34), Non-Patent Citations (4), Referenced by (10), Classifications (21), Legal Events (5) External Links: USPTO, USPTO Assignment, EspacenetTransferring data such as files
Benefit is claimed, under 35 U.S.C. §119(e)(1), to the filing date of provisional patent application Ser. No. 60/293,028, entitled “PRELIMINARY SPECIFICATION AND EXPLANATION OF A DATA TRANSFER TECHNIQUE OF THE PRESENT INVENTION: AN END-TO-END PROTOCOL FOR TRANSPORTING BULK DATE OVER (VIRTUAL) CIRCUITS”, filed on May 23, 2001 and listing Tim Moors and Malathi Veeraraghavan as the inventors, for any inventions disclosed in the manner provided by 35 U.S.C. §112, ¶1. This provisional application is expressly incorporated herein by reference. However, the invention is not intended to be limited by any statements in that provisional application. Rather, that provisional application should be considered to describe exemplary embodiments of the invention.
The description of art in this section is not, and should not be interpreted to be, an admission that such art is prior art to the present invention. Circuit-switched and packet-switched networks are introduced in §1.2.1. The special characteristics of bulk data transfers are introduced in §1.2.2. Drawbacks of known ways of effecting bulk data transfers are introduced in §1.2.3. Finally, needs unmet by known bulk data transfer techniques are listed in §1.2.4.
§1.2.1 Circuit-switched Networks and Packet-switched Networks
§1.2.2 Characteristics of Bulk Data Transfers, such as File Transfers
§1.2.3 Known Ways of Effecting Bulk Data Transfers and their Perceived Shortcomings
Terminals: A data transfer technique of the present invention is designed to transport data from a “source” (or “transmitter”) to a “destination” (or “receiver”). The source and destination are collectively referred to as “terminals”. The bulk of the transfer flows from the source to the destination, and the (virtual) circuit that a data transfer technique of the present invention uses also flows in this direction, although a data transfer technique of the present invention may also carry smaller amounts of application information from the destination to the source (e.g. a destination that “pulls” information in a file-transfer may send to the source the name of the file to be transferred). Either the source or the destination may initiate a transfer. Client: The terminal that initiates the transfer is called the “client”. Server: The terminal that does not initiate the transfer is called the “server”. In common web transfers, the server is the source. Nodes: The terminals may be connected by a circuit-switched network, which contains switching nodes. Channel: A communication “channel” allows nodes that connect to the ends of that channel to exchange information. Link: A “link” is a channel, except a link does not necessarily extend end-to-end between communicating terminals. It may be necessary to concatenate links to form an end-to-end channel. Connection: A “connection” exists between nodes when the nodes share state information, and there exists a communication channel between the nodes. This document refers to “TCP connections” which, in addition to the properties of connections, also provide “reliable transfer”. Circuit: A “circuit” or “virtual circuit” delivers information in sequence, except it may introduce bit errors, and its availability for delivering information is independent of the terminal's demand for communication. Virtual circuits are usually isochronous, i.e. the destination(s) receive pieces of information with equidistant temporal separation. In-band: (Carried on) the same connection that carries the bulk data (e.g., payload data for an application layer) being transferred. Out-of-band (Carried on) a connection other than the one that carries the bulk data (payload data for an application layer) being transferred. Layers: As is known, for reasons of modularity (e.g. to decompose the complicated task of communication into tractable parts), nodes that participate in the process of communication are often organized into layers. A key layer is the application layer, which acts as the ultimate source and sink of information. In the case of the present invention, the application layer would usually be a file transfer program. The application is concerned with the content that is exchanged between terminals, but not with the actual process of communicating that content. The application layer uses the services of the transport layer, which, among other things, uses the communication network to provide the type of communication service that the application needs or requests. Some aspects of the data transfer techniques of the present invention can be thought of as a protocol that provides as a transport layer for the application, although other aspects of the present invention use another transport layer. The role of a communication network is to transfer information between terminals. Thus, another layer in a terminal is the network layer, which provides for the delivery of information between terminals. In packet-switched networks, the network layer forms an end-to-end path between communicating terminals by concatenating multiple links. That is, there is a link layer below the network layer. For circuit-switched networks, the network creates an end-to-end circuit, so there is no need to concatenate links. A Network Interface Card (NIC) provides an interface to the network. For circuit-switched networks, a NIC provides an interface to an end-to-end circuit, whereas for packet-switched networks, a NIC provides an interface to a link. A NIC may provide functions such as framing and error detection. In providing these functions, it may limit the size of transmission units that it can handle. (The stippled portions of FIG. 7 illustrate how the bulk data transfer and control signaling aspects of the data transfer techniques of the present invention may be thought of as protocol layers.) In the following, an exemplary environment in which the present invention may operate is described in §4.1. Then, high-level operations of the present invention are described in §4.2. Thereafter, exemplary methods, data structures and apparatus that may be used to effect those operations are described in §4.3. Finally, some conclusions regarding the present invention are set forth in §4.4.
§4.2 High-level Operations of the Present Invention
§4.3.1 Data Transfer—Overview
An exemplary apparatus for effecting such a data transfer is first described in §4.3.1.1 below with reference to FIGS. 1 and 2. Then, an exemplary message format and exemplary messages that may be used are introduced in §4.3.1.2 below with reference to FIG. 3. Then, exemplary methods and techniques that may be used to effect various operations related to data transfer, as well as exemplary data structures used for communications, are described in §§4.3.2-4.3.7 below, with reference to FIGS. 4-6.
§4.3.1.1 Exemplary Apparatus
FIG. 1 is a bubble diagram of operations that may be performed by, or used in conjunction with, the present invention. As introduced in §4.1 above, the terminal 110 may transmit data to, or receive data from, terminal 170 over communications network(s) 160. For example, application level operations 120 may use the services of communications facility 125 for such communications. The communications facility may include data (file) transfer operations 130 which may use services provided by transport layer operations 140 and network, data link and physical layer operations 150.
The data (file) transfer operations 130 may include file preparation operation(s) 131, communications circuit negotiation and selection operation(s) 132, transmission operation(s) 133, and reception operation(s) 134. As shown, the reception operation(s) 134 may include error detection and notification operation(s) 135, and the transmission operation(s) may include error recovery operation(s) 136. Exemplary methods and techniques that may be used to effect these operations in accordance with the present invention are described in §§4.3.2-4.3.7 below, with reference to FIGS. 4-6.
§4.3.1.2 Exemplary Message Format and Messages
§4.3.3 Signaling—Circuit Reservation
Various implementation specific details of exemplary proposal, proposal serving, nomination and commitment signaling and processing are now described in §§4.3.3.1 through 4.3.3.4 below.
§4.3.3.1 Proposing a Transfer
§4.3.3.2 Serving a Proposal
§4.3.3.3 Nominating Opportunities (In Response to a Proposal)
The “server_time” field helps nodes select opportunities that are likely to start after the commit signal reaches the server. The most significant bit of the “transmission_length” field indicates the type of coding for the “transmission_length”. When the most significant bit is set to 0, the 31 least significant bits of the “transmission_length” field indicate the transmission length in multiples of the “negotiated_segment_len” (rounded up to the nearest integer). Using such a fixed coding for the transmission length conflicts with the desired feature of allowing arbitrary file lengths. However, since the “negotiated_segment_len” will be at least 512 B, this coding can describe files as long as 231×512 B−1 TB, which should be large enough to cover most files for the foreseeable future. Note that the exemplary signaling of the present invention only caries the “transmission_length” for the application and (virtual) circuit; and is designed to work irrespective of how long the file may be. In an alternative embodiment, the most significant bit could be set to 1 to indicate an alternative coding of the transmission length. Two options for describing longer transmission lengths are now introduced. First, if the remainder of the “transmission_length” field was all 0s, then a specific opportunity (e.g. the first) could be set so it is as short as possible, i.e. its transmission volume matches the transmission length. Second, the “transmission_length” field could be considered to consist of all information leading up to the “Separator”. The transmission length could use bit stuffing to prevent it containing a 32b word of all zeros (which would match the “Separator”), or it could be encoded in a type-length-value format.
§4.3.3.4 Committing to One Transfer Opportunity
§4.3.3.5 Aborting Transfers
§4.3.3.6 Short File Transfer
§4.3.4 Transmission Constraint Determination
§4.3.5 Pre-Transmission Data Preparation
A second alternative technique employs a common method of framing in which each chunk indicates if more chunks are to follow. This approach is used in the segmentation of IP and AAL5, and AALs ¾ extend it to identify whether the cell is the beginning of, a continuation of, or the end of, a message. Unfortunately, with this second alternative framing technique, the type field has low entropy (in the information theory sense) and consequently wastes bandwidth (it usually set to indicate that there are more chunks). Not only does it waste bandwidth, but it also constitutes an unnecessary processing load in that the source must set its value, and the destination must check its value.
U = N ± N 2 - 4 E H 2 E For example, if E=10−9 (as is typical with fiber) and H=64 (e.g. a 32-bit CRC plus 32-bit sequence numbers), the overhead is minimal for a transmission unit of length 31623 B, and is less than 1% over the range [800 B, 1.2 MB]. Since this range covers feasible transmission unit lengths (1500 B to 64 KB). Therefore, the transmission overhead from retransmission-based error control is negligible.
§4.3.6 Bulk Transmission
§4.3.7 Error Detection, Notification and Recovery
In practice, the source would retransmit information as soon as it can without interfering with its commitment to the rate of the original transmission process. By the source honoring its commitment to the transmission rate, it inherently protects the transfer from denial of service attacks. Note that retransmitting information may require fetching information from the disk in an order different from the order in which it is stored in the file, and so may reduce the rate at which the source can transmit information. This should be a non-issue for files stored on hard disks, since they are often fragmented across the disk in any case, but may be significant for files stored on read-only compact disks, or on tape. This should be taken into account when considering, for flow control purposes, the maximum rate at which the source can transmit. In an alternative scheme, the source may defer all retransmissions until after the entire file has been transmitted once. This scheme is possible because of the large sequence number space, which covers volumes of the order of terabytes ((232=4 G)×1 KB=4 TB). Note that since retransmissions may be carried over a connectionless (e.g., TCP) network, the destination can exert flow control if it is ever not ready to receive them. Another alternative design would be to send the retransmissions with the transmissions over the (virtual) circuit, and send any transmissions that are in excess of the committed (virtual) circuit interval over the secondary (e.g., connectionless, packet-switched) network. This alternative technique is not preferred since it would complicate the receiver process (which could no longer expect to receive chunks with increasing sequence numbers), and would be susceptible to denial of service attacks.
§4.3.7 Security Issues
Patent CitationsCited PatentFiling datePublication dateApplicantTitleUS4375097 *May 15, 1980Feb 22, 1983Texas Instruments IncorporatedTransparent intelligent network for data and voiceUS5181199 *Aug 31, 1990Jan 19, 1993Hitachi, Ltd.Packet switching systemUS5394398 *Aug 24, 1993Feb 28, 1995Siemens AktiengesellschaftMethod and circuit arrangement for the transmission of message cells within an ATM networkUS5487072 *Jun 30, 1994Jan 23, 1996Bell Communications Research Inc.Error monitoring algorithm for broadband signalingUS5490251 *Aug 9, 1991Feb 6, 1996First Data Resources Inc.Method and apparatus for transmitting data over a signalling channel in a digital telecommunications networkUS5535221 *Aug 13, 1992Jul 9, 1996Fujitsu LimitedFrame length control in data transmission using ATM networkUS5563939 *Dec 9, 1993Oct 8, 1996At&TMethod and system for delivering a communication serviceUS5610904 *Mar 28, 1995Mar 11, 1997Lucent Technologies Inc.Packet-based telecommunications networkUS5668812 *Sep 20, 1995Sep 16, 1997Fujitsu LimitedApparatus for detecting and controlling loss of ATM cellUS5818852 *Nov 20, 1996Oct 6, 1998Kapoor; VijayPacket data communication method and systemUS6016319 *Sep 11, 1996Jan 18, 2000Lucent Technologies, Inc.Communications system for transmission of datagram packets over connection-oriented networksUS6151319 *Dec 19, 1996Nov 21, 2000Lucent Technologies Inc.Connectionless message service using ATM routersUS6198752 *Dec 30, 1998Mar 6, 2001Samsung Electronics Co., Ltd.ATM video telephone terminal interworking with ISDNUS6483853 *Oct 5, 1999Nov 19, 2002Lucent Technologies Inc.Communications system for transmission of datagram packets over connection-oriented networksUS6496481 *Jul 16, 1998Dec 17, 2002Industrial Technology Research InstituteData transfer method for wire real-time communicationsUS6516000 *Apr 29, 1999Feb 4, 2003Lucent Technologies Inc.Communications system for transmission of datagram packets over connection-oriented networksUS6522635 *May 28, 1996Feb 18, 2003Mobile Satellite Ventures, LpCommunication protocol for satellite data processingUS6549533 *Dec 30, 1998Apr 15, 2003Objective Systems IntegratorsManaging switched virtual circuits in a networkUS6603796 *Mar 10, 1999Aug 5, 2003Nec CorporationRadio communication system and transmission and/or reception apparatus for use in the systemUS6802064 *Mar 24, 2000Oct 5, 2004Kabushiki Kaisha ToshibaData transfer request processing scheme for reducing mechanical actions in data storage systemUS6870874 *Apr 25, 1995Mar 22, 2005Canon Kabushiki KaishaCommunication apparatusUS7230940 *Jul 25, 2005Jun 12, 2007Psion Teklogix Inc.Wireless communication systemUS7457274 *May 30, 2007Nov 25, 2008Psion Teklogix Inc.Wireless communication system employing an intermediate protocol layerUS7876725 *Nov 18, 2008Jan 25, 2011Psion Teklogix Inc.Wireless communication system for enabling communication between a mobile device and a network deviceUS20010023438 *Jan 17, 2001Sep 20, 2001Hironobu IshidaMethod, apparatus, and recording medium for controlling image data transferUS20010047421 *Jul 23, 2001Nov 29, 2001Sitara Networks, Inc. A Delaware CorporationEnhanced network communicationUS20020064167 *Nov 29, 2000May 30, 2002Khan Farooq UllahHybrid ARQ with parallel packet transmissionUS20020165014 *May 4, 2001Nov 7, 2002Vikram RaiInformation delivery method for communication systemsUS20040120322 *Dec 1, 2003Jun 24, 2004Fujitsu Network Communications, Inc., A California CorporationTransmission slot allocation method and map for virtual tunnels in a transmission lineUS20040190471 *Apr 14, 2004Sep 30, 2004Bender Paul E.Method and apparatus for rapid assignment of a traffic channel in digital cellular communication systemsUS20050027859 *Aug 12, 2004Feb 3, 2005Lorenzo AlvisiMethod, apparatus and system for maintaining connections between computers using connection-oriented protocolsUS20050237994 *Jun 28, 2005Oct 27, 2005Mo-Han FongDual protocol layer automatic retransmission request scheme for wireless air interfaceUS20070002818 *Sep 6, 2006Jan 4, 2007Nortel Networks LimitedEnhanced ARQ with OFDM modulation symbolsGB2254529A * Title not available* Cited by examinerNon-Patent CitationsReference1 *Banks et al. (Frame Relaying Service opportunity, Private Switching Systems and Networks, 1988. International Conference on Jun. 21-23, 1988 pp. 105-110).2 *Intel Local Network Architecture; Ryan, R.; Marshall, G.D.; Beach, R.; Kerman, S.R.; Micro, IEEE vol. 1 , Issue: 4 Digital Object Identifier: 10.1109/MM.1981.290892 Publication Year: 1981.3 *Performance Analysis of Two Multichannel Fast Retransmission Schemes for Delay-Sensitive Flows; YL Chung-Vehicular Technology, IEEE Transactions 2010.4 *Performance Analysis of Two Multichannel Fast Retransmission Schemes for Delay-Sensitive Flows; YL Chung—Vehicular Technology, IEEE Transactions 2010.* Cited by examinerReferenced byCiting PatentFiling datePublication dateApplicantTitleUS8583977 *Jul 2, 2012Nov 12, 2013Aspera, Inc.Method and system for reliable data transferUS8732559 *Jul 25, 2006May 20, 2014Thomson LicensingRecovery from burst packet loss in internet protocol based wireless networks using staggercasting and cross-packet forward error correctionUS8996945Nov 11, 2013Mar 31, 2015Aspera, Inc.Bulk data transferUS9209938 *Apr 4, 2014Dec 8, 2015Thomson LicensingRecovery from burst packet loss in internet protocol based wireless networks using staggercasting and cross-packet forward error correctionUS20090327842 *Jul 25, 2006Dec 31, 2009Hang LiuRecovery from burst packet loss in internet protocol based wireless networks using staggercasting and cross-packet forward error correctionUS20120272115 *Jul 2, 2012Oct 25, 2012Michelle Christine MunsonBulk data transferUS20140351676 *Apr 4, 2014Nov 27, 2014Thomson LicensingRecovery from burst packet loss in internet protocol based wireless networks using staggercasting and cross-packet forward error correctionUS20150229340 *Apr 17, 2015Aug 13, 2015Thomson LicensingRecovery from burst packet loss in internet protocol based wireless networks using staggercasting and cross-packet forward error correctionUS20150264407 *Jun 1, 2015Sep 17, 2015Thomson LicensingRecovery from burst packet loss in internet protocol based wireless networks using staggercasting and cross-packet forward error correctionUS20150312002 *Jul 9, 2015Oct 29, 2015Thomson LicensingRecovery from burst packet loss in internet protocol based wireless networks using staggercasting and cross-packet forward error correction* Cited by examinerClassifications U.S. Classification370/428, 370/477, 370/473International ClassificationH04L12/56, H04L1/18, H04L1/22, H04L29/06, H04L12/54, H04L29/08Cooperative ClassificationH04L67/06, H04L69/329, H04L1/22, H04L1/1809, H04L47/10, H04L47/34, H04L29/06European ClassificationH04L29/08N5, H04L1/22, H04L29/06, H04L47/10, H04L47/34Legal EventsDateCodeEventDescriptionSep 10, 2002ASAssignmentOwner name: POLYTECHNIC UNIVERSITY, NEW YORKFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:VEERARAGHAVAN, MALATHI;MOORS, TIMOTHY CHRISTOPHER;REEL/FRAME:013275/0919;SIGNING DATES FROM 20020822 TO 20020827Owner name: POLYTECHNIC UNIVERSITY, NEW YORKFree format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNORS:VEERARAGHAVAN, MALATHI;MOORS, TIMOTHY CHRISTOPHER;SIGNING DATES FROM 20020822 TO 20020827;REEL/FRAME:013275/0919Jul 18, 2007ASAssignmentOwner name: POLYTECHNIC UNIVERSITY, NEVADAFree format text: LICENSE;ASSIGNOR:INTELLECTUAL VENTURES HOLDING 19, LLC;REEL/FRAME:019562/0644Effective date: 20060413Owner name: POLYTECHNIC UNIVERSITY,NEVADAFree format text: LICENSE;ASSIGNOR:INTELLECTUAL VENTURES HOLDING 19, LLC;REEL/FRAME:019562/0644Effective date: 20060413Jul 27, 2007ASAssignmentOwner name: INTELLECTUAL VENTURES HOLDING 19, LLC, NEVADAFree format text: CORRECTIVE ASSIGNMENT TO CORRECT THE LICENSOR AND LICEN;ASSIGNOR:POLYTECHNIC UNIVERSITY;REEL/FRAME:019605/0045Effective date: 20060413Owner name: INTELLECTUAL VENTURES HOLDING 19, LLC,NEVADAFree format text: CORRECTIVE ASSIGNMENT TO CORRECT THE LICENSOR AND LICENSEE PREVIOUSLY RECORDED ON REEL 019562 FRAME 0644. ASSIGNOR(S) HEREBY CONFIRMS THE LICENSE AGREEMENT;ASSIGNOR:POLYTECHNIC UNIVERSITY;REEL/FRAME:019605/0045Effective date: 20060413Owner name: INTELLECTUAL VENTURES HOLDING 19, LLC, NEVADAFree format text: CORRECTIVE ASSIGNMENT TO CORRECT THE LICENSOR AND LICENSEE PREVIOUSLY RECORDED ON REEL 019562 FRAME 0644. ASSIGNOR(S) HEREBY CONFIRMS THE LICENSE AGREEMENT;ASSIGNOR:POLYTECHNIC UNIVERSITY;REEL/FRAME:019605/0045Effective date: 20060413Oct 11, 2011CCCertificate of correctionNov 24, 2014FPAYFee paymentYear of fee payment: 4RotateOriginal ImageGoogle Home - Sitemap - USPTO Bulk Downloads - Privacy Policy - Terms of Service - About Google Patents - Send FeedbackData provided by IFI CLAIMS Patent Services