会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 103. 发明授权
    • Multi-parameter scheduling in communication systems
    • 通信系统中的多参数调度
    • US07424003B2
    • 2008-09-09
    • US10796511
    • 2004-03-08
    • Abraham FisherGil Graiber
    • Abraham FisherGil Graiber
    • H04B7/212
    • H04L47/56H04L47/6275
    • A method of scheduling the handling of communication channels by a processor assigned to handle a plurality of channels. The method includes determining for each channel, handled by the processor, a target time by which time it should receive processing, selecting one or more of the assigned channels whose data is to be handled next, based on the target times of the channels and when more than one channel is selected, choosing for handling before other channels, at least one of the selected channels based on a consideration directed at minimizing the average processing time of the channels.
    • 一种通过分配给处理多个信道的处理器调度对通信信道的处理的方法。 该方法包括:确定由处理器处理的每个信道,基于该信道的目标时间,何时应该接收处理的目标时间,以及下一个处理其数据要被处理的一个或多个所分配的信道 选择多于一个信道,基于针对最小化信道的平均处理时间的考虑,选择在其它信道之前处理所选择的信道中的至少一个。
    • 105. 发明申请
    • SWITCH AND A SWITCHING METHOD
    • 开关和开关方法
    • US20080137675A1
    • 2008-06-12
    • US12031208
    • 2008-02-14
    • Bart Joseph Gerard PAUWELS
    • Bart Joseph Gerard PAUWELS
    • H04L12/56
    • H04L47/2416H04L47/2425H04L47/2441H04L47/245H04L47/50H04L47/56H04L47/6215H04L49/205H04L49/552H04L49/9094H04L2012/5651H04L2012/5681H04Q11/0478
    • A switch at a transmission end of a system including a number of memory devices defining queues for receiving traffic to be switched, each queue having an associated predetermined priority classification, and a processor for controlling the transmission of traffic from the queues. The processor transmits traffic from the higher priority queues before traffic from lower priority queues. The processor monitors the queues to determine whether traffic has arrived at a queue having a higher priority classification than the queue from which traffic is currently being transmitted. The processor suspends the current transmission after transmission of the current minimum transmittable element if traffic has arrived at a higher priority queue, transmits traffic from the higher priority queue, and then resumes the suspended transmission. At a receiving end, a switch that includes a processor separates the interleaved traffic into output queues for reassembly of individual traffic streams from the data stream.
    • 在系统的发送端处的交换机,包括定义用于接收要切换的业务的队列的多个存储器设备,每个队列具有相关联的预定优先级分类,以及用于控制来自队列的业务传输的处理器。 处理器在来自较低优先级队列的流量之前从较高优先级队列传送流量。 处理器监视队列以确定流量是否已经到达具有比当前正在传输流量的队列更高的优先级分类的队列。 如果业务已经到达较高优先级队列,则传输当前最小可发送元素之后,处理器暂停当前传输,从较高优先级队列传输业务,然后恢复暂停传输。 在接收端,包括处理器的交换机将交织的业务分离成输出队列,以从数据流重新组合各个业务流。
    • 107. 发明授权
    • Scheduling of guaranteed-bandwidth low-jitter traffic in input-buffered switches
    • 在输入缓冲交换机中调度保证带宽低抖动流量
    • US07359384B2
    • 2008-04-15
    • US10348385
    • 2003-01-21
    • Muralidharan S. KodialamTirunell V. LakshmanDimitrios Stiliadis
    • Muralidharan S. KodialamTirunell V. LakshmanDimitrios Stiliadis
    • H04L12/56
    • H04L47/521H04L47/28H04L47/50H04L47/56H04L49/254
    • A switch schedules guaranteed-bandwidth, low-jitter-traffic characterized by a guaranteed rate table (GRT) method. A rate matrix generated from collected provisioning information is decomposed into schedule tables by a low jitter (LJ) decomposition method. The LJ decomposition method imposes a set of constraints for the schedule tables: schedule tables are partial permutation matrices, weighted sum of the partial permutation matrices is greater than or equal to the weighted sum of the rate matrix, and each entry in the rate matrix belongs to one element of the LJ decomposition schedule matrices. An integer LJ decomposition programming problem is employed to generate the schedule tables that are scheduled for each time slot of the period of the switch. Schedule tables are selected in turn based upon selecting eligible tables having the earliest finishing time. If necessary, the rate matrix is updated prior to decomposition for a subsequent period.
    • 交换机调度保证带宽,低抖动流量,其特征在于保证速率表(GRT)方法。 从收集的配置信息生成的速率矩阵通过低抖动(LJ)分解方法分解为调度表。 LJ分解方法对调度表施加一组约束:调度表是部分置换矩阵,部分置换矩阵的加权和大于或等于速率矩阵的加权和,并且速率矩阵中的每个条目都属于 到LJ分解调度矩阵的一个元素。 采用整数LJ分解编程问题来生成为交换周期的每个时隙调度的调度表。 根据选择具有最早完成时间的合格表,依次选择计划表。 如果需要,速率矩阵在分解之前在随后的时间段内被更新。
    • 108. 发明申请
    • LATENCY REDUCTION BY ADAPTIVE PACKET FRAGMENTATION
    • 通过自适应分组分段实现减少
    • US20080056192A1
    • 2008-03-06
    • US11469196
    • 2006-08-31
    • Peter N. StrongTimothy G. WildGregor R. Dean
    • Peter N. StrongTimothy G. WildGregor R. Dean
    • H04Q7/00
    • H04W72/1242H04L47/10H04L47/14H04L47/2441H04L47/28H04L47/365H04L47/50H04L47/56H04L47/6215H04L49/90H04W28/065H04W28/14
    • A wireless broadband communications system and method that achieves reduced latency for high priority data when multiplexed with lower priority data for transmission over a TDD point-to-point radio link. The system prepares multiple data streams for transmission over a TDD radio link by buffering multiple data streams containing high and low priority packets in separate queues based upon their corresponding priority level. Each packet in the higher priority queues has a specified size, and a header defining the type of service provided and the packet destination. Next, the packets in the lower priority queues are fragmented to a reduced size based upon the data capacity of the link. The high priority packets and the fragmented, low priority packets are arranged in a sequence such that the high priority packets are transmitted first, and the low priority packets are transmitted when no data is buffered in any high priority queue.
    • 一种无线宽带通信系统和方法,当与较低优先级数据进行多路复用以实现通过TDD点对点无线电链路进行传输时,可实现较低优先级数据的延迟。 基于其对应的优先级,通过在单独的队列中缓冲包含高优先级和低优先级的数据包的多个数据流,系统通过TDD无线电链路准备多个数据流以进行传输。 较高优先级队列中的每个分组具有指定的大小,以及定义提供的服务类型和分组目的地的报头。 接下来,基于链路的数据容量,较低优先级队列中的分组被分段为减小的大小。 高优先级分组和分片优先级低的分组按照先序发送高优先级分组的顺序排列,当没有数据缓存在任何高优先级队列中时,发送低优先级分组。
    • 109. 发明授权
    • Method and apparatus for starvation-free scheduling of communications
    • 通信无饥饿调度的方法和装置
    • US07330477B2
    • 2008-02-12
    • US10328454
    • 2002-12-24
    • Ariel HendelFu-Kuang Frank Chao
    • Ariel HendelFu-Kuang Frank Chao
    • H04L12/56
    • H04L47/24H04L47/39H04L47/50H04L47/56H04L47/6235H04L47/6285
    • A system and method for scheduling communications from a communication interface. Each of multiple send queues is associated with a destination and assigned to a logical communication channel. A list of stalled queues identifies those send queues for which a constraint restricts scheduling. When a queue is to be selected for service, a scheduler first attempts to find a member of the stalled queues list that is no longer stalled (e.g., any constraints were satisfied). Such a queue is selected for service if it exists. If there is no such queue, then all logical channels are examined and, from a list of send queues assigned to a selected logical channel, a send queue is selected for servicing. After a queue is scheduled from the stalled queues list, the list of queues assigned to its logical channel is adjusted (e.g., to place the queue at the tail of the list).
    • 一种用于从通信接口调度通信的系统和方法。 多个发送队列中的每一个都与目的地相关联并分配给逻辑通信信道。 停滞队列的列表标识约束限制调度的发送队列。 当队列被选择用于服务时,调度器首先尝试找到不再停滞的停滞队列列表的成员(例如,满足任何约束)。 如果存在这样的队列被选择用于服务。 如果没有这样的队列,则检查所有逻辑信道,并且从分配给所选逻辑信道的发送队列的列表中选择发送队列进行维修。 在从停滞的队列列表调度队列之后,调整分配给其逻辑信道的队列的列表(例如,将队列放置在列表的尾部)。