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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Mathematical problems in engineering Ročník 2013; číslo 2013; s. 1 - 9
Hlavní autoři: Hu, Bingxin, Liu, Jingxia, Ma, Feng, Yu, Zhanke, Zhang, Zhaodong
Médium: Journal Article
Jazyk:angličtina
Vydáno: Cairo, Egypt Hindawi Publishing Corporation 01.01.2013
John Wiley & Sons, Inc
Témata:
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
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 constraints, disjoint QoS routing is an NP-complete class that cannot be exactly solved in polynomial time. In the paper, the disjoint QoS routing problem was formulated as a 0-1 integer linear programming. The complicating constraints were included in the objective function using an adaptive penalty function. The special model with a totally unimodular constraint coefficient matrix was constructed and could be solved rapidly as a linear programming. An efficient algorithm using an adaptive penalty function and 0-1 integer linear programming for the disjoint QoS routing problems was designed. The proposed algorithm could obtain the optimal solution, considerably reducing the computational time consumption and improving the computational efficiency. Theoretical analysis and simulation experiments were performed to evaluate the proposed algorithm performance. Through the establishment of random network topologies using Matlab, the average running time, the optimal objective value, and the success rate were evaluated based on the optimal values obtained in Cplex. The simulation experiments validated the effectivenessof the proposed heuristic algorithm.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ObjectType-Article-2
ObjectType-Feature-1
content type line 23
ISSN:1024-123X
1563-5147
DOI:10.1155/2013/489149