KR20160032717A - 3D editing collaboration system, method and recording media using the same - Google Patents

3D editing collaboration system, method and recording media using the same Download PDF

Info

Publication number
KR20160032717A
KR20160032717A KR1020160025099A KR20160025099A KR20160032717A KR 20160032717 A KR20160032717 A KR 20160032717A KR 1020160025099 A KR1020160025099 A KR 1020160025099A KR 20160025099 A KR20160025099 A KR 20160025099A KR 20160032717 A KR20160032717 A KR 20160032717A
Authority
KR
South Korea
Prior art keywords
user
reader
editing
action
log
Prior art date
Application number
KR1020160025099A
Other languages
Korean (ko)
Other versions
KR101851843B1 (en
Inventor
이명준
하연의
진재환
Original Assignee
울산대학교 산학협력단
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 울산대학교 산학협력단 filed Critical 울산대학교 산학협력단
Priority to KR1020160025099A priority Critical patent/KR101851843B1/en
Publication of KR20160032717A publication Critical patent/KR20160032717A/en
Application granted granted Critical
Publication of KR101851843B1 publication Critical patent/KR101851843B1/en

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/10Office automation; Time management
    • G06Q10/103Workflow collaboration or project management
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F17/00Digital computing or data processing equipment or methods, specially adapted for specific functions
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/10Office automation; Time management
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/10Services
    • G06Q50/30
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L51/00User-to-user messaging in packet-switching networks, transmitted according to store-and-forward or real-time protocols, e.g. e-mail
    • H04L51/04Real-time or near real-time messaging, e.g. instant messaging [IM]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W4/00Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/12Messaging; Mailboxes; Announcements
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q2230/00Voting or election arrangements

Landscapes

  • Engineering & Computer Science (AREA)
  • Business, Economics & Management (AREA)
  • Strategic Management (AREA)
  • Human Resources & Organizations (AREA)
  • Tourism & Hospitality (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Operations Research (AREA)
  • Data Mining & Analysis (AREA)
  • General Business, Economics & Management (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Quality & Reliability (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Databases & Information Systems (AREA)
  • Mathematical Physics (AREA)
  • Software Systems (AREA)
  • General Engineering & Computer Science (AREA)
  • Health & Medical Sciences (AREA)
  • General Health & Medical Sciences (AREA)
  • Primary Health Care (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

The present invention relates to a 3D editing cooperation system, method, and recording medium, capable of preventing editing conflict by editing and copying an object through a leader elected from a plurality of users, in editing the object through cooperation of the plurality of users in a virtual space. In order to achieve the objective, the 3D editing cooperation system of the present invention comprises: a user group including a first user (A) performing an editing action of an object (X), an elected leader (L), and a plurality of users (B) cooperating with each other; an editing module; and a consensus module of each of the plurality of users in the user group. When the leader (L) receives a request for an editing (M(A, X)) action of the object (X) from the first user (A), the leader (L) provides authority to edit (M(A, X)) the object (X) to the first user (A) exclusively such that the other users (B) of the user group cannot perform the editing (M(B, X) of the object (X) through a locking algorithm and a consensus algorithm stored in the consensus module, and performs locking, and updates the editing (M(A, X)) of the object (X) of the first user (A) for each of the users of the user group.

Description

A 3D editing collaboration system, method and recording medium,

The present invention relates to a 3D editing collaborative system, method, and recording medium. More specifically, it is possible to select a reader for controlling the editing right of the 3D object in the user group, and the right to edit the 3D object can be given independently by the selected reader, To a 3D editing collaborative system, method, and recording medium capable of replicating and updating to collaborating users.

With the development of mobile devices and communication networks, the utilization of virtual space has been increasing. In recent years, there has been an increasing number of collaborative service providing systems for collecting, storing, processing and processing data together in a virtual space.

This collaborative system in the virtual space can increase the efficiency of work and overcome time and space constraints because many users can work together without gathering in one space in reality. It is getting attention.

However, a collaborative system in such a virtual space may cause an editing conflict that causes data loss and / or damage because a plurality of users are editing the object, and are likely to simultaneously edit and access the object.

The present invention relates to a 3D editing collaboration system capable of preventing an editing conflict because an object is edited and duplicated through a reader selected by a plurality of users in editing an object by collaborating in a virtual space by a plurality of users A method, and a recording medium.

The present invention also provides a 3D editing collaborative system, method, and recording medium in which a process of selecting a new leader is performed when a reader is determined that a network connection to a user group is disconnected.

It is to be understood that both the foregoing general description and the following detailed description of the present invention are exemplary and explanatory and are not intended to limit the invention to the precise form disclosed. It can be understood.

The 3D editing collaborative system according to an embodiment of the present invention includes a first user A performing an editing (M (A, X)) action of an object X, an elected reader L and a plurality of collaborating users (A, X) of the object X from the first user A, and the reader L includes an editing module and a consensus module, which each user has in the user group composed of the user B, (B, X)) action of the object X through the locking algorithm and the consensus algorithm stored in the consensus module of its own, after receiving the action request, (M (A, X)) authority of the object X to the user A alone and locks it, and the editing of the object X of the first user A is performed for each user in the user group M (A, X)) action.

 The locking algorithm includes a criterion for the following locking condition and log condition stored in the consensus module and the reader L has a request for editing (M (A, X)) of the object X of the first user A, (B, X) action of the object X if the user A and the user A meet the condition and the log condition sequentially, X) (M (A, X)) authority of the user.

- Lock condition: the edit action for the object (X) is not locked to all users in the user group or the edit (M (A, X)) of the object (X) The edit action is locked.

- Log condition: There is no request to edit the object (X) to the requester and other users (B) among the logs recorded in the index of the committed log since the index of the current log.

 In the consensus algorithm, the reader L who receives the request for the edit (M (A, X)) action of the object X from the first user A transmits the vote request message to the users in the user group , Each of the users in the user group receiving the voting request message verifies that the log information of the user L before the edit action of the object X is the same as the log information of the reader L, If the previous log is the same, it is determined that the previous log is synchronized, and the response message to the reader L is returned. If the number of response messages received from each of the users in the user group is larger than a preset value, (M (A, X)) action of the object X received from the user A and to update the log information to each of the users in the user group.

 In the consensus algorithm, if the second user among the users in the user group that has received the vote request message from the leader L confirms that the log information of the leader L is different from his previous log, The reader L that has received the log recovery operation reply message transmits the log information different from the second user to the second user through continuous message transmission and reception with the second user, The log recovery operation of the second user can be performed so as to be synchronized.

 The first user A delivers the editing (M (A, X)) action of the object X performed by its editing module to the consensus module, and the first user A accesses the consensus module (M (A, X)) action request of the object X to the reader L. [

 After determining in the consensus module of the first user A whether the edit (M (A, X)) action of the object X of the first user A conforms to the lock condition stored in its consensus module, (M (A, X)) action request of the object X to the reader L, if it matches the M (A, X)

 The reader L in the user group is selected and determined and when it is determined that the network connection with the other users A and B is disconnected, a new reader L can be selected.

 The reader L continuously transmits a beating signal to the other users A and B of the user group to confirm the network connection and the other users A and B of the user group transmit the beacon signal to the reader L within a predetermined time, It is determined that the network connection of the reader L is disconnected and a candidate is selected in the user group. If more than half of the votes are agreed upon, a candidate can be selected as a new leader L .

 The editing (M (A, X)) action of the object X of the first user A may be at least one of adding, modifying, moving, or deleting the object X.

A 3D editing collaborative method according to an embodiment of the present invention is a method in which a first user A performs an editing (M (A, X)) action of the object X in its editing module, (I) of delivering an edit (M (A, X)) action of the object X to the reader L through a consensus module of the first user A, (M) of the object X via the locking algorithm and the consensus algorithm stored in the consensus module of the reader L by the reader L, (III) authorizing and locking the editing (M (A, X)) rights of the object (X) to the first user (A) so as not to perform the action (IV) of editing the object (X) edit (M (A, X)) action of the first user (A) to the users.

 In step (III), the locking algorithm includes a reference to the following locking condition and log condition stored in the consensus module, and the reader L includes an edit (M (A) of the object X of the first user A, A) action to prevent other users B in the user group from performing the edit (M (B, X)) action of the object X if the request (X) (M (A, X)) authority of the object X can be given to the object X alone and locked.

- Lock condition: the edit action for the object (X) is not locked to all users in the user group or the edit (M (A, X)) of the object (X) The edit action is locked.

- Log condition: There is no request to edit the object (X) to the requester and other users (B) among the logs recorded in the index of the committed log since the index of the current log.

In step (III), the step of implementing the consensus algorithm may be performed by a reader (L) who receives a request for an edit (M (A, X)) action of the object (X) from a first user To the users in the user group. In step (III-i), the users in the user group receiving the table request message transmit their log information before the edit action of the object X to the log information of the reader L (III-ii) a step (III-ii) for confirming whether or not the same is identical to the previous log of the reader L, and returning a response message to the reader L (M (A, X)) of the object X received from the first user A if the number of response messages received from each of the users in the user group is larger than a preset value, (III-iv) of copying the log and the step And (III-v) step of updating each of the users.

The second user among the users in the user group that receives the vote request message from the reader L in step (III-ii) of the step of implementing the consensus algorithm in step (III) (III-vi) in which the second user returns a response message to the reader L in response to the log recovery operation, and if the reader L receives the log recovery operation response message, (III-vii) transmitting the log information different from the second user to the second user through the continuous message transmission / reception and proceeding the log recovery operation of the second user so that the log information is synchronized.

 (M (A, X)) action of the object X of the first user A in the consensus module of the first user A conforms to the locking condition stored in its consensus module in step (I) (M (A, X)) action request to the reader L if it meets the lock condition after determining that the object X is in the locked state.

 The reader L in the user group is selected and determined and may further include a step of selecting a new reader L when it is determined that the network L is disconnected from the other users A and B have.

 The step of selecting a new leader (L)

 Receiving a beating signal of a reader (L) that continuously transmits a beating signal to confirm a network connection from another user (A, B) of a user group, receiving a beating signal from another user (A, B) Determining that the network connection of the reader L is disconnected if the heartbeat signal is not received from the reader L in the user group and selecting a candidate in the user group, As shown in FIG.

The editing (M (A, X)) action of the object X of the first user A may be at least one of adding, modifying, moving, or deleting the object X.

Further, an embodiment of the present invention can be achieved as a computer-readable recording medium on which a program for executing the above-described 3D editing collaborative method is recorded.

The 3D editing collaborative system, method, and recording medium according to the present invention allow a plurality of users to edit an object by collaborating in a virtual space, and editing and copying of the object are performed through a reader selected from a plurality of users It is possible to prevent an editing conflict.

The 3D editing collaborative system, method, and recording medium according to the present invention may proceed to a process of selecting a new leader when it is determined that the network connection to the user group is disconnected by the reader.

It should be understood, however, that the effects obtained by the present invention are not limited to the above-mentioned effects, and other effects not mentioned may be clearly understood by those skilled in the art to which the present invention belongs It will be possible.

1 to 4 are block diagrams schematically illustrating an operation process of a 3D editing collaborative system according to an embodiment of the present invention.
5 is a flowchart illustrating a 3D editing collaborative method according to an embodiment of the present invention.

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

The embodiments of the present invention are described in order to more fully explain the present invention to those skilled in the art, and the following embodiments may be modified in various other forms, The present invention is not limited to the embodiment. Rather, these embodiments are provided so that this disclosure will be more faithful and complete, and will fully convey the scope of the invention to those skilled in the art.

Also, in the following drawings, each configuration is exaggerated for convenience and clarity of description, and the same reference numerals denote the same elements in the drawings. As used herein, the term "and / or" includes any and all combinations of any of the listed items.

The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention.

As used herein, the singular forms "a," "an," and "the" include singular forms unless the context clearly dictates otherwise. Also, "comprise" as used herein. And / or "comprising" when used herein are intended to specify the presence of stated features, integers, steps, operations, elements, elements and / And / or groups.

1 to 4, a 3D editing collaborative system according to an embodiment of the present invention will be described.

1 to 4 are block diagrams schematically illustrating an operation process of a 3D editing collaborative system according to an embodiment of the present invention.

1 to 4, a 3D editing collaborative system according to an embodiment of the present invention includes a user group consisting of a first user A, an elected leader L, and a plurality of collaborating users B, And an editing module and a consensus module of each user in the user group.

Each user is configured as a node of the system, and can perform three roles as a leader, a follower, and a candidate as shown in FIGS. 2 and 3.

The editing module is a module for editing 3D objects in the 3D editing collaborative system and updates the editor screen and delivers work requests to the consensus module according to the work.

The consensus module is a module responsible for the consensus algorithm in the 3D editing collaborative system. The consensus module sends a request to the reader L in response to a task received from the editing module or transmits an action sent by the reader L to an editor screen To the editing module.

Here, the consensus algorithm (Consensus Algorithm) can vote for each user for log duplication of the edit request of the object (X) requested by the first user (A).

The leader (L) is the elected node through the leader election in the consensus algorithm. It receives the request from each user and plays the role of voting for the log duplication or reflecting the result.

Each user A and B is a node for voting in a consensus algorithm and sends each action request to the leader L for achieving consensus or A receives the action transmitted by the leader L .

2 and 3, the reader L continuously transmits a heartbeat message to each of the users A and B in order to confirm the network connection.

If each of the users A and B does not receive the beep signal within the set time, it is determined that the network connection of the reader L is disconnected and one of the users A and B becomes the reader L It is selected as a candidate. Thereafter, if a candidate receives more than a majority, he can be elected as a new leader.

Here, the newly-selected leader (New-Leader) performs the same role of the existing reader L so that the operation of the 3D editing collaborative system is not interrupted.

5, a 3D editing collaborative method in a 3D editing collaborative system according to an embodiment of the present invention will be described.

5 is a flowchart illustrating a 3D editing collaborative method according to an embodiment of the present invention.

5, a 3D editing collaboration method according to an embodiment of the present invention includes a first user A performing an editing action of an object X, an elected reader L, and a plurality of collaborating users B), respectively.

Here, for the sake of convenience of explanation, the reader L assumes that the network connection is not disconnected, and only the second user B among the plurality of users B collaborating is illustrated, 2 The editing module from the user B is omitted.

First, the first user A executes editing (M (A, X)) of the object (X) in its editing module (SA1). Here, the editing (M (A, X)) of the object X may be at least one of addition, modification, movement, or deletion.

Then, the editing module of the first user A delivers a work request for the editing (M (A, X)) of the object X to the consensus module, and the consensus module of the first user (A) Confirm the lock table (SA2). Here, the locking table is held by each user and is synchronized by a locking algorithm.

(M (A, X)) action of the object X is judged not to be locked in the consensus module of the first user (A) if the lock condition stored in the lock table is satisfied SA3). Here, the lock condition means a condition for confirming which user is currently using (locking) the current object X, and is recorded in the table as follows.

Lock Condition = (X is not locked) or (X is locked by A)

(A (A, X)) of the object X of the first user A is returned by returning False if another user B is in use, ) Is in use, it returns True.

If the lock condition is satisfied, the consensus module of the first user A requests the reader L (SA4) for the editing (M (A, X)) action of the object X.

The consensus module of the reader (SL1) that receives the request for the editing (M (A, X)) action of the object (X) confirms its own lock table (SL2). Here, the locking table is owned by each user and is synchronized by the locking algorithm. However, in case that there is an error in the synchronization due to a network problem, the consensus module of the reader (L) )do.

(M (A, X)) action of the object X of the first user A is locked in the consensus module of the reader B if the lock condition stored in the lock table is satisfied (SL3). Here, the lock condition means a condition for confirming which user is currently using (locking) the current object X. (A (X)) of the object X of the first user A is returned by returning False if the other user B is in use, If it is in the middle, it returns True.

If the lock condition is satisfied, the consensus module of the reader L confirms its own log in order (SL4). Here, for the log replication of the consensus algorithm, the reader L and all users A and B have their own log records.

The consensus module of the reader L determines the log condition to determine whether the edit (M (A, X)) action of the object X of the first user A can be added to its own log, (SL5). Here, the log condition is recorded in the table as follows.

LogId: comIdx]) and not (D (B, X) in Log [curIdx: comIdx]

That is, if the first user A has already requested a modification or deletion operation on the object X, the corresponding action will be added to the log of the reader L, and then the user B other than the first user A ) Is in the current log (curIdx: comIdx - from the current to the current (current) index to the index of the committed log) so that if the request is to modify or delete the same object (B) Check.

The consensus module of the reader L inputs the edit (M (A, X)) action of the object X of the first user A to its own log SL6 and executes a consensus algorithm S6).

In the consensus algorithm S6, the consensus module of the reader L requests the user group to vote for the log registration (SL6-1).

Herein, in the consensus module of the reader L, the voting request message is delivered to the users in the user group, and each of the users in the user group receiving the voting request message transmits its own log information until the edit action of the object X (L).

Accordingly, if it is determined that the log information of the reader L is the same as the previous log of the reader L, the reader L returns an answer message indicating that the reader L is possible, and the reader L transmits an answer message (Step S7-3), it replicates the action log relating to the editing (M (A, X)) of the object X received from the first user A (SL8) . Also, the log information is updated (SA9, SL9, SB9 ...) to each user in the user group.

However, if the second user B among the users in the user group that has received the vote request message from the reader L confirms that the log information of the reader L is different from his previous log, the second user B And returns a response message to the reader L regarding the log recovery operation.

In this process, the reader L receiving the log recovery operation reply message continuously transmits and receives a message to and from the second user B, transfers log information different from the second user B to the second user B, The log recovery operation of the second user B is performed so that the information is synchronized.

As a result, when the reader L determines that the number of response messages received from each of the users is larger than a preset value (step S7-3), the editing of the object X received from the first user A (A, X)) (SL8). Also, the log information is updated (SA9, SL9, SB9 ...) to each user in the user group.

In this way, in the consensus module of each user, the edit (M (A, X)) action of the object X requested by the first user A is performed (SA10, SL10, SB10 ...).

(A, L, B) in the execution (SA10, SL10, SB10 ...) of the editing of the object (X) requested by the first user (A) (SA10-1, SL10-1, SB10-1, ...), and then the editing of the object X is performed (SA10-2, SL10-2, SB10 The editing is ended and the editing of the corresponding object X in the lock table of each of the users A, L and B is unlocked (SA10-3, SL10-3, SB10-3. ..)do.

In addition, the present invention can be embodied as computer-readable codes on a computer-readable recording medium. A computer-readable recording medium includes all kinds of recording apparatuses in which data that can be read by a computer system is stored. Examples of the computer-readable recording medium include a ROM, a RAM, a CD-ROM, a magnetic tape, a floppy disk, an optical data storage, and the like, and also implemented in the form of a carrier wave (for example, transmission over the Internet) . In addition, the computer-readable recording medium may be distributed over network-connected computer systems so that computer readable codes can be stored and executed in a distributed manner. And functional programs, codes, and code segments for implementing the present invention can be easily inferred by programmers skilled in the art to which the present invention pertains.

The present invention is not limited to the above-described embodiment, but may be embodied in the forms disclosed in the following claims It will be understood by those of ordinary skill in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined in the appended claims.

Claims (18)

In the user group consisting of the first user A performing the editing (M (A, X)) action of the object X, the elected reader L and the plurality of collaborating users B, An editing module and a consensus module; / RTI >
The reader (L)
After receiving an edit (M (A, X)) action request of the object X from the first user A, the other user in the user group through a locking algorithm and a consensus algorithm stored in the consensus module of the user (M (A, X)) authority of the object (X) to the first user (A) so that the first user (B) can not perform the edit (M And then,
(M (A, X)) action of the object (X) of the first user (A) to each user in the user group.
The method according to claim 1,
Wherein the locking algorithm includes a reference to the following locking condition and log condition stored in the consensus module,
If the reader (L) sequentially requests the edit (M (A, X)) of the object (X) of the first user (A) to the lock condition and the log condition, (M (A, X)) authority of the object X alone to the first user A so that the first user A can not perform the edit (M (B, X)) action of the object X The 3D editing collaborative system comprising:
- Lock condition: the edit action for the object X is not locked to all users in the user group or the edit (M (A, X)) action requestor of the object (X) Editing action is locked.
- Log condition: There is no request to edit the object (X) to the requester and other users (B) among the logs recorded in the index of the committed log since the index of the current log.
3. The method of claim 2,
In the consensus algorithm,
The reader L having received the request for the edit (M (A, X)) action of the object X from the first user A transmits a vote request message to the users in the user group,
Each of the users in the user group that has received the voting request message verifies whether the log information of the user before the edit action of the object X is the same as the log information of the reader L, If the information and the previous log of the same are the same, it is determined that the information is synchronized, and the response message is returned to the reader (L)
If the number of response messages received from each of the users in the user group is greater than a predetermined value, the reader L can perform editing (M (A, X)) actions of the object X received from the first user A And updates the log information to each of the users in the user group.
The method of claim 3,
In the consensus algorithm,
If a second user among the users in the user group that has received the voting request message from the reader L confirms that the log information of the reader L and the previous log of the reader L are different,
The second user returns an answer message to the reader L regarding the log recovery operation,
The reader L having received the log recovery task response message transmits log information different from the second user to the second user through continuous message transmission and reception with the second user, And a log restoration operation of the user is performed.
3. The method of claim 2,
The first user A transmits an edit (M (A, X)) action of the object X performed by the editing module of the first user A to the consensus module,
Wherein the first user A sends an edit (M (A, X)) action request of the object X to the reader L through the consensus module of its own.
6. The method of claim 5,
(M (A, X)) action of the object (X) of the first user (A) in the consensus module of the first user (A) conforms to the locking condition stored in its consensus module After judging,
And sends an edit (M (A, X)) action request of the object (X) to the reader (L) if the lock condition is satisfied.
The method according to claim 1,
The reader (L) in the user group is elected and determined,
Selects a new leader (L) when it is determined that the network connection with other users (A, B) is disconnected.
8. The method of claim 7,
The reader L continuously sends a beating signal to the other users A and B of the user group to confirm a network connection,
If the other users A and B of the user group do not receive the beep signal from the reader L within a predetermined time, it is determined that the network connection of the reader L is disconnected,
Selecting a candidate in the user group, and selecting a candidate as a new leader (L) if a majority of votes are agreed upon through a vote.
The method according to claim 1,
Wherein the editing (M (A, X)) action of the object (X) of the first user (A) is at least one of adding, modifying, moving or deleting an object (X).
A method for collaborating on 3D editing in a user group consisting of a first user A performing an editing (M (A, X)) action of the object X, an elected reader L and a plurality of users collaborating In this case,
The first user A performs an editing operation M (A, X) of the object X in its editing module and the editing of the object X (M (A, X)) with its own consensus module, X)) action (step (I));
(II) the editing (M (A, X)) action of the object (X) to the reader (L) through the consensus module of the first user (A);
The reader L may prevent the other users B in the user group from performing the editing (M (B, X)) action of the object X through the locking algorithm and the consensus algorithm stored in the consensus module of the reader L, (III) granting the editing (M (A, X)) right of the object (X) to the user (A) alone; And
(IV) of editing the object (X) edit (M (A, X)) action of the first user (A) to each user in the user group, How to collaborate.
11. The method of claim 10,
In the step (III)
Wherein the locking algorithm includes a reference to the following locking condition and log condition stored in the consensus module,
If the reader (L) sequentially requests the edit (M (A, X)) of the object (X) of the first user (A) to the lock condition and the log condition, (M (A, X)) authority of the object X alone to the first user A so that the first user A can not perform the edit (M (B, X)) action of the object X Wherein the 3D editing collaborative method comprises:
- Lock condition: the edit action for the object X is not locked to all users in the user group or the edit (M (A, X)) action requestor of the object (X) Editing action is locked.
- Log condition: There is no request to edit the object (X) to the requester and other users (B) among the logs recorded in the index of the committed log since the index of the current log.
12. The method of claim 11,
In the step (III)
The step of implementing the consensus algorithm
The reader L having received the request for the edit (M (A, X)) action of the object X from the first user A transmits a vote request message to the users in the user group III-i);
Each of the users in the user group that has received the voting request message confirms whether its log information before the edit action of the object X is the same as the log information of the reader L (III-ii);
(III-iii) determining that the log is synchronized if the log information of the reader L is the same as the previous log of the reader L, and returning an answer message indicating that the reader L is possible to the reader L;
(M (A, X)) of the object (X) received from the first user (A) if the number of response messages received from each of the users in the user group is larger than a predetermined value (III-iv) replicating an action log related to the action; And
(III-v) updating the log information to each of the users in the user group; And a 3D editing collaborative system.
13. The method of claim 12,
In the step (III)
During the implementation of the consensus algorithm
If a second user among the users in the user group that has received the vote request message from the reader L in step (III-ii) confirms that the log information of the reader L and the previous log of the reader L are different,
(Iii-vi) the second user returns an answer message to the reader (L) about the log recovery operation; And
The reader L having received the log recovery task response message transmits log information different from the second user to the second user through continuous message transmission and reception with the second user, (III-vii) proceeding with the log recovery operation of FIG. Further comprising the steps of:
11. The method of claim 10,
In the step (I)
(M (A, X)) action of the object (X) of the first user (A) in the consensus module of the first user (A) conforms to the lock condition stored in its consensus module After judging,
And sends an edit (M (A, X)) action request of the object (X) to the reader (L) if the lock condition is satisfied.
11. The method of claim 10,
The reader (L) in the user group is elected and determined,
Further comprising the step of selecting a new leader (L) when it is determined that the reader (L) is disconnected from the network with other users (A, B).
16. The method of claim 15,
The step of selecting the new leader (L)
Receiving the beating signal of the reader (L) that continuously transmits a beating signal to confirm a network connection at another user (A, B) of the user group;
Determining that the network connection of the reader (L) is disconnected if the beating signal is not received from the reader (L) within a predetermined time in another user (A, B) of the user group; And
Selecting a candidate in the user group and electing the candidate as a new leader (L) if a majority of the votes agree; Wherein the 3D editing collaborative method comprises:
11. The method of claim 10,
Wherein the editing (M (A, X)) action of the object (X) of the first user (A) is at least one of adding, modifying, moving or deleting an object (X).
A computer-readable recording medium having recorded thereon a program for executing the 3D editing collaborative method according to any one of claims 10 to 17.
KR1020160025099A 2016-03-02 2016-03-02 3D editing collaboration system, method and recording media using the same KR101851843B1 (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
KR1020160025099A KR101851843B1 (en) 2016-03-02 2016-03-02 3D editing collaboration system, method and recording media using the same

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
KR1020160025099A KR101851843B1 (en) 2016-03-02 2016-03-02 3D editing collaboration system, method and recording media using the same

Publications (2)

Publication Number Publication Date
KR20160032717A true KR20160032717A (en) 2016-03-24
KR101851843B1 KR101851843B1 (en) 2018-06-08

Family

ID=55651533

Family Applications (1)

Application Number Title Priority Date Filing Date
KR1020160025099A KR101851843B1 (en) 2016-03-02 2016-03-02 3D editing collaboration system, method and recording media using the same

Country Status (1)

Country Link
KR (1) KR101851843B1 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20240047276A (en) 2022-10-04 2024-04-12 주식회사 위피엔피 Online editing device for collaboration for content creation
KR20240047277A (en) 2022-10-04 2024-04-12 주식회사 위피엔피 Option management device used as an addition to commercial shopping malls

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20000039196A (en) * 1998-12-11 2000-07-05 정선종 Control methdo of simultaneity in co-work
KR20030055908A (en) * 2001-12-27 2003-07-04 삼성에스디에스 주식회사 Method for Real-Time Synchronization of Data/Event between CADApplications Program
JP2008097236A (en) * 2006-10-11 2008-04-24 Fujitsu Ltd Program, method, and device for supporting group work analysis
KR20150089686A (en) * 2014-01-28 2015-08-05 한국전자통신연구원 Method and Apparatus for Providing 3D Software Real-time Collaboration Service Using Graphic Offloading

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20130133664A (en) * 2012-05-21 2013-12-09 삼성전자주식회사 Method, apparatus and system for interactive learning management and educational matters
KR20140042589A (en) * 2012-09-28 2014-04-07 강승호 Learning material for improving the leadership and online learning system having this

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20000039196A (en) * 1998-12-11 2000-07-05 정선종 Control methdo of simultaneity in co-work
KR20030055908A (en) * 2001-12-27 2003-07-04 삼성에스디에스 주식회사 Method for Real-Time Synchronization of Data/Event between CADApplications Program
JP2008097236A (en) * 2006-10-11 2008-04-24 Fujitsu Ltd Program, method, and device for supporting group work analysis
KR20150089686A (en) * 2014-01-28 2015-08-05 한국전자통신연구원 Method and Apparatus for Providing 3D Software Real-time Collaboration Service Using Graphic Offloading

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20240047276A (en) 2022-10-04 2024-04-12 주식회사 위피엔피 Online editing device for collaboration for content creation
KR20240047277A (en) 2022-10-04 2024-04-12 주식회사 위피엔피 Option management device used as an addition to commercial shopping malls

Also Published As

Publication number Publication date
KR101851843B1 (en) 2018-06-08

Similar Documents

Publication Publication Date Title
US7636868B2 (en) Data replication in a distributed system
US6532494B1 (en) Closed-loop node membership monitor for network clusters
CN101317163B (en) Non-stop transaction processing system
US20050283649A1 (en) Arrangement in a network for passing control of distributed data between network nodes for optimized client access based on locality
CN113163414B (en) Information processing method and near-real-time radio access network controller
US8589649B2 (en) Computer system and method of notifying error information of the computer system
CN108140031A (en) Equity can synchronize storage system
CN101689166B (en) Processing write requests with server having global knowledge
CN108491504A (en) Method and device for decentralized configuration management
CN113157980B (en) Data synchronization method, device, equipment and storage medium
CN112560129A (en) Building information model data cooperation method and system based on component level
KR101851843B1 (en) 3D editing collaboration system, method and recording media using the same
US10972296B2 (en) Messaging to enforce operation serialization for consistency of a distributed data structure
US20140108484A1 (en) Method and system for optimizing distributed transactions
US7516132B1 (en) Mechanism for enabling distributed file sharing among a plurality of nodes in a network
CN107911294B (en) Cooperative plotting message routing forwarding and processing method based on earth surface block
CN107291575B (en) Processing method and equipment for data center fault
US20100145911A1 (en) Serverless Replication of Databases
US11416449B2 (en) Method of synchronous deletion for distributed storage system
CN112433887A (en) Database data synchronization method, system, device and storage medium
WO2022224365A1 (en) Control method, control program, and information processing device
CN116760610B (en) User cross-domain authentication system, method, equipment and medium under network limited condition
CN113032483B (en) Cross-platform data asset sharing method and device and electronic equipment
US20240070614A1 (en) Methods for location mapping to facilitate collaboration for users sharing common attributes and devices thereof
CN118132525A (en) Multi-version management method and system for electric wiring diagram of power grid plant stations in cross regions

Legal Events

Date Code Title Description
A201 Request for examination
E902 Notification of reason for refusal
AMND Amendment
E601 Decision to refuse application
AMND Amendment
X701 Decision to grant (after re-examination)
GRNT Written decision to grant