会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明申请
    • Implementing OSPF in Split-Architecture Networks
    • 在分布式架构网络中实现OSPF
    • US20130039214A1
    • 2013-02-14
    • US13208251
    • 2011-08-11
    • Kiran YedavalliNeda Beheshti-ZavarehYing Zhang
    • Kiran YedavalliNeda Beheshti-ZavarehYing Zhang
    • H04L12/28
    • H04L45/12H04L45/025H04L45/026H04L45/64
    • A method is implemented in a network element that functions as one of a plurality of controllers for one of a plurality of areas of a split architecture network. The controller provides a control plane for the area of the split architecture network where the controller is remote from a plurality of switches providing a data plane for the area of split architecture network. The controller facilitates optimized routing across the plurality of areas of the split architecture network by providing limited intra-area link cost data to other controllers of other areas of the split architecture network and to traditional routers of a network including the split architecture network. The limited intra-area link cost data provides costs of each possible shortest path traversal of the area of the controller without providing all internal link cost data.
    • 一种在分离架构网络的多个区域中的一个区域的多个控制器之一中起作用的网络元件中实现一种方法。 控制器为分离式架构网络的区域提供控制平面,其中控制器远离多个交换机,为分割架构网络的区域提供数据平面。 控制器通过向分裂架构网络的其他区域的其他控制器和包括分离架构网络的网络的传统路由器提供有限的区域内链路成本数据来促进跨分离架构网络的多个区域的优化路由。 有限的区域内链路成本数据提供控制器区域中每个可能的最短路径遍历的成本,而不提供所有内部链路成本数据。
    • 9. 发明申请
    • Congestion Control and Resource Allocation in Split Architecture Networks
    • 分拆架构网络中的拥塞控制和资源分配
    • US20130258847A1
    • 2013-10-03
    • US13438631
    • 2012-04-03
    • Ying ZhangNeda Beheshti-Zavareh
    • Ying ZhangNeda Beheshti-Zavareh
    • H04L12/24
    • H04L47/22H04L41/5025H04L43/0835H04L43/0882H04L47/41H04L47/822Y02D50/30
    • A controller performs network-wide congestion control in a split architecture network. The controller receives flow statistics from switches for each entity that communicates via the network. The controller chooses a most congested link as a bottleneck link based on a packet loss rate that is derived from the flow statistics and estimated for each entity on each link of the network. The controller identifies a target path in the network that passes through the bottleneck link and carries the most traffic, and calculates a throttling probability for each sharing entity that shares the target path based on the capacity of the bottleneck link, capacity of the first link of the target path, bandwidth consumption and packet loss rate of each sharing entity. The controller then transmits the throttling probability of each sharing entity to the ingress switch of the target path to reduce the congestion on the bottleneck link.
    • 控制器在分离式架构网络中执行全网络拥塞控制。 控制器从交换机接收通过网络进行通信的每个实体的流量统计信息。 控制器基于从流量统计导出并针对网络的每个链路上的每个实体估计的分组丢失率,选择最拥挤的链路作为瓶颈链路。 控制器识别网络中通过瓶颈链路并承载最多流量的目标路径,并且基于瓶颈链路的容量计算共享目标路径的每个共享实体的节流概率,第一链路的容量 每个共享实体的目标路径,带宽消耗和丢包率。 然后,控制器将每个共享实体的节流概率发送到目标路径的入口交换机,以减少瓶颈链路上的拥塞。