PACKET DATA COMMUNICATION SYSTEM WITH RING TYPE TRANSMISSION LINE

Abstract: Packet data communication system comprises a ring type transmission line (1) for circulating a predetermined number of slots on which packets to be transmitted are loaded, and, interface nodes (2, 2′), provided between said ring type transmission line, for loading packets on slots and receiving packets from slots for terminals, in the interface node (2, 2′), there are a predetermined number of sub-transmission lines (S1-S4), for passing each of the slots in parallel through the interface node (2, 2′), terminal interfaces respectively having a plurality of sending buffers (25-28) for storing packets and a plurality of receiving buffers (25′-28′) for storing packets, switch (24, 24′) for connecting each of sending buffers (25-28) and receiving buffers (25, 25′) to any one of the sub-transmission lines (S1-S4).

Description: The present invention relates to a packet data communication system with a ring type transmission line represented by a local area network (LAN) and particularly to a high speed, large capacity packet data communication system for efficiently transmitting various data such as multiplexed voice, moving images and burst data, etc. From GLOBECOM'85 - IEEE "GLOBAL TELECOMMUNICATIONS CONFERENCE", December 1985, a data communication system is known comprising a ring type transmission line for circulating frames respectively including frame header and a predetermined number of slots on which packets to be transmitted are loaded and a plurality of interference nodes provided between said ring type transmission line for loading packets on slots and receiving packets from slots for terminals connecting thereto, wherein each of said interface nodes include a predetermined number of sub-transmission lines for passing each of said slots in parallel through the interface node terminal interfaces. Said prior art packet data communication system is a so-called 200 Mb/s multi-service optical LAN with a synchronized TDM loop structure. The LAN is quite suitable for applications integrating multiple services including video, image, data and voice in which each service uses its own communication speed, access method and mode indepedently. Advancement of hardware/software in the field of information processing field is notable in these years. With improvement in processing capability of computers, microprocessors, higher performance and spreading of communication terminals and work stations, larger file capacity such as optical disk and diversion of processing with development of diverged data bases a network has to be established between these hardware/software, and the volume of data within the network and between networks is increasing. In addition, improvement in function of image processing hardware/software and advent of TV conference systems requires a network which can handle unified high speed and large capacity image information in addition to the existing voice and data. Fig. 1 is an example of structure of said network (local area network). As the trunk network, a ring type transmission line 1 is employed. In the course of the ring type transmission line 1, a plurality of interface nodes 2 are provided and each interface node accommodates various systems. Namely, these are bus type local area networks for communication between a plurality of workstations 5, digital PABX 6, telephone sets and facsimiles connected and controlled by the digital PABX 6, remote unit 7 which accommodates data terminals, low speed ring type local area nework 8, communicaton control apparatus 11 of main frame computer 12 and adapter 10 which accommodates its TSS terminal, TV conference system 13 and composite multiplexing apparatus 9 for connection with high speed leased digital line. Each system is respectively connected with the high speed ring type network 1 through the interface node 2 and the system-to-system communication can be made through the control of such interface node 2. In addition, the high speed ring type network 1 is supervised by the supervisor node 3. As an access method to such ring type network 1, a slot ring system is proposed. In this slot ring system, a plurality of fixed length slots are circulating on the network 1, each interface node 2 detects the available slot, the data from the terminals accommodated in the own node is loaded to the detected available slot after it is converted to the packet data and then such packet data is sent to the other interface node 2. As a method of realizing high speed and large capacity network, it is possible to improve the transmission rate of packet itself or to transmit in parallel a plularity of packets without changing the transmission rate of packet. High speed operation of LAN has been realized almost solely by the former method because it is considered that the number of gates of the control circuits increases if the latter method is employed. Accordingly, investigation has been little made for the latter method. However, when considering realization of LAN having the transmission capacity in the order of several hundres Mb/s, the problems of this realization such as high power consumption of ECL circuit and "difficulty in handling" during debug/maintenance occur in the method for improving the transmission rate of packet. As an effective method for avoiding such problems it is considered to employ the parallel communication system where high speed and large capacity transmission is realized by transmitting in parallel a plurality of packets and each packet is processed by low speed TTL circuit. It is therefore an object of the present invention to provide a practical structure of the system for realizing packet communication system utilizing such a parallel communicaton system. A plurality of packets shall be efficiently transmitted and a plurality of packets shall be received from a plurality of transmission lines in said parallel communication system. The object is solved for a packet data communication system comprising: a ring type transmission line for circulating frames respectively including frame header and a predetermined number of slots on which packets to be transmitted are loaded; and a plurality of interface nodes provided between said ring type transmission line for loading packets on slots and receiving packets from slots for terminals connecting thereto, wherein each of interface nodes include a predetermined number of sub-transmission lines for passing each of slots in parallel through the interface node terminal interfaces, a synchronization means and a switch means; by the characterizing clause features of claim 1, i.e. in that each of said interface nodes respectively comprises a plurality of sending buffers for storing packets to be transmitted and a plurality of receiving buffers for storing packets to be received, packet processing means for detecting whether the slots on each of the sub-transmission lines are available or not and packet addressed on the slots, wherein said synchronization means are adapted for synchronizing the clock of the packet processing means to input frames using said frame header and for generating a plurality of timing signals to said packet processing means, and said switch means, controlled by said packet processing means, are adapted for connecting each of said sending buffers and receiving buffers to any one of said sub-transmission lines. It is advantageous that the overhead time of communication generated by composite handling of data in different characteristics such as voice and burst data is eliminated by the invention. Further embodiments and advantages of the invention will be described with reference to the following drawings, in which: Fig. 1 shows a structure of the Local Area Network, Fig. 2 shows a principle block diagram of this invention, Fig. 3 shows a frame format on the ring type transmission line, Fig. 4 shows a block diagram of an interface node, Fig. 5 shows a block diagram of a send interface, Fig. 6 shows a block diagram of a receive interface, Fig. 7 shows a block diagram of a packet processing circuit, Fig. 8 shows a block diagram of a control circuit, Fig. 9 shows a packet sending/receiving sequence of a system of the present invention, Figs. 10(A) ∼ (I) show the process of connecting sending/receiving buffers to sub-transmission lines, Fig. 11 shows another structure of an interface node, Fig. 12 shows another frame format of this invention. Throughout the above figures, the same numerals and symbols indicate same parts, and the signal lines having the symbol " " show that there actually exist a plurality of signal lines. Fig. 2 is principle block diagram wherein the ring type transmission line 1 is formed by a plurality of sub-transmission lines S1, S2, S3, S4 having the same transmission delay time. In this figure, the parallel transmitting of packets is carried out by four sub-transmission lines S1, S2, S3, S4. The transmission line 1 corresponding to the main tansmission line 1 is formed by a single line of optical fiber. Therefore, respective interface nodes 2, 2′ are provided with the series/parallel conversion circuits 21, 21′ and parallel/series conversion circuits 22, 22′ at the input and output sides of the transmission line 1 bit interleaved four packets on the transmission line 1 are disassembled into respective packets and the disassembled respective bits are multiplexed in bit. Therefore, the interface nodes 2, 2′ operates as if four sub-transmission lines S1, S2, S3, S4 were existing independently. 29 is a packet assembling circuit which stores the sequence of send data stream (SEND DATA) by assembling the send data stream flowing into the interface node 2 of sending side into the packets; 25, 26, 27, 28 are send buffers which accommodate the assembled plural packets of which sequence is stored in the packet assembly circuit 29; 24 is a switch which stores the sequence of each packet in the send buffers 25, 26, 27, 28 and transmits the packets to the transmission lines S1 - S4 in accordance with the condition of the sub-transmission lines S1, S2, S3, S4; 23, 23′ are packet processing circuits which detect the condition of packets on the sub-transmission lines S1 ∼ S4 and controls the switch 24; 24′ is a switch which stores said sequence on the sub-transmission lines S1 ∼ S4 and transmits the packets to the receive buffers 25′, 26′, 27′, 28′ in the same sequence as the accommodation sequence on the send buffers 25 ∼ 28; 29′ is a packet disassembling circuit which reforms the send data stream (SEND DATA) in the sequence in the receive buffers 25′ ∼ 28′. In Fig. 2, the input send data stream (SEND DATA) is assembled to a plurality of packets in the packet assembling circuit 29 and each packet is accommodated in the send buffers 25 ∼ 28 in such a manner as storing the sequence of send data stream. The sequence of these send buffers 25 ∼ 28 is stored by the switching operation of the switch 24 under the control of packet processing circuit 23 and the packets are sent to the sub-transmission lines S1 ∼ S4. The packet processing circuit 23′ accommodates the packets in the receive buffers 25′ ∼ 28′ in the same accommodation sequence at the send buffers 25 ∼ 28, keeping the sequence on the sub-transmission lines S1 ∼ S4. The packet disassembling circuit 29′ reconstructs the send data stream in the sequence on the receive buffers 25′ ∼ 28′. Here, the data format on the transmission line 1 is explained with reference to Fig. 3. In the abovementioned system, as indicated in Fig. 3, a plurality of frames consisting of four slots SLOT 1, 2, 3, 4 (accommodating packets) which are multiplexed in parallel by the bit interleave are circulated. In this case, at least four buffers are requried for sending and receiving sides so that four slots being transmitted in parallel can be accessed simultaneously. The packets stored in the send buffer are loaded to the slots SLT1 ∼ 4. Here, 1 ○ the sequencial relation between packets on the send buffers 25 ∼ 28, 2 ○ sequencial relation between packets on the transmission lines S1 ∼ S4, 3 ○ sequencial relation between packets on the receive buffers 25′ ∼ 28′ are defined as indicated below. [Sequencial relation of packets on the send and receive buffers] In case n send and receive buffers exist, the linear sequence (number) 1, 2, ....., n is given to the n buffers (packet group). If the h-th packet accommodated in the buffer g accommodating packet group is expressed as (g, h), the sequencial relation between different two packets (g, h) and (i, j) becomes (1) (g, h) < (i, j) when g < i under the condition that h < j or h = j; (2) (g, h) > (i, j) when g > i under the condition that h > J or h = j. Namely, a younger number of "row (horizontal)" is superior between packets of send and receive buffers and a younger number of "column (vertical)" is superior when the "row" is the same. It means that the packet having the younger "row" and "column" numbers for accommodation into the receive buffer is transmitted because its transmission sequence is considered minimum. [Sequencial relation between packets on the transmission lines] In case m slots to be transmitted on the sub-transmission lines in parallel exist, as the linear sequence number 1, 2, ...., n are given to such slots (SLT1, 2, 3, 4, ..., m) as indicated in Fig. 3. If the packet on the i-th slot of the frame passing the interface node at the time t is expressed as (i, t), the sequence between different two packets (i, t₁) and (j, t₂) becomes (1) (i, t₁) < (j, t₂) when i < j under the condition that t₁ < t₂ or t₁ = t₂; or (2) (i, t₁) > (j, t₂) when i > j under the condition that t₁ > t₂ or t₁ = t₂. Namely, when the passing time is different, the frame with quicker passing time is superior, when the passing time of frame is the same, the packet of slot having younger number is superior. This means that the slots of younger numbers of quicker frames are set precedingly in case of sending the packets from the send buffer and the quicker slots and younger slots are accommodated precedingly in case of accommodating slots into the receive buffer. Next, operations are explained along the transmission process indicated in Figs. 10A ∼ I with reference to Fig. 2. Here, estimated is an example where the 10 packet messages 1 ○, 2 ○, 3 ○, 4 ○, 5 ○, 6 #CIR#, 7 ○, 8 ○, 9 ○, are transmitted in parallel with four sub-transmission lines. As an example, the packet disassembling circuit 29' partitions the data stream into the packets of the fixed length and each buffer is accessed by sending the packet one by one to the buffers 25, 25', 26,26', 28, 28′, 27, 27′,........The packets may be transmitted in any sequence if the matching is established between the packet assembling circuit 29 and the packet disassembling circuit 29′. Transmission process 1 (Fig. 10A): The packet messages 1 ○, 2 ○, 3 ○ are sequentially accommodated in the send buffers 25, 26, 27. In this case, the send buffer pointer 30 which indicates the buffer storing the packet to be transmitted next indicates the send buffer 25. Nothing is yet transmitted to the sub-transmission lines S1 ∼ S4. The receive buffer pointer 30′ indicates the receive buffer 25′. The successive packets 4 ○, 5 ○, 6 ○, 7 ○, 8 ○, 9 ○, are sequentially accommodated later as indicated by the parentheses. Transmission process 2 (Fig. 10B): The packet processing circuit 23 detects that the slot 151 of frame 1 and the slot 153 of frame 1 are empty. In case there are three packets waiting for transmission by the buffer monitor 32 and the send buffer pointer 30 is in the buffer 25, the switch 24 connects the send buffer 25 to the slot 151 and the send buffer 26 to the slot 153. Thereby, the slot 152 of frame 1 and slot 154 of frame 1 passes through. Thereby,the stored packets 1 ○, 2 ○ are transmitted by giving the readout signal to the send buffers 25 and 26. The send buffer pointer 30 indicates the buffer 27. Therefore, the packet of the minimum "row" and "column" is extracted with the first priority and it is then transmitted to the youngest slot. The send buffers 25 and 26 accommodate respectively the successive packets 5 ○ and 6 ○ in place of 1 ○ and 2 ○. Such operations are also carried out in the transmission process 3 (Fig. 10C) and 4 (Fig. 10D). Transmission process 5 (Fig. 10E): The packets sent to the sub-tansmission lines S1 ∼ S4 as explained previously are then accommodated in the receive buffers 25′ ∼ 28′ from the sub-transmission lines S1 ∼ S4. Namely, the packet processing circuit 23′ detects that the packets 1 ○ and 2 ○ of the frame 1 match the self interface node addresses and the packets 1 ○ and 2 ○ are respectively accommodated in the receive buffers 25′ and 26′ since the receiver buffer pointer 30′ indicates the receive buffer 25′ (Fig. 10D). In this case, the switch 24′ switches the slot 151 of frame 1 to the buffer 25′ and the slot 153 of frame 1 to the buffer 26′ respectively and sets the receive buffer pointer 30′ to indicate the receive buffer 27′ by giving the write signal to the receive buffers 25′, 26′. Therefore, as explained previously, the packets having younger number among those in the quicker packets are sequentially accommodated in the sequence of receive buffer number. Such operations are also carried out in the transmission processes 6 ∼ 9 (Fig. 10F ∼ I). Thereby, packet sending and receiving come to the end. The practical structures of interface nodes 2, 2′ and supervisor node 3 are explained with reference to Fig. 3 and Fig. 4. The frame structure of Fig. 3 is first explained in deatail. The packet consisting of header part and information part is loaded to the slots SLT1 ∼ 4 corresponding to a plurality of sub-transmission lines S1 ∼ S4. Each packet is multiplexed by the bit interleave and is loaded to the packet part in the frame of transmission line 1. The frame header is added to the heading part of packet in the frame. This frame header is provided with the frame synchronization pattern for deciding each bit position of frame, frame counter which is instrinsic to one frame (discriminated from the other frame circulating on the same transmission line) and the region for loading the command transmitted between the interface node and the supervisoring node for reserving the slots for the synchronizing communication, or sent from the console connected to the supervisor node 3 at the time of initial start of system or during the test. Meanwhile, the heading part of packet is provided with the packet header being divided into four fields of control field CTL, receive address field RA, send address SA and data administration field DM. Moreover, the control field CTL is composed of the packet valid/invalid indication flag AV, reserved/not-reseved indication flat CM1, the flag CM2 which indicates that the data in the information part is the burst information, the flag PS which indicates that the packetis not received because the terminal interface 40 is busy and the flag ER which designated whether the flag AV is deleted by the send node or receive node. Moreover, the trailing part of packet is added with the check bit for detecting and correcting error of packet such check bit is provided at the trailing part of frame as in the case of each packet. The function of packet header will be explained later. Fig. 4 is a block diagram of the internal structure of the interface nodes 2,2′ and supervisor node 3. The optical fiber 1 corresponds to the main transmission line 1 in Fig. 1 and the frame having the structure consisting of a plurality of slots SLT1 ∼ 4 indicated in Fig. 3 circulates therein. The photoelectric converter 130 converts the received optical signal into the electric signal and then inputs said received signal after the waveform shaping to the frame synchronizing circuit 34 and serial/parallel conversion circuit 31. The frame synchronizing circuit 34 detects the frame synchronizing pattern added to the heading part of frame for frame synchronization and outputs various timing signals for deciding bit position of frame to the packet processing circuits 35, 36, 37, 38, control circuit 39 and series/parallel converting circuit 31. The series/parallel converting circuit 31 is driven by the clock signal synchronized with the frame on the transmission line 1 input from the frame synchronizing circuit 34 and outputs the parallel signal of 4 bits. This parallel signal is the packet loaded on each slot SLOT1 ∼ 4 in Fig. 3. The packet processing circuits 35 ∼ 38 analyze the packet header on the basis of the timing signal from the frame synchronizing circuit 34. The results of analysis of packet processing circuits 35 ∼ 38 are sent to the control part 39 through CONT BUSB. The control circuit 39 changes the switches 44 ∼ 47 based on the result of analysis and thereby sends the packets stored in the send buffers 25 ∼ 28 (existing in the send interface 42) within the terminal interface 40 to the parallel/serial converting circuit 33 through the send data bus and then executes the control for sending it to the transmission line 1 and to store the received packets to the receive buffers 25′ ∼ 28′ (existing in the receive interface 41) through the receive data bus. These controls are executed by the control signal transmitted through the CONT BUSA. The terminal inteface 40 is provided with the send interface 42 consisting of the switch 24, send buffers 25 ∼ 28 and packet assembling circuit 29 indicated in Fig. 1 and the receive interface 41 consisting of the switch 24′, receive buffers 25′ ∼ 28′ and packet disassembling circuit 29′. Fig. 4 indicates only one unit of terminal interface 40 but a plurality of units may be connected. The control circuit 39 decides the transmission mode (synchronous continuous communication or burst communication) depending on the send request from the terminal cnnected to the terminal interface 40. When the synchronous continuous communication is decided, a necessary number of slots are reserved, in accordance with the amount of information, to the supervisor node 3 using the packet header indicated in Fig. 3 by controlling the packet processing circuits 35 ∼ 38. Here, since the phase of parallel slots is the same in the frame structure indicated in Fig. 3, the packet headers reach the packet processing circuit simultaneously. Therefore, the packet processing circuits in the same number as the parallel slots must be prepared. In this case, such frame structure that the phases of slots transferred in bit multiplex to the ring type network are deviated for the specified amount as indicated in Fig. 2 is employed. The E of #2 slot ∼ #N slot indicates the dummy region in the same length as the frame header for time difference adjustment and the frame header is not provided up to the #2 ∼ #N slots. The structure of Fig. 4 is therefore changed into Fig. 11 and outputs S1 ∼ S4 of the serial/parallel converting circuit 31 are respectively input to the selector 52 through the delay circuits 48 ∼ 51. Since the frame synchronizing circuit 34 is capable of detecting the packet header of each packet, the packet header detection signal sent from the frame synchronizing circuit 34 is input to the selector 52 and only one of said outputs S1 ∼ S4 is input to the packet processing circuit 38 on the time division basis. The output to the receive data bus from the packet processing circuit 38 is also provided through the selector 54 on the time division basis. The output to the switches 44 ∼ 47 can also be provided by the selector 53 on the time division basis. The switch timing signals of selectors 52 ∼ 54 can be generated in the frame synchronizing circuit 34. With such structure, only one packet processing circuit is necessary and thereby the hardware can be saved. The delay circuits 48 ∼ 51 are provided for queuing the delay in operation of the packet processing circuit. As described previously, the packet communication system with ring type transmission line of the present invention is required to flexibly cope with the system where the communication (synchronous continuous communication) which is required to have periodicity in data transfer like the image communication or voice communication and the communication (burst communication) which is not required to guarantee the periodicity of data tansfer unlike the data communication between computers but is required to make small the transmission delay as much as possible coexist and communication mode changes dynamically. However, the slot ring system, where the empty slots (available slots) among the slots defined by dividing the frame circulated through the ring type transmission line for the specified length are seized and data transmission between the terminals connected to the ring type transmission line by loading the packets to such slots, must inevitably wait temporarily for transmission of data because if data transmission request, namley many requests for use of empty slots are generated at a time, the empty slots becomes shortage for request of use. Under such condition, the synchronous continuous communication which is restricted in the transfer periodicity will result in serious interference such as data overflow or data underflow, etc. In general, therefore, as a means for eliminating such disadvantage, the packets of the specified number which are circulated through the loop type transmission line are sorted to a couple of kinds, the one is the packets for synchronous continuous communication and the other is the packets for burst communication. For the former kind of packets, a number of communications is always set to a value less than the number of packets and the system design is defined considering that packets can be used any time desired for communication. However, this system provides a problem that flexibility is insufficient because the ratio between the synchronous continuous communication and burst communication is fixed and flexible measures for the system where the communication mode changes dynamically is difficult. Therefore, the packet communication system of the present invention assigns the packet numbers to the packets by providing the reserved information part to the specified region of packet. Moreover, the particular supervisor node 3 supervises assignment of reserved packets, notification of packet numbers and reserved assignment condition of packets, while ordinary interface node 2 reserves the packets having the numbers assigned to the self interface node and executes the packet send when the empty reserved packet arrives after reservation. Namely, in the packet management by the supervisor node 3, reservation of packets can be made variably when required so long as a sum of the number of packets being used and to be used does not exceed the total number of packets and thereby the packet management assures flexible measures for the communication system where the synchronous continuous communication and burst communication coexist. In view of explaining in detail the procedures for data transmission and reception, the structure of each part of Fig. 4 will then be explained in detail. Send interface 42 (Fig.5): As explained previously, the interface node 2 is provided with a plurality of terminal interfaces 40 and respective terminal interfaces are connected with terminals in different communication modes. Accordingly, prior to transmission, the terminal sets the signal which indicates the transmission mode (synchronous continuous communication or burst communication) to the register 61 in the send interface 42. Simultaneously, in case the send mode is the synchronous continuous communication, the terminal also sets the receive terminal address and amount of send data to the register 61. Upon setting the send request to the register 61, the terminal sends the send data and receive address to the packet assembling circuit 29. The packet assembling circuit 29 adds the header part and check bit to the send data and assembles the packet in the specified length as indicated in Fig. 3. In this case, the receive address is set to the field RA in the packet header, while the interface node address to which the packet itself belongs and the address of terminal connected are set to the field SA. Each flag of CTL field is controlled by the packet processing circuits 35 ∼ 38. The packets sequentially assembled in the sequence of the input data stream in the packet assembling circuit 29 are sequentially stored in the send buffers 25, 26, 27, 28, 25, ....., 26, 27, 28, in accordance with said sequential relation definition of packets. In this case, the address of buffer for storing is designated by sequentially counting up the write address counter 59. The send buffers 25 ∼ 28 temporarily store the packets to be input from the packet assembling circuit 29 and the output side of buffers 25 ∼ 28 can be connected with any send data bus through the switch 24. The buffer monitor 32 monitors a number of packets stored in the send buffers 25 ∼ 28 and notifies the result of monitoring to the control circuit 39 through the CONT BUSA. The buffer pointer 30 designates one buffer in which the packet to be read next is stored. The selection and control part 62 decodes the send packet indication signal input from the control circuit 39 through the CONT BUSA and a designated value of buffer pointer 30 to control the connection between the buffers 25 ∼ 28 and send data buses S1 ∼ S4 by changing over the switch 24 and gives the readout instruction to the buffer in which the packets to be sent are stored. Receive interface 41 (Fig. 6): Structure of receive interface 41 is similar to the send interface 42 indicated in Fig. 5 and therefore only difference is explained hereunder. The input side of the receive buffers 25′ ∼ 28′ can be connected with any receive data buffer through the switch 24′. Moreover, the buffer monitor 32 monitors a number of packets stored in the receive buffers 25′ ∼ 28′. The buffer pointer 30′ designates the buffer for storing the packets to be received next. The selection and control circuit 63 decodes the receive packet indication signal sent from the control circuit 39 and content of buffer pointer 30′, makes switching control of the switch 24 and the sends the write indication signal to the buffer to which the received packets are stored. As in the case of write address counter 59 indicated in Fig. 5, the read address counter 71 sequentially designates the buffers to read the packets like the receiver buffers 25′, 26′, 27′, 28′, 25′,.... 27′, 28′. In above explanation, four send/receive buffers are provided to four parallel transmission lines S1, S2, S3, S4, but it is not always required that a number of parallel transmission lines corresponds to a number of buffers on the one to one basis and there is no such correspondence by providing a switch between the transmission line and buffers because each buffer can be connected to any transmission lines S1 ∼ S4. Packet processing circuits 35, 36, 37, 38 (Fig. 7): Fig. 7 indicates the structure of the packet processing circuit. Since the packet processing circuit is the same, the structure of only one circuit is indicated. The timing signal which is sent to each part for deciding the bit position of received packet from the frame synchronization circuit 34 is here eliminated for simplification of figure. The packets on the SLOTs 1 ∼ 4 (Fig. 3) of the transmission lines S1 ∼ S4 are input to the shift register 72. The shift register 72 is driven by the timing signal synchronized with the received packets and when these packets are all input, contents of control field CTL are input to the control field decoder 74, contents of receive address field RA are input to the receive address comparison circuit 75, and contents of send address field are input to the send address comparison circuit 76. The address of interface node 2 and address of each terminal to be accommodated to the interface node 2 are previously set to the register 77 by MPU 43 through the CONT BUSB. The control field decoder 74 displays condition of received packets in accordance with the following table by decoding contents of the control field CTN. The receive address comparison circuit 75 compares the address of RA field of received packet and the address being set to the register 77, detects whether or not the received packet is destinated to the own interface node with reference to the output of the control field decoder 74 and also detects the terminal address being accommodated in the own interface node. When the receive addresses have matched, the receive address match signal BRSELn is sent together with the terminal address. The send address comparison circuit 76 compares the address of SA field of received packet and the address being set to the register 77 and detects whether or not the packet is transmitted from own interface node with reference to the output of the control field decoder 74. All bits of received packets are input to the check circuit 73 and parity check is carried out. The control signal generating circuit 79 generates the following control signals in accordance with the decoding result of control field decoder 74, comparison result of receive address comparison circuit 75, comparison result of send address comparison circuit 76 and receive buffer busy signal from the control circuit 39 (RBBSYk). n is the slot number dealt with the packet processing circuit. 1 ○ Received slot available (AVAILn) When the slot is unused The packet to the own interface node is received without error and the AV flag can be deleted in the receive station When the packet sent from the own node is received after circulation (when end of reception of each node is decided at the own station during communication to a plurality of nodes) 2 ○ Setting of each flag of control field CTL (SETFRn) 3 ○ Indication of synchronous continuous slot (SYNCn) 4 ○ Remote station receive buffer busy (BSYn) The packets sent from the own node are not received due to the remote staion receive busy state. The SETFRn among above signals is input to the packet header renewal circuit 78 to set the valid/invalid indication flag AV in the control field CTL of the header of receive packet to be input in the same way and reservation indication bit CM1. With the SELECT signal from the control circuit 39, the switching control of the selection circuit 147 is carried out so that the packet from the header renewal circuit 78 is allowed to pass through the selection circuit 147 or the data from the header renewal circuit 78 is used only for the control field of the header and the packets on the send data bus are output for the other part, and thereby the packets are output to the transmission lines S1 ∼ S4. Control circuit CONT 39 (Fig. 8): Since the control circuit CONT 39 is provided in common for the packet processing circuits 35 ∼ 38 and a plurality of terminal interfaces 40, a plurality of control signals are also used to/from respective portions. But in Fig. 8, such control signal is simplified. The receivable packets are input to the receive packet control circuit 80 from the buffer monitor 32′ of each receive interface 41 through CONT BUSA and the receive address coincidence signal RBSELn (including terminal address) is also input thereto from the packet processing circuit. The received packet control circuit 80 refers two control signals input and judges whether these can be received or not. When these are receivable, the slot number based on RBSELn is informed to the terminal interface 40 based on the receive address. If receive buffers are inshortage, the receive buffer busy signal (RBBSY) is issued to the corresponding packet processing circuit. The terminal send request analysis circuit 82 reads the register 61 within each send interface 42 with a constant period. The communication mode and a number of requested slots are set to the register 61. Therefore, the terminal send request analysis circuit 82 inputs a number of send requests and a number of requested slots of synchronous continuous communications to the synchronous continuous communication management circuit 83 and moreover a number of send requests and a number of requested slots of the burst communication to the burst communication management circuit 85. The allocated slot management circuit 81 is provided with a table for storing the frame counter given to each terminal interface for the synchronous continuous communication and the slot numbers (SLOT1, 2, 3, 4) in the frame. When the frame header is input to the frame synchronous circuit 34, the frame synchronous circuit 34 detects the frame counter and said frame is input to the allocated slot management circuit 81. With this frame counter used as the address, the allocated slot management circuit 81 reads that the j-th slot is allocated to the k-th terminal interface from the table and notifies it to the synchronous continuous communication management circuit 83. Renewal of table content (renewal of allocated frame, slot information) is executed by MPU 43 through CONT BUSA and MPU43 reads table content and confirms the allocated frame and slot information. The synchronous continuous communication management circuit 83 generates the send select signal for the synchronous continuous communication from the inputs sent from the terminal send request analysis circuit 82 and allocated slot management circuit 81 and AVAILn and SYNCn from the packet processing circuits 35 ∼ 38. Namely, when AVAILn and SYNCn are input from the packet processing circuit corresponding to the n-th slot, the allocated slot number and receive slot match and these are available, indicating that the terminal which has reserved the slot n in the table can be used for the synchronous continuous communication. Therefore the send select signal is transmitted to the terminal interface which accommodates the reserved terminal. This send select signal is input to the select control circuit 62 of the send interface through the CONT BUSA. The burst communication management circuit 85 sets the terminal interfaces with priority l ∼ m for the burst communication depending on the information sent from the terminal send request analysis circuit 82 and inputs the burst data to the burst data selection control circuit 86. The available slot analysis circuit 84 judges how many slots is avaialble for the burst communication from the AVAILn and SYNCHn signals and then inputs the signals to the burst data selection control circuit 86. Namely, when only AVAILn is input (SYNCHn is not input), the n-th slot is not reserved and it can be allocated for the burst communication. The burst data selection and control circuit 86 allocates the available slots sequentially from the terminal interface having a higher order depending on the determined priority sequence and then outputs the send select signal for the burst communication. The select signals for synchronous continuous communication and burst communication are input to the send packet control circuit 88 and the send select signal for controlling the selection circuit 147 in the packet processing circuit and the send select signal input to the selection control circuit 62 in the send interface are output. The register 87 holds the terminal interface of the lowest priority among the terminal interfaces to which the slots are allocated in the burst data selection and control circuit 86 and then determines the terminal interface with highest priority in the next frame. Respective circuits have been explained previously in detail and the packet send sequence is then explained with reference to Fig. 9. 1 ○ For the reservation for synchronous continuous communication by the terminal accommodated to the terminal interface 40, the send mode (the mode is the same as burst communication in the case of reservation), receive address and a number of packets required for transmission are set first to the register 61. 2 ○ The send data is input to the packet assembling circuit 29 in order to form a packet and it is then stored in the send buffers 25 ∼ 28. In this case, the receive address RA in the packet header is the supervisor node and moreover the receive address and a number of packets required actually and data which indicates reservation request for the synchronous continuous communication exist within the information region of packet. 3 ○ The control circuit 39 recognizes the send mode. Because of the burst communication, the priority sequence explained for Fig. 8 is given to the relevant terminal interface. The specified empty slot is seized depending on such priority sequence and the packet in the send buffer is received by the supervisor node. 4 ○ The supervisor node is also provided with the structure as indicated in Fig. 4 like other interface node and the allocated slot management circuit 81 of the control circuit 39 is also provided with tables for all nodes. In addition, MPU is accommodated in the terminal interface within the supervisor node. Therefore, information of packet destinated to own node is notified to CPU through the terminal interface. CPU makes reference to the table of allocated slot management circuit 81 of the control circuit 39 and checks whether the actual party for communication of the relevant terminal has already reserved the packet or not. When the communication party does not yet reserve the packet, leaving the requested number of packets unreserved, the table is renewed, the relevant terminal is reserved and registered, end of reservation is notified to the relevant terminal with the ordinary burst communication and the packet number allocated by reservation, frame number and slot number are also notified. When the other party has already reserved the packet or the reserved number of packets are not available, reservation disable signal is sent to the relevant terminal. 5 ○ The relevant terminal which has received the end of reservation requests renewal of table to MPU. The slot number and relevant terminal address are stored to the table with the allocated frame number used as the address. 6 ○ Data is set to the register 61 depending on the synchronous continuous communication request of the relevant terminal. Upon decision of synchronous continuous communication, the control circuit 39 turns on the reservation indication flag of packet header of the packet of a slot number after the relevant terminal address and such slot number are read from the table with the frame number used as the address. The control circuit waits until the valid/invalid indication flag of packet of this slot indicates invalid condition. 7 ○ When it is detected that the valid/invalid indication flag indicates invalid condition, the packet stored in the send buffer is transmitted. In this case, the header is updated so that the valid/invalid indication flag indicates the valid condition. 8 ○ In the case of ordinary burst communication which does not set reservation, the packet is sent with the receive address considered as the ordinary terminal as in the case of step 3 . 9 ○ The interface node which has received this packet sends this packet to the receive terminal and checks whether there are send data from the terminal in the own node. In case there is no send data, the valid/invalid indication flag indicates the invalid condition and the received packet is directly sent. In case there is send data, it is checked whether such send data is reserved or not. In case this data is reserved , the processing same as that in the step 10 is carried out. In case such send data is not reserved, the valid/invalid indication flag of received packet indicates the valid condition and data is transmitted. According to the above method, in order to perform the communication between the interface node and the supervisory node for sending the request of reserving the slots from the interface node or for informing the interface node the allowance of reservation and the reserved slot number from the supervisory node, it is necessary to access the empty slots so that it is required to wait until the empty slots are indicated. So, as described with Fig. 3, it is efficient to use the field for the command of frame header. Namely, the field is allocated to the interface nodes and the supervisory node for the management of the network, so that this field is not used as many as the slots. Then, describing the structure to perform above method with reference to Fig. 4. O/E 130 outputs the frame of Fig. 3 to the frame header processing 148 The Frame header processing 148 is driven by the timing signals from the frame synchronizing circuit 34 and is set the field of command (command field) of frame header at the shift register 11. The contents of the command field are decoded at the frame header processing 148 and output the decoded signal to the CONT 39 via CONT BUSB. When the request of reservation of the slots are sent to the CONT 39, CONT 39 is gating the output corresponding to the command field from the shift register 11 and, on behalf of the gating output of the shift register 11 CONT 39 is set the command for reservation to the shift register 12. Then, the shift register 12 output the up-to-date frame header in series to the switch 150 in accordance with the timing signal from the frame synchronizing circuit. At this time, switch 150 select the output of the frame header processing 148. After output from the frame header processing 148 ends, the switch 150 immediatly select the output from P/S converter 33 so that the frame header is added to the packet header and the frame is completly reconstructed.

Claims: Packet data communication system comprising: a ring type transmission line (1) for circulating frames respectively including frame header and a predetermined number of slots on which packets to be transmitted are loaded, and a plurality of interface nodes (2, 2'), provided between said ring type transmission line (1), for loading packets on slots and receiving packets from slots for terminals connecting thereto, wherein each of interface nodes (2, 2') include, a predetermined number of sub-transmission lines (S1-S4), for passing each of slots in parallel through the interface node terminal interfaces (40, 41, 42), synchronisation means (34) and switch means (24, 24'; 44-47) characterized in that each of said interface nodes (2, 2') respectively comprises a plurality of sending buffers (25-28) for storing packets to be transmitted and a plurality of receiving buffers (25'-28') for storing packets to be received, packet processing means (23, 23'; 35-38) for detecting whether the slots on each of the sub-transmission lines are available or not and packet addressed on the slots, wherein said synchronization means (34) are adapted for synchronizing the clock of the packet processing means (23, 23'; 35-38) to input frames using said frame header and for generating a plurality of timing signals to said packet processing means (23, 23'; 35-38), and said switch means (24, 24'; 44-47), controlled by said packed processing means (23, 23'; 35-38), are adapted for connecting each of said sending buffers (25-28) and receiving buffers (25'-28') to any one of said sub-transmission lines (S1-S4). Packet data communication system as set forth in claim 1, characterized by each of the slots consisting of a packet header area including a control field for indicating the condition of the slots and an address field for indicating the packet send terminals and packet receive terminals, and a packet information area, said packet processing means (23, 23′; 35-38) being adapted to analyse said packet header area. Packet data communication system as set forth in claim 2, wherein said sending buffers (25-28) are adapted to sequentially store the packets in accordance with transmitting order of each packets, said slots have a predetermined priority sequence, and, said packet processing means (23, 23′; 35-38) are adapted to control said switch means (24, 24′; 44-47) for connecting the sending buffers (25-28) storing the packets of the first transmitting order to the sub-transmission lines (S1-S4) passing the slots of the higher priority sequence to which packets are not loaded. Packet data communication system as set forth in claim 3, wherein each of said receiving buffers (25′-28′) has a packet receiving order, and said packet processing means (23, 23′; 35-38) are adapted to control said switch means (24, 24′; 44-47) for connecting the sub-transmission lines (S1-S4) passing the slots of the higher priority sequence on which the packets to be received are loaded to the receiving buffers (25′-28′) having the higher packet receiving order. Packet data communication system as set forth in claim 2, wherein said control field includes a first flag for indicating whether the slot is available or not, and a second flag for indicating whether the slot is reserved for synchronizing data communication. Packet data communication system as set forth in claim 5, wherein said packet processing means (23, 23′; 35-38) include a control field analyser (74) for decoding said control field, and an address field analyser (75) for decoding whether the received packet is for the connecting terminals or not, the control means (39) having a table for memorizing the reserved slots number for the connecting terminals, and a terminal request decoder (82) for detecting which terminal request to send packets and whether synchronizing data communication is requested or not, whereby said control means (39) are adapted to control the switch means (24, 24′; 44-47) in accordance with the signal from said control field analyser (74) and address field analyser (75). Packet data communication system as set forth in claim 6, wherein said packet processing means (23, 23′; 35-38) include up-to-date means (78) for rewriting each flag of the control field in accordance with the signal from said control field analyser (74), address field analyser (75) and control means (39). Packet data communication system as set forth in claim 7, wherein said sending buffers (25-28) are adapted to sequentially store the packets in accordance with the transmitting order of each packet, said slots have a predetermined priority sequence, and said control means (39) are adapted to control said switch means (24, 24′; 44-47) of the terminal interface (40) to which the requesting terminal connects the buffers storing the packets of the first transmitting order to the sub-transmission lines (51-54) for passing the slots of the higher priority sequence in order to load the packets stored in the sending buffers (25-28) when said field analyser indicate said slots are available. Packet data communication system as set forth in claim 8, wherein, when said control means (39) detect that synchronizing data communication is requested from the terminal, that passing slots on the sub-transmission lines (S1-S4) are reserved for said requesting terminal with reference to said table and that said passing slots are available, said control means (39) are adapted to control the switch means (24, 24′; 44-47) of the sending buffer (25-28) of said terminal. Packet data communication system as set forth in claim 7, wherein, when said control means (39) detect that synchronizing data communication are requested from the terminals, that passing slots on the sub-transmission lines (S1-S4) are reserved to said requesting terminal and that said passing slots are not available or packet receive terminals of passing slots are coincident with the connecting terminals, said control means (39) are adapted to control up-to-date means to settle said second flag of said slots for indicating reserved slots. Packet data communication system as set forth in claim 8, wherein, when said address field analyser (75) detects that packet receive terminals of passing slots are coincident with the connecting terminals each of receiving buffers (25′-28′) have the packet receiving order, said control means (39) are adapted to control said switch means (24, 24′; 44-47) of the terminal interfaces of said connecting terminals for connecting the sub-transmission lines (S1-S4) passing slots of the higher priority sequence to the receiving buffers having the higher packet receiving order in order to receive the packets from said slots. Packet data communication system as set forth in claim 11, wherein, when said terminal request decoder (82) detects that no terminal requests to send packets, said control means (39) are adapted to control up-to-date means to settle said first flag of said slots for indicating available slots. Packet data communication system as set forth in claim 11, wherein, when said terminal request decoder (82) detects that the terminals request to send packets, said control means (39) are adapted to control up-to-date means to settle said first flag of said slots for indicating inavailable slots, and adapted to control said switch means (24, 24'; 44-47) to connect the sending buffers to said sub-transmission lines (S1-S4). Packet data communication system as set forth in claim 6, further comprising a supervisor node (3), provided between said ring type transmission line (1), for supervising the packet header areas of each slots in order to detect the conditions of each slots and memorizing them in table and for managing non-reserved slots by said table so as to allow each interface nodes reserve said non-reserved slots. Packet data communication system as set forth in claim 14, wherein said interface nodes (2) are adapted to send the packets indicating the requests of the slot reservation, the number of necessary slots corresponding to the amount of the synchronizing data and receive terminals, and said supervisor node (3), when it receives said packets, is adapted to check the contents of said packets with reference to said table, to allocate some of the non-reserved slots to said interface nodes and to inform said interface of the reserved slot numbers by the packets. Packet data communication system as set forth in claim 15, wherein, when said interface nodes (2) receive the packets from said supervisor node (3), said control means (39) are adapted to store the reserved slot numbers at said table. Packet data communication system as set forth in claim 16, wherein the communication between said interface nodes (2, 2′) and said supervisor node (3) are performed to use the address field and the packet information area of each slots. Packet data communication system as set forth in claim 16, wherein each of said frame header includes the command area using for communicating between said interface nodes and said supervisor node.

Inventors: AWAZU, TOMOHIKO, FUKUDA, HARUKI, HIGUCHI, MASAHIRO, MATSUDA, MASAHIRO, TAZAKI, KENSHI
Applicants: FUJITSU LIMITED
Application year: 1987
Main classification: H04L12
IPC codes: H04L12