Method for enhancing frame utilization in a CSMA/CD communication

Abstract: In a CSMA/CD communication protocol, data to be sent from one device on a communication network to another is put into frames, or predetermined sized pieces of informa­ tion. One of the fields in a frame, the pad field is used to make the total size of the frame large enough to ensure that a collision anywhere in the network with another frame is detected by the senders. The pad field is fur­ ther used to identify when a data record will be continued in the next frame, and also to identify when multiple data records are being sent in the same frame.

Description: In current carrier sense multiple access with collision detect (CSMA/CD) communication protocols, several devices are coupled by a communications cable/bus in a network. If a first device has data to send to another device, it senses the carrier or cable to see if another device is presently transmitting data. If no other device is using the cable, the first device transmits the data, and also listens on the line to make sure that the data did not collide with data being sent by another device. The data is packaged into an entity called a frame consistent with IEEE standard 802.3, CSMA/CD Access Method and Physical Layer Specifications. The frame, in addition to the actual data, includes information to identify the source and destination of the frame, type of frame, start of frame, checking data, preamble and a pad area. The present invention relates to a method for enhancing frame utilization in a CSMA/CD communication. Frame length is agreed upon by the devices, and should be long enough so that collisions can always be detected. It has been varied based on the amount of traffic on a network in an effort to maximize bandwidth utilization. US Patent No. 4,543,654 to Jones describes a way of ensuring that the preamble is long enough to ensure collision detection. In this patent, the size of the preamble is varied depending on the propagation characteristics of the communication network. A US patent 4,745,599 which relates to a "Random access communication system with contention scheduling of subpacketized data transmissions and scheduled retransmission of unsuccessful subpackets" by Dipankar Raychaudhuri, describes a random access communication system forms messages to be transmitted into subpackets of fixed duration. The subpackets of the message packet are transmitted contiguously over the transmission path in a contention mode where some subpackets are successfully received and some are lost due to collisions. In the system, means are provided for forming the subpackets into a contiguous stream and for adding header information to each subpacket indicating the number of subpackets in the entire message. Such system aims only in achieving a good transmission by retransmitting failed subpackets in the form of new subpackets and during which initiation of new transmissions which were not previously transmitted is inhibited so that the retransmissions are received without collision, but it does optimize the size of the frames to be transmitted so that the network band is improved. One problem associated with CSMA/CD networks is that only one record can be transmitted at a time. This can cause difficulties if the size of a record is larger or smaller than the room left in a frame for data. One can try to optimize the size of the frames to accommodate the average size of data, but the frame must still be large enough to ensure collision detection. US Patent No. 4,771,391 describes a method of optimizing the length of information packets to minimize delay in a node gaining access to a network. In a different communication protocol as described in US Patent No. 4,688,035 to Gray et al., a "more bit" in a length of data field was used to indicate that a further part of a record will be coming in a future frame. In the IEEE standard, there is no field defined for insertion of a "more bit." Where the data comprises several smaller records, they are sent one at a time, with the pad field increased to fill up the rest of the frame. This is quite wasteful from at least two perspectives. First, when each frame is sent, there is the possibility of a collision. If a collision occurs, the frame must be resent at a later time as determined by a retry protocol. Since the data is broken into multiple frames, each of which is subject to a new chance of collision, there is an increased chance of collision for transmission of the record. Further, if all the data from multiple devices are being broken apart to be sent, there are many more frames being transmitted, again increasing the chance of collision. It is an object of the present invention to modify the pad field of a frame in a CSMA/CD communication in order to identify when a data record will be continued in the next frame, and also to identify when multiple data records are being sent in the same frame. In this manner, the utilization of the predetermined sized frames is optimized. In one preferred embodiment of the invention, the first byte in the pad field contains a more bit. The next 7 bits indicate frame sequence. This helps in assembling the data record in proper order at the receiving device. When large records are divided into pieces, the more bit is set to on. It is set to off in the last data frame. It is also set to off, if data is not broken into smaller pieces. When the data to be sent consists of a number of small records, the records are blocked to bring the data frame transmitted to the predetermined optimum size. A record may consist of 80 bytes of data, i.e. one line of print on an 80 character wide display, or any other desired length. For blocking the records, the pad field is modified to include the record lengths. At least four records are combined in this manner, although benefits are obtained by combining two or more records. In a further embodiment of the invention, a byte in the pad field indicates the number of records blocked, and the length of each blocked record. The number of records blocked enables the identification of the lengths of records versus arbitrary padded data. The breaking of large records into multiple frames insures that the device sending a large record does not monopolize the communication medium. Other devices will have an opportunity to send frames instead of one long frame from a single device tying up the network. It also preserves the frame size which is calculated to optimize the bandwidth utilization of the network. The same is true for the blocking of records. Rather than sending four separate frames, which would cause extra contention, and increased chance of collision, all four records are sent in a single frame. While breaking of large records has been done in different communication protocols and blocking of small records has been done in at least some input/output protocols, neither has been done in a CSMA/CD environment. As higher bandwidth communication medium, such as optical fiber communication lines become available, it is clear that a significant limitation of CSMA/CD is the time it takes for a frame to propagate the length of the medium. This is about the time it takes to detect a collision, and is not improved by medium bandwidth improvements. The present invention provides a much greater flexibility in how data is packaged into frames, and makes optimal use of such frames whose length has been chosen based on the propagation time for the medium. Thus, by packaging the data in accordance with the present invention, the frame length can be chosen as desired to maximize the available bandwidth. The frame usage is also maximized, thus further increasing utilization of the available bandwidth. Fig. 1 is a block diagram of a bus configuration which utilizes frame usage optimization. Fig. 2 is a block diagram of a frame used to transmit data in accordance with the present invention. Fig. 3 is a block diagram of a pad field byte of the frame used to indicate that a record will be continued in a further frame. Fig. 4a is a block diagram of pad field bytes used to identify chaining of records. Fig. 4b is a block diagram of pad field bytes used to identify blocking of records. Figs. 5a and 5b are a flow diagram indicating the assembly of the pad field and data in frames. Fig. 6 is a flow diagram indicating the disassembly of the pad field and data from frames. The invention will be described in conjunction with an example bus network multiple access local area network shown in Fig. 1. However, the invention is applicable to a wide variety of local area networks including both bus topologies as well as ring topologies and is not limited to a particular access method or protocol. In accordance with the invention, each node on the bus 20 comprises a bus adapter 22, a frame optimizer 24 and a utilization device such as a host 26 or a workstation 28. Workstation 28 usually comprises a keyboard, microprocessor, memory and display. It can also be a printer or secondary storage device such as a tape drive or disk drive. The invention disclosed herein resides in the frame optimizer 24, the operation of which is shown in greater detail in Figs. 5 and 6. In accordance with the invention, the frame optimizer will control the blocking and chaining of records transmitted by its node through the bus adapter 22 onto the bus 20 based on the size of the frame. Bus adapter 22 is well known in the prior art, and may be similar to a ring adapter such as described in US Patent No. 4,507,777 to Tucker, et al., assigned to the IBM Corporation. The bus adapter allows a node to accept and dispatch frames on the bus 20 using a multiple access protocol. It performs electrical signal conversion on data including modulation and demodulation, and it extracts the timing signal from the bus data and uses the timing signal for synchronizing the data onto the bus 20. It also strips the desired data from the frame for use by the frame optimizer 24. The frame formats for CSMA/CD are shown in Fig 2. There are two types of frames, the logical link control (LLC) frame, and the medium access control (MAC) frame. The Logical Link Control frame provides end to end error control and acknowledgment. It also provides end to end flow control. The Medium Access Control frame provides logic for gaining access to the network for frame transmission and reception. Here considerations like whether the access control is centralized or decentralized and how to access the network come into the picture. For accessing the network usually one of the three approaches - round robin, reservation or contention is used. The individual fields in the frames are defined as follows: DSAP - Destination Service Access Point SSAP - Source Service Access Point CONTROL - Field to identify frame type and pass control bits. DATA - Variable length data to be exchanged is put in this field. The frame optimizer selects the blocked or chained records. PREAMBLE - 7 bytes. A Pattern used by the receiver to establish bit synchronization and the locate the first bit of a frame. SFD - Start Frame Delimiter (Indicates the start of a frame) DA - Destination Address. SA - Source Address. LEN - Length of LLC field that follows. LLC - Logical Link Control Frame PAD - A sequence of bytes added to ensure that the frame is long enough for proper CSMA/CD operation. FCS - Frame Check Sequence (32 bit cyclic redundancy check). Based on all fields starting with destination address. The purposes of these fields are well defined in the IEEE 802.3 standard. The PAD field is used to ensure that the frames are long enough so that a collision will always be detected. If a frame is too short, two nodes that are far apart on the network may transmit frames close in time, and not see the collision. The frames must be long enough to ensure that they will see the collision, and detect bad data. They then wait a time before retransmitting. Modification of the pad field in accordance with the present invention is shown in Figs. 3, 4a and 4b. In Fig. 3, 1 byte of the pad field, designated a chain field, is modified to include a more bit, designated M. When a record is too large for a frame, the M bit is set to "one" in a frame, and only part of the record is sent in each frame. When all of the record has been sent in multiple frames, the last frame has its M bit set to "zero" to indicate that the last frame for a record has been sent. The receiving node frame optimizer is given the pad field chain byte containing the M bit in addition to the data, and reconstructs the record from all the frames. The remaining bits of the pad field chain byte are labeled F, and are used to identify the order of frames comprising a large broken apart record. It is simply the frame number. The pad field bits used for the frame number could be extended to more chain bytes if it is anticipated that very large records will be transmitted. By moving the function of reconstructing records to the frame optimizer and away from the applications running on the workstations or host such applications do not need to be specially programmed to break apart large records in order to be compatible with the communications protocol. The format of the pad field for blocking of records is indicated in Fig. 4a and 4b. The record size can vary from zero to N bytes, where N can be several k bytes in Fig. 4b. For applications like file transfer, where each line of data is a record of about 80 bytes, the records are blocked to bring the data frame transmitted to optimum size. Eighty bytes is a typical record size for most CRT displays, and constitutes one line of data. 132 bytes is compatible with wide printers. Other sizes of records are also within the scope of the invention. For blocking the records, or putting them into the same frame, the pad field is modified to include the record lengths. A maximum of four records are blocked as seen in the length indications 11, 12, 13 and 14 in Fig. 4b. The pad field normally has arbitrary or 'do not care data'. A record is considered short if it is less than the length of data allowed in an optimum size frame. Ideally, a short record is less than one-half the maximum amount of data allowed. In a further embodiment, a byte of the pad field indicates the number of records blocked. Further bytes in Fig. 4a at 11, 12, 13 and 14 indicate the length of each record. The remainder of the pad field will comprise arbitrarily padded data to obtain minimum frame size required. In the preferred embodiment, the first byte of the pad field contains the chaining information of Fig. 3, while the succeeding 4 bytes indicate the lengths of the blocked records. If the more bit M is on, and the 4 bytes are non zero as in Fig 4a, then it is known by the frame optimizer of the destination node that there are records chained in the data portion of the frame. In Fig. 4b, the pad field is shown for blocking a variable number of records. The bits in the first byte are all set to zero. The second byte "N" indicates the number of records blocked, and 11 - ln indicates the length of each of the records. A further byte or bytes in the pad field can be used to identify those nodes which are supporting this extension to the IEEE protocol. After the first communication from a device, these bytes are analyzed by the frame optimizer. Thereafter, it will or will not use frame optimization based on the prior communications from a node. In this manner, nodes having the extended capability can coexist with those not having the capability. In the flow diagram of Figs. 5a and 5b, records to be transmitted are received by the frame optimizer from the host or workstation. The next record is investigated to determine if it is too long for an optimum size frame. If it is too long, the record is broken into pieces that are compatible with the predetermined optimal frame size. To be compatible, each piece of the record should fit in the data field of the frame, and the total length of it including the other fields should be substantially equal to the predetermined optimal length. M is set equal to 1 in the frame, and the piece of the record and frame number are added to the frame which is then sent to the bus adapter for further encapsulation or field writing, such as the addition of destination and source information, and the redundancy check. If the last piece of the record was being encapsulated, M is set to zero, and the data and frame number are added to the frame before it is sent to the bus adapter. If the record was not too long, the flow in Fig. 5b is followed. The record is first added to the frame. A determination is then made if there is room for further records in the frame. If not, the frame is sent to the bus adapter. If there is further room, the next record is received. If it is too long, it is saved for the next frame, and the current frame is sent to the bus adapter where further padding is done. If the next record is not too long, it is added to the frame, and the record length fields for it, and the first record are added to the pad field. This continues for up to 4 records in the preferred embodiment, whereupon the frame is sent to the bus adapter for further encapsulation and transmission. In Fig. 6, the flow of the destination frame optimizer is detailed. A frame is first received from the bus adapter, and M is checked. If M is "one", or was "one" in the immediately previous frame, the data in the data field is added to a record in accordance with the frame number in the pad field. If M is "zero" in this frame, the record is complete, and is passed on to the application running on the host or workstation. If the frame was not part of a chaining operation, or in other words, neither of the last two frames had M set to "one", the length field in the pad field is investigated. If the length field does not indicate that multiple records are present, the record is distilled from the frame, and passed on to the application. To distinguish when neither chaining or blocking is being used, the second byte, N in Fig. 4b can be set to all 1's. In this case, the record is passed on to the application. If multiple records are present in the frame, they are distilled in accordance with the length representations, and then passed on to the application. While the invention has been described with respect to one or more embodiments, it will be understood by those skilled in the art that further embodiments are within the scope of the invention. The frame number bits in the chaining field of the pad field may be extended if the records are broken into too many frames to represent in seven bits. A further byte may be taken in frames where records are blocked to indicate that records are blocked rather than relying on the length fields containing data different from padding data. Further use of the pad field to identify whether a device supports this extension of the IEEE CSMA/CD standard is also within the scope of the invention.

Claims: Method for enhancing frame utilization in a CSMA/CD communication, taking place between a plurality of nodes composed of work stations (28) or a host (26) being connected through bus adapters (22) and frame optimizers (24) over a bus (20), said host,work stations and bus adapters comprising means for identifying data records to be transferred to another node and means coupled to the identifying means for transmitting said frames to the other nodes, said method including the steps of: forming the data records into frames to be transmitted; detecting length records to determine long or short records; if it is a long record then: inserting in said frames a chain field (PAD) to indicate that different frames to be transmitted contain data from the same record; inserting a more bit (M) in said chain field (PAD) of a frame to indicate that there is more data in a record; and inserting a frame number (F) in the pad field of a frame to indicate an ordering of data in a record. if it is a short record then: combining short records in a frame to be transmitted; inserting representations of the lengths of said combined short records in the pad field (PAD) of said frame; and inserting in said frames (fig4-a) the number of records contained in the same frame. Method for enhancing frame utilization in a CSMA/CD communication, according to claim 1, said communication taking place between a plurality of nodes composed of work stations or a host being connected through bus adapters and frame optimizers over a bus , said host,work stations and bus adapters comprising means for receiving frames from the network, said method further comprising the steps of: detecting if there are length representations in the pad field of a frame; assembling records in the frames in accordance with the length representations; and assembling a record from data from multiple frames having more bits and frame numbers. Method according to anyone of the claims 1 or 2, said method characterized in that: up to four records are transmitted in a single frame; the record length is compatible with a single line of text displayable on a CRT; and the record length is compatible with a single line of text printable by a printing device. Method according to anyone of the claims 1 to 3, said method characterized in that: the more bit (M) and frame number (F) comprise a single predetermined byte of the pad field of each frame; and the representations of field length each comprise a predetermined byte of the pad field of each frame. Method according to anyone of the claims 1 to 4, said method further comprising the steps of: indicating optimal frame size; and selecting between combining records in a single frame or breaking records into multiple frames to maintain an optimal size frame so that network bandwidth is improved. An apparatus for enhancing frame utilization in a CSMA/CD communication, taking place between a plurality of nodes composed of work stations (28) or a host (26) being connected through bus adapters (22) and frame optimizers (24) over a bus (20), said host, work stations and bus adapters comprising means for iden tifying data records to be transferred to another node and means coupled to the identifying means for transmitting said frames to the other nodes, said apparatus including: means for forming the data records into frames to be transmitted; means for detecting length records to determine long or short records; means for inserting in said frames a chain field to indicate that different frames to be transmitted contain data from the same record; means for inserting a more bit (M) in said chain field (PAD) of a frame to indicate that there is more data in a record; means for inserting a frame number (F) in the pad field of a frame to indicate an ordering of data in a record; means for combining short records in a frame to be transmitted; means for inserting representations of the lengths of said combined records in the pad field (PAD) of said frame; and means for inserting in said frames the number (fig4-a) of of records contained in the same frame. Apparatus for enhancing frame utilization in a CSMA/ CD communication, according to claim 6, said communication taking place between a plurality of nodes composed of work stations or a host being connected through bus adapters and frame optimizers over a bus , said host,work stations and bus adapters comprising means for receiving frames from the net work, said apparatus further including: means for detecting if there are length representations in the pad field of a frame; means for assembling records in the frames in accordance with the length representations; and means for assembling a record from data from multiple frames having more bits and frame numbers. Apparatus according to claims 6 or 7 characterized in that: up to four records are transmitted in a single frame; the record length is compatible with a single line of text displayable on a CRT; and the record length is compatible with a single line of text printable by a printing device. Apparatus according to anyone of the claims 6 to 8 characterized in that: the more bit (M) and frame number (F) comprise a single predetermined byte of the pad field of each frame; and the representations of field length each comprise a predetermined byte of the pad field of each frame. Apparatus according to anyone of the claims 6 to 9 characterized in that it further comprises: means for indicating optimal frame size; and means for selecting between said combining short records in a single frame or breaking long records into multiple frames to maintain an optimal size frame so that network band width is improved.

Inventors: JOHNSON JOHN MICHAEL, ROCKE JAMES ANDRE, UDUPA DIVAKARA K R, JOHNSON, JOHN MICHAEL, ROCKE, JAMES ANDRE, UDUPA, DIVAKARA K.R.
Applicants: IBM, INTERNATIONAL BUSINESS MACHINES CORPORATION
Application year: 1990
Main classification: H04L12
IPC codes: H04L12