Data transfer server with time slots scheduling base on transfer rate and predetermined data

• US 5,878,228 A
• Filed: 11/15/1996
• Issued: 03/02/1999
• Est. Priority Date: 11/15/1996
• Status: Expired due to Term

• Current Assignee: RPX Clearinghouse LLC (RPX Corporation)
• Original Assignee: Northern Telecom Limited (Nortel Networks Corporation)
• Inventors: Alexander, David Michael, Miller, Scott Edward
• Primary Examiner(s): Dinh, Dung C.
• Assistant Examiner(s): HO, CHUONG T
• Application Number:
  US08/749,687
• Time in Patent Office: 837 Days
• Field of Search: 370/392, 370/232, 370/252, 707/205, 395/200.47, 395/182.02, 395/849, 395/556, 369/60, 364/243, 364/238.6
• US Class Current: 709/235
• CPC Class Codes: H04L 1/1887 Scheduling and prioritising arrangements
• CPC Class Codes: H04L 67/00 Network arrangements or protocols for supporting network services or applications user-to-user messaging H04L51/00; network arrangements, protocols or services for supporting real-time applications in data packet communications networks H04L65/00
• CPC Class Codes: H04L 67/01 Protocols
• CPC Class Codes: H04L 67/04 specially adapted for terminals or networks with limited capabilities; specially adapted for terminal portability
• CPC Class Codes: H04L 69/28 Timers or timing mechanisms used in protocols
• CPC Class Codes: H04L 69/329 in the application layer [OSI layer 7]
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

This invention relates to a method and protocol to enable a simple, reliable and highly scaleable data transfer facility in a digital data network. A connectionless, unacknowledged data transfer protocol minimizes resource utilization at a data server and is combined with source rate control to reduce congestion in the intervening network. The data transfer server implementing the protocol, operates by defining a circular ordering of individual scheduling timeslots having zero or more download records. The server selects in sequence, at a predetermined rate, the individual scheduling timeslots, and services, responsive to the selected timeslot having at least one download record, each record therein according to parameters in that record. Servicing includes (I) sending, to the destination address, a download message which includes a block of data extracted from the identified data, based on the remaining data information; (ii) updating the remaining data information to reflect the block of data that was sent; and (iii) resheduling, based on the transfer rate and the predetermined rate, the download record into an appropriate one of the scheduling timeslots.

Claims

1. A method of operating a data transfer server, comprising the steps of:

defining a circular ordering of individual scheduling timeslots having zero or more download records, each of which includes information of remaining data to transfer from identified data, a transfer rate and a destination address;

selecting in sequence, at a predetermined rate, the individual scheduling timeslots; and

servicing, responsive to the selected timeslot having at least one download record, each record therein by;

(i) sending, to the destination address, a download message which includes a block of data extracted from the identified data, based on the remaining data information;

(ii) updating the remaining data information to reflect the block of data that was sent; and

(iii) resheduling, based on the transfer rate and the predetermined rate, the download record into an appropriate one of the scheduling timeslots;

whereby, in the servicing of each download record, successive download messages having respective blocks of data extracted from the identified data are sent at a rate less than or substantially equal to the transfer rate in that record.

2. A method as claimed in claim 1, wherein the circular ordering of individual scheduling timeslots is a circular queue of the scheduling timeslots, each of which is data structure formatted as a list of the zero or more download records.

3. A method as claimed in claim 1, comprising the steps of:

receiving a download request message which references the identified data and specifies the transfer rate;

generating, responsive to confirming the identified data is available, a corresponding download record; and

inserting the corresponding download record into one of the scheduling timeslots.

4. A method as claimed in claim 3, wherein the identified data is available on a storage device;

and further comprising;

loading the identified data from the storage device into a cache memory; and

extracting, in the servicing of the corresponding download record, each block of data from the identified data in the cache memory.

5. A method as claimed in claim 4, comprising the step of:

generating a unique edition number associated with the identified data;

storing the edition number with the identified data loaded into the cache memory; and

providing the edition number in each download message whose block of data is extracted from the identified data in the cache memory.

6. A method as claimed in claim 5, comprising providing in each download message an indication of position for its block of data within the identified data.

7. A method as claimed in claim 1, wherein the step of rescheduling the download record includes:

discarding, responsive to the remaining data information indicating all the identified data has been transferred, the download record; and

inserting, responsive to the remaining data information indicating otherwise, the download record in the appropriate one of the scheduling timeslots.

8. A method as claimed in claim 3, wherein the download request message specifies the transfer rate by indicating a minimum interval period between sending the successive download messages.

9. A method as claimed in claim 3, wherein the download request message specifies a transfer unit size;

and the step of sending the download message includes;

extracting, from the identified data, the block of data having a size less than or substantially equal to the transfer unit size; and

constructing the download message which includes the block of data and the destination address.

10. A data transfer server, comprising:

means for defining a circular ordering of individual scheduling timeslots having zero or more download records, each of which includes information of remaining data to transfer from identified data, a transfer rate and a destination address;

means for selecting in sequence, at a predetermined rate, the individual scheduling timeslots; and

means for servicing, responsive to the selected timeslot having at least one download record, each record therein, the means for servicing including;

(i) means for sending, to the destination address, a download message which includes a block of data extracted from the identified data, based on the remaining data information;

(ii) means for updating the remaining data information to reflect the block of data that was sent; and

(iii) means for resheduling, based on the transfer rate and the predetermined rate, the download record into an appropriate one of the scheduling timeslots;

whereby, in the servicing of each download record, successive download messages having respective blocks of data extracted from the identified data are sent at a rate less than or substantially equal to the transfer rate in that record.

11. A data transfer server as claimed in claim 10, wherein the circular ordering of individual scheduling timeslots is a circular queue of the scheduling timeslots, each of which is data structure formatted as a list of the zero or more download records.

12. A data transfer server as claimed in claim 10, comprising:

means for receiving a download request message which references the identified data and specifies the transfer rate;

means for generating, responsive to confirming the identified data is available, a corresponding download record; and

means for inserting the corresponding download record into one of the scheduling timeslots.

13. A data transfer server as claimed in claim 12, wherein the identified data is available on a storage device;

and further comprising;

means for loading the identified data from the storage device into a cache memory; and

means for extracting, in the servicing of the corresponding download record, each block of data from the identified data in the cache memory.

14. A data transfer server as claimed in claim 13, comprising:

means for generating a unique edition number associated with the identified data;

means for storing the edition number with the identified data loaded into the cache memory; and

means for providing the edition number in each download message whose block of data is extracted from the identified data in the cache memory.

15. A data transfer server as claimed in claim 14, comprising means for providing in each download message an indication of position for its block of data within the identified data.

16. A data transfer server as claimed in claim 10, wherein means for rescheduling the download record includes:

means for discarding, responsive to the remaining data information indicating all the identified data has been transferred, the download record; and

means for inserting, responsive to the remaining data information indicating otherwise, the download record in the appropriate one of the scheduling timeslots.

17. A data transfer server as claimed in claim 12, wherein the download request message specifies the transfer rate by indicating a minimum interval period between sending the successive download messages.

18. A data transfer server as claimed in claim 12, wherein the download request message specifies a transfer unit size;

and the means for sending the download message includes;

means for extracting, from the identified data, the block of data having a size less than or substantially equal to the transfer unit size; and

means for constructing the download message which includes the block of data and the destination address.