会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 2. 发明授权
    • Queue segmentation and addressing method and apparatus for a cell switch in a processing communications satellite
    • 用于处理通信卫星中的小区切换的队列分段和寻址方法和装置
    • US06597669B1
    • 2003-07-22
    • US09270938
    • 1999-03-16
    • Scott M. TakahashiRoland Y. WongDarren R. GregoireJaime L. Prieto, Jr.Gefferie H. Yee-Madera
    • Scott M. TakahashiRoland Y. WongDarren R. GregoireJaime L. Prieto, Jr.Gefferie H. Yee-Madera
    • H04B7204
    • H04L49/309H04B7/18589H04L49/205H04L49/3009H04L49/3027H04L49/3081H04L2012/5608H04L2012/5651H04L2012/5679H04L2012/5681H04Q11/0478
    • The present invention is a method and apparatus for processing data packets in the outbound module of a space-based cell switch. The present invention uses an expanded set of queuing parameters to determine an output queue in which to store each data packet. The method includes the steps of selecting an expanded set of queuing parameters (202), establishing several output queues (204) based on combinations of the expanded set of queuing parameters, receiving data packets in a communications uplink (206), examining the header portion of each received data packet (208, 210 and 212), determining an appropriate output queue in which to store the data packet (214 and 216), and switching the received data packets to that appropriate output queue (218). The present apparatus includes several input modules (102), a switch control output (114) connected between the input module (102) and a switch fabric (104), and a several output modules (106) connected to the switch fabric (104). The input modules (102) each include a discriminator circuit (108) distinguishing among several combinations of queuing parameters from an expanded set of queuing parameters, and the output modules (106) each include several output queues (116) and a cell selector (118) for selecting the destination output queue in which to store each data packet.
    • 本发明是一种用于处理基于空间的小区交换机的出站模块中的数据分组的方法和装置。 本发明使用扩展的一组排队参数来确定在其中存储每个数据分组的输出队列。 该方法包括以下步骤:基于扩展的排队参数组合,在通信上行链路(206)中接收数据分组来选择扩展的一组排队参数(202),建立多个输出队列(204),检查头部部分 (208,210和212),确定在其中存储数据分组(214和216)的适当的输出队列,并将接收的数据分组切换到该适当的输出队列(218)。 本装置包括几个输入模块(102),连接在输入模块(102)和交换结构(104)之间的开关控制输出(114)和连接到交换结构(104)的多个输出模块(106) 。 输入模块(102)各自包括鉴别器电路(108),区分来自扩展的一组排队参数的排队参数的若干组合,并且每个输出模块(106)包括若干输出队列(116)和单元选择器(118) )用于选择其中存储每个数据分组的目的地输出队列。
    • 3. 发明授权
    • Table based scheduling algorithm for downlink bandwidth allocation
    • 基于表的调度算法用于下行带宽分配
    • US06463280B1
    • 2002-10-08
    • US09575888
    • 2000-05-22
    • Scott M. TakahashiRoland Y. WongLisa A. Moy-YeeGefferie H. Yee-MaderaDarren R. Gregoire
    • Scott M. TakahashiRoland Y. WongLisa A. Moy-YeeGefferie H. Yee-MaderaDarren R. Gregoire
    • H04B7185
    • H04B7/18515
    • The method allocates (302) subclass entries in an ordered list (200) (which may be organized as a table, for example). Each entry (210-214) generally corresponds to one of several predetermined cell subclasses, and the allocation reserves a total number of each subclass entry in the ordered list according to a predetermined amount of bandwidth desired for each cell subclass. The subclasses may be associated with factors such as coding rate, downlink beam area, virtual paths or virtual circuits, quality of service parameters, and the like. The method then examines (304) each subclass entry in the ordered list and selects (306) a cell from a cell memory (which may be a queue) that matches the subclass entry. The matched cell is then transmitted (308). The method may also allocate sets of subclass entries in groups corresponding to a frame size and dynamically update (310) the ordered list during operation of the cell switch.
    • 该方法在有序列表(200)中分配(302)子类条目(例如可以被组织为表格)。 每个条目(210-214)通常对应于几个预定的小区子类中的一个,并且该分配根据每个小区子类所需的预定带宽量,在有序列表中保留每个子类条目的总数。 子类可以与诸如编码率,下行链路波束区域,虚拟路径或虚拟电路,服务质量参数等因素相关联。 然后,该方法检查(304)有序列表中的每个子类条目,并从与子类条目匹配的单元存储器(其可以是队列)中选择(306)单元。 然后传送匹配的单元(308)。 该方法还可以分组对应于帧大小的子集条目集合,并且在小区切换操作期间动态地更新(310)有序列表。
    • 4. 发明授权
    • Method and apparatus for serial cell replication for multicast in a cell switch
    • US06724761B1
    • 2004-04-20
    • US09408048
    • 1999-09-29
    • Lisa A. Moy-YeeGefferie H. Yee-MaderaDarren R. GregoireJaime L. Prieto, Jr.
    • Lisa A. Moy-YeeGefferie H. Yee-MaderaDarren R. GregoireJaime L. Prieto, Jr.
    • H04B7212
    • H04B7/18586
    • A method and apparatus for implementing multicast in a space-based communication system is disclosed. The present invention allows for the use of a buffer in which to store data packets prior to replication in a multicast application. The present apparatus includes a buffer (102), a header memory (103), and an ASIC (101) to store and extract received data packets and replicate them as required. The ASIC (101) includes a switch interface (201), a queue manager (203), a header processor (205), a holding buffer (207), and a arbitration interface (209). The switch interface (201) is connected to the queue manager (203). The queue manager (203) is connected to the buffer (102), the header processor 205, the holding buffer (207), and the arbitration and switch interface (204). The header processor (205) is connected to the header memory (103). The header processor (205) and the holding buffer (207) are connected to an arbitration and switch interface (209), whose output, in turn, is fed back through the switch matrix routing fabric (211) for routing and eventual downlink transmission. The method includes the steps of receiving data packets from the switch matrix routing fabric (302); storing the information payload and the header in the buffer(304); and extracting the information payload and header from the buffer (306). The method further includes the steps of buffering the information payload to the holding buffer (308); provisioning the header to the header processor (310); addressing the header memory (312); merging the new header obtained from the header memory with the information payload (314); and performing subsequent processing on the assembled cell (316). The latter two steps are repeated until all replicated cells are assembled and sent on for routing and eventual downlink transmission.