首页> 外国专利> HEURISTICS-BASED ROUTING OF A QUERY MESSAGE IN PEER TO PEER NETWORKS

HEURISTICS-BASED ROUTING OF A QUERY MESSAGE IN PEER TO PEER NETWORKS

机译:对等网络中基于启发式的查询消息路由

摘要

The present invention is directed to a system and method for administering Peer to Peer (P2P) query messages within a P2P network. The present invention collects a plurality of metrics for each host that it is aware of in a P2P network, most often by a host information or query hit message. The metrics collected aid in determining a set of P2P hosts best able to fulfill a query message, without having knowledge of specific content. The metrics collected also aid in managing query messages in that they determine when to drop query messages or when to resend query messages.
机译:本发明针对一种用于在P2P网络内管理对等(P2P)查询消息的系统和方法。本发明最通常通过主机信息或查询命中消息来为在P2P网络中知道的每个主机收集多个度量。收集的指标有助于确定一组最能满足查询消息而又不了解特定内容的P2P主机。收集的度量还可以确定何时丢弃查询消息或何时重新发送查询消息,从而有助于管理查询消息。

著录项

  • 公开/公告号EP1530859B1

    专利类型

  • 公开/公告日2014-03-12

    原文格式PDF

  • 申请/专利权人 SANDVINE INC ULC;

    申请/专利号EP20030727078

  • 发明设计人 LOACH SCOT;BOWMAN DON;

    申请日2003-05-29

  • 分类号H04L29/06;G06F17/30;

  • 国家 EP

  • 入库时间 2022-08-21 15:51:56

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号