会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Method and system for managing queued cells
    • 用于管理排队的单元的方法和系统
    • US5278828A
    • 1994-01-11
    • US893265
    • 1992-06-04
    • Hung-Hsiang J. Chao
    • Hung-Hsiang J. Chao
    • H04L12/56H04Q11/04H04J3/26
    • H04L49/30H04L49/20H04L49/3081H04L49/508H04Q11/0478H04L2012/5651H04L2012/5672H04L2012/5681H04L49/103
    • A queue management method and system manages queued cells in such a way that higher priority cells are always served first, the low priority cells are dropped when the queue is full and, within the same priority, any interference is prevented. Four different architecture designs for such queue management are presented and their implementation feasibility and hardware complexity are compared and contrasted. A departure sequence is assigned to each cell in the novel architecture to implement the queue management. The sequence applies the concepts of fully distributed and highly parallel processing to schedule cell sending or dropping sequences. Preferably, a sequencer is provided such that the queue size and the number of priority levels can grow flexibly and without limit.
    • 队列管理方法和系统以这样的方式管理排队的小区,使得始终首先服务较高优先级的小区,当队列满时,低优先级小区被丢弃,并且在相同的优先级内,防止任何干扰。 介绍了这种队列管理的四种不同架构设计,并对其实现可行性和硬件复杂性进行了比较和对比。 出发序列被分配给新颖架构中的每个小区以实现队列管理。 该序列应用完全分布和高度并行处理的概念来调度信元发送或丢弃序列。 优选地,提供定序器,使得队列大小和优先级数量可以灵活地且无限制地增长。
    • 5. 发明授权
    • Crosspoint matrix switching element for a packet switch
    • 用于分组交换的交叉点矩阵切换元件
    • US5179552A
    • 1993-01-12
    • US821264
    • 1992-01-10
    • Hung-Hsiang J. Chao
    • Hung-Hsiang J. Chao
    • H04J3/24H04L12/56H04Q11/04
    • H04L12/5601H04J3/247H04L49/106H04L49/1553H04L49/1576H04L49/1584H04L49/258H04Q11/0478H04L2012/5627H04L2012/5647H04L2012/5651
    • A crosspoint matrix switching element and associated method for a large (e.g. approximately 1 Terabit/second) packet switch (200) or a non-buffer based statistical multiplexor (1810), using a crossbar matrix network in which, first, the output ports of individual switching elements (e.g. 1340.sub.1,1, 1340.sub.2,1) are partitioned into various groups (e.g. 1110) in order to share routing paths (links) (e.g. 1115.sub.1, 1115.sub.2, . . . , 1115.sub.K) among the elements in any such group and, second, the outputs of each such group are themselves recursively partitioned into a succession of serially connected groups (e.g. 1140, 1160) that each provides a decreasing number of outputs until one such output is provided for each corresponding output port (278.sub.1, 278.sub.2, . . . , 278.sub.N) of the switch. The switching element includes a control circuit which compares corresponding bits of two incoming bit streams in specific time windows to generate control signals and a routing circuit responsive to the control signals for routing the two input bit streams alternatively to two data outputs.
    • 一种用于大(例如大约1兆位/秒)分组交换机(200)或非基于缓冲器的统计多路复用器(1810)的交叉点矩阵切换元件和相关方法,其使用交叉矩阵网络,其中,首先输出端口 各个开关元件(例如13401,1,13402,1)被划分成各种组(例如1110),以便在任何这样的组中的元件之间共享路由路径(链路)(例如,11151,11152,...,1115K) 并且其次,每个这样的组的输出本身被递归地划分成一系列串行连接的组(例如1140,1160),每个组提供递减数量的输出,直到为每个对应的输出端口提供一个这样的输出(2781,2782 ,...,278N)。 开关元件包括控制电路,其比较特定时间窗口中的两个输入比特流的相应比特以产生控制信号,以及响应于用于将两个输入比特流路由到两个数据输出的控制信号的路由电路。
    • 6. 发明授权
    • Distributed modular packet switch employing recursive partitioning
    • 分布式模块化分组交换机采用递归分区
    • US5197064A
    • 1993-03-23
    • US618119
    • 1990-11-26
    • Hung-Hsiang J. Chao
    • Hung-Hsiang J. Chao
    • H04J3/24H04L12/56H04Q11/04
    • H04L12/5601H04J3/247H04L49/1576H04L49/1584H04L49/258H04Q11/0478H04L2012/5647H04L2012/5651H04L2012/5652H04L2012/5681
    • Apparatus, and accompanying methods for use therein, for illustratively implementing a large (e.g. approximately 1 Terabit/second) packet switch (200) or a non-buffer based statistical multiplexor (1810), using a crossbar matrix network in which, first, the output ports of individual switching elements (e.g. 1340.sub.1,1, 1340.sub.2,1) are partitioned into various groups (e.g. 1110) in order to share routing paths (links) (e.g. 1115.sub.1, 1115.sub.2, . . . , 1115.sub.K) among the elements in any such group and, second, the outputs of each such group are themselves recursively partitioned into a succession of serially connected groups (e.g. 1140, 1160) that each provides a decreasing number of outputs until one such output is provided for each corresponding output port (278.sub.1, 278.sub.2, . . . , 278.sub.N) of the switch. Such a switch also utilizes channel grouping to improve overall performance and a crossbar switching fabric that internally distributes contention resolution and filtering functions among the individual switching elements themselves to reduce complexity, provide modularity, reduce growth limitations and relax synchronization requirements of the entire switch.
    • 装置及其使用的方法,用于示意性地使用交叉矩阵网络来实现大(例如大约1兆比特/秒)分组交换机(200)或非基于缓冲器的统计多路复用器(1810),其中,首先, 各个开关元件(例如,13401,1,13402,1)的输出端口被划分成各种组(例如,1110),以便共享各个元件之间的路由路径(链路)(例如,11151,11152,...,1115K) 任何这样的组,并且其次,每个这样的组的输出本身被递归地划分成一系列串行连接的组(例如1140,1160),每个组提供递减数量的输出,直到为每个对应的输出端口提供一个这样的输出( 2781,2782,... 278N)。 这样的交换机还利用信道分组来提高总体性能,并且在各个交换单元本身内部分配争用解决和过滤功能的交叉交换结构以降低复杂性,提供模块化,减少增长限制并且放松整个交换机的同步要求。
    • 7. 发明授权
    • Grouping network based non-buffer statistical multiplexor
    • 分组网络非缓冲区统计多路复用器
    • US5124978A
    • 1992-06-23
    • US637230
    • 1991-01-03
    • Hung-Hsiang J. Chao
    • Hung-Hsiang J. Chao
    • H04J3/24H04L12/56H04Q11/04
    • H04L12/5601H04J3/247H04L49/1576H04L49/1584H04L49/258H04L49/455H04Q11/0478H04L2012/5647H04L2012/5651H04L2012/5674H04L2012/5681
    • Apparatus, and accompanying methods for use therein, for illustratively implementing a large (e.g. approximately 1 Terabit/second) packet switch (200) or a non-buffer based statistical multiplexor (1810), using a crossbar matrix network in which, first, the output ports of individual switching elements (e.g. 1340.sub.1,1, 1340.sub.2,1) are partitioned into various groups (e.g. 1110) in order to share routing paths (links) (e.g. 1115.sub.1, 1115.sub.2, . . . , 1115.sub.K) among the elements in any such group and, second, the outputs of each such group are themselves recursively partitioned into a succession of serially connected groups (e.g. 1140, 1160) that each provides a decreasing number of outputs until one such output is provided for each corresponding output port (278.sub.1, 278.sub.2, . . . , 278.sub.N) of the switch. Such a switch also utilizes channel grouping to improve overall performance and a crossbar switching fabric that internally distributes contention resolution and filtering functions among the individual switching elements themselves to reduce complexity, provide modularity, reduce growth limitations and relax synchronization requirements of the entire switch.
    • 装置及其使用的方法,用于示意性地使用交叉矩阵网络来实现大(例如大约1兆比特/秒)分组交换机(200)或非基于缓冲器的统计多路复用器(1810),其中,首先, 各个开关元件(例如,13401,1,13402,1)的输出端口被划分成各种组(例如,1110),以便共享各个元件之间的路由路径(链路)(例如,11151,11152,...,1115K) 任何这样的组,并且其次,每个这样的组的输出本身被递归地划分成一系列串行连接的组(例如1140,1160),每个组提供递减数量的输出,直到为每个对应的输出端口提供一个这样的输出( 2781,2782,... 278N)。 这样的交换机还利用信道分组来提高总体性能,并且在各个交换单元本身内部分配争用解决和过滤功能的交叉交换结构以降低复杂性,提供模块化,减少增长限制并且放松整个交换机的同步要求。
    • 10. 发明授权
    • Method and system for controlling user traffic to a fast packet
switching system
    • 用于控制快速分组交换系统的用户流量的方法和系统
    • US5381407A
    • 1995-01-10
    • US893274
    • 1992-06-04
    • Hung-Hsiang J. Chao
    • Hung-Hsiang J. Chao
    • H04L12/56H04Q11/04H04J3/14
    • H04L12/5602H04Q11/0478H04L2012/5636H04L2012/5637H04L2012/5651
    • A method and system are provided for controlling user traffic to a fast packet switching system using the leaky bucket scheme. Each of the packets (53 byte length cell) originates at a source of packets and has a virtual channel identifier (VCI). The method includes the step of receiving the packets, each of the packets having associated therewith an arrival time. The packets are stored at an addressable location in a first memory. The first memory having a plurality of addressable locations. In a second memory, there are stored addresses corresponding to the addressable locations in the first memory in which a packet is not yet stored. The addresses stored in the second memory are utilized in the step of storing the received packets. A credit manager circuit determines whether a stored packet complies with predetermined traffic parameters such as average arrival rate and maximum burst rate. This determination is based on a packet's arrival time and its VCI to obtain a validated packet. The credit manager circuit retrieves the validated packet from the first memory and the retrieved packet is then transmitted to the packet switching system.
    • 提供了一种方法和系统,用于控制使用泄漏桶方案的快速分组交换系统的用户流量。 每个分组(53字节长度小区)起始于分组的源,并且具有虚拟信道标识符(VCI)。 该方法包括接收分组的步骤,每个分组具有相关联的到达时间。 分组被存储在第一存储器中的可寻址位置。 第一存储器具有多个可寻址位置。 在第二存储器中,存储对应于第一存储器中的可寻址位置的地址,其中分组尚未被存储。 存储在第二存储器中的地址在存储接收到的分组的步骤中被使用。 信用管理器电路确定存储的分组是否符合预定的业务参数,例如平均到达速率和最大突发速率。 该确定基于分组的到达时间和其VCI来获得经验证的分组。 信用管理电路从第一个存储器检索经过验证的数据包,然后将检索的数据包发送到数据包交换系统。