Method and apparatus for executing communication in real-time and data structure for real-time data communication

• US 6,400,819 B1
• Filed: 03/26/1998
• Issued: 06/04/2002
• Est. Priority Date: 03/28/1996
• Status: Expired due to Fees

• Current Assignee: Hitachi, Ltd.
• Original Assignee: Hitachi, Ltd.
• Inventors: Iwasaki, Masaaki, Nakano, Takahiro, Takeuchi, Tadashi, Nakahara, Masahiko
• Primary Examiner(s): Chin, Wellington
• Assistant Examiner(s): Duong, Frank
• Application Number:
  US09/048,120
• Time in Patent Office: 1,531 Days
• Field of Search: 370/229, 370/230, 370/235, 370/345, 370/412, 370/429, 370/433, 370/445, 370/458, 370/462, 709/102, 709/103, 709/235, 710/24, 710/25, 710/29, 710/263
• US Class Current: 379/229
• CPC Class Codes: G06F 2209/484 Precedence
• CPC Class Codes: G06F 9/4881 Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
• CPC Class Codes: G06F 9/4887 involving deadlines, e.g. rate based, periodic
• CPC Class Codes: H04L 69/32 Architecture of open systems interconnection [OSI] 7-layer type protocol stacks, e.g. the interfaces between the data link level and the physical level
• CPC Class Codes: H04L 69/324 in the data link layer [OSI layer 2], e.g. HDLC
• CPC Class Codes: H04L 9/40 Network security protocols

Abstract

A data transfer management method and apparatus for reducing collision during data transfer. The invention stores a data length (m) in byte units of a plurality of packets capable of being transferred in a predetermined transmission time interval, stores the predetermined transmission time interval (t), accumulates the quantity of the packets to be transferred on a communication stream in the predetermined transmission time interval, and limits the quantity of the packets to be transferred to a value not greater then the data length (m).

Claims

1. A method of managing data transfer comprising the steps of:

storing a data length (M) in byte units of a plurality of transfer packets capable of being transferred within a predetermined transfer cycle;

storing said predetermined transfer cycle (t);

accumulating said transfer packets to be transferred through a stream line within said predetermined transfer cycle; and

limiting a quantity of said transfer packets to be transferred to a value not greater than said data length (m) by referring to said predetermined transfer cycle.

2. A method of managing data transfer according to claim 1, further comprises the step of:

limiting the quantity of said packets to be transferred within said predetermined transfer cycle to a value not greater than a difference obtained by subtracting a predetermined data length margin from said data length (m).

3. A method of-managing data transfer according to claim 2, further comprises the step of:

setting the data length (m) of a plurality of said packets capable of being transferred to a value obtained by multiplying first a bandwidth per unit time, which can be transferred in a LAN, by said predetermined transfer cycle, and then subtracting a data length margin from a product so obtained and dividing a balance by the number of nodes connected to said LAN.

4. A method of managing data communication comprising the steps of:

storing a plurality of transfer data of the data length (M) in byte units that can be transferred within a predetermined transfer cycle;

storing said predetermined transfer cycle (t);

accumulating a quantity of data to be transferred through a communication stream within said predetermined transfer cycle; and

limiting a quantity of said data to be transferred to said data length (m).

5. A method of managing data communication according to claim 4, further comprising the step of:

limiting the quantity of said data to be transferred within said predetermined transfer cycle to a value not greater than the balance obtained by subtracting a predetermined data length margin from said data length (m).

6. A method of managing data communication according to claim 4, further comprising the steps of:

setting time under a maximum data blank state, which is input by a client and is handled as time used consecutively, as time interval in which transfer of a series of data is to be completed;

setting an allowable time determined to be a considerably greater time by a server based on said consecutive use time; and

detecting whether the data received exceeds said consecutive use time.

7. A method of managing data communication according to claim 6, further comprising the step of:

subtracting a data transfer bandwidth from said data length (m) to cope with a request requesting use of said data transfer bandwidth from one of a plurality of clients connected to said communication stream.

8. A method of managing data communication according to claim 4, further comprising the steps of:

checking whether or not to release said data transfer bandwidth when non-reception of data is detected during said consecutive use time; and

adding said data transfer bandwidth to said data length when said data transfer bandwidth is released.

9. A method of managing data communication according to claim 4, further comprising the steps of:

accumulating allocated bandwidths when the bandwidths of said communication stream are allocated so as to cope with a request requesting use of the bandwidths of said data communication bandwidths so as to transmit a series of data from a plurality of clients connected to said communication stream;

checking whether or not to release allocated data communication bandwidths when non-reception of data is detected during a predetermined consecutive use time of a series of data transfer; and

subtracting a series of said data communication bandwidths from said accumulated bandwidths when said data communication bandwidths are released.

10. A node connected to a network comprising:

a storage for storing a data length (M) in byte units of a plurality of transfer packets capable of being transferred within a predetermined transfer cycle;

a storage for storing a predetermined transfer cycle (t);

an accumulator for accumulating the quantity of said packets to be transferred to a communication stream within said predetermined transmission time interval; and

a controller for limiting the quantity of said packets to be transmitted to a value smaller than said data length (m).

11. A node according to claim 10, wherein said controller limits the quantity of said packets to be transmitted within said predetermined transfer cycle to a value smaller than a balance obtained by subtracting a predetermined data length margin from said data length (m).

12. A node according to claim 10, wherein said data length (m) in byte units of a plurality of packets that can be transmitted is set to a quotient obtained by multiplying a bandwidth per unit time capable of being transmitted in a LAN by said predetermined, subtracting said data length (m) from a product and dividing a balance by the number of said nodes connected to said LAN.

13. A method of managing data transfer in a processor connected to a network, comprising the steps of:

(a) taking a transfer request command out of a transfer request queue having a plurality of transfer request commands;

(b) adding a quantity of transfer data for said transfer request command taken out to a local variable;

(c) storing said transfer request command in a transfer command queue if said local value is equal to or less than a predetermined maximum limit; and

(d) transferring said transfer request command from said transfer command queue if said local value is more than said predetermined maximum limit,

wherein said steps (a) to (d) are repeated at a predetermined transfer cycle.