Virtual Network Node Self-Organization via Link Lists
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing decentralized management approaches for large ensembles of autonomic entities fail to effectively self-organize and manage resources without central control, leading to inefficiencies in service provision and resource allocation in virtual networks.
Innovation Solution
A method for operating a virtual network where each node maintains a link list and message store to request and provide services, utilizing gossiping to propagate information and create cooperative links based on service needs and capabilities, allowing nodes to self-configure, self-heal, self-optimize, and self-protect by searching for suitable service providers and adapting their service offerings.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If decentralized management approaches are used for large ensembles of autonomic entities, then self-organization capability is improved, but resource allocation efficiency deteriorates
Solution Approach 1:
The system segments the large ensemble of autonomic entities into smaller virtual networks with defined nodes and links. Each node independently manages its own link list and message store, dividing the complex decentralized management task into manageable local units that can self-organize without overwhelming the entire system.
Solution Approach 2:
The patent introduces messages as intermediary carriers that facilitate service requests and responses between nodes. These structured messages with identity, service labels, and capability information act as mediators that enable efficient resource allocation through standardized communication protocols rather than direct complex node-to-node negotiations.
2Adaptability or versatility
If nodes maintain link lists and message stores for service discovery, then service provision capability is improved, but device complexity increases
Solution Approach 1:
The link list and message store structures are designed as universal components that serve multiple functions: storing service information, tracking node capabilities, managing connections, and enabling both service discovery and resource allocation. This multi-functionality reduces the need for separate specialized structures for each function.
Solution Approach 2:
The system uses labeled parameters (service labels, capability labels) that can be dynamically changed and matched to adapt to different service requirements. These parameter-based structures allow nodes to efficiently query and match services without complex hard-coded logic for each service type.
3Adaptability or versatility
If nodes dynamically search for service providers and create connections, then network adaptability is improved, but message traffic increases
Solution Approach 1:
Nodes perform preliminary service discovery by maintaining link lists with pre-established connections and message stores with cached service information. When a service is needed, nodes first search these pre-populated structures before initiating new connection requests, reducing the need for extensive real-time message traffic.
Solution Approach 2:
The message protocol includes feedback mechanisms where nodes respond to service requests with their capability information. This structured feedback allows requesting nodes to efficiently identify suitable providers without exhaustive searching, and successful matches are fed back into the link lists for future use, reducing subsequent message traffic.
Data Source
AI summary
A virtual network has a plurality of nodes. Each node has the capability to provide a service to another node. Each node maintains a list for storing entries each representing a link to another node; each entry contains the address of the other node and a label identifying a service that that other node may provide. Each node also has a store for storing messages received from other nodes, these messages serving to propose a link and containing the identity of the node originating the message, a label identifying a service that that other node may provide and a label identifying a service that that other node requires. When a node needs a service that it is not itself able to provide, it searches the link list for a link having a label that matches the service needed, and in the event that such a link is found it transmits to the node identified by the link a message requesting the service. If, however, no such link is found, it searches the message store for a message identifying another node where the label identifying a service that that other node may provide matches the service needed and the label identifying a service that that other node requires matches the service that the node needing the service has the capability to provide. In the event that such a message is found it initiates the creation of a corresponding entry in the link list. If no such message is found, the node needing the service generates a message serving to propose a link and containing its own identity, a label identifying a service that it has the capability to provide and a label identifying the service that it needs.