Internetworking with TCP/IP (2nd ed.), vol. I
Internetworking with TCP/IP (2nd ed.), vol. I
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Call establishment overload in large ATM networks
Performance Evaluation - Special issue on traffic control in ATM networks
QoS routing in networks with uncertain parameters
IEEE/ACM Transactions on Networking (TON)
QoS based multicast routing algorithms for real time applications
Performance Evaluation - Special issue on performance and control of network systems
QoS routing in networks with inaccurate information: theory and algorithms
IEEE/ACM Transactions on Networking (TON)
Routing with end-to-end QoS guarantees in broadband networks
IEEE/ACM Transactions on Networking (TON)
Multicast routing with multiple QoS constraints in ATM network
Information Sciences—Informatics and Computer Science: An International Journal
Optimal partition of QoS requirements on unicast paths and multicast trees
IEEE/ACM Transactions on Networking (TON)
Heuristic algorithms for multiconstrained quality-of-service routing
IEEE/ACM Transactions on Networking (TON)
Measurement and performance of a cognitive packet network
Computer Networks: The International Journal of Computer and Telecommunications Networking - Special issue on networking middleware: selected papers from the TERENA networking conference 2001
Design and performance of cognitive packet networks
Performance Evaluation
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Self-Awareness and Adaptivity for Quality of Service
ISCC '03 Proceedings of the Eighth IEEE International Symposium on Computers and Communications
Cognitive Packet Networks: QoS and Performance
MASCOTS '02 Proceedings of the 10th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
A comparison of two optimal approaches for the MCOP problem
Journal of Network and Computer Applications
Block loss reduction in ATM networks
Computer Communications
Bandwidth allocation and call admission control in high-speed networks
IEEE Communications Magazine
An overview of constraint-based path selection algorithms for QoS routing
IEEE Communications Magazine
An efficient algorithm for finding a path subject to two additive constraints
Computer Communications
Function approximation with spiked random networks
IEEE Transactions on Neural Networks
Effects of topology on the performance of localized QOS routing algorithms
SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
Towards resource-optimal routing plans for real-time traffic
ISoLA'10 Proceedings of the 4th international conference on Leveraging applications of formal methods, verification, and validation - Volume Part I
Optimized multi constrained path quality of service routing protocol
WSEAS Transactions on Information Science and Applications
| Hi-index | 0.00 |
The multi-constrained path (MCP) selection problem occurs when the quality-of-services (QoS) are supported for point-to-point connections in the distributed multimedia applications deployed on the Internet. This NP-complete problem is concerned about how to determine a feasible path between two given end-points, so that a set of QoS path constraints can be satisfied simultaneously. Based on the branch-and-bound technique and tabu-searching strategy, an optimal algorithm and a tabu-search based heuristic are developed in this paper for solving the MCP problem with multiple constraints. The experimental resuits show that our tabu-search based heuristic not only outperforms the previous method published in literature, but also demonstrates that it is indeed a highly efficient method for solving the MCP problem in large-scale networks.