optical circuit switch
2016-08-23
0 0 0
no vote
Other
Earn points
We find HLDA heuristic algorithm is suitable to
our model for design OCS topology Shortest path routing algorithms could be
used to determine the route for packets over OCS part.The proposed heuristic is based on Dijkstra's algorithm,
to find the shortest path between any two nodes in the network; it selects the
shortest path between every node pair depending on the availability of a free
wavelength on the selected path and a free transmitter and receiver at the
source and the destination nodes, respectively We select the path with the least number of
intermediate hops instead of choosing the path with the least propagation delay
c++
Related Source Codes
Local Path Planning Algorithm - DWA Algorithm
0
0
no vote
enDAQ-Shock-Data-Share-SRS-Blog
0
0
no vote
Calling chatGPT in a Windows application
0
0
no vote
Test Hello world
0
0
no vote
RCS calculation by one-way ray tracing
0
0
no vote
No comment