-
公开(公告)号：US08792497B2
公开(公告)日：2014-07-29
申请号：US11605829
申请日：2006-11-29
IPC分类号： H04L12/28
CPC分类号： H04L45/245 , H04L45/38 , H04L45/72 , H04L45/741 , H04L45/745 , H04L45/7457 , H04L47/2483 , H04L49/3009 , H04L49/35 , H04L49/351 , H04L2012/5624 , Y02D50/30
摘要： A network node or corresponding method of performing link aggregation reduces a number of Content Addressable Memory (CAM) entries required to make a forwarding decision for a given ingress flow, reducing cost, size, and power consumption of the CAM and accompanying static RAM. In one embodiment, an ingress flow is mapped to an egress flow identifier. Subsequently, the egress flow identifier is mapped to a member of an aggregated group associated with an egress interface based on information available in a given ingress flow. Finally, the given ingress flow is forwarded to the member of the aggregated group associated with the egress interface. A hashing technique or two lookups may be used alone or in combination in mapping the ingress flow to the egress flow identifier to reduce CAM memory usage.
摘要翻译： 执行链路聚合的网络节点或相应方法减少了为给定入口流量做出转发决定所需的多个内容可寻址存储器（CAM）条目，从而降低了CAM和附带的静态RAM的成本，尺寸和功耗。 在一个实施例中，入口流被映射到出口流标识符。 随后，基于给定入口流中可用的信息，将出口流标识符映射到与出口接口相关联的聚合组的成员。 最后，将给定的入口流转发到与出口接口相关联的聚合组的成员。 散列技术或两个查找可以单独使用或组合使用，以将入口流映射到出口流标识符以减少CAM存储器使用。
-
公开(公告)号：US20070280258A1
公开(公告)日：2007-12-06
申请号：US11605829
申请日：2006-11-29
IPC分类号： H04L12/56
CPC分类号： H04L45/245 , H04L45/38 , H04L45/72 , H04L45/741 , H04L45/745 , H04L45/7457 , H04L47/2483 , H04L49/3009 , H04L49/35 , H04L49/351 , H04L2012/5624 , Y02D50/30
摘要： A network node or corresponding method of performing link aggregation reduces a number of Content Addressable Memory (CAM) entries required to make a forwarding decision for a given ingress flow, reducing cost, size, and power consumption of the CAM and accompanying static RAM. In one embodiment, an ingress flow is mapped to an egress flow identifier. Subsequently, the egress flow identifier is mapped to a member of an aggregated group associated with an egress interface based on information available in a given ingress flow. Finally, the given ingress flow is forwarded to the member of the aggregated group associated with the egress interface. A hashing technique or two lookups may be used alone or in combination in mapping the ingress flow to the egress flow identifier to reduce CAM memory usage.
摘要翻译： 执行链路聚合的网络节点或相应方法减少了为给定入口流量做出转发决定所需的多个内容可寻址存储器（CAM）条目，从而降低了CAM和附带的静态RAM的成本，尺寸和功耗。 在一个实施例中，入口流被映射到出口流标识符。 随后，基于给定入口流中可用的信息，将出口流标识符映射到与出口接口相关联的聚合组的成员。 最后，将给定的入口流转发到与出口接口相关联的聚合组的成员。 散列技术或两个查找可以单独使用或组合使用，以将入口流映射到出口流标识符以减少CAM存储器使用。
-
公开(公告)号：US08223642B2
公开(公告)日：2012-07-17
申请号：US11413409
申请日：2006-04-28
申请人： David S. Curry , Robert J. Colvin , Samer I. Nubani , Ravindra Sunkad , Man-Tung T. Hsiao , Paul M. Hallinan , Rishi Mehta , Sanjay Khanna
发明人： David S. Curry , Robert J. Colvin , Samer I. Nubani , Ravindra Sunkad , Man-Tung T. Hsiao , Paul M. Hallinan , Rishi Mehta , Sanjay Khanna
IPC分类号： H04L12/56
CPC分类号： H04L47/624 , H04L47/10 , H04L47/2408 , H04L47/2441 , H04L47/31 , H04L47/60 , H04L47/621 , H04L49/90
摘要： Differentiated services for network traffic using weighted quality of service is provided. Network traffic is queued into separate per flow queues, and traffic is scheduled from the per flow queues into a group queue. Congestion management is performed on traffic in the group queue. Traffic is marked with priority values, and congestion management is performed based on the priority values. For example, traffic can be marked as “in contract” if it is within a contractual limit, and marked as “out of contract” if it is not within the contractual limit. Marking can also include classifying incoming traffic based on Differentiated Service Code Point. Higher priority traffic can be scheduled from the per flow queues in a strict priority over lower priority traffic. The lower priority traffic can be scheduled in a round robin manner.
摘要翻译： 提供了使用加权质量服务的网络流量差异化服务。 网络流量排队到每个流队列中，流量从每个流队列调度到组队列中。 对组队列中的流量执行拥塞管理。 流量被标记为优先级值，并根据优先级值进行拥塞管理。 例如，如果交易在契约限制范围内，则可以将其标记为“合同”，如果不在合同限制范围内，则标记为“合同”。 标记还可以包括基于差分服务代码点对传入流量进行分类。 可以将优先级较高的流量从严格优先级的每个流队列调度为优先级较低的流量。 较低优先级的流量可以轮循方式进行调度。
-
4.发明申请公开(公告)号：US20070233887A1
公开(公告)日：2007-10-04
申请号：US11488464
申请日：2006-07-17
IPC分类号： G06F15/16
摘要： A method or apparatus in an exemplary embodiment supports first and second layer network nodes that may be configured to communicate with each other via a communications path. In embodiments a first network node communicates via a second network node across a layer 2 network to send data. The first network node is typically on a different link layer protocol than the second network node receiving the data. Thus, the first and second layer network nodes, having different link layer protocols, may communicate with each other. Accordingly, through use of embodiments of this invention, Neighbor Discovery (ND) is possible in a network, such as an IPv6 network, that has protocols incompatible with each other.
摘要翻译： 示例性实施例中的方法或装置支持可被配置为经由通信路径相互通信的第一和第二层网络节点。 在实施例中，第一网络节点通过第二网络节点通过第2层网络进行通信以发送数据。 第一网络节点通常在与接收数据的第二网络节点不同的链路层协议上。 因此，具有不同链路层协议的第一和第二层网络节点可以彼此通信。 因此，通过使用本发明的实施例，邻居发现（ND）在诸如IPv6网络的网络中是可能的，其具有彼此不兼容的协议。
-
5.发明授权公开(公告)号：US07673061B2
公开(公告)日：2010-03-02
申请号：US11488464
申请日：2006-07-17
IPC分类号： G06F15/16
摘要： A method or apparatus in an exemplary embodiment supports first and second layer network nodes that may be configured to communicate with each other via a communications path. In embodiments a first network node communicates via a second network node across a layer 2 network to send data. The first network node is typically on a different link layer protocol than the second network node receiving the data. Thus, the first and second layer network nodes, having different link layer protocols, may communicate with each other. Accordingly, through use of embodiments of this invention, Neighbor Discovery (ND) is possible in a network, such as an IPv6 network, that has protocols incompatible with each other.
摘要翻译： 示例性实施例中的方法或装置支持可被配置为经由通信路径相互通信的第一和第二层网络节点。 在实施例中，第一网络节点通过第二网络节点通过第2层网络进行通信以发送数据。 第一网络节点通常在与接收数据的第二网络节点不同的链路层协议上。 因此，具有不同链路层协议的第一和第二层网络节点可以彼此通信。 因此，通过使用本发明的实施例，邻居发现（ND）在诸如IPv6网络的网络中是可能的，其具有彼此不兼容的协议。
-
-
-
-
搜索结果
5 条记录 (耗时 0.025 秒)
