Shortest path technique for switching in a mesh network
Switching is a technique to route data and instructions between pairs of source-destination nodes or among multiple nodes for broadcast communication. We realized that the shortest path problem has a wide application in the design of networks. Therefore, in this paper, we present a mesh network as o...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Published: |
World Scientific Publishing
2012
|
| Subjects: | |
| Online Access: | http://eprints.utm.my/id/eprint/47501/ https://dx.doi.org/10.1142/S2010194512005570 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Switching is a technique to route data and instructions between pairs of source-destination nodes or among multiple nodes for broadcast communication. We realized that the shortest path problem has a wide application in the design of networks. Therefore, in this paper, we present a mesh network as our switching mechanism for computing the shortest path between the source and destination in our simulation model, developed using C++ on the Windows environment. The Floyd-Warshall algorithm is applied in finding the shortest path in all-pairs nodes. |
|---|