US6549296B2 - Method and apparatus for simultaneous multicasting to a plurality of destinations - Google Patents
Method and apparatus for simultaneous multicasting to a plurality of destinations Download PDFInfo
- Publication number
- US6549296B2 US6549296B2 US09/092,867 US9286798A US6549296B2 US 6549296 B2 US6549296 B2 US 6549296B2 US 9286798 A US9286798 A US 9286798A US 6549296 B2 US6549296 B2 US 6549296B2
- Authority
- US
- United States
- Prior art keywords
- destination
- multicast
- call
- job
- destinations
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Lifetime, expires
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N1/32037—Automation of particular transmitter jobs, e.g. multi-address calling, auto-dialing
- H04N1/32053—Delayed transmission, e.g. to make use of reduced connection rates
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N1/32037—Automation of particular transmitter jobs, e.g. multi-address calling, auto-dialing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N1/32037—Automation of particular transmitter jobs, e.g. multi-address calling, auto-dialing
- H04N1/32064—Multi-address calling
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N1/00—Scanning, transmission or reproduction of documents or the like, e.g. facsimile transmission; Details thereof
- H04N1/32—Circuits or arrangements for control or supervision between transmitter and receiver or between image input and image output device, e.g. between a still-image camera and its memory or between a still-image camera and a printer device
- H04N1/32037—Automation of particular transmitter jobs, e.g. multi-address calling, auto-dialing
- H04N1/32074—Redialing, e.g. after failure to make a connection
Definitions
- the present invention relates to a multicast method and apparatus applicable to a communication apparatus such as telephone and facsimile with the multicast communication function and the redial function.
- telephone numbers of communication partners can be assigned and registered for a one touch button and a short number function.
- a facsimile with the multicast communication function a plurality of destinations of communication partners for the multicast communication are assigned for a one touch button or the short number function, and the number of destinations capable of being registered at the same time for a one touch button or the short number function reaches tens up to hundreds.
- a facsimile apparatus with the multicast communication function a plurality of jobs for the multicast communication can be registered. Some of such apparatus have the sequential transmission function in which one multicast communication starts while another one is hold for redial.
- FIG. 1A illustrates the case where the multicast communication (Job A) for multicasting paper document A to reception terminals D( 1 ) and D( 2 ), and the multicast communication (Job B) for multicasting paper document B to reception terminals D( 2 ) and D( 3 ) are registered, and reception terminal D( 2 ) is in a busy condition.
- Job A a redial interval occurs in the middle of Job A because reception terminal D( 2 ) is busy and not available for the line connection.
- Job B started during the redial interval, a call is performed to reception terminal D( 2 ) registered at the head of Job B.
- reception terminal D( 2 ) is still busy, a call is changed to terminal D( 3 ) of the next order because the line connection is not established as well as Job A.
- paper document B is transmitted.
- Job A after the redial interval passes, a call is performed again to reception terminal D( 2 ) to which a transmission is not performed.
- the busy condition of reception terminal D( 2 ) is dissolved during the redial interval, the transmission is completed and the job is finished.
- Job B after the redial interval passes, a call is performed to reception terminal D( 2 ) to which the transmission is not performed and paper document B is transmitted.
- FIG. 3A illustrates the case where two jobs are registered, where one is the multicast communication (Job A) for multicasting paper document A to reception terminals D( 1 ) and D( 2 ) by password transmission and another one is the multicast communication (Job B) for multicasting paper document B to reception terminals D( 3 ) and D( 4 ) by password transmission, reception terminal D( 1 ) is in a busy condition, reception terminal D( 2 ) is in an error condition caused by a line termination and reception terminal D( 3 ) is in an improper password condition.
- a communication error is caused in the middle of the communication to reception terminal D( 2 ) by a line termination, a call is performed to reception terminal D( 2 ) again immediately, and a transmission is performed.
- the redial interval is set for reception terminal D( 1 ) to which a communication is not performed because of busy condition.
- Job B is started when a condition of Job A changes to the redial interval.
- a password is transmitted to reception terminal D( 3 ) and a communication error occurs because the password is improper.
- a call is repeated to reception terminal D( 3 ) in a communication error, and a call destination is changed to the next one; reception terminal D( 4 ) after a certain number of continuously communication errors occur.
- the case occurs where, while one user is performing a multicast communication in which a plurality of destinations are registered, another user may register another multicast communication.
- the same destination as that registered in the multicast communication already performed may be overlapped and selected as a destination (D( 2 )) for the multicast communication registered later.
- a line connection is not established to destination (D( 2 )) because of busy condition and a redial interval for that is set by the first job
- a call is performed to destination (D( 2 )) by another multicast communication job registered later, it is obvious that the communication is not established and the job enters the redial interval.
- at least two redial interval occurs until two multicast communications finish, which means it takes a long time to finish transmissions.
- the present invention is carried out based on the facts described above and has the object to provide a multicast method and apparatus capable of saving a duration time consumed to finish a multicast communication for all destinations and preventing the occupation of line by the multicast communication, by calling primarily to a destination to which a connection or a communication is possible.
- a destination to which a line connection fails in the process of simultaneous multicast to a plurality of destinations is memorized, and when the memorized destination is included in another multicast communication stared later, a call to the destination is skipped and a call to another destination is primarily performed.
- a call to such destination is skipped. For instance, in the case where the connection is not established by busy condition, a call can be performed after the possibility of busy condition lowers, which permits to finish a job in a shorter time.
- a simultaneous multicast method of the present invention when a communication error occurs in the process of simultaneous multicasting to a plurality of destinations, in the case where a communication error to a destination is caused by the reason proper to call again, a call is repeated to the same destination, and in the case where a communication error to a destination is caused by the reason improper to call again, a call to the same destination is prevented. That is to say, a call is performed again to a recommunicatable destination, and a call is not performed again to an inrecommunicatable destination.
- a call to the same destination is not performed without useless calls. For instance in the case where a communication error is caused by an improper password, useless calls to the same destination are omitted. That results in reducing the time consumed to finish all of a plurality of multicast communications.
- the present invention provides a multicast communication apparatus comprising a multicast function to simultaneous multicast to a plurality of destinations, a redial function to set the redial interval for a destination to which a connection is not established, a memory in which error information of the destination to which a connection is not established is memorized, a delete function to delete the error information of the destination to which a connection is not established once then completed in the memory, a sequence function to start a plurality of multicast communications sequentially during the redial interval, and a function to control the call order to skip the destination which error information is registered in the memory.
- the present invention provides a communication apparatus comprising a multicast function to simultaneous multicast to a plurality of destinations, a redial function to set the redial interval for a destination to which a connection is not established, a sequence function to start a plurality of multicast communications sequentially during the redial interval, a memory in which the error type of the occurred communication error is memorized and a function to control not to call again the destination which error type is memorized as an inrecommunicatable one in the memory.
- the present invention provides a communication apparatus for multicast communicating comprising a function to simultaneous multicast the same paper document to a plurality of destinations, a function to set a redial interval for a destination to which a connection is not established for each paper document, a control section to control a call order, when a plurality of simultaneous multicasts are performed, in the case where a destination set a redial interval in a simultaneous multicast is included in destinations in another simultaneous multicast, to skip the destination in another simultaneous multicast.
- the present invention provides a communication apparatus for multicast communicating comprising a function to simultaneous multicast the same paper document to a plurality of destinations, a function to memorize an error information concerning a destination to which a connection is not established for each paper document, and a control section not to call to a destination which error type is memorized as an inrecommunicatable one in a simultaneous multicast and to shift to another simultaneous multicast processing when a plurality of simultaneous multicasts are performed.
- FIG. 1A is a sequence diagram illustrating a conventional first call sequence
- FIG. 1B is a sequence diagram illustrating a first call sequence in the embodiment of the present invention.
- FIG. 2A is a sequence diagram illustrating a conventional second call sequence
- FIG. 2B is a sequence diagram illustrating a second call sequence in the above embodiment of the present invention.
- FIG. 3A is a sequence diagram illustrating a conventional third call sequence
- FIG. 3B is a sequence diagram illustrating a third call sequence in the above embodiment of the present invention.
- FIG. 4 is a function diagram of a communication apparatus in the above embodiment of the present invention.
- FIG. 5 is configuration diagram of a fob administration file at a communication apparatus in the above embodiment of the present invention.
- FIG. 6 is a configuration diagram of a destination memory at a communication apparatus in the above embodiment of the present invention.
- FIG. 7A is a flow chart for the job A registration (to register job A) in the above embodiment of the present invention.
- FIG. 7B is a flow chart for the job B registration (to register job B) in the above embodiment of the present invention.
- FIG. 7C is a flow chart for the job B registration with password transmission (to register job B for transmitting with a password) in the above embodiment of the present invention
- FIG. 8 is a flow chart illustrating a part of a multicast communication in the above embodiment of the present invention.
- FIG. 9 is a flow chart to examine the communication start factors in a multicast communication in the above embodiment of the present invention.
- FIG. 10 is a flow chart to examine callable destinations in a multicast communication in the above embodiment of the present invention.
- FIG. 11 is a flow chart illustrating another part of a multicast communication in the above embodiment of the present invention.
- FIG. 12 is a flow chart illustrating another part of a multicast communication in the above embodiment of the present invention.
- FIG. 13 is another flow chart replaced with that in FIG. 12 .
- FIGS. 14A, 14 B, and 14 C are condition transition diagrams of the first part of the job administration file at a call pattern in FIG. 1B in the above embodiment of the present invention.
- FIGS. 15A and 15B are condition transition diagrams of the last part of the job administration file at a call pattern in FIG. 1B in the above embodiment of the present invention.
- FIGS. 16A, 16 B, and 16 C are condition transition diagrams of the first part of the job administration file at a call pattern in FIG. 3B in the above embodiment of the present invention.
- FIGS. 17A and 17B are condition transition diagrams of the last part of the job administration file at a call pattern in FIG. 3B in the above embodiment of the present invention.
- FIG. 1B, FIG. 2 B and FIG. 3B illustrate call sequences in the case where a plurality of multicast communications are registered at a communication apparatus in the embodiment of the present invention.
- destination D( 2 ) to which a connection is not established because of a busy condition in a multicast communication (job A) already started, is memorized. Then in the case where destination D( 2 ) to be called is detected as in a busy condition when another multicast communication (job B) starts, a call is performed to the next registered destination D( 3 ) to skip destination D( 2 )(in another multicast communication (job B)). A call to destination D( 2 ) skipped because of the busy detection is performed in the end of job B.
- job A if there is a job in which a destination on hold for redial (job A in this case) is registered or another registered multicast communication (no multicast communication except job A and job B is registered in this case), after the redial interval passes, job A starts again and a call to the destination D( 2 ) on hold for redial is performed. Otherwise the job shifts another registered multicast communication job.
- destination D( 2 ) to which a connection is not established because of a busy condition in a multicast communication (job A) already started, is memorized. Then in the case where destination D( 2 ) to be called is detected as in a busy condition when another multicast communication (job B) starts, a call is performed to the next registered destination D( 3 ) to skip destination D( 2 )(in another multicast communication (job B)). After a call to the last destination D( 3 ) is finished by skipping destination D( 2 ) because of the busy detection, the redial to destination D( 2 ) skipped without a call to destination D( 2 ) is registered (in job B). Then the job shifts to a job in which a destination hold for redial (job A in this case) is registered previously or another registered multicast communication job (no multicast communication except job A and job B is registered in this case).
- a communication errors occur in multicast communications (job A and job B) by line termination (call 2 in job A) and improper password (call 4 in job B).
- An error type is identified, and a call is performed immediately to destination D( 2 ), which error type of line termination suggests that recommunication is possible.
- An error type is identified, and when it suggests that recommunication is possible, for instance line termination, a call is performed immediately to a destination having such error type, in this case, to destination D( 2 )).
- a call is not performed to a destination D( 3 ) which error type of improper password suggests that recommunication is impossible, and a call is performed to the next destination D( 4 ).
- a call is not performed to a destination having such error type, in this case, to destination D( 3 ), and a call is performed to the next destination D( 4 ).
- FIG. 4 illustrates function blocks of a communication apparatus in the embodiment of the present invention.
- the communication apparatus illustrated in the figure comprises destination memory 1 in which destination information including telephone numbers of destinations assigned for a one touch button and a short number function are memorized, destination memory 2 to which destination information of destinations registered at a multicast communication is loaded from destination memory 1 , job administration memory 3 in which a job administration file of a multicast communication is memorized, panel section 4 which a user operates, control section 5 to provide various controls including a control of call sequences described above, recording section 6 to record reception image data and so on, read section to read a transmitted paper, image data memory 8 in which the image data for the read paper is memorized and transmitting and receiving section 9 .
- the communication apparatus is connected by line to each destination, D( 1 ) up to D( 4 ) via switching equipment 10 .
- FIG. 5 illustrates a configuration of a job administration file.
- job administration information is registered, which includes file number provided when a user registers a multicast communication, a communication condition of the job, call time, call destination registered by using a short number function and the like, error information caused in a call to a destination and left call numbers.
- FIG. 6 illustrates a data configuration of destination memory 1 . As illustrated in the figure, a plurality of destinations assigned and registered for a one touch button or a short number function and the corresponding telephone numbers are memorized.
- a user sets paper document A at read section 7 , selects the multicast communication function and inputs reception terminals D( 1 ) and D( 2 ) by using the short number function or the like at panel section 4 .
- the multicast communication function at operating panel section 4 one multicast communication (job) is registered.
- the selected reception terminal is registered to the job.
- the above operation content is provided from panel section 4 to control section 5 , then the multicast communication is registered as job A based on the flow chart in FIG. 7 A. That is, D( 1 ) and D( 2 ) are selected from destination memory 1 as a destination for the multicast communication, while paper document A is read at read section 7 and stored at image data memory 8 .
- Control section 5 generates job A for the selected destination and the image data of the stored paper document A.
- the file number is set at the job administration file of job A and stored at job administration memory 3 .
- the initial information for each destination is stored at job administration file A at job administration memory 3 and the destination pointer is set at the first destination D( 1 ).
- a user sets paper document B at read section 7 , selects the multicast communication function and inputs reception terminals D( 2 ) and D( 3 ) by using the short number function or the like at panel section 4 .
- the above operation content is provided from panel 4 to control section 5 , then the multicast communication is registered as job B based on the flow chart in FIG. 7 B. That is, D( 2 ) and D( 3 ) are selected from destination memory 1 from registered destinations, while paper document B is read at read section 7 and stored at image data memory 8 .
- Control section 5 generates job B for the selected destination and the image data of the stored paper document B.
- the file number is set at the job administration file of job B and stored at job administration memory 3 .
- the initial information for each destination is stored at job administration file B at job administration memory 3 and the destination pointer is set at the first destination D( 2 ).
- FIG. 3B in the case of multicast communicating by password transmission paper document A to reception terminals D( 1 ) and D( 2 ), the multicast communication is prepared according to the flow chart illustrated in FIG. 7A in the similar manner with the above-mentioned case.
- FIG. 3B illustrates the case of multicast communicating by password transmission paper document B to reception terminals D( 3 ) and D( 4 ). In this case, the multicast communication is prepared according to the flow chart illustrated in FIG. 7 C.
- a plurality of multicast communication are sequentially registered by one or plurality of users at a communication apparatus before the early registered multicast communication is not finished.
- the sequence is explained in the following, assuming job A and job B are registered as illustrated in FIG. 1 B.
- Control section 5 examines the communication start factors at the processing of step S 1 illustrated in FIG. 8 .
- FIG. 9 illustrates a flow chart for the to examine the communication start factors.
- FIG. 10 illustrates a flow chart to examine the callable destinations.
- job A capable of communicating
- the information of destination D( 1 ) set by a pointer is read from destination administration memory 3 (S 2 - 1 ).
- the job administration information of the destination set by a pointer is acquired at the processing of step S 1 - 4 .
- the left call number of destination D( 1 ) is examined using the job administration information (S 2 - 2 ). In this case, since the first call is performed at all jobs, the left call number keeps the initial value.
- destination D( 1 ) is registered in another job, i.e. job B (S 2 - 3 ).
- a call is performed first, it is confirmed that a call to destination D( 1 ) performed in (another job, i.e.) job B, is not finished in a busy condition. Accordingly it is decided that destination D( 1 ) is proper for a call, in job A. That is to say, destination D( 1 ) is callable.
- a call is started to callable destination D( 1 ).
- a call result of destination D( 1 ) is detected (S 4 ), then when destination D( 1 ) is not in busy and the line connection is established, the error information of destination D( 1 ) at job administration file A of job A stored at job administration memory 3 is deleted (S 5 ).
- paper document A is transmitted to destination D( 1 ) connected via transmitting and receiving section 9 (S 6 ).
- S 8 When it is detected that the transmission is finished (S 8 ), the presence or absence of communication error occurred is examined (S 9 ). In the case where the communication is completed without any communication error, the error information of destination D( 1 ) is deleted (S 10 ), and the left call number of destination D( 1 ) at job administration file A of job A is changed to zero (S 11 ).
- Control section 5 sets a destination pointer in job administration file of job A at the next destination D( 2 ) (S 13 ).
- FIG. 14 illustrates the conditions of job administration file A and B when the processing of step S 13 is finished.
- “completed” is set for the error information of destination D( 1 ) according to the communication result, and a pointer is set at destination D( 2 ).
- job administration file B of job B keeps the initial settings.
- a destination pointer is set at the first destination in job A (S 14 ). In this case, it is set at destination D( 2 ) which is not the first one as illustrated in FIG. 14 . Then the sequence shifts to step S 2 described above, and it is decided whether or not destination D( 2 ) is proper for call in the same manner as the case of destination D( 1 ). Since a call to destination D( 2 ) is the first one in both job A and another job, i.e. job B, as well as former destination D( 1 ), and not in a busy condition, it is decided that destination D( 2 ) is callable.
- FIG. 1B An example in FIG. 1B illustrates the case where a call to destination D( 2 ) is performed in job A and the connection is not established because of the busy condition.
- step S 4 it is decided that the destination is in busy, and the busy information is set for destination D( 2 ) at job administration file A at job administration memory 3 (S 15 ).
- the left call number of destination D( 2 ) at job administration file A is made two by decreasing one from the initial value (S 16 ). Shifting to the processing of S 12 , it is examined whether or not the left call numbers of all destinations registered in job A are zero (S 12 ). In this case, since the left call number of destination D( 2 ) at job administration file is two, a destination pointer is set at the next destination D( 1 ) in job A (S 13 ).
- the redial interval After the redial interval is set to job A, it is examined whether or not a job to execute is registered at job administration memory 3 (S 20 ). In this case, job B is registered to execute, control section 5 fetches the job administration information of job B to execute from job administration memory 3 (S 21 ). The communication condition set at job administration file B is examined (S 22 ), and if the condition is not in the redial interval, the same call sequence as that for job A is executed by shifting to step S 1 described above.
- job B input from panel section 4 is read as a start job from job administration memory 3
- destination information (D( 2 )) set by a destination pointer at job administration file B is read out (S 1 ).
- the left call number of destination D( 2 ) set by a destination pointer is examined from job administration file B (S 2 - 2 ). Since a call to destination D( 2 ) is the first one in job B and the left call number of destination D( 2 ) is still the initial value, the processing is shifted to step S 2 - 3 , and it is decided whether or not destination D( 2 ) presents in anther job, i.e. job A. Since destination D( 2 ) presents in job A, the error information of destination D( 2 ) at job administration file A of job A is examined (S 2 - 4 ).
- destination D( 2 ) set by a destination pointer in job B, is finished in a busy condition in job A (S 2 - 5 ). Because of it, it is decided at this point that destination D( 2 ) is improper for call, and a destination pointer at job administration file B is set at the next destination D( 3 ) (S 2 - 6 ).
- step S 2 the callable destination examination is perfrmed according to step S 2 . Since a call to destination D( 3 ) is the first one in all jobs, it is decided that the destination is callable. Accordingly in job B, a call to destination D( 2 ), which is finished in a busy condition in job A, is skipped, then a call is first initiated to destination D( 3 ) (S 3 ).
- FIG. 14B illustrates the conditions of job administration files A and B when a call to destination D( 2 ) is finished in a busy condition in job A, and a call to destination D( 3 ) is performed in job B.
- “busy” is set for the error information of destination D( 2 ) according to the communication result.
- the error information of destination D( 2 ) skipped in job administration file B keeps the initial settings.
- a destination pointer is set at destination D( 2 ) at the head in job administration file B.
- the processing is shifted from step S 14 to step S 17 , it is decided whether or not a call to destination D( 2 ) set by a destination pointer is first one in job B.
- the callable destination examination is not performed (S 2 ), and a call to destination D( 2 ) is initiated (S 3 ).
- FIG. 1B An example (illustrated) in FIG. 1B illustrates the case where a transmission to destination D( 2 ), which is once skipped in job B, completed. “Completed” is set for the error information of destination D( 2 ) at job administration file B as illustrated in FIG. 15A, and the left call number is set at zero.
- step S 11 in executing job B by setting the left call number of destination D( 2 ) of job administration file B at zero, it is decided the left call numbers of all destinations, i.e. D( 2 ) and D( 3 ) are zero (S 12 ), the processing is shifted to step S 20 .
- job administration file A of job A is read from job administration memory 3 (S 21 ). By examining the communication condition at job administration file A, it is found a redial interval is set (S 22 ). The current time is compared to the redial time (S 23 ), and when there is a time until the redial time, it is examined whether or not another job to execute is left at step S 20 . In the example illustrated in FIG. 1B, since no job to execute presents, no call is performed until the redial time.
- a destination pointer of job administration file A is set at destination D( 2 ) which left call number remains, and a call is performed to destination D( 2 ) without executing the callable destination examination at step S 2 (S 3 ).
- FIG. 15B illustrates the conditions of job administration files A and B when a communication to destination D( 2 ) is completed in job A.
- job A is finished. Further after it is confirmed at step S 20 that no job on hold presents, a series of multicast communications is finished.
- the destination (D( 2 )), to which a connection is not established in job A because of the busy condition, is memorized, in the case where the destination (D( 2 )) to be called in another multicast communication, i.e. job B, is already detected as in busy, a call is performed to the next registered destination by skipping the destination (D( 2 )). That allows to primarily communicate to a destination which connection possibility is relatively high, to decrease the duration time to finish job B compared to the conventional method, and to decrease the total duration time to finish job A and job B.
- the communications to all destinations or many destinations in the job may be finished during the redial interval of the already executed job, which permits to reduce the duration time to finish transmitting.
- a destination pointer is set at the first destination, which means it once rounds all destinations including the skipped one.
- the redial time is set without calling to the skipped destination (T 4 ) and the redial interval is set for the communication condition of job administration file B (T 5 ).
- the redial time is set without calling to the skipped destination (T 4 ), and the redial interval is set for the communication condition of job administration file B (T 5 ). Because of it, a call to a destination detected as busy is performed again after enough time passes, which improves to establish the connection.
- FIG. 3B a communication error caused by the line termination occurs during the transmission to destination D( 2 ) in job A, the occurred error is detected at the processing of step S 9 , and “line termination” is set for the error information of destination D( 2 ) at job administration file A (S 26 ).
- FIG. 16A illustrates the conditions of job administration files A and B after a call to destination D( 1 ) is finished in job A.
- FIG. 16B illustrates the conditions of job administration files A and B after the first call to destination D( 2 ) is finished in job A.
- step S 27 after the left call number of destination D( 2 ) at job administration file A is decreased, it is decided whether or not the communication error is caused by the reason proper to call again (S 28 ). For instance, in the case where the communication error is caused by the line termination, it is assumed that the possibility to connect and complete the communication is high. And in the case where a communication error is caused by the improper password in the password transmission, it is obvious that establishing the communication is impossible by calling again.
- FIG. 16C illustrates the conditions of job administration files A and B when a communication to destination D( 2 ) is completed in job A.
- a communication error is caused by the improper password when a call is performed to destination D( 3 ) in job B.
- “improper password” is set for the error information of destination D( 3 ) at job administration file B, and the left call number is decreased.
- it is decided whether or not a call should be performed again In the case where the error type shows “improper password”, it is decided a call should not be performed again, the processing is shifted to step S 1 , and the left call number of destination D( 3 ) is set at zero.
- FIG. 17A illustrates the conditions of job administration files A and B when a communication error is caused by “improper password”.
- FIG. 17B illustrates the conditions of job administration files A and B when a communication to destination D( 4 ) is finished.
- the error type is examined.
- a call to the same destination is performed again immediately.
- the left call number is set at zero so that a call is not performed later. That saves useless calls caused by calling to an inrecommunicatable destination repeatedly, and allows to reduce the duration time to finish the job.
- a call is shifted to the next (destination) without repeating the predetermined call number. That permits to reduce the duration time to complete the whole multicast communications including other multicast communications.
Abstract
Description
Claims (15)
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
JP16798997A JP3329695B2 (en) | 1997-06-10 | 1997-06-10 | Broadcast communication method and communication device |
JPJP9-167989 | 1997-06-10 | ||
JP9-167989 | 1997-06-10 |
Publications (2)
Publication Number | Publication Date |
---|---|
US20010043356A1 US20010043356A1 (en) | 2001-11-22 |
US6549296B2 true US6549296B2 (en) | 2003-04-15 |
Family
ID=15859746
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
US09/092,867 Expired - Lifetime US6549296B2 (en) | 1997-06-10 | 1998-06-08 | Method and apparatus for simultaneous multicasting to a plurality of destinations |
Country Status (3)
Country | Link |
---|---|
US (1) | US6549296B2 (en) |
JP (1) | JP3329695B2 (en) |
GB (1) | GB2328115B (en) |
Families Citing this family (1)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060109523A1 (en) * | 2004-11-23 | 2006-05-25 | Xerox Corporation | Method for generating multiple output formats for a scanned document |
Citations (14)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US4994926A (en) * | 1988-09-22 | 1991-02-19 | F-Mail Associates, L.P. | Facsimile telecommunications system and method |
JPH03130566A (en) | 1989-09-19 | 1991-06-04 | Agence Spatiale Europ | Consumable ignitor of solid propellant rocket motor |
JPH03139966A (en) | 1989-10-25 | 1991-06-14 | Nec Corp | Facsimile transmitter |
US5084770A (en) * | 1989-07-18 | 1992-01-28 | Konica Corporation | Image communication apparatus |
JPH04107040A (en) | 1990-08-28 | 1992-04-08 | Canon Inc | Data communication equipment |
EP0511467A2 (en) | 1991-04-30 | 1992-11-04 | International Business Machines Corporation | Apparatus and method of operation for a facsimile subsystem in an image archiving system |
JPH0514669A (en) | 1991-07-04 | 1993-01-22 | Mitsubishi Electric Corp | Facsimile equipment |
US5392133A (en) | 1992-06-30 | 1995-02-21 | Canon Kabushiki Kaisha | Apparatus and method for transmitting image data in a format adapted to a condition of a destination |
US5428457A (en) | 1991-06-18 | 1995-06-27 | Matsushita Graphic Communication Systems, Inc. | Image communication apparatus |
US5559611A (en) * | 1993-10-07 | 1996-09-24 | Audiofax, Inc. | Facsimile store and forward system with local interface |
JPH09130566A (en) | 1996-08-27 | 1997-05-16 | Matsushita Graphic Commun Syst Inc | Image communication equipment |
GB2312131A (en) | 1996-04-10 | 1997-10-15 | Samsung Electronics Co Ltd | Broadcast transmission in a facsimile system |
US5734704A (en) * | 1994-10-05 | 1998-03-31 | Canon Kabushiki Kaisha | Communication apparatus for communicating in accordance with information identifying device manufacturer |
US5852500A (en) * | 1988-08-12 | 1998-12-22 | Canon Kabushiki Kaisha | Image communication apparatus |
-
1997
- 1997-06-10 JP JP16798997A patent/JP3329695B2/en not_active Expired - Fee Related
-
1998
- 1998-06-08 US US09/092,867 patent/US6549296B2/en not_active Expired - Lifetime
- 1998-06-09 GB GB9812445A patent/GB2328115B/en not_active Expired - Fee Related
Patent Citations (16)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US5852500A (en) * | 1988-08-12 | 1998-12-22 | Canon Kabushiki Kaisha | Image communication apparatus |
US4994926B1 (en) * | 1988-09-22 | 1998-08-18 | Audiofax Ip L L C | Fascimilie telecommunications system and method |
US4994926C1 (en) * | 1988-09-22 | 2001-07-03 | Audiofax Ip L L C | Facsimile telecommunications system and method |
US4994926A (en) * | 1988-09-22 | 1991-02-19 | F-Mail Associates, L.P. | Facsimile telecommunications system and method |
US5084770A (en) * | 1989-07-18 | 1992-01-28 | Konica Corporation | Image communication apparatus |
JPH03130566A (en) | 1989-09-19 | 1991-06-04 | Agence Spatiale Europ | Consumable ignitor of solid propellant rocket motor |
JPH03139966A (en) | 1989-10-25 | 1991-06-14 | Nec Corp | Facsimile transmitter |
JPH04107040A (en) | 1990-08-28 | 1992-04-08 | Canon Inc | Data communication equipment |
EP0511467A2 (en) | 1991-04-30 | 1992-11-04 | International Business Machines Corporation | Apparatus and method of operation for a facsimile subsystem in an image archiving system |
US5428457A (en) | 1991-06-18 | 1995-06-27 | Matsushita Graphic Communication Systems, Inc. | Image communication apparatus |
JPH0514669A (en) | 1991-07-04 | 1993-01-22 | Mitsubishi Electric Corp | Facsimile equipment |
US5392133A (en) | 1992-06-30 | 1995-02-21 | Canon Kabushiki Kaisha | Apparatus and method for transmitting image data in a format adapted to a condition of a destination |
US5559611A (en) * | 1993-10-07 | 1996-09-24 | Audiofax, Inc. | Facsimile store and forward system with local interface |
US5734704A (en) * | 1994-10-05 | 1998-03-31 | Canon Kabushiki Kaisha | Communication apparatus for communicating in accordance with information identifying device manufacturer |
GB2312131A (en) | 1996-04-10 | 1997-10-15 | Samsung Electronics Co Ltd | Broadcast transmission in a facsimile system |
JPH09130566A (en) | 1996-08-27 | 1997-05-16 | Matsushita Graphic Commun Syst Inc | Image communication equipment |
Non-Patent Citations (1)
Title |
---|
Takahiko et al. Facsimile Intelligent Communication System FICS-1; Jul.-Aug. 1981. * |
Also Published As
Publication number | Publication date |
---|---|
US20010043356A1 (en) | 2001-11-22 |
GB9812445D0 (en) | 1998-08-05 |
JPH10341277A (en) | 1998-12-22 |
JP3329695B2 (en) | 2002-09-30 |
GB2328115A (en) | 1999-02-10 |
GB2328115B (en) | 1999-08-18 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US7688480B2 (en) | Automatic scanning parameter setting device and method | |
US5301035A (en) | Facsimile apparatus having redialing function | |
US6377357B1 (en) | Facsimile apparatus | |
US6549296B2 (en) | Method and apparatus for simultaneous multicasting to a plurality of destinations | |
JPH10145574A (en) | Facsimile equipment | |
US5134502A (en) | Data communication method and apparatus | |
US20060291005A1 (en) | Method of setting image reading conditions for an image reading apparatus and an image reading apparatus | |
JP3612961B2 (en) | Facsimile device | |
US6891861B1 (en) | Communication apparatus | |
US5721766A (en) | Communication apparatus able to call plural designated destinations | |
JP3184256B2 (en) | Image transmission device | |
JPH05276352A (en) | Joint original transmitter | |
EP0814597B1 (en) | Facsimile device and method for transmitting information using the same | |
KR0122444B1 (en) | A document transmitting method using a complex dial in a fax | |
US20080130062A1 (en) | Facsimile communication apparatus | |
JP3082490B2 (en) | Facsimile machine | |
KR100472432B1 (en) | Method for storing and transmitting fax data | |
JP3176764B2 (en) | Communication device | |
JPH03217166A (en) | Facsimile transmitting method | |
JPH07298022A (en) | Facsimile equipment | |
JPH01191552A (en) | Facsimile equipment | |
JPH05289959A (en) | Network controller | |
JPH09266511A (en) | Communication terminal device | |
JPH0795377A (en) | Method for increase of communication efficiency in multiport receptive fax | |
JPH06284178A (en) | Call originating device for communication equipment |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
AS | Assignment |
Owner name: MATSUSHITA GRAPHIC COMMUNICATION SYSTEMS, INC., JA Free format text: ASSIGNMENT OF ASSIGNORS INTEREST;ASSIGNOR:IPPONYARI, TADANORI;REEL/FRAME:009234/0969 Effective date: 19980413 |
|
STCF | Information on status: patent grant |
Free format text: PATENTED CASE |
|
FEPP | Fee payment procedure |
Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
FPAY | Fee payment |
Year of fee payment: 4 |
|
AS | Assignment |
Owner name: PANASONIC COMMUNICATIONS CO., LTD., JAPAN Free format text: MERGER;ASSIGNOR:MATSUSHITA GRAPHIC COMMUNICATION SYSTEMS, INC.;REEL/FRAME:021995/0195 Effective date: 20030114 |
|
FPAY | Fee payment |
Year of fee payment: 8 |
|
FEPP | Fee payment procedure |
Free format text: PAYER NUMBER DE-ASSIGNED (ORIGINAL EVENT CODE: RMPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY Free format text: PAYOR NUMBER ASSIGNED (ORIGINAL EVENT CODE: ASPN); ENTITY STATUS OF PATENT OWNER: LARGE ENTITY |
|
FPAY | Fee payment |
Year of fee payment: 12 |