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: | Ariffin, Wan Nor Munirah, Mat Zin, Shazalina, Salleh, Shaharuddin |
---|---|
格式: | Article |
出版: |
World Scientific Publishing
2012
|
主題: | |
在線閱讀: | http://eprints.utm.my/id/eprint/47501/ https://dx.doi.org/10.1142/S2010194512005570 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|
相似書籍
-
Routing problem in rectangular mesh network using shortest path based Greedy method
由: Noraziah, Adzhar, et al.
出版: (2019) -
Routing problem in rectangular mesh network using shortest path based Greedy method
由: Noraziah, Adzhar, et al.
出版: (2019) -
Enhanced open shortest path first (OSPF) protocol using parallel tabu search - ring in wimax mesh network
由: Ahmed, Bilal Abdulhaq
出版: (2013) -
An experiment on the performance of shortest path algorithm
由: Chan, Simon Yew Meng, et al.
出版: (2016) -
Enhanced advancing front techniques for mesh generation in radiative heat transfer problem
由: Abal Abas, Zuraida
出版: (2012)