このアプリケーションの一部のコンテンツは現時点では利用できません。
このような状況が続く場合は、にお問い合わせくださいフィードバック & お問い合わせ
1. (WO2018145761) STRUCTURED ID-BASED AND TOPOLOGY ADAPTIVE CONTROL PLANE FOR 5G
注意: このテキストは、OCR 処理によってテキスト化されたものです。法的な用途には PDF 版をご利用ください。

CLAIMS

1. A system comprising multiple resource elements within a communication network, wherein each resource element is adapted to support a resource-to-resource (R2R) protocol, the R2R protocol being adapted to:

assign a respective identification (id) value (n,) to each resource element amongst the multiple resource elements, each identification (id) value (n,) being a unique value;

establish, for each resource element amongst the multiple resource elements, a connection to each of its physical or virtual neighbors by transmitting an id-based message (Hello message) from each resource element towards each of its physical or virtual neighbors, the physical or virtual neighbors of a resource element being the resource elements located in an underlay and with a network connection to it which is available for a connection establishment; and

establish, by means of each resource element amongst the multiple resource elements and for each pair of logical neighbors, a logical connection between the respective two logical neighbors in order to form an id-based logical structure as an overlay and based on the order of the identification (id) values (n,) of each resource element amongst the multiple resource elements, the two logical neighbors corresponding to two resource elements with adjacent identification values (n,) on the id-based logical structure in such a manner that one of the two logical neighbors is either a successor of the other one or a predecessor of the other one on the id-based logical structure.

2. The system of claim 1, wherein each resource element amongst the multiple resource elements supports the R2R protocol through a respective resource control agent (RCA).

3. The system of claim 2, wherein each resource element amongst the multiple resource elements performs a local pairing operation in a distributed manner by transmitting a notification message (NotifyNb message) towards each of the two logical neighbors of each pair in order to establish the logical connection between the respective two logical neighbors, the logical connection between the respective two logical neighbors being established once the transmitted notification message (NotifyNb message) has been received by each of them.

4. The system of claim 3, wherein the 2 protocol is adapted to solve a conflict of resource elements pairing the same pair of logical neighbors by allowing each pair of logical neighbors to be paired by means of a single resource element.

5. The system of claim 4, wherein the conflict is solved by allowing each of the two logical neighbors constituting the pair to make a same and independent choice to select the single resource element and to reject any other resource element by transmitting each a respective rejection message (RejectNb message) towards each rejected resource element.

6. The system of claim 5, wherein the choice is based on calculating a respective logical distance from each of the pairing resource elements towards each of the two logical neighbors, the selected single resource element corresponding to the shortest logical distance between itself and one of the two logical neighbors of the pair.

7. The system of any one of claims 3 to 6, wherein each resource element amongst the multiple resource elements has a routing table comprising all the pairs of logical neighbors paired by itself, all the logical paths going through itself and all the logical paths between its logical neighbors, and consisting of a set of data routing rules to be applied to the incoming data packets and a set of control routing rules to be applied to the incoming control packets, the set of control routing rules being maintained by the resource control agent (RCA).

8. The system of any one of the preceding claims, wherein the R2R protocol is adapted to:

establish, for at least one resource element amongst the multiple resource elements, logical connections to at least one finger resource element, the finger resource element

corresponding to a resource element other than one of the two logical neighbors.

9. The system of claim 8, wherein the logical connections to at least one finger resource element are selectively established using an algorithm of selection of finger resource elements.

10. The system of claim 9, wherein a topology of the id-based logical structure is adaptively changed according to the network conditions.

11. The system of any one of the preceding claims, wherein the id-based logical structure is an id-ordered ring-based logical structure.

12. A control plane comprising:

the system as specified in any one of claims 1 to 11.

13. A resource element of a system comprising multiple resource elements within a

communication network according to any one of claims 1 to 11.

14. A method for controlling multiple resource elements within a communication network, the method comprising:

assigning a respective identification (id) value (n,) to each resource element amongst the multiple resource elements, each identification (id) value (n,) being a unique value;

establishing, for each resource element amongst the multiple resource elements, a connection to each of its physical or virtual neighbors by transmitting an id-based message (Hello message) from each resource element towards each of its physical or virtual neighbors, the physical or virtual neighbors of a resource element being the resource elements located in an underlay and with a network connection to it which is available for a connection

establishment; and

establishing, by means of each resource element amongst the multiple resource elements and for each pair of logical neighbors, a logical connection between the respective two logical neighbors in order to form an id-based logical structure as an overlay and based on the order of the identification (id) values (n,) of each resource element amongst the multiple resource elements, the two logical neighbors corresponding to two resource elements with adjacent identification values (n,) on the id-based logical structure in such a manner that one of the two logical neighbors is either a successor of the other one or a predecessor of the other one on the id-based logical structure.

15. The method of claim 14 comprising:

establishing, for at least one resource element amongst the multiple resource elements, logical connections to at least one finger resource element, the finger resource element

corresponding to a resource element other than one of the two logical neighbors.

16. A computer program comprising a program code for performing the method according to claims 14 to 15 when executed on a computer.