Pareto optimal based partition framework for two additive constrained path selection

Authors:
Yanxing Zheng;Turgay Korkmaz;Wenhua Dou
Affiliations:
School of Computer Science, National University of Defense Technology, P.R. China;Department of Computer Science, University of Texas, San Antonio;School of Computer Science, National University of Defense Technology, P.R. China
Venue:
ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I
Year:
2005

Citing 2
Cited 2

Routing multimedia traffic with QoS guarantees

IEEE Transactions on Multimedia
An efficient algorithm for finding a path subject to two additive constraints

Computer Communications

Two additive-constrained path selection in the presence of inaccurate state information

Computer Communications
Approximation algorithm for QoS routing with multiple additive constraints

ICC'09 Proceedings of the 2009 IEEE international conference on Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the challenging issues in QoS routing (QoSR) is how to select a multi-constrained path (MCP) that can meet the QoS requirements. We consider the concept of Pareto optimality in the context of MCP problems and establish a Pareto optimal based partition framework (POPF). Based on the key concepts in POPF, we propose algorithm (DA_2CP) to deal with two additive QoS metric.