umu.sePublikasjoner
Endre søk
Begrens søket
1 - 5 of 5
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Treff pr side
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sortering
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
  • Standard (Relevans)
  • Forfatter A-Ø
  • Forfatter Ø-A
  • Tittel A-Ø
  • Tittel Ø-A
  • Type publikasjon A-Ø
  • Type publikasjon Ø-A
  • Eldste først
  • Nyeste først
  • Skapad (Eldste først)
  • Skapad (Nyeste først)
  • Senast uppdaterad (Eldste først)
  • Senast uppdaterad (Nyeste først)
  • Disputationsdatum (tidligste først)
  • Disputationsdatum (siste først)
Merk
Maxantalet träffar du kan exportera från sökgränssnittet är 250. Vid större uttag använd dig av utsökningar.
  • 1.
    Lakew, Ewnetu Bayuh
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Hernandez-Rodriguez, Francisco
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Xu, Lei
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Elmroth, Erik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Management of distributed resource allocations in multi-cluster environments2012Inngår i: Performance Computing and Communications Conference (IPCCC) 2012, 31st International, IEEE, New York, USA: IEEE , 2012, s. 275-284Konferansepaper (Annet vitenskapelig)
    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.

  • 2.
    Xu, Lei
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Elmroth, Erik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    A time interval-based credit reservation approach for prepaid composite services in cloud environments2011Inngår i: Web Services (ECOWS), 2011 Ninth IEEE European Conference on, 2011, s. 158-165Konferansepaper (Fagfellevurdert)
    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.

  • 3.
    Xu, Lei
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Jennings, Brendan
    Automating the generation, deployment and application of charging schemes for composed communications services2012Inngår i: 2012 IEEE Network operations and management symposium (NOMS), 2012, s. 853-859Konferansepaper (Fagfellevurdert)
    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.

  • 4.
    Xu, Lei
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Lakew, Ewnetu Bayuh
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Hernandez-Rodriguez, Francisco
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Elmroth, Erik
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    A Scalable Accounting Solution for Prepaid Services in Cloud Systems2012Inngår i: Proceedings of the 2012 IEEE Ninth International Conference on Services Computing, 2012, s. 81-89Konferansepaper (Fagfellevurdert)
    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.

  • 5.
    Xu, Lei
    et al.
    Umeå universitet, Teknisk-naturvetenskapliga fakulteten, Institutionen för datavetenskap.
    Shi, Lei
    Wang, Runxin
    Jennings, Brendan
    A multiple criteria service composition selection algorithm supporting time-sensitive rules2011Inngår i: 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, s. 718-721Konferansepaper (Fagfellevurdert)
    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.

1 - 5 of 5
RefereraExporteraLink til resultatlisten
Permanent link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf