首页> 外国专利> BINARY SEARCH-BASED APPROACH IN ROUTING-METRIC AGNOSTIC TOPOLOGIES FOR NODE SELECTION TO ENABLE EFFECTIVE LEARNING MACHINE MECHANISMS

BINARY SEARCH-BASED APPROACH IN ROUTING-METRIC AGNOSTIC TOPOLOGIES FOR NODE SELECTION TO ENABLE EFFECTIVE LEARNING MACHINE MECHANISMS

机译:路由选择度量拓扑拓扑中基于二分搜索的方法,以选择有效的学习机机制的节点

摘要

In one embodiment, nodes are polled in a network for Quality of Service (QoS) measurements, and a QoS anomaly that affects a plurality of potentially faulty nodes is detected based on the QoS measurements. A path, which traverses the plurality of potentially faulty nodes, is then computed from a first endpoint to a second endpoint. Also, a median node that is located at a point along the path between the first endpoint and the second endpoint is computed. Time-stamped packets are received from the median node, and the first endpoint and the second endpoint of the path are updated based on the received time-stamped packets, such that an amount of potentially faulty nodes is reduced. Then, the faulty node is identified from a reduced amount of potentially faulty nodes.
机译:在一个实施例中,在网络中轮询节点以进行服务质量(QoS)测量,并且基于QoS测量来检测影响多个潜在故障节点的QoS异常。然后计算从第一端点到第二端点的遍历多个潜在故障节点的路径。另外,计算位于沿着第一端点和第二端点之间的路径的点处的中值节点。从中间节点接收带有时间戳的分组,并且基于所接收的带有时间戳的分组来更新路径的第一端点和第二端点,从而减少了潜在故障节点的数量。然后,从数量减少的潜在故障节点中识别出故障节点。

著录项

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号