会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 1. 发明授权
    • Non-blocking destination-based routing networks
    • 非阻塞目的地路由网络
    • US07898957B2
    • 2011-03-01
    • US11556165
    • 2006-11-02
    • Chin-Tau LeaJian Chu
    • Chin-Tau LeaJian Chu
    • G01R31/08G06F11/00H04L12/26
    • H04L45/123H04L45/04H04L45/24
    • A route computation algorithm, a load-balancing scheme inside a router for making a hop-by-hop routing network (such as the Internet) nonblocking are described in this patent. The output of the route computation algorithm includes a set of link weights that determine the paths of the hop-by-hop routing network. The route computation algorithm and the load-balancing scheme also determine the ingress and egress traffic constraints at each edge router such that as long as the traffic entering and leaving the network does not exceed the constraints, none of the internal links will ever have traversing traffic more than its link capacity. The network is thus non-blocking internally. This greatly simplifies flow admission control and allows hard QoS to be supported inside the network.
    • 在本专利中描述了路由计算算法,路由器内的用于进行逐跳路由网络(例如因特网)非阻塞的负载平衡方案。 路由计算算法的输出包括确定逐跳路由网络的路径的一组链路权重。 路由计算算法和负载平衡方案还确定每个边缘路由器的入口和出口业务约束,使得只要进入和离开网络的流量不超过约束,内部链路就不会有遍历流量 超过其链路容量。 因此,网络内部无阻塞。 这大大简化了流量准入控制,并允许在网络内部支持硬QoS。
    • 2. 发明申请
    • Non-blocking internet backbone network
    • 无阻塞互联网骨干网
    • US20060176809A1
    • 2006-08-10
    • US11243117
    • 2005-10-03
    • Chin-Tau LeaJian Chu
    • Chin-Tau LeaJian Chu
    • H04L12/26H04L1/00H04L12/56H04L12/28G01R31/08
    • H04L47/825H04L47/125H04L47/15H04L47/24H04L47/2425H04L47/70H04L47/808H04L47/822
    • A method and system for computing the maximum amount of admissible ingress and egress traffic of each edge router of the MPLS core network is presented. As long as the ingress and egress traffic amounts are below the admissible amount limit, traffic routes through any link in the network will never exceeds the link capacity. A calculation scheme and a load-distribution scheme make an Internet MPLS backbone network non-blocking. The output of the route computation algorithm includes a set of paths for any source-destination pair and the load distribution ratios among the paths. The routing algorithm and the associated distribution scheme will determine how to balance the loads that meet the distribution requirements specified by the ratios computed from the route algorithm. This greatly simplifies call admission control and allows hard QoS to be supported in a large scale and cross domains in the Internet.
    • 提出了一种用于计算MPLS核心网络每个边缘路由器的允许入口和出口流量的最大数量的方法和系统。 只要入口和出口流量低于允许限额,网络中任何链路的流量路由将永远不会超过链路容量。 计算方案和负载分配方案使得互联网MPLS骨干网不阻塞。 路由计算算法的输出包括用于任何源 - 目的地对的路径和路径之间的负载分配比。 路由算法和相关联的分配方案将确定如何平衡满足由路由算法计算的比率规定的分布要求的负载。 这大大简化了呼叫接纳控制,并允许在互联网上大规模和跨域支持硬QoS。
    • 3. 发明授权
    • Scalable switching system and method
    • 可扩展交换系统和方法
    • US06920135B1
    • 2005-07-19
    • US09768528
    • 2001-01-23
    • Chin-Tau Lea
    • Chin-Tau Lea
    • H04L12/28H04L12/56
    • H04L49/254H04L49/1507
    • Systems and method for switching packets of information between ports are provided. One system comprises a plurality of port processors, a switch fabric and a scheduler. The port processors send packet headers to the scheduler, which resolves contentions between packet headers with the same destination port addresses. The scheduler sends request-grant information to the port processors. The port processors send packets as specified by the request-grant information to the switch fabric. The switch fabric transfers the packets between the port processors according to the destination port addresses of the packets.
    • 提供了在端口之间切换信息包的系统和方法。 一个系统包括多个端口处理器,交换结构和调度器。 端口处理器将分组报头发送到调度程序,这解决了具有相同目标端口地址的数据包报头之间的争用。 调度程序向端口处理器发送请求许可信息。 端口处理器根据请求授权信息指定交换结构发送数据包。 交换结构根据报文的目的端口地址在端口处理器之间传输报文。
    • 4. 发明授权
    • ASA: a scalable optical switch
    • ASA:可扩展光开关
    • US09497517B2
    • 2016-11-15
    • US14530695
    • 2014-11-01
    • Chin-Tau Lea
    • Chin-Tau Lea
    • H04Q11/00H04J14/02
    • H04Q11/0003H04J14/02H04Q11/0005H04Q2011/0024H04Q2011/0032H04Q2011/0039H04Q2011/005H04Q2011/0064
    • A scalable AWGR-based optical switching fabric and its scheduling method are presented. The switching fabric consists of three stages: two stages (first and third) of AWGRs interconnected by a second stage of optical space switches. The optical switching system is named ASA for the technologies used to construct the three stages: AWGR, Space switching, and AWGR. The first stage and third stage portions of the switching fabric comprise up to N N×N AWGRs (N inputs and N outputs) and the middle stage N N×N optical space switches, wherein N is an odd integer. This makes the switch's total port count N2. Each port can transmit up to N packets of different wavelengths simultaneously. Thus the total capacity of the switch is around (N3×bandwidth of one wavelength channel).
    • 介绍了一种可扩展的基于AWGR的光交换结构及其调度方法。 交换结构由三个阶段组成:由第二阶段光学空间交换机互连的两个阶段(第一和第三个)AWGR。 光交换系统被称为ASA,用于构建三个阶段的技术:AWGR,空间切换和AWGR。 交换结构的第一级和第三级部分包括多达N N×N个AWGR(N个输入和N个输出)和中间N N×N个光学空间开关,其中N是奇整数。 这使得交换机的总端口数为N2。 每个端口可以同时传输多达N个不同波长的数据包。 因此,交换机的总容量在(N3×一个波长信道的带宽)左右。
    • 5. 发明申请
    • Packet processor with mild programmability
    • 数据包处理器具有温和的可编程性
    • US20050289326A1
    • 2005-12-29
    • US11158656
    • 2005-06-21
    • Chin-Tau Lea
    • Chin-Tau Lea
    • G06F9/38G06F15/00
    • G06F9/3826G06F9/3824G06F9/3867
    • A reduced instruction set pipelined processor having an instruction fetch stage, an instruction decode stage, an executive stage and a write back stage and programmed with a single program which is structured to implement a function performed by a finite state machine. Only read after write data hazards exist in said processor, and these data hazards are eliminated by a forwarding unit in said executive stage which does an address comparison between the executive and write back stages and decides if a data hazard exists in accordance with predetermined logic. If a data hazard exists, suitable control signals are generated to control switching by multiplexers to supply operands to said ALU from said forwarding unit so as to eliminate said data hazards. Pipeline stall control hazards are reduced by inserting useful delay-slot instructions following at least some branch instructions in said program.
    • 具有指令提取级,指令解码级,执行级和回写级的精简指令集流水线处理器,并且被编程以用于实现由有限状态机执行的功能的单个程序。 只有在所述处理器中存在写入数据危害之后才读取,并且这些数据危害由所述执行阶段中的转发单元消除,执行执行级和回写级之间的地址比较,并且根据预定的逻辑来确定是否存在数据危险。 如果存在数据危害,则生成合适的控制信号以控制多路复用器的切换,以从所述转发单元向所述ALU提供操作数,以消除所述数据危害。 通过在所述程序中的至少一些分支指令之后插入有用的延迟槽指令来减少管道失速控制危险。
    • 7. 发明申请
    • Non-Blocking Destination-Based Routing Networks
    • 非阻塞基于目的的路由网络
    • US20070076615A1
    • 2007-04-05
    • US11556165
    • 2006-11-02
    • Chin-Tau LeaJian Chu
    • Chin-Tau LeaJian Chu
    • H04J3/14
    • H04L45/123H04L45/04H04L45/24
    • A route computation algorithm, a load-balancing scheme inside a router for making a hop-by-hop routing network (such as the Internet) nonblocking are described in this patent. The output of the route computation algorithm includes a set of link weights that determine the paths of the hop-by-hop routing network. The route computation algorithm and the load-balancing scheme also determine the ingress and egress traffic constraints at each edge router such that as long as the traffic entering and leaving the network does not exceed the constraints, none of the internal links will ever have traversing traffic more than its link capacity. The network is thus non-blocking internally. This greatly simplifies flow admission control and allows hard QoS to be supported inside the network.
    • 在本专利中描述了路由计算算法,路由器内的用于进行逐跳路由网络(例如因特网)非阻塞的负载平衡方案。 路由计算算法的输出包括确定逐跳路由网络的路径的一组链路权重。 路由计算算法和负载平衡方案还确定每个边缘路由器的入口和出口业务约束,使得只要进入和离开网络的流量不超过约束,内部链路就不会有遍历流量 超过其链路容量。 因此,网络内部无阻塞。 这大大简化了流量准入控制,并允许在网络内部支持硬QoS。
    • 8. 发明授权
    • Cellular devices, systems and methods using intercell macro-diversity
and dynamic channel allocation
    • 使用细胞间宏分集和动态信道分配的蜂窝设备,系统和方法
    • US5586170A
    • 1996-12-17
    • US293137
    • 1994-08-19
    • Chin-Tau Lea
    • Chin-Tau Lea
    • H04W16/24H04W36/08H04W36/30H04Q7/22
    • H04W36/30H04B7/022H04W16/24H04W24/04H04W28/16
    • A system of the subject invention includes a mobile telecommunications switching office (MTSO), several base stations and mobile units. The base stations serve respective sectors or cells to establish radio communications with mobile units in their sectors or cells. The base stations are connected to the MTSO which performs switching to establish call connections between mobile units and/or between units served by an external network to which the MTSO is connected. The MTSO uses dynamic channel allocation to designate base stations to serve a call connection in active mode and in standby mode for a particular channel. Therefore, if communication with the base station serving a call connection in active mode is disrupted by a building, terrain or an equipment failure, for example, the MTSO can set the base station currently in active mode to standby mode, and can set the base station currently in standby mode, to active mode to serve the call connection on the channel. Thus, the use of sectors or cells in active and standby modes, allows for relatively reliable communications through macro-diversity. Also, the ping-pong effect occurs relatively infrequently because the sectors or cells are switched between active and standby modes as a mobile unit moves along a sector or cell boundary, rather than requiring a handoff to another channel as required in conventional systems. Further, through use of dynamic channel allocation, handoffs in the traditional sense are relatively rare in the system of the subject invention.
    • 本发明的系统包括移动电信交换局(MTSO),若干基站和移动单元。 基站服务于相应的扇区或小区,以便与其扇区或小区中的移动单元建立无线电通信。 基站连接到MTSO,MTSO执行切换以在移动单元之间建立呼叫连接和/或在由MTSO连接的外部网络服务的单元之间。 MTSO使用动态信道分配来指定基站在主动模式和待机模式下为特定信道服务呼叫连接。 因此,如果与主用模式的服务于呼叫连接的基站的通信被建筑物,地形或设备故障中断,例如,MTSO可以将基站当前处于活动模式设置为待机模式,并且可以设置基站 工作站当前处于待机模式,到主动模式,用于在通道上提供呼叫连接。 因此,主动和待机模式中的扇区或单元的使用允许通过宏分集进行相对可靠的通信。 而且,由于移动单元沿着扇区或单元边界移动,扇区或单元在主动模式和待机模式之间切换,而不需要根据传统系统所需的切换到另一个通道,所以乒乓效应相对不频繁地发生。 此外,通过使用动态信道分配,传统意义上的切换在本发明的系统中相对较少。
    • 9. 发明申请
    • ASA: A SCALABLE OPTICAL SWITCH
    • ASA:可扩展的光开关
    • US20160127810A1
    • 2016-05-05
    • US14530695
    • 2014-11-01
    • Chin-Tau Lea
    • Chin-Tau Lea
    • H04Q11/00H04J14/02
    • H04Q11/0003H04J14/02H04Q11/0005H04Q2011/0024H04Q2011/0032H04Q2011/0039H04Q2011/005H04Q2011/0064
    • A scalable AWGR-based optical switching fabric and its scheduling method are presented. The switching fabric consists of three stages: two stages (first and third) of AWGRs interconnected by a second stage of optical space switches. The optical switching system is named ASA for the technologies used to construct the three stages: AWGR, Space switching, and AWGR. The first stage and third stage portions of the switching fabric comprise up to N N×N AWGRs (N inputs and N outputs) and the middle stage N N×N optical space switches, wherein N is an odd integer. This makes the switch's total port count N2. Each port can transmit up to N packets of different wavelengths simultaneously. Thus the total capacity of the switch is around (N3×bandwidth of one wavelength channel).
    • 介绍了一种可扩展的基于AWGR的光交换结构及其调度方法。 交换结构由三个阶段组成:由第二阶段光学空间交换机互连的两个阶段(第一和第三个)AWGR。 光交换系统被称为ASA,用于构建三个阶段的技术:AWGR,空间切换和AWGR。 交换结构的第一级和第三级部分包括多达N N×N个AWGR(N个输入和N个输出)和中间N N×N个光学空间开关,其中N是奇整数。 这使得交换机的总端口数为N2。 每个端口可以同时传输多达N个不同波长的数据包。 因此,交换机的总容量在(N3×一个波长信道的带宽)左右。
    • 10. 发明授权
    • Non-blocking internet backbone network
    • 无阻塞互联网骨干网
    • US07656886B2
    • 2010-02-02
    • US11243117
    • 2005-10-03
    • Chin-Tau LeaJian Chu
    • Chin-Tau LeaJian Chu
    • H04L12/56
    • H04L47/825H04L47/125H04L47/15H04L47/24H04L47/2425H04L47/70H04L47/808H04L47/822
    • A method and system for computing the maximum amount of admissible ingress and egress traffic of each edge router of the MPLS core network is presented. As long as the ingress and egress traffic amounts are below the admissible amount limit, traffic routes through any link in the network will never exceeds the link capacity. A calculation scheme and a load-distribution scheme make an Internet MPLS backbone network non-blocking. The output of the route computation algorithm includes a set of paths for any source-destination pair and the load distribution ratios among the paths. The routing algorithm and the associated distribution scheme will determine how to balance the loads that meet the distribution requirements specified by the ratios computed from the route algorithm. This greatly simplifies call admission control and allows hard QoS to be supported in a large scale and cross domains in the Internet.
    • 提出了一种用于计算MPLS核心网络每个边缘路由器的允许入口和出口流量的最大数量的方法和系统。 只要入口和出口流量低于允许限额,网络中任何链路的流量路由将永远不会超过链路容量。 计算方案和负载分配方案使得互联网MPLS骨干网不阻塞。 路由计算算法的输出包括用于任何源 - 目的地对的路径和路径之间的负载分配比。 路由算法和相关联的分配方案将确定如何平衡满足由路由算法计算的比率规定的分布要求的负载。 这大大简化了呼叫接纳控制,并允许在互联网上大规模和跨域支持硬QoS。