中科微点-全球专利检索

  1. Login
  2. Sign Up

Search Results

17 records (took 0.018 seconds)

    PATTERN RANGE COMPARISON IMPLEMENTING METHOD, COMPUTER-READABLE MEDIUM, AND DEVICE
    2.
    发明专利
    PATTERN RANGE COMPARISON IMPLEMENTING METHOD, COMPUTER-READABLE MEDIUM, AND DEVICE 失效

    公开(公告)号：JP2002024293A

    公开(公告)日：2002-01-25

    申请号：JP2001104687

    申请日：2001-04-03

    Applicant: IBM

    Inventor： CALVIGNAC JEAN LOUIS ,  HEDDES MARCO C ,  JEFFERIES CLARK DEBUS ,  PATEL PIYUSH CHUNILAL ,  RINALDI MARK ANTHONY

    IPC: G06F17/30 ,  H04L12/56

    Abstract: PROBLEM TO BE SOLVED: To provide a new data structure, a method, and a device for a software management tree(SMT) which provide a control point processor. SOLUTION: This retrieving mechanism reduces the storage space of a node by using only a forward pointer together with a next bit or bit group to be tested next. Multiple retrieval is unnecessary and filter rules for an application are processed to make it possible to connect various filter rules. Two patterns of the same length are stored in respective leaves to define range comparison. Final comparing operation is comparison within a range or comparison below a mask. Through the comparison within the range, it is decided whether or not an input key is within the range defined by the two patterns. Through the comparison below the mask, various bits in the input key are compared with various bits in a 1st leaf pattern under the mask specified with the 2nd leaf pattern.

    A PLURALITY OF LOGICAL INTERFACES TO SHARED COPROCESSOR RESOURCE
    3.
    发明专利
    A PLURALITY OF LOGICAL INTERFACES TO SHARED COPROCESSOR RESOURCE 审中-公开

    公开(公告)号：JP2002149424A

    公开(公告)日：2002-05-24

    申请号：JP2001265792

    申请日：2001-09-03

    Applicant: IBM

    Inventor： DAVIS GORDON TAYLOR ,  MARKO C HEADS ,  RIWENS ROSE BOYED ,  RINALDI MARK ANTHONY

    IPC: G06F9/38 ,  G06F9/46 ,  G06F13/10 ,  G06F13/14 ,  G06F15/00 ,  G06F15/16 ,  G06F15/163 ,  G06F15/76 ,  G06F15/78 ,  G06F15/80 ,  H04L29/06

    Abstract: PROBLEM TO BE SOLVED: To increase the communicating efficiency of a protocol processor unit(PPU) and a coprocessor in a network processor. SOLUTION: An integrated processor composite body is provided with a plurality of protocol processor units(PPU). The respective units are provided with at least one or preferentially two individually functioning core language processors(CLP). The respective CLP are allowed to support dual threads through a logical coprocessor execution/data interface with a plurality of exclusive coprocessors to be used for the respective PPU. In response to an operation instruction, the PPU identifies an events whose waiting time is long and an event whose waiting time is short, and controls and switches the priority order of the execution of threads based on the identification. Also, in response to the operation instruction, the conditional execution of the specific coprocessor operation is made available when the designated specific event is generated or not generated.

    4.
    发明专利
    未知

    公开(公告)号：AT453974T

    公开(公告)日：2010-01-15

    申请号：AT02732096

    申请日：2002-01-17

    Applicant: IBM

    Inventor： BARKER KENNETH JAMES ,  DAVIS GORDON TAYLOR ,  JEFFRIES CLARK DEBS ,  RINALDI MARK ANTHONY ,  SUDEEP KARTIK

    IPC: H04L12/00 ,  H04L12/56

    Abstract: The decision to discard or forward a packet is made by a flow control mechanism, upstream from the forwarding engine in the node of a communication network. The forwarding engine includes a switch with mechanism to detect congestion in the switch and return a binary signal B indicating congestion or no congestion. The flow control mechanism uses B and other network related information to generate a probability transmission table against which received packets are tested to determine proactively whether a packet is to be discarded or forwarded.

    6.
    发明专利
    未知

    公开(公告)号：DE60319366D1

    公开(公告)日：2008-04-10

    申请号：DE60319366

    申请日：2003-05-16

    Applicant: IBM

    Inventor： PEYRAVIAN MOHAMMAD ,  RINALDI MARK ANTHONY ,  SIEGEL MICHAEL STEVEN ,  SABHIKHI RAVINDER KUMAR

    IPC: H04L47/724 ,  H04L12/40

    Abstract: A Resource Reservation System includes a Token Generation Unit (TGU) which generates and circulates among nodes of a communications system a Slotted Token (SLT) message having sub-fields to carry identification number for each input port in a node and the resource available for each input port. On receiving the message the Resource Control Unit (RCU) in each node can write port identification number, available resource in appropriate sub-fields of the SLT message, and reserve resources in other nodes by adjusting information in the sub-field associated with the other nodes.

    CONGESTION MANAGEMENT IN COMPUTER NETWORKS
    8.
    发明专利
    CONGESTION MANAGEMENT IN COMPUTER NETWORKS 未知

    公开(公告)号：CA2429151A1

    公开(公告)日：2002-07-25

    申请号：CA2429151

    申请日：2002-01-17

    Applicant: IBM

    Inventor： BARKER KENNETH JAMES ,  DAVIS GORDON TAYLOR ,  JEFFRIES CLARK DEBS ,  RINALDI MARK ANTHONY ,  SUDEEP KARTIK

    IPC: H04L12/56 ,  H04L12/00

    Abstract: The decision to discard or forward a packet is made by a flow control mechanism, upstream from the forwarding engine in the node of a communication network. The forwarding engine includes a switch with mechanism to detect congestion in the switch and return a binary signal B indicating congestion or no congestion. The flow control mechanism uses B and other network related information to generate a probability transmission table against which received packets are tested to determine proactively whether a packet is to be discarded or forwarded.

    STAUMANAGEMENT IN COMPUTERNETZEN
    9.
    发明专利
    STAUMANAGEMENT IN COMPUTERNETZEN 未知

    公开(公告)号：DE60234903D1

    公开(公告)日：2010-02-11

    申请号：DE60234903

    申请日：2002-01-17

    Applicant: IBM

    Inventor： BARKER KENNETH JAMES ,  DAVIS GORDON TAYLOR ,  JEFFRIES CLARK DEBS ,  RINALDI MARK ANTHONY ,  SUDEEP KARTIK

    IPC: H04L12/00 ,  H04L12/56

    Abstract: The decision to discard or forward a packet is made by a flow control mechanism, upstream from the forwarding engine in the node of a communication network. The forwarding engine includes a switch with mechanism to detect congestion in the switch and return a binary signal B indicating congestion or no congestion. The flow control mechanism uses B and other network related information to generate a probability transmission table against which received packets are tested to determine proactively whether a packet is to be discarded or forwarded.

Patent Agency Ranking