Patents by Inventor Phuoc Tran-Gia

Phuoc Tran-Gia 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: 20070195701
    Abstract: The invention is related to a method for resilient multi-paths connections between edge devices of a communication network. First are determined connection-specific traffic distribution functions for the multi-paths depending on a plausible failure pattern of active and inactive paths of the multi-path of this connection. Further is selected the traffic distribution function for a multi-path depending on the current failure pattern of active an inactive paths of the multi-path of this connection and is distributed the traffic of the connection onto the path of the corresponding multi-path pursuant to the selected traffic distribution function. An essential advantage of the invention is a significant decrease of network capacity for resilient multi-path connections. Another advantage of the invention is the short reaction time in case of an outage of one or more path of the multi-path connections.
    Type: Application
    Filed: September 3, 2004
    Publication date: August 23, 2007
    Inventors: Michael Menth, Jens Milbrandt, Andreas Reifert, Phuoc Tran-Gia
  • Publication number: 20060230111
    Abstract: Method for allowing peer-to-peer data transmission The invention relates to a method for allowing peer-to-peer data transmission between peer communication terminals. In this context, a file (D), for which multiple requests regarding retrieval have already been sent to an index server (IS) by peer communication terminals in the past, is automatically retrieved from a peer communication terminal (P3) providing this file by a storage peer communication terminal (SP). This file (D) is stored in the storage peer communication terminal (SP). The storage peer communication terminal (SP) registers as a provider of this file with the index server (IS). Upon receiving a further request relating to this file (D), the index server provides the requesting peer communication terminal with an address for the storage peer communication terminal in order to allow the requesting peer communication terminal to retrieve the file (D) from the storage peer communication terminal (SP).
    Type: Application
    Filed: January 3, 2006
    Publication date: October 12, 2006
    Applicant: Siemens Aktiengesellschaft
    Inventors: Frank-Uwe Andersen, Hermann De Meer, Ivan Dedinski, Tobias Hossfeld, Cornelia Kappler, Andreas Maeder, Jens Oberender, Phuoc Tran-Gia, Kurt Tutschku
  • Publication number: 20060056299
    Abstract: The invention relates to a method for determining limits for the access control of traffic that is to be transmitted via a communication network. The limits are fixed in such a way that no overload situation can occur in the network; the probability of rejection of traffic flows is, wherever possible, is independent from the point of entry into said network; and resources are used as efficiently as possible. On the basis of limits wherein no overload situation occurs, the limits for the traffic control are raised in such a way that the blocking probability for traffic transmitted between pairs of marginal modes is lowered at the same time. The lowereing of said blocking probability is maintained if an overload situation were to occur in the network.
    Type: Application
    Filed: January 14, 2004
    Publication date: March 16, 2006
    Inventors: Michael Menth, Jens Milbrandt, Phuoc Tran-Gia
  • Publication number: 20060034306
    Abstract: A method for transferring a queue position for a peer communication terminal is provided. This method involves a first peer communication terminal receiving a request message from a second peer communication terminal, the request message being used to request connection setup between the first and second peer communication terminals for retrieval of a file. The second peer communication terminal is then put into a file-retrieval queue on the first peer communication terminal. The first peer communication terminal sends an information message to the second peer communication terminal as soon as the second peer communication terminal has reached a predetermined position in the queue. The transmission of the information message is terminated by a proxy node before the information message reaches the second peer communication terminal. The proxy node transfers the predetermined position in the queue to a third peer communication terminal.
    Type: Application
    Filed: April 29, 2005
    Publication date: February 16, 2006
    Applicant: Siemens Aktiengesellschaft
    Inventors: Frank-Uwe Andersen, Hermann De Meer, Ivan Dedinksi, Toblas Hossfeld, Cornella Kappler, Andreas Maeder, Jens Oberender, Phuoc Tran-Gia, Kurt Tutschku
  • Publication number: 20050267990
    Abstract: The invention relates to a method for ascertaining an address for a peer communication terminal which holds a file. If peer communication terminals (P1, P2) repeatedly send request messages (N1, N2) to a first index server (IS1), with the request messages relating to a file (D) and with the first index server (IS1) not storing an address for a peer communication terminal which holds this file (D), then an interrogation device (AE) automatically ascertains an address (IP3) for a peer communication terminal (P3) which holds this file (D). This address (IP3) is transmitted to the first index server (IS1) by the interrogation device (AE). The first index server (IS1) then stores this address (IP3), so that when a further request message relating to this file appears the first index server (IS1) is able to provide this address (IP3) in response to the further request message.
    Type: Application
    Filed: April 29, 2005
    Publication date: December 1, 2005
    Applicant: Siemens Aktiengesellschaft
    Inventors: Frank-Uwe Andersen, Hermann Meer, Ivan Dedinksi, Tobias Hossfeld, Cornelia Kappler, Andreas Maeder, Jens Oberender, Phuoc Tran-Gia, Kurt Tutschku
  • Publication number: 20050249224
    Abstract: A method for making contact between a peer communication terminal and an index server for providing peer-to-peer data transmission is provided. The method involves a peer communication terminal associated with a first telecommunication network sending a make-contact message addressed to a first index server. This make-contact message is transmitted to a proxy node in the first telecommunication network. The proxy node terminates the transmission of the make-contact message, and the proxy node then prompts contact to be made between the peer communication terminal and a second index server, which is arranged in the first telecommunication network.
    Type: Application
    Filed: April 29, 2005
    Publication date: November 10, 2005
    Applicant: Siemens Aktiengesellschaft
    Inventors: Frank-Uwe Andersen, Hermann De Meer, Ivan Dedinksi, Tobias Hossfeld, Cornelia Kappler, Andreas Maeder, Jens Oberender, Phuoc Tran-Gia, Kurt Tutschku
  • Publication number: 20030185153
    Abstract: Touting is one of the key issues in networks for communication of data. Conventionally, the optimization of the routing for a particular network is achieved by improving/changing/expanding the routing protocol. In order to optimize the routing of data networks without varying existing routing protocols, the present invention provides a method and a system for optimizing the routing of data to be communicated in a network. In particular, the invention achieves an improved control for routing data traffic in a network by a minimization of link costs between nodes of the network.
    Type: Application
    Filed: December 23, 2002
    Publication date: October 2, 2003
    Inventors: Stefan Khler, Dirk Staehle, Ute Kohlhaas, Phuoc Tran-gia
  • Patent number: 4680784
    Abstract: With the aid of a traffic simulator telephone exchanges can be tested, the simulator imitating the traffic conditions in the exchange. To that end, the traffic simulator of the invention comprises, in addition to circuit means for simulating subscriber and line behavior, a program-controlled control arrangement connected thereto which generates random variables such as call distances, call durations and reaction periods, controls the test run and checks the reactions of the exchange, and also mixes the exchange-technical parameters. To obtain a realistic picture of the traffic conditions, a plurality of subscriber and line simulation are provided which are changeable in dependence on the reaction of the exchange. On the basis of the exchange reaction (signifying an event) a realistic picture of the external conditions of the exchange are obtained by linking such reactions with random variables and event instants.
    Type: Grant
    Filed: December 23, 1985
    Date of Patent: July 14, 1987
    Assignee: U.S. Philips Corporation
    Inventors: Ralf Lehnert, Phuoc Tran-Gia, Wolfram Lempennau