An Efficient Approximate Algorithm for Disjoint QoS Routing

Disjoint routing is used to find the disjoint paths between a source and a destination subject to QoS requirements. Disjoint QoS routing is an effective strategy to achieve robustness, load balancing, congestion reduction, and an increased throughput in computer networks. For multiple additive const...

Full description

Saved in:

Bibliographic Details
Published in:	Mathematical problems in engineering Vol. 2013; no. 2013; pp. 1 - 9
Main Authors:	Hu, Bingxin, Liu, Jingxia, Ma, Feng, Yu, Zhanke, Zhang, Zhaodong
Format:	Journal Article
Language:	English
Published:	Cairo, Egypt Hindawi Publishing Corporation 01.01.2013 John Wiley & Sons, Inc
Subjects:	Adaptive algorithms Algorithms Computer networks Computer simulation Computing time Constraint modelling Heuristic methods Integer programming Linear programming Mathematical analysis Mathematical models Mathematical problems Mathematical programming Matlab Matrix methods Optimization Penalty function Quality of service architectures Routing (telecommunications) Run time (computers)
ISSN:	1024-123X, 1563-5147
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!