Evolutionary computation: toward a new philosophy of machine intelligence
Evolutionary computation: toward a new philosophy of machine intelligence
Simulation study of the capacity effects of dispersity routing for fault tolerant realtime channels
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
A Primary-Backup Channel Approach to Dependable Real-Time Communication in Multihop Networks
IEEE Transactions on Computers
An efficient delay-constrained multicast routing algorithm
Journal of High Speed Networks
A new distributed route selection approach for channel establishment in real-time networks
IEEE/ACM Transactions on Networking (TON)
QoS-aware multicast routing for the internet: the design and evaluation of QoSMIC
IEEE/ACM Transactions on Networking (TON)
Evolutionary Computation: Towards a New Philosophy of Machine Intelligence
Evolutionary Computation: Towards a New Philosophy of Machine Intelligence
A Distributed Algorithm for Delay-Constrained Unicast Routing
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
An Improved Approximation Algorithm for Computing Disjoint QoS Paths
ICNICONSMCL '06 Proceedings of the International Conference on Networking, International Conference on Systems and International Conference on Mobile Communications and Learning Technologies
Simulated Annealing Based Multi-constrained QoS Routing in Mobile ad hoc Networks
Wireless Personal Communications: An International Journal
A genetic algorithm for shortest path routing problem and the sizing of populations
IEEE Transactions on Evolutionary Computation
A genetic algorithm for designing distributed computer networktopologies
IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics
Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm
Computer Communications
A note on dependable real-time communication in multihop networks
Computer Communications
A hybrid genetic approach for channel reuse in multiple access telecommunication networks
IEEE Journal on Selected Areas in Communications
A QoS-aware multicast routing protocol
IEEE Journal on Selected Areas in Communications
A practical approach to operating survivable WDM networks
IEEE Journal on Selected Areas in Communications
FWM aware evolutionary programming algorithm for transparent optical networks
Photonic Network Communications
Information Sciences: an International Journal
A metaheuristic approach for optical network optimization problems
Applied Soft Computing
| Hi-index | 0.00 |
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.