会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Methods and devices for relieving congestion in hop-by-hop routed packet networks
    • 用于缓解逐跳路由分组网络拥塞的方法和设备
    • US06831895B1
    • 2004-12-14
    • US09314107
    • 1999-05-19
    • Hongbin JiMuralidharan Sampath KodialamYung-Terng Wang
    • Hongbin JiMuralidharan Sampath KodialamYung-Terng Wang
    • H04J300
    • H04L45/38H04L45/00H04L45/122H04L45/123H04L45/20H04L45/22
    • Congestion across links in a network, such as the Internet, is reduced by diverting traffic from the congested link to alternative, shortest paths by adjusting splitting factors associated with the congested and alternative links. The alternative shortest paths comprise equal cost paths. Alternatively, adjustments occur after the creation of additional equal cost paths/shortest paths if none are initially available within the network. Unique programs control the adjustment of the splitting factors and the creation of the additional shortest paths. The programs make use of both existing, real networks and constructed, virtual networks in conjunction with novel traffic flow relationships to divert traffic from a congested link without causing further congestion within the network. Another unique program deletes shortest paths once used to accept traffic diverted from a congested link when traffic in the network decreases.
    • 通过调整与拥塞和替代链路相关联的分解因子,将流量从拥塞链路转移到备选最短路径,从而减少网络中诸如因特网之间的链路的拥塞。 替代的最短路径包括相等的成本路径。 或者,如果网络中最初没有可用的附加成本路径/最短路径,则在创建额外的等价路径/最短路径之后进行调整。 独特的程序控制分割因子的调整和附加最短路径的创建。 这些程序利用现有的,实际的网络和构建的虚拟网络结合新的业务流量关系来转发来自拥塞的链路的业务,而不会在网络内造成进一步的拥塞。 当网络中的流量减少时,另一个独特的程序会删除一次用于接收从拥塞链路转发的流量的最短路径。
    • 5. 发明授权
    • Fast IP route lookup with configurable processor and compressed routing table
    • 快速IP路由查找与可配置处理器和压缩路由表
    • US06888838B1
    • 2005-05-03
    • US09780895
    • 2001-02-09
    • Hongbin JiRangarajan Srinivasan
    • Hongbin JiRangarajan Srinivasan
    • H04L12/56H04L12/28
    • H04L45/00H04L45/54
    • A novel compression method uses bitmaps to reduce the memory storage requirement of routing table information to about 3 MB. The data structure can be used for both route lookup and update. It does not require a separate data structure to be used for route update. A fast route lookup method is also disclosed. An efficient update method supports incremental route update. Through configuring a processor properly and developing a few customized instructions specifically for route lookup, the system can achieve more than 10 million lookups per second (MLPS) at 200 MHz. Using a configurable processor for route lookup/update provides more flexibility and extensibility which supports different data structures and lookup/update methods to meet application specific needs. The data structure and lookup method can be implemented in pure hardware in a pipelined fashion to achieve approximately 100 MLPS.
    • 一种新颖的压缩方法使用位图将路由表信息的内存存储要求减少到大约3 MB。 数据结构可用于路由查找和更新。 它不需要单独的数据结构来用于路由更新。 还公开了快速路线查找方法。 有效的更新方法支持增量路由更新。 通过正确配置处理器并开发专门用于路由查找的几条定制指令,该系统可以在200 MHz下实现每秒超过1000万次查找(MLPS)。 使用可配置的处理器进行路由查找/更新提供了更多的灵活性和可扩展性,支持不同的数据结构和查找/更新方法,以满足特定的应用需求。 数据结构和查找方法可以以流水线方式在纯硬件中实现,实现大约100MLPS。