会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 15. 发明申请
    • MULTIPATH DISCOVERY IN SWITCHED ETHERNET NETWORKS
    • 开关以太网网络中的多路径发现
    • US20110032825A1
    • 2011-02-10
    • US12537677
    • 2009-08-07
    • Cyriel MinkenbergMircea R. Gusat
    • Cyriel MinkenbergMircea R. Gusat
    • H04L12/24H04L12/56
    • H04L49/3009H04L45/66
    • A network switch device receives a communication packet having a source MAC address s and a destination MAC address d at a switch port p. Then, the network switch device determines whether a valid routing table entry (s, p) exists, there by indicating that the source MAC address s is reachable via a switch port p. The network switch device further determines for the destination MAC address d whether there is at least one switch port q for which a valid routing table entry (d, q) exists, there by indicating that d is reachable via a switch port q. When the routing table entries (s, p) and (d, q) exist, the network switch device routes the communication packet to the switch port q.
    • 网络交换设备在交换机端口p接收具有源MAC地址s和目的地MAC地址d的通信分组。 然后,网络交换机设备确定是否存在有效的路由表条目(s,p),通过指示源MAC地址s可通过交换机端口p到达。 网络交换设备还确定目的地MAC地址d是否存在至少一个交换机端口q,对于该交换机端口q存在有效的路由表条目(d,q),通过指示经由交换机端口q可达d。 当路由表条目(s,p)和(d,q)存在时,网络交换机设备将通信包路由到交换机端口q。
    • 18. 发明申请
    • Method of switching fabric for counteracting a saturation tree occurring in a network with nodes
    • 用于抵消在具有节点的网络中发生的饱和树的交换结构的方法
    • US20080273465A1
    • 2008-11-06
    • US12167580
    • 2008-07-03
    • Mircea GusatMarc VerhappenCyriel MinkenbergJose Dusto
    • Mircea GusatMarc VerhappenCyriel MinkenbergJose Dusto
    • H04L12/56
    • H04L45/00
    • The invention relates to a method and a switching fabric for counteracting a saturation tree occurring in a network with nodes. The method comprises the steps of generating at a local node where a congestion emerges a first congestion information; sending the first congestion information to at least one upstream node; responsive to one received first congestion information comparing the content of the received first congestion information with a pre-sent local status based on a set of predefined rules in order to identify at least one packet stream causing the congestion, and generating a second congestion information comprising the identified at least one packet stream causing the congestion; and sending the second congestion information to at least one further upstream node from where the identified at least one packet stream was received.
    • 本发明涉及一种用于抵消在具有节点的网络中发生的饱和树的方法和交换结构。 该方法包括以下步骤:在拥塞出现第一拥塞信息的本地节点处产生; 向所述至少一个上游节点发送所述第一拥塞信息; 响应于一个接收的第一拥塞信息,基于一组预定义规则,将接收的第一拥塞信息的内容与预发送的本地状态进行比较,以便识别导致拥塞的至少一个分组流,并且生成第二拥塞信息,包括 识别的至少一个引起拥塞的分组流; 以及将所述第二拥塞信息发送到从所述所识别的至少一个分组流被接收的至少一个另外的上游节点。