CA2029259A1 - Data representation and protocol - Google Patents
Data representation and protocolInfo
- Publication number
- CA2029259A1 CA2029259A1 CA002029259A CA2029259A CA2029259A1 CA 2029259 A1 CA2029259 A1 CA 2029259A1 CA 002029259 A CA002029259 A CA 002029259A CA 2029259 A CA2029259 A CA 2029259A CA 2029259 A1 CA2029259 A1 CA 2029259A1
- Authority
- CA
- Canada
- Prior art keywords
- block
- information units
- information
- units
- control information
- 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.)
- Abandoned
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
- H04L49/9023—Buffering arrangements for implementing a jitter-buffer
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L49/00—Packet switching elements
- H04L49/90—Buffering arrangements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/08—Protocols for interworking; Protocol conversion
- H04L69/085—Protocols for interworking; Protocol conversion specially adapted for interworking of IP-based networks with other networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/08—Protocols for interworking; Protocol conversion
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L69/00—Network arrangements, protocols or services independent of the application payload and not provided for in the other groups of this subclass
- H04L69/22—Parsing or analysis of headers
Abstract
ABSTRACT
A data representation and protocol are provided to interface two networks. A plurality of information units to be transmitted from one network to another are formatted into a variable size block in accordance with the protocol. Each block contains a header field storing a total information unit count and a control information unit count. The remainder of the block stores the actual information itself, both control and data, in consecutive byte locations, with the actual control information located at the end of the block. The block can then be sent to another network for processing. A device in the other network need only reference the block header to determine whether the information contained in the block is control or data. This speeds the processing of large quantities of either all data information and/or control information.
A data representation and protocol are provided to interface two networks. A plurality of information units to be transmitted from one network to another are formatted into a variable size block in accordance with the protocol. Each block contains a header field storing a total information unit count and a control information unit count. The remainder of the block stores the actual information itself, both control and data, in consecutive byte locations, with the actual control information located at the end of the block. The block can then be sent to another network for processing. A device in the other network need only reference the block header to determine whether the information contained in the block is control or data. This speeds the processing of large quantities of either all data information and/or control information.
Description
~0292~9 Fiel~ of tho ~nvention S This invention relates to the interfacinq of two different types of computers or computer networks and, more particularly, to providing an efficient data representation and protocol which formats information units that are communicated between two networks.
Backqroun~ of t~e Invent~on In networking technology, it is known to use a "server" that functions as an interface between "clients" from different types of computers or networks. A server i~ a part hardware and a part software device designed to perform a specific function for multiple clients. The software that operates on a system such as a host computer of a network i5 referred to as a cllent. The multiple clients and the server all function in accordance with some predetermined protocol.
For example, when communicating information between networks, it is necessary to indicate the type of information such as user data or control information. This is often accomplished by appending a control/data indicator (C/D), e.g. a bit or set of bits, to the "actual" information itself. The entire piece of information including the actual information and the control/data indicator generally is termed an "information unit". Therefore, there can be control information units and data information units.
A problem is presented in how to effectively process ths informatlon units sent from one type of network to another type of network through a server. For example, a 9-b~t information unit used in one network, having bits <7:0> (the actual 2~2~9 information) and bit <8> (the C/D indicator), cannot be processed as a single information unit by an 8-bit (byte) oriented processor. Similarly, a network providing byte outputs and having a separate control/data indicator, cannot S directly communicate with a network requiring a C/D indicator bit appended to the byte of information.
A known solution for the above example is to expand the 9-bit information unit to a 16-bit value which can then be processed by a byte oriented (8-bit~ processor. This requires seven meaningless bits to be added to each 9-bit information unit which increases the memory space necessary in the server.
Further, the number of cpu cycles and consequently the time necessary to process the information units also increase. This is a result of having to independently, for each information unit received for processing, check whether the individual information unit contains control or data information.
Therefore, the overall speed of the communication and efficiency of the processor is decreased.
There is thus a need for an efficient data representation for interfacing between different computers or computer networks.
Bu~mary of the ~nYentio~
The present invention provides a method of interfac~ng two networks by forming a plurality of information units into a "block", in accordance with the protocol of the instant invention, that is to be sent by one of the networks to the other network. The information unit~ can be control information units or data information units.
Each block contains a header field that stores a total information unit count and a control information unit count.
These counts indicate the number of information units in the block and the number of those information units which contain 2~292~
control information, respectively. The remainder of the block stores the "actual information~ itself, both control and data, in consecutive byte locations, with the actual control information located at the end of the block as specified by the protocol.
A comparison of the values of the total information unit count and the control information unit count contained in the header field can indicate where the section of control information begins in each block. Further, because the block is formatted with the data information units "up front" in the block and the control ir.formation units at the "end" of the block, the size of a block varies depending upon the sequence of control or data information units received when forming the block.
In the instant invention, the server is described as being a lS part of one of the networks and co~pled directly to the other network. The server, as described herein, performs the protocol translation of the present invention for the networ~
to which it is connected. However, it i6 to be understood that the server could independently interface each network or the server could be a part of one networX coupling wit~ a server of the other network.
A blo~k can be created by either a client (to be sent to the server that interfaces with another network) or by a server (after having received the information from the other network).
When the information is received from the other network, the server converts the information into the block of the present invention. The information to be converted is preferably in the form of a fixed length block as described in copending application serial number , filed on even date herewith, the disclosure of which is hereby incorporated by reference.
2 0 2 9 2 A~ 3 Once the block is forwarded from either the client to the server or the server to the client, the exact number of data and control information units can easily be determined by referencing the two count values in the block header.
When the server, acting as an interface for an 8-bit network, receives the block from a client, it can reconstruct the information units to the appropriate 9-bit format required by the other network by appending the correct C/D indicator bit, 1.e. control or data information, as determined by the total information unit and control information unit counts in the block header.
Similarly, a server which constructs a block in accordance with the invention from information received from the other network, can send the block to the desired client for processing. The client need only reference the block header to determine whether the "actual information" in the blocX contains control or data information.
A further advantage of the present invention is that the blocks can be of variable size. They are only constrained by the protocol requiring that all control information units be at the end o~ the block. This speeds the processing of large quantities of either all data information and/or control information units.
Brlef Das~ription of the Drawings Figure l is a bloc~ diagram of the environment of the present invention.
Figure 2 is an example of the formats for m-bit and n-bit information unit of the present invention.
Figure 3 shows the data representation for a block of the present invention.
~292~9 Figure 4 is an example of a completed block according to the invention.
Detailed Description Figure 1 illustrates one example of a system 28 making use of the present invention. The system 28 includes a server 10 that interfaces two computer networks 12 and 14.
Network 12 is coupled to the server 10 through a bus 16 such as an Ethernet bus. Network 14 is shown coupled to the server 10 through serial line 22, for example, an optical fiber. The server is provided with server memory 21. Circuit switch 30 located ~n network 14 receives information from the server 10 via the fiber 22. The circuit switch 30 then couples the information, dependin~ upon a selected channel number, to any of a number of devices (not shown) in the network 14. For purposes of this description, assume that the protocol for network 14 requires that information be received in m-bit information units wherein bits <m-l:0> contain the actual infor~ation and bit <m> contains the C/D indicator.
Network 12 includeæ a plurality of devices 18, 20, coupled to the bus 16. These devices 18, 20 may be any type of intelli~ent device such as a host processor or intelligent peripheral. For example, the devices 18, 20 in network 12 can be n-bit or byte ~n=8) oriented processors that operate on n-bit information units. The software which operates on the devices 18, 20 is conceptually illustrated by blocks 24 and 26.
The~e software blocks 24 and 26 are referred to as "clients"
which interact with the server 10 in accordance with the protocol of the instant invention.
The protocol established for transferring information between the clients 24, 26 and the server 10 allows for the efficient communication of the information between n-bit oriented devices 18, 20 o~ network 12 (which provide n-bit information units) 29~259 and the network 14, which can only receive information in m-bit information units. The information is passed between the devices 18, 20 and the server 10 (through the clients 24, 26) as a set of information units referred to as a "block" in the S protocol. The block efficiently represents the information units to be communicated from one network 12, 14 to another.
.
Figure 2 shows the format for the m-bit and n-bit information units processed by the respective networks 14 and 12. As discussed above, the m-bit information unit uses the mth bit to indicate whether the lower ordered bits, ~(m-1):0> represent control or data information for that particular information unit. The n-bit information unit does not contain a C/D bit.
With an n-bit information unit, the protocol of the present invention i~ defined such that all control information units occur at the end o~ a block. When a client ~n the n-bit network forms a block, it knows, by any conventional manner, whether each n-bit information unit is a control or data information unit, thereby avoiding the use of a C/D bit.
Referring to Figure 3, there is shown an embodiment of a block 50 wherein the block 50 is arranged as a set of 32-bit longwords. A block header field is located in the first address 01 of the block 50. The header field contains ~ number of fields including a channel number field 71, control information unit count field 72 and a total information unit count field 70. Other control functions can also be implemented in the header field, e.g., a field to distinguish between different types of blocks, i.e., those containing commands and responses as opposed to representinq information;
a field indicating whether the information in the block 50 i5 continued in successive blocks, etc.
In one embodiment of the header field shown in Figure 3, bits ~10:0> indicate the channel number associated with the information; bits ~12:11> are reserved for other various control functions as discussed above; bits ~15:13> are the 2~2~2~
count of the number of control information units in the block 50; and bits ~31:16> maintain the total count of all of the information units contained in the block 50.
The block addresses 02 through 257 (d~cimal), following the header address 01, contain the actual information to be transferred. Because the protocol between the clients 24, 26 and server 10 requires all control information units to be at the end of t~e block (i.e~ an 8-bit system), there is no need to have separate C/D indicators as part of each information unit to indicate control or data.
The block 50 is constructed in either a device memory 19 or the server ~emory 21 by the client 24, 26 or the server 10, respectively, depending upon the direction of information transfer, i.e., from networ~ 12 to 14 or 14 to 12. Each block begins at a given address in either the device or server memory. Once a block is completed, the information in the block addresses can then be forwarded across the bus 16. For infor~ation being sent to the network 14, each byte of information in the block (constructed by the client in the device memory and sent to the server) is appended with a C/D
indicator by the server hardware as appropriately determined by a comparison of the count in the block header.
One example of the construction of a blocX 50 by a client 24 for transmission to network 14 is shown in Figure 4, wherein each n-bit information unit i5 assembled into the block 50.
The block 50 is represented by address locations, 01-04, in which the information units are written prior to transmission.
The header fields having the total information unit count field 70 and control information unit count field 72 indicates the number of data information units and control information units assembled in the block 50.
In this example, seven data information units, Dl-D7, are loaded by a client, e.g., client 26; into address locations 02 and 03 of the device memory 19. As required by the protocol, ~9~233 the control information units Cl-C3 immediately follow the data units Dl-D7. Thus, when assembling the block 50, the total information unit count increments from 0 to 7 for the data units Dl-D7 and then continues with the control units C1-C3.
The total information unit count field 70 therefore stores a value of ten. Similarly, control information unit count field 72, increments for each control information unit Cl-C3 received in the block 50. The control information unit count for this example therefore stores a value of three.
Because the protocol requires that all control information units must be located at the end of a block, the loading of another data information unit, D8 (not shown), would terminate construction of the previous block and begin the construction of a new bloc~. It is apparent that the most inefficient use of the blocks occurs where an alternating sequence of data and contrsl units are transmitted. In this case, a new block would be generated every two information units. More often, however, the two types of information, i.e., control or data, are comounicated in contiguous groups. The blocX representation allows effective grouping of the information units and provides a substantial savings in memory space located in the devices 18, 20 and the server 10. Further, the block allows efficient use of the network 12 resources.
After assembly, the completed block 50 is then sent to the server 10 via bus 16. The server 10 then reconstructs m-bit information units ~o be sent over serial line 22 to the computer network 14. This is accomplished by making reference to the header information. The counts 70, 72 in the header field determine whether information units are data or control information as described below.
In this example, by comparing t~e total information unit count 70 and control information unit count 72, the hardware (or software) of the server 10 deter~ines that the f~rst seven information units (Dl-D7) in the block 50 are data information units and the last three information units are control ~w~2~9 information units (Cl-C3), e.g., (10 total) - (3 control) = (7 data). In this manner, the correct mth bit (the C/D bit) can be appended to the information units Dl-D7 and Cl-C3 before they are forwarded to the m-bit protocol computer network 14, e.g., mth bit = 1 for control information or mth bit = o for data information.
In the illustrated example, the server 10 knows that information units Dl-D4 located in address 02 are all data information units and thus a O will be appended as each of their mth bits. As each bit is appended, the total information unit count 70 is decremented. Data information units D5-D7 located at address 03, i.e., in the first 24 bits <23:0>, will each be appended with a 0. At this point, the total information unit count 70 equals the value of the control information unit count 72, thereby signalling that the remaininq information units CloC3 are all control information units. Therefore, bits <31:24~ of address 03 represent control information and will be appended with an mth bit equaling 1.
Similarly, each control information unit C2-C3 located at address 04 will also be appended with a one. Once the control information unit count 72 decrements to zero, the transmission of the bloc~ 50 is completed. The use of the counts 70, 72 in the header 52 provides an indication of the boundary between the data information and the control information in the block.
2S The counts 70, 72 allow the appending of ~he correct mth bit to the (m - 1) bits of the information units~
Similarly for the transmission of information from network 14 to network 12, the information units are sent in a serial format to the server 10 over line 2~. The server 10 receives the information units and places them in ~he server memory 21.
The server then converts the received inform~tion units into the block of the present invention. In the preferred embodiment, the information in the server memory 21 to be converted is in the form of a fixed length block, the formation 5 of which is described in copending application serial no.
incorporated by reference above.
~92~
Once the variable size block is formatted, the server sends the block over the bus 16 to the intended device 18, 20 which can then process the information contained therein.
Backqroun~ of t~e Invent~on In networking technology, it is known to use a "server" that functions as an interface between "clients" from different types of computers or networks. A server i~ a part hardware and a part software device designed to perform a specific function for multiple clients. The software that operates on a system such as a host computer of a network i5 referred to as a cllent. The multiple clients and the server all function in accordance with some predetermined protocol.
For example, when communicating information between networks, it is necessary to indicate the type of information such as user data or control information. This is often accomplished by appending a control/data indicator (C/D), e.g. a bit or set of bits, to the "actual" information itself. The entire piece of information including the actual information and the control/data indicator generally is termed an "information unit". Therefore, there can be control information units and data information units.
A problem is presented in how to effectively process ths informatlon units sent from one type of network to another type of network through a server. For example, a 9-b~t information unit used in one network, having bits <7:0> (the actual 2~2~9 information) and bit <8> (the C/D indicator), cannot be processed as a single information unit by an 8-bit (byte) oriented processor. Similarly, a network providing byte outputs and having a separate control/data indicator, cannot S directly communicate with a network requiring a C/D indicator bit appended to the byte of information.
A known solution for the above example is to expand the 9-bit information unit to a 16-bit value which can then be processed by a byte oriented (8-bit~ processor. This requires seven meaningless bits to be added to each 9-bit information unit which increases the memory space necessary in the server.
Further, the number of cpu cycles and consequently the time necessary to process the information units also increase. This is a result of having to independently, for each information unit received for processing, check whether the individual information unit contains control or data information.
Therefore, the overall speed of the communication and efficiency of the processor is decreased.
There is thus a need for an efficient data representation for interfacing between different computers or computer networks.
Bu~mary of the ~nYentio~
The present invention provides a method of interfac~ng two networks by forming a plurality of information units into a "block", in accordance with the protocol of the instant invention, that is to be sent by one of the networks to the other network. The information unit~ can be control information units or data information units.
Each block contains a header field that stores a total information unit count and a control information unit count.
These counts indicate the number of information units in the block and the number of those information units which contain 2~292~
control information, respectively. The remainder of the block stores the "actual information~ itself, both control and data, in consecutive byte locations, with the actual control information located at the end of the block as specified by the protocol.
A comparison of the values of the total information unit count and the control information unit count contained in the header field can indicate where the section of control information begins in each block. Further, because the block is formatted with the data information units "up front" in the block and the control ir.formation units at the "end" of the block, the size of a block varies depending upon the sequence of control or data information units received when forming the block.
In the instant invention, the server is described as being a lS part of one of the networks and co~pled directly to the other network. The server, as described herein, performs the protocol translation of the present invention for the networ~
to which it is connected. However, it i6 to be understood that the server could independently interface each network or the server could be a part of one networX coupling wit~ a server of the other network.
A blo~k can be created by either a client (to be sent to the server that interfaces with another network) or by a server (after having received the information from the other network).
When the information is received from the other network, the server converts the information into the block of the present invention. The information to be converted is preferably in the form of a fixed length block as described in copending application serial number , filed on even date herewith, the disclosure of which is hereby incorporated by reference.
2 0 2 9 2 A~ 3 Once the block is forwarded from either the client to the server or the server to the client, the exact number of data and control information units can easily be determined by referencing the two count values in the block header.
When the server, acting as an interface for an 8-bit network, receives the block from a client, it can reconstruct the information units to the appropriate 9-bit format required by the other network by appending the correct C/D indicator bit, 1.e. control or data information, as determined by the total information unit and control information unit counts in the block header.
Similarly, a server which constructs a block in accordance with the invention from information received from the other network, can send the block to the desired client for processing. The client need only reference the block header to determine whether the "actual information" in the blocX contains control or data information.
A further advantage of the present invention is that the blocks can be of variable size. They are only constrained by the protocol requiring that all control information units be at the end o~ the block. This speeds the processing of large quantities of either all data information and/or control information units.
Brlef Das~ription of the Drawings Figure l is a bloc~ diagram of the environment of the present invention.
Figure 2 is an example of the formats for m-bit and n-bit information unit of the present invention.
Figure 3 shows the data representation for a block of the present invention.
~292~9 Figure 4 is an example of a completed block according to the invention.
Detailed Description Figure 1 illustrates one example of a system 28 making use of the present invention. The system 28 includes a server 10 that interfaces two computer networks 12 and 14.
Network 12 is coupled to the server 10 through a bus 16 such as an Ethernet bus. Network 14 is shown coupled to the server 10 through serial line 22, for example, an optical fiber. The server is provided with server memory 21. Circuit switch 30 located ~n network 14 receives information from the server 10 via the fiber 22. The circuit switch 30 then couples the information, dependin~ upon a selected channel number, to any of a number of devices (not shown) in the network 14. For purposes of this description, assume that the protocol for network 14 requires that information be received in m-bit information units wherein bits <m-l:0> contain the actual infor~ation and bit <m> contains the C/D indicator.
Network 12 includeæ a plurality of devices 18, 20, coupled to the bus 16. These devices 18, 20 may be any type of intelli~ent device such as a host processor or intelligent peripheral. For example, the devices 18, 20 in network 12 can be n-bit or byte ~n=8) oriented processors that operate on n-bit information units. The software which operates on the devices 18, 20 is conceptually illustrated by blocks 24 and 26.
The~e software blocks 24 and 26 are referred to as "clients"
which interact with the server 10 in accordance with the protocol of the instant invention.
The protocol established for transferring information between the clients 24, 26 and the server 10 allows for the efficient communication of the information between n-bit oriented devices 18, 20 o~ network 12 (which provide n-bit information units) 29~259 and the network 14, which can only receive information in m-bit information units. The information is passed between the devices 18, 20 and the server 10 (through the clients 24, 26) as a set of information units referred to as a "block" in the S protocol. The block efficiently represents the information units to be communicated from one network 12, 14 to another.
.
Figure 2 shows the format for the m-bit and n-bit information units processed by the respective networks 14 and 12. As discussed above, the m-bit information unit uses the mth bit to indicate whether the lower ordered bits, ~(m-1):0> represent control or data information for that particular information unit. The n-bit information unit does not contain a C/D bit.
With an n-bit information unit, the protocol of the present invention i~ defined such that all control information units occur at the end o~ a block. When a client ~n the n-bit network forms a block, it knows, by any conventional manner, whether each n-bit information unit is a control or data information unit, thereby avoiding the use of a C/D bit.
Referring to Figure 3, there is shown an embodiment of a block 50 wherein the block 50 is arranged as a set of 32-bit longwords. A block header field is located in the first address 01 of the block 50. The header field contains ~ number of fields including a channel number field 71, control information unit count field 72 and a total information unit count field 70. Other control functions can also be implemented in the header field, e.g., a field to distinguish between different types of blocks, i.e., those containing commands and responses as opposed to representinq information;
a field indicating whether the information in the block 50 i5 continued in successive blocks, etc.
In one embodiment of the header field shown in Figure 3, bits ~10:0> indicate the channel number associated with the information; bits ~12:11> are reserved for other various control functions as discussed above; bits ~15:13> are the 2~2~2~
count of the number of control information units in the block 50; and bits ~31:16> maintain the total count of all of the information units contained in the block 50.
The block addresses 02 through 257 (d~cimal), following the header address 01, contain the actual information to be transferred. Because the protocol between the clients 24, 26 and server 10 requires all control information units to be at the end of t~e block (i.e~ an 8-bit system), there is no need to have separate C/D indicators as part of each information unit to indicate control or data.
The block 50 is constructed in either a device memory 19 or the server ~emory 21 by the client 24, 26 or the server 10, respectively, depending upon the direction of information transfer, i.e., from networ~ 12 to 14 or 14 to 12. Each block begins at a given address in either the device or server memory. Once a block is completed, the information in the block addresses can then be forwarded across the bus 16. For infor~ation being sent to the network 14, each byte of information in the block (constructed by the client in the device memory and sent to the server) is appended with a C/D
indicator by the server hardware as appropriately determined by a comparison of the count in the block header.
One example of the construction of a blocX 50 by a client 24 for transmission to network 14 is shown in Figure 4, wherein each n-bit information unit i5 assembled into the block 50.
The block 50 is represented by address locations, 01-04, in which the information units are written prior to transmission.
The header fields having the total information unit count field 70 and control information unit count field 72 indicates the number of data information units and control information units assembled in the block 50.
In this example, seven data information units, Dl-D7, are loaded by a client, e.g., client 26; into address locations 02 and 03 of the device memory 19. As required by the protocol, ~9~233 the control information units Cl-C3 immediately follow the data units Dl-D7. Thus, when assembling the block 50, the total information unit count increments from 0 to 7 for the data units Dl-D7 and then continues with the control units C1-C3.
The total information unit count field 70 therefore stores a value of ten. Similarly, control information unit count field 72, increments for each control information unit Cl-C3 received in the block 50. The control information unit count for this example therefore stores a value of three.
Because the protocol requires that all control information units must be located at the end of a block, the loading of another data information unit, D8 (not shown), would terminate construction of the previous block and begin the construction of a new bloc~. It is apparent that the most inefficient use of the blocks occurs where an alternating sequence of data and contrsl units are transmitted. In this case, a new block would be generated every two information units. More often, however, the two types of information, i.e., control or data, are comounicated in contiguous groups. The blocX representation allows effective grouping of the information units and provides a substantial savings in memory space located in the devices 18, 20 and the server 10. Further, the block allows efficient use of the network 12 resources.
After assembly, the completed block 50 is then sent to the server 10 via bus 16. The server 10 then reconstructs m-bit information units ~o be sent over serial line 22 to the computer network 14. This is accomplished by making reference to the header information. The counts 70, 72 in the header field determine whether information units are data or control information as described below.
In this example, by comparing t~e total information unit count 70 and control information unit count 72, the hardware (or software) of the server 10 deter~ines that the f~rst seven information units (Dl-D7) in the block 50 are data information units and the last three information units are control ~w~2~9 information units (Cl-C3), e.g., (10 total) - (3 control) = (7 data). In this manner, the correct mth bit (the C/D bit) can be appended to the information units Dl-D7 and Cl-C3 before they are forwarded to the m-bit protocol computer network 14, e.g., mth bit = 1 for control information or mth bit = o for data information.
In the illustrated example, the server 10 knows that information units Dl-D4 located in address 02 are all data information units and thus a O will be appended as each of their mth bits. As each bit is appended, the total information unit count 70 is decremented. Data information units D5-D7 located at address 03, i.e., in the first 24 bits <23:0>, will each be appended with a 0. At this point, the total information unit count 70 equals the value of the control information unit count 72, thereby signalling that the remaininq information units CloC3 are all control information units. Therefore, bits <31:24~ of address 03 represent control information and will be appended with an mth bit equaling 1.
Similarly, each control information unit C2-C3 located at address 04 will also be appended with a one. Once the control information unit count 72 decrements to zero, the transmission of the bloc~ 50 is completed. The use of the counts 70, 72 in the header 52 provides an indication of the boundary between the data information and the control information in the block.
2S The counts 70, 72 allow the appending of ~he correct mth bit to the (m - 1) bits of the information units~
Similarly for the transmission of information from network 14 to network 12, the information units are sent in a serial format to the server 10 over line 2~. The server 10 receives the information units and places them in ~he server memory 21.
The server then converts the received inform~tion units into the block of the present invention. In the preferred embodiment, the information in the server memory 21 to be converted is in the form of a fixed length block, the formation 5 of which is described in copending application serial no.
incorporated by reference above.
~92~
Once the variable size block is formatted, the server sends the block over the bus 16 to the intended device 18, 20 which can then process the information contained therein.
Claims (16)
1. A method of transmitting data and control information between two networks, the method comprising the steps of:
a) generating information units from one of the networks including control information units and data information units:
b) forming the information units into a block in the order in which said information units are generated;
c) determining for each information unit generated whether it is a control information unit or a data information unit;
d) upon determining a data information unit after a preceding control information unit, ending the formation of said block with said preceding control information unit;
e) sending the block to the other of said networks.
a) generating information units from one of the networks including control information units and data information units:
b) forming the information units into a block in the order in which said information units are generated;
c) determining for each information unit generated whether it is a control information unit or a data information unit;
d) upon determining a data information unit after a preceding control information unit, ending the formation of said block with said preceding control information unit;
e) sending the block to the other of said networks.
2. A method according to claim 1 further comprising the step of:
f) repeating steps a), b), c), d), and e) for all of the information units to be transmitted.
f) repeating steps a), b), c), d), and e) for all of the information units to be transmitted.
3. A method according to claim 2 wherein the step of forming the information units comprises the steps of:
a) forming a header field for said block; and b) accounting in the header field for the number of each type of information unit contained in the block.
a) forming a header field for said block; and b) accounting in the header field for the number of each type of information unit contained in the block.
4. A method according to claim 3 wherein the step of accounting comprises the steps of:
a) storing the count of the total number of information units in the block: and b) storing the count of the total number of control information units in the block.
a) storing the count of the total number of information units in the block: and b) storing the count of the total number of control information units in the block.
5. A method according to claim 4 further comprising the step of:
g) receiving the block in the other of said networks;
h) comparing in the other of said networks the count of the total number of information units with the count of the total number of control information units to indicate the total number of data information units in the block.
g) receiving the block in the other of said networks;
h) comparing in the other of said networks the count of the total number of information units with the count of the total number of control information units to indicate the total number of data information units in the block.
6. A method according to claim 3 wherein the one network is an n-bit network and the other network is an m-bit network, m being equal to n+1, said plurality of information units forming the block each having n-bits; further comprising the steps of:
h) receiving the block in the m-bit network;
i) checking the header field to determine, in the order in which said information units were generated whether each information unit is a data information unit or a control information unit;
j) appending an mth bit having a first value to said n-bit information units that are data information units;
k) appending an mth bit having a second value to said n-bit information units that are control information units; and l) providing a serial stream of the appended information units for the m-bit network.
h) receiving the block in the m-bit network;
i) checking the header field to determine, in the order in which said information units were generated whether each information unit is a data information unit or a control information unit;
j) appending an mth bit having a first value to said n-bit information units that are data information units;
k) appending an mth bit having a second value to said n-bit information units that are control information units; and l) providing a serial stream of the appended information units for the m-bit network.
7. In a system including a plurality of clients of one network coupled to a server receiving input from another network, a method comprising the steps of:
a) generating information units from one of the networks including control information units and data information units;
b) forming the information units into a block in the order in which said information units are generated;
c) determining for each information unit generated whether it is a control information unit or a data information unit;
d) upon determining a data information unit after a preceding control information unit, ending the formation of said block with said preceding control information unit;
e) sending the block to the other of said networks.
a) generating information units from one of the networks including control information units and data information units;
b) forming the information units into a block in the order in which said information units are generated;
c) determining for each information unit generated whether it is a control information unit or a data information unit;
d) upon determining a data information unit after a preceding control information unit, ending the formation of said block with said preceding control information unit;
e) sending the block to the other of said networks.
8. A method according to claim 7 wherein the step of forming the information units is carried out in the server.
9. A method according to claim 7 wherein the step of forming the information units is carried out in one of the clients.
10. A method according to claim 7 wherein one of said networks is a single computer device.
11. A computer system, comprising:
an m-bit network;
an n-bit network including at least one device;
a server coupling the m-bit network to the n-bit network, and including:
a memory;
means for receiving and storing information units from the m-bit network in the memory, said information units including control information units and data information units;
means for forming the information units into a block in the order in which they are received in the memory;
means for determining whether each information unit received is a control information unit or a data information unit and means for determining a data information unit after a preceding control information unit;
means for ending the formation of said block with said preceding control information unit; and means for sending the block to the n-bit network.
an m-bit network;
an n-bit network including at least one device;
a server coupling the m-bit network to the n-bit network, and including:
a memory;
means for receiving and storing information units from the m-bit network in the memory, said information units including control information units and data information units;
means for forming the information units into a block in the order in which they are received in the memory;
means for determining whether each information unit received is a control information unit or a data information unit and means for determining a data information unit after a preceding control information unit;
means for ending the formation of said block with said preceding control information unit; and means for sending the block to the n-bit network.
12. A system according to claim 11 wherein the means for forming the information units comprises means for forming a header field for said block.
13. A system according to claim 12 further comprising:
means for receiving the block in the n-bit network;
first means for counting the total number of information units in the block;
second means for counting the total number of control information units in the block; and means for comparing the total number of information units with the total number of control information units to indicate the total number of data information units in the blocks.
means for receiving the block in the n-bit network;
first means for counting the total number of information units in the block;
second means for counting the total number of control information units in the block; and means for comparing the total number of information units with the total number of control information units to indicate the total number of data information units in the blocks.
14. A system according to claim 13 wherein one of said m-bit or n-bit networks is a single computer.
15. A server for interfacing between an m-bit network and an n-bit network, comprising:
a memory;
means for receiving and storing information units from the m-bit network in the memory, said information units including control information units and data information units;
means for forming the information units into a block in the order in which they are received in the memory;
means for determining whether each information unit received is a control information unit or a data information unit;
means for determining a data information unit after a preceding control information unit; and means for ending the formation of said block with said preceding control information unit.
a memory;
means for receiving and storing information units from the m-bit network in the memory, said information units including control information units and data information units;
means for forming the information units into a block in the order in which they are received in the memory;
means for determining whether each information unit received is a control information unit or a data information unit;
means for determining a data information unit after a preceding control information unit; and means for ending the formation of said block with said preceding control information unit.
16. A server according to claim 15 wherein the means for forming the information units comprises means for forming a header field for said block.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US439,239 | 1989-11-20 | ||
| US07/439,239 US5175817A (en) | 1989-11-20 | 1989-11-20 | Data representation protocol for communications between different networks |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CA2029259A1 true CA2029259A1 (en) | 1991-05-21 |
Family
ID=23743891
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002029259A Abandoned CA2029259A1 (en) | 1989-11-20 | 1990-11-02 | Data representation and protocol |
Country Status (7)
| Country | Link |
|---|---|
| US (1) | US5175817A (en) |
| EP (1) | EP0429054B1 (en) |
| JP (1) | JPH0720152B2 (en) |
| KR (1) | KR940008104B1 (en) |
| AU (1) | AU627375B2 (en) |
| CA (1) | CA2029259A1 (en) |
| DE (1) | DE69029892T2 (en) |
Families Citing this family (58)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5485370A (en) * | 1988-05-05 | 1996-01-16 | Transaction Technology, Inc. | Home services delivery system with intelligent terminal emulator |
| US5572572A (en) | 1988-05-05 | 1996-11-05 | Transaction Technology, Inc. | Computer and telephone apparatus with user friendly interface and enhanced integrity features |
| US5291487A (en) * | 1991-01-24 | 1994-03-01 | Micom Communications Corp. | Apparatus for, and method of, packing and unpacking information in transmission lines |
| US5287461A (en) * | 1991-10-31 | 1994-02-15 | Sun Microsystems, Inc. | Method and apparatus for remotely accessing a plurality of server consoles |
| US5826017A (en) * | 1992-02-10 | 1998-10-20 | Lucent Technologies | Apparatus and method for communicating data between elements of a distributed system using a general protocol |
| FR2687259B1 (en) * | 1992-02-11 | 1994-05-06 | Ouest Standard Telematique Sa | DATA COMPRESSION METHOD FOR PROTOCOL DATA UNIT TRANSMISSION SYSTEM, DECOMPRESSION METHOD, AND CORRESPONDING DEVICE. |
| EP0567217B1 (en) * | 1992-04-20 | 2001-10-24 | 3Com Corporation | System of extending network resources to remote networks |
| ES2154647T3 (en) * | 1992-07-01 | 2001-04-16 | Ericsson Telefon Ab L M | METHOD AND SYSTEM OF SPECIFICATION OF INDEPENDENT INTERFACE OF THE IMPLEMENTATION. |
| US5412805A (en) * | 1992-08-03 | 1995-05-02 | International Business Machines Corporation | Apparatus and method for efficiently allocating memory to reconstruct a data structure |
| US5339434A (en) * | 1992-12-07 | 1994-08-16 | Trw Inc. | Heterogeneous data translation system |
| US5517670A (en) * | 1992-12-30 | 1996-05-14 | International Business Machines Corporation | Adaptive data transfer channel employing extended data block capability |
| US5452289A (en) * | 1993-01-08 | 1995-09-19 | Multi-Tech Systems, Inc. | Computer-based multifunction personal communications system |
| WO1994028664A1 (en) * | 1993-05-24 | 1994-12-08 | Siemens Rolm Communications Inc. | Telecommunications system interfacing device and method |
| GB2285896B (en) * | 1994-01-22 | 1998-04-15 | Northern Telecom Ltd | Subscriber line testing |
| US5682386A (en) | 1994-04-19 | 1997-10-28 | Multi-Tech Systems, Inc. | Data/voice/fax compression multiplexer |
| US5757801A (en) | 1994-04-19 | 1998-05-26 | Multi-Tech Systems, Inc. | Advanced priority statistical multiplexer |
| KR970009698B1 (en) * | 1994-07-07 | 1997-06-17 | 엘지산전 주식회사 | Method of setting communication parameter of plc |
| DE4426094C2 (en) * | 1994-07-22 | 1998-04-16 | Siemens Nixdorf Inf Syst | Data reduction for bus couplers |
| US6334219B1 (en) | 1994-09-26 | 2001-12-25 | Adc Telecommunications Inc. | Channel selection for a hybrid fiber coax network |
| US7280564B1 (en) | 1995-02-06 | 2007-10-09 | Adc Telecommunications, Inc. | Synchronization techniques in multipoint-to-point communication using orthgonal frequency division multiplexing |
| USRE42236E1 (en) | 1995-02-06 | 2011-03-22 | Adc Telecommunications, Inc. | Multiuse subcarriers in multipoint-to-point communication using orthogonal frequency division multiplexing |
| US20060206219A1 (en) | 1995-05-30 | 2006-09-14 | Brown David W | Motion control systems and methods |
| US20100131081A1 (en) * | 1995-05-30 | 2010-05-27 | Brown David W | Systems and methods for motion control |
| US5691897A (en) * | 1995-05-30 | 1997-11-25 | Roy-G-Biv Corporation | Motion control systems |
| US6859671B1 (en) | 1995-05-30 | 2005-02-22 | Roy-G-Biv Corporation | Application programs for motion control devices including access limitations |
| US6209037B1 (en) | 1995-05-30 | 2001-03-27 | Roy-G-Biv Corporation | Motion control systems using communication map to facilitating communication with motion control hardware |
| US6542925B2 (en) | 1995-05-30 | 2003-04-01 | Roy-G-Biv Corporation | Generation and distribution of motion commands over a distributed network |
| US7139843B1 (en) | 1995-05-30 | 2006-11-21 | Roy-G-Biv Corporation | System and methods for generating and communicating motion data through a distributed network |
| US6571141B1 (en) | 1995-05-30 | 2003-05-27 | Roy-G-Biv Corporation | Application programs for motion control devices including access limitations |
| US7137107B1 (en) | 2003-04-29 | 2006-11-14 | Roy-G-Biv Corporation | Motion control systems and methods |
| US7024666B1 (en) | 2002-01-28 | 2006-04-04 | Roy-G-Biv Corporation | Motion control systems and methods |
| US5796832A (en) | 1995-11-13 | 1998-08-18 | Transaction Technology, Inc. | Wireless transaction and information system |
| US6084952A (en) * | 1996-01-18 | 2000-07-04 | Pocketscience, Inc. | System and method for communicating electronic messages over a telephone network using acoustical coupling |
| US5826018A (en) * | 1996-04-02 | 1998-10-20 | Hewlett-Packard Company | Method and appparatus for automatically determining the starting location and starting protocol of LAN data in a WAN link frame |
| US5819113A (en) * | 1996-06-06 | 1998-10-06 | Advanced Micro Devices, Inc. | Method of identifying end of pocket by writing the address of last data into the first location of the memory |
| US5966451A (en) * | 1997-02-20 | 1999-10-12 | Kabushiki Kaisha Toshiba | Distributed network computing system, and data exchange apparatus and method and storage medium used in this system |
| US20010032278A1 (en) | 1997-10-07 | 2001-10-18 | Brown Stephen J. | Remote generation and distribution of command programs for programmable devices |
| US6052812A (en) | 1998-01-07 | 2000-04-18 | Pocketscience, Inc. | Messaging communication protocol |
| US6167391A (en) * | 1998-03-19 | 2000-12-26 | Lawrence Technologies, Llc | Architecture for corob based computing system |
| US6192374B1 (en) | 1998-10-10 | 2001-02-20 | Lawrence Technologies, Llc | Efficient implementations of constructs such as feature tables |
| US6223224B1 (en) * | 1998-12-17 | 2001-04-24 | International Business Machines Corporation | Method and apparatus for multiple file download via single aggregate file serving |
| CA2284947C (en) | 1999-10-04 | 2005-12-20 | Storagequest Inc. | Apparatus and method for managing data storage |
| US6885898B1 (en) | 2001-05-18 | 2005-04-26 | Roy-G-Biv Corporation | Event driven motion systems |
| CA2625283C (en) | 1999-10-27 | 2012-12-18 | Roy-G-Biv Corporation | Systems and methods for generating and communicating motion data through a distributed network |
| US8032605B2 (en) | 1999-10-27 | 2011-10-04 | Roy-G-Biv Corporation | Generation and distribution of motion commands over a distributed network |
| US20100131078A1 (en) * | 1999-10-27 | 2010-05-27 | Brown David W | Event driven motion systems |
| US7904194B2 (en) | 2001-02-09 | 2011-03-08 | Roy-G-Biv Corporation | Event management systems and methods for motion control systems |
| WO2002071241A1 (en) | 2001-02-09 | 2002-09-12 | Roy-G-Biv Corporation | Event management systems and methods for the distribution of motion control commands |
| US6947913B1 (en) | 2001-08-23 | 2005-09-20 | Lawrence Technologies, Llc | Systems and methods for generating string correlithm objects |
| US7031969B2 (en) * | 2002-02-20 | 2006-04-18 | Lawrence Technologies, Llc | System and method for identifying relationships between database records |
| EP1514192B1 (en) * | 2002-06-05 | 2013-08-28 | InterDigital Technology Corporation | Method and apparatus for switching between a first and a second network |
| US7480915B2 (en) * | 2002-10-03 | 2009-01-20 | Nokia Corporation | WV-IMS relay and interoperability methods |
| US8027349B2 (en) * | 2003-09-25 | 2011-09-27 | Roy-G-Biv Corporation | Database event driven motion systems |
| US20060064503A1 (en) | 2003-09-25 | 2006-03-23 | Brown David W | Data routing systems and methods |
| US20100131077A1 (en) * | 2004-02-25 | 2010-05-27 | Brown David W | Data Collection Systems and Methods for Motion Control |
| US7681184B1 (en) | 2004-05-24 | 2010-03-16 | Borland Software Corporation | System and methodology for cross language type system compatibility |
| US7739696B2 (en) * | 2005-09-08 | 2010-06-15 | Honeywell International Inc. | Message translation systems and methods |
| US8549093B2 (en) | 2008-09-23 | 2013-10-01 | Strategic Technology Partners, LLC | Updating a user session in a mach-derived system environment |
Family Cites Families (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CH632365A5 (en) * | 1978-01-30 | 1982-09-30 | Patelhold Patentverwertung | DATA EXCHANGE PROCESS BETWEEN MULTIPLE PARTNERS. |
| US4493021A (en) * | 1981-04-03 | 1985-01-08 | The United States Of America As Represented By The Administrator Of The National Aeronautics And Space Administration | Multicomputer communication system |
| US4475192A (en) * | 1982-02-16 | 1984-10-02 | At&T Bell Laboratories | Data packet flow control scheme for switching networks |
| US4494194A (en) * | 1982-09-30 | 1985-01-15 | Burroughs Corporation | Line support processor for data transfer system |
| US4631666A (en) * | 1982-10-25 | 1986-12-23 | Burroughs Corporation | Data transfer network for variable protocol management |
| US4554659A (en) * | 1983-12-12 | 1985-11-19 | At&T Bell Laboratories | Data communication network |
| JPS60218142A (en) * | 1984-04-13 | 1985-10-31 | Hitachi Ltd | Dynamic format conversion system of data |
| US4823122A (en) * | 1984-06-01 | 1989-04-18 | Digital Equipment Corporation | Local area network for digital data processing system |
| US4868742A (en) * | 1984-06-20 | 1989-09-19 | Convex Computer Corporation | Input/output bus for system which generates a new header parcel when an interrupted data block transfer between a computer and peripherals is resumed |
| US4644547A (en) * | 1984-06-28 | 1987-02-17 | Westinghouse Electric Corp. | Digital message format for two-way communication and control network |
| US4800488A (en) * | 1985-11-12 | 1989-01-24 | American Telephone And Telegraph Company, At&T Bell Laboratories | Method of propagating resource information in a computer network |
| US4814980A (en) * | 1986-04-01 | 1989-03-21 | California Institute Of Technology | Concurrent hypercube system with improved message passing |
| US4873626A (en) * | 1986-12-17 | 1989-10-10 | Massachusetts Institute Of Technology | Parallel processing system with processor array having memory system included in system memory |
| US4791566A (en) * | 1987-03-27 | 1988-12-13 | Digital Equipment Corporation | Terminal device session management protocol |
-
1989
- 1989-11-20 US US07/439,239 patent/US5175817A/en not_active Expired - Lifetime
-
1990
- 1990-11-01 AU AU65728/90A patent/AU627375B2/en not_active Ceased
- 1990-11-02 CA CA002029259A patent/CA2029259A1/en not_active Abandoned
- 1990-11-20 DE DE69029892T patent/DE69029892T2/en not_active Expired - Fee Related
- 1990-11-20 KR KR1019900018777A patent/KR940008104B1/en not_active IP Right Cessation
- 1990-11-20 JP JP2315285A patent/JPH0720152B2/en not_active Expired - Lifetime
- 1990-11-20 EP EP90122165A patent/EP0429054B1/en not_active Expired - Lifetime
Also Published As
| Publication number | Publication date |
|---|---|
| EP0429054A2 (en) | 1991-05-29 |
| KR940008104B1 (en) | 1994-09-02 |
| EP0429054A3 (en) | 1991-12-11 |
| KR910010945A (en) | 1991-06-29 |
| JPH0720152B2 (en) | 1995-03-06 |
| EP0429054B1 (en) | 1997-02-05 |
| AU627375B2 (en) | 1992-08-20 |
| US5175817A (en) | 1992-12-29 |
| DE69029892T2 (en) | 1997-09-11 |
| DE69029892D1 (en) | 1997-03-20 |
| AU6572890A (en) | 1991-07-18 |
| JPH03239046A (en) | 1991-10-24 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5175817A (en) | Data representation protocol for communications between different networks | |
| US5632016A (en) | System for reformatting a response packet with speed code from a source packet using DMA engine to retrieve count field and address from source packet | |
| CA2086695C (en) | Pipeline method for batching the receipt of data packets | |
| US6697366B1 (en) | Ethernet memory management system and methods for operation thereof | |
| JP2719522B2 (en) | Data link controller | |
| US5619646A (en) | Method and system for dynamically appending a data block to a variable length transmit list while transmitting another data block over a serial bus | |
| EP0772323A2 (en) | Method and apparatus for tracking buffer availability | |
| WO1988006822A1 (en) | Distributed local-area-network monitoring system | |
| US5958024A (en) | System having a receive data register for storing at least nine data bits of frame and status bits indicating the status of asynchronous serial receiver | |
| JPH0561667B2 (en) | ||
| WO1994012926A1 (en) | Computer network extender | |
| WO1984004012A1 (en) | Digital multi-customer data interface | |
| WO1997033230B1 (en) | Asynchronous data pipe for automatically managing asynchronous data transfers between an application and a bus structure | |
| US5524111A (en) | Method and apparatus for transmitting an unique high rate digital data flow over N multiple different independent digital communication channels between two different primary terminal adapters | |
| US5101477A (en) | System for high speed transfer of data frames between a channel and an input/output device with request and backup request count registers | |
| JP2717112B2 (en) | Dual port timing controller | |
| EP0425839B1 (en) | Data processing system channel | |
| US5027349A (en) | Embedded control technique for distributed control systems | |
| US5317719A (en) | System for forming serial M-bit information into blocks whose locations correspond to bitmap locations | |
| US6490281B1 (en) | Apparatus including a scalable multiprotocol communications adapter using modular components and a method for transmitting data frames via scalable multiprotocol communication adapters | |
| JP2724322B2 (en) | General-purpose asynchronous receiver-transmitter | |
| JPH0548017B2 (en) | ||
| GB2349554A (en) | Encoding or decoding of data | |
| EP0397138A2 (en) | Embedded control technique for distributed control systems | |
| JPS6161582B2 (en) |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| FZDE | Discontinued |