KR20010088015A - XYZ multi-orderlist and virtual reality server using channel manager and interprocess communication method thereof - Google Patents

Abstract

PURPOSE: An on-line virtual field service server using a X Y Z multiple order list and a channel manager and a method for communicating to an interior thereof are provided to achieve a synchronization of avatars in a visible region on a three-dimensional space and to display a screen rapidly. CONSTITUTION: Data of a newly appended node are updated(S10). It is judged whether the newly appended node is the initial node(S20). If the newly appended node is the initial node, an initial process is performed(S30). If the newly appended node is not the initial node, it is compared and judged whether the appended node is a node to be inserted initially(S40). If the appended node is a node to be inserted initially, the next link information of the appended node is updated as the initial node(S41), and the previous link information of the appended node is updated as an appended node(S42), and the initial node is updated as an appended node(S43). If the appended node is not a node to be inserted initially, it is compared and judged whether the appended node is a node to be inserted subsequently(S50). If the appended node is a node to be inserted subsequently, the previous link information of the appended node is updated as the shortest node(S51), and the next link information of the shortest node is updated as an appended node(S52), and the shortest node is updated as an appended node(S53). If the appended node is a node to be inserted initially and the appended node is a node to be inserted subsequently, the previous link and the next link information of the appended node is updated(S61), and the previous link information of the appended node and the next link information of the next node and the previous link information are updated(S62).

Description

온라인 Online virtual world service server and internal communication method using multi-order list and channel manager {XYZ multi-orderlist and virtual reality server using channel manager and interprocess communication method

The present invention relates to a three-dimensional virtual reality system that operates in the Internet environment, by synchronizing the motion and position control of each avatar on behalf of the virtual reality in the virtual reality to feel that people are acting in the space. In order to provide a fast communication method and to enable fast relay operation in the server, the present invention relates to a technique for restricting the internal communication policy of a server by using an XYZ multi-order list and a channel manager.

Recently, with the rapid increase of Internet users, efforts have been made to introduce virtual reality technology at sites such as Internet shopping malls and Internet games, and virtual reality has been implemented through three dimensions. Virtual reality is based on the 3D environment, and users, or clients, generally operate the 3D environment as their avatars.

In order to implement 3D image technology on the Internet, the recognition of the online virtual world should be basically established.

In the online virtual world, a realistic drawing decorated in three dimensions is drawn on the monitor of a computer, where characters and avatars (or their own image in the virtual world where their images are digitized) take their place. At this time, other people's avatars are also visible.

In order to show the overall performance of several avatars like this, synchronization is required for each avatar. Synchronization includes contents for receiving the same information from clients receiving services from the server.

For example, the servers A, B, and C are connected to the server, and the remaining B and C must be displayed in the same order for the visible information about A. If A performs a hand shake after walking forward, the rest of B, C, including A must also walk forward and shake hands, shake hands forward, walk forward, or only shake hands. will be. If it is the easiest way for A to do something, then the server tells B and C, including A, the information about performance 1 received from A as information that A did. If A did a second run, the server would also send all the information from run 1 and then send information about run 2 as well to ensure synchronization.

The problem is that when N of users increases, the server and network load increase at an increase rate of N squared.

That is, when N clients communicate through the server, the operation of one client will require N transfer operations, and if each client performs one operation, it can be seen that N squared transfer operations are required.

So in order to reduce the increase of N-squared by limiting the range of clients that need to be kept in sync, it is necessary to keep in sync with clients out of sight in the virtual world, as the movement of people far from reality is hard to see and hear. Without, reduce it to less than N to reduce the transmission of N-squared.

Still, since the virtual world being designed is three-dimensional, it is not easy and fast to calculate the visibility of an avatar.

Accordingly, an object of the present invention is to solve the above problem, and to achieve synchronization of avatars in an area determined to be within the visible range in a three-dimensional space, and to display a screen quickly.

In order to achieve the above object, the present invention points to each of the nodes having a specific information by using the addresses in the memory and arranges the linked list structure in a specific order, and stores three pieces of X, Y, and Z information. And XYZ multi-order list to manage independent sorting information.

Hereinafter, exemplary embodiments of the present invention will be described in detail with reference to the accompanying drawings.

1 is a flowchart illustrating a process of adding a node according to an embodiment of the present invention;

2 is a flowchart illustrating a process of deleting a node according to an embodiment of the present invention;

3 is a diagram of a named pipe structure according to an embodiment of the present invention.

The server according to the present invention uses the XYZ multi-order list structure when performing a message exchange operation of avatars for synchronization. The search in the visible area for message passing creates a search thread of x and z respectively, searching for forward and backward links in its own node to find a satisfying node, waits for the search thread to finish, and then returns the y value in the result list. Find a node that satisfies this problem.

In other words, the sorted order and threads can be used to achieve faster processing results.

The channel manager is configured in response to cases where the contents of each client, that is, the avatars, do not need to be synchronized at the same time.

For example, the order in which the avatar moves and the order in which the avatar speaks are somewhat safe even if not followed exactly.

Among the messages exchanged by avatars, those that are not directly related to synchronization are classified, and the number of independent and parallel channel managers can receive input using named pipes provided by the UNIX API's Inter Process Communication (IPC). After the processing is performed, the message is broadcast to other clients that require synchronization with the client in the client search space.

The method of broadcasting uses a reference pipe to a named pipe that can deliver messages to individual clients in the search space.

The channel manager is divided into a control manager that can modify the connection structure of the user channel list and a general channel manager that refers to or updates data of nodes.

Since channel manager and general manager share the user channel list and execute the process independently and in parallel, the link manager's link modification authority cannot control the possibility of referencing the general manager's inappropriate memory.

This is because no writers such as semaphores or mutexes are used to write shared resources. The sequencer will block other processors attempting to reference the resource, which creates latency.

The coordinate system of the three-dimensional space of the present invention can be displayed on the direction side of X, Y, and Z, and a faster search method has been found by using information about them efficiently.

In a typical linked list, if you are searching and modifying a link at the same time, you must explicitly control access to the same resource at the same time, which causes a wait state. That is, when one of the two uses an arbitrary resource, the other one cannot access the changing resource and waits for access to the completed resource after the previous processing is completed. Therefore, the fast search method proposed here is effective in making search and link modification without using a separate mediator to control the access of resources. The following section provides a brief description of the general linked list and explains in what order the links must be reconfigured so that a separate search can proceed without exception.

For example, there are nodes with numeric information. When they represent five pieces of information of 1, 2, 3, 4, and 5, a component having information of 1, 2, 3, 4, and 5 is loaded into memory first. After that, the node of 1 has a node address of 2, and the memory address of 3 is stored in 2, so that the next node from 1 to 2 and 3 in 2 can be found naturally.

One 2 3 4 5 X = 1 4 3 5 2 Y = 2 One One 3 4 Z = 3 3 4 One 3

If there are five nodes as shown in Table 1, the information of three links of 1, 2, 3, 4, and 5 is shown in Table 2.

One 2 3 4 5 PreviousX = None 3 5 2 One Next X = 5 4 2 none 3 PreviousY = 3 none 2 One 4 Y = 4 3 One 5 none PreviousZ = 4 One 5 none 2 Z = 2 5 none One 3

In order to find out the visibility of an avatar, it is like searching for a cube of a certain size in the X, Y, and Z areas, or expressing it separately, it is constant for two-dimensional information of each of X, Y, and Z. Finding a common node in search results within a range.

The search method creates a search thread for X and Z respectively to search for and display nodes in the visible area from the front and back links of its own nodes, waits for the end of the X and Z search threads, and then finds nodes that satisfy the last Y value. Do the work of finding.

In other words, the sorted order and the threads are used to obtain faster processing results.

The operation of the present invention configured as described above is performed as follows.

The adding process of the node may include updating data of the newly added node (S10), as shown in FIG. 1; Comparing and determining whether the newly added node is the first node (S20); If the added node is the first node, performing an initialization operation (S30); If the added node is not the first node, comparing and determining whether the added node is the node to be inserted first in alignment (S40); If it is determined that the node added in S40 is a node to be inserted first in alignment, the next link information of the additional node is updated to the first node (S41), and the previous link information of the additional node is updated to the additional node (S42), Updating the original node to an additional node (S43); If it is determined in step S40 that the node to be added is not the node to be inserted first in comparison, determining whether the additional node is the node to be inserted last (S50); If it is determined that the node is inserted last, the previous link information of the additional node is updated to the shortest node (S51), the next link information of the shortest node is updated to the additional node (S52), and the shortest node is updated to the additional node. (S53); If it is determined in step S40 that the additional node is not the first node inserted, and if it is determined in S50 that the additional node is not the last inserted node, the previous and next link information of the additional node is updated (S61), and the transfer of the additional node is performed. And updating the next link information and the previous link information (S62).

The deletion process of the node may include comparing and determining whether the node to be deleted is the first node as shown in FIG. 2 (S70); If the node to be deleted is the first node, backing up the first node and updating to the first next link node (S71), and passing the backed up node to the garbage collector (S72); If it is determined in step S70 that the node to be deleted is not the first node, comparing and determining whether the first node is the shortest node (S80); If the node to be deleted in S80 is the shortest node, backing up the shortest node, updating to the shortest previous link node (S81), and handing over the backed up node to the garbage collector (S82); If the node to be deleted is not the first or the shortest node in S80, after backing up the node to be deleted, the link information of the previous next link node is updated next and previous (S91), and the backup node is passed to the garbage collector (S92). .

In the linked list structure, if a search and a modification process are performed at the same time, a problem may occur in the structural processing, but such a problem is prevented through the above procedure.

The 3D engine proceeding with the above structure and steps is applicable to 3D shopping malls (e-commerce), avatar chatting and telecommuting virtual cities, universities, academies, virtual exhibitions, libraries, virtual performances, broadcasting, cinema remote medical diagnosis Applicable to services, securities firms and auction systems, product promotions and all other services available in real life.

As described above, it is a virtual reality engine that has three-dimensional Internet environment according to the present invention, provides a user environment closest to real life, provides excellent speed and stability, is widely applicable, and is developed by Korea's first technology. In addition, it has the effect of suppressing the waste of foreign currency, thus replacing the existing two-dimensional Internet environment with three-dimensional and maintaining the excellent stability and speed on the network.

Claims (5)

A channel manager for classifying sporadic messages from clients and delivering them to other avatars in the visible range; XYZ multi-characterized node has three types of information such as location, X, Y, Z in spatial location of client with unique information of client, and it has XYZ multi-order list for searching neighboring area of avatar using this. Online virtual world service server using order list and channel manager. The channel manager of claim 1, wherein the channel manager categorizes each of the messages to be exchanged in order to synchronize them, so that the channel managers can deliver the messages in parallel. Using XYZ multi-order list and channel manager, it receives the message to be delivered by using named pipe and sends it to the server-side socket interface of the client who connected by using named pipe. Online virtual world service server. According to claim 1, The XYZ multi-order list to create three components that can store three link information in a node to maintain the alignment form for each X, Y, Z, any arbitrary avatar When searching for its own neighborhood, it searches for neighbors of X and Z with a thread, and finds that it satisfies the range of Y values with respect to the result. Virtual world service server using XYZ multi-order list and channel manager. In the process of adding a node. Updating data of a newly added node (S10); Comparing and determining whether the newly added node is the first node (S20); If the added node is the first node, performing an initialization operation (S30); If the added node is not the first node, comparing and determining whether the added node is the node to be inserted first in alignment (S40); If it is determined that the node added in S40 is a node to be inserted first in alignment, the next link information of the additional node is updated to the first node (S41), and the previous link information of the additional node is updated to the additional node (S42), Updating the original node to an additional node (S43); If it is determined in S40 that the node to be added is not the node to be inserted first, comparing and determining whether the additional node is the node to be inserted last (S50); If it is determined that the node is inserted last, the previous link information of the additional node is updated to the shortest node (S51), the next link information of the shortest node is updated to the additional node (S52), and the shortest node is updated to the additional node. (S53); If it is determined in step S40 that the additional node is not the first node inserted, and if it is determined in S50 that the additional node is not the last inserted node, the previous and next link information of the additional node is updated (S61), and the transfer of the additional node is performed. And updating the next link information and the previous link information (S62). The internal communication method of the online virtual world service server using the XYZ multi-order list and the channel manager. In the process of deleting a node, Comparing and determining whether the node to be deleted is the first node (S70); If the node to be deleted is the first node, backing up the first node and updating to the first next link node (S71), and passing the backed up node to the garbage collector (S72); If it is determined in step S70 that the node to be deleted is not the first node, comparing and determining whether the first node is the shortest node (S80); If the node to be deleted in S80 is the shortest node, backing up the shortest node, updating to the shortest previous link node (S81), and handing over the backed up node to the garbage collector (S82); If the node to be deleted is not the first or the shortest node in S80, after backing up the node to be deleted, updating the link information of the previous next link node to the next and previous (S91), and passing the backed up node to the garbage collector (S92). An internal communication method of an online virtual world service server using an XYZ multi-order list and a channel manager.