Minimizing the Broadcast Routing in the Computer Networks
作者： Ahmed Younes
DOI:
关键词: Routing table 、 Spanning tree 、 Link-state routing protocol 、 Static routing 、 Geographic routing 、 Routing Information Protocol 、 Routing protocol 、 Spanning Tree Protocol 、 Dynamic Source Routing 、 Hierarchical routing 、 Wireless Routing Protocol 、 Minimum spanning tree 、 Computer science 、 Broadcast radiation 、 Enhanced Interior Gateway Routing Protocol 、 Equal-cost multi-path routing 、 Destination-Sequenced Distance Vector routing 、 Policy-based routing 、 Computer network 、 Multipath routing 、 Routing domain 、 Zone Routing Protocol
摘要: In the computer networks, it is necessary for one device in network to send data all other devices. this paper, broadcast routing algorithms that aim minimize cost of path are proposed. A minimum scheme based on spanning tree algorithm presented. Thus, we present a genetic find given terms its links using solve problem. The uses connection matrix trees, and also weight obtain tree. An example provided illustrate effectiveness over conventional algorithms.
vixra.org参考文章(6)
Narsingh Deo, Graph Theory with Applications to Engineering and Computer Science ,(1974)
Amos Gilat, Matlab, An Introduction With Applications ,(2003)
Joseph B. Kruskal, On the shortest spanning subtree of a graph and the traveling salesman problem Proceedings of the American Mathematical Society. ,vol. 7, pp. 48- 50 ,(1956) , 10.1090/S0002-9939-1956-0078686-7
K.K. Aggarwal, Suresh Rai, Reliability Evaluation in Computer-Communication Networks IEEE Transactions on Reliability. ,vol. R-30, pp. 32- 35 ,(1981) , 10.1109/TR.1981.5220952
Lowell W. Beineke, Robert G. Busacker, Thomas L. Saaty, Finite Graphs and Networks, An Introduction with Applications Mathematics of Computation. ,vol. 21, pp. 123- ,(1967) , 10.2307/2003490
Young H. Kim, Kenneth E. Case, P. M. Ghare, A Method for Computing Complex System Reliability IEEE Transactions on Reliability. ,vol. 4, pp. 215- 219 ,(1972) , 10.1109/TR.1972.5215997