Patents by Inventor Ian David Johnson

Ian David Johnson has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Publication number: 20020129194
    Abstract: A method of operating a RAM memory having a plurality of memory addresses for storing data, the method being performed with a timing based on clock signals spaced by clock periods and comprising the steps of:
    Type: Application
    Filed: May 7, 2001
    Publication date: September 12, 2002
    Inventors: Steven Raymond Carroll, Ian David Johnson
  • Publication number: 20020012344
    Abstract: A data switching device has ingress routers and egress routers interconnected by a switching matrix controlled by a controller. Each ingress router maintains one or more virtual output queues for each egress router. The switching matrix itself maintains a head-of queue buffer of cells which are to be transmitted. Each of these queues corresponds to one of the virtual output queues, and the cells stored in the switching matrix are replicated from the cells queuing in the respective virtual output queues. Thus, when it is determined that a connection is to be made between a given input and output of the switching matrix, a cell suitable for transmission along that connection is already available to the switching matrix. Upon receipt of a new cell by one of the ingress routers, the cell is stored in one of the virtual output queues of the ingress router corresponding to the egress router for the cell, and also written the corresponding head of queue buffer, if that buffer has space.
    Type: Application
    Filed: June 5, 2001
    Publication date: January 31, 2002
    Inventors: Ian David Johnson, Colin Martin Duxbury, Marek Stephen Piekarskl
  • Publication number: 20020001304
    Abstract: In a data switching system, the ingress and egress ports of a memoryless cross-bar switch are controlled by an arbitration method. The arbitration method uses a three phase process involving (i) a request phase in which each ingress port sends its connection requests to egress ports to which a connection is required, (ii) a grant phase in which each egress port uses a grant pointer to select one of the requests directed to it using a grant pointer, and generates a grant signal, and (iii) an accept phase in which each ingress port selects one of the received grant signals to accept, so defining an ingress to egress port connection across the cross-bar switch. The transition sequences for each of the grant pointers are mutually exclusive, so that any synchronisation of the grant pointers is eliminated on the next arbitration cycle. This is arranged by a setting of the paths taken by request and grant signals.
    Type: Application
    Filed: May 16, 2001
    Publication date: January 3, 2002
    Inventors: Ian David Johnson, Simon William Farrow, Marek Stephen Piekarski, Paul Graham Howarth
  • Publication number: 20010043612
    Abstract: An arbitration process sets the connections to be made between ingress and egress ports of a crossbar switch of a data switching system. A weight parameter is used for each pair of ingress and egress ports. Connection requests are generated indicating ingress ports to be connected to egress ports. A selection is made among conflicting connection requests, to produce a connection proposal for each egress port. Any connection request for which respective weighting parameter is zero is not selected. When one of the connection requests is realised, the weight parameter corresponding to this connection is decreased by one. All the weight parameters for a given egress port are re-set to default values in the case that there are no connection requests for that egress port with non-zero weights.
    Type: Application
    Filed: May 15, 2001
    Publication date: November 22, 2001
    Inventors: Ian David Johnson, Marek Stephen Piekarski
  • Publication number: 20010028659
    Abstract: There is disclosed a masking unit (REQMSK) for use in a data packet switching system. The data switching system being of the type having a memoryless cross-back switch (SM) providing cyclic connections under the control of a switch arbiter (SCARB) between ingress routers (IR0, IR1, IR2 and IR3) and egress routers (ER0, ER1, ER2 and ER3). Each of the ingress routers (IR0-IR3) is provided with incoming packet buffering on a virtual output queue basis (VOQ0.0, VOQ0.1, VOQ0.2, and VOQ0.3 for ingress router IR0). Each virtual output queue also produces a connection request signal REQ0.0 to REQ3.3 when the corresponding queue has a data packet in it. The masking unit REQMSK is arranged to randomly mask out correlated connection requests.
    Type: Application
    Filed: April 5, 2001
    Publication date: October 11, 2001
    Inventors: Ian David Johnson, Marek Stephen Piekarski