会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 8. 发明申请
    • SYSTEM AND METHODS FOR NETWORK PATH DETECTION
    • 用于网络路径检测的系统和方法
    • WO2006083872A2
    • 2006-08-10
    • PCT/US2006/003407
    • 2006-01-31
    • CISCO TECHNOLOGY, INC.PREVIDI, StefanoGUICHARD, James N.VASSEUR, Jean-PhilippeWARD, David D.
    • PREVIDI, StefanoGUICHARD, James N.VASSEUR, Jean-PhilippeWARD, David D.
    • H04L12/56H04L12/28
    • H04L45/026H04L43/0811H04L45/26H04L45/28H04L63/0272
    • Customer edge (CE) to CE device verification checks initiate routes from available CEs as a set of path verification messages, destined for remote CE routes serving a remote VPN. An extended community attribute, included among the attributes of the path verification message, stores the identity of the originating CE router. The path verification message propagates across the network, and transports the identity of the originating CE router because the originator identity is not overwritten by successive routing. Upon receipt by the remote CE, the originator is determinable from the extended community attribute. A further reachability field is also included in the extended community attribute and indicates whether per CE or per prefix is appropriate for the particular route in question. In this manner, CE-CE connectivity checks identify CEs which are reachable from other CEs. Accordingly, such a mechanism allows for route reachability aggregation on a per-CE or per prefix reachability basis.
    • 客户端(CE)到CE设备验证检查从可用的CE启动路由作为一组路径验证消息,目的地是服务于远程VPN的远程CE路由。 包含在路径验证消息的属性之间的扩展团体属性存储始发CE路由器的身份。 路径验证消息通过网络传播,并传输始发CE路由器的身份,因为始发方身份不会被连续路由覆盖。 远程CE收到后,发起者可以从扩展团体属性中确定。 扩展社区属性中还包括另外的可访问性字段,并指示每个CE或每个前缀是否适合所讨论的特定路由。 以这种方式,CE-CE连接检查可以识别可从其他CE接入的CE。 因此,这种机制允许在每个CE或每个前缀可达性的基础上进行路由可达性聚合。
    • 10. 发明申请
    • REDUCED TOPOLOGY ROUTING IN SHARED MEDIA COMMUNICATION NETWORKS
    • 在共享媒体通信网络中减少拓扑路由
    • WO2013016630A1
    • 2013-01-31
    • PCT/US2012/048530
    • 2012-07-27
    • CISCO TECHNOLOGY, INC.VASSEUR, Jean-philippeHUI, Jonathan, W.
    • VASSEUR, Jean-philippeHUI, Jonathan, W.
    • H04L12/56
    • H04W40/22H04L45/123H04L45/48H04W40/30Y02D70/142Y02D70/144Y02D70/22Y02D70/39
    • In one embodiment, a particular node in a shared communication network determines a current path cost in a routing topology from itself to a root node via a current parent node. The particular node also determines a respective path cost from each reachable potential parent node of the particular node to the root node via each potential parent and a respective link metric to each potential parent node. A set of acceptable parent nodes are determined from the potential parent nodes that have a respective path cost that is less than the current path cost plus an acceptable cost increase, and also have a respective link metric that is within an acceptable range. By determining a respective number of child nodes for each acceptable parent node, the particular node may then select a new parent node based on giving preference to those having a greater respective number of child nodes.
    • 在一个实施例中,共享通信网络中的特定节点通过当前父节点来确定从自身到根节点的路由拓扑中的当前路径开销。 特定节点还通过每个潜在父节点以及针对每个潜在父节点的相应链路度量来确定从特定节点的每个可达到的潜在父节点到根节点的相应路径开销。 从具有小于当前路径成本加上可接受的成本增加的相应路径成本的潜在父节点确定一组可接受的父节点,并且还具有处于可接受范围内的相应链路度量。 通过为每个可接受的父节点确定相应数目的子节点,则特定节点可以基于给予具有更大相应数量的子节点的那些优先选择新的父节点。