WO2022208017A1 - Procede, dispositif et systeme de mise a disposition d'une ressource de communication - Google Patents
Procede, dispositif et systeme de mise a disposition d'une ressource de communication Download PDFInfo
- Publication number
- WO2022208017A1 WO2022208017A1 PCT/FR2022/050582 FR2022050582W WO2022208017A1 WO 2022208017 A1 WO2022208017 A1 WO 2022208017A1 FR 2022050582 W FR2022050582 W FR 2022050582W WO 2022208017 A1 WO2022208017 A1 WO 2022208017A1
- Authority
- WO
- WIPO (PCT)
- Prior art keywords
- operator
- opé
- resource
- management entity
- cooperation
- Prior art date
Links
- 238000000034 method Methods 0.000 title claims abstract description 85
- 238000004891 communication Methods 0.000 title claims abstract description 42
- 238000007726 management method Methods 0.000 claims description 80
- 238000004519 manufacturing process Methods 0.000 claims description 6
- 238000004590 computer program Methods 0.000 claims description 5
- 230000000295 complement effect Effects 0.000 abstract description 2
- 230000006870 function Effects 0.000 description 37
- 230000008569 process Effects 0.000 description 30
- 230000008901 benefit Effects 0.000 description 8
- 230000000875 corresponding effect Effects 0.000 description 8
- 238000001514 detection method Methods 0.000 description 8
- 230000005540 biological transmission Effects 0.000 description 5
- 230000009471 action Effects 0.000 description 4
- 230000002146 bilateral effect Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 238000012545 processing Methods 0.000 description 3
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 238000003860 storage Methods 0.000 description 2
- 230000003044 adaptive effect Effects 0.000 description 1
- 238000010420 art technique Methods 0.000 description 1
- 239000011449 brick Substances 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000002079 cooperative effect Effects 0.000 description 1
- 238000012517 data analytics Methods 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000004377 microelectronic Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000004321 preservation Methods 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 230000002787 reinforcement Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W16/00—Network planning, e.g. coverage or traffic planning tools; Network deployment, e.g. resource partitioning or cells structures
- H04W16/14—Spectrum sharing arrangements between different networks
Definitions
- the invention is situated in a context where operators lend each other resources with the aim of implementing a communication service.
- This loan of resources is preferably devoid of financial compensation and revolves around a collaboration estimated from a collaboration graph drawn up by an operator intended to be used to optimize collaboration with one and/or the another of the operators.
- MNOs mobile telephone operators
- This collaboration involves the establishment of a specific agreement for each operator couple and involves monetary exchanges to compensate for the asymmetry of the resources exchanged between two operators. This collaboration generally gives rise to compensation.
- this technique is not optimal on the one hand and moreover does not work any more in situations where the cooperation cannot be done systematically in a bilateral way (an operator A can provide resources to an operator B who cannot allocate resources to operator A) and where this cooperation can only be done in a circular way (an operator A can provide resources to an operator B who can provide resources C which, itself can provide resources to A) .
- This example includes 3 operators A, B, C but it is also possible to envisage collaboration with more than 3 operators.
- the known techniques do not work in particular in this type of collaboration which can be called circular collaborations which allows each operator in the circle to benefit from the resources of another operator but which cannot itself directly benefit the operator having lent him resources from his own resources.
- the invention improves the situation with the aid of a method for making a first communication resource available by a management entity of a first operator to a management entity of a second operator in an infrastructure comprising at least one third operator, the method being implemented by the management entity of the first operator and comprising:
- a pecuniary exchange can complete the method in the case where the resources made available and used by the first operator are too unbalanced but the determination of the flow of cooperation is determined to minimize and if possible make such a pecuniary exchange useless.
- the method further has the advantage of comprising learning where the collaboration of an operator during a previous exchange of resources is rewarded for a following exchange, favoring the contribution of a greater number of operators having an interest in collaborate. As a corollary, a bad contribution or a defection of an operator will be penalizing for this operator whose contribution will not be favored during a future collaboration.
- This method also allows operators to limit their investments by favoring the provision of resources by the operators and thus make maximum use of all the resources deployed by the various operators in a given space.
- the process therefore also has an interest in the preservation of resources since an operator will be able to favor the contribution to such a process rather than an investment. into new, possibly underutilized resources.
- Each operator is therefore able to limit its investment and operating expenses (radio access stations, purchase of frequencies, energy resources or even network maintenance equipment or vehicles, which can be identified as equipment contributing to the communication) .
- This process is all the more interesting in that it does not require that the first operator making resources available for a second operator has in return resources made available to him by the second operator, which can be a limitation of bilateral collaborations.
- the cooperation index comprises a maximum cooperation rate corresponding to a quantity of the second and third resources received from the management entities of the second operator and of the at least a third operator.
- the cooperation index is specific to each infrastructure management entity.
- the cooperation flow is further determined as a function of data relating to a fifth resource made available by the management entity of the second operator to destination of the management entity of the at least one third operator.
- the process is based on a virtuous circle which should enable each operator to benefit from the collaboration implemented.
- the flow of cooperation is therefore all the more promising that not only does the first operator balance its resources made available and used with the second and third operator, but also that the second and third operator find an interest in it through the resource made available. made available by the second operator to the third operator.
- the cooperation flow is determined according to the number of operators participating in the provision of the first resource.
- the flow of cooperation is advantageously determined according to the number of operators which must be as large as possible to promote future collaborations in particular as well as possibly the types of resources or even take into account the spatial constraints of resource availability.
- the number of operators involved in the process may be limited to a reduced number.
- the process is dynamic and that processes involving more or less operators can be implemented. Thus, a provision process may involve 3, 4, 5 or more operators in a context where at least 5 operators may possibly be involved.
- the provision method further comprises, following the provision of the first resource, the sending to a mediation entity of a message comprising information relating to the first resource and an identifier of the management entity of the second operator.
- the method of making available further comprises, prior to the reception of the cooperation index, the reception of information relating to the making available of the second and third resources between the entities management of infrastructure operators.
- the cooperation flow is determined according to a quantity of the first resource and a quantity of the fourth resource.
- the cooperation index is determined according to a cooperation index determined during a previous provision of a resource.
- the process is all the more interesting that it is iterative and that the cooperation index is a value that evolves according to the provision of resources taking place between the operators involved in the process. This evolution can make it possible to integrate a new operator to make it progress or to terminate the participation of an operator if it lowers the index.
- the first resource and the fourth resource are identical.
- the resources made available are identical and are for example dispersed in space, thus allowing an operator to widen his zone of operation or else in time, allowing an operator to compensate for a lack of resources during an event or a peak of activity.
- the invention also relates to a device of a first operator for making a first communication resource available to a management entity of a second operator in an infrastructure comprising at least one third operator, comprising:
- a receiver capable of receiving a cooperation index relating to a previous provision of a second resource by the management entity of the second operator and of a third resource by a management entity of the at least one third operator,
- a determination module capable of determining a cooperation flow as a function of the cooperation index received and of a datum relating to a fourth resource updated disposal of the management entity of the first operator by the management entity of the second or at least one third operator,
- a provision module capable of making the first resource available to the management entity of the second operator.
- This device capable of implementing in all its embodiments the method of making available which has just been described, is intended to be implemented in a management entity of a fixed or mobile operator network and can in particular be instantiated in a device of the PCF type of an operator's network in a virtualized form or in the form of physical equipment.
- the invention also relates to a system for making a first communication resource available by a management entity of a first operator to a management entity of a second operator in an infrastructure comprising at least one third operator including
- At least two additional management entities At least two additional management entities.
- the invention also relates to a computer program comprising instructions for the implementation of the steps of the provision method which has just been described, when this program is executed by a processor and a recording medium readable respectively by a delivery device on which the computer program is stored
- a medium may comprise a storage means, such as a ROM, for example a CD ROM or a microelectronic circuit ROM, or even a magnetic recording means.
- a storage means such as a ROM, for example a CD ROM or a microelectronic circuit ROM, or even a magnetic recording means.
- Such a storage means can for example be a hard disk, a flash memory, etc.
- an information medium can be a transmissible medium such as an electrical or optical signal, which can be conveyed via an electrical or optical cable, by radio or by other means.
- a program according to the invention can in particular be downloaded from an Internet-type network.
- an information medium may be an integrated circuit in which a program is incorporated, the circuit being adapted to execute or to be used in the execution of the method in question. 4. Brief description of drawings
- FIG 1 presents a simplified view of a multi-operator communication infrastructure using a prior art technique
- FIG 2 presents a simplified view of a communication infrastructure in which the provision method according to one aspect of the invention is implemented
- FIG 3 presents a simplified view of a communication infrastructure resulting from the implementation of the provision method according to another aspect of the invention
- FIG 4 presents an overview of the provision method according to one embodiment of the invention
- FIG 5 presents an example of maximum graph and maximum throughput of a provisioning method according to one embodiment of the invention
- FIG 6 presents an example of a provisioning method based on maximum graphs and maximum flow rates according to an embodiment of the invention
- FIG 7 presents a provisioning device according to an embodiment of the invention.
- This infrastructure can be implemented to route communication data intended for fixed or mobile terminals and the functions of this infrastructure can be, for example, virtualized functions or specific equipment used for the routing and/or processing of data from residential or business customers.
- FIG 1 presents a simplified view of a multi-operator communication infrastructure according to a technique of the prior art.
- the Infra communications infrastructure comprises three areas in which three operators Opé A, Opé B and Opé C operate communications networks, for example of the mobile type.
- the communications resources are for example communications resources of communications towers.
- the 3 operators Opé A, Opé B and Opé C have communications resources. It appears that operator Opé A has 3 communication capacities in area 1, that operator Opé B has 3 communication resources communication in area 3 and that operator Opé C has 3 communication resources in area 2.
- the Opé A, Opé B, Opé C operators can thus implement a Tit-for-Tat (TFT) technique as indicated above and thus the Opé A operator must agree with the Opé operator B (operator Opé A making available a triangular resource in exchange for a circular resource made available by operator B) and operator Opé A must also exchange resources with operator Opé C (the operator Opé A providing a triangular resource in exchange for a rectangular resource provided by operator C).
- TFT Tit-for-Tat
- FIG 2 presents a simplified view of a communication infrastructure in which the provision method according to one aspect of the invention is implemented.
- the communications infrastructure is identical to the infrastructure of [Fig 1] except that the distribution of resources in the areas Area 1, Area 2 and Area 3 is different. It should be noted that the provision method can be implemented between the Opé A, Opé B and Opé C operators regardless of the type of resources, the number of resources, or the place where the resources are available. Thus, it is possible to envisage the provision of access resources (hertzian frequencies, radio tower transmission capacity), communication network routing capacities, software resources or even energy resources.
- access resources heretzian frequencies, radio tower transmission capacity
- communication network routing capacities software resources or even energy resources.
- operator Opé A has two access capabilities represented by triangles in area 1 while operator Opé C has only one access capability and operator Opé B does not have any triangular resource in this area Area 1.
- the operator Opé B has an access capacity represented by a rectangle and the operator Opé C has two access capacities.
- the Opé A operator has an access capacity represented by a circle
- operator Opé B has two circular access capacities
- operator Opé C has no circular capacities in the area Area 3.
- each operator Opé A, Opé B and Opé C has a maximum of resources of different types (triangle, circle, rectangle) in each area while limiting the number of monetary exchanges between operators and avoiding a pecuniary exchange, which means that the exchange of resources between operators must be balanced and that each operator must receive a quantity of resources as close as possible to the resources made available. It should be noted that if an operator only exchanges resources with another operator, he will not be able to have all the diversity of resources. Thus, if operator Opé A only exchanges resources with operator Opé C, the two operators will not be able to have the circular resource since operator Opé A has only one. It is therefore appropriate to implement a new and inventive method of making available.
- the provision process is implemented between management entities of the three operators Opé A, Opé B and Opé C and for example, operator A will calculate a cooperation index for each operator Opé B and Opé C, this index being updated each time an exchange of resources, regardless of the type of resources, takes place. For example, if operator Opé B provided a large amount of resources and Opé C did not provide resources during a previous implementation of a provision of resources, the cooperation index will be modified to take into account these past releases. This index may be specific to each Opé B and Opé C operator and/or it may be an overall cooperation index relating the cooperation of the operators in the communication infrastructure.
- the operator's management entity Op A determines a cooperation flow. Indeed, operator A can make a triangle-type resource available to operator B, but he needs a resource of type rectangular that operator B cannot offer him but that operator Opé C can actually make available. It is therefore not a question of a bilateral negotiation between the operator Opé A and the operator Opé C (or the operator Opé B) but a flow of cooperation involving the three operators, the exchanges between the operators being dependent of the cooperation index but also of the volumes of resources to be made available on the one hand and to be used on the other hand to limit pecuniary exchanges.
- the nature or types of resources made available by the operators can be communicated by each operator to each of the other operators or communicated to a centralized register to which the management entities of the Opé A, Opé B and Opé C operators can access.
- a cooperation flow which can be described as circular, is implemented where the operator Opé A provides the operator Opé B with a triangle-type resource, the operator Opé B provides operator C with a resource of the circle type and operator Opé C provides operator Opé A with a resource of the rectangle type.
- This collaboration is made possible by calculating a cooperation index received by the management entity of operator Opé A, promoting collaboration with operators Opé B and Opé C, and making the triangle resource available in depending on the use of the rectangle resource, these two resources being made available or used by two distinct operators having themselves made a resource available.
- This provision can be implemented with a greater number of operators, the resources being exchanged between the operators forming a circle, according to the effective and regularly updated collaboration of the operators.
- the resources can be of the same type (for example triangles) or of a different type and it is possible to weight each resource to adjust the balance of the provisions available between the operators.
- each Opé A, Opé B and OpéC has a communication resource in each area Area 1, Area 2 and Area 3 without the Opé B operator being made available a resource intended for the operator Opé A, and therefore without reciprocity of the provision of a resource between the operators Opé A and Opé B but by making the Opé C operator and possible other operators contribute in a circular flow of cooperation.
- the 3 areas Area 1, Area 2 and Area 3 can represent a single area and it is possible to implement the provisioning method in the absence of spatial constraint.
- each Opé A, Opé B and Opé C operator includes at least one agent. (respectively 101, 201, 301) in charge of performing cooperative actions with other agents (101, 201, 301).
- An operator could, according to one example, indeed comprise more than one agent.
- the Opé A operator implements the provision process.
- the operators Opé A, Opé B and Opé C also comprise an entity 102, called a strategy function, which decides on the actions to be carried out towards the other agents 201 and 301 according to the degrees of cooperation during previous provisionings.
- operator Opé A can make radio frequencies available for a period t.
- the operator Opé A further includes a detection function 103 which detects the choice of cooperation of the other agents during a previous provision. It is in a way the symmetric function of the strategy function since it aims to detect past cooperation when the strategy function aims to decide actions during future cooperation.
- the operators Opé B and Opé C correspondingly comprise respective functions 203 and 303 of detection.
- Operator Opé A further includes a negotiation function 104 reacts to one level of cooperation by sending another level of cooperation so as to encourage cooperation from the other operators Opé B and Opé C and penalize exploitation (use of resources without make it available) and defection (withdrawal of an operator during a provision).
- a management entity 100 comprising the agent 101 and the strategy function 102 and collaborates with the detection and negotiation functions 103 and 104 to implement a provisioning method for a communication resource.
- Opé B and Opé C operators also have negotiation functions 204 and 304 corresponding to function 104.
- Agent 101 also has internal variables: Cmax (step 0: C max ): a maximum cooperation graph that the agent 101 modifies each time a provision method is implemented.
- step 0 maximum cooperation rate that the agent 101 is ready to “deliver” according to the history of the provisions and that it modifies according to whether it cooperates more or less than the other agents.
- the management entity of the Opé A operator can for example be a PCF (Policy Control Function) device of a mobile network and the functions 103 and 104 can be included for example in a device of the NWDAF type (in English Network Data Analytics Function) of a mobile network.
- PCF Policy Control Function
- NWDAF English Network Data Analytics Function
- Opé B and Opé C can also implement the provision process but each agent 201 and 301 should contribute to the process as indicated below.
- the communication infrastructure further comprises a register 401 able to communicate with the agents 101, 201, 301.
- This register can for example be a DLT (Distributed Ledger Technologies) register.
- This register 401 can be managed by one of the operators Opé A, Opé B and Opé C or else be managed by an entity external to the operators.
- the agent 101 communicates to its strategy function 102 degrees of cooperation having a value between 0.0 and 1.0 with the operators Opé B and Opé C.
- a value of 0.0 corresponds to zero cooperation and a value of 1.0 corresponds to full cooperation.
- This degree of cooperation corresponds to its willingness to perform a cooperative provision action towards the other agents 201 and 301. It is considered that the agents 201 and 301 correspondingly communicate their degrees of cooperation to their corresponding strategy functions during this same step El.
- the strategy function 102 transmits to the register 401 a message comprising the provision of frequencies (the resources being, for example, frequencies) that it can effectively execute according to the degrees of cooperation communicated during a previous provision of resources.
- the agent 101 indicates in this message, the type of resource and the volume of this resource that it can make available to each agent 201 and 301.
- This message can take the following form:
- the management entity of operator Opé A via strategy function 102, transmits the following information:
- Source agent-101
- Destination agent-201
- Resource-B 0 units
- Source agent-101
- Destination agent-201
- Resource-C 0 unit
- Source agent-101
- Destination agent-301
- Resource-A 0 units
- Source agent-101
- Destination agent-301
- Resource-B 0 units
- Source agent-101
- Destination agent-301
- Resource-C 0 unit
- agent 101 in accordance with this message, indicates that it can provide frequencies corresponding to resource A to agent 201.
- the agents 201 and 301 via the strategy functions 202 and 302, transmit a message comprising their own provision of resources. It is considered that the resources B are energy resources and the resources C are transmission capacities in a transport network.
- Policy function 202 passes the following information to register 401:
- Source agent-201
- Destination agent-101
- Resource-C 0 unit
- Source agent-201
- Destination agent-301
- Resource-A 0 units
- Source agent-201
- Destination agent-301
- Resource-C 0 units
- the strategy function 302 correspondingly, transmits during step E2 the following information to register 401:
- Source agent-301
- Destination agent-201
- Resource-A 0 units
- Source agent-301
- Destination agent-201
- Resource-B 0 units
- Source agent-301
- Destination agent-201
- Resource-C 0 unit
- each strategy function executes the provisioning action identified during step E2.
- the strategy function 102 informs the agent 201 of the availability of a frequency or a range of frequencies.
- the strategy function 202 informs the agent 301 of the availability of an energy resource or a volume of energy resources.
- the strategy function 302 informs the agent 101 of the availability of a volume of transmission capacities in the transport network.
- these provisions can advantageously be implemented using the N24 interface as specified in the 3GPP document 29.513.
- the strategy functions 102, 202, 302 can update a mediation entity in charge of monitoring the provisions.
- this mediation entity can be the registry 401.
- the detection entity 103 retrieves from the register 401 the cooperations, corresponding to the respective provisioning of the agents 201 and 301 made during the step E3.
- the detection entities 203 and 303 obtain the respective provisions of the agents 101 and 301 for the entity 203, and the respective provisions of the agents 101 and 201 for the entity 303.
- the detection entity 103 (respectively 203 and 303) communicates to the negotiation entity 104 (respectively 204 and 304) the provisions obtained during step E4.
- the Op A management entity 100 receives, from the negotiation function 104, a cooperation index updated according to the previous provision of energy resources (the resources are according to this example of energy type) by the Opé B management entity 200 (the management entity comprising the entities 201 and 202) of the Opé B operator and transmission capacities made available by an entity management of Opé C 300 (including entities 301, 302) of the operator Opé C.
- the cooperation index includes a modification of a maximum throughput D ⁇ a of cooperation corresponding to a quantity of frequencies made available by the entity 200 of the operator Opé B.
- This cooperation index can be specific to the operators Opé B and Opé C or it can be an overall cooperation index relating a degree of cooperation between all the operators involved.
- the entities 200 and 300 also update the cooperation indices during step E6.
- This update of the cooperation index can also comprise the modification of the maximum cooperation graph by penalizing the edges which are directed towards the management entities of non-cooperative operators.
- the agent 101 determines a flow of cooperation according to the updated index and according to the possibilities of actually using a resource made available by one of the management entities of the operators of the communication infrastructure.
- the management entity of Opé A 100 agrees to make a resource available if it has previously been able to receive a resource made available by a management entity of another operator.
- the resources made available by the Opé B and Opé C operators can be communicated to it directly by the operators in question or by register 401 which can collect the offers of availability.
- the Opé A 100 management entity therefore determines a flow of cooperation, consisting of a series of step-by-step availability between at least 3 operators. This so-called circular cooperation flow makes it possible to make a resource available to the operator Opé B or Opé C while being able to use a resource made available to it by the operator Opé C or Opé B.
- This cooperation flow may also be determined according to the provision of a resource by the management entity (comprising the entities 201 and 202) of the Opé B 200 operator to the management entity (comprising the entities 301 and 302) of the Opé C operator 300 so as to make collaboration more virtuous and that each Opé A, Opé B and Opé C operator finds an interest in this provision of multi-operator resources.
- the flow of cooperation can be determined according to the number of operators involved in the provisioning process. It can be advantageous for a maximum number of operators to be involved to improve the cooperation index for future research and provision of resources.
- the flow of cooperation is determined according to the quantity of resources made available to the operator Opé B by the operator Opé A and the quantity of resources that the operator Opé C makes available to the operator Opé A. These quantities can also be weighted according to the nature of the resource.
- the agent 101 after having determined a new maximum graph Cm ax and a new maximum rate of cooperation Dmax seeks a flow of cooperation in the maximal graph C ⁇ a so that a maximum number of agents and therefore of operators on the basis of a virtuous circle which benefits the greatest number of operators and promotes collaborations future.
- FIG 5 An example of maximum graph and maximum flow is described in [Fig 5].
- the three functions 102, 103 and 104 of strategy (Stra), detection (Det) and negotiation (Neg) are represented for the agent 101 implementing a provision method identified GTFT (in English Graph-based Tit -for-Tat) in the presence of 4 operator management entities (100, 200, 300, 400), with indices of trust between these management entities.
- GTFT in English Graph-based Tit -for-Tat
- FIG 6 presents an example of a provisioning process based on maximum graphs and maximum throughputs between 4 operator management entities 100, 200, 300, 400 each implementing the provisioning process.
- a provision circle linking the different operator management entities is built and allows each management entity to make a resource available while using a resource from another entity in the chain.
- This step E7 is broken down into two sub-steps:
- the capacities are the maximum degrees of cooperation
- the source (agent 101) is wired to the input of the node corresponding to itself with the capacity C ⁇ ax and all the edges directed towards it- even are refocused at the well.
- a flow graph which aims to circulate the most cooperation among the agents so that a maximum of resources are made available to it in a circular manner.
- This step makes it possible to obtain the sub-graph which makes it possible to circulate cooperation as much as possible within the agents (101, 201, 301) by “receiving” (i.e. by making resources available) as much as what we "gave” (that is to say, being able to use the resources of another operator (Op B, Op C).
- step E8 the agent 101 (and respectively the agents 201 and 301) transmits to its strategy function 102 (respectively 202 and 302), the degrees of cooperation with the operators Opé B and Op C, these degrees of cooperation being updated with the previous provision of resources.
- an adaptive process of provision is implemented taking advantage of the evolutions of the cooperation of different operators (Op A, Op B, Op C) intervening in the provision of resources. This process is all the more interesting as a large number of operators intervene in the process, each operator being able to intervene or not in a cycle (Steps El to E7) of provision.
- step E2 is optional and that each strategy function (102, 202, 302) could inform the other agents rather than register 40E Agent 102 could also update the cooperation index according to resources actually made available.
- the provision can take on different meanings depending on the type of resources and/or the strategy of the operators involved in the process. It can be a loan of resources for example for a fixed period, or a right to use these resources or even a supply of technical elements (access information, security keys, etc. .) to access resources.
- This provision differs in particular from roaming since roaming consists of routing traffic on another operator's network and furthermore roaming is bilateral whereas the method of provision is particularly valid in a multilateral context with at least three operators.
- a provision device 500 in connection with [Fig 7], is presented.
- Such a provision device can be implemented in a management entity of a fixed or mobile operator network and can in particular be instantiated in a PCF type device of an operator network in a virtualized form or in the form of physical equipment.
- the provision device 500 can be included in a management entity of an operator such as the entity (101, 102) of the first operator of [Fig 4].
- the device 500 comprises a processing unit 530, equipped for example with an mR microprocessor, and controlled by a computer program 510, stored in a memory 520 and implementing the provision method according to invention.
- a computer program 510 stored in a memory 520 and implementing the provision method according to invention.
- the code instructions of the computer program 510 are for example loaded into a RAM memory, before being executed by the processor of the processing unit 530.
- Such a device 500 for providing a first operator comprises:
- a receiver (501) capable of receiving a cooperation index Ind relating to a previous provision of a second resource by a management entity of a second operator and of a third resource by a management entity of at least one third operator,
- a determination module capable of determining a cooperation flow as a function of the cooperation index Ind received and of data relating to a fourth resource provision of the management entity of the first operator by the management entity of the second or at least one third operator,
- a provision module capable of making the first resource available to the management entity of the second operator according to the determined cooperation flow.
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
Description
Claims
Priority Applications (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
EP22719316.6A EP4315928A1 (fr) | 2021-03-31 | 2022-03-29 | Procede, dispositif et systeme de mise a disposition d'une ressource de communication |
Applications Claiming Priority (2)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
FRFR2103308 | 2021-03-31 | ||
FR2103308A FR3121566A1 (fr) | 2021-03-31 | 2021-03-31 | Procédé et dispositif de mise à disposition d’une ressource de communication |
Publications (1)
Publication Number | Publication Date |
---|---|
WO2022208017A1 true WO2022208017A1 (fr) | 2022-10-06 |
Family
ID=76283909
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
PCT/FR2022/050582 WO2022208017A1 (fr) | 2021-03-31 | 2022-03-29 | Procede, dispositif et systeme de mise a disposition d'une ressource de communication |
Country Status (3)
Country | Link |
---|---|
EP (1) | EP4315928A1 (fr) |
FR (1) | FR3121566A1 (fr) |
WO (1) | WO2022208017A1 (fr) |
Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP2995109B1 (fr) * | 2013-05-10 | 2018-01-03 | Nokia Solutions and Networks Oy | Mécanisme de communication utilisant le partage de spectre |
JP2018503302A (ja) * | 2014-12-12 | 2018-02-01 | 華為技術有限公司Huawei Technologies Co.,Ltd. | 免許不要スペクトルにおけるジョイント協調及び共存のための方法並びにシステム |
CN107005999B (zh) * | 2014-12-12 | 2019-12-06 | 华为技术有限公司 | 用于时域帧结构的动态优化的方法和系统 |
-
2021
- 2021-03-31 FR FR2103308A patent/FR3121566A1/fr not_active Withdrawn
-
2022
- 2022-03-29 EP EP22719316.6A patent/EP4315928A1/fr active Pending
- 2022-03-29 WO PCT/FR2022/050582 patent/WO2022208017A1/fr active Application Filing
Patent Citations (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
EP2995109B1 (fr) * | 2013-05-10 | 2018-01-03 | Nokia Solutions and Networks Oy | Mécanisme de communication utilisant le partage de spectre |
JP2018503302A (ja) * | 2014-12-12 | 2018-02-01 | 華為技術有限公司Huawei Technologies Co.,Ltd. | 免許不要スペクトルにおけるジョイント協調及び共存のための方法並びにシステム |
CN107005999B (zh) * | 2014-12-12 | 2019-12-06 | 华为技术有限公司 | 用于时域帧结构的动态优化的方法和系统 |
Non-Patent Citations (3)
Title |
---|
3GPP 29.513 |
BIKRAMJIT SINGH: "Repeated Games for Inter-operator Spectrum Sharing", ARXIV.ORG, CORNELL UNIVERSITY LIBRARY, 201 OLIN LIBRARY CORNELL UNIVERSITY ITHACA, NY 14853, 15 May 2015 (2015-05-15), XP080982732 * |
DINH THAI HOANG ET AL: "Applications of Repeated Games in Wireless Networks: A Survey", ARXIV.ORG, CORNELL UNIVERSITY LIBRARY, 201 OLIN LIBRARY CORNELL UNIVERSITY ITHACA, NY 14853, 11 January 2015 (2015-01-11), XP080974469 * |
Also Published As
Publication number | Publication date |
---|---|
FR3121566A1 (fr) | 2022-10-07 |
EP4315928A1 (fr) | 2024-02-07 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
US8249984B2 (en) | System and method for fair-sharing in bandwidth sharing ad-hoc networks | |
EP3825919A1 (fr) | Méthode d'association d'équipements d'utilisateurs dans un réseau cellulaire au moyen d'un apprentissage par renforcement multi-agent | |
US20210326879A1 (en) | Blockchain protocol and a blockchain network | |
WO2020114977A1 (fr) | Passerelle pour communiquer par reseau radio avec au moins un nœud et par un reseau filaire, par le biais d'une blockchain | |
WO2020174156A1 (fr) | Procédé d'évaluation des dispositifs d'une infrastructure de réseau en vue du déploiement d'une fonction virtualisée | |
FR2837953A1 (fr) | Systeme d'echange de donnees | |
EP2047698B1 (fr) | Personnalisation d ' un terminal de radiocommunication | |
EP1737157A1 (fr) | Dispositif de contrôle de transfert d'unités de temps de connexion entre terminaux de réseau(x) de communication | |
EP4315928A1 (fr) | Procede, dispositif et systeme de mise a disposition d'une ressource de communication | |
WO2020239704A1 (fr) | Procede de gestion de ressources de telecommunications allouees dynamiquement a une pluralite d'operateurs de telecommunications, produit programme d'ordinateur et dispositifs correspondants | |
EP4193569A1 (fr) | Procede de traitement d'un service de transport de donnees | |
FR2857807A1 (fr) | Procede de transaction pour un approvisionnement de regles dans un reseau gere a base de regles | |
EP3563558A1 (fr) | Reseau informatique de noeuds communiquant entre eux par messages en pair a pair et procede d'interconnexion entre noeuds associe | |
WO2023031560A1 (fr) | Procede et dispositif de substitution d'une pluralite de fournisseurs de services par un fournisseur de services | |
WO2023217638A1 (fr) | Procédé, dispositif et système de certification d'une ressource | |
WO2023217639A1 (fr) | Procédé, dispositif et système d'élaboration dynamique d'une infrastructure de données | |
EP4145794A1 (fr) | Procédé d'intégration dynamique mis en uvre au cours de la fédération de réseaux de radiocommunication et produit programme d'ordinateur | |
WO2023138968A1 (fr) | Procédé de mise à jour d'une politique d'accès à un premier réseau de télécommunication, système, équipements et programmes d'ordinateurs correspondants | |
WO2023135043A1 (fr) | Procédé, dispositif et système de modification d'une infrastructure de communication | |
EP3811655A1 (fr) | Procédé d'évaluation de la consommation d'énergie d'une tranche service dans un réseau de communications | |
EP4066520A1 (fr) | Procede de gestion d'une connexion ininterrompue d'un dispositif en deplacement | |
EP4367854A1 (fr) | Procede et dispositif de configuration d'une unite d'acces dans un environnement virtualise | |
FR3095914A1 (fr) | Procédé de routage dynamique dans un réseau d’objets connectés | |
FR3124619A1 (fr) | Méthode de calcul en périphérie de réseau utilisant un modèle génératif de données | |
EP3542589A1 (fr) | Procédé de délégation d'instructions à un dispositif en fonction de ses ressources |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
121 | Ep: the epo has been informed by wipo that ep was designated in this application |
Ref document number: 22719316 Country of ref document: EP Kind code of ref document: A1 |
|
WWE | Wipo information: entry into national phase |
Ref document number: 18552725 Country of ref document: US |
|
WWE | Wipo information: entry into national phase |
Ref document number: 2022719316 Country of ref document: EP |
|
ENP | Entry into the national phase |
Ref document number: 2022719316 Country of ref document: EP Effective date: 20231031 |
|
NENP | Non-entry into the national phase |
Ref country code: DE |