Method for transferring data to a plurality of modes connected in series by employing an intermediate mode and dividing the system into a plurality of virtual groups

• US 5,822,519 A
• Filed: 02/14/1996
• Issued: 10/13/1998
• Est. Priority Date: 07/19/1995
• Status: Expired due to Term

• Current Assignee: Fujitsu Limited
• Original Assignee: Fujitsu Limited
• Inventors: Watanabe, Kimio
• Primary Examiner(s): Barry, Lance Leonard
• Application Number:
  US08/601,079
• Time in Patent Office: 972 Days
• Field of Search: 340/825.02, 370/351, 370/408, 395/200.01, 395/200.15, 395/200.1, 395/200.11, 395/200.5, 395/200.51, 395/200.57
• US Class Current: 709/220
• CPC Class Codes: G06F 8/61 Installation
• CPC Class Codes: H04L 12/1854 with non-centralised forwarding system, e.g. chaincast

Abstract

A method of transferring information to a plurality of offices connected in series in a network includes the following steps. A step (a) is transferring the information from a server office to an intermediate office being substantially intermediate in the plurality of offices. A step (b) is setting the intermediate office which received the information in the step (a) to the server office. A step (c) is virtually dividing the plurality of offices into two groups which respectively include the server offices. And, a step (d) is repeating the steps (a) to (c) for each of the two groups.

Claims

1. A method of transferring information to a plurality of offices connected in series in a network, said method comprising the steps of:

(a) transferring said information from a first server office to an intermediate office being substantially intermediate in said plurality of offices;

(b) setting the intermediate office which received said information in the step (a) to be a second server office;

(c) virtually dividing said plurality of offices into two groups, each said group respectively including one of said server offices; and

(d) repeating said steps (a) to (c) for each of said two groups simultaneously.

2. The method as claimed in claim 1, wherein said method further comprises a step of previously storing in a memory which office in said plurality of offices is said intermediate office.

3. The method as claimed in claim 1, wherein said step (a) further comprises a step of calculating which office in said plurality of offices is said intermediate office based on a network architecture.

4. The method as claimed in claim 1, wherein said method further comprises a step of dividing said information into a plurality of blocks, and every time one block of said blocks is received in each office, transmitting said one block to a next office.

5. The method as claimed in claim 1, wherein said method further comprises the steps of:

returning a response indicating a regular completion of receiving said information from a first office which received said information to a second office which transferred said information to said first office; and

receiving a plurality of said responses in a third office from other offices following the third office, and returning said plurality of responses from the third office to a fourth office which previously transferred said information to the third office.

6. The method as claimed in claim 1, wherein said step (a) comprises a step of downloading software to said intermediate office.