AU4252300A - Data communication apparatus and method - Google Patents

Data communication apparatus and method Download PDF

Info

Publication number
AU4252300A
AU4252300A AU42523/00A AU4252300A AU4252300A AU 4252300 A AU4252300 A AU 4252300A AU 42523/00 A AU42523/00 A AU 42523/00A AU 4252300 A AU4252300 A AU 4252300A AU 4252300 A AU4252300 A AU 4252300A
Authority
AU
Australia
Prior art keywords
protocol
communication
data
node
printer
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.)
Granted
Application number
AU42523/00A
Other versions
AU762552B2 (en
Inventor
Koji Fukunaga
Kiyoshi Katano
Makoto Kobayashi
Atsushi Nakamura
Naohisa Suzuki
Jiro Tateyama
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Canon Inc
Original Assignee
Canon Inc
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Priority claimed from AU53921/98A external-priority patent/AU5392198A/en
Application filed by Canon Inc filed Critical Canon Inc
Publication of AU4252300A publication Critical patent/AU4252300A/en
Application granted granted Critical
Publication of AU762552B2 publication Critical patent/AU762552B2/en
Anticipated expiration legal-status Critical
Expired legal-status Critical Current

Links

Description

S&F Ref: 409477D1
AUSTRALIA
PATENTS ACT 1990 COMPLETE SPECIFICATION FOR A STANDARD PATENT
ORIGINAL
Name and Address of Applicant: Actual Inventor(s): Address for Service: Invention Title: Canon Kabushiki Kaisha 30-2, Shimomaruko 3-chome Ohta-ku Tokyo Japan Jiro Tateyama, Naohisa Suzuki, Koji Fukunaga, Kiyoshi Katano, Atsushi Nakamura and Makoto Kobayashi Spruson Ferguson St Martins Tower 31 Market Street Sydney NSW 2000 Data Communication Apparatus and Method The following statement is a full description of this invention, including the best method of performing it known to me/us:-
S
5845c TITLE OF THE INVENTION DATA COMMUNICATION APPARATUS AND METHOD BACKGROUND OF THE INVENTION Field of the Invention The present invention relates to data communication apparatus and method and, more particularly to data communication apparatus and method which performs data communication such that the communication protocol for data communication between a host device and a target device is not limited on the target device.
Further, the present invention relates to a data communication apparatus and method in a network where devices having a plurality of protocols are connected via a serial bus.
*e DESCRIPTION OF RELATED ART Various types of systems which transfer data to a printer via a bus are known. For example, a known technique is to output data from a computer to the printer by using a defacto standard interface such as a SCSI (Small Computer System Interface) or Centronics 1 -2interface.
However, printer manufacturers respectively provide a printer protocol unique to their printer for transferring data to the printer via these interfaces, thus lacking versatility.
Particularly, upon outputting print data by using a serial interface connecting various types of devices, such as an IEEE 1394 interface, it is desirable to solve the above problem of the lack of versatility.
(R:LIBE102844.doc:avc SUMMARY OF THE INVENTION In accordance with one aspect of the present invention, there is provided a data communication method for performing data communication on a serial bus,-said method s comprising the steps of: obtaining capability information of a usable communication protocol of a target device by communication using an initial protocol; o e [R:\LIDBE02844.doc:avc having said target device set a communication protocol which can be used in data communication, based on the obtained capability information; and performing the data communication with said target device based on the set communication protocol.
9 *9 9e *f [R:\LIBE]02844.doc:avc In accordance with another aspect of the present invention, there is provided a data communication method for performing data communication on a serial bus, said method comprising the steps of: s returning capability information to a host device in response to a request using an initial protocol from the host device; [R:\LIBEO02844.doc:avc -6setting a communication protocol to be used in data communication, in accordance with an instruction from said host device based on the capability information; and performing data communication with said host device based-on the set communication protocol.
o o *o [R \LIBE]02844.doc:avc -7- In accordance with another aspect of the present invention, there is provided a data communication apparatus for performing data communication on a serial bus, said apparatus comprising: communication means corresponding to an initial protocol and a-plurality of communication protocols for data communication; storage means in which capability information including information indicative of the plurality of communication protocols is stored; and setting means for setting a communication protocol of said communication means, (R:\LIBE)02844.doc:.av -8wherein said communication means sends the capability information stored in said storage means based on a request by using the initial protocol from a host device, and said setting means sets the communication protocol of said communication means in accordance with an instruction by using the initial protocol from the host device.
Other features and advantages of the present invention will be apparent from the following description taken in conjunction with the accompanying drawings, in which like reference characters designate the same name or similar parts throughout the figures thereof.
to [R:\LIBEO02844.doc:ivc -9- BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings which are incorporated in and constitute a part of the
S
*S (R:\LIBE102844.doc:avc specification, illustrate embodiments of the invention and, together with the description, serve to explain the principles of the invention.
Fig. 1 is a block diagram showing an example of a network system constructed with an IEEE 1394 serial interface; Fig. 2 is a block diagram showing the construction of the IEEE 1394 serial interface; Fig. 3A is an explanatory view showing address space of the IEEE 1394 serial interface; Fig. 3B is an example of the structure of a configuration ROM of a minimum format; Fig. 3C is an example of the structure of the configuration ROM of a general format; Fig. 3D is an example of the structure of the configuration ROM of a digital camera; Se f Fig. 4 is a cross-sectional view showing a cable *for the IEEE 1394 serial interface; ee Fig. 5 is a timing chart explaining a Data/Strobe Link method; Figs. 6 to 8 are flowcharts showing a procedure of network construction in the IEEE 1394 serial interface; Fig. 9 is a block diagram showing an example of the network; Figs. 10A and 10B are block diagrams explaining 10 bus arbitration; Fig. 11 is a flowchart showing a procedure of the bus arbitration; Fig. 12 is a timing chart showing transitional statuses in asynchronous data transfer; Fig. 13 is a diagram showing a packet format for the asynchronous transfer; Fig. 14 is a timing chart showing transitional statuses in isochronous data transfer; Fig. 15 is a diagram showing a packet format for the isochronous transfer; Fig. 16 is a timing chart showing transitional statuses in data transfer on the bus when the isochronous transfer and asynchronous transfer are mixedly performed; Fig. 17 is a schematic view showing the IEEE 1394 serial interface in comparison with an OSI model; Fig. 18 is an explanatory view showing the basic operation of a LOGIN protocol; Fig. 19 is an explanatory view showing connection status in the IEEE 1394 serial interface; Fig. 20 is a timing chart showing the flow of log-in operation; Fig. 21 is a schematic view showing a CSR prepared in respective devices; Fig. 22 is a flowchart showing LOGIN processing 11 in a host device; Fig. 23 is a flowchart showing LOGIN processing in a target device; Fig. 24 is an explanatory view showing the operation according to a second embodiment; and Fig. 25 is a schematic view showing the IEEE 1394 serial interface in comparison with an OSI model, in the second embodiment; Fig. 26 is a flowchart showing the LOGIN processing in a printer according to a third embodiment; Fig. 27 is a flowchart showing protocol search processing; Fig. 28 is a flowchart showing protocol majority decision processing performed by a protocol master, according to a fourth embodiment;
I
Fig. 29 is a flowchart showing the LOGIN processing in the host device; Fig. 30 is a flowchart showing the LOGIN processing in the printer; 31 is an example of the format of a printer map in a network constricted by a 1394 serial bus; a..
~Fig. 32 is an example of the format of unique ID's of nodes in a CSR architecture; Fig. 33 is an example of the format of a printer-map generation command; 12 Fig. 34 is a flowchart showing printer-map generation processing performed by the host device when a plurality of multi-protocol printers are connected to the network; Fig. 35 is a flowchart showing processing in a target device corresponding to the printer-map generation processing by the host device; Fig. 36 is a flowchart showing the LOGIN processing in the host device; Fig. 37 is a flowchart showing the LOGIN processing in the printer; Fig. 38 is a flowchart showing the majority decision processing in the host device; and Fig. 39 is a flowchart showing processing in the printer corresponding to the processing in Fig. 38.
.e DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Preferred embodiments of the present invention 20 will now be described in detail in accordance with the oo• accompanying drawings.
In the following first and second embodiments, a ~serial bus such as an IEEE 1394-1995 bus (High Performance Serial Bus) (hereinafter simply referred to as "1394 serial bus") is employed as a digital interface connecting the respective devices.
13 Accordingly, the outline of the 1394 serial bus will be described.
[Outline of 1394 Serial Bus] With the appearance of general digital video cam recorder (VCR) and digital video disk (DVD) player, there is a need for transferring realtime and large amount data such as video data and audio data (hereinafter referred to as "AV data"). To transfer AV data in realtime to a personal computer (PC) or other digital devices, an interface capable of high-speed data transfer is required. The 1934 serial bus has been developed from the above purpose.
Fig. 1 shows an example of a network system constructed with a 1394 serial bus. This system comprises devices A to H, and the devices A and B, the devices A and C, the devices B and D, the devices D and E, the devices C and F, the devices C and Gr and i. the device C and H are respectively connected by a twisted pair cable for the 1394 serial bus. These devices A to H may be computers such as a personal computer, or most computer-peripheral devices such as a digital VCR, a DVD player, a digital still camera, a storage device using a storage medium such as a hard disk or an optical disk, a monitor such as a CRT or an LDC, a tuner, an image scanner, a film scanner, a 14 printer, a MODEM, and a terminal adapter a Set- Top-Box, a digital television, a conference camera, a digital video system and a complex machine of them.
The connection between the devices may be made by intermixing a daisy chain method and a node branching method, thus realizing high-freedom of connecting.
The respective devices have an ID, and they construct a network by identifying each ID within a range connected by the 1394 serial bus. For example, the devices, respectively, take a relaying role when connected in a daisy-chain with cables for the 1394 serial bus, thus constructing a network.
As the 1394 serial bus corresponds to Plug and Play function, it automatically recognizes a device V6connected to the cable, thus recognizes connection status. In the system as shown in Fig. i, when a device is removed from the network, or a new device is added to the network, the bus is automatically reset the current network constructing information is reset), and a new network is constructed. This
*ICC
function enables realtime setting and recognition of network construction.
'06 0The 1394 serial bus has a data transfer speed 00 25 defined as 100/200/400 Mbps. A device having a high transfer speed supports a lower transfer speed, thus 15 maintaining compatibility. As data transfer modes, an asynchronous transfer mode (ATM) for transferring asynchronous data such as control signals, an isochronous transfer mode for transferring isochronous data such as realtime AV data are available. In data transfer, within each cycle (generally 125 ms/cycle), a cycle start packet (CSP) indicating the start of cycle is transferred, and then asynchronous and isochronous data are mixedly transferred such that the isochronous data transfer is transferred prior to the asynchronous data.
Fig. 2 shows the construction of the 1394 serial bus, as a layer structure. As shown in Fig. 2, a connector port 810 is connected to a connector at the end of a cable 813 for the 1394 serial bus. A physical layer 811 and a link layer 812 in a hardware unit 800 are positioned as upper layers with respect to the connector port 810. The hardware unit 800 compr-ises interface chips. The physical layer 811 performs coding, connection-related control and the like, and the link layer 812, packet transfer, cycle-time control and the like.
In a firmware unit 801, a transaction layer 814 manages data to be transferred (transaction data), and outputs commands Read, Write and Lock. A management layer 815 in the firmware unit 801 manages connection 16 statuses and ID's of the respective devices connected to the 1394 serial bus, thus manages the network construction. The above hardware and firmware units substantially construct the 1394 serial bus.
In a software unit 802, an application layer 816, differs in software used by the system, and the data transfer protocol indicating how to transfer data on the interface is defined by a protocol such as a printer protocol or an AVC protocol.
Fig. 3A shows address space of the 1394 serial bus. All the devices (nodes) connected to the 1394 serial bus have a unique 64 bit address. The 64 bit address is stored in a memory of the devices. Data communication with a designated destination device can be performed by recognizing the node addresses of the transmitting- and receiving-side nodes.
Addressing of the 1394 serial bus is made based on the IEEE 1212 standards, such that the bits are allocated for designating a bus number, then the next 6 bits are allocated for designating an node ID. The remaining 48 bits are allocated as an address •coo space of each device, thus this area is used as unique ~address space. The last 28 bits are allocated as a data area unique to each device, where an identifier, designated condition of use and the like of each device are stored.
17 As a basic function of a CSR (Command/Status Register) architecture for node management, a CSR core as shown in Fig. 3A exists on the register. In Fig. 3A, the offset address is a relative position from "OxFFFFF0000000". In the CSR architecture, a register relating to the serial bus is arranged from "OxFFFFF0000200". Further, information on node resources of the serial bus is arranged from "OxFFFFF0000800".
The CSR architecture has a configuration ROM for representing functions of the respective nodes. The configuration ROM has a minimum format and a general format, arranged from "OxFFFFF0000400". As shown in Fig. 3B, the minimum format configuration ROM merely shows a vendor ID which is a unique numerical value represented by 24 bits. As shown in Fig. 3C, the general format configuration ROM has information on a node. The vendor ID in this format is included, together with information on the function of the node, in a "rootdirectory". Further, "bus info block" and "root&unit leaves" include unique device number including the vendor ID, represented by 64 bits. The device number is used after network reconstruction by bus reset operation, to continue recognition of the node.
18 Fig. 3D shows an example of the configuration ROM of a digital camera. In Fig. 3D, the vendor ID is represented "node-vendorid", "chip id hi" and "chip idlo", by 64 bits.
The 1394 serial bus has the construction as described above. Next, the features of the 1394 serial bus will be described in more detail.
[Electrical Specification of 1394 Serial Bus] Fig. 4 shows'a cross-section of the cable of the 1394 serial bus. The 1394 serial cable comprises two sets of twisted pair signal lines and two power-source lines. This construction enables power supply to a device which lacks a power source, or a device where a voltage is degraded due to a failure or the like. The direct-current voltage supplied by the power-source lines is 8 to 40V; the current is maximum 1.5 Note that in the standards for so-called DV cable, four lines except the power-source line construct the cable.
[DS-Link] Fig. 5 is a timing chart explaining a DS-Link (Data/Strobe-Link) method as a data transfer method.
The DS-Link method, appropriate for high-speed serial data communication, requires two sets of two 19 signal lines. That is, one of the two sets of twistedpair signal lines is used for sending a data signal, and the other one set of twisted-pair signal lines is used for sending a strobe signal. On the receiving side, an EXCLUSIVE-OR between the data signal and the strobe signal is obtained so as to generate a clock signal. In the DS-Link transfer, it is unnecessary to mix a clock signal into a data signal, therefore, transfer efficiency is higher than that in other serial-data transfer methods. Further, as a clock signal is generated from the data signal and the strobe signal, a phase locked loop (PLL) circuit can be omitted, which attains downsizing of the scale of a controller LSI. Further, in the DS-Link transfer, it is unnecessary to send information indicative of idle status when there is no data to be transferred, therefore, a transceiver of each device can be set in a sleep status, which reduces electric consumption.
•e [Bus-Reset Sequence] eeo The respective devices (nodes) connected to the e* e 1394 serial bus are provided with a node ID, and are recognized as nodes constructing the network. For example, when increase/decrease of the number of nodes due to connection/disconnection or power ON/OFF status of network devices, network construction changes 20 and it is necessary to recognize a new network construction, the respective nodes detect the change of network construction, send a bus-reset signal onto the bus, and enter a mode for recognizing the new network construction. The detection of change of network construction is made by detecting change of bias voltage at the connector port 810.
When the bus-reset signal is sent from one node, the physical layer 811 of the respective nodes receives the bus-reset signal, and at the same time, notifies the link layer 812 of the occurrence of bus reset, and forwards the bus-reset signal to the other nodes. When all the nodes have received the bus-reset signal, a bus-reset sequence is started. Note that the bus-reset sequence is started when the cable is attached/detached, or the hardware unit 800 has detected network abnormity or the like. Further, the bus-reset sequence is also started by a direct instruction to the physical layer 811 such as host control by a protocol. As the bus-reset sequence is started, data transfer is suspended during the bus reset, and after the bus reset, the data transfer is !:.*restarted in the new network construction.
[Node-ID Determination Sequence] After the bus reset, the respective nodes start 21 to obtain a node ID so as to construct a new network construction. A general sequence from the bus reset to node-ID determination will be described with reference to the flowcharts of Figs. 6 to 8.
Fig. 6 is a flowchart showing a sequence from occurrence of bus-reset signal to node-ID determination and data transfer. At step S101, the respective nodes always monitor occurrence of busreset signal. When the bus-reset signal has occurred, the process proceeds to step S102, at which to obtain a new network construction in a state where the network construction has been reset, parent-child relation is declared between nodes connected to each other. Step S102 is repeated until it is determined at step S103 that the parent-child relation has been determined among all the nodes.
S.i As the parent-child relation has been determined, the process proceeds to step S104, at which one-"root .i (node)" is determined. At step S105, node-ID setting is performed so as tc provide an ID to the respective nodes. The node-ID setting is made in a predetermined order of the nodes. Step S105 is repeated until it is ~determined at step S106 that the ID's have been given to all the nodes.
a 25 As the node-ID setting has been completed, since the new network construction has been recognized by 22 all the nodes, data transfer among the nodes is possible. At step S107, data transfer is started, and the process returns to step S101, at which occurrence of bus-reset signal is monitored again.
Fig. 7 is a flowchart showing the sequence from the monitoring of bus-reset signal (S101) to the root determination (S104) in detail. Fig. 8 is a flowchart showing the node-ID setting (S105 and S106) in detail.
In Fig. 7, at step 3201, the occurrence of busreset signal is monitored, and as the bus-reset signal has occurred, the network construction is reset. Next, at step S202, as a first step for re-recognizing the reset network construction, the respective devices reset its flag FL with data indicative of "leaf (node)". At step S203, the respective devices examine the number of ports, the number of other nodes connected to them. At step 3204, based on the result of examination at step S203, the devices examine the number of undefined parent-child relation has not been determined) ports. The number of undefined oooo Sports is equal to that of the ports immediately after
S•
the bus reset, however, with the progress of determination of parent-child relation, the number of *seeundefined ports detected at step S204 decreases.
Only actual leaf (ves) can declare parent-child relation immediately after the bus reset. Whether or 23 not the node is a leaf is detected from the number of ports examined at step S203; if the number of ports is the node is a leaf. The leaf declares that "this node is a child, and the connected node is a parent" at step S205, then terminates the operation.
On the other hand, a node that detected at step S203 that the number of ports is "two or more" is a "branch". Immediately after the bus reset, as "undefined ports 1" holds, the process proceeds to step S206, at which the flag FL is set with data indicative of "branch", then declaration of parentchild relation from another node is waited at step S207. When the parent-child relation is declared from another node, the process returns to step S204 at which the branch examines the number of undefined ports. If the number of undefined ports is the branch can declare at step S205 that "this node is a :child, and the connected node is a parent" to the node connected to the remaining port. If the number of undefined ports is still "two or more", the branch •o waits for declaration of parent-child relation from another node at step S207.
When any one of the branches (or exceptionally leaf(ves) which delayed declaring a child) detects that the number of undefined ports is the parentchild declaration of the overall network has been 24 completed. The only node that has undefined port, the parent of all the nodes, sets the flag FL with data indicative of a "root" at step S208. Then at step S209, the node is recognized as a root.
In this manner, the procedure from the bus reset to the parent-child declaration among all the nodes in the network ends.
Next, a procedure of providing each node with an ID will be described. First, the ID setting is performed at the leaves. Then, ID's are set in numerical order (from node number: 0) from leaves branches -4 root.
In Fig. 8, at step S301, the process splits in accordance with node type, leaf, branch or root, based on the data set at the flags FL.
In case of leaf, at step 3302, the number of e "leaves (natural number) in the network is set to a variable N. At step S303, the respective leaves request a node number to the root. If a plurality of 20 requests have been made, the root performs arbitration ooo* at step S304, and provides a node number to one node at step S305, while notifies the other nodes of the result of acquisition of node-number indicating that the node number has been failed.
A leaf that has not obtained a node number (NO at step S306) repeats the request for node number at 25 step S303. On the other hand, a leaf that has obtained a node number notifies all the nodes of the obtained node number by broadcasting ID information including the node number. As the broadcasting of the ID information has been completed, the variable N indicative of the number of leaves is decremented at step S308. Then, from the determination at step S309, the procedure from step S303 to step S308 is repeated until the variable N becomes in the determination at step 3309. When ID information on all the leaves have been broadcasted, the process proceeds to step S310, for setting ID's of branches.
The ID setting for branches is performed substantially similar to the ID setting for the leaves.
First, at step S310, the number of branches (natural .number) is set to a variable M. At step S311, the respective branches request the root for a node number.
In response to the requests, the root performs arbitration at step S312, and provides a node number, subsequent to the last leaf node number, to a branch at step S313, while notifies the other branches of the ooo• result of acquisition of node-number indicating that the node number has been failed.
A branch that has not obtained a node number (NO 25 at step S314) repeats the request for node number at step 3315. On the other hand, a branch that has 26 obtained a node number notifies all the nodes of the obtained node number by broadcasting ID information including the node number. As the broadcasting of the ID information has been completed, the variable M indicative of the number of branches is decremented at step S316. Then, from the determination at step S317, the procedure from step S311 to step S316 is repeated until the variable M becomes in the determination at step S317. When ID information on all the leaves have been broadcasted, the process proceeds to step S318, for setting the ID of the root.
At this time, it is only the root that has not obtained a node ID. At step S318, the root obtains the smallest number that has not been provided to any other node as the node ID of the root, and at step 3319, broadcasts ID information on the root.
As described above, the procedure until the node "i ID's for all the nodes have been set ends. Next-, the sequence of node ID determination will be described with reference to the network example shown in Fig. 9.
In the network in Fig. 9, a node B as a root is directly connected to its lower nodes A and C; the node C is directly connected to its lower node D; and nodthe node DC is directly connected to its lower node D; and the node D is directly connected to its lower nodes B and F. The procedure of determining this hierarchical structure, the root node and the node ID's will be 27 described below.
After the bus reset has occurred, to recognize connection statuses of the respective nodes, parentchild relation is declared between ports of directly connected nodes. "parent" means a node at an upper level and "child" means a node at a lower level in the hierarchical structure. In Fig. 9, the node that first declared parent-child relation after the bus reset is the node A. As described above, nodes (leaves) where only one port is connected can start declaration of parent-child relation. That is, if the number of ports is it is recognized that the node is the end of the network tree, a leaf. The declaration of parent-child relation is started from the leaf which has first taken action among these leaves. Thus, a port of the leave node is set as a "child", while the port of another node connected to the leave node is set as a "parent". In this manner, "child-parent" :i relation is sequentially set between the nodes A and B, between the nodes E and D, and between the nodes F and
.D.
Further, among upper nodes having a plurality of ports, branches, parent-child relation is sequentially declared with respect to upper node (s) from the node that first received declaration of parent-child relation from the leaf. In Fig. 9, first 28 parent-child relation is determined between the nodes D and E and between the nodes D and F. Then the node D declares parent-child relation with respect to the node C, and as a result, a relation "child-parent" is set between the nodes D and C. The node C, that has received the declaration of parent-child relation from the node D, declares parent-child relation with respect to the node B connected to the other port, thus "child-parent" relation is set between the nodes C and B.
In this manner, the hierarchical structure as shown in Fig. 9 is constructed. The node B, that has finally become the parent at all the ports, is determined as a root. Note that a network has only one root. In a case where the node B that has received declaration of parent-child relation from the node A immediately declares parent-child relation with respect to another node, the other node, the node C, may be the root node. That is, any node may be a root depending upon timing of transmitting declaration of parent-child relation, and further, even in a network maintaining the same construction, a particular node is not always become a root.
*As the root has been determined, the sequence of determining the respective node ID's is started. Each node has a broadcast function to notify its ID 29 information to all the other nodes. ID information includes a node number, information on a connected position, the number of ports, the number of ports connected to other nodes, information on parent-child relation on the respective ports and the like.
As described above, the assignment of node numbers is started from the leaves. In numerical order, node number 0, 1, is assigned. Then, by the broadcasting of ID information, it is recognized that the node number has been assigned.
As all the leaves have obtained a node number, node numbers are assigned to the branches. Similar to the assignment of node numbers to the leaves, ID information is broadcasted from the branch that received a node number, and finally, the root broadcasts its ID information. Accordingly, the root always has the larger node number.
Thus, as the ID setting of the overall :'"hierarchical structure has been completed and the network has been constructed, then the bus :.initialization is completed.
[Bus Arbitration] S" The 1394 serial bus always performs arbitration 25 of bus use right prior to data transfer. The devices connected to the 1394 serial bus respectively relay a 30 signal transferred on the network, thus constructing a logical bus-type network transmitting the signal to all the devices within the network. This necessitates bus arbitration to avoid packet conflict. As a result of bus arbitration, one node can transfer data during a certain period.
Figs. 10A and 10B are block diagrams explaining the bus arbitration. Fig. 10A shows operation to request a bus use right; and Fig. lOB, operation to allow to use the bus.
When the bus arbitration is started, a single or plurality of nodes respectively request a bus use right to use the bus to its parent node. In Fig. the nodes C and F request a bus use right. The parent node (node A in Fig. 10A) that has received the request relays the request by further requesting a bus use right to its parent node. The request is forwarded to a root (node B in Fig. 10A) that finally performs arbitration.
20 The root that has received the request for bus ooo• use right determines the node to be provided with the bus use right. This arbitration can be performed only by the root. The node that dominated in the arbitration is provided with the bus use right. Fig.
10B shows that the node C has obtained the bus use right and the request from the node F has been 31 rejected.
The root sends a DP (data prefix) packet to nodes that lost in the bus arbitration so as to notify that their requests have been rejected. The requests from those nodes are held by the next bus arbitration.
Thus, the node that obtained the bus use permission starts data transfer.
The sequence of the bus arbitration will be described with reference to the flowchart of Fig. 11.
To start data transfer by a node, the bus must be in idle status. To confirm that data transfer has been completed and the bus is currently in idle status, each node detects a gap length of a predetermined idle period subaction gap) set in each transfer mode, and it determines whether or not the bus is currently in idle status based on the detection result.
At step S401, the node determines whether or not a predetermined gap length corresponding to asynchronous data or isochronous data to be transferred has been detected. So far as the node has not detected the predetermined gap length, it cannot request a bus use right to start data transfer, accordingly, the node waits until the predetermined gap length has been detected.
When the predetermined gap length has been detected at step S401, the node determines whether or 32 not there is data to be transferred at step S402. If YES, it issues a signal requesting a bus use right to the root at step S403. As shown in Fig. 10A, this signal requesting the bus use right is relayed by the respective devices in the network, and forwarded to the root. If it is determined at step S402 that there is no data to be transferred, the process returns to step S401.
At step S404, if the root has received a single or plurality of request signals for the bus use right, it examines the number of nodes requesting the bus use right at step S405. From the determination at step S405, if the number of the nodes requested the bus use right is one, that node is provided with bus use permission immediately after the requirement. On the other hand, if the number of the nodes is more than one, arbitration is performed to determine one node to be provided with the bus use right immediately a-fter the requirement. The arbitration does not always provide a bus use right to the same node, but equally 5.90 provides a bus use right to the respective nodes (fair ,955 arbitration) ~The processing at the root branches at step S407 into processing for the node dominated in the
S.
arbitration at step S406, and processing for the other nodes lost in the arbitration. In a case where there 33 is one node that requested the bus use right, or one node has dominated in the arbitration, the node is provided with a permission signal indicative of bus use permission at step 3408. The node starts data (packet) transfer immediately after it receives the permission signal (step 5410). On the other hand, the nodes that lost in the arbitration receive a DP (data prefix) packet indicative of rejection of the bus use request at step S409. The processing for the node that received the DP packet returns to step 5401 to request a bus use right again. Also, the processing for the node that completed data transfer at step S410 returns to step S401.
15 [Asynchronous Transfer] Fig. 12 shows sequence in the asynchronous transfer. In Fig. 12, the first subaction gap represents the idle status of the bus. At a point where the idle time has become a predetermined value, 20 a node which desires to perform data transfer requests 9o** a bus use right, then bus arbitration is executed.
When the use of bus has been allowed by the arbitration, data in the form of packet is transferred, and the node which receives the data sends a reception acknowledgment code ACK as a response, or sends a response packet after a short gap called ACK gap, thus 34 the data transfer is completed. The code ACK comprises 4-bit information and a 4-bit checksum. The code ACK, including information indicative of success, busy or pending status, is immediately sent to the data-sender node.
Fig. 13 shows a packet format for asynchronous transfer. The packet has a data area, a data CRC area for error correction, and a header area in which a destination node ID, a source node ID, a transfer data length and various codes are written.
The asynchronous transfer is a one-to-one communication from a sender node to a receiver node. A packet sent from the sender node is relayed by the respective nodes in the network, however, as these 15 nodes are not designated as the receiver of the packet, they ignore the packet, then only the receiver node designated by the sender node receives the packet.
[Isochronous Transfer] Isochronous transfer, which can be regarded as the greatest feature of the 1394 serial bus is appropriate to multimedia data transfer which requires realtime transfer of, especially, AV data.
Further, the asynchronous transfer is a one-toone transfer, whereas the isochronous transfer is a broadcasting transfer from one sender node to all the 35 other nodes.
Fig. 14 shows transition in the isochronous transfer. The isochronous transfer is executed on the bus in a predetermined cycle, called "isochronous cycle". The period of the isochronous cycle is 125 ms.
A cycle start packet (CSP) indicates the start of the isochronous cycle for synchronizing the operations of the respective nodes. When data transfer in a cycle has been completed and a predetermined idle period (subaction gap) has elapsed, a node which is called "cycle master" sends the CSP indicative of the start of the next cycle. That is, this interval between the issuance of CSP's is 125 ms.
As channel A, channel B and channel C in Fig. 14, 15 the respective packets are provided with a channel ID, so that plural types of packets can be independently 9.
transferred within one isochronous cycle. This enables substantially-realtime transfer among the plural nodes.
The receiver node can receive only data with a 20 predetermined channel ID. The channel ID does not indicate an address of the receiving node, but merely indicates a logical number with respect to the data.
Accordingly, one packet sent from a sender node is transferred to all the other nodes, broadcasted.
Similar to the asynchronous transfer, bus arbitration is performed prior to the packet 36 broadcasting in isochronous transfer. However, as the isochronous transfer is not one-to-one communication like the asynchronous transfer, the reception acknowledgment code ACK used as a response in the asynchronous transfer is not used in the isochronous transfer.
Further, an isochronous gap (iso gap) in Fig. 14 represents an idle period necessary for confirmation prior to isochronous transfer that the bus is in idle status. If the predetermined idle period has elapsed, bus arbitration is performed with respect to node(s) desiring isochronous transfer.
Fig. 15 shows a packet format for isochronous transfer. Various packets divided into channels 15 respectively have a data field, a data CRC field for error correction and a header field containing 9 information such as a transfer-data length, a channel No., various codes and error-correction header CRC as shown in Fig. [Bus Cycle] *i In practice, both isochronous transfer and asynchronous transfer can be mixedly performed on the 1394 serial bus. Fig. 16 shows transition in the isochronous transfer and asynchronous transfer mixedly performed on the 1394 serial bus.
37 The isochronous transfer is performed prior to the asynchronous transfer because after the CSP, the isochronous transfer can be started with a gap (isochronous gap) shorter than the idle period necessary for starting the asynchronous transfer.
Accordingly, the isochronous transfer has priority over the asynchronous transfer.
In the typical bus cycle as shown in Fig. 16, upon starting the cycle a CSP is transferred from the cycle master to the respective nodes. The operations of the respective nodes are synchronized by this CSP, and node(s) that waits for a predetermined idle period (isochronous gap) to perform isochronous transfer participates in bus arbitration, then starts 15 packet transfer. In Fig. 16, a channel e, a channel s and a channel k are transferred by the isochronous Stransfer.
The operation from the bus arbitration to the packet transfer is repeated for the given channels, 20 and when an isochronous transfer in the cycle #m has been completed, an asynchronous transfer can be i performed. That is, when the idle period has reached the subaction gap for the asynchronous transfer, node(s) that is to perform the asynchronous transfer participates in bus arbitration. Note that only if the subaction gap for starting the asynchronous transfer 38 is detected, after the completion of isochronous transfer and before the next timing to transfer the CSP (cycle synch), the asynchronous transfer can be performed.
In the cycle #m in Fig. 16, the isochronous transfer for three channels is performed, and then two packets (packet 1 and packet 2) including ACK are transferred by the asynchronous transfer. When the asynchronous packet 2 has been transferred, as the next cycle synch point to start the subsequent cycle m+l comes, the transfer in the cycle #m ends. Note that during the asynchronous or isochronous transfer, if the next cycle synch point to transfer the next CSP has come, the transfer is not forcibly stopped but continued. After the transfer has been completed, a CSP for the next cycle is transferred after a predetermined idle period. That is, when one isochronous cycle is continued for more than 125- ms, the next isochronous cycle is shorter than the 20 reference period 125 ms. In this manner, the isochronous cycle can be lengthened or shortened based on the reference period 125 ms.
However, it may be arranged such that the isochronous transfer is performed in every cycle, while the asynchronous transfer is sometimes postponed until the next cycle or the cycle further subsequent 39 to the next cycle, so as to maintain realtime transfer.
The cycle master also manages information on such delay.
[First Embodiment] Next, a first embodiment of the present invention will be described.
Fig. 17 shows the interface of the 1394 serial bus in comparison with respective layers of an OSI model often used in a LAN. In the OSI model, a physical layer 1 and a data link layer 2 respectively correspond to a physical layer 811 and a link layer 812 (both shown in Fig. 2) in a lower layer 4 of the 1394 serial bus interface. In the 1394 serial bus 15 interface, a transport protocol layer 5 and a presentation layer 6 as upper layers correspond to an upper layer 3 of OSI model including a network layer, a transport layer, a session layer and a presentation layer. Further, a LOGIN protocol 7, which is the feature of the present invention, operates between the lower layer 4 and the transport protocol layer 5 of ~the 1394 serial bus interface.
In Example 1 in Fig. 17, by providing the LOGIN protocol 7 to a device based on a serial bus protocol (SBP-2) 8 for a peripheral device such as a printer, the peripheral device uses a protocol based on the 40 protocol SBP-2 to notify a target device of data transfer with the target device. In Example 2, with respect to a device protocol 9 specialized on the 1394 serial bus interface, by providing the LOGIN protocol 7 to respective devices, the devices can determine whether or not the target device supports their protocol, with each other.
Fig. 18 shows the basic operation of the LOGIN protocol. When a printer device executes a print task 10 from a host device, the printer device first selects one of printer protocols A to C for data communication, based on communication by the LOGIN protocol 7. Thereafter, the printer device performs print data transfer in accordance with the selected 15 printer protocol. That is, upon connection between the printer device which supports a plurality of printer *o* protocols and a host device, the printer device first judges the transport protocol 5 of the host device ••co based on the LOGIN protocol 7, selects a printer protocol corresponding to the transport protocol 5 of the host device, and performs transfer/reception of ~print data or commands in accordance with the selected printer protocol, thus performs the print task Fig. 19 shows connection status in the 1394 serial bus, where devices (PC12, scanner 13 and VCR 14 etc.) with the LOGIN protocol 7 are connected to a 41 printer 11 corresponding to plurality of printer protocols. The printer 11 can process print tasks from the respective devices by changing the printer protocol in accordance with the transport protocol of a device that requests connection with the printer device.
Fig. 20 shows the flow of log-in operation.
At STEP i: The host device locks a target device (a multi-protocol printer in this case) The target device examines the capability of the hostdevice (including the transport protocol).
Note that the capability has been stored in a capability register 503 (to be described later) of the ,015 host device.
The target device sets the capability (including the transport protocol) of the host device.
•o At STEP 2: ••oa Print data is transferred by the protocol oo 20 determined at the STEP 1.
oooo At STEP 3: *.wt t tThe host device disconnects the connection with the target device.
Fig. 21 shows control/status register (CSR) which is prepared by a printer as the target device so 42 that the LOGIN protocol is installed, including a lock register 501, a protocol register 502 and the capability register 503. These registers are provided in predetermined addresses in initial unit space in the address space of the 1394 serial bus. That is, as shown in Fig. 3, within the 48-bit address area provided to the devices, "OxFFFFF" in the first bits is called "register space", wherein a register (CSR core) as the core of the CSR architecture is arranged in the first 512 bytes. Note that information common to devices connected via the bus is provided in this register space. Further, "0-OxFFFFD" is called "memory space", and "OxFFFFE", "private space". The private space is an address which can be freely used 15 in the device for communication among the devices.
The lock register 501 indicates a locked status of a resource, with a value indicative of log-in enable status, and any value but an alreadylogged-in and locked status. The capability register 503 indicates a protocol where each bit represents a protocol, with a value bit indicating that a corresponding protocol can be set, while a value "0" bit, that a corresponding protocol cannot be set. The protocol register 502 indicates a currently set protocol. That is, each bit of the protocol register 502 corresponds to each bit of the capability register 43 503, and the value of a bit of the protocol register 502 corresponding to the set protocol is Further, the protocol register 502 has an h bit indicative of a host device, a t bit indicative of a target device, a p bit indicative of a protocol master and an m bit indicative of a protocol for multi-login, as well as the bits indicative of the protocols.
The capability register 503 has an h bit indicative of possibility of becoming a host device, a t bit indicative of possibility of becoming a target device, a p bit indicative of possibility of becoming a protocol master and a reservation bit corresponding to the m bit of the protocol register 502, as well as the bits indicative of the settable protocols.
The protocol master is a device which obtains settable protocols in devices supporting the LOGIN protocol connected to the 1394 serial bus, performs majority decision on the obtained protocols, and notifies the respective devices of a protocol to be 20 used prior to the other protocols. If there are a plurality of devices which can be a protocol master, ~adjustment is performed among the nodes, to determine a protocol master.
Fig. 22 is a flowchart showing LOGIN processing in the host device.
To start the LOGIN processing, first, the data 44 of the lock register 501, the protocol register 502 and the capability register 503 of a target device a printer, to be logged-in, are checked by read transaction. At this time, from the data of the capability register 503, it is examined whether or not the target device supports a protocol used by the host device for communication (step S601) If the target device does not support the protocol of the host device, the LOGIN processing is terminated at step S602.
Further, if the data value of the lock register 501 is not it is determined that another device is in logged-in status, and the LOGIN processing is terminated. If the data value of the lock register 15 501 is it is determined that log-in is currently Spossible (step S602) In case of log-in enable status, the process moves to resource lock processing where the log-in is 9e1.
set by writing into the lock register 501 of the 20 printer by using lock transaction (step S603). The target device is locked in this status, and it is S ~uncontrollable from other devices and the register values cannot be changed.
a As described above, in the status where the resource of the target device is locked, protocol setting is performed next. The printer as the target 45 device of the present embodiment supports a plurality of printer protocols, the printer must be informed of the protocol which can be used by the host device before it receives print data. In the present embodiment, the protocol to be used is notified to the printer by setting the corresponding bit of the protocol register 502 of the printer by write transaction (step S604) At this point, as the protocol used by the host device for communication has been notified to the target device and the target device is in locked status, the host device that is currently logged in the target device performs data (print data in this case) transfer (step S605) 1 15 When the data transfer has been completed, the 0. 0: host device logs out from the printer by clearing the .00.
lock register 501 and the capability register 503 of 0 e• 00 the target device (step S606). Fig. 23 is a flowchart showing the LOGIN 0000 20 processing in the printer as the target device.
•coo The printer generally waits for log-in from a ~host device. As a print request from a host device is *j started by reading data values from the lock register 501, the protocol register 502 and the capability register 503 of the printer, the registers must be in read-enable status. This processing will be described 46 on the assumption that a host device which is to perform printout has locked the printer (step S701) The printer waits for notification of an available protocol from the host device (step S702) The printer receives the notification of available protocol in locked status so as to maintain the protocol register 502 unchanged by another device's request in mid-course of the log-in processing.
When the available protocol has been assigned (step S703), the printer switches its own protocol to the assigned protocol (steps S704, S706 and S708), and performs communication in accordance with the protocol of the host device (steps S705, S707 and S709) When the communication has been completed, the ".i15 printer confirms that the lock register 501 and the capability register 503 have been cleared (step S710), S"and returns to the log-in waiting status (step S701) o •o •[Second Embodiment] 20 Fig. 24 shows the operation according to a second embodiment of the present invention. Compared with the fitst embodiment as shown in Fig. 18, the second embodiment is applicable to a device having a protocol D in which is not installed in the LOGIN protocol 7. That is, to assure the device only corresponding to the protocol D AV/C protocol) 47 of print operation, as well as devices having the LOGIN protocol 7, the printer side has the protocol D.
In this case, if the printer recognizes, by a print request performed at the beginning of connection, that the host device does not assign a protocol in the LOGIN protocol 7, the printer tries communication with the host device by using the protocol D, and if the communication can be established, the printer executes the print task 10 in accordance with the protocol D.
Fig. 25 shows the IEEE 1394 serial interface according to the second embodiment in comparison with the OSI model. Example 3 uses, as a model, an AV device 15 based which uses the AV/C protocol. In the AV device 15, the LOGIN protocol 7 is not installed.
15 Example 4 uses, as a model, a scanner 16, in which the LOGIN protocol 7 is not installed, but a non-standard protocol (device specific protocol) for scanner is installed.
That is, regarding a device in which the LOGIN protocol 7 is not installed, if the printer can perform communication using the protocol of the device, the printer can perform print task from the device.
This increases the types of devices that can use the printer.
[Third Embodiment] 48 Fig. 26 is a flowchart showing the LOGIN processing in the printer according to a third embodiment of the present invention. Note that steps identical to those in Fig. 23 have the same step numbers, and detailed explanation of these steps will be omitted.
Generally, the printer is waiting for log-in by a host device (step S701). The log-in waiting status (step S701) becomes time-out status after a predetermined period, and at step S712, it is determined whether or not the printer is in time-out status. If the printer is logged in within the predetermined period and it is determined at step S712 that the printer is not in the time-out status, the processing as described in Fig. 23 is performed.
o: On the other hand, if the time-out status is .determined at step S712, the protocol of the host device is searched (step S713). Although the details of the protocol search will be described later, the protocol search is foc finding a node to be the host device and searching for the protocol, used by the host device, by using the node ID.
From the result of protocol search at step S713, it is determined at step S714 whether or not any one of protocols used by the printer corresponds to the protocol used by the host device. If it is determined 49 at step S714 that the printer corresponds to the protocol used by the host device, the protocol is set (step S703). On the other hand, if the printer does not correspond to the protocol used by the host device, the printer enters the log-in waiting status (step S701) That is, in the LOGIN processing in the printer in the third embodiment, when the printer is logged in and a protocol to be used is notified (step S702), or a protocol used by the corresponding printer is searched in accordance with the host device by protocol search (step S714), the protocol is set (step S705, S707, S709) The processing after the protocol setting is the same as that in Fig. 23. However, in a case where the protocol has been determined by the protocol search .(step S713), the printer has not been logged in, accordingly, log-out processing (step S710) is ifot performed. In this case, the printer enters the log-in waiting step (step S701) by reset of the bus, the host device or the printer.
Fig. 27 is a flowchart showing the above protocol search processing.
First, the total number of nodes on the bus is obtained (step S801). The total number of nodes on the bus is obtained from a topology map or the like, held 50 by a bus manager.
Next, it is determined whether or not the total number of nodes obtained at step S801 is effective (step S802). The determination is made such that if the total number of nodes is one or three or more, there is no other node than the current node, the total number of nodes is ineffective. In other words, only when the total number of nodes is two, the determination result is effective. If it is determined at step S802 that the total number of nodes is ineffective, it is determined that there is no acceptable protocol (step S807), then the process returns to the processing in Fig. 26.
On the other hand, if the total number of nodes is effective, a node ID of the communication :destination device (host device) is determined (step S803) As the total number of the nodes is two, if the o o node ID of the printer is the ID of the destination device is If the node ID of the ooo• printer is the destination device is In this manner, the node ID of the destination device is simply determined.
Next, a vendor ID of the host device is obtained (step S804). The vendor ID is obtained by reading the "nodevendorid", "chipid_hi" and "chipidlo" in the configuration ROM by transaction. As described above, 51 since the vendor ID has a numerical value unique to the device, the host device is specified from the vendor ID. Then, the protocol used by the host device is obtained from the specified device information (step S805) Next, it is determined whether or not any one of protocols used by the printer corresponds to the protocol used by the host device (step S806). If the printer does not correspond to the protocol, it is determined that there is no corresponding protocol (step S807), while if the printer corresponds to the protocol, it is determined that there is a corresponding protocol (step S808) and the process returns to the processing in Fig. 26. Accordingly, as S• 15 the result of protocol search, the existence/absence o of corresponding protocol is determined.
In this manner, by the processing shown in Figs 26 and 27, with regard to even a host device which does not perform log-in operation, the printer -20 specifies the protocol used by the host device from the vendor ID of the host device, and if the printer corresponds to the specified protocol, the printer performs communication with the host device by using the protocol.
[Fourth Embodiment] 52 Fig. 28 is a flowchart showing the protocol majority decision processing performed by a protocol master, processing to determine a protocol, which is supported by the greatest number of devices, to be used prior to the other protocols, according to a fourth embodiment of the present invention.
First, initialization processing is performed to count the number of protocols (step S811). Next, it is determined whether or not the information on all the nodes have been obtained (step S812) If the information on all the nodes have not been obtained, the content of the capability register 502 of the node of interest is read out, and settable protocols are counted (step S813). Among protocols available in the respective nodes, the number of protocols commonly used by a plurality of nodes are counted. As a protocol of the greatest number is a protocol used by the greatest number of nodes, this node should b- used priori to other nodes, then the process returns to step S812.
If it is determined at step S812 that the information on all the nodes have been obtained, initialization processing is performed (step S815) so as to notify a protocol to be used prior to the other protocols. Next, it is determined whether or not all the nodes have been notified of the protocol to be 53 used prior to the other protocols (step S816), and if YES, the process ends, while if NO, the protocol to be used prior to the other protocols is notified (step S817), then the process returns to step S816.
Fig. 29 is a flowchart showing the LOGIN processing in the host device. Note that the steps identical to those in Fig. 22 have the same step numbers, and detailed explanations of these steps will be omitted.
If the printer supports the protocol used by the host device for communication, it is determined whether or not the printer has already been logged in and the resource has been locked (step S611), by determining whether or not the value of the lock :4.00, 15 register 501 obtained at step S601 is If it is determined at step S611 that another device has logged in the printer (lock register 501 it is determined, from the content of the protocol register 502 obtained at step S601, whether or not the protocol oooo currently set in the printer is appropriate for multilogin (step S613). If it is determined at step 5613 that the protocol is appropriate for multi-login, the process proceeds to step S605, while if the protocol is not appropriate for multi-login, the process ends.
On the other hand, if it is determined at step S611 that another device has not logged in the printer 54 and the printer is in log-in enable status (lock register 501 the resource of the printer is locked (step S603) Next, as described with reference to Fig. 22, the protocol setting is performed. In the present embodiment, if both host device and printer support the protocol to be used prior to the other protocols, notified by the protocol master, this protocol is used prior to the other protocols. Further, if there is a protocol appropriate for multi-login among protocols supported by both host device and printer, the protocol appropriate for multi-login is used prior to the other protocols. Thus, as the protocol to be used has been determined, it is determined whether or not 9.
15 the protocol is that currently set in the printer (step S614). If the protocol is different from that currently set in the printer, protocol setting is o o performed at step S604to change the protocol. Note that if the LOGIN processing is required in the 9999 protocol used for communication, the host device uses the protocol, and performs the LOGIN processing at the beginning of data transmission at step S605. Further, in case of the protocol used for communication is appropriate for multi-login, the LOGIN processing is performed at the beginning of step S605.
When the data transmission has been completed, 55 as described with reference to Fig. 22, the host device clears the lock register 501 of the printer so as to release the resource lock status of the printer.
In a case where communication is performed by using the protocol appropriate for multi-login, the host device releases the resource lock status of the printer if another device does not log in the printer.
Fig. 30 is a flowchart showing the LOGIN processing in the printer (target device). Note that the steps identical to those in Fig. 23 have the same step numbers, and detailed explanations of these steps will be omitted.
The printer is logged in by the host device at step S701. Then it is determined whether or not :0.0o o 15 protocol notification has been received from the host device (step S721), if YES, the protocol designated from the host device is set (step S703) On the other hand, if it is determined at -step S- 3721 that the protocol notification has not been 20 received, the processing at step 3703 is not performed, the process proceeds directly to step S704.
see.
Thereafter, as described with reference to Fig.
23, communication is performed by the processing at steps 3704 to 3709. In a protocol appropriate for multi-login, log-in by a plurality of host devices are accepted. Then, when communication with all the host 56 devices has been completed, the printer confirms that the lock register 501 has been cleared by the host devices (step S710), and returns to the status waiting for log-i.n from a host device (step S701) [Fifth Embodiment] Fig. 31 shows the format of a printer map (or printer table) in a network constructed with the 1394 serial bus. The printer map contains a unique ID, a node ID, the status and capability of each printer node which has returned a response. The status indicates, the content of the protocol register 502 in Fig. 21, and the capability, the content of the capability register 503 in Fig. 21.
A. 15 Fig. 32 shows the format of the unique ID of a
S.
node in the CSR architecture. Fig. 33 shows the format of a printer-map (Fig. 31) generation command. The command is notified to a target device by write" transaction of asynchronous packet. The command as 20 shown in Fig. 33 is assigned in this protocol at a :predetermined address in the unit space of the target .in the 1394 address space.
Fig. 34 is a flowchart showing the printer-map generation processing performed by the host device when a plurality of multi-protocol printers are connected to the network.
57 Generally, various devices are connected to the network. In this situation, when an initiator (host device) tries printing, it is necessary to find nodes connected to the printer. Further, to obtain appropriate print output, it is very convenient to know the physical position, capability and excessive processing capability of the printer. Then, in this embodiment, the host device examines printers connected to the same network. For example, upon print output, the initiator (host device) obtains information on the physical positions, the capabilities and excessive processing capabilities of the printers on the network, (hereinafter also referred to as "topology/capability information") and S. 66 I. 6o 15 generates a printer map in advance, then selects a 66 S ~target printer based on the printer map.
go Hereinbelow, the printer-map generation processing by the host device will be described-with reference to Fig. 34. First, the host device
.SS
0.0 20 broadcasts the printer-map generation command (Fig.
:6 33) to generate the printer map (step S3001), and becomes into waiting status to wait for reception of response commands from the printers as target devices S 6 (step S3002) When the host device receives response commands from the target devices, it reads the contents of the 58protocol register 502 and the capability register 503 of the target devices which returned the response commands (step S3003). Then, the host device generates a printer map for the printers currently constructing the network (step S3004), based on the information obtained at step S3003.
Fig. 35 is a flowchart showing processing in the target device corresponding to the printer-map generation processing by the host device, the printer. First, the power of the printer is turned on, then the printer presents its status and capability (step S3101). More specifically, the printer sets the protocol register 502 and the capability register 503 in accordance with the current capability and status.
Accordingly, change of the status and capability within the printer are reflected on the status and capability registers presented at this step.
o Next, the printer becomes into waiting status to wait for reception of the printer-map generation 20 command from the host device (step S3102). Then, when the printer receives the printer-map generation command from the host device, returns the response command to the host device (step S3103) Fig. 36 is a flowchart showing the LOGIN processing in the host device. Note that the steps identical to those in Fig. 22 have the same step 59numbers, and detailed explanations of these steps will be omitted. That is, to start the LOGIN processing, the printer-map generation processing (step S621) shown in Fig. 34 is performed, then processing the same as that in Fig. 22 is performed.
Fig. 37 is a flowchart showing the LOGIN processing in the printer. Note that the steps identical to those in Fig. 23 have the same step numbers, and detailed explanations of these steps will be omitted. That is, the printer first performs the printer-map generation processing (step S731) shown in Fig. 35, then becomes into waiting status to wait for *log-in from the host device, and performs processing the same as that in Fig. 23.
[Sixth Embodiment] Next, a sixth embodiment of the present invention will be described. In the fifth embodiment, as described with reference to Figs. 34 and 35, when a plurality of printers are connected to a network, a host device generates a printer map on the printers connected to the network, and selects a target printer based on the printer map. In the sixth embodiment, in a case where a host device and a printer support a plurality of protocols on a network, further, a plurality of printers each supporting a plurality of 60 protocols are connected to the network, the host device examines protocols available for the respective printers, and determines a protocol supported by the greatest number of printers, as a protocol to be used.
Note that the processing in the sixth embodiment is the same as that in the fifth embodiment except the processing shown in Figs. 34 and 35, therefore, detailed explanation of the processing in the sixth embodiment will be omitted, and Hereinbelow, only the difference from the fifth embodiment will be described.
Fig. 38 is a flowchart showing the majority decision processing by the host device according to the sixth embodiment. Fig. 39 is a flowchart showing processing corresponding to that in Fig. 38. Note that 15 the steps identical to those in Figs. 34 and 35 have the same step numbers and detailed explanations of **.these steps will be omitted.
The processing in Fig. 38 is performed at-step 3621 in the LOGIN processing in the host device shown 20 in Fig. 36. The processing in Fig. 39 is performed at step S731 in the LOGIN processing in the printer shown in Fig. 37. As described above, both initiator (host device) and target device (printer) support a plurality of protocols, further, a plurality of printers each supporting a plurality of protocols are connected to the same network. In this case, the 61 initiator and the target devices must use the same protocol. To determine the protocol to be used, the initiator examines protocols available for the respective printers, and determines the protocol supported by the greatest number of printers as the protocol to be used. This processing is referred to as majority decision processing. In this manner, by performing the majority decision processing in the situation where a number of protocols are available, the protocols to be actually used is reduced. As a result, load due to protocol switching by the initiator can be reduced.
*T Next, the printer-map generation processing by the initiator (host device) and the target device (printer), and the majcrity decision processing by the initiator will be described with reference to Figs. 38 and 39.
When the printer-map generation has been completed (step S3004), the host device examines S 20 protocols available for the multi-protocol printers S-currently connected to the network, based on the generated printer map, and selects a protocol supported by the greatest number of printers (step S3005). Then the host device notifies the respective printers of the selected protocol by a protocol notification command (step S3006) 62 On the other hand, the printer returns a response to the printer-map generation command to the host device (step S3103), and enters in a waiting status to wait for reception of the notification command indicating the protocol to be used, from the host device (step S3104). When the printer receives the protocol notification command from the host device, it returns a response to the notification command to the host device, and sets the notified protocol to be used (step S3105) [Modifications of Embodiments] The above embodiments have been described in a case where a network is constructed by using the 15 serial bus based on the IEEE 1394 standards, however, the present invention is not limited to the 1394 serial bus. For example, the present invention is applicable to a network constructed by using an arbitrary serial interface such as a Universal Serial Bus (USB) Further, the identifier (ID) unique to each device may be an ASCII code, binary data, or a company name or personal name as a device owner. Further, the identifier may be a network address such as an Internet Protocol (IP) address or a Media Access Control (MAC) address. Further, the identifier may be 63 a variable identifier instead of unique identifier to each device, or may be an encryption key. That is, any information is included in the identifier of the present invention as long as it can be used for identifying each device.
Note that in the above embodiments, the printer has been mainly described as a target device or a host device on the network. However, the target device is not limited to the printer but may be any other device such as a monitor, a computer, a digital camera, a scanner, a digital video and an external storage device. Further, the target device is not limited to any special device model.
Further, in the printer map generation performed 15 at step S621 in Fig. 36, step S731 in Fig. 37 and step S3001 in Fig. 38, the network topology indicating the connection status of respective nodes is examined as shown in Fig. 9, and a display map is generated.- By judging such network topology, a printer and a protocol to be actually used are determined, not simply by majority decision, but in consideration of the network topology, the connection status of each node.
As described above, according to the third embodiment, the printer searches for the protocol of the host device, and if the printer corresponds to the 64 protocol, communication is performed by using the protocol. This adjusts a communication protocol with respect to even a host device which does not correspond to an initial protocol such as the LOGIN protocol.
Further, accor!_ng to the fourth embodiment, in a case where one of plural protocols is selected, degradation of efficiency can be prevented by reducing protocol change frequency. Further, occupation of a device can be prevented by using a protocol, which allows log-in by a plurality of devices, prior to the other protocols.
Further, according to the fifth embodiment, the host device examines information on printers connected :15 to the same network, positions on the network, capabilities, statuses and excessive processing capabilities, whereby selects a printer appropriate for a print purpose, thus obtains appropriate print output.
Further, according to the sixth embodiment, in a case where a number of protocols are available, the types of protocols to be actually used can be reduced by determining a protocol supported by the greatest number of printers as a protocol to be used. This reduces load due to protocol change by the host device.
65 [Other Embodiment] The present invention can be applied to a system constituted by a plurality of devices host computer, interface, reader, printer) or to an apparatus comprising a single device copy machine, facsimile).
Further, the object of the present invention can be also achieved by providing a storage medium storing program codes for performing the aforesaid processes to a system or an apparatus, reading the program codes with a computer CPU, MPU) of the system or apparatus from the storage medium, then executing the program.
:In this case, the program codes read from the 15 storage medium realize the functions according to the 0% 0 embodiments, and the storage medium storing the program codes constitutes the invention.
Further, the storage medium, such as a floppy disk, a hard disk, an optical disk, a magneto-optical disk, CD-ROM, CD-R, a magnetic tape, a non-volatile type memory card, and ROM can be used for providing the program codes.
Furthermore, besides aforesaid functions according to the above embodiments are realized by executing the program codes which are read by a computer, the present invention includes a case where 66 an OS (operating system) or the like working on the computer performs a part or entire processes in accordance with designations of the program codes and realizes functions according to the above embodiments.
Furthermore, the present invention also includes a case where, after the program codes read from the storage medium are written in a function expansion card which is inserted into the computer or in a memory provided in a function expansion unit which is connected to the computer, CPU or the like contained in the function expansion card or unit performs a part or entire process in accordance with designations of .e the program codes and realizes functions of the above :embodiments l .15 The present invention is not limited to the i above embodiments and various changes and modifications can be made within the spirit and scope of the present invention. Therefore, to appraise the public of the scope o1 the present invention, the following claims are made.
a 67

Claims (21)

1. A data communication method for performing data communication on a serial bus, said method comprising the steps of: obtaining capability information of a usable communication protocol of a target device by communication using an initial protocol; having said target device set a communication protocol which can be used in data communication, based on the obtained capability information; and performing the data communication with said target device based on the set o1 communication protocol.
2. The method as claimed in claim 1, wherein said target device corresponds to a plurality of communication protocols, and wherein the capability information includes information indicative of the plurality of communication protocols.
3. The method as claimed in claim 1, wherein said target device is a printer, and data communicated by the communication protocol is image data. 20
4. The method as claimed in claim 2, wherein said target device is an ink- jet printer, and the plurality of communication protocols of said target device are adapted to image formation by the ink-jet printer.
The method as claimed in claim 1, wherein data communicated by the 25 communication protocol is image data obtained by an image-sensing device.
6. The method as claimed in claim 1, wherein the serial bus is a bus adapted to or based on the IEEE 1934 standards.
7. The method as claimed in claim 6, wherein the capability information is stored in a CSR register in an address space of the IEEE 1394 standards, and wherein the communication protocol is set by using the CSR register.
8. The method as claimed in claim 1, wherein the serial bus is a bus adapted to or based on Universal Serial Bus standards. [R:\LIBE02844.doc:avc 69
9. The method as claimed in claim 1, wherein the initial protocol is executed at a layer higher than a data link layer of an OSI model.
10. A data communication method for performing data communication on a serial bus, said method comprising the steps of: returning capability information to a host device in response to a request using an initial protocol from the host device; setting a communication protocol to be used in data communication, in 0t accordance with an instruction from said host device based on the capability information; and performing data communication with said host device based on the set communication protocol.
11. The method as claimed in claim 10, wherein a plurality of communication protocols are available, 00. and wherein the capability information includes information indicative of the S" plurality of communication protocols. 20
12. The method as claimed in claim 10 or 11, wherein data communicated by the communication protocol is image data. *00e
13. The method as claimed in claim 11, wherein the plurality of communication protocols are adapted to image formation by an ink-jet printer.
14. The method as claimed in claim 10, wherein data communicated by the communication protocol is image data obtained by an image-sensing device.
The method as claimed in claim 10, wherein the serial bus is a bus adapted to or based on the IEEE 1394 standards.
16. The method as claimed in claim 15, wherein the capability information is stored in a CSR register in address space of the IEEE 1394 standards, and wherein the communication protocol is set by using the CSR register. (R:LIBEj02844.doc:avc
17. The method as claimed in claim 10, wherein the serial bus is a bus adapted to or based on Universal Serial Bus standards.
18. The method as claimed in claim 10, wherein the initial protocol is executed in a layer higher than a data link layer of an OSI model.
19. A data communication apparatus for performing data communication on a serial bus, said apparatus comprising: communication means corresponding to an initial protocol and a plurality of communication protocols for data communication; storage means in which capability information including information indicative of the plurality of communication protocols is stored; and setting means for setting a communication protocol of said communication means, wherein said communication means sends the capability information stored in 0said storage means based on a request by using the initial protocol from a host device, and said setting means sets the communication protocol of said communication means in accordance with an instruction by using the initial protocol from the host device. eve 0 20
20. A data communication method substantially as described herein in relation to any one embodiment with reference to the drawings. S** S 000
21. A data communication apparatus substantially as described herein in relation to any one embodiment with reference to the drawings. DATED this Ninth Day of June, 2000 Canon Kabushiki Kaisha Patent Attorneys for the Applicant SPRUSON FERGUSON [R:\LIBE102844.doc:avc
AU42523/00A 1997-02-14 2000-06-19 Data communication apparatus and method Expired AU762552B2 (en)

Applications Claiming Priority (5)

Application Number Priority Date Filing Date Title
JP9-30982 1997-02-14
JP9-89826 1997-04-08
JP9-89825 1997-04-08
JP9-112809 1997-04-30
AU53921/98A AU5392198A (en) 1997-02-14 1998-02-13 Data communication apparatus and method

Related Parent Applications (1)

Application Number Title Priority Date Filing Date
AU53921/98A Division AU5392198A (en) 1997-02-14 1998-02-13 Data communication apparatus and method

Publications (2)

Publication Number Publication Date
AU4252300A true AU4252300A (en) 2000-08-24
AU762552B2 AU762552B2 (en) 2003-06-26

Family

ID=3739897

Family Applications (1)

Application Number Title Priority Date Filing Date
AU42523/00A Expired AU762552B2 (en) 1997-02-14 2000-06-19 Data communication apparatus and method

Country Status (1)

Country Link
AU (1) AU762552B2 (en)

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CA2017458C (en) * 1989-07-24 2000-10-10 Jonathan R. Engdahl Intelligent network interface circuit
EP0596648A1 (en) * 1992-11-02 1994-05-11 National Semiconductor Corporation Network link endpoint capability detection
BR9509458A (en) * 1994-10-31 1998-01-06 Intel Corp M&A to exchange status data and commands over a hierarchical serial assembly using communication packages

Also Published As

Publication number Publication date
AU762552B2 (en) 2003-06-26

Similar Documents

Publication Publication Date Title
US6425019B1 (en) Data communication on a serial bus using an initial protocol which being executed in a transaction layer
US7213138B2 (en) Data transmission apparatus, system and method, and image processing apparatus
US6334161B1 (en) System for reverse data transmission flow control wherein command is transferred by asynchronous transfer mode while data is transferred by isochronous transfer mode
US7062579B2 (en) Data transmission apparatus, system and method, and image processing apparatus
US6603737B1 (en) Data transmission apparatus, system and method, and image processing apparatus
US7050184B1 (en) Data transfer apparatus and method, and data transfer system and medium
US6717694B1 (en) Data transmission apparatus, system and method, and recording medium
US20060020729A1 (en) Information processing apparatus and method that utilizes stored information about a mountable device
JP3630971B2 (en) Data communication method, apparatus, system, and storage medium
JPH10229544A (en) Image processing unit, its control method, image processing system, output device and storage medium
AU762552B2 (en) Data communication apparatus and method
JP3774540B2 (en) Data transfer method, image processing system and apparatus
US7397574B1 (en) Image processing controlling distribution of work among apparatuses based on apparatus performance
JP3774542B2 (en) Data processing method, data processing apparatus, printer, and storage medium
JP3495879B2 (en) Data processing method, data processing device, and computer-readable recording medium
JP3862349B2 (en) Information processing system, image processing system and method thereof, information processing apparatus, and computer-readable memory
JP3897773B2 (en) Communication method and communication apparatus
JP4058156B2 (en) Data processing method, data processing apparatus, printer, and storage medium
JPH10283135A (en) Data processing method, data processor, printer and storage medium
JPH11282645A (en) Image forming system, printing controller and its method
JP2000172470A (en) Device and method for print control
JP2000261468A (en) Device and method for connecting network
JP2001257685A (en) Information signal processor, information signal processing method and storage medium
JP2004030259A (en) Printing system

Legal Events

Date Code Title Description
FGA Letters patent sealed or granted (standard patent)