JP2008278241A - Transmitting device, transmitting device control method and transmitting device control program - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To detect an error during connecting frames. <P>SOLUTION: An identifier for determining whether a connection relation during connecting divided frames is correct is stored in a prescribed storing part, and when frame connection information is used to connect the divided frames, the identifier stored in the prescribed storing part is used to determine a connection relation is correct. Concretely, in each divided frame, a front identifier for determining whether a connection relation with another frame to be connected at the front part of the divided frame is correct and a rear identifier for determining whether a connection relation with another frame to be connected at the rear part of the divided frame are stored in a prescribed storing part, and about the two frames to be connected by using the frame connection information, the rear identifier of a frame to be a front stage and the front identifier of a frame to be a rear stage are used to determine whether the connection relations are correct. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

  The present invention relates to a transmission apparatus, a transmission apparatus control method, and a transmission apparatus control program.

  2. Description of the Related Art Conventionally, when a received frame is transmitted to another transmission apparatus, there is a transmission apparatus (for example, a switch or the like) that buffers this frame from the reception of the frame to the transmission. In such a transmission apparatus, a common buffer system in which all the transmission queues use one memory is mainly used by partitioning the memory into a plurality of areas having a fixed size, instead of arranging a memory for each transmission queue. ing. In the transmission apparatus employing such a common buffer system, various devices have been devised for the purpose of efficiently using a buffer that is partitioned into fixed-size areas (unit buffers).

  For example, there is a transmission apparatus that buffers a frame by using a field programmable gate array (FPGA) or an application specific integrated circuit (ASIC). In such a transmission apparatus, a memory chip is mounted outside the FPGA or ASIC due to a capacity problem, and when this memory chip is mounted, a memory is not arranged for each transmission queue, but a single memory. The common buffer method for storing all transmission queues is mainly employed.

  Further, for example, as shown in FIG. 21, in a transmission apparatus adopting a common buffer system, a common buffer is partitioned for each unit buffer that is a fixed size area, and each unit buffer is uniquely identified. Information is allocated. When a frame is received, if the frame is larger than the unit buffer, the frame is divided and then stored in the unit buffer (see FIG. 21). Then, as shown in FIG. 22, for each unit buffer, free information indicating which area (unit buffer) is a frame (data) non-storage area in the common buffer is stored (see “free information management table” in FIG. 22). ) For each received frame, queue pointer information indicating the position of the unit buffer storing the first frame and the position of the unit buffer storing the last frame in the divided and stored frames is stored ( For each divided frame, as information for managing the storage location of the divided frame, information indicating whether it is the last frame in the divided frame, and the rear part The combination information indicating the position of the unit buffer in which the frame to be combined is stored is stored (“join information management table in FIG. 22). Reference). FIG. 21 and FIG. 22 are diagrams for explaining the common buffer system according to the prior art.

  For example, as shown in FIG. 22, in the common buffer method, when the frames stored in the unit buffer are combined and read, the transmission apparatus first stores the first frame in the divided frames. The position of the unit buffer is acquired (“2” is acquired in the example shown in (1) of FIG. 22). Thereafter, the combined information is sequentially acquired from the position of the unit buffer in which the acquired first frame is stored (in the examples shown in (2) to (4) in FIG. 22, “EOQ: 0, Next: 5”, “EOQ : 0, Next: 8 "," EOQ: 1, Next: (None) "is acquired). Here, when information indicating the last frame (“EOQ = 1” in the example shown in FIG. 22) is acquired, the frames are sequentially read out and combined based on the acquired combination information, and the unit buffer from which the frame is read out Is stored in the empty information management table as an unstored area (see (5) in FIG. 22), and the joining process is terminated successfully.

  For example, in Patent Document 1, a type representing a state (for example, whether data is stored or whether the stored data uses a plurality of unit buffers) in each area (unit buffer) of the buffer. And a technique for managing the buffer by associating and storing information indicating a corresponding area (unit buffer) in the buffer.

JP-A-4-333946 (page 1-2, FIG. 1)

  By the way, the above-described conventional technique has a problem that an error cannot be detected when frames are combined. As a result, there is a problem in that the coupling process runs out of control (falls into a loop state) by performing an incorrect coupling process.

  For example, in the example illustrated in FIG. 22, when erroneous combination information is acquired due to setting change or noise during operation when combining frames, for example, as illustrated in (6) of FIG. After acquiring the combined information for “”, if “7” instead of “8”, which is an appropriate unit buffer address, is erroneously acquired, there is a problem that it is not possible to recognize that the address is not an appropriate unit buffer address. It was. As a result, for example, as shown in (6) of FIG. 22, “EOQ = 1” that should have been acquired cannot be acquired, so the processing does not end, and thereafter, “7”. As a result of acquiring “9” as the position of the unit buffer storing the frame to be combined in the rear part of the frame and continuing the combining process, the combining process runs out of control (falls into a loop state).

  Accordingly, the present invention has been made to solve the above-described problems of the prior art, and a transmission apparatus, a transmission apparatus control method, and a transmission apparatus control program capable of detecting an error when combining frames. The purpose is to provide.

  In order to solve the above-described problems and achieve the object, the invention according to claim 1 divides a frame to be transmitted and stores it in a plurality of unit buffers, and for each divided frame, An address that uniquely identifies a unit buffer in which another frame to be combined in the rear part is stored is stored in a predetermined storage unit as frame combination information, and the divided frames are combined using the frame combination information An identifier storage means for storing an identifier for determining whether or not a connection relationship when the divided frames are combined is correct in a predetermined storage unit, and the frame combination When combining the divided frames using information, an identifier stored in the predetermined storage unit is used to determine whether the connection relationship is correct. A coupling judging means, characterized by comprising a.

  Further, in the invention according to claim 2, in the above invention, the identifier storage means has a correct coupling relationship with each of the divided frames and other frames combined at the front portion of the divided frames. And a forward identifier for determining whether or not a backward identifier for determining whether or not the connection relationship with other frames combined in the rear part of the divided frame is correct is stored in a predetermined storage unit. The combination determination means stores the two frames combined using the frame combination information by using the backward identifier of the preceding frame and the forward identifier of the subsequent frame to determine whether the combination relation is correct. It is characterized by determining whether or not.

  Further, in the invention according to claim 3, in the above invention, the identifier storage means has a correct connection relationship with each of the divided frames and other frames combined at the front portion of the divided frames. As a forward identifier for determining whether or not, information for uniquely specifying a unit buffer in which the other frame is stored is stored in a predetermined storage unit, and the combination determination unit uses the frame combination information For the two frames to be combined, it is determined whether or not the connection relationship is correct by determining whether or not the previous frame is stored in the unit buffer specified by the forward identifier of the subsequent frame. It is characterized by determining.

  According to a fourth aspect of the present invention, in the above-described invention, for each of the divided frames, a frame that is to be combined with a rear portion of another frame that is to be combined with a rear portion of the frame is stored. A recovery identifier storage means for storing an address that uniquely identifies a unit buffer as a recovery identifier in a predetermined storage unit, and the combination determination means between two frames combined using the frame combination information When the combination relation is determined to be incorrect by the recovery identifier stored in the predetermined storage unit, the recovery identifier corresponding to the frame combined in the further front part of the previous frame is selected. Read and control to combine the frame stored in the unit buffer specified by the recovery identifier with the rear part of the previous frame And that the coupling control means, and further comprising a.

  The invention according to claim 5 is the storage information storage means for storing, in the above-mentioned invention, storage information indicating whether or not a frame is stored in each unit buffer for each unit buffer in a predetermined storage unit. For each unit buffer, the storage information stored in the predetermined storage unit is monitored to determine whether or not a predetermined time has elapsed since the storage information indicating that the frame is stored is stored. A storage time determining unit that, when the storage time determining unit determines that a predetermined time has passed for a predetermined unit buffer, releases the predetermined unit buffer so that no frame is stored. And a buffer release means.

  The invention according to claim 6 divides a frame to be transmitted and stores it in a plurality of unit buffers, and for each divided frame, another frame to be combined with the rear part of the frame. A transmission device for controlling a transmission device for storing an address uniquely identifying a stored unit buffer as frame combination information in a predetermined storage unit and combining and transmitting the divided frames using the frame combination information In the control method, the transmission apparatus stores an identifier for determining whether or not a coupling relationship when the divided frames are combined is correct in a predetermined storage unit, and the transmission When a device combines the divided frames using the frame combination information, the combination is performed using an identifier stored in the predetermined storage unit. Engagement, characterized in that it contains a binding determination step of determining whether correct or not.

  The invention according to claim 7 divides a frame to be transmitted and stores it in a plurality of unit buffers, and for each divided frame, another frame to be combined with the rear part of the frame. A method of controlling a transmission apparatus that stores an address that uniquely identifies a stored unit buffer in a predetermined storage unit as frame combination information, and combines and transmits the divided frames using the frame combination information. A transmission apparatus control program to be executed by a computer, an identifier storing procedure for storing an identifier for determining whether or not a connection relationship when the divided frames are combined is correct in a predetermined storage unit; When combining the divided frames using frame combination information, using the identifier stored in the predetermined storage unit, And binding determination procedure for determining whether the focus relationship is correct, and characterized by causing a computer to execute the.

  According to the first, sixth, and seventh aspects of the present invention, the transmission apparatus stores an identifier for determining whether or not the coupling relationship when the divided frames are combined is correct in the predetermined storage unit, and When combining divided frames using combination information, an identifier stored in a predetermined storage unit is used to determine whether the combination relationship is correct, so errors are detected when frames are combined. Is possible. In other words, if a determination result indicating that there is an error is dealt with (for example, the process is terminated, the process is interrupted, the process is stopped, etc.), the process runs out of control by performing an incorrect combination process. (Falling into a loop state) can be prevented.

  According to the second aspect of the present invention, the transmission apparatus determines, for each divided frame, whether or not the connection relationship with the other frame combined at the front portion of the divided frame is correct. And a backward identifier for determining whether or not the connection relationship with other frames combined in the rear part of the divided frame is correct is stored in a predetermined storage unit, and frame combination information is stored. For the two frames to be combined, the backward identifier of the previous frame and the forward identifier of the subsequent frame are used to determine whether or not the connection relationship is correct. Can be reliably detected. In other words, if a determination result indicating that there is an error is dealt with (for example, the process is terminated, the process is interrupted, the process is stopped, etc.), the process runs out of control by performing an incorrect combination process. (Falling into a loop state) can be prevented.

  In addition, according to the invention of claim 3, the transmission apparatus determines, for each divided frame, whether or not the connection relationship with the other frame combined at the front part of the divided frame is correct. As a forward identifier, information that uniquely identifies a unit buffer in which the other frame is stored is stored in a predetermined storage unit, and two frames to be combined using the frame combination information By determining whether or not the preceding frame is stored in the unit buffer specified by the forward identifier, it is determined whether or not the coupling relationship is correct. It is possible to reliably detect errors when combining. In other words, if a determination result indicating that there is an error is dealt with (for example, the process is terminated, the process is interrupted, the process is stopped, etc.), the process runs out of control by performing an incorrect combination process. (Falling into a loop state) can be prevented.

  According to the invention of claim 4, the transmission apparatus stores, for each divided frame, one frame after another to be coupled to the rear part of another frame to be coupled to the rear part of the frame. An address that uniquely identifies a unit buffer is stored in a predetermined storage unit as a recovery identifier, and the coupling determination unit determines that the coupling relationship is not correct between two frames that are coupled using frame coupling information. If a recovery identifier stored in the predetermined storage unit is read, a recovery identifier corresponding to a frame combined at a further front part of the preceding frame is read and specified by the recovery identifier. Since the frame stored in the unit buffer is controlled to be combined with the rear part of the previous frame, it can be determined whether or not the combination destination is correct. No, when the coupling destination is wrong, it is possible to recover a binding process by reading the correct coupling destination.

  According to the invention of claim 5, the transmission device stores, for each unit buffer, storage information indicating whether or not a frame is stored in each unit buffer in a predetermined storage unit, and for each unit buffer, The storage information stored in the predetermined storage unit is monitored to determine whether or not a predetermined time has elapsed since the storage information indicating that the frame is stored is stored. When it is determined that a predetermined time has passed, the predetermined unit buffer is released so that no frame is stored, so that an area that is not released but should be released should be released. It is possible to use buffer resources effectively.

  Exemplary embodiments of a transmission apparatus, a transmission apparatus control method, and a transmission apparatus control program according to the present invention will be described below in detail with reference to the accompanying drawings. In the following, the outline and features of the transmission apparatus according to the present embodiment, the configuration of the transmission apparatus, and the flow of processing will be described in order.

[Outline and features of transmission equipment]
First, the outline and characteristics of the transmission apparatus according to the present embodiment will be described with reference to FIG. FIG. 1 is a diagram for explaining the outline and features of the transmission apparatus according to the first embodiment.

  As shown in the figure, the transmission apparatus according to the first embodiment stores information for managing the storage destination of the divided frames for each divided frame, as shown in the “joining information management table” in FIG. To do. Specifically, “EOQ” information indicating whether or not the divided frame is the last frame and “Next” indicating the position of the unit buffer in which the frame to be coupled to the rear part is stored are stored in association with each other. To do.

  The transmission apparatus according to the first embodiment divides a frame to be transmitted and stores the divided frames in a plurality of unit buffers, and for each divided frame, another frame to be combined with the rear part of the frame. Is stored in the combined information management table as frame combined information. Specifically, when the frame is divided into three and stored in the unit buffers “2”, “5”, and “8” in order, “EOQ: 0” and “Next: 5” are stored in the unit buffer “2”. "EOQ: 0" and "Next: 8" are stored in correspondence with the unit buffer "5", and "EOQ: 1" and "Next: (None)" are stored in the unit buffer. Store in correspondence with “8”.

  Then, the transmission apparatus according to the first embodiment combines and transmits the divided frames using the frame combination information. Specifically, when the frame is divided into three and stored in order in the unit buffers “2”, “5”, and “8”, for example, the unit buffer “2” is read, and then the unit buffer “2” Unit buffer “5” corresponding to “Next: 5” of unit buffer “5”, unit buffer “8” corresponding to “Next: 8” of unit buffer “5” is read out, unit buffer “2”, “ The frames stored in “5” and “8” are sequentially read out, combined and transmitted.

  As will be described below, the transmission apparatus having such an outline can detect an error when combining frames, and the processing is runaway by performing an incorrect combining process (falling into a loop state). ) Is the main feature.

  That is, the transmission apparatus according to the first embodiment uses identifiers for determining whether or not the connection relationship when the divided frames are combined is the identifier, as shown in the “identifier information management table” in FIG. Store in the information management table.

  Specifically, in the example illustrated in FIG. 1, the transmission apparatus according to the first embodiment divides a frame into three and stores them in unit buffers “2”, “5”, and “8” in order. Stores the same information (for example, “123”) in the forward identifier stored in the “Next Code” of the unit buffer “2” and the backward identifier stored in the “Before Code” of the unit buffer “5”. Further, the same information (for example, “542”) is stored in the forward identifier stored in “Next Code” of the unit buffer “5” and the backward identifier stored in “Before Code” of the unit buffer “8”.

  Then, when the transmission apparatus according to the first embodiment combines frames that are divided using the frame combination information, the transmission apparatus determines whether the combination relationship is correct by using the identifier stored in the identifier information management table. . Specifically, it is determined whether or not the backward identifier of the preceding frame and the forward identifier of the subsequent frame are the same between two frames combined using the frame combination information. For example, when it is determined that the connection relationship is correct, the connection process is continued, and when it is determined that the connection relationship is not correct, the process ends.

  More specifically, the transmission apparatus according to the first embodiment determines “Next Code” and “Before Code” between two frames derived by “Next”. Specifically, in the example shown in FIG. 1, when the unit buffer “5” is derived in accordance with “Next: 5” as shown in (1) of FIG. “Next Code: 123” of “2” and “Before Code: 123” of the unit buffer “5” are the same (comparison match), and it is determined that the connection relationship is correct. On the other hand, as shown in (2) of FIG. 1, when the unit buffer “7” is erroneously derived in accordance with “Next: 8”, the “Next Code: 542 ”and“ Before Code: 697 ”of the unit buffer“ 7 ”are not the same (comparison mismatch), and it is determined that the connection relationship is not correct. For example, when it is determined that the connection relationship is correct, the connection process is continued, and when it is determined that the connection relationship is not correct, the process ends.

  For this reason, the transmission apparatus according to the first embodiment can detect an error when combining frames as described above. Then, if a determination result indicating that there is an error is dealt with (for example, the process is terminated, the process is interrupted, the process is stopped, etc.), the process runs out of control by performing an incorrect combination process. (Falling into a loop state) can be prevented.

[Configuration of Transmission Apparatus in Embodiment 1]
Next, the configuration of the transmission apparatus according to the first embodiment will be described with reference to FIG. FIG. 2 is a block diagram illustrating a configuration of the transmission apparatus according to the first embodiment. As shown in the figure, the transmission apparatus includes a frame input unit 10, a frame output unit 20, a control unit 30, and a storage unit 40. Note that the description of the configuration of the transmission apparatus shown in the present embodiment focuses only on the portions closely related to the present embodiment, and the description related to other configurations is the same as the conventional transmission apparatus, Omitted or concise.

  The frame input unit 10 receives frames from other transmission apparatuses. In addition, the frame output unit 20 outputs the frames combined by the reading unit 33 described later to another transmission apparatus.

  The storage unit 40 stores and stores data necessary for various processes performed by the control unit 30. In particular, those closely related to the present invention include a common buffer 41, a queue pointer storage unit 42, a combined information storage unit 43, an identifier storage unit 44, and a free information storage unit 45.

  The common buffer 41 includes a plurality of unit buffers, and buffers received frames and includes a memory or the like. Specifically, it is partitioned by unit buffers which are fixed-size areas, and information for uniquely identifying each unit buffer is allocated to each unit buffer constituting the common buffer.

  The cue pointer storage unit 42 stores cue point information for each received frame. Specifically, as shown in FIG. 3, for each received frame, a “transmission queue number” indicating a number for uniquely identifying a transmission queue for transmitting the received frame, and a queue pointer in the corresponding transmission queue are set. In association with a “queue pointer number” indicating a uniquely specified number, “Head” indicating an address for uniquely specifying a unit buffer storing a head frame in the divided frame, and a divided frame In the “queue pointer management table”, “Tail” indicating an address for uniquely specifying the unit buffer in which the last frame is stored. Furthermore, for each transmission queue, “queue pointer write side address” indicating which queue pointer number is currently used when writing a frame, and which queue pointer when reading a frame for each transmission queue. The “queue pointer read side address” indicating whether the number is currently used is stored in the “queue pointer management table” in association with any queue pointer number for each transmission queue.

  For example, in the example illustrated in FIG. 3, when the frame of the transmission queue “2” is stored in the queue pointer “3”, the queue pointer storage unit 42 divides the frame into three and stores the unit buffer “2”. When the data is stored in the order of “5” and “8”, that is, when the first frame is stored in the unit buffer “2” and the last frame is stored in “8”, “transmission queue 2” and “8” In association with the queue pointer number: 3, “Head: 2” and “Tail: 8” are stored in the “queue pointer management table”. FIG. 3 is a diagram illustrating an example of the queue pointer stored in the queue pointer storage unit according to the first embodiment.

  The combined information storage unit 43 stores information for managing the storage destination of the divided frames for each divided frame. Specifically, as shown in FIG. 4, for each unit buffer, a “unit buffer address” indicating an address for uniquely identifying the unit buffer, and the last frame in the frame obtained by dividing the frame stored in the unit buffer address. “EOQ” indicating whether or not the frame is the tail frame and “Next” indicating the position of the unit buffer storing the frame to be combined with the rear part of the frame stored in the unit buffer address are associated with It is stored in the “management table”. For example, in the example shown in FIG. 4, when the frame is divided into three and stored in order in the unit buffers “2”, “5”, and “8”, that is, the first frame is stored in “2”. When the frame connected to the rear part of “2” is stored in “5” and the frame (the last frame) connected to the rear part of “5” is stored in “8”, “unit buffer address: “EOQ: 0” and “Next: 5” are stored in association with “2”, “EOQ: 0” and “Next: 8” are stored in association with “unit buffer address: 5”, and “ “EOQ: 0” and “Next: 10” are stored in association with the unit buffer address: 7, and “unit buffer address: 8”, “EOQ: 1”, and “Next: (no)” are stored. And remember. FIG. 4 is a diagram illustrating an example of combined information stored in the combined information storage unit according to the first embodiment.

  The identifier storage unit 44 stores an identifier for determining whether or not the connection relationship when the divided frames are combined is correct. Specifically, as shown in FIG. 5, for each unit buffer, an “unit buffer address” and an identifier for identifying whether or not the frame is combined with the rear part of the frame stored in the unit buffer address. The “rear identifier” indicating the “forward identifier” indicating the identifier for identifying whether or not the frame is combined with the front portion of the frame stored in the unit buffer address is associated with the “identifier information management table”. Remember. For example, in the example shown in FIG. 5, when the frame is divided into three and stored in order in the unit buffers “2”, “5”, and “8”, that is, the first frame is stored in “2”. If the frame connected to the rear part of “2” is stored in “5” and the frame (the last frame) connected to the rear part of “5” is stored in “8”, A “rear identifier” (for example, “123”) and a “front identifier” (for example, “123”) for “5” are stored in association with each other, and a “rear identifier” for “5” (for example, “542”). )) And “front identifier” (for example, “542”) for “8” are stored in association with each other. FIG. 5 is a diagram illustrating an example of identifiers stored in the identifier storage unit according to the first embodiment.

  The empty information storage unit 45 stores empty information indicating which area (unit buffer) in the common buffer is an unstored frame (data) area for each unit buffer. Specifically, as shown in FIG. 6, a unit buffer that is a frame (data) non-storage area is uniquely identified in association with a “vacant information management number” that is a number for uniquely identifying free information. The “empty unit buffer address” indicating the address to be stored is stored in the “empty information management table”. In addition, an “empty information writing side address” indicating which empty unit buffer address is currently used when writing a frame, and “an empty unit buffer address currently used when reading a frame” is indicated. The “vacant information reading side address” is stored in the “vacant information management table” in association with any empty unit buffer address.

  For example, in the example illustrated in FIG. 6, the empty information storage unit 45 divides the frame into three parts, which are sequentially stored in the unit buffers “2”, “5”, and “8”, and the empty information write side address “1”. ”Is stored in association with“ free information management number: 2 ”and“ free unit buffer address: 2 ”is stored, and“ free unit buffer address: 3 ”is stored in association with“ free information management number: 3 ”. 5 ”,“ empty unit buffer address: 8 ”is stored in association with“ free information management number: 4 ”, and“ free information management number: 4 ”is stored in association with“ free information writing side address ”. Remember. FIG. 6 is a diagram illustrating an example of vacancy information stored in the vacancy information storage unit according to the first embodiment.

  The control unit 40 is a processing unit that has a program that defines various processing procedures and the like and an internal memory for storing required data, and executes various processes using these programs. In particular, what is closely related to the present invention includes a storage unit 31, an identifier assigning unit 32, a reading unit 33, and a combination determination unit 34, as shown in FIG. The identifier assigning unit 32 corresponds to “identifier storage unit” described in the claims, and the combination determination unit 34 corresponds to “connection determination unit” described in the claims.

  The storage unit 31 divides a frame to be transmitted and stores it in a plurality of unit buffers in the common buffer 41, and stores another frame to be combined with the rear part of the frame for each divided frame. An address for uniquely specifying the unit buffer is stored in the combined information storage unit 43 as frame combined information. In addition, a “write side address” indicating a “queue pointer number” used for writing is set in the queue pointer storage unit 42 and the empty information storage unit 45. Details of the processing by the storage unit 31 will be described later with reference to FIGS.

  The identifier assigning unit 32 stores an identifier for determining whether or not the connection relationship when the divided frames are combined is correct in the identifier storage unit 44. Specifically, for each divided frame, a front identifier for determining whether or not the connection relationship with other frames combined at the front part of the divided frame is correct, and the divided frame Is stored in the identifier storage unit 44 for determining whether or not the connection relationship with other frames combined in the rear part of the frame is correct. For example, in the two frames to be combined, the same information is assigned to the rear identifier of the frame combined with the front portion and the front identifier of the frame combined with the rear portion and stored in the identifier storage unit 44. Details of processing by the identifier assigning unit 32 will be described later with reference to FIGS. 7 and 8.

  The reading unit 33 combines the divided frames using the frame combination information stored in the combination information storage unit 43. Further, “read side address” indicating “queue pointer number” used for reading is set in the queue pointer storage unit 42 and the empty information storage unit 45. Details of processing by the reading unit 33 will be described later with reference to FIGS. 9 and 10.

  The combination determination unit 34 uses the identifier stored in the identifier storage unit 44 to determine whether the combination relation is correct when combining the divided frames using the frame combination information. Specifically, with respect to two frames to be combined using the frame combination information, it is determined whether or not the connection relationship is correct by using the backward identifier of the preceding frame and the forward identifier of the subsequent frame. More specifically, it is determined whether the rear identifier of the preceding frame and the front identifier of the subsequent frame are the same between two frames combined using the frame combining information. For example, in the two frames to be combined, when the rear identifier of the frame combined with the front portion is “123”, it is determined whether or not the front identifier of the frame combined with the rear portion is “123”. Details of the processing by the combination determination unit 34 will be described later with reference to FIGS. 9 and 10.

  By the way, the transmission apparatus described above can be applied to, for example, a transfer apparatus that transfers a frame, and is configured as shown in FIG. Here, as shown in FIG. 2, a reception buffer 1901 that receives frames and a MUX (multiplexer) 1902 that multiplexes a number of frames received from a plurality of reception buffers 1901 and transmits them to a common buffer are shown in FIG. 2, a common buffer 1903 that buffers received frames corresponds to the common buffer 41 shown in FIG. 2, and a SELECT 1904 that selects and transmits frames is sent to the frame output unit 20 shown in FIG. Correspond. Also, the Queue Pointer management table 1905 for storing the queue pointer corresponds to the queue pointer storage unit 42 shown in FIG. 2, and the free management table 1906 for storing free information corresponds to the free information management storage unit 45 shown in FIG. The Chain management table 1907 that stores the combination information corresponds to the combination information storage unit 43 illustrated in FIG. A scheduler 1908 for managing read addresses and write addresses and a common buffer write side control 1909 correspond to the storage unit 31 and the identifier assigning unit 32 shown in FIG. 2, and the scheduler 1908 and the common buffer read side control 1910 Corresponds to the reading unit 33 and the combination determination unit 34 illustrated in FIG. 2. FIG. 19 is a diagram showing an example of a common buffer type frame transfer apparatus using the present invention.

[Process for storing received frame according to embodiment 1]
Next, a frame storing process according to the first embodiment will be described with reference to FIGS. FIG. 7 is a flowchart showing the frame storing process in the first embodiment, and FIG. 8 is a diagram for explaining the frame storing process in the first embodiment.

  First, when a frame is received by the frame input unit 10 (Yes at Step S101), the storage unit 31 determines whether the capacity is larger than a predetermined capacity (Step S102). That is, it is determined whether the received frame is larger than the capacity of the unit buffer.

  Here, when the received frame is smaller than the predetermined capacity (No at Step S102), the storage unit 31 increments the write side address in the empty information storage unit 45 by 1 (Step S103). Thereafter, the empty information storage unit 45 is confirmed, and an empty unit buffer is acquired (step S104). Then, the frame is stored in the acquired empty unit buffer (step S105). For example, in the example shown in (0) of FIG. 8, when the writing side address (the empty unit buffer to be acquired next) in the empty information management table is “empty information management number: 5”, the writing side address is incremented by one. Then, it is set to “free information management number: 6”. Thereafter, in the example shown in (1) of FIG. 8, “free unit buffer address: 2” stored in association with “free information management number: 6” in the free information management table is acquired. In the example illustrated in FIG. 8, the received frame is stored in “empty unit buffer address: 2”.

  Thereafter, the storage unit 31 increments the write side address in the queue pointer storage unit 42 by 1 (step S106), and stores the cue point information in the queue pointer storage unit 42 (step S107). That is, for example, in the example shown in FIG. 8, the write side address in the queue pointer management table is incremented by 1, and the cue point information is stored. Then, the frame storing process ends.

  On the other hand, when the received frame is larger than the predetermined capacity (Yes at Step S102), the storage unit 31 divides the received frame (Step S108). That is, the received frame is divided into sizes that can be stored in the unit buffer. Then, the foremost frame is selected (step S109).

  Then, the storage unit 31 increments the write side address in the free information storage unit 45 by 1 (step S110), confirms the free information storage unit 45, acquires a free unit buffer (step S111), and acquires the free unit The frame is stored in the buffer (step S112).

  Then, the storage unit 31 determines whether all frames are stored in the unit buffer (step S113). If all the frames are not stored (No at Step S113), the next frame is selected (Step S114). That is, for example, in the example shown in (2) and (3) of FIG. 8, the write side address is incremented by 1 to obtain “empty unit buffer address: 5”, the frame is stored, and the write side address is further set. Increment by 1 to obtain “empty unit buffer address: 8” and store the frame.

  On the other hand, the storage unit 31 repeats the processing from the above-described steps S110 to S114 until all the frames are stored at the above-described step S113. When all the frames are stored in the unit buffer (Yes at Step S113), the write side address in the queue pointer storage unit 42 is incremented by 1 (Step S115), and the queue pointer information is stored in the queue pointer storage unit 42. (Step S116). That is, for example, in the example shown in (4) of FIG. 8, when the frame is divided into three and stored in order in the unit buffers “2”, “5”, and “8”, that is, the first frame is stored in the unit buffer. If the last frame is stored in “2” and the last frame is stored in “8”, the write side address in the queue pointer management table is incremented by 1 to correspond to “Head: 2” and “Tail: 8”. And store it in the queue pointer management table.

  Then, the storage unit 31 stores the combined information (Step S117). In other words, for each divided frame, an address that uniquely specifies a unit buffer in which another frame to be combined with the rear part of the frame is stored in the combined information storage unit 43 as frame combined information. For example, in the example shown in (5) of FIG. 8, when the frame is divided into three and stored in order in the unit buffers “2”, “5”, and “8”, that is, the top frame is set to “2”. If the frame that is stored and combined with the rear part of “2” is stored in “5”, and the frame that is combined with the rear part of “5” (the last frame) is stored in “8”, it is combined In the information management table, “EOQ: 0” and “Next: 5” are stored in association with “unit buffer address: 2”, and “EOQ: 0” and “EO” are associated with “unit buffer address: 5”. “Next: 8” is stored, and “EOQ: 1” and “Next: (no)” are stored in association with “unit buffer address: 8”.

  And the identifier provision part 32 provides and stores a front identifier and a back identifier (step S118). That is, an identifier for determining whether or not the connection relationship when the divided frames are combined is stored in the identifier storage unit 44. For example, in the example shown in (6) of FIG. 8, when the frame is divided into three and stored in order in the unit buffers “2”, “5”, and “8”, that is, the top frame is set to “2”. When the frame that is stored and combined with the rear part of “2” is stored in “5”, and the frame that is combined with the rear part of “5” (the last frame) is stored in “8”, The same identifier (eg, “123”) is assigned to the “rear identifier” for “2” and the “front identifier” for “5” and stored in the combined information management table, and the “rear identifier for“ 5 ” ”And“ 8 ”are assigned the same identifier (eg,“ 542 ”) to the“ forward identifier ”(eg,“ 542 ”) and stored in the combined information management table. Then, the frame storing process ends.

[Frame Read Processing According to Embodiment 1]
Next, a frame reading process according to the first embodiment will be described with reference to FIGS. 9 and 10. FIG. 9 is a flowchart showing the frame reading process in the first embodiment, and FIG. 10 is a diagram for explaining the frame reading process in the first embodiment.

  First, the read unit 33 increments the read-side address in the queue pointer storage unit by 1 (step S202) when the read timing comes (Yes in step S201). That is, for example, in the example illustrated in FIG. 10, when the read-side address (the queue point to be acquired next) in the queue pointer management table is “transmission queue 1: 1”, the read-side address is incremented by 1 and “ Set to “transmission queue 1: 2”.

  Then, the reading unit 33 acquires the position of the unit buffer in which the first and last frames are stored from the queue pointer management table (step S203). That is, for example, in the example shown in (1) of FIG. 10, when the frame is divided into three and stored in order in the unit buffers “2”, “5”, and “8”, that is, the first frame is stored in the unit buffer. When storing in “2” and storing the last frame in “8”, “Head: 2” and “Tail: 8” are acquired from the queue pointer management table.

  Then, the reading unit 33 determines whether there is combined information (step S204). Here, when there is no combination information (No at Step S204), that is, when “Head” and “Tail” are the same, the read side address of the empty information management table is incremented by 1 (Step S205), and the obtained unit buffer address Is written in the empty information management table (step S206). Then, the frame is read from the acquired unit buffer address and transmitted (step S207), and the frame reading process is terminated.

  On the other hand, when there is combined information (Yes at Step S204), the reading unit 33 acquires the combined information for the first frame from the combined information storage unit 43 (Step S208). For example, in the example shown in (2) of FIG. 10, when the frame is divided into three and stored in order in the unit buffers “2”, “5”, and “8”, that is, the top frame is set to “2”. When the frame that is stored and combined with the rear part of “2” is stored in “5”, and the frame (the last frame) that is combined with the rear part of “5” is stored in “8”, the unit “EOQ: 0” and “Next: 5”, which are combined information about the buffer “2”, are acquired from the combined information management table. And an identifier is acquired from the identifier memory | storage part 44 (step S209). That is, for example, in the example shown in (3) of FIG. 10, “Before Code: (None)” and “Next Code: 123”, which are identification information about the unit buffer “2”, are acquired from the combined information management table. .

  Then, the reading unit 33 determines whether it is the last frame (step S210). For example, it is determined whether or not the acquired combined information is “EOQ: 1”. Here, if it is not the last frame (No at Step S210), the combined information about the next frame is acquired from the combined information storage unit 43 (Step S211). For example, in the example shown in (4) of FIG. 10, “EOQ: 0” and “Next: 5” are acquired from the combined information management table. Thereafter, an identifier is acquired from the identifier storage unit 44 (step S212). For example, in the example shown in (5) of FIG. 10, “Before Code: 123” and “Next Code: 542” are acquired from the combined information management table.

  Then, the coupling determination unit 34 determines whether the coupling relationship is correct (step S213). Specifically, with respect to two frames to be combined using the frame combination information, it is determined whether or not the connection relationship is correct by using the backward identifier of the preceding frame and the forward identifier of the subsequent frame. More specifically, it is determined whether the rear identifier of the preceding frame and the front identifier of the subsequent frame are the same between two frames combined using the frame combining information.

  Here, when the connection relationship is correct (Yes in step S214), the combination determination unit 34, that is, in the example illustrated in (6) of FIG. 10, for example, “Next Code: If it is determined that the forward identifier of “123” and the subsequent frame and “Before Code: 123” are the same (comparison match) and the connection relationship is correct, it is determined whether the subsequent frame is the last frame ( Step S210). On the other hand, if the coupling relationship is not correct (No at Step S214), that is, for example, in the example shown in (7) of FIG. 10, the unit buffer “7” is erroneously (misrecognized) according to “Next: 8”. Is derived, the “Next Code: 542” of the unit buffer “5” and the “Before Code: 697” of the unit buffer “7” are not the same (comparison mismatch), and the connection relationship is not correct. judge. Then, the frame reading process ends.

  On the other hand, the reading unit 33 repeats the processes from step S211 to S214 until the last frame is acquired in step S210. If it is the last frame (Yes at Step S210), it is determined whether or not it matches the queue pointer information acquired from the queue pointer storage unit 42 (Step S215). That is, for example, in the example shown in 10 (8), it is determined whether “unit buffer address: 8” matches “Tail: 8”. As a result, if they match (Yes at Step S215), the read side address in the empty information storage unit 45 is incremented by 1 (Step S216), and the address of the unit buffer from which the frame is read is written (Step S217). If all the unit buffer addresses acquired in the above-described steps S209 and S212 are not written (No in step S218), the unit buffer address acquired by incrementing the read-side address by 1 is written again (steps S216 and S216). S217). Thereafter, when all the unit buffer addresses have been written (Yes at step S218), the frame is read from the acquired unit buffer address, combined and transmitted (step S219), and the frame reading process ends.

[Effect of Example 1]
As described above, according to the first embodiment, the transmission apparatus stores the identifier for determining whether or not the coupling relationship when the divided frames are combined is correct in the identifier storage unit 44, and combines the frames. When combining frames that are divided using information, the identifier stored in the identifier storage unit 44 is used to determine whether or not the connection relationship is correct, so that an error is detected when combining the frames. Is possible. In other words, if a determination result indicating that there is an error is dealt with (for example, the process is terminated, the process is interrupted, the process is stopped, etc.), the process runs out of control by performing an incorrect combination process. (Falling into a loop state) can be prevented.

  In addition, according to the first embodiment, the transmission apparatus determines, for each divided frame, whether or not the connection relationship with other frames combined at the front portion of the divided frame is correct. The identifier and the backward identifier for determining whether or not the connection relation with the other frame combined at the rear part of the divided frame is correct is stored in the identifier storage unit 44 and combined using the frame combination information. For the two frames that are used, it is determined whether the connection relationship is correct using the rear identifier of the previous frame and the front identifier of the subsequent frame, so that errors can be reliably detected when combining the frames. Is possible. In other words, if a determination result indicating that there is an error is dealt with (for example, the process is terminated, the process is interrupted, the process is stopped, etc.), the process runs out of control by performing an incorrect combination process. (Falling into a loop state) can be prevented.

  Further, according to the first embodiment, the transmission apparatus makes the rear identifier of the previous frame and the front identifier of the subsequent frame the same between two frames combined using the frame combination information. Since it is determined whether or not the backward identifier of the previous frame and the forward identifier of the subsequent frame are the same between the two frames stored in the identifier storage unit 44 and combined using the frame combination information. When combining frames, it is possible to detect an error with a simple process.

[Types of forward identifiers]
By the way, in the first embodiment, a case has been described in which the backward identifier of the preceding frame and the forward identifier of the succeeding frame are the same between two frames combined using the frame combining information. However, the present invention is not limited to this, and a constant value may always be obtained by substituting the backward identifier of the preceding frame and the forward identifier of the subsequent frame into a predetermined mathematical expression. Specifically, whether or not a constant value can always be obtained by storing the forward identifier and the backward identifier in the identifier storage unit 44 and substituting the backward identifier of the previous frame and the forward identifier of the subsequent frame into a predetermined mathematical formula. It may be determined whether or not the coupling relationship is correct. For example, the sum, difference, product, multiplier, or identifier that can be obtained by substituting a single or a plurality of predetermined mathematical expressions using the front identifier and the rear identifier may be stored and determined.

  In the first embodiment, the case where the determination is made using the front identifier and the rear identifier has been described. However, the present invention is not limited to this, and a frame to be coupled to the front portion of the frame is stored. The address may be stored as a forward identifier in a predetermined storage unit.

  That is, for each divided frame, the transmission apparatus uses the other frame as a forward identifier for determining whether or not the connection relationship with the other frame combined at the front portion of the divided frame is correct. Is stored in a predetermined storage unit. The information uniquely identifies the unit buffer in which is stored. Specifically, as illustrated in FIG. 11, information that uniquely identifies a unit buffer in which another frame combined in the front part of the divided frame is stored is stored as “Before Code”. For example, in the example shown in (1) of FIG. 11, when the frame is divided into three and stored in order in the unit buffers “2”, “5”, and “8”, that is, the top frame is set to “2”. If the frame that is stored and combined with the rear part of “2” is stored in “5”, and the frame that is combined with the rear part of “5” (the last frame) is stored in “8”, it is combined In the information management table, “Before Code: 2” is stored in “Unit Buffer Address: 5”, and “Before Code: 5” is stored in “Unit Buffer Address: 8”. FIG. 11 is a diagram for explaining a frame reading process using the address of the unit buffer storing the frame coupled to the front part in the first embodiment as a front identifier.

  Then, the transmission apparatus determines whether or not the preceding frame is stored in the unit buffer specified by the forward identifier of the succeeding frame for the two frames combined using the frame combining information. Then, it is determined whether or not the coupling relationship is correct. Specifically, whether or not the connection relationship is correct by determining whether or not the unit buffer specified by the forward identifier of the subsequent frame matches the unit buffer storing the previous frame. Determine whether. For example, as shown in (2) of FIG. 11, when a frame of “unit buffer address: 5” is acquired after a frame of “unit buffer address: 2”, “unit buffer address: 5” is supported. Since the “Before Code” stored in addition is “2” and the previous frame is stored in “unit buffer address: 2”, it is determined that the coupling relationship is correct. On the other hand, as shown in (3) of FIG. 11, when the frame of “unit buffer address: 7” is acquired after acquiring the frame of “unit buffer address: 5” (for example, due to noise or the like), Since “Before Code” stored in association with buffer address: 7 is “3” and the previous frame is stored in “unit buffer address: 2”, it is determined that the coupling relationship is not correct. To do.

  For this reason, the transmission apparatus can reliably detect an error when combining frames with only one identifier. In other words, if a determination result indicating that there is an error is dealt with (for example, the process is terminated, the process is interrupted, the process is stopped, etc.), the process runs out of control by performing an incorrect combination process. (Falling into a loop state) can be prevented.

[Characteristics of Transmission Apparatus According to Second Embodiment]
So far, as the first embodiment, the case has been described where an identifier for determining whether or not the combination is correct is stored in a predetermined storage unit, but the present invention is not limited to this, and the combination process is performed. An identifier for restoring the data may be stored in a predetermined storage unit.

  That is, the transmission apparatus according to the second embodiment includes, for each divided frame, a unit buffer that stores a frame that is to be combined with the rear part of another frame that is to be combined with the rear part of the frame. The uniquely identified address is stored in a predetermined storage unit as a recovery identifier. Specifically, as shown in FIG. 13, “Next2” indicating the address where the frames are stored one after another is stored for each divided frame. For example, in the example shown in (1) of FIG. 13, when a frame is divided into three and stored in order in unit buffers “2”, “5”, and “8”, that is, the top frame is set to “2”. If the frame that is stored and combined with the rear part of “2” is stored in “5”, and the frame that is combined with the rear part of “5” (the last frame) is stored in “8”, it is combined “Next 2: 8” is stored in “unit buffer address: 2” in the information management table.

  The transmission apparatus according to the second embodiment is stored in the predetermined storage unit when the determination unit determines that the connection relationship is not correct between the two frames combined using the frame combination information. From the recovery identifier, the recovery identifier corresponding to the frame combined at the front part of the previous frame is read, and the frame stored in the unit buffer specified by the recovery identifier is the previous stage. Control to be coupled to the rear part of the frame.

  For example, when the transmission apparatus according to the second embodiment divides the frame into three and stores them sequentially in the unit buffers “2”, “5”, and “8”, as shown in (2) of FIG. If the unit buffer “7” is erroneously derived in accordance with “Next: 8” of the unit buffer “5”, a frame combined with “Before Code: 3” of the unit buffer “7” and the front part is derived. It is determined that the stored unit buffer address “5” is not the same (comparison mismatch), and the coupling relationship is not correct. Thereafter, the recovery identifier “Next2: 8” (see (1) in FIG. 13) of the unit buffer “2” that is a frame combined at the front part of the previous frame is acquired, and “Next2: 8” is obtained. In response, unit buffers “8”, “EOQ: 1”, and “Before Code: 5” are acquired. For example, when it is determined that the joining relationship is correct, the joining process is continued. When it is judged that the joining relationship is not correct, the recovery identifier is read again and the joining process is continued, or the joining process is performed. finish. For example, as shown in (3) of FIG. 13, the unit buffer “2”, which is a frame combined with “Before Code: 5” of the unit buffer “8” and the front part of the previous frame of the frame. When “Next: 5” becomes the same (comparison match), the joining process is continued.

  For this reason, the transmission apparatus according to the second embodiment can not only determine whether or not the coupling destination is correct, but can restore the coupling process by reading the correct coupling destination when the coupling destination is incorrect. It is.

[Frame Storage Processing According to Second Embodiment]
First, the frame storing process according to the second embodiment will be briefly described with reference to FIG. The transmission apparatus according to the second embodiment should be coupled to the rear portion of the frame after each step S116 in FIG. 7, that is, after assigning and storing a front identifier and a rear identifier. A process of storing an address uniquely identifying a unit buffer in which successive frames to be coupled to the rear part of other frames are stored in a predetermined storage unit as a recovery identifier is performed. Specifically, as shown in FIG. 13, “Before Code” is stored as an identifier, and “Next2” is stored in the identifier storage unit 44 as a recovery identifier.

[Frame Read Processing According to Embodiment 1]
Next, a frame reading process according to the second embodiment will be described with reference to FIGS. FIG. 12 is a flowchart showing the frame reading process in the second embodiment, and FIG. 13 is a diagram for explaining the frame reading process in the second embodiment.

  First, when it comes to the read timing (Yes at Step S301), the read unit 33 then determines whether there is combined information (Steps S302 to S304). Here, when there is no combined information (No at Step S304), the acquired unit buffer address is written in the empty information management table (Steps S305 and S306). Then, the frame is read from the acquired unit buffer address and transmitted (step S307), and the frame reading process is terminated. On the other hand, if there is combined information (Yes at step S304), the combined information is acquired from the combined information storage unit 43 for the first frame (step S308), and the identifier is acquired (step S309).

  Then, the reading unit 33 determines whether or not it is the last frame (step S310). If it is not the last frame (No at step S310), the combined information and identifier are acquired for the next frame.

  Then, the coupling determination unit 34 determines whether the coupling relationship is correct (steps S311 to S313). Here, when the connection relationship is correct (Yes at Step S314), the connection determination unit 34 determines whether the subsequent frame is the last frame (Step S310).

  On the other hand, if the connection relationship is not correct (No at Step S314), the connection determination unit 34 determines whether the frame that was not the correct connection destination is the third or later frame (Step S315). That is, it is determined whether the other frame to be combined with the rear portion of the frame is the first frame or a frame combined with the rear portion of the first frame. If it is not the third or subsequent frame (No at step S315), the frame reading process is terminated. On the other hand, if it is the third and subsequent frames (Yes at step S315), the restoration corresponding to the frame combined at the front part of the preceding frame from the restoration identifier stored in the predetermined storage unit. The identifier for use is read (step S316). For example, in the example illustrated in FIG. 13, when the coupling relationship between “unit buffer address: 5” and “unit buffer address: 7” is not correct, the previous stage stored in “unit buffer address: 5” is used. “Next2: 8”, which is a recovery identifier acquired from the frame stored in “unit buffer address: 2” combined at the further front part of the frame, is confirmed.

  Thereafter, the combination determination unit 34 acquires the combination information for the address indicated by the recovery identifier identifier (step S317). That is, control is performed so that the frame stored in the unit buffer specified by the recovery identifier is combined with the rear part of the preceding frame. For example, in the example illustrated in FIG. 13, “EOQ: 1” and “Next: (no)” are acquired for “unit buffer address: 8”. Then, an identifier is acquired for the address indicated by the recovery identifier (step S318). That is, for example, in the example illustrated in FIG. 13, “Before Code: 5” is acquired for “unit buffer address: 8”. Thereafter, using the identifier acquired for the address indicated by the recovery identifier, it is determined whether the coupling relationship is correct (step S313).

  On the other hand, the combination determination unit 34 repeats the processes from step S311 to S318 described above until the last frame is acquired in step S310. In step S310, if it is the last frame (Yes in step S310), it is determined whether or not it matches the queue pointer information acquired from the queue pointer storage unit 42 (step S319). Here, if the frames that do not match the queue pointer information and are not the correct combination destination are the third and subsequent frames (No in step S319 and S315 affirmative), the recovery identifier is acquired and the process continues (step S316). ~ S319). If the frame that does not match the queue pointer information and is not the correct combination destination is not the third or subsequent frame (No at Step S319 and No at S315), the frame reading process ends. If the queue pointer information matches (Yes at step S319), the addresses of all the read frames are written in the empty information management table (steps S320 to S322), and then the frames are read from the acquired unit buffer addresses. The combined data is transmitted (step S323), and the frame reading process is terminated.

[Effect of Example 2]
As described above, according to the second embodiment, for each divided frame, the transmission apparatus stores, in the identifier storage unit 44, an address that uniquely identifies a unit buffer in which frames are stored one after another as a recovery identifier. When it is determined that the connection relationship between the two frames combined using the frame combination information is not correct, the recovery frame stored in the identifier storage unit 44 further includes Since the recovery identifier corresponding to the frame combined at the front part is read and the frame stored in the unit buffer specified by the recovery identifier is controlled to be combined with the rear part of the preceding frame, Not only can you determine whether or not the join destination is correct, but if the join destination is incorrect, you can restore the join process by reading the correct join destination. It is.

  So far, as the first and second embodiments, the case where the unit buffer is released only after the frame is read from the unit buffer (the unit buffer in which no frame is stored) has been described. The present invention is not limited to this, and the unit buffer may be released when a predetermined time elapses after the frame is stored.

[Configuration of Transmission Apparatus in Embodiment 3]
First, the configuration of the transmission apparatus according to the third embodiment will be described with reference to FIG. FIG. 14 is a block diagram illustrating a configuration of the mobile terminal according to the third embodiment. Here, those having the same operations as those in the first embodiment are denoted by the same reference numerals and description thereof is omitted. In the following, an aging information storage unit 35b, a storage time determination unit 36b, an opening unit 37b, and an aging unit are described. Only the management storage unit 46b and the aging policy storage unit 47b will be described.

  The aging management storage unit 46b stores storage information indicating whether or not a frame is stored in each unit buffer for each unit buffer. Specifically, as shown in FIG. 15, “Used” indicating whether or not a frame is stored in association with the “unit buffer address”, and aging progress that is the time elapsed after the frame is stored “Timer” indicating time and “Offset” indicating aging elapsed time for releasing the target unit buffer are stored. Further, an “aging information reading side address” indicating which queue pointer number is currently used when writing a frame is stored in the “aging management table” in association with any unit buffer address.

  For example, in the example shown in FIG. 15, when the frame is divided into three and stored in order in the unit buffers “2”, “5”, and “8”, and no frame is stored in the unit buffer “3”. The aging management storage unit 46b stores “Used: 1 (stored)”, “Timer: 10”, and “Offset: 10” in association with “unit buffer address: 2”, and “unit buffer address”. : 3 ”,“ Used: 0 (None Stored) ”,“ Timer: (None) ”, and“ Offset: (None) ”are stored in association with each other.

  The aging policy storage unit 47b uses an aging policy used to determine whether or not a predetermined time has elapsed since storage information indicating that a frame is stored is stored by a storage time determination unit 36b described later. Remember. Specifically, as shown in FIG. 16, “Time” indicating a predetermined time used for determination is stored in association with “transmission queue number” indicating a number for uniquely specifying the transmission queue. . For example, in the example illustrated in FIG. 16, “Time: 10” is stored in association with “transmission queue number: 2”.

  The aging information storage unit 35b stores, for each unit buffer, storage information indicating whether or not a frame is stored in each unit buffer in a predetermined storage unit. Specifically, in the example illustrated in FIG. 15, “Used” and “Offset” are stored in the aging management storage unit 46b in association with the “unit buffer address”. The aging information storage unit 35b corresponds to “stored information storage unit” recited in the claims.

  Here, for example, with reference to the example shown in FIG. 15, the aging information storage unit 35b, when a frame is stored in “unit buffer address: 2”, “unit buffer address: 2” and “ “Used: 1” is stored in association with each other, and when no frame is stored in “unit buffer address: 3”, “unit buffer address: 3” and “Used: 0” are stored in association with each other. . That is, for example, when a frame is written to “unit buffer address: 2”, “Used: 1” is stored in association with “unit buffer address: 2”, while, for example, the frame is “unit buffer address: 3”. "Used: 0" is stored (set) in association with "Unit buffer address: 3".

  Further, for example, with reference to the examples shown in FIGS. 15 and 16, the aging information storage unit 35b permits transmission (reading) for frames stored in “unit buffer addresses: 2, 5, 8” in the transmission queue 2. When “permitted” is issued, “Time: 10” of “transmission queue number: 2” for which transmission is permitted is acquired from the aging policy storage unit 47b (see FIG. 16). Thereafter, in the aging management storage unit 46b, the obtained “Time: 10” is stored in “Offset” of “unit buffer address: 2, 5, 8” in which the transmission permitted frame is stored (setting) To do). That is, “Time: 10” is stored in association with “Unit buffer address: 2”, “Time: 10” is stored in association with “Unit buffer address: 5”, and “Unit buffer address: 8” is stored. “Time: 10” is stored (set) in association with each other.

  The storage time determination unit 36b monitors the storage information stored in the predetermined storage unit for each unit buffer, and whether the predetermined time has elapsed since the storage information indicating that the frame is stored is stored. Determine whether or not. Specifically, in the example illustrated in FIG. 15, “Timer” in the aging management storage unit 46 b is monitored to determine whether or not the time set by “Offset” has elapsed. The storage time determination unit 36b corresponds to “storage time determination means” recited in the claims. Details of processing by the storage time determination unit 36b will be described later with reference to FIG.

  When the storage time determination unit 36b determines that a predetermined time has passed for the predetermined unit buffer, the release unit 37b releases the predetermined unit buffer so that no frame is stored. Specifically, when the storage time determination unit 36b determines that the time set by “Offset” has elapsed, the predetermined unit buffer is set to “Used: 0”. The release unit 37b corresponds to “unit buffer release means” recited in the claims.

[Aging Information Setting Processing According to Third Embodiment]
Next, the aging information setting process according to the third embodiment will be described with reference to FIG. FIG. 17 is a flowchart illustrating aging information setting processing according to the third embodiment.

  First, the aging information storage unit 35b reads the corresponding transmission policy from the aging policy storage unit 47b when the transmission is permitted (reading permission) (Yes at Step S401) (Step S402). That is, “Time” stored in association with “transmission queue number” for which transmission is permitted is acquired from the aging policy storage unit 47b.

  Then, the aging information storage unit 35b confirms the unit buffer address where the unit buffer storing the frame to be transmitted is stored (step S403), and sets “1” to Used (step S404). Thereafter, “Time” acquired from the aging policy storage unit 47b is set (step S405). Then, the aging information setting process ends.

[Aging Information Monitoring Processing According to Third Embodiment]
Next, aging information monitoring processing according to the third embodiment will be described with reference to FIG. FIG. 18 is a flowchart illustrating aging information monitoring processing according to the third embodiment.

  First, when the set time has elapsed (Yes at Step S501), the storage time determination unit 36b increments the read-side address of the aging management storage unit by 1 (Step S502). In other words, for example, referring to the example of FIG. 15, when the read side address is set to “unit buffer address: 4”, the read side address is incremented by 1 and set to “unit buffer address: 5”. . Then, the contents set in the table are read (step S503). For example, referring to the example of FIG. 15, “Used: 1”, “Timer: 10”, and “Offset: 10” of “unit buffer address: 5” are read.

  Then, the storage time determination unit 36b determines whether or not the read “Used” value is “1” (step S504), and then determines whether or not the “Timer” value is “0” (step S505). ). Here, when it is determined that the read “Used” value is not “1” (No in step S504), that is, when the “Used” value is “0”, no frame is stored. And the aging information monitoring process is terminated. Further, when it is determined that the read “Used” value is “1” (Yes in step S504) and it is determined that the “Timer” value is not “0” (that is, time-out has not occurred) (step S505). No), the value of the read timer ("Timer") is decremented by "1" (step S506), and the aging information monitoring process is terminated.

  Further, the storage time determination unit 36b determines that the read “Used” value is “1” (Yes in step S504), and determines that the “Timer” value is “0” (timeout). In that case (Yes at Step S505), the target area in the aging management storage unit 46b is released (Step S507). That is, it is determined that a predetermined time has elapsed since the storage information was stored, and this area is released. Then, the value of “Used” is set to “0” (step S508), and the aging information monitoring process is terminated.

  Note that the actual time “T” until the target unit buffer area is released is “Δt” indicating the time set to increment the address of the aging management storage unit by 1, and the unit buffer of the common buffer By using “k” indicating the number of addresses (depth corresponding to the number of unit buffer areas) and “Offset”, the following equation can be used.

  “T” = “Δt” × “k” × “Offset”

[Effect of Example 3]
As described above, according to the third embodiment, the transmission apparatus stores, in the identifier storage unit 44, an address that uniquely identifies a unit buffer in which frames are stored one after another as a recovery identifier, and uses frame combination information. When it is determined by the determining means that the connection relationship between the two frames to be combined is not correct, the recovery identifier stored in the identifier storage unit 44 is combined at a further front part of the previous frame. The recovery identifier corresponding to the received frame is read out, and the frame stored in the unit buffer specified by the recovery identifier is controlled so as to be coupled to the rear part of the preceding frame. Nevertheless, an area that is not released can be released, and buffer resources can be used effectively.

  By the way, although the transmission apparatus which concerns on Examples 1-3 was demonstrated so far, this invention may be implemented with a various different form other than an above-described Example. Therefore, different examples will be described below as the portable terminal according to the fourth example.

(1) Double registration prevention For example, in the third embodiment, the transmission apparatus should be opened for each unit buffer by using storage information indicating whether or not a frame is stored in each unit buffer. Regardless of the case where the area that has not been released is released, the storage information may be used to prevent double registration in the frame storage area.

  Specifically, when the transmission apparatus stores the frame in the unit buffer, the transmission apparatus refers to the storage information of the unit buffer stored in the predetermined storage unit and stores the storage information indicating that the frame is stored. Control is made so that the frame is stored in the unit buffer on the condition that it is not stored.

  For example, referring to the example shown in FIG. 15, when the transmission apparatus stores a frame in the unit buffer, the “Used” area in the “aging management table” indicates the address of the unit buffer that is to store the frame. Confirm. Here, in the case of “Used: 0” (for example, “unit buffer address: 3” in FIG. 15), since it can be confirmed that the frame is not stored, a storage process is performed. On the other hand, in the case of “Used: 1” (for example, “unit buffer address: 2” in FIG. 15), since it can be confirmed that the area is a frame storage area, the storage process is not performed.

  As described above, when storing the frame in the unit buffer, the storage information indicating that the frame is stored is not stored with reference to the storage information of the unit buffer stored in the aging management storage unit 46b. In such a case, control is performed so that the frame is stored in the unit buffer. Therefore, double registration can be prevented, and the safety and reliability of the data stored in the buffer can be improved.

(2) About Unregistered Read Prevention Further, in the third embodiment, the transmission apparatus has described the case where the storage information is used to release the area that is not released although it should be released. It may be used to prevent unregistered reading to a frame non-storage area.

  Specifically, when the transmission apparatus reads a frame from the unit buffer and combines the stored information, the storage apparatus refers to the storage information of the unit buffer stored in a predetermined storage unit, and indicates that the frame is stored. Is controlled so as to read out the frame from the unit buffer.

  For example, referring to the example shown in FIG. 15, the transmission apparatus reads “Used” in the “aging management table” for the address of the unit buffer from which the frame is to be read when the frame is read from the unit buffer and combined. Check the area. Here, in the case of “Used: 0” (for example, “unit buffer address: 3” in FIG. 15), since it can be confirmed that the frame is not stored, the reading process is terminated. On the other hand, in the case of “Used: 1” (for example, “unit buffer address: 2” in FIG. 15), it is possible to confirm that the area is a frame storage area, and therefore read processing is performed.

  As described above, when the frame is read from the unit buffer and combined, the storage information indicating that the frame is stored is stored by referring to the storage information of the unit buffer stored in the aging management storage unit 46b. As long as the frame is read out from the unit buffer, it is possible to prevent reading from an area that does not store data, and to improve processing speed and reliability. Is possible.

(3) System In addition, the processing procedures, control procedures, specific names, and information including various data and parameters (for example, FIGS. It can be changed arbitrarily unless you want to.

  Further, each component of each illustrated apparatus is functionally conceptual, and does not necessarily need to be physically configured as illustrated. In other words, the specific form of distribution / integration of each device is not limited to that shown in the figure, and all or a part thereof may be functionally or physically distributed or arbitrarily distributed in arbitrary units according to various loads or usage conditions. (For example, in the configuration example illustrated in FIG. 2, the common buffer 41 is separated, and the combined information storage unit 43 and the identifier storage unit 44 are integrated). Further, all or any part of each processing function performed in each device may be realized by a CPU and a program analyzed and executed by the CPU, or may be realized as hardware by wired logic.

(4) Transmission Device Program In the first embodiment, the case where various processes are realized by hardware logic has been described. However, the present invention is not limited to this, and a program prepared in advance is stored in a computer. You may make it implement | achieve by performing by. Therefore, in the following, an example of a computer that executes a transmission apparatus control program having the same function as the transmission apparatus described in the first embodiment will be described with reference to FIG. FIG. 20 is a diagram illustrating a program of the transmission apparatus according to the first embodiment.

  As shown in the figure, the transmission apparatus is configured by connecting an input unit 3001, an output unit 3002, a common buffer 3003, a CPU 3110, a ROM 3111, an HDD 3112, and a RAM 3113 via a bus 3010 or the like.

  In the ROM 3111, the storage unit 31, the identifier assigning unit 32, the reading unit 33, the coupling determination unit 34, and the control program that performs the same function as shown in the first embodiment, that is, as shown in FIG. A storage program 3111a, an identifier assigning program 3111b, a reading program 3111c, and a combination determination program 3111d are stored in advance. Note that these programs 3111a to 3111d may be appropriately integrated or separated in the same manner as each component of the transmission apparatus shown in FIG.

  Then, the CPU 3110 reads out these programs 3111a to 3111d from the ROM 3111 and executes them, and as shown in FIG. 20, for each of the programs 3111a to 3111d, a storage process 3110a, an identifier assignment process 3110b, and a read process 3110c. And function as a combination determination process 3110d. Each process 3110a to 3110d corresponds to the storage unit 31, the identifier assigning unit 32, the reading unit 33, and the combination determination unit 34 illustrated in FIG.

  The CPU 3110 executes the transmission device control program based on the queue pointer data 3113a, the combined information data 3113b, the identifier data 3113c, and the empty information 3113d stored in the RAM 3113.

  Note that the programs 3111a to 3111d described in this embodiment do not necessarily need to be stored in the ROM from the beginning. For example, a memory card, a flexible disk, a CD-ROM, an MO disk, and a DVD inserted into the transmission apparatus. “Portable physical media” such as disks, magneto-optical disks, IC cards, etc., or “fixed physical media” such as HDDs provided inside and outside the transmission device, and also public lines, the Internet, LAN, WAN, etc. Each program may be stored in “another computer (or server)” or the like connected to the transmission apparatus via the network, and the transmission apparatus may read and execute each program therefrom.

(Supplementary note 1) A unit buffer in which a frame to be transmitted is divided and stored in a plurality of unit buffers, and for each divided frame, another frame to be coupled to the rear part of the frame is stored A transmission device that stores an address uniquely identifying the frame as combined information in a predetermined storage unit, and combines and transmits the divided frames using the frame combined information,
Identifier storage means for storing an identifier for determining whether or not the connection relationship when the divided frames are combined is correct in a predetermined storage unit;
A combination determination unit that determines whether or not the combination relation is correct using an identifier stored in the predetermined storage unit when combining the divided frames using the frame combination information;
A transmission apparatus comprising:

(Supplementary note 2) The identifier storage means, for each of the divided frames, a forward identifier for determining whether or not the connection relationship with other frames combined at the front part of the divided frame is correct, In addition, a backward identifier for determining whether or not the connection relationship with other frames combined in the rear part of the divided frame is correct is stored in a predetermined storage unit,
The combination determination means uses the backward identifier of the preceding frame and the forward identifier of the subsequent frame for two frames combined using the frame combination information to determine whether the combination relationship is correct. The transmission apparatus according to attachment 1, wherein the determination is made.

(Supplementary Note 3) The identifier storage means may be configured so that a rear identifier of a preceding frame and a front identifier of a subsequent frame are the same between two frames combined using the frame combination information, or The forward identifier and the backward identifier are stored in a predetermined storage unit so that a constant value is always obtained by substituting the backward identifier of the previous frame and the forward identifier of the subsequent frame into a predetermined mathematical formula,
The combination determination means determines whether or not the backward identifier of the preceding frame and the forward identifier of the subsequent frame are the same between the two frames combined using the frame combination information, or is the preceding stage. It is characterized by determining whether or not the coupling relationship is correct by determining whether or not a constant value can always be obtained by substituting the backward identifier of the frame and the forward identifier of the subsequent frame into a predetermined mathematical expression. The transmission apparatus according to appendix 2.

(Additional remark 4) The said identifier storage means is as a front identifier for determining whether the coupling | bonding relationship with the other frame couple | bonded with the front part of the said divided | segmented frame is correct for every said divided | segmented frame. , Storing information that uniquely identifies the unit buffer in which the other frame is stored in a predetermined storage unit,
The combining determination unit determines whether or not the preceding frame is stored in the unit buffer specified by the forward identifier of the succeeding frame for the two frames combined using the frame combining information. Thus, it is determined whether or not the coupling relationship is correct.

(Supplementary Note 5) For each of the divided frames, an address for uniquely specifying a unit buffer in which the next frame to be combined with the rear part of another frame to be combined with the rear part of the frame is stored. Recovery identifier storage means for storing in a predetermined storage unit as a recovery identifier;
Among the recovery identifiers stored in the predetermined storage unit when the connection determination unit determines that the connection relationship is incorrect between the two frames combined using the frame connection information. The recovery identifier corresponding to the frame combined at the further front part of the preceding frame is read, and the frame stored in the unit buffer specified by the recovery identifier is combined with the rear part of the preceding frame. A coupling control means for controlling to
The transmission device according to any one of supplementary notes 1 to 4, further comprising:

(Supplementary note 6) For each unit buffer, storage information storage means for storing storage information indicating whether a frame is stored in each unit buffer in a predetermined storage unit;
For each unit buffer, the storage information stored in the predetermined storage unit is monitored to determine whether or not a predetermined time has elapsed since the storage information indicating that the frame is stored is stored. Storage time determination means;
Unit buffer releasing means for releasing the predetermined unit buffer so that no frame is stored when it is determined by the storage time determining means that a predetermined time has passed for the predetermined unit buffer;
The transmission device according to any one of appendices 1 to 5, further comprising:

(Supplementary note 7) When storing the frame in the unit buffer, the storage information indicating that the frame is stored is stored by referring to the storage information of the unit buffer stored in the predetermined storage unit. 7. The transmission apparatus according to appendix 6, further comprising a frame storage control unit that controls to store the frame in the unit buffer on the condition that there is not.

(Supplementary Note 8) When the frame is read from the unit buffer and combined, the storage information indicating that the frame is stored is stored with reference to the storage information of the unit buffer stored in the predetermined storage unit. The transmission apparatus according to appendix 6, further comprising: a frame read control unit that controls to read a frame from the unit buffer.

(Supplementary Note 9) A unit buffer in which a frame to be transmitted is divided and stored in a plurality of unit buffers, and for each divided frame, another frame to be combined with the rear part of the frame is stored A transmission device control method for controlling a transmission device that stores an address uniquely identifying a frame as combined information in a predetermined storage unit, and combines and transmits the divided frames using the frame combined information,
An identifier storing step of storing an identifier for determining whether or not the connection relationship when the divided frames are combined is correct in the transmission device, in a predetermined storage unit;
When the transmission apparatus combines the divided frames using the frame combination information, a combination determination that determines whether or not the combination relation is correct using an identifier stored in the predetermined storage unit Process,
A transmission apparatus control method comprising:

(Supplementary Note 10) A unit buffer in which a frame to be transmitted is divided and stored in a plurality of unit buffers, and for each divided frame, another frame to be coupled to the rear part of the frame is stored A transmission device that stores in a predetermined storage unit an address that uniquely identifies the frame as frame combination information, and causes the computer to execute a method of controlling the transmission device that combines and transmits the divided frames using the frame combination information A control program,
An identifier storage procedure for storing an identifier for determining whether or not the connection relationship when the divided frames are combined is correct in a predetermined storage unit;
A combination determination procedure for determining whether or not the combination relation is correct using an identifier stored in the predetermined storage unit when combining the divided frames using the frame combination information;
A transmission apparatus control program for causing a computer to execute.

  As described above, the transmission apparatus, the transmission apparatus control method, and the transmission apparatus control program according to the present invention divide a frame to be transmitted and store it in a plurality of unit buffers, and for each divided frame, An address that uniquely identifies a unit buffer in which another frame to be combined is stored in the rear part of the frame is stored in a predetermined storage unit as frame combination information, and the divided frames are combined using the frame combination information Therefore, the present invention is particularly suitable for realizing a transmission apparatus, a transmission apparatus control method, and a transmission apparatus control program capable of detecting errors when combining frames.

BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a diagram for explaining an overview and characteristics of a transmission apparatus according to a first embodiment. 1 is a block diagram illustrating a configuration of a transmission device in Embodiment 1. FIG. 6 is a diagram illustrating an example of a queue pointer stored in a queue pointer storage unit according to Embodiment 1. FIG. It is a figure which shows an example of the joint information memorize | stored in the joint information storage part in Example 1. FIG. It is a figure which shows an example of the identifier memorize | stored in the identifier memory | storage part in Example 1. FIG. It is a figure which shows an example of the empty information memorize | stored in the empty information storage part in Example 1. FIG. 3 is a flowchart illustrating a frame storing process according to the first exemplary embodiment. FIG. 6 is a diagram for explaining a frame storing process in the first embodiment. 6 is a flowchart illustrating a frame reading process according to the first exemplary embodiment. FIG. 6 is a diagram for explaining frame reading processing according to the first embodiment. FIG. 10 is a diagram for explaining frame reading processing using, as an identifier, an address of a unit buffer in which another frame coupled to the front part in Example 1 is stored. 10 is a flowchart illustrating frame reading processing according to the second exemplary embodiment. FIG. 10 is a diagram for explaining frame reading processing according to the second embodiment. FIG. 10 is a block diagram illustrating a configuration of a mobile terminal according to a third embodiment. It is a figure which shows an example of the aging information memorize | stored in the aging management memory | storage part in Example 3. FIG. It is a figure which shows an example of the aging policy memorize | stored in the aging policy memory | storage part in Example 3. FIG. 10 is a flowchart illustrating an aging information setting process according to the third embodiment. 10 is a flowchart illustrating an aging information monitoring process according to the third embodiment. It is a figure which shows an example of the common buffer type | mold frame transfer apparatus using this invention. FIG. 3 is a diagram illustrating a program of the transmission apparatus according to the first embodiment. It is a figure for demonstrating the common buffer system based on a prior art. It is a figure for demonstrating the common buffer system based on a prior art.

Explanation of symbols

DESCRIPTION OF SYMBOLS 10 Frame input part 20 Frame output part 30 Control part 31 Storage part 32 Identifier provision part 33 Reading part 34 Connection determination part 35b Aging information storage part 36b Storage time determination part 37b Release part 40 Storage part 41 Common buffer 42 Queue pointer storage part 43 Combined information storage unit 44 Identifier storage unit 45 Empty information storage unit 46b Aging management storage unit 47b Aging policy storage unit

Claims (7)

A frame to be transmitted is divided and stored in a plurality of unit buffers, and for each divided frame, a unit buffer in which another frame to be combined with the rear part of the frame is stored is uniquely specified. A transmission apparatus that stores an address to be stored in a predetermined storage unit as frame combination information, and combines and transmits the divided frames using the frame combination information,
Identifier storage means for storing an identifier for determining whether or not the connection relationship when the divided frames are combined is correct in a predetermined storage unit;
A combination determination unit that determines whether or not the combination relation is correct using an identifier stored in the predetermined storage unit when combining the divided frames using the frame combination information;
A transmission apparatus comprising: The identifier storage means includes, for each of the divided frames, a front identifier for determining whether or not a connection relationship with another frame combined at a front portion of the divided frame is correct, and the division Storing a backward identifier for determining whether or not the connection relationship with another frame combined in the rear part of the frame is correct in a predetermined storage unit;
The combination determination means uses the backward identifier of the preceding frame and the forward identifier of the subsequent frame for two frames combined using the frame combination information to determine whether the combination relationship is correct. The transmission apparatus according to claim 1, wherein the determination is performed. The identifier storage means, for each of the divided frames, as the forward identifier for determining whether or not the connection relationship with other frames combined at the front part of the divided frame is correct, Information that uniquely identifies a unit buffer in which a frame is stored is stored in a predetermined storage unit,
The combining determination unit determines whether or not the preceding frame is stored in the unit buffer specified by the forward identifier of the succeeding frame for the two frames combined using the frame combining information. The transmission apparatus according to claim 1, wherein it is determined whether or not the coupling relationship is correct. For each of the divided frames, an address that uniquely identifies a unit buffer in which the next frame to be combined with the rear part of another frame to be combined with the rear part of the frame is used as a recovery identifier. Recovery identifier storage means for storing in a predetermined storage unit;
Among the recovery identifiers stored in the predetermined storage unit when the connection determination unit determines that the connection relationship is incorrect between the two frames combined using the frame connection information. The recovery identifier corresponding to the frame combined at the further front part of the preceding frame is read, and the frame stored in the unit buffer specified by the recovery identifier is combined with the rear part of the preceding frame. A coupling control means for controlling to
The transmission apparatus according to claim 1, further comprising: For each unit buffer, storage information storage means for storing storage information indicating whether or not a frame is stored in each unit buffer in a predetermined storage unit;
For each unit buffer, the storage information stored in the predetermined storage unit is monitored to determine whether or not a predetermined time has elapsed since the storage information indicating that the frame is stored is stored. Storage time determination means;
Unit buffer releasing means for releasing the predetermined unit buffer so that no frame is stored when it is determined by the storage time determining means that a predetermined time has passed for the predetermined unit buffer;
The transmission apparatus according to claim 1, further comprising: A frame to be transmitted is divided and stored in a plurality of unit buffers, and for each divided frame, a unit buffer in which another frame to be combined with the rear part of the frame is stored is uniquely specified. An address to be stored in a predetermined storage unit as frame combination information, and a transmission apparatus control method for controlling a transmission apparatus that combines and transmits the divided frames using the frame combination information,
An identifier storing step of storing an identifier for determining whether or not the connection relationship when the divided frames are combined is correct in the transmission device, in a predetermined storage unit;
When the transmission apparatus combines the divided frames using the frame combination information, a combination determination that determines whether or not the combination relation is correct using an identifier stored in the predetermined storage unit Process,
A transmission apparatus control method comprising: A frame to be transmitted is divided and stored in a plurality of unit buffers, and for each divided frame, a unit buffer in which another frame to be combined with the rear part of the frame is stored is uniquely specified. A transmission apparatus control program for causing a computer to execute a method of storing a transmission address to be stored in a predetermined storage unit as frame combination information and controlling the transmission apparatus that combines and transmits the divided frames using the frame combination information. And
An identifier storage procedure for storing an identifier for determining whether or not the connection relationship when the divided frames are combined is correct in a predetermined storage unit;
A combination determination procedure for determining whether or not the combination relation is correct using an identifier stored in the predetermined storage unit when combining the divided frames using the frame combination information;
A transmission apparatus control program for causing a computer to execute.

Images