Patents by Inventor Olivier Maurel

Olivier Maurel 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).

  • Patent number: 9567839
    Abstract: A method is provided for fracturing a geological hydrocarbon reservoir, including the static fracturing of the reservoir by hydraulic pressure, and the electrical fracturing of the reservoir by generating an electric arc in a well drilled into the reservoir. This enables the improved fracturing of the reservoir.
    Type: Grant
    Filed: March 13, 2012
    Date of Patent: February 14, 2017
    Assignees: TOTAL S.A., UNIVERSITE DE PAU ET DES PAYS DE L'ADOUR
    Inventors: Franck Rey-Bethbeder, Antoine Jacques, Justin Martin, Antoine Sylvestre de Ferron, Thierry Reess, Alain Gibert, Olivier Maurel, Christian LaBorderie, Gilles Pijaudier-Cabot
  • Patent number: 9394775
    Abstract: A device is provided for fracturing a geological hydrocarbon reservoir including two packers defining between them a confined space in a well drilled in the reservoir; a pump for increasing the pressure of a fluid in the confined space; an apparatus for heating the fluid; at least one pair of two electrodes arranged in the confined space; and an electric circuit for generating an electric arc between the two electrodes, the circuit including at least one voltage source connected to the electrodes and an inductance between the voltage source and one of the two electrodes. The device permits improved fracturing of the reservoir.
    Type: Grant
    Filed: March 13, 2012
    Date of Patent: July 19, 2016
    Assignee: TOTAL S.A.
    Inventors: Franck Rey-Bethbeder, Antoine Jacques, Justin Martin, Antoine Sylvestre De Ferron, Thierry Reess, Alain Gibert, Olivier Maurel, Christian Laborderie, Gilles Pijaudier-Cabot
  • Publication number: 20140008073
    Abstract: A method is provided for fracturing a geological hydrocarbon reservoir, including the static fracturing of the reservoir by hydraulic pressure, and the electrical fracturing of the reservoir by generating an electric arc in a well drilled into the reservoir. This enables the improved fracturing of the reservoir.
    Type: Application
    Filed: March 13, 2012
    Publication date: January 9, 2014
    Applicant: TOTAL S.A.
    Inventors: Franck Rey-Bethbeder, Antoine Jacques, Justin Martin, Antoine Sylvestre de Ferron, Thierry Reess, Alain Gibert, Olivier Maurel, Christian LaBorderie, Gilles Pijaudier-Cabot
  • Publication number: 20140008072
    Abstract: A device is provided for fracturing a geological hydrocarbon reservoir including two packers defining between them a confined space in a well drilled in the reservoir; a pump for increasing the pressure of a fluid in the confined space; an apparatus for heating the fluid; at least one pair of two electrodes arranged in the confined space; and an electric circuit for generating an electric arc between the two electrodes, the circuit including at least one voltage source connected to the electrodes and an inductance between the voltage source and one of the two electrodes. The device permits improved fracturing of the reservoir.
    Type: Application
    Filed: March 13, 2012
    Publication date: January 9, 2014
    Applicant: TOTAL S.A.
    Inventors: Franck Rey-Bethbeder, Antoine Jacques, Justin Martin, Antoine Sylvestre De Ferron, Thierry Reess, Alain Gibert, Olivier Maurel, Christian Laborderie, Gilles Pijaudier-Cabot
  • Patent number: 7593321
    Abstract: A method for operating a node in a computer network is disclosed, where the network is made up of nodes connected by links. The method has the steps: determining an alternate path for one or more links; reserving resources for the alternate path; and rerouting traffic on the alternate path in case of a link failure. The alternate path may be periodically updated. A plurality of alternate paths may be maintained. The alternate paths may not have any links in common. User traffic may be rerouted substantially simultaneously to each link of the alternate path in the event of failure of a primary path.
    Type: Grant
    Filed: August 4, 2003
    Date of Patent: September 22, 2009
    Assignee: Cisco Technology, Inc.
    Inventors: Claude Galand, Olivier Bertin, Olivier Maurel, Laurent Nicolas, Aline Fichou
  • Patent number: 6934249
    Abstract: The present invention is directed to a high speed packet switching network and, in particular to a method and system for minimizing the time to establish a connection between an origin and a destination node. Due to high dynamicity of the traffic on transmission links, it is important to select a routing path according to a fully up-to-date information on all network resources. The simpler approach is to calculate a new path for each new connection request. This solution may be very time consuming because there are as many path selection operations as connection set up operations. On another hand, the calculation of paths based on an exhaustive exploration of the network topology, is a complex operation which may also take an inordinate amount of resources in large networks. Many of connections originated from a network node flow to the same destination network node. It is therefore possible to take a serious benefit in reusing the same already calculated paths for several connections towards the same node.
    Type: Grant
    Filed: May 30, 2002
    Date of Patent: August 23, 2005
    Assignee: Cisco Technology, Inc.
    Inventors: Olivier Bertin, Gerard Brun, Claude Galand, Olivier Maurel, Laurent Nicolas
  • Publication number: 20040042402
    Abstract: A method for operating a node in a computer network is disclosed, where the network is made up of nodes connected by links. The method has the steps: determining an alternate path for one or more links; reserving resources for the alternate path; and rerouting traffic on the alternate path in case of a link failure. The alternate path may be periodically updated. A plurality of alternate paths may be maintained. The alternate paths may not have any links in common. User traffic may be rerouted substantially simultaneously to each link of the alternate path in the event of failure of a primary path.
    Type: Application
    Filed: August 4, 2003
    Publication date: March 4, 2004
    Inventors: Claude Galand, Olivier Bertin, Olivier Maurel, Laurent Nicolas, Aline Fichou
  • Patent number: 6400681
    Abstract: The present invention is directed to a high speed packet switching network and, in particular to a method and system for minimizing the time to establish a connection between an origin and a destination node. A path calculated at the time the connection is requested is recorded in a Routing Database and updated each time a modification occurs in the network. Furthermore, alternate paths for supporting non-disruptive path switch on failure or preemption, and new paths towards potential destination nodes can be calculated and stored when the connection set up process is idle. These last operations are executed in background with a low processing priority and in absence of connection request.
    Type: Grant
    Filed: April 1, 1997
    Date of Patent: June 4, 2002
    Assignee: Cisco Technology, Inc.
    Inventors: Olivier Bertin, Gerard Brun, Claude Galand, Olivier Maurel, Laurent Nicolas
  • Patent number: 6246669
    Abstract: In a high speed digital network including access nodes and network nodes each having topology data bases, a method for optimizing the connection set-up operations required for connecting a calling end-user attached to a local access node to a destination user attached to a remote access node, via a conventional connection set-up operation. An Access Node Connection Table (ANCT) in each access node stores a list of every remote access node for which the local access node has at least one user connection. A field in the locate reply message is defined for the destination remote Access Node Topology Database (ANTDB) and remote ANTDB information is inserted prior to sending the reply message. Locate reply message reception is monitored by the local access node, and upon reception an entry is created for the received remote ANTDB information in the local access node unless the remote access node was already identified in the local access node. An optimal path is then selected and connection set up.
    Type: Grant
    Filed: November 17, 1998
    Date of Patent: June 12, 2001
    Assignee: Cisco Technology, Inc.
    Inventors: Denis Jean Albert Chevalier, Philippe Michel Bazot, Olivier Maurel, Eric Levy-Abegnoli, Olivier Bertin, Laurent Nicolas, Jean-Paul Chobert
  • Patent number: 6038212
    Abstract: This method enables optimizing the time required for reestablishing connections between end users attached to a data communication network, which connections were disrupted due to a network failure. The network includes access nodes and transit nodes interconnected with network links/trunks (with no specific distinction being herein required between both designations of a communication line). The end users are attached to the network through access nodes and each said access node permanently stores an image of the current network trunk including the number N.sub.i of connections currently supported by said network trunk. Upon detection of a trunk failure, each access node supporting connections affected by said failure, is made aware of the total number (N.sub.i) of connections in each priority group affected by the failure, together with a network dependent parameter (TP) representing the elementary processing time required to reroute a single network connection.
    Type: Grant
    Filed: October 7, 1997
    Date of Patent: March 14, 2000
    Assignee: International Business Machines Corporation
    Inventors: Claude Galand, Jean Bidard, Jean-Paul Chobert, Gerard Brun, Olivier Maurel, Yves Ouvry
  • Patent number: 6011804
    Abstract: A method and system for reserving dynamically and in priority for each link of the network the exact amount of bandwidth necessary for the transmission of the network control traffic. An evaluation of the expected control traffic on each link of the network is performed in order to allocate a sufficient but minimum fraction of the link bandwidth and for allocating the maximum available bandwidth for the user traffic.
    Type: Grant
    Filed: December 16, 1996
    Date of Patent: January 4, 2000
    Assignee: International Business Machines Corporation
    Inventors: Olivier Bertin, Claude Galand, Olivier Maurel
  • Patent number: 5687167
    Abstract: High speed network nodes can establish new connections by preempting existing ones when insufficient bandwidth is available in the network. Numerous preemption priorities are arranged in a limited number of groups and a median priority level is defined within each group. This median, stored in the topology database of each node of the network, permits better bandwidth utilization per group while consuming very little memory space and generating very low traffic overhead.
    Type: Grant
    Filed: November 22, 1995
    Date of Patent: November 11, 1997
    Assignee: International Business Machines Corporation
    Inventors: Olivier Bertin, Jean-Paul Chobert, Olivier Maurel, Alain Pruvost
  • Patent number: 5600638
    Abstract: The routing paths between origin and destination nodes in a packet switching network are selected more efficiently by reducing the total number of links potentially visited by the routing algorithm. The path selection technique involves two phases, the first phase for principal links identification, and the second phase for selection of the best point-to-point path in the network. Principal paths are minimum hop count paths with a transmission delay less than a specified threshold. The algorithm limits the screening of the network links in the second phase to the principal links and excludes the secondary links. The exploration of a much smaller number of links has the advantage to considerably reduce the computation time required for the path selection. The fact the number of principal links is generally small compared with the total number of links potentially explored, allows to limit the additional processing time necessary in case of unsuccessful attempt.
    Type: Grant
    Filed: December 12, 1994
    Date of Patent: February 4, 1997
    Assignee: International Business Machines Corporation
    Inventors: Olivier Bertin, Olivier Maurel
  • Patent number: 5577238
    Abstract: The auto-sequenced state machine according to the present invention has a programmable state duration which is independent from the logic speed, it may be adapted to any Moore state machine and may operate in metastability occurrence of the latches (2) of the state machine. The programming of a granularity of half a clock cycle provides a performance optimization by using a system of two clocks which are in opposite phase. Moreover, the state duration may be programmable on line. The auto-sequenced state machine is composed of a basic Moore state machine to which is connected a device (16) comprising a current state decoder (15) which decodes the current state signals Q(t) from the Moore state machine in order to select one of the biphase state timers (13) and one of the state timing programming circuits (12), and an OR circuit (11) which receives the terminal counts (TC0, . . .
    Type: Grant
    Filed: March 22, 1996
    Date of Patent: November 19, 1996
    Assignee: International Business Machines Corporation
    Inventors: Philippe Cuny, Philippe Klein, Olivier Maurel
  • Patent number: 5511078
    Abstract: The method and apparatus for correcting one B-bit block in error in a memory organized in words comprising N B-bit blocks consist of appending to the data bits to be written into the memory words a limited number of error correction bits computed from a depopulated parity check matrix which gives the capability of only correcting one block in error and improving the memory failure rate by cyclically reading each word, correcting a block found in error if any and writing the corrected data bits with the corresponding error correction bits in place of the read word.
    Type: Grant
    Filed: November 18, 1993
    Date of Patent: April 23, 1996
    Assignee: International Business Machines Corporation
    Inventors: Gerard Barucchi, Philippe Cuny, Philippe Klein, Olivier Maurel, Jean-Luc Peter
  • Patent number: 5491690
    Abstract: Currently, routing algorithms compute all the available paths in the network, from a source node to a destination node before selecting the optimal route. The route computation is often time and resource consuming. Some paths are not acceptable due to the particular geographical configuration of the network. In the real world, large transport networks are not fully meshed. The present invention is based on the observation that networks are usually built around a hierarchical structure. A set of nodes, interconnected by high throughput lines, are used to build a `Backbone` (401) with a high degree of meshing to allow the redundancy and reliability required by the user. The other nodes or `local` nodes (404) are attached to one or several backbone nodes. It is the network designer responsibility, at the configuration time to define for each node what is its attribution: backbone (402) or local node (404).
    Type: Grant
    Filed: July 22, 1994
    Date of Patent: February 13, 1996
    Assignee: International Business Machines Corporation
    Inventors: Jean-Pierre Alfonsi, Claude Galand, Gerald Lebizay, Olivier Maurel