作者: BHUVAN URGAONKAR , ARNOLD L. ROSENBERG , PRASHANT SHENOY
DOI: 10.1142/S012905410700511X
关键词:
摘要: The APPLICATION PLACEMENT PROBLEM (APP, for short) arises in hosting platforms: clusters of servers that are used large, distributed applications such as Internet services. Hosting platforms imply a business relationship between an entity called the platform provider and number entities application providers. latter pay former resources on platform, return which, provides guarantees resource availability applications. This implies should host only which it has sufficient resources. objective APP is to maximize can be hosted while satisfying their requirements. complexity studied here, with following results. general NP-hard; indeed, even restricted versions may not admit polynomial-time approximation schemes. However, several significant variants online version efficient algorithms.