Access the full text.
Sign up today, get DeepDyve free for 14 days.
D. Fogel (1995)
Evolutionary Computation: Towards a New Philosophy of Machine Intelligence
D. Reeves, Hussein Salama (1997)
A distributed algorithm for delay-constrained unicast routingProceedings of INFOCOM '97, 1
Chao Peng, Hong Shen (2006)
An Improved Approximation Algorithm for Computing Disjoint QoS PathsInternational Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies (ICNICONSMCL'06)
S. Raghavan, G. Manimaran, C. Murthy (2002)
A note on dependable real-time communication in multihop networksComput. Commun., 25
S. Marwaha, D. Srinivasan, C. Tham, A. Vasilakos (2004)
Evolutionary fuzzy multi-objective routing for wireless mobile ad hoc networksProceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753), 2
C. Ahn, R. Ramakrishna (2002)
A genetic algorithm for shortest path routing problem and the sizing of populationsIEEE Trans. Evol. Comput., 6
G. Manimaran, Hariharan Rahul, C. Murthy (1999)
A new distributed route selection approach for channel establishment in real-time networksIEEE/ACM Trans. Netw., 7
Quanbao Sun, H. Langendörfer (1998)
An efficient delay-constrained multicast routing algorithmJ. High Speed Networks, 7
Shigang Chen, K. Nahrstedt, Y. Shavitt (2000)
A QoS-aware multicast routing protocolProceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064), 3
S. Pierre, G. Legault (1998)
A genetic algorithm for designing distributed computer network topologiesIEEE transactions on systems, man, and cybernetics. Part B, Cybernetics : a publication of the IEEE Systems, Man, and Cybernetics Society, 28 2
Seungjae Han, K. Shin (1998)
A Primary-Backup Channel Approach to Dependable Real-Time Communication in Multihop NetworksIEEE Trans. Computers, 47
S. Ramamurthy, B. Mukherjee (1999)
Survivable WDM mesh networks. Part I-ProtectionIEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320), 2
Shuqian Yan, M. Faloutsos, A. Banerjea (2002)
QoS-aware multicast routing for the internet: the design and evaluation of QoSMICIEEE/ACM Trans. Netw., 10
I. Kassotakis, M. Markaki, A. Vasilakos (2000)
A hybrid genetic approach for channel reuse in multiple access telecommunication networksIEEE Journal on Selected Areas in Communications, 18
Lianggui Liu, G. Feng (2007)
Simulated Annealing Based Multi-constrained QoS Routing in Mobile ad hoc NetworksWireless Personal Communications, 41
Zhengying Wang, Bingxin Shi, Zhao Erdun (2001)
Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithmComputer Communications, 24
M. Sridharan, M. Salapaka, Arun Somani (2002)
A practical approach to operating survivable WDM networksIEEE J. Sel. Areas Commun., 20
K. Deb, K. Deb, Deb Kalyanmoy (2004)
Optimization for Engineering Design: Algorithms and Examples
J. Anderson, B. Doshi, S. Dravida, P. Harshavardhana (1994)
Fast restoration of ATM networksIEEE J. Sel. Areas Commun., 12
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.
International Journal of Metaheuristics – Inderscience Publishers
Published: Jan 1, 2010
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.