Knapsack problems: algorithms and computer implementations
Knapsack problems: algorithms and computer implementations
Linear programming and convex hulls made easy
SCG '90 Proceedings of the sixth annual symposium on Computational geometry
How good are convex hull algorithms?
Proceedings of the eleventh annual symposium on Computational geometry
The quickhull algorithm for convex hulls
ACM Transactions on Mathematical Software (TOMS)
Agent-Based Negotiations for Multi-provider Interactions
ASA/MA 2000 Proceedings of the Second International Symposium on Agent Systems and Applications and Fourth International Symposium on Mobile Agents
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
ICCS '02 Proceedings of the The 8th International Conference on Communication Systems - Volume 01
End-to-end quality of service provisioning through inter-provider traffic engineering
Computer Communications
Advanced QoS provisioning in IP networks: the European premium IP projects
IEEE Communications Magazine
Admission control for providing QoS in DiffServ IP networks: the TEQUILA approach
IEEE Communications Magazine
Cadenus: creation and deployment of end-user services in premium IP networks
IEEE Communications Magazine
Provisioning for interdomain quality of service: the MESCAL approach
IEEE Communications Magazine
COPS-SLS usage for dynamic policy-based QoS management over heterogeneous IP networks
IEEE Network: The Magazine of Global Internetworking
Hi-index | 0.00 |
Multi-media services and other critical multi-site services (e.g. VPN) are becoming mainstream, and require a guaranteed Quality of Service (QoS). Services need to be established across several domains, often to connect multi-domain end-users. Thus, provisioning and control of end-to-end QoS requirements arises as one of the main challenges in X-domain management. While the use of QoS contracts (Service Level Agreements, SLAs) is crucial, the problem of QoS guarantees goes beyond the scope of contracts between one server and one client. End-to-end QoS contracts are subject to cumulation effects that must be taken into account. Moreover, several paths of contracts may satisfy the user's QoS requirements. While our previous work studied negotiation of end-to-end QoS contracts for single service requests, we turn here to pipes that handle large numbers of requests, allocating from a variety of contract chains between a fixed source and a fixed target domain. For incoming requests, a pipe selects from a pre-established set of contract chains, rather then launching a new negotiation. This paper studies the optimization and constraint resolution problems arising in pipe negotiation.