Sciweavers

1542 search results - page 17 / 309
» A Qos Routing Algorithm Based on Ant Algorithm
Sort
View
100
Voted
ICICIC
2006
IEEE
15 years 3 months ago
An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
Pan Junjie, Wang Dingwei
CEC
2007
IEEE
15 years 1 months ago
A Simulated Evolution-Tabu search hybrid metaheuristic for routing in computer networks
Routing in computer networks is a nonlinear combinatorial optimization problem with numerous constraints and is classified as an NP-complete problem. There are certain important Qo...
Salman A. Khan, Zubair A. Baig
ICC
2007
IEEE
15 years 3 months ago
Inter-Domain QoS Routing with Virtual Trunks
— This paper addresses the problem of inter-domain QoS routing. We propose a solution based on virtual-trunk type aggregates corresponding to Service Level Agreements (SLA) for d...
Rui Prior, Susana Sargento
TON
2008
119views more  TON 2008»
14 years 9 months ago
Polynomial time approximation algorithms for multi-constrained QoS routing
We study the multi-constrained Quality-of-Service (QoS) routing problem where one seeks to find a path from a source to a destination in the presence of K 2 additive end-to-end Qo...
Guoliang Xue, Weiyi Zhang, Jian Tang, Krishnaiyan ...
PE
2011
Springer
215views Optimization» more  PE 2011»
14 years 4 months ago
Energy-aware routing in the Cognitive Packet Network
An energy aware routing protocol (EARP) is proposed to minimise a performance metric that combines the total consumed power in the network and the QoS that is specified for the ...
Toktam Mahmoodi