Communication call route multi-administrator concurrent editing and merging method and system

By using atomic operation logs and vector clock causal determination, combined with CRDT data model and DAG constraint rules, the problems of configuration loss and topology relationship management in the concurrent editing of call route configuration by multiple administrators are solved, and the topology legality and consistency of simultaneous editing by multiple administrators are achieved.

CN122364236APending Publication Date: 2026-07-10XIAMEN XINGZONG DIGITAL TECH CO LTD
0 Cites 0 Cited by

Patent Information

Application Number
CN202610472507.X
Authority / Receiving Office
CN · China
Patent Type
Applications(China)
Current Assignee / Owner
Filing Date
2026-04-10
Publication Date
2026-07-10

AI Technical Summary

Technical Problem

When multiple administrators concurrently edit call route configurations, existing technologies are prone to causing configuration loss, floating routes, route deadlocks, and underlying engine malfunctions, and cannot effectively manage topology relationships and concurrent conflicts.

Method used

By using atomic operation logs, vector clock causal determination, and a dedicated graph CRDT data model, combined with DAG constraint rules, concurrent editing and merging by multiple administrators is achieved, ensuring consistency of operation order and topology legality.

Benefits of technology

It effectively reduces the impact of configuration loss and routing loops on the underlying engine, ensures that the topology remains valid when multiple administrators edit simultaneously, and avoids the impact of configuration loss and routing loops on the underlying engine.

✦ Generated by Eureka AI based on patent content.
Patent Text Reader

Abstract

The embodiment of the invention provides a communication call route multi-administrator concurrent editing and merging method and system, and the method comprises the steps: obtaining an interactive operation of a first administrator front end in a canvas layer, and packaging the interactive operation into an atomic operation object; logically marking the atomic operation object based on the vector clock; persistently storing the obtained operation log marked with the atomic operation object and transmitting the operation log to a second administrator front end; before the interaction operation is executed, comparing a local vector clock with a vector clock of the marked atomic operation object to obtain a comparison result; if the comparison result shows that the pre-operation object does not arrive yet, writing the currently received operation object into a waiting buffer area until the pre-operation object is supplemented, and executing a replay operation according to a causal sequence in the marked atomic operation object; and performing concurrent conflict detection and combination on the operation object to which the replay operation belongs and a local non-operation object at the front end of the second administrator. According to the method, the probability of mutual coverage of concurrent operations is reduced, and the impact of configuration loss and a routing loop on a bottom engine is avoided.
Need to check novelty before this filing date? Find Prior Art