JPH0720159B2 - Execution management processing method in communication control processing device - Google Patents

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention is based on a high-level data transmission procedure (HDLC).
The present invention relates to an execution management processing method in a communication control processing device that performs information transmission / reception processing on a frame-by-frame basis. The present invention relates to an execution management processing method in a control processing device.

[Prior Art] The processing in the layer II can be roughly classified into low-level processing and high-level processing. Here, the low-level processing is to interface with a physical layer (Layer I) that is the lower layer adjacent to the low-level processing, transmit / receive a bit stream from or to the opposite device, detect a flag,
It is a process that performs frame detection, frame check sequence (FCS) check, and field decomposition.

The high-level processing is processing for performing link management, order control, error control, etc. from the contents of each field.

As an execution management processing method in a communication control processing device that realizes such layer II processing, a method that realizes the above-mentioned lower level processing by hardware and the higher level processing by firmware by a general-purpose microprocessor is proposed. Has been done.

This method is described in "Evaluation and Verification of ISDN Protocol Processor (SE87-84)" in Technical Report on Literature, Vol.87, "Technical Research Report of IEICE, Published by The Institute of Electronics, Information and Communication Engineers". Have been described.

FIG. 2 is a functional diagram showing the configuration of a conventional communication control processing device, focusing on the processing at the time of transmitting and receiving a frame serving as an information flow.

In this illustrated example, an ISDN layer II protocol processing device (hereinafter referred to as SIG) 1 corresponds to the communication control processing device, and this SIG 1 is connected to the opposite device 2 and the host device 3.

The operation will be described below.

When the SIG1 receives a frame from the opposite device 2, the SIG1 performs the following process as a receiving operation.

1) The reception event processing circuit 10 pulls out a buffer for storing a reception frame from the empty buffer pool 11.

2) After storing the information of the received frame in the buffer, the reception event processing circuit 10 queues the reception of the frame in the main queue (also called the execution management queue or the processing waiting queue) 12.

3) The information stored in the buffer stays in the main queue 12.

4) The frame reception processing 13 extracts the information accumulated in the main queue 12 and LAP-D (Link Access
Procedure on the D channel) process.

This LAP-D is described in "ISDN User Network Interface (JT-920, JT-Q921)" in the document TTC standard "User Network Interface, Volume 2, Volume 1 (Published by: Telegraph and Telephone Technical Committee). , Is typical of the processing in Layer II.

5) Information is notified to the higher-level device 3, and the reception processing circuit 30 of the higher-level device 3 performs reception processing.

6) When the reception process in the upper level device 3 is completed, the buffer release processing circuit 14 converts the empty buffer into an empty buffer pool.
Store in 11.

If it is necessary to issue a delivery confirmation frame, the following processing is performed.

i) The frame reception processing circuit 13 pulls out a buffer for sending the delivery confirmation frame from the empty buffer pool 11 and queues the sending of the delivery confirmation frame in the main queue 12.

ii) Information of the delivery confirmation frame is retained in the main queue 12.

iii) In the frame transmission processing circuit 15, the information of the delivery confirmation frame is extracted from the main queue 12 and the transmission confirmation frame is transmitted.

iv) By the buffer release processing circuit 14 after the transmission processing,
Store an empty buffer in the empty buffer pool.

When transmitting a frame from the host device 3,
SIG1 performs the following processing as a transmission operation.

A) In response to a buffer allocation request from the upper level device 3,
SIG1 pulls an empty buffer out of the empty buffer pool 11 by the buffer allocation processing circuit 16 and notifies it to the higher-level device 3.

B) The transmission processing circuit 17 of the higher-level device 3 stores the information and notifies the transmission event processing circuit 18 of the transmission request.

C) The transmission event processing circuit 18 queues in the main queue 12 that there is a transmission request.

D) Information on the transmission frame remains in the main queue 12.

E) The main queue 12 by the frame transmission processing circuit 15
Information of the transmission frames accumulated in the LAP-
D processing is performed.

F) After the transmission is completed, the information stored in the buffer is retained in the unconfirmed I frame pool 19.

When the delivery confirmation frame is received, the following processing is performed.

A) The reception event processing circuit 10 draws an empty buffer for storing the acknowledgment frame from the empty buffer pool 11.

B) Reception event processing circuit after the frame is stored
10 queues in the main queue 12 that the delivery confirmation frame has been received.

C) The information of the delivery confirmation frame is retained in the main queue 12.

D) The frame reception processing circuit 13 releases the buffer in the unconfirmed I frame pool 19 and the delivery confirmed frame storage buffer.

Note that in FIG. 2 described above, the symbol “− ○ →” indicates a specific flow of information stored in the buffer, and the numeral attached to the left shoulder of the symbol “○”, the Roman numeral, Codes such as katakana indicate the stage of the procedure, and correspond to the codes used in the description of each processing procedure described above.

If the above processing contents are captured as an execution management processing method,
It looks like Figure 3.

That is, the processing by the firmware takes out an interrupt level 40 processed by an external input / output request and one of various processing requests staying in the main queue 12 as a normal operation, and analyzes the request contents. , Which can be roughly divided into those of the base level 50 which perform each processing.

Here, as shown in the figure, in the processing at the interrupt level 40, the content of the input / output request is analyzed by the interrupt analysis circuit 41, and the transmission event processing circuit 18, the reception event processing circuit 10, and the buffer allocation are performed according to the request. Processing is performed by the processing circuit 16, the buffer release processing circuit 14, and the like.

Also, the processing at the base level 50 is performed by the main queue 12
And a frame transmission processing circuit 15 and a frame reception processing circuit
13 and are used for execution management.

The I-frame transmission processing in this execution management processing method is the fourth
Follow the flow chart in the figure.

The processing shown in FIG. 4 is performed by the "ISDN user / network interface (JT-920, JT-JT-920, JT-)" in the document TTC standard "User / Network Interface, Volume 2, Volume 1 (Published by: Telegraph and Telephone Technical Committee)." Q921) ”.

Next, the flow chart of FIG. 4 will be described.

The multiframe setting in the figure shows the internal state of SIG1.

When the DL-data request is notified as an I frame transmission request from the upper device in the multi-frame setting state (step 101), the I frame is squeezed into a sub queue (also called an I frame transmission waiting queue) as the transmission event processing described above. At step 102, a transmission request (I frame is connected to the queue) is issued to the main queue to notify that there is a transmission request (step 103).

As a result, the request remains in the queue and returns to the multiframe setting state (step 104).

Next, when the event fetched from the main queue is a transmission request (step 105), it is determined as a frame communication process whether or not the I frame of the corresponding data link can be transmitted.

The determination as to whether or not the data can be transmitted is performed in two steps: whether or not the other party is busy (step 106) and whether [V (S) = V (A) + K] is satisfied (step 107). Done.

If transmission is possible, first, the first I frame connected to the sub queue of the corresponding data link is taken out (step 108) and the I frame is transmitted.

The process of transmitting the I frame includes a process of setting [P = 0] (step 109) and a process of further transmitting the I command (step 110).

Further, after the transmission is started, the transmission state variable is updated [V (S) = V (S) +1] in order to retain the transmission frame in the unconfirmed I-frame pool as post-processing (step 11
1) Further, the confirmation pending state is cleared (step 112), the timer is in operation (step 113), and various timers are stopped and started (step 114) in order, and the multi-frame setting state (step Return to 116).

In the series of I frame transmission processing, when it is judged that the other party is busy or cannot transmit due to [V (S) = V (A) + K], a transmission request is generated again (step 15).

Then, the event stays in the main queue and returns to the multi-frame setting state (step 116).

The above operation is performed for each link because the data link specification supports multiple links.

FIGS. 5 (a), (b), and (c) show the I-frame transmission processing by the event operation in the main queue.

As shown in FIG. 5 (a), when the DL-data request from the higher-level device is notified, the transmission event processing circuit 18 performs the processing at the interrupt level, and the transmission request event is put in the main queue 12. , Select the sub-queue of the link for the event from the multiple sub-queues 12 _A , 12 _B , ... 12 _N prepared for each link in advance, put information in the sub-queue, and finish the process. To do.

Next, at the base level, when one event staying in the main queue 12 is taken out and it is a transmission request event and can be transmitted by the frame transmission processing circuit 15, as shown in FIG. 5 (b). , The head information in the sub-queue 12 _N of the corresponding link is extracted and transmitted.

When transmission is impossible, the transmission request event is returned to the main queue again as shown in FIG. 5 (c).

[Problems to be Solved by the Invention] However, in the conventional execution management processing method shown in FIG. 5, when a DL-data request is notified from a higher-level device, it is also shown in FIG. 5 (a). As described above, all the transmission request events are put in the main queue regardless of the number of pieces of information already stored in the subqueue.

As a result, there are many cases where transmission becomes impossible,
There is a possibility that a situation in which the transmission process is repeatedly used unnecessarily often causes problems such as an increase in processing time and a decrease in processing efficiency.

There is also a disadvantage that a circuit having a large capacity is required as a circuit forming the main queue.

The present invention has been made in view of the above circumstances, and at the time of frame transmission processing in a communication control processing device, wasteful processing when frame transmission is impossible is minimized to reduce processing time and improve processing efficiency. Can improve
Moreover, it is an object of the present invention to provide an execution management processing method capable of reducing the capacity of the circuit forming the main queue.

[Means for Solving the Problem] In the execution management processing method according to the present invention, a main queue for accumulating an event indicating the processing content of an input frame, and information of the frame for maintaining the order of processing It is an execution management processing method in a communication control processing device, which includes a sub-queue for accumulating for each data link and performs transmission / reception processing of information in frame units based on a high-level data transmission procedure. Specifically, an event input selection function and an event circulation function are provided as means for solving the above problems.

Here, the event input selection function detects, when a frame is input, the number of pieces of information already stored in the sub-queue in which the information of that frame should be accumulated, and when the number of pieces of information is a certain number or more, This is a function to prevent the event of that frame from being stored in the main queue.

In addition, the event circulation function detects the number of information remaining in the sub-queue that has accumulated the information for the event when processing the event accumulated in the main queue, and when the information remains. Is a function for returning the event extracted from the main queue to the main queue again.

Then, in the execution management processing method according to the present invention, the number of events staying in the main queue is adjusted to a fixed number or less for each data link by utilizing these event input selection function and event circulation function.

[Operation] In the execution management processing method according to the present invention, the number of events retained in the main queue is changed to the number of information retained in the sub queue prepared for each data link by the event input selection function and the event circulation function. Based on this, the number of events staying in the main queue can be suppressed to the necessary minimum for each data link by adjusting the number of events to a fixed number or less for each data link.

Therefore, it is possible to prevent a situation where many events for the data link that cannot be transmitted are accumulated in the main queue, and to minimize the wasteful processing when the frame cannot be transmitted, and reduce the processing time. In addition, the processing efficiency can be improved.

In addition, since the number of events staying in the main queue is adjusted to a fixed number or less, the capacity of the circuit forming the main queue can be reduced, and the hardware cost of the device can be reduced.

[Embodiment] FIGS. 1 (a), (b), (c) and FIG. 6 show an embodiment of an execution management processing system in a communication processing apparatus according to the present invention.

The execution management processing method of this embodiment is shown in FIG.
As shown in (b) and (c), a main queue 12 for accumulating an event indicating the processing content of an input frame, and information of the frame for each data link A, B, in order to maintain the order of processing. Sub queues 12 _A , 12 _B , ... 12 _N that accumulate for each _N
And. And High Level Data Transmission Procedure (HDLC)
An execution management processing method in a communication control processing device that performs transmission / reception processing of information on a frame basis based on the following. In short, in the transmission processing of an I frame, useless transmission processing for an untransmittable data link is minimized. This is a problem that should be solved.

Specifically, it has an event input selection function 61 as shown in FIG. 1 (a), and an event circulation function 62 as shown in FIG. 1 (b).

Here, the event input selection function 61 performs processing by the transmission event processing circuit 18 at the interrupt level when a frame (I frame) is input (that is, when a DL-data request from the host device is notified). To improve
The number of pieces of information already stored in the sub-queue (I-frame transmission waiting queue) in which the information of that frame should be stored is detected, and if there is information that is stored, the main queue 12 of the event of that frame is detected. This is a function that avoids the accumulation of data and only puts information in the sub-queue of the corresponding link.

In the example of FIG. 1 (a), although information A3 is stored in the sub-queues 12 _A, because already there are two information A1, A2 in the sub-queues 12 _A, the event is a new main It will not accumulate in queue 12.

Further, the event circulation function 62 detects the number of information remaining in the sub-queue that has accumulated the information for the event when one event staying in the main queue 12 at the base level is extracted and processed. hand,
If the information remains in the sub queue, the event retrieved from the main queue 12 is re-created in the main queue 12.
It is a function to return to.

The example of FIG. 1 (b) shows a case where one event staying in the main queue 12 is taken out at the base level and it is a transmission request event for the link N and transmission is possible. In this case, since the I frame information still remains in the sub queue 12 _N , the processed event n is returned to the main queue 12 again.

In the execution management processing method of this embodiment, these event input selection function 61 and event circulation function 62 are used to
The number of events staying in the main queue 12 is adjusted to one for each data link.

When transmission is impossible in the frame transmission processing, the transmission request event is returned to the main queue 12 again by the frame transmission processing circuit 15, as shown in FIG. 1 (c).

The procedure of the I frame transmission process in the above embodiment will be described based on the flowchart of FIG.

Although the processing of this embodiment is composed of steps 200 to 207 and steps 301 to 314, a significant difference from the conventional I frame transmission processing procedure is that steps 202, 206,
The steps 305, 308, etc. are newly added.

First, in the multiframe setting state (step 200), when a DL-data request is notified as an I frame transmission request from the host device (step 201), the sub queue of the notified data link (I frame transmission waiting queue) is notified. It is determined whether or not the value of the I queue counter detecting the number of rare information (the number of I frames) is "0" (step 202).

When it is "0", the transmission request (I frame is connected to the queue) is put in the main queue (execution management queue) (step 204), and the I frame information is put in the corresponding data link sub queue (step 205). , Increments the value of the I queue counter of the corresponding data link (step 206).

If the value of the I queue counter is not "0", no transmission request is generated, the information of the I frame is put into the sub queue of the corresponding data link (step 205), and the value of the I queue counter of the corresponding data link is set. Count up (step 206).

When step 206 is completed, the multi-frame setting state is restored again (step 207).

On the other hand, when the information fetched from the main queue is a transmission request (step 301), it is determined whether or not the other party's reception is busy as a frame transmission process (step 30).
2) and whether [V (S) = V (A) + K] are established (step 303), and based on these determinations, whether the I frame of the corresponding link can be transmitted or not Is determined.

If the transmission is possible in steps 302 and 303, the head I frame connected to the sub queue of the corresponding data link is taken out (step 304), and the value of the I queue counter of the corresponding data link is counted down (305), As the process of transmitting the I frame,
A process of setting [P = 0] (step 306) and a process of transmitting an I command (step 307) are performed.

Then, after starting the transmission, it is judged whether or not the value of the I queue counter of the corresponding data link is "0" (step 30).
8) If not "0", the transmission request is put in the main queue (step 309).

After the value of the I queue counter is determined, as a subsequent process, the update of the transmission state variable [V (S) = V (S) +1] is executed (step 310), and the confirmation pending clear is executed (step 310). 311).

Then, the judgment that the timer is operating is executed (step 31
2) and stop and start various timers (Step 3
13), return to the multi-frame setting state (step 31)
Five).

In the series of I frame transmission processing, when it is determined that the transmission cannot be performed due to busy reception of the other party or [V (S) = V (A) + K], a transmission request is generated again (step
314), the information stays in the main queue and returns to the multi-frame setting state (step 315).

As is apparent from the above description, in the execution management processing method of the one embodiment, the number of events retained in the main queue 12 is prepared for each data link by the event input selection function 61 and the event circulation function 62. Sub-cue 12 _A , 1
_2B , ... Adjusts to a fixed number or less for each data link based on the number of information retained in 12 _{N. The} number of events retained in the main queue 12 is the minimum required for each data link. Can be suppressed to

Therefore, it is possible to prevent a situation in which a large number of events for the data link that cannot be transmitted are accumulated in the main queue 12, and to minimize unnecessary processing when a frame cannot be transmitted, thus reducing the processing time. It is possible to shorten and improve the processing efficiency.

Moreover, since the number of events staying in the main queue 12 is adjusted to a fixed number or less, the capacity of the circuit forming the main queue 12 can be reduced, and the hardware cost can be reduced. .

In the above-mentioned embodiment, the event input selection function 61 is
When a frame (I frame) is input, the number of pieces of information already stored in the sub queue (I frame transmission waiting queue) in which the information of that frame is to be stored is detected, and even one piece of the stored information is detected. If it exists, the event of the frame is prevented from being accumulated in the main queue 12, but the accumulation is avoided only when the number of pieces of information retained in the sub queue is a certain number or more (for example, two or more). A method is also conceivable.

Further, the number of events staying in the main queue 12 is not limited to one for each data link as in the embodiment. For example, considering the processing speed of the frame transmission processing circuit 15 and the like, even if it is limited to an arbitrary constant number such as 2 or less, or 3 or less for each data link, useless transmission processing is performed. The effect can be increased in reducing.

[Effects of the Invention] As described above in detail, in the execution management processing method according to the present invention, the number of events retained in the main queue is prepared for each data link by the event input selection function and the event circulation function. The number of events staying in the main queue can be minimized for each data link because the number of events staying in the main queue is adjusted to a fixed number or less for each data link based on the number of information staying in the sub queue. .

Therefore, it is possible to prevent a situation where many events for the data link that cannot be transmitted are accumulated in the main queue, and to minimize the wasteful processing when the frame cannot be transmitted, and reduce the processing time. In addition, the processing efficiency can be improved.

In addition, since the number of events staying in the main queue is adjusted to a fixed number or less, the capacity of the circuit forming the main queue can be reduced, and the hardware cost of the device can be reduced.

[Brief description of drawings]

FIGS. 1 (a), (b), and (c) are explanatory views of the I frame transmission processing in one embodiment of the present invention, FIG. 2 is a functional explanatory view of a conventional communication control processing device, and FIG. FIG. 4 is a flow chart showing the procedure of a conventional I-frame transmission process, and FIGS. 5 (a), (b), and (c) are conventional execution management processes, respectively. FIG. 6 is an explanatory diagram of I frame transmission processing in FIG. 6, and FIG. 6 is a flowchart showing a procedure of I frame transmission processing in one embodiment of the present invention. 12 …… Main queue, 12 _A , 12 _B , …… 12 _N …… Sub queue, 15 …… Frame transmission processing circuit, 18 …… Transmission event processing circuit, 61 …… Event input selection circuit, 62 …… Event circulation function .

Claims (1)

[Claims] 1. A high-level system comprising a main queue for accumulating events indicating processing contents of an input frame, and a sub-queue for accumulating frame information for each data link in order to maintain processing order. This is an execution management processing method in a communication control processing device that performs information transmission / reception processing in frame units based on a data transmission procedure.When a frame is input, the information of that frame has already accumulated in the sub-queue. The number of stored information is detected, and if the number of information is more than a certain number, the event input selection function to prevent the event of the frame from being accumulated in the main queue is provided When processing an event, the number of information remaining in the sub-queue that has accumulated the information for that event is detected, and if the information remains. Has an event circulation function that returns the events fetched from the main queue to the main queue again. By using these event input selection function and event circulation function, the number of events staying in the main queue is fixed for each data link. An execution management processing method in a communication control processing device, characterized in that the number is adjusted to be less than or equal to a number.