KR100534618B1 - apparatus method of exchange packet in socket communication processor - Google Patents

Abstract

The present invention relates to a packet receiving method and an apparatus of a processor for socket communication. The present invention relates to an entire packet in a socket due to problems such as a communication path or a packet transmission speed while performing a socket communication in which a processor exchanges packets while ensuring reliability. If this is not written or is left blank, the processor receiving the packet reads only some packets or removes the read blocking caused by the failure to read the packets, thereby maximizing the processing efficiency of the processor. have.

Description

Packet exchange method of a processor for socket communication and apparatus therefor {apparatus method of exchange packet in socket communication processor}

The present invention relates to a packet exchange method and an apparatus of a processor for socket communication, and more particularly, to a case where a whole packet is not read due to a problem such as a communication path or a packet rate in a processor for socket communication. The present invention relates to a packet exchange method and apparatus for a processor performing socket communication to eliminate a read blocking phenomenon.

An application or processor operating in a MNP (Microcom Networking Protocol) system performs TCP (Transmission Control Protocol) based socket communication for reliable packet exchange with applications of other external systems.

Here, the reliable packet exchange refers to a packet exchange in which no loss occurs while ensuring the sequence of the packet transmitted by the sender.

In addition, socket communication is the exchange of packets between processors using a UNIX or Linux file descriptor.

This socket communication uses a socket-stream type of socket to maintain the sequence of packets exchanged and to prevent loss of packets to ensure reliability.

In this case, the socket allows two processors to perform communication regardless of a lower network.

1 is a block diagram illustrating a general configuration of a socket communication network.

As shown in FIG. 1, the processor 1 and 3 and the buffer unit 2 are configured, and the packet exchange for socket communication between the processors 1 and 3 is performed through the buffer unit 2. have.

In addition, the structure of the processors 1 and 3 for socket communication has a server / client structure.

2 is a flowchart illustrating a flow of a socket communication method between a general processor.

Referring to FIG. 2, processor A 1, which is a server processor, generates a structure for performing socket communication, that is, a socket (S 1).

Then, the processor A (1) is set for the socket communication using the generated socket (S 2).

This completes the preliminary work for socket communication and waits until a socket communication connection request is received from processor B 3 (S 3).

Processor B (3) creates and sets a socket for socket communication (S 4), and makes a socket communication connection request for exchanging packets with processor A (S 5).

When the processor A 1 receives a connection request from the processor B 3, the processor A 1 accepts the connection request and connects to the buffer unit 2 to perform socket communication (S 6).

Processor B (3), which is a client processor, temporarily stores the packet in the buffer unit (2), which is a socket, in order to transmit the packet (S7).

The processor A 1, which is a server processor, acquires a packet stored in the buffer unit 2 (S 8), and stores that the packet is obtained in the buffer unit 2 (S 9).

Processor B (3) recognizes that the processor A (1) stored in the buffer unit 2 has obtained a packet, and performs the next operation (S 10).

In such a general socket communication method, a packet exchanged is a TLV (Type, Length, Value) structure, that is, a structure having a header and a body, and a processor for receiving the packet is fixed in the buffer unit 2. The length information of the packet is grasped from the header of the length, and whether the capacity of the entire packet is stored in the buffer unit 2 is checked, and if it is stored, the packet temporarily stored in the buffer unit 2 is read.

However, in the general socket communication, when the processor 1 or 3 reads a packet, in order to prevent the packet sequence from changing, the full length information of the received packet is checked in the header, and the buffer unit 2 is read. Whether the entire packet is stored is continuously checked, and if the entire packet is stored, the packet is read by the buffer unit 2. FIG.

Therefore, if a link is down in the physical path connecting each processor 1, 3, or other problems, only a part of the packet is stored in the buffer unit 2, or if the transmission speed of the packet decreases, The processor 1 and 3 to read continuously check whether the entire packet according to the length information included in the header is temporarily stored in the buffer unit 2.

Therefore, the buffers 1 and 3 reading the packets from the buffer 2 continuously check the capacity of the packets stored in the buffer unit 2 for read operations, and thus lead blocking cannot be performed. This happens.

Therefore, the present invention is designed to solve the above problems, while performing socket communication to exchange reliable packets between processors, the processor reads only some packets due to problems such as communication paths or packet rates, An object of the present invention is to provide a packet exchange method and apparatus for a processor for socket communication that eliminates a read blocking phenomenon occurring in a processor in order to complete a read operation.

In order to achieve the above object, a processor for socket communication according to an aspect of the present invention includes reference information, which is information on overall length of a packet to be written in another socket, and comparison information, which is length information of a written packet, from another processor. When the information extraction unit to be extracted, the reference information extracted by the information extraction unit, and the comparison information are not the same, an information comparison unit providing a packet waiting signal, and a packet waiting signal is provided from the information comparing unit, After reading the packet through the first read job, temporarily storing it, and registering the second read job to read the unwritten packet to the timer job and performing another job, when the time set for the timer job passes, And a packet processing unit that completes another task and processes the second read task.

The packet processing unit according to the present invention may temporarily store a packet read through a first read operation in a first queue and read the packet through a third read operation for reading a packet written from another processor or a third processor. In order to guarantee the sequence of the packet, the packet read through the third read operation is temporarily stored in the second queue, and if an unread packet is read through the second read operation registered in the timer job, the packet is read into the first queue. Temporarily store, process all packets temporarily stored in the first queue, and process the packets temporarily stored in the second queue.

On the other hand, the packet exchange method of the processor for socket communication according to another aspect of the present invention, the step of the other processor to determine the reference information that is the total length information of the packet to be written to the socket and the comparison information is the written length information, and Determining whether the packet written to the socket is the entire packet according to the information and the comparison information; if each information is not the same, determining that the packet written to the socket is not the entire packet, and then reading it through the first read operation. Temporarily storing the packet to be queued, calculating length information of an incomplete packet according to a difference between reference information and comparison information, and registering a second read job to lead the calculated incomplete packet to a timer job. After the predetermined time set for the timer job while performing another job, the second read job is performed after completing another job being performed. And a step.

The packet exchange method of the processor for socket communication according to the present invention may include temporarily storing a packet read through a first read operation in a socket in a first queue, and writing a packet written from another processor or a third processor. When the entire packet is read through the third read operation to read, temporarily storing the entire packet in the second queue, and determining whether or not the incomplete packet is read through the second read operation; And temporarily storing the packet in the first queue, and processing the packet temporarily stored in the first queue, processing the packet temporarily stored in the first queue, and processing the packet temporarily stored in the second queue.

In addition, in the packet exchange method of the processor for socket communication according to the present invention, if the length information and the reference information of the packet read through the second read operation and the packet temporarily stored in the first queue are not the same, And registering a fourth read job to read the packet except the length information of the mixed packet in the reference information in the timer job.

Hereinafter, a packet exchange method and apparatus of a processor for socket communication according to a preferred embodiment of the present invention will be described in detail with reference to the accompanying drawings.

3 is an internal block diagram illustrating a configuration of a processor for socket communication according to an exemplary embodiment of the present invention.

Referring to FIG. 3, a processor 10 according to the present invention includes a plurality of queues 12 and a packet processing unit 11, and the packet processing unit 11 includes an information extracting unit 11a and an information comparing unit ( 11b) and job processing unit 11c.

The plurality of queues 12 temporarily store packets that the processor 10 exchanges with other processors through socket communication.

When the TCP (Transmission Control Protocol) based communication path for socket communication with another processor is established, the packet processor 11 exchanges a packet with another processor.

The information extracting unit 11a extracts reference information which is overall length information of the packet from headers of packets temporarily stored in the socket, and extracts comparison information which is length information of packets written from other processors.

For example, when the length information of the entire packet to be written to the socket by another processor is '1500' bytes, and the length of the packet written to the socket is '1000' bytes, the information extracting unit 11a extracts the header of the packet. It extracts '1500' bytes of full length information and '1000' bytes of length information of the currently written packet.

The information comparing unit 11b compares the length information extracted from the information extracting unit 11a, that is, the reference information which is the full length information, with the comparison information that is the length information of the currently written packet, and if it is the same, the packet processing signal. If not, generate a packet wait signal.

That is, if the packet written to the socket is an entire packet, the information comparison unit 11b provides a packet processing signal for the processor 10 to read and process the packet from the socket. If not, the information comparison unit 11b reads the packet from the socket. Wait for processing to ensure that the sequence of packets is guaranteed.

When the packet processing signal is provided from the information comparing unit 11b, the job processing unit 11c reads the packet from the socket and processes the set job.

On the other hand, when the packet waiting signal is provided from the information comparing unit 11b, the job processing unit 11c reads the packet of the socket first, and temporarily sends the packet to the arbitrary queue 12, because the packet written to the socket is not the entire packet. Save it.

Then, the job processing unit 11c registers a read job for reading the remaining packets written from the processor in the timer job.

In addition, the job processing unit 11c registers the read job to the timer job and processes the next job.

At this time, the job processing unit 11c, when a read operation for reading another processor or the next packet is completed in a state in which the entire packet cannot be read through the read operation due to a problem such as a communication path or a packet transmission speed, that is, the previous operation When the read of the next packet is completed while the entire packet is not read in the read operation, the previous packet is temporarily stored in the first queue 12 and the next packet is temporarily stored in the second queue 12.

The job processor 11c reads a packet not read through a timer job, temporarily stores the packet in the first queue 12, and temporarily stores the packet in the first queue 12 to ensure the sequence of the packet. If the information is the same as the length information of all the packets extracted by the information extraction section 11a, the packet is temporarily stored in the first queue 12, and the next packet temporarily stored in the second queue 12 is processed.

For example, when the second queue 12 is arbitrarily designated as a waiting queue, the job processing unit 11c may read the packet that is read in the next read operation when the entire packet is read in the next read operation when the previous read operation is not completed. Is temporarily stored in the second queue 12, which is a waiting queue, and the packets not read by the previous read operation are temporarily stored in the first queue 12, when all packets are temporarily stored in the first queue 12. The packet is processed first, and the packet temporarily stored in the second queue 12 is processed.

4 is a flowchart illustrating a flow of a method for packet exchange between processors using socket communication according to an embodiment of the present invention.

Referring to FIG. 4, the client processor 10 generates a socket for socket communication, and sets a socket for exchanging packets through the generated socket (S 20).

Then, it is determined whether there is a job to be processed (S 21), and if there is a job to be processed as a result of the determination, a function (call) corresponding to the job is called and processed.

That is, it is determined whether the job to be processed is a write job for packet transmission (S 22), and if the job is a write job, the write function is called and processed (S 23).

5 is a flowchart illustrating a flow of a method of performing a write operation according to an embodiment of the present invention.

Referring to FIG. 5, when a write job needs to be processed, a job to be processed first is found in the write job list (S 23a).

Then, the capacity of the packet to be transmitted is determined by performing the write operation (S 23b), and whether the determined capacity is greater than '0' (S 23c).

That is, it is determined whether there is a packet to be transmitted from the client processor 10 to the server processor 10.

As a result of the determination, when the determined capacity is larger than '0', that is, when there is a packet to be transmitted, the packet is written to the socket so that the server processor 10 can read the packet (S 23d).

That is, the client processor 10 and the server processor 10 share a socket that is a socket, and when the client processor 10 writes and stores a packet in the socket, the server processor 10 accesses the socket and reads the packet. .

When the server processor 10 reads the packet, the client processor 10 deletes the read packet from the socket.

At this time, the structure of the write operation may be expressed in the form of a structure such as 'write (fd, ptr, size)', and 'fd' stores a socket related packet such as a session connected to a server processor. 'Ptr' indicates a location value where a packet to be read is stored, and 'size' indicates a packet size value that should be read by reading 'fd' and 'ptr'.

The client processor 10 performs a write operation and determines whether a write operation for transmitting a packet is correctly performed (S 23e).

As a result of the determination, when the write operation is not correctly performed, that is, when all the packets to be transmitted are not transmitted, the capacity of the untransmitted packet is determined (S 23f).

At this time, the capacity of the unsent write operation may be known through a return value received after writing the packet to the socket.

Such a return value may be expressed as a 'return value', which is a capacity value that the client processor 10 has written to the socket, so that if the return value is less than '0', A socket that cannot be written to is closed.

On the other hand, when the return value is '0', it indicates that the socket is blocked, and when the return value is equal to the 'size' value, it indicates that the write operation is normally performed on the packet to be transmitted.

In addition, when the return value is between '0' and 'size', the difference between the capacity value of the packet to be transmitted and the return value indicates the capacity of the remaining write operation, and the write operation must be performed again by this value. .

In addition, the client processor 10 may determine the capacity of the untransmitted packet and may perform a write operation for transmitting the identified packet to the server processor 10, that is, an uncompleted write operation after a certain time. Register to the timer job (S 23g).

The incomplete write job is registered in the timer job and the next job is performed (S 23h).

Then, the processor 10 performs a write job, and determines whether the job to be processed is a timer job (S 24), and as a result of the determination, in the case of the timer job, whether there is a job registered in the timer job. It is determined whether or not (S 25).

That is, it is determined whether there is a job registered so that the write job is not completed correctly and a predetermined time has elapsed and an incomplete write job is performed.

As a result of the determination, if an incomplete write job is registered, the registered incomplete write job is performed (S26).

In this case, the execution of the unfinished write job may be repeatedly performed a number of times set by an arbitrary administrator, or re-registered when it is not completed even once.

On the other hand, if it is determined that there is no registered uncompleted write job or there is a registered uncompleted write job, the job is performed and a timer function is called to process the timer job (S 27).

The processor 10 determines whether there is another task to be processed, and if there is another task, calls and processes a function for processing the task.

That is, it is determined whether or not the job to be processed is a read job (S 28), and if there is a read job to be processed as a result of the determination, the read function is called and processed (S 29).

6 is a flowchart illustrating a flow of a method of performing a read operation according to an exemplary embodiment of the present invention.

Referring to FIG. 6, when a read operation is to be processed, the packet processor 11 of the processor 10 determines the capacity of a packet to be read by accessing the socket (S 29a).

Then, the packet processing unit 11 determines the capacity of the packet to be transmitted by performing the read operation, and determines whether the capacity of the identified packet is larger than "0" (S 29b).

As a result of the determination, the packet processing unit 11 approaches the socket and reads the temporarily stored packet when the determined capacity is larger than '0', that is, when there are packets to be read (S 29c).

That is, the client processor 10 shares a socket that is a socket with the server processor 10, and when the server processor 10 writes and stores the packet in the socket, the client processor 10 accesses the socket and reads the packet.

When the client processor 10 reads the packet, the server processor 10 deletes the read packet from the socket.

At this time, the structure of the read operation may be expressed in the form of a structure such as 'read (fd, ptr, size)', and 'fd' is a socket-related packet such as a session connected to the server processor. Indicates the file descriptor value, 'ptr' indicates the position value where the packet to be read is stored, and 'size' indicates the packet size value to read by reading 'fd' and 'ptr' .

The packet determiner 11a of the client processor 10 performs a read operation and determines whether a read operation for reading a packet is correctly performed (S 29d).

At this time, if the 'size' value is greater than '0', the packet determination unit 11a determines that the read operation is not performed correctly.

The packet determining unit 11a temporarily stores the packet read in the read job in the first queue 12.

As a result of the determination, when the read operation is not performed correctly, that is, when all the packets to be received are not received, the packet determination unit 11a determines the capacity of the unreceived packet (S 29e).

In this case, the capacity of the read operation not received may be known through a value that is read from the socket and returned.

Such a return value may be expressed as a 'return value', which is the capacity value that the client processor 10 reads into the socket, so if the return value is less than '0', the socket is closed. ) Indicates the status.

On the other hand, when the return value is '0', it indicates that the socket is blocked, and when the return value is equal to the 'size' value, it indicates that the packet to be received is normally read.

In addition, when the return value is between '0' and 'size' value, the difference between the capacity value of the packet to be received and the return value represents the capacity of the remaining packet, and the read operation must be performed again by this value. .

In addition, the client processor 10 may determine the capacity of the unread packet, and may perform a read operation for rereading the capacity of the identified packet, that is, an uncompleted read operation, to be performed after a predetermined time. It registers (S 23f).

At this time, when the packet determination unit 11a registers the uncompleted read job in the timer job, the packet determination unit 11a grasps the length information of the entire packet transmitted and the length information of the packet read from the socket, and the length information read from the full length information. The uncompleted read job is registered in the timer job using the length information of the remaining packets except for.

For example, an uncompleted read job is registered in a timer job so that any time has passed and an incomplete read job can be performed.

That is, if it is determined that the packet temporarily stored in the socket is not the entire packet, the packet determination unit 11a, for example, the header length information is '1500' bytes, and the packet length temporarily stored in the socket is '1000'. In the case of bytes, since the packets temporarily stored in the socket are not all packets, the packet determination unit 11a first reads the packets temporarily stored in the socket and temporarily stores them in the first queue 12.

In addition, when the read operation of the next packet is completed while the next work is performed, the processor 10 designates the next queue 12 of the first queue 12 as the second queue 12 which is the waiting queue 12. The next packet is temporarily stored in the second queue 12.

When the entire packet is stored in the first queue 12, the packet determination unit 11a processes the packet temporarily stored in the first queue 12, and the second queue 12 to ensure the packet sequence. Processes packets temporarily stored in).

The incomplete lead job is registered in the timer job and the next job is performed (S 29h).

At this time, when the processor 10 registers an uncompleted read operation, it is preferable to register the remaining packet capacity as the capacity of the packet to be read.

Hereinafter, referring to FIG. 7, a packet read operation of a processor for socket communication according to the present invention will be described in detail.

7 is a flowchart illustrating a flow of a read operation according to a preferred embodiment of the present invention.

Referring to FIG. 7, when there is a task of reading a packet written in a socket, the information extracting unit 11a of the processor 10 accesses the socket, and includes reference information which is full length information in the header of the packet, and The comparison information which is length information is extracted (S290).

The information comparison unit 11b compares the reference information extracted by the information extraction unit 11b with the comparison information to determine whether the packet written to the socket is the entire packet (S 291).

That is, if the reference information and the comparison information are the same, the information comparison unit 11b determines that all packets have been written, and generates a packet processing signal. Create

For example, when the total length of a packet to be written from another processor is '1500' bytes, and '1000' bytes are written due to a communication path or other problem, the information extracting unit 11a accesses the socket. In the header of a packet written from another processor, '1500' bytes are extracted as reference information, which is the total packet length information, and '1000' bytes, are compared as comparison information, which is length information of the packet written to the socket.

The information comparison unit 11b compares the '1500' byte, which is the reference information extracted by the information extraction unit 11a, with the '1000' byte, which is the comparison information, and generates a packet wait signal because it is not the same.

When the packet processing signal is provided from the information comparing unit 11b, the job processing unit 11c reads the packet from the socket, processes the set packet job, and outputs the packet (S 292).

On the other hand, when the packet waiting signal is provided from the information comparing unit 11b, the job processing unit 11c reads the packet of the socket first, and temporarily sends the packet to the arbitrary queue 12, because the packet written to the socket is not the entire packet. Save (S 293).

Then, the job processing unit 11c registers a read job for reading the remaining packets written from the processor in the timer job (S 294).

In addition, the job processing unit 11c registers the read job to the timer job, and causes the processor 10 to process the next job (S 295).

On the other hand, after the predetermined time set for the timer job has elapsed, the job processing unit 11c reads out the remaining packets written from other processors and stores them in the arbitrary queue 12 (S 296).

According to an example, when the '1000' byte is written among the '1500' bytes of the entire packet through the read operation, the job processor 11c first reads the packet of '1000' bytes written to the socket, and thus, the first packet may be read. Temporarily store in the queue 12.

In addition, an uncompleted read job to read the remaining packet of '500' bytes is registered in the timer job, and the processor 10 processes the next job.

At this time, the job processing unit 11c registers the uncompleted read job to the timer job, and if the entire packet is read through the next read job, that is, registers the uncompleted read job, and extracts the information from the next read job 11a. If the total length information of the packet to be written and) is equal to the length information of the packet to be written, the information comparison unit 11b provides a packet waiting signal.

When the packet waiting signal is provided from the information comparing unit 11b, the job processor 11c temporarily stores the entire packet read through the next read job in the second queue 12 in order to ensure the sequence of the processed packet. Save it,

In addition, after a predetermined time set for the timer job has elapsed, the job processing unit 11c reads out the packets except for the packets stored in the first queue 12 from all packets through the registered uncompleted read jobs, Temporarily store in 12).

Then, the job processing unit 11c compares the packet temporarily stored in the first queue 12 with the reference information which is the full length information extracted by the information extraction unit 11a (S 297), and if it is the same, according to the sequence of the packet. The packet is temporarily stored in the first queue 12, and the packet is temporarily stored in the second queue 12 (S299).

On the other hand, if the length of the packet temporarily stored in the first queue 12 is not the same as the reference information, the job processing unit 11c is a timer job to lead the read operation to read the remaining packets except for the packets temporarily stored in the first queue 12. Re-register at (S 298).

On the other hand, the processor 10 determines whether the task to be processed is an event task (S30), and if there is an event task to be processed as a result of the determination, calls and processes an event function to process it (S30). 31).

If the next job is a timer job (S 24), the processor 10 checks whether there is a job registered in the timer job (S 25), and if there is a registered job, processes the corresponding job (S 26). .

That is, the packet processing unit 11 of the processor 10 notifies that when the uncompleted read job is registered in the timer job, it is time for the job processing unit 11c to approach the socket and read the packet.

At this time, the job processor 11c accesses the socket, reads the temporarily stored packet, and temporarily stores the packet in the first queue 12.

Then, the job processor 11c checks whether the capacity of the read packet is the same as the capacity of the registered packet, that is, confirms whether or not the entire packet is temporarily stored in the first queue 12, and stores the entire packet. When the packet is temporarily stored in the first queue 12, the packet is temporarily stored in the second queue 12, which is the next queue 2.

That is, when the client processor 10 fails to read a packet stored in the socket due to a communication path or a packet transmission speed, the client processor 10 performs the repetition to first complete the read operation for receiving the packet. Rather than classify an uncompleted lead task into one processing, register it with another task, and perform another task, the task is processed in the client processor 10 by allowing it to be executed again after a certain time. Is to make the flow smooth.

Although the present invention has been described in detail only with respect to the described embodiments, it will be apparent to those skilled in the art that various modifications and changes are possible within the technical spirit of the present invention, and such modifications and modifications belong to the appended claims.

 As described above, according to the present invention, while the processor performs socket communication for exchanging packets while ensuring reliability, the entire packet may not be written to the socket due to a problem such as a communication path or a packet transmission speed, or the packet may be blanked. In this state, the processor receiving the packet may read only some packets or may eliminate read blocking caused by the failure to read the packets, thereby maximizing the processing efficiency of the processor.

1 is a block diagram illustrating a general configuration of a socket communication network.

2 is a flow chart illustrating the flow of a socket communication method between general processors.

3 is an internal block diagram illustrating a configuration of a processor for socket communication according to a preferred embodiment of the present invention.

4 is a flowchart illustrating a flow of an inter-processor packet exchange method using socket communication according to an embodiment of the present invention.

5 is a flowchart illustrating a flow of a method of performing a write operation according to an embodiment of the present invention.

6 is a flowchart for explaining the flow of a method of performing a read operation according to a preferred embodiment of the present invention.

7 is a flowchart illustrating the flow of a read operation according to a preferred embodiment of the present invention.

<Explanation of symbols for main parts of the drawings>

10 processor 11: packet processing unit

11a: information extraction section 11b: information comparison section

11c: job processing unit 12: queue

Claims (12)

A processor for exchanging packets over a socket, An information extraction unit for extracting reference information which is overall length information of a packet to be written to a socket from another processor, and comparison information which is length information of a written packet; An information comparison unit for providing a packet waiting signal if the reference information extracted by the information extraction unit and the comparison information are not the same; When the packet wait signal is provided from the information comparing unit, the packet read in the socket is read through a first read operation, and temporarily stored, and then a second read operation is performed to read an unwritten packet. And a packet processing unit configured to register with the terminal and to perform another task when the time set for the timer task passes, and to perform the other task, and to process the second read task. The method of claim 1, wherein the information comparison unit, And if the reference information and the comparison information are the same, provide a packet processing signal. The method of claim 1, wherein the packet processing unit, And a packet processing signal provided from the information comparing unit, reads a packet written to the socket, and processes and outputs a packet through a set function. The method of claim 1, wherein the packet processing unit, Computing the difference value of the comparison information from the reference information extracted by the information extraction unit, to determine the length information of the unread packet, and to set the second read operation according to the determined length information of the packet Processor to communicate with the socket. The method of claim 1, And a plurality of queues for temporarily storing a packet read from the socket. The method according to claim 1 or 5, wherein the packet processing unit, When a packet is read through a third read operation that temporarily stores a packet read through the first read operation in a first queue and reads a packet written from another processor or a third processor, guarantees a sequence of the packet. To temporarily store packets read through a third read job in a second queue, and if unread packets are read through the second read job registered in the timer job, the packets are temporarily stored in the first queue. And processing all packets temporarily stored in the first queue, and processing the packets temporarily stored in the second queue. The method of claim 6, wherein the packet processing unit, If the length information of the packet read through the second read operation and the length information of the packet mixed with the packet read through the first read operation are not the same as the reference information that is the full length information, And a fourth read operation for reading a packet excluding the length information of the mixed packet in reference information, to a timer task. The method of claim 1, wherein the timer job, The processor for socket communication, characterized in that to perform the registered read operation after a predetermined time elapsed. In a method in which a processor exchanges a packet through a socket, Identifying, by another processor, reference information which is overall length information of a packet to be written to the socket and comparison information which is written length information; Determining whether a packet written to the socket is an entire packet according to the reference information and the comparison information; If the information is not the same, it is determined that the packet written to the socket is not the entire packet, and temporarily stores the packet read through the first read operation in the queue, and does not complete according to the difference between the reference information and the comparison information. Calculating length information of a packet; Registering a second read job to read the calculated uncompleted packet with a timer job; And performing a second read operation after completing the other task being performed after a predetermined time set in the timer task while performing another task. The method of claim 9, Temporarily storing a packet read through a first read operation in the socket in a first queue; When the entire packet is read through a third read operation for reading a packet written from another processor or a third processor, the entire packet is temporarily stored in a second queue, and the second read operation determines whether an incomplete packet is read. Making; If the incomplete packet is read as a result of the determination, temporarily storing the packet in the first queue and processing the packet temporarily stored in the first queue; Processing a packet temporarily stored in the first queue, and processing the packet temporarily stored in the second queue. The method of claim 10, If the length information of the packet mixed through the second read operation and the packet temporarily stored in the first queue and the reference information are not the same, the packet excluding the length information of the mixed packet from the reference information And registering a fourth read job to be read in the timer job. The method of claim 10, wherein the grasp of the full length information of the packet, And analyzing the header of the packet written to the socket to determine reference information which is full length information.