Patents by Inventor Gerard Damm
Gerard Damm 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: 20080056254Abstract: A diagnostic tool and method are described herein that are capable of diagnosing and localizing a multicast connectivity flow fault within a layer 2 aggregation network. In one application, the diagnostic tool and method can be used by a customer service representative to diagnose why a customer cannot receive a television channel even though they can receive other television channels within an IPTV network.Type: ApplicationFiled: August 31, 2006Publication date: March 6, 2008Applicant: ALCATELInventors: Kamakshi Sridhar, Atiya Suhail, David Elie-Dit-Cosaque, Gerard Damm
-
Publication number: 20080049763Abstract: A bridge/router and method are described herein that are capable of avoiding packet replication at layer 2 where there is a failure in a network. In one embodiment, the bridge/router is informed about a fault which occurred within the network. Then, the bridge/router makes a determination about whether or not multiple LSPs would be used to flood/carry the same IP traffic out off a single port. If yes, the first bridge/router chooses one of the LSPs to carry the IP traffic out the single port and then prevents the IP traffic from being carried on the remaining LSP(s) out the single port which avoids the packet replication on a link which is associated with the single port. If no, then the first bridge/router allows the IP traffic to be carried on the LSPs out off more than one port.Type: ApplicationFiled: August 23, 2006Publication date: February 28, 2008Applicant: ALCATELInventors: Gerard Damm, Kamakshi Sridhar, John Coulter, Gino Dion
-
Patent number: 7308561Abstract: A fast and scalable pattern making engine is presented. The engine represents variations on a Shift-And method capable of matching patterns in data streams having high speed data rates. In one aspect of the invention high speed is achieved by accessing the pattern RAM in parallel. In another aspect, the input is likened to TDM and individual slots or channels are accessed separately. The two aspects can also be combined to provide a scalable and high speed pattern matching engine. The engine is adaptable to streams of known length or more complex expressions such as regular expressions with arbitrary length.Type: GrantFiled: December 12, 2003Date of Patent: December 11, 2007Assignee: Alcatel LucentInventors: Jerome Cornet, Robert Elliott Robotham, Gerard Damm
-
Patent number: 7298728Abstract: A scheduling system and method operable with a burst switching element wherein control information is provided to the switching element via a separate Burst Header that precedes data bursts on ingress data channels. In one embodiment, a series of scheduling determinations are made in a select order such that packet treatment (i.e., processing for transmission, buffering, or packet dropping) is optimized with respect to packet loss and available buffer space. In another embodiment, control information received in the Burst Headers is utilized to reserve output data channel bandwidth to future incoming data packets in a forward-looking scheduling mechanism.Type: GrantFiled: December 23, 2002Date of Patent: November 20, 2007Assignee: Alcatel LucentInventors: Prasad N. Golla, John Blanton, Gerard Damm, Dominique Verchere, CĂ©line Haardt, Farid Farahmand
-
Publication number: 20070223493Abstract: A method and system for logical group endpoint discovery in a data communication network is disclosed. A network endpoint receives from a source a request identifying a logical group and determines whether a port associated with the endpoint is a member of the logical group. If a port associated with the endpoint is a member of the logical group, the endpoint transmits to the source a reply identifying the port and the logical group. The request may be multicast while the reply may be unicast. The logical group may be a VLAN or a multicast group. The source and endpoint are preferably 802.1 ag maintenance endpoints. The request may include an IEEE 802.1 ag continuity check multicast address as a destination address.Type: ApplicationFiled: August 30, 2006Publication date: September 27, 2007Inventors: Kamakshi Sridhar, David Elie-Dit-Cosaque, Gerard Damm
-
Patent number: 7158510Abstract: A look-up table (LUT)-based arbitration (LTA) system and methodology for use in a network switch element. Input control signals generated by ingress and egress entities associated with a cross-connect matrix of the network switch element are encoded into address information that is used for interrogating a storage structure. Pre-computed arbitration results based on a select arbiter scheme are stored into fields associated with the storage structure. When a particular input combination is applied with respect to an arbitration iteration, a selected arbitration result is obtained by querying the appropriate field, which is then decoded into a corresponding selected entity for the arbitration iteration.Type: GrantFiled: February 14, 2002Date of Patent: January 2, 2007Assignee: AlcatelInventors: Prasad N. Golla, Gerard Damm, John Blanton, Dominique Verchere
-
Publication number: 20060285501Abstract: Performance measurements for a network, such as delay, delay variation, and loss, are performed over layer-2. A PM frame is sent from a source MEP (Maintenance End Point) to a destination MEP. The PM frame is timestamped immediately prior to transmission, and the local clock at the destination MEP is noted immediately upon arrival. MIPs (Maintenance Intermediate Points) may also time stamp the PM frame. Preferably, each PM frame has an interval (session) identifier and a sequence number within the interval. The PM frames are received by and sent by PM modules within the nodes of the network. The PM modules include a Sender function for sending an interval of one or more PM frames and a Receiver function for receiving PM frames and computing measurements.Type: ApplicationFiled: May 16, 2006Publication date: December 21, 2006Inventor: Gerard Damm
-
Publication number: 20060165049Abstract: A selective, flow-based datapath architecture is described. A Flow Control Block Manager (FCBM) is located in a flow-based datapath for selectively and intelligently processing packets in the Flow Path. If, according to the FCBM, efficiency gains can be achieved by creating a flow control block and employing flow-based processing on a packet stream, the packets are processed accordingly. If, however, insufficient gains are anticipated the packets are processed in a flow-unaware manner. The FCBM determines the manner in which to process packets based on a set of criteria.Type: ApplicationFiled: October 28, 2004Publication date: July 27, 2006Applicant: ALCATELInventors: Bashar Bou-Diab, Lyle Strub, Milan Zoranovic, Gerard Damm, Jerome Cornet
-
Patent number: 7023840Abstract: A scheduling system and methodology for use in a network switch element having multiserver, multiple-arbiter architecture. Ingress ports and egress ports coupled to the cross-connect fabric of the network element are provided with multiple ingress and egress arbiters, respectively, for effectuating an iterative arbitration strategy such as RGA or RG. Arbiter architectures include singe-arbiter-per-port; single-arbiter-per-server; multiple-arbiters-per-port; and multiple-arbiters-per-server arrangements, wherein the arbiters can be implemented using RRA, BTA, Flexible Ring, or any other arbiter technology. Depending on the iteration strategy, ingress arbiter architecture and egress arbiter architecture, a variety of iterative, multiserver-capable scheduling algorithms can be obtained, which scheduling algorithms can also be implemented in QoS-aware network nodes.Type: GrantFiled: January 28, 2002Date of Patent: April 4, 2006Assignee: AlcatelInventors: Prasad N. Golla, Gerard Damm, John Blanton, Mei Yang, Dominique Verchere, Hakki Candan Cankaya, Yijun Xiong
-
Patent number: 7007123Abstract: A binary-tree-based arbitration system and methodology with attributes that approximate a Generalized Processor Sharing (GPS) scheme for rendering fairer service grants in an environment having a plurality of competing entities. Arbitration based on probabilistic control of arbiter nodes' behavior is set forth for alleviating the inherent unfairness of a binary tree arbiter (BTA). In one implementation, BTA flag direction probabilities are computed based on composite weighted functions that assign relative weights or priorities to such factors as queue sizes, queue ages, and service class parameters. Within this general framework, techniques for desynchronizing a binary tree's root node, shuffling techniques for mapping incoming service requests to the BTA's inputs, and multi-level embedded trees are described.Type: GrantFiled: March 28, 2002Date of Patent: February 28, 2006Assignee: AlcatelInventors: Prasad N. Golla, Gerard Damm, Timochin Ozugur, John Blanton, Dominique Verchere
-
Publication number: 20050132107Abstract: A fast and scalable pattern making engine is presented. The engine represents variations on a Shift-And method capable of matching patterns in data streams having high speed data rates. In one aspect of the invention high speed is achieved by accessing the pattern RAM in parallel. In another aspect, the input is likened to TDM and individual slots or channels are accessed separately. The two aspects can also be combined to provide a scalable and high speed pattern matching engine. The engine is adaptable to streams of known length or more complex expressions such as regular expressions with arbitrary length.Type: ApplicationFiled: December 12, 2003Publication date: June 16, 2005Applicant: AlcatelInventors: Jerome Cornet, Robert Robotham, Gerard Damm
-
Publication number: 20050132044Abstract: A virtual router network (VRN) for performing real-time flow measurements (RTFM) is provided. The VRN effectively reduces the number of traffic metering points required thereby simplifying the aggregation and exportation of flow records to a collector. The collector may be service manager in a network management system. The metering points, in a preferred embodiment, are at virtual interfaces (VI) which are edge nodes in VRN. One of the virtual interfaces is selected as a master virtual interface and act as a collector and distributor of flow related information. In one aspect of the invention the VRN is used to provide, non-invasively, per-flow delay monitoring in a communication system.Type: ApplicationFiled: December 12, 2003Publication date: June 16, 2005Applicant: AlcatelInventors: Pierrick Guingo, Vincent Mouilleron, Arnold Jansen, Gerard Damm
-
Publication number: 20050108428Abstract: A frame work to build and use a generic content switch is provided. The applications and the routing policy for the content switch are provided by the application provider. The content switch, however, is managed by a network provider so that there is a clear separation of the switching action and the switching policy. The basic framework consists of two key elements; a content switch and a user-defined application that also contains the switching policy.Type: ApplicationFiled: November 19, 2003Publication date: May 19, 2005Applicant: AlcatelInventors: Jerome Cornet, Gerard Damm
-
Publication number: 20050050060Abstract: A disjoint graph structure for packet classification in communication systems is presented. The disjoint graph is comprised of two types of data structures; an elementary interval tree (EIT) and a disjoint interval tree (DIT). The disjoint graph is constructed based on a range-specified rule set finding particular application in the classification of data packets. Each rule in the rule set has an equal number of fields and each field specifies a range referred to as an integer interval having a lower and an upper bound. The disjoint graph has the same number of layers as there are fields in each rule. The layers are comprised of nodes, and each node has an associated rule set selected from the range-specified rule set. The disjoint graph enables packet classification in only one pass through the tree. The EIT and DIT structures are also presented in detail.Type: ApplicationFiled: August 27, 2003Publication date: March 3, 2005Inventors: Gerard Damm, Bashar Bou-Diab, Yuke Wang, Yun Zhang, Yiyan Tang, Anand Krishnamurthy, Lie Qian
-
Publication number: 20040120276Abstract: A scheduling system and method operable with a burst switching element wherein control information is provided to the switching element via a separate Burst Header that precedes data bursts on ingress data channels. In one embodiment, a series of scheduling determinations are made in a select order such that packet treatment (i.e., processing for transmission, buffering, or packet dropping) is optimized with respect to packet loss and available buffer space. In another embodiment, control information received in the Burst Headers is utilized to reserve output data channel bandwidth to future incoming data packets in a forward-looking scheduling mechanism.Type: ApplicationFiled: December 23, 2002Publication date: June 24, 2004Inventors: Prasad N. Golla, John Blanton, Gerard Damm, Dominique Verchere, Celine Haardt, Farid Farahmand
-
Publication number: 20040114530Abstract: The resilient packet ring (RPR for short) is receiving much attention as a telecommunications network architecture. The RPR consists of dual counter-rotating ringlets and implements a ring protection scheme such as ring wrap and source steering. Topology discovery is an important aspect of the network management of the RPR. Herein described is a new topology discovery algorithm which performs in multiple phases. According to one phase of the algorithm, a station on the ring periodically exchange with only its neighboring stations a control messages containing a topology database. The topology database indicates addresses of stations on the ring and their link status. The algorithm should find applications not only in RPR but also other ring architectures.Type: ApplicationFiled: December 16, 2002Publication date: June 17, 2004Applicant: Alcatel Canada Inc.Inventors: Jerome Cornet, Gerard Damm, Milan Zoranovic
-
Publication number: 20040103179Abstract: Among networks of ring configuration, the dual ring topology with source steering or wrapping capabilities offers numerous advantages over a single ring topology. In the management of a ring network, problems consist in making sure that every node in the ring is aware of the current ring topology. If, however, two or more links fail even in a dual ring network, the propagation of discovery packets is not guaranteed. A new topology discovery technique is disclosed. In accordance with one aspect of the invention, the algorithm uses only one discovery packet format and a set of timers for a variety of actions to be performed at each node on the ring. The protocol finds valuable applications in RPR and many similar network architectures.Type: ApplicationFiled: November 26, 2002Publication date: May 27, 2004Applicant: Alcatel Canada Inc.Inventors: Gerard Damm, Milan Zoranovic, Qunwei Chen
-
Publication number: 20040022240Abstract: A bufferless network (e.g., optical burst network) and a method for executing a routing strategy that deflects a minimum number of packets in the bufferless network are described herein. The bufferless network includes a group of nodes (e.g., routers) and a set of links (e.g., paths) that connect together the nodes. Each node executes the routing strategy that deflects a minimum number of packets to unfavorable nodes instead of to favorable nodes that are closer to their final destination nodes. Three different embodiments of the routing strategy are described herein.Type: ApplicationFiled: July 31, 2002Publication date: February 5, 2004Applicant: AlcatelInventors: Saad Mneimneh, Gerard Damm, Dominique Verchere, Franck Quessette
-
Publication number: 20030188065Abstract: A binary-tree-based arbitration system and methodology with attributes that approximate a Generalized Processor Sharing (GPS) scheme for rendering fairer service grants in an environment having a plurality of competing entities. Arbitration based on probabilistic control of arbiter nodes' behavior is set forth for alleviating the inherent unfairness of a binary tree arbiter (BTA). In one implementation, BTA flag direction probabilities are computed based on composite weighted functions that assign relative weights or priorities to such factors as queue sizes, queue ages, and service class parameters. Within this general framework, techniques for desynchronizing a binary tree's root node, shuffling techniques for mapping incoming service requests to the BTA's inputs, and multi-level embedded trees are described.Type: ApplicationFiled: March 28, 2002Publication date: October 2, 2003Inventors: Prasad N. Golla, Gerard Damm, Timucin Ozugur, John Blanton, Dominique Verchere
-
Publication number: 20020176431Abstract: A scheduling system and methodology for use in a network switch element having multiserver, multiple-arbiter architecture. Ingress ports and egress ports coupled to the cross-connect fabric of the network element are provided with multiple ingress and egress arbiters, respectively, for effectuating an iterative arbitration strategy such as RGA or RG. Arbiter architectures include singe-arbiter-per-port; single-arbiter-per-server; multiple-arbiters-per-port; and multiple-arbiters-per-server arrangements, wherein the arbiters can be implemented using RRA, BTA, Flexible Ring, or any other arbiter technology. Depending on the iteration strategy, ingress arbiter architecture and egress arbiter architecture, a variety of iterative, multiserver-capable scheduling algorithms can be obtained, which scheduling algorithms can also be implemented in QoS-aware network nodes.Type: ApplicationFiled: January 28, 2002Publication date: November 28, 2002Inventors: Prasad N. Golla, Gerard Damm, John Blanton, Mei Yang, Dominique Verchere, Hakki Candan Cankaya, Yijun Xiong