Probability, statistics, and queueing theory with computer science applications
Probability, statistics, and queueing theory with computer science applications
Quality of service: delivering QoS on the Internet and in corporate networks
Quality of service: delivering QoS on the Internet and in corporate networks
Quality of service based routing: a performance perspective
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Internet architectures
QoS routing in networks with uncertain parameters
IEEE/ACM Transactions on Networking (TON)
QoS routing in networks with inaccurate information: theory and algorithms
IEEE/ACM Transactions on Networking (TON)
QoS and traffic management in IP and ATM networks
QoS and traffic management in IP and ATM networks
IP Convergence: The Next Revolution in Telecommunications
IP Convergence: The Next Revolution in Telecommunications
Simulation Modeling and Analysis
Simulation Modeling and Analysis
Hop-by-hop quality of service routing
Computer Networks: The International Journal of Computer and Telecommunications Networking
Distributed QoS Routing with Imprecise State Information
IC3N '98 Proceedings of the International Conference on Computer Communications and Networks
Bandwidth-delay constrained path selection under inaccurate state information
IEEE/ACM Transactions on Networking (TON)
Power laws and the AS-level internet topology
IEEE/ACM Transactions on Networking (TON)
Precomputation schemes for QoS routing
IEEE/ACM Transactions on Networking (TON)
A first-principles approach to understanding the internet's router-level topology
Proceedings of the 2004 conference on Applications, technologies, architectures, and protocols for computer communications
Conditions that impact the complexity of QoS routing
IEEE/ACM Transactions on Networking (TON)
Pareto optimal based partition framework for two additive constrained path selection
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
Quality-of-service routing in IP networks
IEEE Transactions on Multimedia
Routing multimedia traffic with QoS guarantees
IEEE Transactions on Multimedia
An overview of constraint-based path selection algorithms for QoS routing
IEEE Communications Magazine
TAMCRA: a tunable accuracy multiple constraints routing algorithm
Computer Communications
IEEE Network: The Magazine of Global Internetworking
IEEE Network: The Magazine of Global Internetworking
Performance evaluation of constraint-based path selection algorithms
IEEE Network: The Magazine of Global Internetworking
Delay coerced multi constrained quality of service routing algorithm
WSEAS Transactions on Information Science and Applications
| Hi-index | 0.24 |
We study quality-of-service (QoS) routing, particularly two additive-constrained path selection problem, in the presence of inaccurate state information. We formulate this problem as Most-Probable Two-Additive-Constrained Path (MP-TACP) problem. To solve it, we follow a probabilistic approach and propose an algorithm called MP-TACPA. In general, MP-TACPA uses pre- and on-demand computation along with both linear and nonlinear search techniques. In contrast to previous algorithms using similar techniques, MP-TACPA takes into account the inaccuracies along with new bounds and heuristics including look ahead and dominance probability. Extensive simulations show that MP-TACPA behaves very well in the presence of inaccurate state information. Specifically, it gives higher success rate in finding feasible paths than existing solutions that assume the availability of exact state information. In addition, its average computational cost and thus response time is better than typical on-demand path selection algorithms.