TWI237766B - Method and system for performing interactive command in order, method and system for data synchronization between servers, and system for interaction between servers - Google Patents

Method and system for performing interactive command in order, method and system for data synchronization between servers, and system for interaction between servers Download PDF

Info

Publication number
TWI237766B
TWI237766B TW92135709A TW92135709A TWI237766B TW I237766 B TWI237766 B TW I237766B TW 92135709 A TW92135709 A TW 92135709A TW 92135709 A TW92135709 A TW 92135709A TW I237766 B TWI237766 B TW I237766B
Authority
TW
Taiwan
Prior art keywords
server
participant
command
servers
mentioned
Prior art date
Application number
TW92135709A
Other languages
Chinese (zh)
Other versions
TW200521695A (en
Inventor
Tsung-Han Lee
Yu-Jung Chang
Original Assignee
Inst Information Industry
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 Inst Information Industry filed Critical Inst Information Industry
Priority to TW92135709A priority Critical patent/TWI237766B/en
Publication of TW200521695A publication Critical patent/TW200521695A/en
Application granted granted Critical
Publication of TWI237766B publication Critical patent/TWI237766B/en

Links

Abstract

A method for performing interactive command in order first provides a time axis in a server. There are a plurality of participants in the server and each of the participants issues at least a command message. Subsequently, each command message is given a time stamp in accordance with the time axis. After every period of system time or when the count of command message reaches a critical value, the command messages issued by each participant containing the largest time stamp value are compared to obtain the minimum value out of the maximum time stamps of all the participants as the minimum time stamp value of the system. Lastly, the command message including the time stamp value not greater than the mentioned minimum time stamp value is executed.

Description

1237766 五、發明說明(1) 【發明所屬之技術領域】 本發明係有關於一種狀態同步 種在多伺服器中之多參與者之互動 【先前技術】 傳統線上遊戲伺服器,在處理 上’是採用命令抵達伺服器的先後 序,然而,這種做法會產生以下問 路遲滯造成較晚送出之命令卻比先 次,由於網路傳輸時間的不可預測 連帶不具可預測性,且可能導致資 一環境内有多台伺服器一起運作,' 間難以互動,且同一參與者在不同 易出錯。 舉例來說: 範例一:三方攻守問題 假設在一多人連線射擊遊戲中 事件一為A射擊B,導致B死亡< 致A死亡。在此範例中,事件一,二 否死亡。若事件一先發生,事件一 亡。反之,若事件二在事件一之前 則B仍然存活。 傳統的多人連線遊戲伺服器對 達祠服裔的時間點為事件發生時間 在A射擊B之前便射擊A,亦即事件二 :ί二且特別有關於-狀恕同步方法。 各參與者的互動行為 ^序做為命令的發生時 二I先,可能因為網 :的:令提早執行。其 的使得參與者的命令 枓的不連續。以及若同 不同伺服器内的參與者 飼服器間之狀態同步容 ’發生下列兩事件。 事件二為C射擊a,導 二的發生順序決定了 β是 為有效事件,則β死 發生,事件一不成立, 於上述問題,是採用到 點的方式處理,則若C 二發生在事件一之前, 0213-A40133TW(N1);D9225;/ i.ptd $ 4頁 1237766 鲁 五、發明說明(2) ------^____ 但由於網路遲滯因素,而使得事件二 器?原本應可存活_便會死亡。事件-晚到達词服 範例二··長效性命令結束時間點問題 ,設在角色扮演遊戲内,有一個長效性 伺服器必須在此長效性廢法的門 ’ ^生了, 個訊息,讓所有參與 =====發^ 何”束。但由於網路遲滞,可能導;始、 訊心别,邠先收到另一長效性魔法的開始吨自,j開始 上魔,已經結束q旦參與者卻 結;t者實幣 範例三:跨伺服器裁決問題 。束況心。 為,方便起見,傳統的線上遊戲大多不提 互動,母一伺服器管理不同群組之參與者,同' 习服器 與者間互相沒有關聯。若某一參與者 I 、、且之參 器到另一個伺服器,則相者 二” 屬的伺服 入另-伺服器。而若真原:服器,然後重新登 處理跨伺服器的命令;中裁上亦:;服态互動,•統系統在 區域飼服器,…有:題.舉例來說,有兩個 服器進入第二區域伺服器時:剛;:η:區域伺 同伺服器的參與者射下。第一又1处’被分屬兩不 自己區域内的參與者Α射下/伺服器判斷這隻雁子是被 是被自I區域内的參與㈣射^ —區飼服器判斷這隻雁子 不同的判斷結*。要解決這射個下門\§此時兩飼服器分別取得 者,決定兩伺服器何者正m,必須要有-個仲裁 轉移至第二區伺服器時,兩0*雁子由第—區伺服器 兩向服器間要有所有權轉移的動1237766 V. Description of the invention (1) [Technical field to which the invention belongs] The present invention relates to the interaction of multiple participants of a state synchronously in multiple servers [prior art] Traditional online game servers, in processing 'is The order in which the commands arrive at the server is used. However, this method will cause the following delays in routing and cause the later commands to be sent later than the previous ones. Due to the unpredictability of the network transmission time, the predictability is not predictable, and it may lead to a delay There are multiple servers working together in the environment, it is difficult to interact with each other, and the same participant is prone to errors in different situations. For example: Example 1: Three-party offensive and defensive problem Assume that in a multiplayer shooting game, event A is shooting A and B, resulting in B's death &A; In this example, events one and two are dead. If the event occurs first, the event dies. Conversely, if event two precedes event one, B is still alive. The point in time when the traditional multi-player game server is used to reach the ancestral temple is the time of the incident. Before A shoots B, he fires A, which is the second event: ί 2 and is especially about the synchronization method. The interactive behaviors of the participants are used as the order of the occurrence of the order. Two, first, it may be because of the Internet: that the order is executed early. Its discontinuity in the participants' orders. And if it is synchronized with the status of the participants and feeders in different servers, the following two events occur. Event two is C firing a. The sequence of the second derivative determines that β is a valid event. Then β will die, and event one will not be established. In the above problem, it is handled in a point-wise manner. If C two occurs before event one, , 0213-A40133TW (N1); D9225; / i.ptd $ 4 pages 1237766 Lu V. Description of the invention (2) ------ ^ ____ However, due to the network lag factor, the event is two? It would have been viable_ and would die. Event-late arrival grammar example 2 · The issue of the end point of the long-term command, set in the role-playing game, there is a long-term server that must be the door of the long-term invalidation method. Let everyone participate ===== 发 ^ 何 ”束. However, due to the network lag, it may lead; the beginning and the farewell, I first received the beginning of another long-acting magic since, j began to magic Participants have ended, but they have ended; Example 3 of real currency: Cross-server adjudication issues. Be careful. For convenience, most traditional online games do not mention interaction, and the parent-server manages different groups. Participants are not related to each other. If a participant I and a participant are connected to another server, the server belonging to the other two belongs to another server. And if the original: the server, and then re-login to process the cross-server command; the middle cut also :; service state interaction, the system is in the regional feeder, ... There are: questions. For example, there are two servers When the device enters the second area server: just;: η: Participants of the area server shoot. The first and the first place were shot by participants A who belonged to two different areas / the server judged that the goose was shot by the participant in the area I. ^ The area feeder judged that the goose was different Judgment result *. In order to solve the problem of shooting the next door, at this time, the two feeders are respectively obtained, and the two servers are determined to be m, there must be one arbitration transferred to the second zone server, two 0 * geese from the first zone There must be a transfer of ownership between the two servers

12377661237766

【發明内容】 有鑑於此,本發明之目的在提供一 息的方法,提供唯一時序做為各客戶端 得各客戶端設備發出之命令訊息不因網 而影響其先後發生的順序。此外,利用 各客戶端設備之可預測性資料。 本發明之另一目的在提 步的方法,使得在多區域伺 者可彼此互動並進行區域轉 本發明之另一目的在提 使传兩不同伺服器内之客戶 基於上述目的,本發明 方法。首先,於一伺服器中 複數客戶端設備同步。每一 令訊息,伺服器根據時間軸 記’然後每隔一段系統時間 值時,比較每一客戶端設備 之最大者,以取得一最小時 間戳記不大於上述最小時間 客戶端设備發出一須執行一 據該命令之時間戳記可得知 該命令執行的時間長度,則 本發明另外提供一種在 供一種 服器環 移。 供一種 端設備 提供一 提供一 上述客 賦予每 或當命 之命令 間戳記 戮記值 段時間 命令發 即可推 伺服器 在伺服器間進行資料同 境中,不同區域之參與 跨伺服器之互動系統, 亦能依時序進行互動。 種依序執行命令訊息的 時間軸以與伺服器中之 戶端設備發出至少一命 一命令訊息一時間戳 種依序執行命令訊 設備的時間軸,使 路傳輸速度的遲滯 時間戳記,可取得[Summary of the Invention] In view of this, the object of the present invention is to provide a method for providing a unique timing sequence for each client. The command messages sent by each client device do not affect the sequence in which they occur. In addition, use the predictability data of each client device. Another object of the present invention is to improve the method so that servers in multiple regions can interact with each other and perform regional transfer. Another object of the present invention is to enable customers in two different servers to perform the method of the present invention based on the above purpose. First, a plurality of client devices are synchronized in a server. For each order message, the server records the time according to the time axis, and then compares the maximum of each client device at each interval of system time to obtain a minimum time stamp not greater than the minimum time. Once the time length of the command is known according to the timestamp of the command, the present invention further provides a loop for a server. Provides a kind of end equipment to provide a time stamp between each or every command given by the customer. The time command is sent to push the server to perform data inter-server communication between servers. Different regions participate in cross-server interactions. The system can also interact in time sequence. A time axis for executing command messages in sequence with the client device in the server sends at least one command, a command message, and a time stamp. A time axis for executing command messages in order, making the transmission time delay of the time stamp.

令訊息 訊息中 值。最 之命令 方能完 出時間 算出其 間進行 數目到達 包含之時 後,執行 訊息。此 成的命令 ,只要能 結束時間 資料同步 一臨界 間戳記 包含時 外,當 時,根 計算出 〇 的方Make the message the value in the message. The most command can complete the time, calculate the number of times during which the process reaches the included time, and execute the message. This completed command, as long as it can end the time, data synchronization, a critical time stamp, includes the time, and at that time, the root calculates the square of 〇

1237766 五、發明說明(4) 法。在一第一伺服器中之一 與者進入第一區域之第— 一區域提供一參與者 出參與者的影像資料予 =匕域時,第一词 有更改參與者之資料的權卜;服器,此時第—词f适 鄰接之第二伺服器之s參與者離開第— 益具 :?參與者之主要資#,此時:服器將影像資 參與者之貧料的權限。 第—伺服器具有更改 本心明另外提供—種跨 第一飼服器與一第二伺服器。第動系統,其包括— 間轴與一互動系統對時,使二第二伺服器根據一時 同步。位於第一飼服器之第一參:者伺服器間可進行 服器之第二參與者’接著第 服出-命令予第二伺 令欲被執行。第二伺服器回應通知第二伺服器該命 然後第—與第二飼服器分別將該命=器了執行該命令。 列中,並計算其訊息佇列中之么A 7纟入其所屬之命令佇 取得-最小時間戳記值,且分之時間戳記值以 行該第一參與者發出之命令。該最小時間戳記值執 服器更新第—參與者之資料並且行命令後’第一飼 的,第二飼服器更新第二參與者二伺服器,同樣 器該更新資訊。 貝料並且通知第一伺服 【實施方式】 為讓本發明之上述和苴他 易懂,下文特舉出較佳實施例*寺徵和優點能更明顯 說明如下。 权佳““列’並配合所附圖式,作詳細1237766 V. Description of Invention (4) Method. When one of the participants in a first server enters the first area—the first area provides a participant ’s image data to the dagger domain, the first word has the right to change the participant ’s information; At this time, the participant of the second server, which is the first word suitable for the next server, leaves the second device. The main resource of the participant is: At this time, the server has the authority of the image resource participant to be poor. The first server has a change. In addition, the heart server provides a kind of cross-first server and a second server. The first moving system includes time synchronization between an axis and an interactive system, so that the two second servers are synchronized according to the time. The first parameter located at the first feeder: the second participant of the server that can perform the server ', and then the second server-order is given to the second server to be executed. The second server responds and informs the second server of the command, and the first and second feeders respectively execute the command. In the column, and calculate its message, A 7 enters the command it belongs to. Get-minimum timestamp value, and the minute timestamp value is used to execute the command issued by the first participant. The minimum timestamp value server updates the information of the first participant and executes the command. The first server updates the second server and the second server updates the information. [Embodiment] In order to make the above-mentioned and other aspects of the present invention easy to understand, the preferred embodiment and the advantages and advantages described below can be more clearly explained as follows. Quan Jia "" column "and in accordance with the drawings, detailed

0213-A4013JHF(Nl);D9225;ALEXCHEN.pt(i 第7頁 1237766 五、發明說明(5) ^ ^明係提供一種在多祠服器中之多參與者之互 態同步方法與系統。 本發月方法k供一時間戳記(Time-stamp),可在多 人參與的線上遊戲環境中,透過最小時間戳記計算 (LBT,· Low Bound Time Stamp )使得各參與者在不同時 ϋ 出之命令可依序完成。此外,利時間戳記,可取 、者之了預測性資料,以及在多區域飼服器環境 ,不同區域參與者可彼此互動並進行區域轉移。 班本發明係在一以用戶—伺服器(Client-Server )的 5 ΪIί Ϊ多參與者間之同步互•,在該環境中以-伺服 :伺I考相ΐ者間ί動行為的結果計算。&外,各用戶端 °連,可得知場景中其他參與者間的互動變化, 並且做出相對應的互動行為。 土模擬環境初始狀態時,伺服器提供一時間軸, 入伺服器·’需與伺服器端對時,將其客戶;電 細之時序調整成與伺服器之時序同步.此電 電腦時鐘時刻(WCT ’ffaU n〇ck The ) >/、者發出互動命令時,伺服器便會根二 息中加入一時間戮記值⑴二二= 且母隔-最小時間單位即更新時間戮記。料,來 ^ 端而言,接收端收到命令的順序與i出端ΐ: 的順序相同,不會產生後發先至的情況。 出 由於網路可能發生遲滯,因此伺服器賦予每一參 1237766 五、發明說明(6) 一訊息佇列,每當伺服器端收到參與者的命 f訊息儲存到佇列中。然後將所有參與者的命;;自:並 時間戳記之先後排序,計算出一最小時間戳記值(心? Bound Time Stamp),以確保在該最小時間 , 前發生的命令均可確實被依序執行。 °值之 此〔卜,為了使每一客戶端之電腦時鐘時刻可盥 同步。,母了參與者須定期對伺服器發出心跳(hi 益 )訊號,並且在其中加入時間戳記,以利 eat 服器的最小時間戳記。#下來敘 算以所述甸 小時間戳記。 τ异彳』服盗端之最 施步ί1 流圖:圖顯。示本發明之依序執行命令訊息的方法之實 參考第2圖,首先,於一飼服器2〇〇中提供 與其包含之複數客戶端設備201〜20η时(步驟上間軸以 伺服益200接收客戶端設備201〜20η所發出之至少一务丄 Λ心且根據時間軸賦予每一命令訊息一時間戳記「 7 S12 )。然後,每隔一段系統時間 广達驟 -臨界值時’比較每一客戶端設備之命令訊息中數目到達 間戮;:最ί者’以取得-最小時間戮記,(步二 ^ 行包含時間戳記不大於上述最小時間戳吃佶 ;命令訊息(步驟S14)。此外,當其中一客戶端=己值0213-A4013JHF (Nl); D9225; ALEXCHEN.pt (i Page 7 1237766 V. Description of the invention (5) ^ ^ The Ming Department provides a method and system for the mutual state synchronization of multiple participants in a multiple temple server. The month distribution method k provides a time stamp (Time-stamp), which can be used by multiple participants in an online game environment through a minimum time stamp calculation (LBT, · Low Bound Time Stamp) to make the commands issued by different participants at different times. It can be done in order. In addition, the timestamp, the predictive data, and the multi-area feeder environment, the participants in different areas can interact with each other and perform regional transfer. The present invention is based on a user— The server (Client-Server) 5 ΪIί 同步 Synchronization among multiple participants • In this environment, the calculation is based on the results of -Servo: Serve the test of the behavior between the participants. &Amp; outside, each client ° Connect, you can know the interaction changes between other participants in the scene, and make corresponding interaction behaviors. When the initial state of the soil simulation environment, the server provides a time axis, and the server must be synchronized with the server. To their customers; Adjusted to synchronize with the timing of the server. This computer clock time (WCT 'ffaU n0ck The) > /, when the user issues an interactive command, the server will add a time value to the second interest. = And the mother interval-the minimum time unit is the update time. It is expected that the order of receiving commands from the receiving end is the same as that of i: ΐ, and there will be no first-come-first-served situation. Because the network may be delayed, the server gives each participant 1237766 V. Invention Description (6) A message queue. Whenever the server receives the participant's f message, it is stored in the queue. Then all participants Since: Sort the timestamps in sequence and calculate a minimum timestamp value (heart? Bound Time Stamp) to ensure that the commands that occurred before this time can be executed in order. ° Value This [b, in order to synchronize the computer clock time of each client. Participants must periodically send a heartbeat (hi benefit) signal to the server and add a time stamp to it to facilitate the server's Minimum timestamp #DOWNscripted with the small time stamp described above. Τ 异 彳 』The most effective step of serving pirated ί1 Flow diagram: Graphic display. Refer to Figure 2 for the method of orderly executing the command message of the present invention. First, When a feeding device 2000 is provided with a plurality of client devices 201 to 20η contained therein (in the step, the upper axis receives at least one task from the client device 201 to 20η with the servo 200, and according to the time axis Each command message is given a time stamp "7 S12). Then, when the system time reaches the threshold-critical value, the number of command messages of each client device is compared and the time reaches:" the best one "to obtain -Minimum time to remember, (step 2 ^ line contains a timestamp not greater than the above minimum timestamp; command message (step S14). In addition, when one of the clients = own value

出一須執行一段時間方能完成的時,根據該 I =可得知命令發出時間,只要計算出該命令執行 間長度’則即可推算出其結束時間。 ^ 第9頁 0213-A40133HVF(Nl);D9225;ALEXCHEN.ptd 1237766 五、發明說明(7) 最小時間戳計值的計算方式如下, 3A圖,假設在伺服器中共有5個參盥者,牛夂1來^,參考第 個命令訊息,其時間戰記值分別以息件 者2之汛息佇列中有3個命令却自 3與4。 為2、5與7。參與者3之訊息作列中=個、日人間戳記值分別 值 rr、3、4與目 ΐ? 伺服器須等每一參與者之訊自y丄μ 令訊息到達時,或者等待一段系=佇列中^至少有一個命 •所有命令訊息之時間戳記值計算出^間^才會根據目前 執行小於等於該最小時間戳以;小時,戮記值,並且 ,. 退之命令訊息。 假设^參與者4發出一時間徵 ρ.. 滿足前述條件,⑹第3Β圖所示,貝;己值气5之:令訊息時即 最大的時間戳記值,並且取其中^比較=机息作列中之 敬小值為飼服5|夕》异1 . 間戳記值。以本實施例來說,5個& " '、時 最大時間戳記值分別為4、7、6、炙與者::”宁列中之 故可得伺服器之最小時間戳記值為,、6㈤//二小值為4, 該最小時間戳記值執行各參與者^’司服器根據 小於等於4之命令訊息,故參與者中時間戮記值 訊息,參與者2之訊息仵列中剩下1昧之訊二歹?已無命令 令訊息,其餘以此類推,如第3C圖間° ·、、、、6與7之命 L _所示。 前述範例一之三方攻守問題, ^ ^ 〇 如下所述。 根據本發明之處理過程When it takes a certain period of time to complete the command, the command issuance time can be obtained according to I =. As long as the command execution time length is calculated, the end time can be calculated. ^ Page 9 0213-A40133HVF (Nl); D9225; ALEXCHEN.ptd 1237766 V. Description of the invention (7) The calculation method of the minimum timestamp value is as follows, Figure 3A, assuming there are 5 participants in the server, cattle夂 1 comes ^, refer to the first command message, its time war value is in the flood information queue of the interest person 2, respectively, there are 3 orders but from 3 and 4. For 2, 5 and 7. Participant 3's message list = individual, daily human stamp value rr, 3, 4 and heading? The server must wait for each participant's message from y 丄 μ when the message arrives, or wait for a period = ^ There is at least one life in the queue. • The time stamps of all the command messages are calculated. The time ^ will be calculated based on the current execution of the minimum timestamp less than or equal to the minimum time stamp; hour, time stamp value, and. Suppose that ^ participant 4 sends a time sign ρ .. The above conditions are met, as shown in Figure 3B, and the value is 5: make the message the largest time stamp value, and take ^ comparison = machine interest as The respect value in the column is the feed value 5 | Xi> Variable 1. Time stamp value. In this embodiment, the maximum timestamp values of the five & " hours are 4, 7, and 6, respectively: "" The minimum timestamp value of the server available in Ninglie is, , 6㈤ // Second small value is 4, the minimum timestamp value is executed by each participant ^ 'The server according to the command message less than or equal to 4, so the time value message in the participant, the message queue of participant 2 The rest of the ambiguous news is still there? There is no order message, and the rest can be deduced by analogy, as shown in Figure 3C, ° ,,,, 6 and 7's life L_. The three examples of offensive and defensive problems in the previous example, ^ ^ 〇 As described below. Process according to the present invention

0213-A40133TW(Nl);D9225;ALEXCHEN.ptd0213-A40133TW (Nl); D9225; ALEXCHEN.ptd

I237766 五 、發明說明⑻ 時間戳射擊B,導致B死亡)之命令訊息中加入 訊息中加 ,在事件二(C射擊A,導致A死亡)之命令 加入了時門m己值u〇。由於各參與者在命令訊息中 件二會依令因此事件一與事 況。 不θ產生事件二比事件一提早發生的狀 因果動ΐ境中加入時間戳記概念,除可避免 來說,告夂β = 亦可使命令訊息具有可預測性。舉例 時,根i 4 2人發出一須執行一段時間方能完成的命令 該命令執;:二:5 Ξ戳記值可得知命令發出時間,只要 外,;長度’則即可推算出其結束時間。此 推得在ί ϊ ΐ 受到作用之參與者的設定資料,即可 各項狀態。 』町间円,該夂到作用之參與者的 月J述範例一之長效性命令纟士类味ρ爿 明之處理過程如下所述。“間點問題,根據本發 時Η :發出長效性命令時,命令内容包含了命令發出之 可】::值以及所須持續的時間長度,如&,各來盥者便 i 寻:該長效性命令的結束時間,不致於對長效性 7疋否仍有效用的問題造成混淆。 接下來說明如何解決跨伺服器的問題。 第4圖係顯示本發明之在伺 法之實施步驟流程圖。们服器間進行資料同步的方 參考第5圖,首先,由一安& 固自九田客戶端700在一第一伺服器I237766 V. Description of the invention ⑻ The time stamp shot B, causing B to die) was added to the command message, and the event 2 (C shot A, which caused A to die) was added with the time gate m u = 0. Participants will follow the order in the order message, so event one and the situation. The occurrence of event θ does not occur earlier than event 1. The concept of time stamp is added to the causal dynamic environment. In addition to avoiding it, reporting β = also makes the command message predictable. For example, the root i 4 2 person issued a command that must be executed for a period of time to complete the order; 2: 2: 5 ΞThe stamp value can know the time when the command was issued, as long as it is outside; the length can be used to calculate the end time. This pushes the setting data of the participants affected in ί ί ΐ, which can be various states. The long-lasting command of the example 1 described by the participants in this article is the long-lasting command, the flavor of the person, and the process of processing is as follows. "Sometimes, according to the time of issue: When a long-term command is issued, the content of the command includes the possibility of the command being issued.]: The value and the length of time required, such as & The end time of the long-acting command is not to cause confusion about whether the long-acting 7 is still effective. The following describes how to solve the problem of cross-server. Figure 4 shows the implementation of the invention in the servo method The flow chart of the steps. Refer to Figure 5 for the data synchronization between servers. First, a security &

12377661237766

與者750進入第一區域51〇之第一可視鄰接區域 田一多 50 0中之一第一區域51〇提供一參與者(步驟s2 Γ器5:時送第出參们與者的影像資料予一第二伺服… 時第一伺服器500具有更改參與者750之資M 限田參與者75〇離開第一區域51 0進入鄰接之第/一 Ί w 6 0 0 之一筮-rs* u ^ ^ ~ β 服裔 失斑者πη 伺服器6〇〇將影像資料轉換為該 > ”者750之主要資料(步驟S23 ),此時第二伺服 具有更改參與者750之資料的權限。 ° 第6—圖係顯示本發明之伺服器間根據參與者行為進行Participant 750 enters the first visible adjacent area of the first area 51. One of Tian Yiduo 50 0. The first area 51 provides a participant (step s2. Γ 5: send the video data of the participants and participants). Given a second servo ... When the first server 500 has the ability to change the participant 750 M. The field participant 75 leaves the first area 51 0 and enters one of the adjacent first / w 6 w 6 0 0 筮 -rs * u ^ ^ ~ β Served by the spotted person πη The server 600 converts the image data into the main data of the "> 750 (step S23). At this time, the second servo has the authority to change the data of the participant 750. ° Figure 6—shows that the servers of the present invention perform

互動之示意圖。舉例來說,在多伺服器的環境中,包括一 第一區域伺服器500與一第二區域伺服器6〇〇,同樣提供一 時,軸,各伺服器根據該時間軸彼此互相對時,因此兩伺 服器間發生的事件亦根據該時間軸進行排序"b外,兩伺 服器各自管理一獨立的區域,例如,第一區域51〇與第二 區域610,在每一區域中定義一"可視鄰接區域,,。客戶端 700之參與者A登入第一伺服器5〇〇,且當參與者a在第一區 域5 00的第一可視鄰接區域53〇時,第一區域伺服器5〇〇會 f參與者A的動作傳送一份影像(丨㈣以)資料給掌管第二 區域610的第二區域伺服器6〇〇,使得在第二區域61〇的參Schematic of interaction. For example, in a multi-server environment, a first area server 500 and a second area server 600 are included. Similarly, a time axis is provided, and each server is aligned with each other according to the time axis, so The events that occur between the two servers are also sorted according to the time axis. In addition, the two servers each manage an independent area, for example, the first area 51 and the second area 610. A "quote" is defined in each area. ; Visible adjacent area ,. The participant A of the client 700 logs in to the first server 500, and when the participant a is in the first visible adjacent area 53 of the first area 500, the first area server 500 will participate in the participant A Action sends an image (丨 ㈣) data to the second area server 600 which is in charge of the second area 610, so that the parameters in the second area 61o

與者B可看見參與者A的行為,如第6圖所示。其中影像資 料中包含目前參與者所屬之伺服器名稱、參與者之唯一識 別碼(ID)、參與者之設定值以及目前參與者發出之命令 訊息。Participant B can see the behavior of participant A, as shown in Figure 6. The image data includes the name of the server to which the current participant belongs, the unique identification number (ID) of the participant, the set value of the participant, and the command message sent by the current participant.

當參與者A跨越區域時,兩伺服器必須負責將參與者AWhen participant A crosses the area, the two servers must be responsible for

1237766 五、發明說明(10) 的資料及互動行為移轉,同時钟筲 間戮記值,以參與者A在跨越區域飼服器的最小時 此外,第一區域伺服器500計管夂 x生遲沭狀況。1237766 V. Description of the invention (10) The data and interactive behavior are transferred, and the value is recorded between the clocks and the time when the participant A is the smallest across the area. In addition, the first area server 500 counts Lateness.

Tt茶與者A跨越區域分X!廿 移出第一區域510的時間點,第一 ’匕域刀界1並 點將參與者A的影像資料轉換 第7圖係顯示本發明之參與者資料與互動行為在飼服 器間移轉之不意圖。當參與者A位於第一區域51〇之 視鄰接區域530時,第一伺服器5〇〇傳送其影像資料予第二 伺服器600,此時第一伺服器5〇〇仍具有對參與者人之控制 權。當參與者A跨越區域分界i,欲進入第二可視鄰接工區域 630時,第一飼服器500仍具有對參與者a之控制權,此時 參與者A位於區域分界1上,呈現、待移出的狀態。第一 伺服器500保有對參與者a之控制權直到參與者a ^離開 第一可視鄰接區域530的那一刻,亦即前述之移出第一^ 域510的時間點。 α 接下來,當參與者Α完全離開第一可視鄰接區域53〇, 且完全進入第二可視鄰接區域6 30時,參與者a之控制權移 轉給第二伺服器600,但位於第一伺服器5〇〇中之其它參與 者仍可看見參與者A的行為。此外,第二伺服器將原本 參與者A之影像資料轉換成主要資料,並且送出參與者A之 影像資料予第一伺服器500。當參與者A位於除了第'二可視 鄰接區域630外之第二區域510時,其控制權完全移轉給第When Tt tea and A cross the area and divide into X! 出 when they move out of the first area 510, the first 'dagger domain knife boundary 1' and click to convert the image data of participant A. Figure 7 shows the participant data and interaction of the present invention There is no intention to transfer behavior between feeders. When participant A is located in the adjacent area 530 of the first area 51, the first server 500 transmits its image data to the second server 600. At this time, the first server 500 still has Control. When participant A crosses the area boundary i and wants to enter the second visible adjacent work area 630, the first feeder 500 still has control over the participant a. At this time, the participant A is located on the area boundary 1. Removed status. The first server 500 retains control of the participant a until the moment when the participant a ^ leaves the first visible adjacent area 530, that is, the aforementioned point in time when it moves out of the first domain 510. α Next, when participant A completely leaves the first visible adjacent area 53 and completely enters the second visible adjacent area 6 30, the control of participant a is transferred to the second server 600, but is located in the first server Other participants in the device 500 can still see the behavior of participant A. In addition, the second server converts the image data of the original participant A into the main data, and sends the image data of the participant A to the first server 500. When participant A is located in a second area 510 other than the second visible adjacent area 630, his control is completely transferred to the first

0213-A40133TWF(N1);D9225;/ i.ptd 第13頁 1237766 五、發明說明(11) 二伺服器6 0 0,此時位於第一伺服器5 0 0中之其它參與者無 法看見參與者A的行為。 前述範例三之跨伺服器裁決問題,根據本發明之處理 過程如下所述。 在兩伺服器發生具有爭議性的不同計算結果時,由於 參與者分別具有時間戳記,因此不須有額外的仲裁者,也 不須特別進行所有權移轉動作,只要比較時間戳記即可決 定何者的計算結果正確。 除了上述習知方法欲解決的問題外,本發明另外提供 一跨伺服器互動方法。由於兩相鄰伺服器具有同一時間 軸,兩不同伺服器内的參與者亦能依各自擁有之時間戳記 值之時序發生互動。第8圖係顯示本發明之不同伺服器内 之參與者互動之步驟流程圖。舉例來說,參與者A在第一 區域,參與者B在第二區域,參與者A對參與者B發出動 作,其互動流程如下所述。 在步驟S1中,第一區域伺服器告知第二區域伺服器參 與者A發出一命令對參與者B執行一動作。 在步驟S2中,而第二區域伺服器回應第一區域伺服器 該動作可執行。 在步驟S3中,第一與第二區域伺服器分別將該命令排 入其訊息佇列中,並且分別告知位於其伺服器内之各參與 者該命令將被執行。 在步驟S4中,當最小時間戳記值大於或等於該命令之 時間戳記值時,第一與第二區域伺服器分別執行其訊息佇0213-A40133TWF (N1); D9225; / i.ptd Page 13 1237766 V. Description of the invention (11) Second server 6 0 0, at this time, other participants located in the first server 5 0 0 cannot see the participant A's behavior. The cross-server arbitration problem of the above-mentioned example three, the processing procedure according to the present invention is as follows. When the two servers have different and controversial calculation results, because the participants have timestamps, there is no need for an additional arbiter or special ownership transfer action. Just compare the time stamps to determine The calculation result is correct. In addition to the problems to be solved by the above conventional methods, the present invention further provides a cross-server interaction method. Since two adjacent servers have the same time axis, participants in two different servers can also interact according to the timing of their own timestamp values. Figure 8 is a flow chart showing the steps of participant interaction in different servers of the present invention. For example, participant A is in the first area and participant B is in the second area. Participant A sends an action to participant B. The interaction process is as follows. In step S1, the first area server informs the second area server that the participant A issues a command to perform an action on the participant B. In step S2, the second area server responds to the first area server to perform the action. In step S3, the first and second area servers respectively queue the command into their message queues, and notify each participant in their server that the command will be executed. In step S4, when the minimum timestamp value is greater than or equal to the timestamp value of the command, the first and second area servers execute their messages respectively.

0213-A40133TWF(Nl);D9225;ALEXCHEN.ptd 第14頁 1237766 五、發明說明(12) 列中之該命令。 在步驟S5中,當該命令被執行後,參與者A與參與者B 之資料即被更新’然而’因為第二區域伺服器無沒有權限 可更改參與者A之資料,因此第一區域伺服器在更改參與 者A之資料後,即將該更新訊息送給第二區域伺服器。同 樣的,第二區域伺服器在更改參與者B之資料後,即將該 更新訊息送給第一區域伺服器。 綜上所述,在伺服裔知須取得各參與者的命令時間戮 記,以計算出所有參與者的最小時間戳記,但如此使得系 統因個別參與者的遲滯而可能造成整個模擬系統遲滯,’因 !此可利用同一伺服器内的分區管理及強制執行命令的概念 解決該問題。 心0213-A40133TWF (Nl); D9225; ALEXCHEN.ptd Page 14 1237766 V. The order in column (12) of the invention description. In step S5, after the command is executed, the information of participant A and participant B is updated 'however' because the second regional server has no authority to change the information of participant A, so the first regional server After changing the information of participant A, the update message is sent to the second regional server. Similarly, after changing the information of participant B, the second area server sends the update message to the first area server. In summary, it is necessary to obtain the command time of each participant in the servo system to calculate the minimum timestamp of all participants. However, the system may cause the entire simulation system to be delayed due to the delay of individual participants. ' Therefore! The concept of partition management and enforced commands in the same server can be used to solve this problem. heart

就分區管理而言,由於具有地域性概念的模擬系統 相隔極遠的兩參與者彼此間不可能有互動情況, 一伺服器中,將參與者之命令排序序列進行分总 只要各分區內之么·來盘本人人丨、t ^ 1237766 五 、發明說明(13) 響其先後發生的順序。此外,利用時間戮記,。 與者之可預測性資料,以及在多區域伺服器严I取得各參 區域參與者可彼此互動並進行區域轉移。衣兄中,不同 雖然本發明已以較佳實施例揭 限定本發明,任何熟習此技藝者, 和範圍内,當可作各種之更動與潤 範圍當視後附之申請專利範圍所界 路如上,然其並非用以 在不脫離本發明之精神 錦’因此本發明之保護 定者為準。As far as partition management is concerned, since two participants who are far apart from each other in a simulation system with a regional concept cannot interact with each other, in a server, the ordering sequence of participants' orders is divided as long as it is within each partition. · Lai Pan I 丨, t ^ 1237766 V. Description of the invention (13) The sequence in which it happened. Also, use time to remember. Participant's predictability data, as well as access to the various parameters on the multi-region server. Regional participants can interact with each other and perform regional transfers. Yiyi brother, although the present invention has been limited to the present invention by a preferred embodiment, anyone skilled in the art, and within the scope, can make various changes and modifications to the scope. The scope of the attached patent scope is as above. However, it is not intended to depart from the spirit of the present invention. Therefore, the protection of the present invention shall prevail.

0213-A40133TW(Nl);D9225;ALEXCHEN.ptd 第16頁 1237766 圖式簡單說明 第1圖係顯示本發明之依序執行命令訊息的方法之實 施步驟流程圖。 第2圖係顯示本發明之依序執行命令訊息的系統架構 示意圖。 第3 A〜3C圖係顯示本發明之根據計算所得之最小時間 戳記值執行命令訊息之示意圖。 第4圖係顯示本發明之在伺服器間進行資料同步的方 法之實施步驟流程圖。 第5圖係顯示本發明之在伺服器間進行資料同步的系 統架構示意圖。 第6圖係顯示本發明之伺服器間根據參與者行為進行 互動之示意圖。 第7圖係顯示本發明之參與者資料與互動行為在伺服 器間移轉之示意圖。 第8圖係顯示本發明之不同伺服器内之參與者互動之 步驟流程圖。 符號說明】 1〜區域分界 2 0 0〜伺服器 20 1. . 20η〜客戶端設備 5 0 0〜第一區域伺服器 510〜第一區域 530〜第一可視鄰接區域0213-A40133TW (Nl); D9225; ALEXCHEN.ptd Page 16 1237766 Brief Description of the Drawings Figure 1 is a flowchart showing the steps of implementing the method for sequentially executing command messages according to the present invention. FIG. 2 is a schematic diagram showing a system architecture for sequentially executing command messages according to the present invention. Figures 3A to 3C are schematic diagrams showing the execution of the command message based on the calculated minimum time stamp value of the present invention. FIG. 4 is a flowchart showing the implementation steps of the method for synchronizing data between servers according to the present invention. FIG. 5 is a schematic diagram of a system architecture for synchronizing data between servers according to the present invention. Fig. 6 is a schematic diagram showing the interaction between the servers of the present invention according to the behavior of the participants. Figure 7 is a schematic diagram showing the transfer of participant data and interactive behaviors between servers of the present invention. Figure 8 is a flow chart showing the steps of participant interaction in different servers of the present invention. Explanation of symbols] 1 ~ area boundary 2 0 0 ~ server 20 1.. 20η ~ client device 5 0 0 ~ first area server 510 ~ first area 530 ~ first visible adjacent area

0213-A40133TW(Nl);D9225;ALEXCHBi.ptd 第17頁 1237766 圖式簡單說明 6 0 0〜第二區域伺服器 610〜第二區域 630〜第二可視鄰接區域 700〜客戶端 750、A、B〜參與者 ran 0213-A40133™F(Nl);D9225;ALEXCHEN.ptd 第18頁0213-A40133TW (Nl); D9225; ALEXCHBi.ptd Page 17 1237766 Brief description of the drawing 6 0 0 ~ Second area server 610 ~ Second area 630 ~ Second visible adjacent area 700 ~ Clients 750, A, B ~ Participant ran 0213-A40133 ™ F (Nl); D9225; ALEXCHEN.ptd Page 18

Claims (1)

1237766 六、申請專利範圍 1 · 一種依序 中’上述伺服器 列步驟: 於上述伺服 備同步; 接收上述客: 令訊息包含上述 比較每一客 最大者,以取得 執行包含時間戳 息。 2 ·如申請專 方法’其中,每 述伺服器中時, 驟。 3 ·如申請專 方法,其中,若 根據上述命令訊 結束作用時間。 4 ·如申請專 方法,其中,每 (Heart-Beat ) 5·如申請專 方法,其中,上 執行命 透過網 器中提 戶端設 時間軸 戶端設 一最小 s己不大 利範圍 一客戶 或每隔 利範圍 一命令 息之起 利範圍 一客戶 訊號, 利範圍 述命令 每一命 令訊息的方法,其執行於一伺 路耦接於複數客戶端設備,包括下 供-崎,並且與上述客戶端設 備所發出至少一命令訊息 之一時間戳記; ,之命令訊息中包含之時 時間戳記值;以及 戧。己之 於上述最小時間戳記值之命令訊 二項所述的依序執行命令訊息的 —P ^ "1有一個命令訊息到達上 奴不統時間,即執行上述比較步 J項所述的依序執行命令訊息的 1二八有一固定作用時間長度,則 。乍用時間可預測上述命令訊息之 述的依序執行命令訊息的 〇又觜疋期對上述伺服器發出心跳 且在其中加入一時間戳記。 1自項:述的依序執行命令訊息的 心儲存於一訊息佇列中。1237766 6. Scope of patent application 1 · A sequence of the steps of the above-mentioned server: synchronize with the above-mentioned server; receive the above-mentioned customers: let the message include the above and compare each of the largest users to obtain the execution time stamp information. 2 · As in the application method ′, each step in the server. 3 · If you apply for a special method, if the end of the action time according to the above command. 4 · If you apply for a special method, where each (Heart-Beat) 5 · If you apply for a special method, where you execute the command to raise the client through the web server, set the timeline, and the client set a minimum s that is not profitable for a customer or The command range of each command range is the range of the client signal. The method of commanding each command message is executed on a server that is coupled to a plurality of client devices, including the supply-supplier and the client. A time stamp of at least one command message sent by the end device; a time stamp value in the command message; and 戗. As for the above-mentioned minimum execution timestamp value of the command message described in the second item of the command message—P ^ " 1, a command message arrives at the time of slavery disorder, that is, the execution of the step described in the above comparison step J item The sequence of execution of the command message has a fixed length of time. The first time can predict the sequential execution of the command message described in the above command message, and the heartbeat will be sent to the server and a time stamp will be added to it. 1 Optional: The heart of the orderly execution of the command message is stored in a message queue. 1237766 六、申請專利範圍 6 ·如申請專利範圍第1 方法’其中,每一客戶端設備二的依序執行命令訊息的 上述時間軸取得同步。 且上述伺服器時,即根據 7·種依序執行命令訊息的李# 一佴服器,其提供一時門2先,至少包括: 複數客戶端設備,、耦接於上述=及时A — 設備發送至少一命令$自' a 5服器端,每一客戶端 —二7 Λ息至上述伺服器; 、 比較每—宏了: °卩令訊息包含上述時間轴之-時間a 4 比苹乂母一客戶端設備之命 町間戳圮, 者’以取得-最小時間戳記含之時間戳記之最大 上述伺服器執行包含時間戳記 記值之命令訊息。 大於上述取小時間戳 的 奉:·:!請專利範圍第7項所述的依序執行命令I 系、,先,其中,上述伺服器端在每一客戶 - 命令訊息到達上述伺服器中時, 二备&夕有 比較上述時間戳記。 # An段系統時間 的 “广Ϊ!請專利範圍第7項所述的依序執行命令气自 上述伺服器可根據上述命令訊息之起始作用長度’則 述命令訊息之結束作用時間。 、b預測上 10. 如申請專利範圍第7項所述的依序執 系統,其中’每-客戶端設備定期對上述伺月的 (Heart-Beat)訊號,並且在其中加入上述ϋ出心跳 11. 如申請專利範圍第7項所述的依序執行命令的 0213-A40133TW(Nl);D9225;ALEXCHEN.ptd 第20頁 I237766 '申請專利範圍 系統,其中, 1 2·如申往蜜述命―令訊息儲存於一訊息佇列中。 系统,其中,^利範圍第7項所述的依序執行命令訊息的 服器時,即根據 間進行資料同步的方法,包括下列 上述時^一客戶端設備登入上述伺 叮间釉取得同步。 步驟u·—種在飼服器 冬Ji π I伺服器中之一第一區域提供一參與者; 及 當 伺服器 換為上 14 料同步 上述第 15 料同步 之區域 仍具有 16 料同步 一第二 者之一 域,則读二 > 與者進入上述第一區域之一第一可視鄰接區 ' 、上述參與者之一影像資料予一第二伺服器;以 上j參與者離開上述第一區域進入鄰接之上述第二 第二區域,上述第二伺服器將上述影像資料 述參與者之主要資料。 •如申凊專利範圍第1 3項所述的在伺服器間進行資 的方法,其中,上述參與者位於上述第一區域時、, 饲服器具有更改上述參與者之資料的權限。 •如申請專利範圍第1 3項所述的在伺服器間進行資 的方法’其中,當上述參與者位於上述兩伺服器間 邊界上時,其呈現待移出狀態,且上述第一伺服器 更改上述參與者之資料的權限。 ° 如申請專利範圍第1 3項所述的在伺服器間進行資 的方法’其中,當上述參與者位於上述第二區域、之 可視鄰接區域中時,上述第二伺服器送出上述參與 影像資料予上述第一伺服器。 / ^1237766 6. Scope of patent application 6 · For example, the first method of the scope of patent application ', wherein each client device 2 executes the above-mentioned time axis of the command message in sequence to obtain synchronization. And the above server is a Li # server that executes command messages in sequence according to 7 types of servers, which provides a time gate and 2 first, at least including: a plurality of client devices, coupled to the above = timely A—device sending At least one command $ from 'a 5 server, each client — 2 7 Λ interest to the above server;, compare each — macro: ° Let the message contain the above timeline-time a 4 than the apple A client device fetches the life of the client, or the server above executes the command message containing the timestamp value with the maximum timestamp contained in the minimum timestamp. Bong that is larger than the above to take a small timestamp: · :! Please execute the order I described in item 7 of the patent scope first, first, where the server side compares the above timestamps with each client-command message when it reaches the server. # An segment of system time "Wide! Please execute the command in sequence as described in item 7 of the patent range. From the above server, the command message's end action time can be described according to the initial action length of the command message.", B Prediction on 10. Sequential execution system as described in item 7 of the scope of patent application, where 'every-client device periodically responds to the above-mentioned Heart-Beat signal, and adds the above-mentioned outgoing heartbeat 11. Apply for the order of 0213-A40133TW (Nl); D9225; ALEXCHEN.ptd page 20 I237766 of the scope of patent application for the order to execute the order described in item 7 of the scope of patent application, among which, 1 2 · If you apply to the honey, order information It is stored in a message queue. The system, in which, when the server of the command message is sequentially executed as described in item 7 of the scope, the method of data synchronization is based on the following methods, including the following: ^ a client device login The above glaze is synchronized. Step u · Provide a participant in the first area of one of the feeder Ji π I servers; and when the server is changed to the 14th material, the 15th material is synchronized. region If there is a field of 16 data synchronized with one of the second, then read two> and enter one of the first visible adjacent areas of the first area above, and one of the participants' image data to a second server; the above j participates The person leaves the first area and enters the adjacent second and second area, and the second server describes the above-mentioned image data as the main data of the participants. • It is performed between servers as described in item 13 of the scope of patent application. If the participant is located in the first area, the feeder has the right to change the information of the participant. • The method of funding between servers as described in item 13 of the scope of patent application. 'Where, when the participant is located on the boundary between the two servers, it is in a state of pending removal, and the first server changes the authority of the participant's data. ° As described in item 13 of the scope of patent application Method for conducting data between servers', wherein, when the participant is located in the second area and a visible adjacent area, the second server sends the participating video data To the first server. / ^ 0213-A40133TW(Nl);D9225;ALEXCHEN.ptd 第21頁 !2377660213-A40133TW (Nl); D9225; ALEXCHEN.ptd Page 21! 237766 料同步的Λ甘"'圍第13項所述的在^^ 域時,上當上述參與者完全進人上述第Λ 限。上述第二飼服器具有更改上述參與者之資料的 18· 括: 一種在伺服器間進行資料同步的系統 至少包 —客戶端,其提供一參與者; 者進入器#’耦接於上述客戶端’其於上述參與 與者之之—第—可視鄰接區域時,送出上述參 可之一影像資料;以及 器端—ΐ二伺服器端,耦接於上述客戶端與上述第一伺服 區域睡,^^/、有進八/、笫區域之一第一可視鄰接 上、,自上述第一伺服器端取得上述影像資料,並且當 j,與者離'開上述第一區域進入上述第二伺服器端之二 料一區域時,將上述影像資料轉換為上述參與者之主要資 1 9·如/申請專利範圍第1 8項所述的在伺服器間進行資 ;斗同步的系統,其中,上述參與者位於上述第一區域時, 上述第伺服器端具有更改上述參與者之資料的權限。 、,2 0 ·如申請專利範圍第1 8項所述的在伺服器間進行資 料同步的系統’其中,當上述參與者位於上述兩伺服器端 間之區域邊界上時,其呈現待移出狀態,且上述第一伺服 器端仍具有更改上述參與者之資料的權限。 21 ·如申請專利範圍第1 8項所述的在伺服器間進行資Synchronized Λ Gan " 'While in the ^^ domain as described in item 13, the above participants fully entered the above Λ limit. The above-mentioned second feeder has the features of changing the information of the above participants, including: A system for synchronizing data between servers, including at least a client, which provides a participant; and an entry device # 'is coupled to the above client The terminal 'sends the image data of one of the above-mentioned participants when the first-visible contiguous area of the participant and the above-mentioned one; and the device-second server end is coupled to the client and the first servo area. , ^^ /, there is a first visible adjacency to one of the eight /, 笫 regions, the image data is obtained from the first server, and when j, leave the first region and enter the second When the server-side two materials and one area, the above-mentioned image data is converted into the main assets of the above-mentioned participants. When the participant is located in the first area, the second server has the authority to change the data of the participant. , 2 0 · The system for synchronizing data between servers as described in item 18 of the scope of patent application ', wherein when the participant is located on the boundary of the area between the two server ends, it is in a state of pending removal. , And the first server side still has the authority to change the data of the participants. 21 · Investing between servers as described in item 18 of the scope of patent application 1237766 六、申請專利範圍 ___ 料同步的系統,其中,當 一第二可視鄰接區域中時,7 4與者位於上述第二區域之 與者之一影像資料予上诚笛上述第二伺服器端送出上述參 m如申請專利範圍第V:服器端° 料同步的系統,其中,备h +.項所述的在伺服器間進行資 域時,上述第二伺服器;且右1與者完全進入上述第二區 限。 知具有更改上述參與者之資料的權 23. -種跨伺服器之互動 一第二伺服器,包括—笛_ 夕已括. 一互動系統對時,;以及弟—參與者其根據一時間軸與 一第一伺服器,耦接於 眭紅彻μ、+、π I / 於上述弟二飼服器,其根據上述 時間轴與上述互動系統對時 犯爆上述 1:之二參:者…以上二=與步者且 述命令,上述第一與第二伺服獎八=弟/服器可執仃上 咋令所包含之時間戳記值以取 果 八心 中之 阻Μ取传一最小時間戳記傕,曰八 別根據上述最小時間戳記值勃^ 刀 命令後,上述第一命Γ以及完成執行 、s 4 L、+、够, 為更新上达第一參與者之資料並且 二飼服器,上述第二伺服器更新上述第二參與 者之負料並且通知上述第一伺服器。 少’、 24. 如申,專利範圍第23項料的跨 ;主 2士述第:參與者發出-命令予上述第二參與 八二,上’〔伺服器通知上述第二伺服器欲執行上述命 i 第23頁 〇213-A40133TWF(Nl);D9225;ALEXCHEN.ptd 1237766 六、申請專利範圍 2 5 ·如申請專利範圍第2 3項所述的跨伺服器之互動系 統,其中,當上述第二伺服器回應上述第一伺服器可執行 上述命令,則上述第一與第二伺服器分別將上述命令排入 其所屬之訊息佇列中。1237766 VI. Patent application scope ___ Material synchronization system, in which, when a second visible adjacent area, 7 and 4 are located in one of the above-mentioned second area, the image data is sent to the above-mentioned second server The system sends out the above parameters as described in the patent application scope V: Server-end material synchronization system, in which the second server mentioned above is used when the information is provided between the servers described in item h + .; Those who have fully entered the second zone. Know the right to change the information of the above participants 23.-a kind of cross-server interaction-a second server, including-flute _ evening has been included-an interactive system timing, and the brother-participant according to a timeline And a first server, which is coupled to 眭 红 切 μ, +, π I / to the above-mentioned second-two feeder, which according to the above-mentioned time axis and the above-mentioned interactive system, the above-mentioned 1: two references: those ... above two = Responding to the commander, the first and second servo awards above = the brother / server can execute the timestamp value contained in the order to obtain the minimum time stamp 傕, After the eighth command is issued according to the minimum timestamp value, the first command Γ and the execution are completed, s 4 L, +, enough. To update the information of the first participant and two feeders, the first The two servers update the load of the second participant and notify the first server.少 ', 24. If applied, the scope of the 23rd item of the patent scope; the master and the second: the participant issued a-order to the second participant 82, above "[the server notified the second server to execute the above Life i Page 23 〇213-A40133TWF (Nl); D9225; ALEXCHEN.ptd 1237766 VI. Patent Application Scope 2 5 · The cross-server interactive system as described in Item 23 of the patent application scope. The two servers respond to the first server to execute the command, and then the first and second servers respectively queue the command to the queue of messages to which they belong. 0213-A40133TWF(Nl);D9225;ALEXCHEN.ptd 第24頁0213-A40133TWF (Nl); D9225; ALEXCHEN.ptd Page 24
TW92135709A 2003-12-17 2003-12-17 Method and system for performing interactive command in order, method and system for data synchronization between servers, and system for interaction between servers TWI237766B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
TW92135709A TWI237766B (en) 2003-12-17 2003-12-17 Method and system for performing interactive command in order, method and system for data synchronization between servers, and system for interaction between servers

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
TW92135709A TWI237766B (en) 2003-12-17 2003-12-17 Method and system for performing interactive command in order, method and system for data synchronization between servers, and system for interaction between servers

Publications (2)

Publication Number Publication Date
TW200521695A TW200521695A (en) 2005-07-01
TWI237766B true TWI237766B (en) 2005-08-11

Family

ID=36929931

Family Applications (1)

Application Number Title Priority Date Filing Date
TW92135709A TWI237766B (en) 2003-12-17 2003-12-17 Method and system for performing interactive command in order, method and system for data synchronization between servers, and system for interaction between servers

Country Status (1)

Country Link
TW (1) TWI237766B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107231400B (en) * 2016-03-25 2020-07-03 阿里巴巴集团控股有限公司 Data synchronization method and device

Also Published As

Publication number Publication date
TW200521695A (en) 2005-07-01

Similar Documents

Publication Publication Date Title
CN108174305B (en) The message treatment method and device of chatroom is broadcast live
CN111246178B (en) Video processing method and device, storage medium and electronic device
CN112712182B (en) Model training method and device based on federal learning and storage medium
CN110599263A (en) User interaction data processing method and device, storage medium and computer equipment
CN105027533B (en) The method and apparatus of the computing device of point to point network for identification
US20150128195A1 (en) Video reproduction system
EP4095693A1 (en) Data packet synchronization method and apparatus, device, and storage medium
CN108880983B (en) Real-time voice processing method and device for virtual three-dimensional space
CN109087082A (en) Financial transaction based on block chain executes method and device, electronic equipment
CN106161485B (en) A kind of resource regulating method of infrastructure service cluster, device and system
WO2019148981A1 (en) Data synchronization method and apparatus, and electronic cigarette
CN107220271A (en) A kind of method and system of distributed digital resource storage processing and management
EP2742469A1 (en) Method and system for generating occupant schedules
CN110020046B (en) Data capturing method and device
TWI237766B (en) Method and system for performing interactive command in order, method and system for data synchronization between servers, and system for interaction between servers
DE102018209208A1 (en) Technologies for time-delayed advanced reality representations
CN104205775B (en) The system delivered for high reliability and performance application message
Shen et al. Area of simulation: Mechanism and architecture for multi-avatar virtual environments
CN108322764B (en) Real-time interaction realization method and device
Natarajan et al. Distributed visual analytics for collaborative emergency response management
CN104753964B (en) Networking products methods of exhibiting, apparatus and system
CN113099247B (en) Virtual resource processing method, device, server, storage medium and program product
Cao et al. Revenue sharing in edge-cloud systems: A Game-theoretic perspective
Kim et al. A global timestamp-based scalable framework for multi-player online games
Baker Time management in distributed simulation models

Legal Events

Date Code Title Description
MM4A Annulment or lapse of patent due to non-payment of fees