EP1900184A2 - Procede de gestion de messages dans un reseau de pairs - Google Patents
Procede de gestion de messages dans un reseau de pairsInfo
- Publication number
- EP1900184A2 EP1900184A2 EP06778992A EP06778992A EP1900184A2 EP 1900184 A2 EP1900184 A2 EP 1900184A2 EP 06778992 A EP06778992 A EP 06778992A EP 06778992 A EP06778992 A EP 06778992A EP 1900184 A2 EP1900184 A2 EP 1900184A2
- Authority
- EP
- European Patent Office
- Prior art keywords
- message
- peer
- depositor
- call
- network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Withdrawn
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M3/00—Automatic or semi-automatic exchanges
- H04M3/42—Systems providing special services or facilities to subscribers
- H04M3/50—Centralised arrangements for answering calls; Centralised arrangements for recording messages for absent or busy subscribers ; Centralised arrangements for recording messages
- H04M3/53—Centralised arrangements for recording incoming messages, i.e. mailbox systems
- H04M3/533—Voice mail systems
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/104—Peer-to-peer [P2P] networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04M—TELEPHONIC COMMUNICATION
- H04M7/00—Arrangements for interconnection between switching centres
- H04M7/006—Networks other than PSTN/ISDN providing telephone service, e.g. Voice over Internet Protocol (VoIP), including next generation networks with a packet-switched transport layer
- H04M7/0063—Networks other than PSTN/ISDN providing telephone service, e.g. Voice over Internet Protocol (VoIP), including next generation networks with a packet-switched transport layer where the network is a peer-to-peer network
Definitions
- the present invention relates to a messaging service and more particularly to a message management method in a peer-to-peer telecommunications network.
- the messages are registered in peers of the peer network, but it is not necessary that the devices depositing or receiving the message themselves be peers of this network.
- the invention can in particular be used for voice or videophone messages.
- a message may be constituted by any computer file.
- the present invention based on a peer-to-peer architecture telecommunications network, solves the aforementioned drawbacks.
- each peer terminal of the network can both operate as a server or a client.
- the invention is directed to a message management method in which a first device, called “depositor” wishes to send a message to a second device called “recipient”. This process comprises the following steps:
- peer depository a peer of the peer network
- the invention advantageously uses the very abundant resources of network peers, thus eliminating infrastructure costs for the operator (maintenance, calculation, storage).
- the messages are in practice stored in the hard disks of these computers.
- the invention also has the advantage of not requiring the acquisition of a dedicated answering machine, the peers being in practice constituted by personal computers connected to the network for other purposes (Internet access in particular). It will be noted already that the depositor device and the destination device are not necessarily network peers.
- the messaging service can work regardless of the requestor, and especially in the case of calls from third-party networks.
- the invention differs from the known information sharing systems on peer networks (and in particular KAZAA), since the messages deposited are intended for a particular recipient.
- the invention provides a call router for implementing the aforementioned message management method.
- This call router includes:
- peer depositary means for identifying, in the peer network, at least one peer, called “peer depositary”, available and having sufficient resources to record the message
- the call router according to the invention has two main functions, on the one hand, to identify at least one available peer and having sufficient resources to record a message, and on the other hand to establish a communication flow between the depositing device and this depositary peer.
- the invention relates to a call routing method comprising: a step of receiving, in a signaling flow, a first call request from a first device, called an "applicant", the applicant wishing to establish a communication with a second device called “recipient”, to send him a message;
- peer depository a step to identify, in a peer network, at least one peer, called “peer depository”, available and having sufficient resources to record the message;
- the routing method according to the invention can be implemented in a call router as mentioned above.
- this method may be implemented in a distributed manner by a plurality of network peers.
- the protocol used for the signaling is preferably in accordance with the SIP protocol as defined by the Internet Engineering Task Force (IETF) in the document RFC 3261.
- IETF Internet Engineering Task Force
- any other signaling protocol may be used, including the H323 and MGCP protocols.
- the call router according to the invention comprises:
- this information is broadcast spontaneously by network peers adapted to implement a method of recording messages.
- the call router is adapted to send a request to an even device to know whether it is suitable or not to implement the message recording method and to receive, if necessary, the aforementioned information in response to this request.
- the identification means of the call router are adapted: to preselect the depositary peer in the aforementioned list; and
- the call router ensures that the depositary peer is actually available and has the necessary resources at the time of recording the message.
- this request can be of two types. According to a first type, this request makes it possible to explicitly ask if the resources available to record the message are present in the depositary peer. According to a second type, this request requests the amount of available resources, and the call router determines by itself whether these are sufficient for the depositary peer to record the message.
- the call router may also, in one embodiment, explicitly send a request to reserve the depository peer resources necessary to receive and store the message, when the call router has determined that these resources are sufficient.
- the call router inserts in the reservation request, an identifier of the applicant and the recipient of the message As detailed below, these identifiers may in particular allow the depositary peer to generate a personalized invitation message for the message depositor. .
- the recipient ID may also allow the receiving peer to later contact the recipient to notify him of the message record.
- the call router comprises means for obtaining from the peer peer, via the peer network, a record state of the message, and means for sending this state to the applicant, in the signaling flow. .
- the call router controls the state of the recordings made on the peer network, and is able to contact the various recipients to notify them of recorded messages and intended for them.
- the call router identification means are adapted to select the applicant as a peer custodian if the applicant is a peer of the peer network, and if he actually has available capabilities to record the message.
- This feature advantageously makes it possible to establish a local communication flow within the peer applicant which, on the one hand, avoids cluttering the telecommunications network, and on the other hand, secures the recording of the message since it is done locally.
- the identification means of the call router are also adapted to select the recipient as a peer depository if it is a peer of the peer network and if it actually has available capacity to record the message.
- this feature can be implemented when a communication flow can be established with the recipient peer, but that it is not available to directly receive the message of the applicant.
- the calling router will select the recipient for the registration of this message, thereby ensuring that the message is stored in the resources. the recipient, who can retrieve the message later, even if the applicant is no longer available.
- the invention is directed to a device capable of being connected to a peer network for the implementation of the message management method as mentioned above.
- This device comprises: means for sending on the peer network, information according to which it is adapted to implement a method of recording messages;
- the invention relates to a message recording method, capable of being implemented by an even device in a peer network.
- This process comprises:
- the depository device is adapted to generate an invitation message from the recipient identifier extracted from the reservation request received from the call router, and to send this message. invitation for the applicant, in the communication flow.
- the depositing device further comprises means for fragmenting the message into a plurality of parts and for identifying network peers. peers adapted to store a replication of the message or at least one of the parts.
- fragmentation of the message makes it possible in particular to increase the speed of downloading of the latter by the recipient. It guarantees the persistence of the parts of the message in case of disconnection of peers.
- the depository peer comprises means for extracting from the reservation request at least one identifier of the recipient of the message and means for generating an identifier of this message, and where appropriate of each part of this message.
- the peer device according to the invention comprises means for sending to the applicant, when the message has been memorized successfully, an acknowledgment message in the communication stream and / or acknowledgment information in the signaling channel. This information (respectively this message) of acknowledgment reassures the applicant as to the success of the recording of his message.
- the peer device comprises means for sending, to the call router, via the peer network, a second acknowledgment information when the message has been stored successfully.
- the depositing device comprises means for sending to the depositor, during the entire duration during which the communication flow is established, a call back message in the communication flow and / or callback information in the signaling channel.
- This information may for example be constituted by a small visual animation that runs on the terminal of the applicant.
- the depository device according to the invention comprises the traditional features of answering machines.
- the depository device comprises means for sending in the communication stream a confirmation message, to propose to the user of the depositor device to listen again, modify or delete the message, and means for retransmitting the message in the communication stream, replace it or delete it in the resources according to the response to the confirmation message.
- the different steps of the routing method and / or the recording method are determined by computer program instructions.
- the invention also relates to a computer program on an information carrier, this program being capable of being implemented in a call router or a computer, this program comprising instructions adapted to the implementation implement steps of the routing method as mentioned above when executed by this call router or this computer.
- the invention also relates to a computer program on an information medium, this program being capable of being implemented in a computer, this program comprising instructions adapted to the implementation of a recording method such as as mentioned above, when executed by this computer.
- These programs can use any programming language, and be in the form of source code, object code, or intermediate code between source code and object code, such as in a partially compiled form, or in any other form desirable shape.
- the invention also relates to a computer-readable information medium, comprising instructions by executing the steps of a routing method or a recording method as mentioned above.
- the information carrier may be any entity or device capable of storing the program.
- the medium may comprise storage means, such as a ROM, for example a CD ROM or a microelectronic circuit ROM, or a magnetic recording means, for example a floppy disk or a hard disk.
- the information medium may be a transmissible medium such as an electrical or optical signal, which may be conveyed via an electrical or optical cable, by radio or by other means.
- the program according to the invention can be downloaded in particular on an Internet type network.
- the information carrier may be an integrated circuit in which the program is incorporated, the circuit being adapted to execute or to be used in the execution of the method in question.
- FIG. 1 represents a call router and a depositary device according to the invention as well as the various information exchanged between the different devices involved in the recording of a message according to a message management method according to the invention. in a preferred embodiment;
- FIG. 2 represents, in flowchart form, the main steps of a call routing method according to the invention in a preferred embodiment
- FIG. 3 represents, in flowchart form, the main steps of a message recording method according to the invention in a preferred embodiment.
- FIG. 1 there is shown a network of peers 1, to which several even devices 10, PR, Y, 12 and 13 are connected.
- the equipment represented by round or oval shapes are peers. They are connected to peer network 1 by links 2.
- Each of these peer devices is typically constituted by a computer, whose known processing means (CPU, ROM, RAM, ...) have not been represented for the sake of clarity.
- This figure shows the storage means HD (for example hard disks), even devices PR, 12 and 13.
- peer device 12 and the peer device PR are adapted to implement a message recording method according to the invention.
- these devices comprise a recording medium 52 (for example a memory) in which is recorded a computer program PG2 comprising instructions for the execution of the steps of the recording method whose flowchart is given in FIG.
- the X and Y devices use the SIP call control protocol.
- the devices depositing X and recipient Y are known to those skilled in the art and do not form part of the invention. They can be constituted for example by telephone or videophone terminals.
- the SIP proxy 10 is a call router according to the invention. It comprises a memory 50 in which a computer program PG1 is recorded comprising instructions for executing the steps of the call routing method according to the invention and whose flowchart is shown in FIG. 2.
- the SIP proxy 10 is connected to the peer network 1 by a link 2.
- the SIP proxy 10 maintains an LPR list of peers 12, PR adapted to implement the method of recording messages according to the invention.
- the SIP proxy 10 is adapted to send regularly, during a step E02, a request REQ1 to all the peers of the peer network 1 to obtain the identifiers 12, PR of the peers implementing the method message recording.
- This request REQ1 is received, in particular by the peers PR and 12, during a step FlO.
- these peer devices PR, 12 respond to this request REQ1 by a REPFN information received by the SIP proxy 10 in step E05.
- the SIP proxy 10 updates the list of LPR peers.
- peer devices implementing the message recording method may spontaneously send the REPFN information to the SIP proxy 10 which updates the LPR list upon receipt of that spontaneous transmission.
- step E02 is done regularly so that the LPR list is kept up to date.
- the SIP proxy 10 deletes the entry corresponding to this peer in the LPR list.
- the depositor device X wishing to establish a call with the recipient Y, sends, via its client SIP, an INV1 request to the call router 10 constituted here by a SIP proxy server.
- the SIP proxy 10 is a traditional proxy server role. Consequently, when it receives the request INV1 (step ElO), it sends (step E15) a call request INV2 to the destination Y, in the signaling flow FS.
- the recipient Y is busy, or at least he can not receive the message from the applicant X.
- the recipient SIP client Y sends a NOK3 response to the SIP proxy 10.
- the SIP proxy knows in static the address of the answering server to which to transfer the call of the applicant X. But, in the present invention, this address is not known a priori by the proxy 10. It must be sought dynamically.
- the call router 10 upon receipt of the NOK3 failure notification (step E20), the call router 10 sends a repository peer PR registered in the LPR list a REQ2 request to check if it is available and if it has resources to record the message M (step E35). In this example, it will be assumed that the call router 10 sends this request REQ2 to the peer device 12 first, but that it is not available because disconnected from the peer network 1.
- the proxy 10 After a while, receiving no response to the REQ2 request, the proxy 10 sends this REQ2 request again to another peer depository PR LPR list. This request
- REQ2 is received by the depositary peer PR during a step F15 of the message recording method according to the invention.
- step F15 the depositary peer PR returns to the proxy 10, via the peer network 1, information that it has sufficient resources to record a message M.
- This response is received by the call router 10 during a step E40.
- the call router 10 sends, via the peer network 1, a request REQ3 to the repository peer PR to ask it to reserve resources for the recording of a message M.
- these resources consist of a memory zone of the hard disk HD of this peer PR.
- This resource reservation request REQ3 includes the applicant's identifier X and the identifier Y of the recipient of the message M.
- This request REQ3 is received during a step F20 by the depositary peer PR which reserves resources in its hard disk HD during a step F25.
- This step F25 is followed by a step F30 during which the responder device PR sends, via the peer network 1, a positive response to the SIP proxy 10.
- This positive response is received by the SIP proxy during a step E45.
- the SIP proxy 10 having identified the peer device PR as being available and with resources reserved for the recording of a message, sends, via the signaling stream FS, a request INV4 to the depositary peer PR according to the SIP protocol.
- This request INV4 is received by the depositary peer PR during a step F35. It will be assumed, in the example described here, that the depositary peer PR accepts this invitation because the necessary resources have been previously reserved (step E25).
- the depositary bank PR sends an acknowledgment notification OK5 in the signaling stream FS5 during a step F40 to the SIP proxy 10.
- This notification OK5 is received by the SIP proxy, via the signaling channel FS, during a step E50.
- the SIP proxy 10 can then establish the communication between the depositor X and the depositary bank PR, during a step E55, by sending, in the signaling channel FS, to the depositor X, a notification of OK6 acknowledgment according to the SIP protocol.
- a media flow, or communication flow, FC is thus established between the depositor X and the depositary peer PR (step E60).
- FC media flow, or communication flow, FC
- the depositary peer PR begins to send in the signaling flow FS, a call return information MRET to the SIP proxy 10 (step F45).
- the SIP proxy 10 transmits this callback information MRET to the applicant X (step E65).
- the device X may for example turn on a flashing diode.
- a call return message MRET may be sent to the device X via the communication stream FC.
- this information or this MRET callback message is maintained for the duration during which the FC communication flow is established.
- This step F45 of sending of return message MRET is followed by a step F50 during which the peer device PR extracts the identifiers X of the applicant Y of the recipient of the request REQ3 received during the step F30.
- This extraction step F50 is followed by a step F55 during which the peer device PR generates a MINV invitation message and sends this message in the communication stream FC to the destination.
- Applicant X can be customized from the recipient's identifier Y.
- the user of the device X receives the invitation message MINV during a step E70. Upon receipt of this message, it begins to send its message M so that it is recorded in the HD resources of the peer repository device PR.
- the message M is received in the communication channel FC and stored by the peer repository device PR during a step F60.
- the device depositary peer PR sends, during a step F65, a message MACK acknowledgment to the depositor X.
- this acknowledgment message MACK is sent in the communication stream FC.
- an acknowledgment information may be sent via the call router 10 into the signaling stream FS.
- the recording of the message M is completed, but in the preferred variant described here, the peer device PR sends, in the communication channel FC, during a step F70, a confirmation message MCONF proposing to the user of the device applicant X to replay, modify or delete the message M.
- the depositary peer PR having received the request BYE2 stops issuing, during a step F75, the callback information MRET in the signaling channel FS.
- the message M is then broken up and replicated on the peer network.
- the depositary peer PR fragments the message M recorded during the step F60 in several parts, two in our example (ml and m2), the identifier Y, extracted from the REQ3 request during step F50, being used to generate an identifier of the message parts.
- the peer dealer PR identifies during this same step F80 a number of peers, two in our example (peers 12 and 13) of the peer network 1 to store, independently of each other, the message parts ml and m2.
- the SIP proxy 10 sends, via the peer network 1, a request REQ4 to the depositary peer PR to know the storage status of the message in the peer network.
- This request REQ4 is received by the depositary peer PR during a step F85.
- the recording of the message having proceeded successfully the paired device PR sends, during the step F80, an STOK state to the SIP proxy 10. This state is received by the proxy 10 at during step E80.
- the recipient peer Y when the recipient peer Y reconnects to the peer network, it searches the peer network according to a method known to those skilled in the art, any messages it is addressed c ' that is, identified from its identifier Y.
- the recipient Y can then obtain his message M by any means known to those skilled in the art (downloading, telephone call to a voicemail, etc.).
Landscapes
- Engineering & Computer Science (AREA)
- Signal Processing (AREA)
- Computer Networks & Wireless Communication (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Telephonic Communication Services (AREA)
- Computer And Data Communications (AREA)
Abstract
Description
Claims
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FR0507006 | 2005-07-01 | ||
PCT/FR2006/050648 WO2007003850A2 (fr) | 2005-07-01 | 2006-06-29 | Procede de gestion de messages dans un reseau de pairs |
Publications (1)
Publication Number | Publication Date |
---|---|
EP1900184A2 true EP1900184A2 (fr) | 2008-03-19 |
Family
ID=36072082
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
EP06778992A Withdrawn EP1900184A2 (fr) | 2005-07-01 | 2006-06-29 | Procede de gestion de messages dans un reseau de pairs |
Country Status (4)
Country | Link |
---|---|
US (1) | US20090222521A1 (fr) |
EP (1) | EP1900184A2 (fr) |
JP (1) | JP2009500932A (fr) |
WO (1) | WO2007003850A2 (fr) |
Families Citing this family (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN101207579B (zh) * | 2007-08-15 | 2010-08-18 | 杨汉民 | 实现网络短信服务的服务器及其客户机间通讯方法 |
FR2924559A1 (fr) | 2007-12-04 | 2009-06-05 | France Telecom | Procede de transmission d'un message dans un reseau de pairs |
US10637920B2 (en) * | 2017-08-18 | 2020-04-28 | Digital 14 Llc | System, method, and computer program product for peer-to-peer event ordering using a two part event identifier |
Family Cites Families (12)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
JPH03208450A (ja) * | 1990-01-11 | 1991-09-11 | Fujitsu Ltd | 留守番電話装置の録音制御方式 |
WO1997023082A1 (fr) * | 1995-12-15 | 1997-06-26 | At & T Corp. | Courrier d'invite: communication de messages electroniques entre systemes de messagerie dissemblables |
US6304980B1 (en) * | 1996-03-13 | 2001-10-16 | International Business Machines Corporation | Peer-to-peer backup system with failure-triggered device switching honoring reservation of primary device |
US6366575B1 (en) * | 1996-11-01 | 2002-04-02 | Teloquent Communications Corporation | Extended access for automatic call distributing system |
CA2302460A1 (fr) * | 2000-03-27 | 2001-09-27 | Michael Stumm | Messagerie vocale pour systeme sans fil |
WO2002065329A1 (fr) * | 2001-02-14 | 2002-08-22 | The Escher Group, Ltd. | Memoire d'entreprise pour entites homologues |
US7546363B2 (en) * | 2001-07-06 | 2009-06-09 | Intel Corporation | Adaptive route determination for peer-to-peer services |
JP3821379B2 (ja) * | 2002-05-28 | 2006-09-13 | 株式会社エヌ・ティ・ティ・ドコモ | サービス提供方法及びサービス提供システム |
AU2003289788A1 (en) * | 2002-12-20 | 2004-07-14 | Nimcat Networks Inc. | Voice mail system for packet switched networks |
US7221753B2 (en) * | 2003-03-04 | 2007-05-22 | Verizon Business Global Llc | Method and system for providing network interactive voice response with intelligent call routing integration |
US7870218B2 (en) * | 2003-04-09 | 2011-01-11 | Nec Laboratories America, Inc. | Peer-to-peer system and method with improved utilization |
US20070153776A1 (en) * | 2005-12-29 | 2007-07-05 | Joseph Gigo K | Method and apparatus for routing internet telephone calls based upon the media types and formats or CODEC capabilities of the end points or destinations |
-
2006
- 2006-06-29 JP JP2008519973A patent/JP2009500932A/ja active Pending
- 2006-06-29 WO PCT/FR2006/050648 patent/WO2007003850A2/fr active Application Filing
- 2006-06-29 EP EP06778992A patent/EP1900184A2/fr not_active Withdrawn
- 2006-06-29 US US11/988,251 patent/US20090222521A1/en not_active Abandoned
Non-Patent Citations (1)
Title |
---|
See references of WO2007003850A2 * |
Also Published As
Publication number | Publication date |
---|---|
WO2007003850A2 (fr) | 2007-01-11 |
WO2007003850A3 (fr) | 2007-06-07 |
JP2009500932A (ja) | 2009-01-08 |
US20090222521A1 (en) | 2009-09-03 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
EP1599987A2 (fr) | Dispositif de gestion de communications multimedia via un reseau asynchrone et un reseau de telephone, a compensation de delai de transmission | |
FR2884091A1 (fr) | Procede de fourniture de plusieurs services de communication en groupe, un systeme de services de communication en groupe ainsi qu'une unite de serveur de services de communication en groupe. | |
EP2882161B1 (fr) | Procédé et dispositf d' établissement d'une communication | |
WO2013057437A1 (fr) | Procede d'echange d'informations relatives a des services de communication enrichie | |
EP3182671B1 (fr) | Procédé et dispositif pour un service de messagerie | |
EP1900184A2 (fr) | Procede de gestion de messages dans un reseau de pairs | |
FR2851704A1 (fr) | Procede de gestion de presence selective pour service de messagerie instantanee au sein d'un reseau de telecommunication tel que le reseau internet | |
EP1842352B1 (fr) | Systeme et procede pour etablir une relation de type client/serveur dans un reseau pair a pair | |
FR2888706A1 (fr) | Procede de mise en relation interpersonelle | |
FR3046002A1 (fr) | Gestion d'une communication entre deux terminaux de communication | |
FR2965690A1 (fr) | Procede de gestion de la priorite de flux media preliminaires | |
EP1810492B1 (fr) | Service de messagerie dans un reseau de telecommunications de type "pair a pair" | |
WO2005053264A1 (fr) | Systeme et procede de mise en relation entre au moins deux terminaux multimedia relies entre eux par un reseau fixe ou cellulaire | |
EP2068543A1 (fr) | Procédé de transmission d'un message dans un réseau de pairs | |
EP3800874A1 (fr) | Procédé et dispositif de redirection d'une requête de communication | |
FR2903841A1 (fr) | Enregistrement de communications dans un reseau de telecommunications | |
WO2019063920A1 (fr) | Procédé de gestion d'un échec d'établissement d'une communication entre un premier et un second terminal | |
EP2134060A1 (fr) | Procédé et système de communication Internet dans lequel un appelé peut choisir suivant quelle modalité il veut être joint | |
FR2919140A1 (fr) | Procede d'echange de messages entre serveur de donnees de session et services clients | |
EP3648443A1 (fr) | Gestion d'une communication entre un terminal de communication appelant, disposant d'un identifiant d'appel principal et d'un identifiant d'appel secondaire, et un terminal de communication appelé | |
EP1936934A1 (fr) | Procédé de diffusion d'un flux depuis une plate-forme de service, produit programme d'ordinateur et plate-forme de service correspondants | |
FR2855703A1 (fr) | Systeme de messagerie vocale pour les internautes | |
FR3080512A1 (fr) | Procede et systeme de detection de coupures de communications mobiles et de retablissement automatique des communications. | |
FR2991540A1 (fr) | Procede et dispositif de selection d'une entite communicante pour recevoir une signalisation d'un appel entrant | |
EP2248333A1 (fr) | Procede de gestion d'une session de communication au niveau d'une passerelle domestique |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
17P | Request for examination filed |
Effective date: 20080125 |
|
AK | Designated contracting states |
Kind code of ref document: A2 Designated state(s): AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HU IE IS IT LI LT LU LV MC NL PL PT RO SE SI SK TR |
|
DAX | Request for extension of the european patent (deleted) | ||
RIN1 | Information on inventor provided before grant (corrected) |
Inventor name: VILLEY, JEAN-CHRISTIAN Inventor name: PETION, ROMARIC Inventor name: NEVEUX, DIDIER |
|
DAX | Request for extension of the european patent (deleted) | ||
17Q | First examination report despatched |
Effective date: 20081202 |
|
GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE APPLICATION IS DEEMED TO BE WITHDRAWN |
|
18D | Application deemed to be withdrawn |
Effective date: 20120619 |