WO2021057198A1 - Procédé et appareil de routage et de pénétration de processus entier inter-domaine basés sur les mégadonnées - Google Patents

Procédé et appareil de routage et de pénétration de processus entier inter-domaine basés sur les mégadonnées Download PDF

Info

Publication number
WO2021057198A1
WO2021057198A1 PCT/CN2020/101814 CN2020101814W WO2021057198A1 WO 2021057198 A1 WO2021057198 A1 WO 2021057198A1 CN 2020101814 W CN2020101814 W CN 2020101814W WO 2021057198 A1 WO2021057198 A1 WO 2021057198A1
Authority
WO
WIPO (PCT)
Prior art keywords
cross
routing
circuit
domain
domain service
Prior art date
Application number
PCT/CN2020/101814
Other languages
English (en)
Chinese (zh)
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 北京市天元网络技术股份有限公司
Publication of WO2021057198A1 publication Critical patent/WO2021057198A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/901—Indexing; Data structures therefor; Storage structures
    • G06F16/9024—Graphs; Linked lists
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/903—Querying
    • G06F16/90335—Query processing

Definitions

  • the present disclosure relates to the field of communication networks, and in particular, to a method, device, electronic device, and computer-readable storage medium for whole-process routing and penetration of cross-domain services based on big data.
  • Communication networks are becoming more and more complex. 2G, 3G, 4G and even 5G coexist. Huawei, ZTE, Fiberhome and other vendors coexist.
  • the wireless network, core network, data network, transmission network and other networks are coordinated, even if the transmission network can be subdivided. It is SDH network, PTN network, OTN network, PON network, etc.
  • SDH network SDH network
  • PTN network PTN network
  • OTN network PON network
  • different regions, different professions, and different types of network management are all integrated into a chimney shape and cannot be uniformly run through.
  • the purpose of the present disclosure is to provide a method, device, electronic device, and computer-readable storage medium for whole-process routing and penetration of cross-domain services based on big data, so as to overcome at least one or the other caused by the limitations and defects of related technologies to a certain extent. Multiple questions.
  • a method for whole-process routing and penetration of cross-domain services based on big data which includes:
  • the step of cross-domain service routing serial connection takes the basic circuit information table and the cross-domain connection table as input, and realizes the cross-domain service routing serial connection according to the preset circuit routing automatic serial connection algorithm;
  • the routing information and the A, Z end data of the cross-domain service routing after the concatenation are stored in the database and converted to the graph database.
  • the cross-domain service routing collusion is completed.
  • the cross-domain service routing concatenation step further includes:
  • the business information in the circuit basic information table includes the circuit code, the city to which it belongs, the network element of the circuit A side, the circuit A port, the time slot of the circuit A, the network element of the circuit Z, the port of the circuit Z, and the time of the circuit Z. Gap.
  • the cross-domain service routing concatenation step further includes:
  • the service information in the cross-domain connection table includes A-end network element, A-end port, Z-end network element, and Z-end port.
  • the preset circuit routing automatic concatenation algorithm in the cross-domain service routing concatenation step further includes:
  • the resource query step query the resource ID in the corresponding table according to the port or time slot 1 in the circuit basic information table;
  • the channel query step query the resource ID of the opposite end in the channel table according to the acquired ID, if not, execute the channel concatenation step; if yes, execute the resource judgment step;
  • Channel serial connection step if successful, execute the resource judgment step after obtaining the peer ID; if it fails, it is judged whether it is the first stage; if it is the first stage, the serial connection fails; if it is not the first stage, the exception handling step is executed;
  • Resource judging step judging whether the resource ID is port or time slot 2, if yes, complete the cross-domain service routing serial connection; if not, execute the exception handling step;
  • the data processing check step query whether there is data according to the resource ID to the topology connection, if not, execute the exception handling step; if so, obtain the resource ID of the opposite port or time slot, and execute the channel query step;
  • the abnormal handling step return to the channel query step to determine whether there are other paths. If there is no other path, execute the resource query step, and record the point in series at the time of the original abnormality.
  • the channel query step further includes:
  • the data processing and checking step includes:
  • the time slot requirements for obtaining the opposite end are consistent with the VC4NO and VC12NO of the time slot data at the local end.
  • the graph-based database collusion step includes:
  • Each Node saves the first Property and the first Relationship:
  • a device for whole-process routing and penetration of cross-domain services based on big data including:
  • the cross-domain service routing serial connection module is configured to take the basic circuit information table and the cross-domain connection table as input, and realize the cross-domain service routing serial connection according to the preset circuit routing automatic serial connection algorithm;
  • the graph database collusion module Based on the graph database collusion module, it is configured to store the routing information and the A, Z end data of the cross-domain business routing after the concatenation is completed and convert it to the graph database, and complete the cross-domain business routing collusion based on the graph database traversal algorithm.
  • an electronic device including:
  • a memory where computer-readable instructions are stored, and when the computer-readable instructions are executed by the processor, the method according to any one of the foregoing is implemented.
  • a computer-readable storage medium having a computer program stored thereon, and when the computer program is executed by a processor, the method according to any one of the above is implemented.
  • the present disclosure relates to a method, device, electronic device, and storage medium for whole-process routing and penetration of cross-domain services based on big data.
  • the method includes: cross-domain service routing concatenation step, taking circuit basic information table and cross-domain connection table as input, and realizing cross-domain service routing concatenation according to preset circuit routing automatic concatenation algorithm; based on graph database collusion step , After completing the concatenation, the routing information and the A and Z end data of the cross-domain business routing are stored in the database and converted to the graph database. Based on the graph database traversal algorithm, the cross-domain business routing collusion is completed.
  • the present disclosure reduces the time spent on data census based on big data analysis, reduces manual input, saves manpower and improves data accuracy, helps reduce costs, increase efficiency, and improve practicability.
  • Fig. 1 shows a flow chart of a method for whole-process routing and penetration of cross-domain services based on big data according to an exemplary embodiment of the present disclosure
  • Fig. 2 shows a schematic block diagram of a big data-based cross-domain service whole-process routing and penetration device according to an exemplary embodiment of the present disclosure
  • 3A-3C show graph database processing diagrams of a cross-domain service routing and penetration method based on big data according to an exemplary embodiment of the present disclosure
  • FIG. 4 shows a full flow chart of a method for whole-process routing and penetration of cross-domain services based on big data according to an exemplary embodiment of the present disclosure
  • Fig. 5 schematically shows a block diagram of an electronic device according to an exemplary embodiment of the present disclosure.
  • Fig. 6 schematically shows a schematic diagram of a computer-readable storage medium according to an exemplary embodiment of the present disclosure.
  • the big data-based cross-domain service full routing and penetration method may include the following steps:
  • Cross-domain service routing serial connection step S110 taking the circuit basic information table and the cross-domain connection table as input, and realizing the cross-domain service routing serial connection according to the preset circuit routing automatic serial connection algorithm;
  • the routing information and the A and Z end data of the cross-domain service routing after concatenation are stored in the database and converted to the graph database, and the cross-domain service routing collusion is completed based on the graph database traversal algorithm.
  • the present disclosure relates to a method, device, electronic equipment and storage medium for whole-process routing and penetration of cross-domain services based on big data.
  • the method includes: cross-domain service routing concatenation step, taking circuit basic information table and cross-domain connection table as input, and realizing cross-domain service routing concatenation according to preset circuit routing automatic concatenation algorithm; based on graph database collusion step , After completing the concatenation, the routing information and the A and Z end data of the cross-domain business routing are stored in the database and converted to the graph database. Based on the graph database traversal algorithm, the cross-domain business routing collusion is completed.
  • the present disclosure reduces the time spent on data census based on big data analysis, reduces manual input, saves manpower and improves data accuracy, helps reduce costs, increase efficiency, and improve practicability.
  • Mobile network resources are the basis for telecommunications companies to provide services to the outside world. Making full use of network resources and improving resource management and utilization efficiency are the keys to enterprise informatization. With the rapid development of communication technology and the increasing complexity of communication networks, it is more and more important to improve production efficiency, which can enhance the full-service competitiveness of operators.
  • step S110 of the cross-domain service routing serial connection the basic circuit information table and the cross-domain connection table may be used as input, and the cross-domain service routing serial connection can be realized according to the preset circuit routing automatic serial connection algorithm.
  • the existing solution requires people to maintain the circuit routing information through application or manually, and the matching relationship between the circuit routing and the circuit and the channel needs to be considered during the maintenance. Therefore, the complexity is high and errors are prone to errors.
  • the new scheme only requires maintenance personnel to operate the basic circuit information and cross-domain connection of the two tables. Through table comparison, it can be found that the amount of maintenance information is greatly reduced, and maintenance personnel do not need to care about the association relationship between different tables. These are all solved through technology, and the complexity is greatly reduced.
  • the cross-domain service routing concatenation step further includes:
  • the business information in the circuit basic information table includes the circuit code, the city to which it belongs, the network element of the circuit A side, the circuit A port, the time slot of the circuit A, the network element of the circuit Z, the port of the circuit Z, and the time of the circuit Z. Gap.
  • the cross-domain service routing concatenation step further includes:
  • the service information in the cross-domain connection table includes A-end network element, A-end port, Z-end network element, and Z-end port.
  • the preset circuit routing automatic serial connection algorithm in the cross-domain service routing serial connection step further includes:
  • the resource query step query the resource ID in the corresponding table according to the port or time slot 1 in the circuit basic information table;
  • the channel query step query the resource ID of the opposite end in the channel table according to the acquired ID, if not, execute the channel concatenation step; if yes, execute the resource judgment step;
  • Channel serial connection step if successful, execute the resource judgment step after obtaining the peer ID; if it fails, it is judged whether it is the first stage; if it is the first stage, the serial connection fails; if it is not the first stage, the exception handling step is executed;
  • Resource judging step judging whether the resource ID is port or time slot 2, if yes, complete the cross-domain service routing serial connection; if not, execute the exception handling step;
  • Data processing check step query whether there is data according to the resource ID to the topology connection, if not, execute the exception handling step; if so, obtain the resource ID of the opposite port or time slot, and execute the channel query step;
  • the abnormal handling step return to the channel query step to determine whether there are other paths. If there is no other path, execute the resource query step, and record the point in series at the time of the original abnormality.
  • the channel query step further includes:
  • the data processing and checking step includes:
  • the time slot requirements for obtaining the opposite end are consistent with the VC4NO and VC12NO of the time slot data at the local end.
  • the routing information and the A and Z end data of the cross-domain service routing after the concatenation can be stored and converted to the graph database, and the cross-domain service routing collusion is completed based on the graph database traversal algorithm.
  • the information level of circuit information, circuit routing information, channel information, and channel routing information in the entire routing of cross-domain circuits increases exponentially.
  • the collusion method not only requires a lot of maintenance work, but also has complex calculations and efficiency. low. Calculating this information through large database technology and graph database technology can greatly increase the computing speed. It originally took 1 minute to collude with a cross-domain circuit, but only 0.5 seconds after using the new technology.
  • the manually maintained circuits, cross-domain connections, and collected channels and channel routing information of the A and Z end data are stored in the relational database, and then converted to the neo4j graph database to form a relationship such as As shown in FIG. 3A, A to E in the figure represent the numbers of the nodes at the A and Z ends of the circuit, cross-domain connection, channel, and channel routing information, R1 to R7 represent the relationship numbers, and P1 to P10 represent the property numbers.
  • the graph-based database collusion step includes:
  • Each Node saves the first Property and the first Relationship:
  • FIG. 4 it is a full flow chart of a cross-domain service routing and penetration method based on big data.
  • automatic concatenation of cross-domain service routing can be realized, not only Ensuring the accuracy of routing can also reduce the workload of manual maintenance, reduce the time spent on business connection, reduce manpower input, and reduce costs and increase efficiency.
  • the present disclosure provides a big data-based intelligent calculation method for the whole-process routing of cross-domain services.
  • the method is based on big data analysis technology and is simple and easy for operators to produce support personnel, monitoring personnel, and business analysts.
  • the method used is an example of aggregation of data/applications in the OSS field; cross-professional and cross-network management aggregation of data and applications, based on big data analysis, graph database and other technologies to achieve accurate identification and efficient reflection of business routing (see the summary for the calculation process) Figure 1).
  • the invention is based on big data analysis to reduce the time spent on data census, reduce manual entry, save manpower and improve data accuracy, help reduce costs and increase efficiency, and have strong practicability.
  • the big data-based cross-domain service whole-process routing and penetration device 200 may include: a cross-domain service routing concatenation module 210 and a graph database-based concatenation module 220. among them:
  • the cross-domain service routing serial connection module 210 is configured to take the circuit basic information table and the cross-domain connection table as input, and realize the cross-domain service routing serial connection according to the preset circuit routing automatic serial connection algorithm;
  • the graph database collusion module 220 Based on the graph database collusion module 220, it is configured to store the routing information and A and Z end data of the cross-domain service routing after concatenation into the database and convert it to the graph database, and complete the cross-domain service routing collusion based on the graph database traversal algorithm.
  • an electronic device capable of implementing the above method is also provided.
  • the electronic device 500 according to this embodiment of the present invention will be described below with reference to FIG. 5.
  • the electronic device 500 shown in FIG. 5 is only an example, and should not bring any limitation to the function and application scope of the embodiment of the present invention.
  • the electronic device 500 is represented in the form of a general-purpose computing device.
  • the components of the electronic device 500 may include, but are not limited to: the aforementioned at least one processing unit 510, the aforementioned at least one storage unit 520, a bus 550 connecting different system components (including the storage unit 520 and the processing unit 510), and a display unit 540.
  • the storage unit stores program code, and the program code can be executed by the processing unit 510, so that the processing unit 510 executes the various exemplary methods described in the "Exemplary Method" section of this specification. Example steps.
  • the processing unit 510 may perform step S110 to step S120 as shown in FIG. 1.
  • the storage unit 520 may include a readable medium in the form of a volatile storage unit, such as a random access storage unit (RAM) 5201 and/or a cache storage unit 5202, and may further include a read-only storage unit (ROM) 5203.
  • RAM random access storage unit
  • ROM read-only storage unit
  • the storage unit 520 may also include a program/utility tool 5204 having a set of (at least one) program module 5203.
  • program module 5203 includes but is not limited to: an operating system, one or more application programs, other program modules, and program data. Each of these examples or some combination may include the implementation of a network environment.
  • the bus 530 may represent one or more of several types of bus structures, including a storage unit bus or a storage unit controller, a peripheral bus, a graphics acceleration port, a processing unit, or a local area using any bus structure among multiple bus structures. bus.
  • the electronic device 500 may also communicate with one or more external devices 570 (such as keyboards, pointing devices, Bluetooth devices, etc.), and may also communicate with one or more devices that enable a user to interact with the electronic device 500, and/or communicate with Any device (such as a router, modem, etc.) that enables the electronic device 500 to communicate with one or more other computing devices. Such communication can be performed through an input/output (I/O) interface 550.
  • the electronic device 500 may also communicate with one or more networks (for example, a local area network (LAN), a wide area network (WAN), and/or a public network, such as the Internet) through the network adapter 560.
  • networks for example, a local area network (LAN), a wide area network (WAN), and/or a public network, such as the Internet
  • the network adapter 560 communicates with other modules of the electronic device 500 through the bus 550. It should be understood that although not shown in the figure, other hardware and/or software modules can be used in conjunction with the electronic device 500, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives And data backup storage system, etc.
  • the exemplary embodiments described here can be implemented by software, or can be implemented by combining software with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, U disk, mobile hard disk, etc.) or on the network , Including several instructions to make a computing device (which may be a personal computer, a server, a terminal device, or a network device, etc.) execute the method according to the embodiment of the present disclosure.
  • a computing device which may be a personal computer, a server, a terminal device, or a network device, etc.
  • a computer-readable storage medium is also provided, on which a program product capable of implementing the above method of this specification is stored.
  • various aspects of the present invention may also be implemented in the form of a program product, which includes program code, and when the program product runs on a terminal device, the program code is used to enable the The terminal device executes the steps according to various exemplary embodiments of the present invention described in the above-mentioned "Exemplary Method" section of this specification.
  • a program product 600 for implementing the above method according to an embodiment of the present invention is described. It can adopt a portable compact disk read-only memory (CD-ROM) and include program code, and can be installed in a terminal device, For example, running on a personal computer.
  • the program product of the present invention is not limited to this.
  • the readable storage medium can be any tangible medium that contains or stores a program, and the program can be used by or combined with an instruction execution system, device, or device.
  • the program product can use any combination of one or more readable media.
  • the readable medium may be a readable signal medium or a readable storage medium.
  • the readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device, or device, or a combination of any of the above. More specific examples (non-exhaustive list) of readable storage media include: electrical connections with one or more wires, portable disks, hard disks, random access memory (RAM), read-only memory (ROM), erasable Type programmable read only memory (EPROM or flash memory), optical fiber, portable compact disk read only memory (CD-ROM), optical storage device, magnetic storage device, or any suitable combination of the above.
  • the computer-readable signal medium may include a data signal propagated in baseband or as a part of a carrier wave, and readable program code is carried therein. This propagated data signal can take many forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing.
  • the readable signal medium may also be any readable medium other than a readable storage medium, and the readable medium may send, propagate, or transmit a program for use by or in combination with the instruction execution system, apparatus, or device.
  • the program code contained on the readable medium can be transmitted by any suitable medium, including but not limited to wireless, wired, optical cable, RF, etc., or any suitable combination of the above.
  • the program code used to perform the operations of the present invention can be written in any combination of one or more programming languages.
  • the programming languages include object-oriented programming languages—such as Java, C++, etc., as well as conventional procedural styles. Programming language-such as "C" language or similar programming language.
  • the program code can be executed entirely on the user's computing device, partly on the user's device, executed as an independent software package, partly on the user's computing device and partly executed on the remote computing device, or entirely on the remote computing device or server Executed on.
  • the remote computing device can be connected to a user computing device through any kind of network, including a local area network (LAN) or a wide area network (WAN), or it can be connected to an external computing device (for example, using Internet service providers). Business to connect via the Internet).
  • LAN local area network
  • WAN wide area network
  • Internet service providers for example, using Internet service providers.

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Computational Linguistics (AREA)
  • Software Systems (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

La présente invention concerne un procédé et un appareil de routage et de pénétration de processus entier de service inter-domaine basés sur les mégadonnées, un dispositif électronique, et un support de stockage. Le procédé comprend : une étape de concaténation de routage de service inter-domaine, à laquelle une table d'informations de circuit de base et une table de connexion inter-domaine sont utilisées comme entrée, et une concaténation de routage de service inter-domaine est réalisée selon un algorithme de concaténation automatique de routage de circuit prédéfini ; et une étape de collusion basée sur une base de données de graphes, à laquelle des informations de routage et des données d'extrémités A et Z de routage de service inter-domaine après accomplissement de la concaténation sont stockées dans une base de données et celle-ci est convertie en une base de données de graphes, et une collusion de routage de service inter-domaine est accomplie sur la base d'un algorithme de parcours de base de données de graphes. La présente invention réduit le temps passé pour un recensement de données sur la base d'une analyse de mégadonnées, réduit l'entrée manuelle, économise de la main-d'œuvre et améliore la précision des données, ce qui est utile pour réduire les coûts, augmenter l'efficacité et améliorer l'aptitude à la mise en œuvre.
PCT/CN2020/101814 2019-09-27 2020-07-14 Procédé et appareil de routage et de pénétration de processus entier inter-domaine basés sur les mégadonnées WO2021057198A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201910921000.8 2019-09-27
CN201910921000.8A CN110688538B (zh) 2019-09-27 2019-09-27 基于大数据的跨域业务全程路由贯穿方法以及装置

Publications (1)

Publication Number Publication Date
WO2021057198A1 true WO2021057198A1 (fr) 2021-04-01

Family

ID=69110499

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/101814 WO2021057198A1 (fr) 2019-09-27 2020-07-14 Procédé et appareil de routage et de pénétration de processus entier inter-domaine basés sur les mégadonnées

Country Status (2)

Country Link
CN (1) CN110688538B (fr)
WO (1) WO2021057198A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114006883A (zh) * 2021-10-15 2022-02-01 南京三眼精灵信息技术有限公司 一种跨网数据穿透交互的方法、装置、设备及存储介质
CN116566805A (zh) * 2023-07-10 2023-08-08 中国人民解放军国防科技大学 一种面向体系容灾抗毁的节点跨域调度方法、装置

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110688538B (zh) * 2019-09-27 2022-04-26 北京市天元网络技术股份有限公司 基于大数据的跨域业务全程路由贯穿方法以及装置
CN114070746B (zh) * 2021-10-28 2024-01-05 北京市天元网络技术股份有限公司 一种用于多类型传输网络的电路串接方法及系统
CN116095870B (zh) * 2021-11-04 2024-08-27 中国电信股份有限公司 Pon网络与5g网络数据流量迁转的实现方法、装置及系统
CN116016311A (zh) * 2022-12-26 2023-04-25 浪潮通信信息系统有限公司 一种电路路由分析串接核查的实现方法及系统

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9270701B1 (en) * 2012-04-27 2016-02-23 Stc.Unm System and methods for usage management in multi-level security networks
CN106936706A (zh) * 2015-12-29 2017-07-07 中国电信股份有限公司 路由建立方法和系统及子域控制器、主控制器
CN107579855A (zh) * 2017-09-21 2018-01-12 桂林电子科技大学 一种基于图数据库的分层多域可视安全运维方法
CN105049222B (zh) * 2015-04-20 2018-12-18 中国电信股份有限公司 用于实现传输网络跨域管理的方法、装置和系统
CN110688538A (zh) * 2019-09-27 2020-01-14 北京市天元网络技术股份有限公司 基于大数据的跨域业务全程路由贯穿方法以及装置

Family Cites Families (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7634582B2 (en) * 2003-12-19 2009-12-15 Intel Corporation Method and architecture for optical networking between server and storage area networks
CN101247267B (zh) * 2008-03-19 2010-09-29 中兴通讯股份有限公司 网管系统中三层虚拟专用网络拓扑自动发现的方法及装置
CN101309173B (zh) * 2008-07-16 2010-12-22 北京直真节点技术开发有限公司 传输网业务电路路由自动串接方法及数据核查系统
US9307004B1 (en) * 2012-03-28 2016-04-05 Amazon Technologies, Inc. Prioritized content transmission
US9912577B2 (en) * 2014-04-17 2018-03-06 Cisco Technology, Inc. Segment routing—egress peer engineering (SP-EPE)
CN205545255U (zh) * 2016-02-04 2016-08-31 国家电网公司 电力跨域通信传输电路端到端路由监测系统
US20180006897A1 (en) * 2016-06-30 2018-01-04 At&T Intellectual Property I, L.P. Systems and methods for modeling networks
CN106453097B (zh) * 2016-11-15 2019-04-30 中国科学院计算技术研究所 一种数据中心内获取路由表的方法及系统

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US9270701B1 (en) * 2012-04-27 2016-02-23 Stc.Unm System and methods for usage management in multi-level security networks
CN105049222B (zh) * 2015-04-20 2018-12-18 中国电信股份有限公司 用于实现传输网络跨域管理的方法、装置和系统
CN106936706A (zh) * 2015-12-29 2017-07-07 中国电信股份有限公司 路由建立方法和系统及子域控制器、主控制器
CN107579855A (zh) * 2017-09-21 2018-01-12 桂林电子科技大学 一种基于图数据库的分层多域可视安全运维方法
CN110688538A (zh) * 2019-09-27 2020-01-14 北京市天元网络技术股份有限公司 基于大数据的跨域业务全程路由贯穿方法以及装置

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114006883A (zh) * 2021-10-15 2022-02-01 南京三眼精灵信息技术有限公司 一种跨网数据穿透交互的方法、装置、设备及存储介质
CN114006883B (zh) * 2021-10-15 2023-06-27 南京三眼精灵信息技术有限公司 一种跨网数据穿透交互的方法、装置、设备及存储介质
CN116566805A (zh) * 2023-07-10 2023-08-08 中国人民解放军国防科技大学 一种面向体系容灾抗毁的节点跨域调度方法、装置
CN116566805B (zh) * 2023-07-10 2023-09-26 中国人民解放军国防科技大学 一种面向体系容灾抗毁的节点跨域调度方法、装置

Also Published As

Publication number Publication date
CN110688538A (zh) 2020-01-14
CN110688538B (zh) 2022-04-26

Similar Documents

Publication Publication Date Title
WO2021057198A1 (fr) Procédé et appareil de routage et de pénétration de processus entier inter-domaine basés sur les mégadonnées
WO2021218021A1 (fr) Procédé, appareil et dispositif d'analyse de liens du sang basée sur des données, et support d'enregistrement lisible par ordinateur
US8730819B2 (en) Flexible network measurement
CN102938708B (zh) 基于告警传播模式的告警相关性分析系统及其分析方法
CN109150640A (zh) 一种基于二层网络协议的网络拓扑发现方法及系统
CN112235130A (zh) 一种实现基于sdn网络的运维自动化的方法和装置
WO2019001312A1 (fr) Procédé et appareil de réalisation d'association d'alarme, et support d'informations lisible par ordinateur
CN102136949A (zh) 一种基于网络和时间的告警相关性分析方法及系统
WO2023071761A1 (fr) Procédé et dispositif de localisation d'anomalie
CN113642300A (zh) 一种报表生成方法、装置、电子设备及计算机可读介质
CN112507730A (zh) 信息通信网络的意图转译方法、系统、介质及交互接口
WO2024140058A1 (fr) Procédé et appareil de détermination de cycle de vie de table de données, dispositif électronique et support de stockage
EP3467656A1 (fr) Système de guidage pour changement d'infrastructure d'entreprise
CN112988915A (zh) 数据展示方法和装置
WO2024021581A1 (fr) Procédé et système d'interrogation de métrique, dispositif électronique et support de stockage
US11838171B2 (en) Proactive network application problem log analyzer
WO2011131078A1 (fr) Procédé et système de gestion de données pour un système de gestion d'instrument de bus de terrain
WO2024016594A1 (fr) Procédé et appareil de mise en œuvre de pseudo-colonne, dispositif électronique et support d'enregistrement
US20220398282A1 (en) Systems and methods for multi-vendor storage infrastructure in a dashboard
Zhao et al. Design and Implement of AIOps System Based on Knowledge Graph
CN115604343A (zh) 一种数据传输方法、系统、电子设备和存储介质
CN112287495B (zh) 配电网网架的分段合理性判断方法、装置及系统
CN113849549A (zh) 一种数据加载方法、装置、设备和介质
US20170337644A1 (en) Data driven invocation of realtime wind market forecasting analytics
CN105634831A (zh) 通信设备中一种定位源的智能翻译系统及方法

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20869341

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20869341

Country of ref document: EP

Kind code of ref document: A1