首页> 外国专利> Techniques for efficiently updating routing information upon shortest path tree computation

Techniques for efficiently updating routing information upon shortest path tree computation

机译:在最短路径树计算时有效更新路由信息的技术

摘要

Techniques for efficiently updating routing information in a network device such as a router. According to an embodiment of the present invention, information is stored identifying one or more nodes and leaves owned or advertised by the nodes. When a change occurs in a network environment, information is stored identifying one or more nodes and leaves that have changes associated with them. The routing information in the network device is then updated for only those nodes and leaves that have changes associated with them.
机译:用于有效地更新网络设备(例如路由器)中的路由信息​​的技术。根据本发明的实施例,信息被存储以标识一个或多个节点以及由节点拥有或广告的叶子。当网络环境中发生更改时,将存储标识一个或多个节点以及与之关联的更改的叶子的信息。然后仅针对那些具有与其关联的更改的节点和叶子更新网络设备中的路由信息​​。

著录项

  • 公开/公告号US9106512B2

    专利类型

  • 公开/公告日2015-08-11

    原文格式PDF

  • 申请/专利权人 BROCADE COMMUNICATIONS SYSTEMS INC.;

    申请/专利号US201314057680

  • 发明设计人 VAMSI PUNATI;HASNAIN KARAMPURWALA;

    申请日2013-10-18

  • 分类号H04L12/28;H04L12/751;H04L12/753;H04L12/721;

  • 国家 US

  • 入库时间 2022-08-21 15:22:50

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号