X-domain QoS budget negotiation using Dynamic Programming
AICT-ICIW '06 Proceedings of the Advanced Int'l Conference on Telecommunications and Int'l Conference on Internet and Web Applications and Services
EQ-BGP: an efficient inter-domain QoS routing protocol
AINA '06 Proceedings of the 20th International Conference on Advanced Information Networking and Applications - Volume 02
Genetic Algorithms for Autonomic Route Discovery
DIS '06 Proceedings of the IEEE Workshop on Distributed Intelligent Systems: Collective Intelligence and Its Applications
Scalable BGP QoS Extension with Multiple Metrics
ICNS '06 Proceedings of the International conference on Networking and Services
End-to-End QoS in Interdomain Routing
ICNS '06 Proceedings of the International conference on Networking and Services
Internet economics: the use of Shapley value for ISP settlement
CoNEXT '07 Proceedings of the 2007 ACM CoNEXT conference
Distributed Optimization Algorithms for X-Domain End-to-End QoS Negotiation
AICT '08 Proceedings of the 2008 Fourth Advanced International Conference on Telecommunications
End-to-end quality of service provisioning through inter-provider traffic engineering
Computer Communications
Algorithms for SLA composition to provide inter-domain services
IM'09 Proceedings of the 11th IFIP/IEEE international conference on Symposium on Integrated Network Management
A service plane over the PCE architecture for automatic multidomain connection-oriented services
IEEE Communications Magazine
| Hi-index | 0.00 |
The future Internet would benefit from the delivery of high performance services crossing several carriers and bringing new incomes to telco operators. Such services compel carriers to guarantee Quality of Service (QoS) inside their boundaries. As carriers are independently administrated, architectures and processes must be reconsidered so that requirements for autonomy and confidentiality are respected. In this context, enforcing Service Level Agreements (SLAs) between partners cannot be avoided. The following problem has to be solved: given an end-to-end service request and collections of SLAs on each participating carrier, establish an end-to-end contract, which gives an optimal service under reliable QoS guarantees. In previous works, we described distributed processes based on dynamic programming principles. In this article, we depict a distributed adaptation of a meta-heuristic algorithm, known as Ant Colony algorithm. We demonstrate that the performances of this algorithm are competitive to other works.