CNIPA.AI
返回搜索
档案

Service Dependencies Based On Relationship Network Graph

发明专利审中
3浏览
20权利要求 · 3 独立
§ Ⅰ

卷宗概要

IPC 分类

H4L 41/604H4L 41/631

CPC 分类

H4L41/613H4L41/65

A relationship network graph is constructed, where nodes represent entities and edges represent interactions between the entities, and wherein at least some of the entities represent respective persons, teams, or organizations of people. A dependency strength is determined from the relationship network graph between a first service associated with a first entity and a second service associated with a second entity. A first alert associated with the first service is received. In response to the first alert, and based on the dependency strength meeting a predefined threshold, a second alert associated with the second service is paused for a predefined pause period. It is determined whether the first alert remains unresolved after expiration of the pause period. If the first alert remains unresolved, the second alert is resumed.

原文(中文)

A relationship network graph is constructed, where nodes represent entities and edges represent interactions between the entities, and wherein at least some of the entities represent respective persons, teams, or organizations of people. A dependency strength is determined from the relationship network graph between a first service associated with a first entity and a second service associated with a second entity. A first alert associated with the first service is received. In response to the first alert, and based on the dependency strength meeting a predefined threshold, a second alert associated with the second service is paused for a predefined pause period. It is determined whether the first alert remains unresolved after expiration of the pause period. If the first alert remains unresolved, the second alert is resumed.