Wdm-fso network node resource sharing method and system
A WDM-FSO, 1. WDM-FSO technology, applied in the field of optical communication, can solve problems such as congestion, resource competition services, and "help" solutions that are not suitable for actual network scenarios
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
specific Embodiment
[0057] The technical problem to be solved by a kind of WDM-FSO network node resource sharing method in the specific embodiment of the present invention is: in the mobile FSO network, due to the limited network resources (wavelength, energy), the resource exhaustion of the cluster head nodes in the network will lead to All users entering the cluster head are faced with the problem of no available resources. When a service request arrives, if the cluster head node accessed by the source node (user) has no resources available, the neighbor node needs to move to the current node and share its equipment. and wavelength resources to provide access for users. The movement of this node will cause changes in the network topology: 1. Changes in link performance, such as physical distance, interruption probability, etc.; 2. Changes in node neighbors, such as the original link of some nodes may be interrupted, some Nodes will add new neighbor nodes; these topology changes will affect the ...
specific Embodiment approach
[0106] Such as Figure 6 , in another specific embodiment of the present invention, a specific implementation manner of a WDM-FSO network node resource sharing method is shown, including the following steps:
[0107] (1) According to the graph G(V,E), establish a virtual topology G'(V',E'), and calculate the node weight NW i , according to NW, sort the nodes in ascending order and record them in the list L;
[0108] (2) Select the node V with the smallest NW i to s on the virtual topology c Move, stop moving when moving to the best position loc(x,y);
[0109] (3) for V i All nodes within communication range V j , to establish a potential link, the condition for establishing a potential link is d c (V i )i with V j There is no link between them, and the updated topology is denoted as G″;
[0110] (4) After moving the V j denoted as s c (new), for s c (new) and d c Execute the KSP algorithm, and record the obtained path set as P(f)={p 1 ,p 2 ,…,p k}
[0111] (5)...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



