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...
Main Authors: | , , |
---|---|
Format: | Article |
Published: |
World Scientific Publishing
2012
|
Subjects: |
_version_ | 1796859155567345664 |
---|---|
author | Ariffin, Wan Nor Munirah Mat Zin, Shazalina Salleh, Shaharuddin |
author_facet | Ariffin, Wan Nor Munirah Mat Zin, Shazalina Salleh, Shaharuddin |
author_sort | Ariffin, Wan Nor Munirah |
collection | ePrints |
description | 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. |
first_indexed | 2024-03-05T19:23:00Z |
format | Article |
id | utm.eprints-47501 |
institution | Universiti Teknologi Malaysia - ePrints |
last_indexed | 2024-03-05T19:23:00Z |
publishDate | 2012 |
publisher | World Scientific Publishing |
record_format | dspace |
spelling | utm.eprints-475012019-03-05T02:53:59Z http://eprints.utm.my/47501/ Shortest path technique for switching in a mesh network Ariffin, Wan Nor Munirah Mat Zin, Shazalina Salleh, Shaharuddin QC Physics 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. World Scientific Publishing 2012 Article PeerReviewed Ariffin, Wan Nor Munirah and Mat Zin, Shazalina and Salleh, Shaharuddin (2012) Shortest path technique for switching in a mesh network. Journal of Modern Physics (World Scientific Press), 9 . pp. 488-494. ISSN 10.1-142/S2010194512005570 https://dx.doi.org/10.1142/S2010194512005570 DOI:10.1142/S2010194512005570 |
spellingShingle | QC Physics Ariffin, Wan Nor Munirah Mat Zin, Shazalina Salleh, Shaharuddin Shortest path technique for switching in a mesh network |
title | Shortest path technique for switching in a mesh network |
title_full | Shortest path technique for switching in a mesh network |
title_fullStr | Shortest path technique for switching in a mesh network |
title_full_unstemmed | Shortest path technique for switching in a mesh network |
title_short | Shortest path technique for switching in a mesh network |
title_sort | shortest path technique for switching in a mesh network |
topic | QC Physics |
work_keys_str_mv | AT ariffinwannormunirah shortestpathtechniqueforswitchinginameshnetwork AT matzinshazalina shortestpathtechniqueforswitchinginameshnetwork AT sallehshaharuddin shortestpathtechniqueforswitchinginameshnetwork |