umu.sePublications
Change search
Link to record
Permanent link

Direct link
BETA
Xu, Lei
Publications (5 of 5) Show all publications
Xu, L., Lakew, E. B., Hernandez-Rodriguez, F. & Elmroth, E. (2012). A Scalable Accounting Solution for Prepaid Services in Cloud Systems. In: Proceedings of the 2012 IEEE Ninth International Conference on Services Computing: . Paper presented at IEEE Ninth International Conference on Services Computing, Honolulu, HI, 24-29 June 2012 (pp. 81-89).
Open this publication in new window or tab >>A Scalable Accounting Solution for Prepaid Services in Cloud Systems
2012 (English)In: Proceedings of the 2012 IEEE Ninth International Conference on Services Computing, 2012, p. 81-89Conference paper, Published paper (Refereed)
Abstract [en]

Prepaid charging, an essential option for the accounting of cloud services, provides effective financial control for both service providers and customers. However, it has to be supported by real-time credit checking and cost calculation. These real-time actions consume resources of the providers' network and impose high overhead. To tackle this issue, we present a scalable accounting solution in which an accounting component is hosted in every cluster constituting a cloud system. Each of our accounting component supervises service consumptions based on a calculated interval of a service bundle that is composed of all services hosted in a cluster and consumed by one customer simultaneously. Credit will be re-allocated when a customer's credit in one cluster is not enough to compensate further usage, and the allocation is performed based on service consumptions. This work is intended to reduce the cost of prepaid services and to ensure service provision is not hampered by the charging part. Additionally, we perform theoretical and experimental analyses that indicate this work can provide an inexpensive accounting solution for the long-lived services in storage clouds.

Series
SCC ’12
Keywords
Accounting Systems, prepaid accounting
National Category
Engineering and Technology Computer and Information Sciences
Identifiers
urn:nbn:se:umu:diva-80122 (URN)10.1109/SCC.2012.40 (DOI)978-1-4673-3049-7 (ISBN)
Conference
IEEE Ninth International Conference on Services Computing, Honolulu, HI, 24-29 June 2012
Available from: 2013-09-09 Created: 2013-09-09 Last updated: 2018-06-08Bibliographically approved
Xu, L. & Jennings, B. (2012). Automating the generation, deployment and application of charging schemes for composed communications services. In: 2012 IEEE Network operations and management symposium (NOMS): . Paper presented at 13th IEEE/IFIP Network Operations and Management Symposium, APR 16-20, 2012, Maui, HI (pp. 853-859).
Open this publication in new window or tab >>Automating the generation, deployment and application of charging schemes for composed communications services
2012 (English)In: 2012 IEEE Network operations and management symposium (NOMS), 2012, p. 853-859Conference paper, Published paper (Refereed)
Abstract [en]

Creating composed services dynamically to meet the demand of every individual customer can be an inexpensive way for a service provider to differentiate itself from its competitors. Charging and billing systems are one of the key components supporting this business model. However, many existing charging and billing systems suffer from their time-consuming scheme 1 configuration process. This limits the flexibility of service providers to offer composed services. This paper proposes a framework named Accounting Logic Generator (ALG) that automates the generation and deployment of charging schemes for composed services. It processes a two-part charging scheme which contains rules that can be used to govern how the usage of a service is charged for when it is executed standalone, used in the context of a composed service, invoked within specific time intervals of interest or completed successfully in the context of composed service invocations where one or more other services fail. Furthermore, an approach that estimates service cost for the selection process of service composition is presented.

Series
IEEE IFIP Network Operations and Management Symposium
National Category
Computer Sciences
Identifiers
urn:nbn:se:umu:diva-61795 (URN)000309517000123 ()978-1-4673-0268-5 (ISBN)
Conference
13th IEEE/IFIP Network Operations and Management Symposium, APR 16-20, 2012, Maui, HI
Available from: 2012-11-27 Created: 2012-11-26 Last updated: 2018-06-08Bibliographically approved
Lakew, E. B., Hernandez-Rodriguez, F., Xu, L. & Elmroth, E. (2012). Management of distributed resource allocations in multi-cluster environments. In: Performance Computing and Communications Conference (IPCCC) 2012, 31st International, IEEE. Paper presented at IEEE 31st International Performance Computing and Communications Conference (IPCCC)2012-12-01--03, Austin, Texas, USA (pp. 275-284). New York, USA: IEEE
Open this publication in new window or tab >>Management of distributed resource allocations in multi-cluster environments
2012 (English)In: Performance Computing and Communications Conference (IPCCC) 2012, 31st International, IEEE, New York, USA: IEEE , 2012, p. 275-284Conference paper, Published paper (Other academic)
Abstract [en]

We present a fully distributed solution for managing resource allocation for services running across multiple clusters in a large-scale cloud computing environment. Our solution allows individual services running across clusters to compete dynamically for allocations based on their rate of consumption while maintaining the global cloud level allocation limits. The solution monitors resource consumption by services that are spread over a number of clusters. Global polls are triggered only when the allocated balance in a cluster decreases below a threshold and allocations are reassigned in a manner that avoids further immediate global polls. Our solution achieves scalability by minimizing global message exchanges, increases performance by distributing requests, and improves availability by avoiding a single point of failure. We perform a range of simulations to verify the accuracy of our approach, to validate our theoretical results, and to evaluate against competing approaches.

Place, publisher, year, edition, pages
New York, USA: IEEE, 2012
Series
2012 IEEE 31ST International performance computing and communications conference (IPCCC), ISSN 1097-2641
Keywords
Distributed monitoring, distributed resource allocations management, distributed quota management
National Category
Computer Sciences
Identifiers
urn:nbn:se:umu:diva-66430 (URN)10.1109/PCCC.2012.6407768 (DOI)000313524400040 ()978-1-4673-4881-2 (ISBN)
Conference
IEEE 31st International Performance Computing and Communications Conference (IPCCC)2012-12-01--03, Austin, Texas, USA
Available from: 2013-02-22 Created: 2013-02-19 Last updated: 2018-06-08Bibliographically approved
Xu, L., Shi, L., Wang, R. & Jennings, B. (2011). A multiple criteria service composition selection algorithm supporting time-sensitive rules. In: Nazim Agoulmine, Claudio Bartolini, Tom Pfeifer, Declan O'Sullivan (Ed.), Proceedings of the12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011): Dublin, Ireland, 23—27 May 2011. Paper presented at IFIP/IEEE International Symposium on Integrated Network Management (IM 2011), 23-27 May 2011, Dublin, Ireland (pp. 718-721). Institute of Electrical and Electronics Engineers (IEEE)
Open this publication in new window or tab >>A multiple criteria service composition selection algorithm supporting time-sensitive rules
2011 (English)In: Proceedings of the12th IFIP/IEEE International Symposium on Integrated Network Management (IM 2011): Dublin, Ireland, 23—27 May 2011 / [ed] Nazim Agoulmine, Claudio Bartolini, Tom Pfeifer, Declan O'Sullivan, Institute of Electrical and Electronics Engineers (IEEE) , 2011, p. 718-721Conference paper, Published paper (Refereed)
Abstract [en]

Constructing composite services by using of services offered by third parties is an attractive and inexpensive way for service brokers and aggregators to enhance differentiation from their competitors. When multiple services provide the same or similar functionalities, selecting those that satisfy users' non-functional requirements is crucial. In many cases, non-functional properties of services are heavily dependent on the activity of the network delivering those services whilst the network activity follows certain time-sensitive rules. We present a service selection algorithm that takes into account time-sensitive variations of non-functional propensities of services to identify a service combination offering the highest quality within a specified time interval.

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers (IEEE), 2011
National Category
Computer and Information Sciences
Research subject
Computer Science
Identifiers
urn:nbn:se:umu:diva-52277 (URN)10.1109/INM.2011.5990664 (DOI)978-1-4244-9220-6 (ISBN)978-1-4244-9219-0 (ISBN)
Conference
IFIP/IEEE International Symposium on Integrated Network Management (IM 2011), 23-27 May 2011, Dublin, Ireland
Available from: 2012-02-20 Created: 2012-02-15 Last updated: 2018-06-08Bibliographically approved
Xu, L. & Elmroth, E. (2011). A time interval-based credit reservation approach for prepaid composite services in cloud environments. In: Web Services (ECOWS), 2011 Ninth IEEE European Conference on. Paper presented at ECOWS 2011: The European Conference on Web Services, 14-16 september 2011, Lugano Switzerland (pp. 158-165).
Open this publication in new window or tab >>A time interval-based credit reservation approach for prepaid composite services in cloud environments
2011 (English)In: Web Services (ECOWS), 2011 Ninth IEEE European Conference on, 2011, p. 158-165Conference paper, Published paper (Refereed)
Abstract [en]

A typical business model in cloud environments for service providers is the provision of composite services built from resources and services offered by other providers. Customers of these composite services can make an advance payment before consumption. In this scenario, accounting systems will supervise each service comprising given composite services individually. As the number of constituent services and requests submitted by customers increase dramatically, scalability issues arise. To tackle this problem, we present an approach that estimates the highest cost of a given composite service composed of multiple pre-paid services, and then calculates the duration of a time interval based on which accounting systems access and update target customers' account. It is intended to reduce overhead imposed by supervising services individually in real-time. Commercial agreements between involved business partners and potential economic compensations due to the violation of Service Level Agreement (SLA) are mirrored in the cost estimation.

National Category
Computer Sciences
Identifiers
urn:nbn:se:umu:diva-51027 (URN)10.1109/ECOWS.2011.14 (DOI)978-1-4577-1532-7 (ISBN)
Conference
ECOWS 2011: The European Conference on Web Services, 14-16 september 2011, Lugano Switzerland
Available from: 2012-01-09 Created: 2012-01-09 Last updated: 2018-06-08Bibliographically approved
Organisations

Search in DiVA

Show all publications