An evolutionary programming algorithm for finding constrained optimal disjoint paths for multihop communication networks Online publication date: Mon, 19-Jul-2010
by Urmila Bhanja, Rajarshi Roy, Sudipta Mahapatra
International Journal of Metaheuristics (IJMHEUR), Vol. 1, No. 2, 2010
Abstract: We present an evolutionary programming algorithm (EP) for finding hop count and bandwidth constrained cost optimal disjoint paths in multihop communication networks. In general, multi-constrained path selection is an NP complete problem. Our proposed algorithm can be used for real-time online network applications, which can initiate and process a number of calls simultaneously on disjoint paths, without overloading the network. This algorithm also requires a small memory space and low execution time. The proposed algorithm, which maintains a balance between finding an optimal shortest path and CPU mean execution time, also generates parallel suboptimal paths during the process of generating the best path. One of these suboptimal paths can be used as a backup path if it is link disjoint with all the primary paths (best paths) of the concurrent requests. Thus, the proposed algorithm provides a limited degree of reliability for routing of packets as well.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Metaheuristics (IJMHEUR):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook