Modeling a resource contention in the management of virtual organizations

A virtual organization provides a cost-efficient method allowing different autonomous entities, such as organizations, departments and individuals, to extend service offerings in a virtual marketplace. To support cost-efficient service provisioning, a suitable procedure must be applied to determine...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Information sciences Ročník 180; číslo 17; s. 3108 - 3116
Hlavní autor: Do, Tien Van
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Inc 01.09.2010
Témata:
Algorithms
Computer simulation
Fast computational algorithm
Marketing
Mathematical models
Performance model
Provisioning
Queueing model
Resource contention
Resource management
Resources management
Steady state
Virtual organization
Queueing model
Virtual organization
Resource management
Performance model
Resource contention
Fast computational algorithm
ISSN:0020-0255, 1872-6291
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A virtual organization provides a cost-efficient method allowing different autonomous entities, such as organizations, departments and individuals, to extend service offerings in a virtual marketplace. To support cost-efficient service provisioning, a suitable procedure must be applied to determine the amount of resources necessary for the operation of virtual organizations. We propose a new mathematical model for a quantitative performance evaluation of resource management in virtual organizations. We present an efficient algorithm to determine the steady state probabilities and the performance measures of the system. A comparison with a detailed simulation model and other numerical approaches shows that the proposed algorithm is fast and accurate. This algorithm can therefore be used for resource dimensioning to support the cost-efficient operation of virtual organizations.
Bibliografie:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2010.04.027