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
Claudia Di Napoli;
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:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_331223-doc_102195.pdf
solo utenti autorizzati
Descrizione: Computing Pareto Optimal Agreements in Multi-issue Negotiation for Service Composition
Tipologia:
Versione Editoriale (PDF)
Licenza:
Nessuna licenza dichiarata (non attribuibile a prodotti successivi al 2023)
Dimensione
461.7 kB
Formato
Adobe PDF
|
461.7 kB | Adobe PDF | Visualizza/Apri Richiedi una copia |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
