Browse Prior Art Database

SHORTEST PATH CALCULATION TO ALL NETWORK NODES WITH BOTH POINT-TO-POINT AND BROADCAST LINKS

IP.com Disclosure Number: IPCOM000247199D
Publication Date: 2016-Aug-16

Publishing Venue

The IP.com Prior Art Database

Abstract

In various exemplary embodiments, the present disclosure relates to shortest path calculation to all network nodes with both point-to-point and broadcast links. A process can include grouping all the nodes that are connected via the same broadcast link to form a virtual node. A first calculation will choose a single lowest cost link between every two virtual nodes. Then the shortest path calculation (e.g., using Dijkstra's algorithm) can be performed from the access point to all other virtual nodes, also based on the available lowest cost path. After this calculation, a loop-free network is created among those virtual nodes. The last step involves restoring the original nodes behind all those virtual nodes.

This text was extracted from a PDF file.
This is the abbreviated version, containing approximately 23% of the total text.

Page 01 of 16

SHORTEST PATH CALCULATION TO ALL NETWORK NODES WITH BOTH POINT-TO-POINT AND BROADCAST LINKS

ABSTRACT


[0001]In various exemplary embodiments, the present disclosure relates to shortest path calculation to all network nodes with both point-to-point and broadcast links. A process can include grouping all the nodes that are connected via the same broadcast link to form a virtual node. A first calculation will choose a single lowest cost link between every two virtual nodes. Then the shortest path calculation (e.g., using Dijkstra's algorithm) can be performed from the access point to all other virtual nodes, also based on the available lowest cost path. After this calculation, a loop-free network is created among those virtual nodes. The last step involves restoring the original nodes behind all those virtual nodes.

DESCRIPTION


[0002]Again, in various exemplary embodiments, the present disclosure relates to shortest path calculation to all network nodes with both point-to-point and broadcast links. A process can include grouping all the nodes that are connected via the same broadcast link to form a virtual node. A first calculation will choose a single lowest cost link between every two virtual nodes. Then the shortest path calculation (e.g., using Dijkstra's algorithm) can be performed from the access point to all other virtual nodes, also based on the available lowest cost path. After this calculation, a loop-free network is created among those virtual nodes. The last step involves restoring the original nodes behind all those virtual nodes.


[0003]The above calculation is done with the access node configured by a user and shared with all other nodes in the network. This information together with link state information can be distributed to all other nodes using a link-state based routing protocol (ISIS/OSPF as an example).The same procedure can be done for a different access point. The result is a different virtual network. Therefore, one access point generates one virtual network, and multiple virtual networks can co-exist and not interfere with each other, but different physical links can be chosen so that the entire network can be utilized to achieve maximum throughput from all access points.


[0004]The present disclosure includes broadcast type included in shortest path calculation;

Dijkstra's algorithm is applied on the virtual nodes (all nodes connected with the same broadcast link);access node information is shared with all other nodes together with link state information thus a virtual network can be formed based on the access point; and multiple virtual networks can co-exist with different access points, therefore, maximum utilization of network resources.


[0005]Ethernet switches that exist in multiple network nodes can form a larger switched layer 2 networks. In order to access the network, connected nodes achieve highest management throughput from multiple EMS (Element Management Station) stations that are connect...