Patents by Inventor Cyriel Minkenberg
Cyriel Minkenberg 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: 20080273465Abstract: The invention relates to a method and a switching fabric for counteracting a saturation tree occurring in a network with nodes. The method comprises the steps of generating at a local node where a congestion emerges a first congestion information; sending the first congestion information to at least one upstream node; responsive to one received first congestion information comparing the content of the received first congestion information with a pre-sent local status based on a set of predefined rules in order to identify at least one packet stream causing the congestion, and generating a second congestion information comprising the identified at least one packet stream causing the congestion; and sending the second congestion information to at least one further upstream node from where the identified at least one packet stream was received.Type: ApplicationFiled: July 3, 2008Publication date: November 6, 2008Inventors: Mircea Gusat, Marc Verhappen, Cyriel Minkenberg, Jose Dusto
-
Publication number: 20080247411Abstract: A method is described to operate a crossbar switch comprising a crossbar fabric with N sending and M receiving ports, with port cards connected to at least one sending and/or receiving port each of the crossbar fabric, said crossbar switch further comprising a control unit connected with the port cards via discrete control channel links, wherein C ports are clustered on a single receiving port card so that such a receiving port card in a single time-step can receive up to C data cells from C sending port cards simultaneously. According to said method the control channel links are used to relay up to C acknowledgements between at least one receiving port card and at least one sending port card.Type: ApplicationFiled: March 28, 2008Publication date: October 9, 2008Applicant: International Business Machines CorporationInventors: Francois G. Abel, Mircea Gusat, Rajaram B. Krishnamurthy, Cyriel Minkenberg
-
Publication number: 20080219269Abstract: A method for scheduling unicast and multicast traffic in an interconnecting fabric performs within each time slot the following steps. First a multicast cell scheduling (61) and independently thereof a unicast cell scheduling (62) is performed. Then, the unicast cell schedule and the multicast cell schedule are merged to a merged schedule (63), wherein in the case a scheduled connection cannot be included in the merged schedule the scheduled connection is included in the merged schedule in a later time slot (66, 63).Type: ApplicationFiled: March 12, 2008Publication date: September 11, 2008Applicant: International Business Machines CorporationInventors: Cyriel Minkenberg, Francois G. Abel, Enrico Schiattarella
-
Publication number: 20080165793Abstract: The present invention discloses a memory sharing mechanism based on priority elevation. In accordance with the present invention, there is provided an apparatus and method for transporting packets of data in a communication device, wherein each packet is assigned one of several priorities and received based on memory state information. The method comprises the steps of storing the received packets in a memory and modifying the assigned priority of any of the packets causing congestion within the memory.Type: ApplicationFiled: March 19, 2008Publication date: July 10, 2008Applicant: International Business Machines CorporationInventors: Francois G. Abel, Wolfgang Denzel, Antonius Engbersen, Ferdinand Gramsamer, Mitch Gusat, Ronald P. Luijten, Cyriel Minkenberg, Mark Verhappen
-
Patent number: 7392355Abstract: The present invention discloses a memory sharing mechanism based on priority elevation. In accordance with the present invention, there is provided an apparatus and method for transporting packets of data in a communication device, wherein each packet is assigned one of several priorities and received based on memory state information. The method comprises the steps of storing the received packets in a memory and modifying the assigned priority of any of the packets causing congestion within the memory.Type: GrantFiled: July 1, 2003Date of Patent: June 24, 2008Assignee: International Business Machines CorporationInventors: Francois G. Abel, Wolfgang Denzel, Antonius Engbersen, Ferdinand Gramsamer, Mitch Gusat, Ronald P Luijten, Cyriel Minkenberg, Mark Verhappen
-
Publication number: 20070297330Abstract: The present invention discloses a scalable flow-control mechanism. In accordance with the present invention, there is provided a switching device for transporting packets of data, the packets being received at the switching device based on flow-control information, the device comprising a memory for storing the packets, a credit counter coupled to the memory for counting a credit number of packets departing from the memory, and a scheduler unit coupled to the credit counter for deriving the flow-control information in response to the credit number. Moreover, a switching apparatus and a method for generating flow-control information is disclosed.Type: ApplicationFiled: August 17, 2007Publication date: December 27, 2007Inventors: Mitch Gusat, Ferdinand Gramsamer, Mark Verhappen, Antonius Engbersen, Ronald Luijten, Francois Abel, Cyriel Minkenberg, Jose Duato
-
Patent number: 7304949Abstract: The present invention discloses a scalable flow-control mechanism. In accordance with the present invention, there is provided a switching device for transporting packets of data, the packets being received at the switching device based on flow-control information, the device comprising a memory for storing the packets, a credit counter coupled to the memory for counting a credit number of packets departing from the memory, and a scheduler unit coupled to the credit counter for deriving the flow-control information in response to the credit number. Moreover, a switching apparatus and a method for generating flow-control information is disclosed.Type: GrantFiled: February 3, 2003Date of Patent: December 4, 2007Assignee: International Business Machines CorporationInventors: Mitch Gusat, Ferdinand Gramsamer, Mark Verhappen, Antonius Engbersen, Ronald P. Luijten, Francois G. Abel, Cyriel Minkenberg, Jose Duato
-
Publication number: 20070110087Abstract: A method and system for reducing arbitration latency employs speculative transmission (STX) without prior arbitration in combination with routing fabric scheduled arbitration. Packets are sent from source locations to a routing fabric through scheduled arbitration, and also through speculative arbitration, to non-contentiously allocate outputs that were not previously reserved in the routing fabric to the speculatively transmitted packets.Type: ApplicationFiled: April 10, 2006Publication date: May 17, 2007Inventors: Francois Abel, Alan Benner, Richard Grzybowski, Brewster Hemenway, Ilias Iliadis, Rajaram Krishnamurthy, Ronald Luijten, Cyriel Minkenberg
-
Patent number: 7145873Abstract: The invention proposes a switching arrangement for transporting data packets which comprise a data packet destination information and a payload, to one or more output ports. The switching device is able to route the arriving data packets according to the data packet destination information, to at least one dedicated of the output ports. It comprises at each input port an input buffer with at least as many single input queues as there are output ports, and an input controller for each input port, serving for controlling the order of multiplexing the data packets from the input queues of the corresponding input buffer to the switching device. The total of input ports is divided up into several subsets of input ports. Each subset in the switching device has its separate output buffer for storing at addresses therein at least the payload of each data packet arriving at the input port. At least one set of as many output queues as the switching arrangement has output ports are arranged.Type: GrantFiled: September 27, 2001Date of Patent: December 5, 2006Assignee: International Business Machines CorporationInventors: Ronald P. Luijten, Cyriel Minkenberg, Norbert Schumacher, Juergen Koehl, Bernd Leppla
-
Publication number: 20060221948Abstract: The interconnecting network for switching data packets, having data and flow control information, comprises a local packet switch element (S1) with local input buffers (I(1,1) . . . I(1,y)) for buffering the incoming data packets, a remote packet switch element (S2) with remote input buffers (I(2,1) . . . I(2,y)) for buffering the incoming data packets, and data lines (L) for interconnecting the local and the remote packet switch elements (S1, S2). The interconnecting network further comprises a local and a remote arbiter (A1, A2) which are connected via control lines (CL) to the input buffers (I(1,1) . . . I(1,y), I(2,1) . . . I(2,y)), and which are formed such that they can provide that the flow control information is transmitted via the data lines (L) and the control lines (CL).Type: ApplicationFiled: March 31, 2005Publication date: October 5, 2006Applicant: International Business Machines CorporationInventors: Alan Benner, Cyriel Minkenberg, Craig Stunkel
-
Patent number: 7050440Abstract: The present invention relates to switching in electronic networks. Many data transmission protocols and technologies used in such networks, such as TCP/IP and Ethernet, use variable-length packets for transmission. Often however, the nodes that make up these networks typically contain high-speed cell switches that only support fixed-size data units. To support variable-length packets in such a fixed-size cell switch non-interleaving switching and transmission must be offered. The present invention provides such a solution in essence by segmenting a variable-length frame into a plurality of fixed-length cells including a start-of-frame cell, one or more continuation cell(s), and an end-of-frame cell and routes said fixed-length cells through said switch, thereby providing, at an output of said switch, subsequent and deadlock-free transmission of consecutive cells of a certain frame, and block any cell of a different frame from interleaving.Type: GrantFiled: November 26, 2001Date of Patent: May 23, 2006Assignee: International Business Machines CorporationInventors: Michel Colmant, Ferdinand Gramsamer, Cyriel Minkenberg
-
Publication number: 20060056308Abstract: Method and Switching fabric for ccounteracting a saturation tree occurring in a network with nodes An example of a method comprises the steps of generating at a local node where a congestion emerges a first congestion information; sending the first congestion information to at least one upstream node; responsive to one received first congestion information comparing the content of the received first congestion information with a present local status based on a set of predefined rules in order to identify at least one packet stream causing the congestion, and generating a second congestion information comprising the identified at least one packet stream causing the congestion; and sending the second congestion information to at least one further upstream node from where the identified at least one packet stream was received.Type: ApplicationFiled: May 25, 2005Publication date: March 16, 2006Applicant: International Business Machines CorporationInventors: Mircea Gusat, Marc Verhappen, Cyriel Minkenberg, Jose Duato
-
Patent number: 6944170Abstract: The invention is related to a switching arrangement for transporting data packets which comprise a section with data packet destination information and a payload section, to one or more output ports. The switching device is able to route the arriving data packets according to the data packet destination information, to at least one dedicated of the output ports. It comprises at each input port an input buffer with at least as many single input queues as there are output ports, and an input controller for each input port, serving for controlling the order of multiplexing the data packets from the input queues of the corresponding input buffer to the switching device.Type: GrantFiled: April 20, 2001Date of Patent: September 13, 2005Assignee: International Business Machines CorporationInventor: Cyriel Minkenberg
-
Publication number: 20050190795Abstract: The present invention is related to a method for allocating pending requests for data packet transmission at a number of inputs to a number of outputs of a switching system in successive time slots, wherein according to a matching method the allocation of the pending requests is optimized, wherein the matching method includes a number of steps for incrementally allocating the requests, wherein as a result of each step a matching information is provided, wherein in each time slot a request information is provided, the request information indicating the data packets at the inputs requesting transmission to respective outputs, the matching method comprising the steps of providing a first request information in a first time slot, performing a first step in the first time slot depending on the first request information to obtain a first matching information; providing a last request information in a last time slot successive the first time slot; performing a last step in the last time slot depending on the last reType: ApplicationFiled: February 27, 2004Publication date: September 1, 2005Applicant: International Business Machines CorporationInventors: Francois Abel, Ilias Iliadis, Cyriel Minkenberg
-
Publication number: 20040022188Abstract: The present invention discloses a memory sharing mechanism based on priority elevation. In accordance with the present invention, there is provided an apparatus and method for transporting packets of data in a communication device, wherein each packet is assigned one of several priorities and received based on memory state information. The method comprises the steps of storing the received packets in a memory and modifying the assigned priority of any of the packets causing congestion within the memory.Type: ApplicationFiled: July 1, 2003Publication date: February 5, 2004Applicant: International Business Machines CorporationInventors: Francois G. Abel, Wolfgang Denzel, Antonius Engbersen, Ferdinand Gramsamer, Mitch Gusat, Ronald P. Luijten, Cyriel Minkenberg, Mark Verhappen
-
Publication number: 20030152091Abstract: The present invention discloses a scalable flow-control mechanism. In accordance with the present invention, there is provided a switching device for transporting packets of data, the packets being received at the switching device based on flow-control information, the device comprising a memory for storing the packets, a credit counter coupled to the memory for counting a credit number of packets departing from the memory, and a scheduler unit coupled to the credit counter for deriving the flow-control information in response to the credit number. Moreover, a switching apparatus and a method for generating flow-control information is disclosed.Type: ApplicationFiled: February 3, 2003Publication date: August 14, 2003Applicant: International Business Machines CorporationInventors: Mitch Gusat, Ferdinand Gramsamer, Mark Verhappen, Antonius Engbersen, Ronald P. Luijten, Francois G. Abel, Cyriel Minkenberg, Jose Duato
-
Publication number: 20020196778Abstract: The present invention relates to switching in electronic networks. Many data transmission protocols and technologies used in such networks, such as TCP/IP and Ethernet, use variable-length packets for transmission. Often however, the nodes that make up these networks typically contain high-speed cell switches that only support fixed-size data units. To support variable-length packets in such a fixed-size cell switch non-interleaving switching and transmission must be offered. The present invention provides such a solution in essence by segmenting a variable-length frame into a plurality of fixed-length cells including a start-of-frame cell, one or more continuation cell(s), and an end-of-frame cell and routes said fixed-length cells through said switch, thereby providing, at an output of said switch, subsequent and deadlock-free transmission of consecutive cells of a certain frame, and block any cell of a different frame from interleaving.Type: ApplicationFiled: November 26, 2001Publication date: December 26, 2002Inventors: Michel Colmant, Ferdinand Gramsamer, Cyriel Minkenberg
-
Publication number: 20020118689Abstract: The invention proposes a switching arrangement for transporting data packets which comprise a data packet destination information and a payload, to one or more output ports. The switching device is able to route the arriving data packets according to the data packet destination information, to at least one dedicated of the output ports. It comprises at each input port an input buffer with at least as many single input queues as there are output ports, and an input controller for each input port, serving for controlling the order of multiplexing the data packets from the input queues of the corresponding input buffer to the switching device. The total of input ports is divided up into several subsets of input ports. Each subset in the switching device has its separate output buffer for storing at addresses therein at least the payload of each data packet arriving at the input port. At least one set of as many output queues as the switching arrangement has output ports are arranged.Type: ApplicationFiled: September 27, 2001Publication date: August 29, 2002Inventors: Ronald P. Luijten, Cyriel Minkenberg, Norbert Schumacher, Juergen Koehl, Bernd Leppia
-
Publication number: 20020064156Abstract: The invention is related to a switching arrangement for transporting data packets which comprise a section with data packet destination information and a payload section, to one or more output ports. The switching device is able to route the arriving data packets according to the data packet destination information, to at least one dedicated of the output ports. It comprises at each input port an input buffer with at least as many single input queues as there are output ports, and an input controller for each input port, serving for controlling the order of multiplexing the data packets from the input queues of the corresponding input buffer to the switching device.Type: ApplicationFiled: April 20, 2001Publication date: May 30, 2002Inventor: Cyriel Minkenberg