In a market of services, customers require Service Based Applications (SBAs) with specific QoS constraints usually expressed as end-to-end requirements. Here, we show that mechanisms used to find Pareto optimal agreements can be extended in order to compute them also in the case of negotiation for market-based service composition, where different provider agents compete to provide the same service. Moreover, we discuss how these mechanisms allow a cus-tomer agent to concurrently negotiate with all available service provider agents.
Computing Pareto Optimal Agreements in Multi-issue Negotiation for Service Composition
2015
Abstract
In a market of services, customers require Service Based Applications (SBAs) with specific QoS constraints usually expressed as end-to-end requirements. Here, we show that mechanisms used to find Pareto optimal agreements can be extended in order to compute them also in the case of negotiation for market-based service composition, where different provider agents compete to provide the same service. Moreover, we discuss how these mechanisms allow a cus-tomer agent to concurrently negotiate with all available service provider agents.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
