The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
In this paper, we present a system that optimally and dynamically allocates the available computing resources to virtual machines that support virtual collaboration environments. Such environments are emerging fast via on-line social networks, virtual worlds, and the "Web 3.0" or "collaborative Web" paradigm. We use a utility-based framework to differentiate the applications hosted...
In this paper, we introduce a model for allocating available resources in service-oriented network, with particular focus on delay sensitive services. The model is based on a pricing scheme for the offered services and also takes into consideration the quality of service requirements of each service class through a probabilistic delay-bound constraint. The proposed policy is dynamic in nature and...
In this paper, we present a distributed algorithm to dynamically allocate the available resources of a service-oriented network to delay sensitive network services. We use a utility-based framework to differentiate services based on both their relative profitability and quality-of-service requirements. Our performance metric is the end-to-end delay that a service class experiences in the network....
In this paper, we enhance our previous work regarding optimal resource allocation of next generation network services under a flat pricing scheme and quality of service policies. We present a complete framework that makes our model to dynamically allocate the resources whenever required. In order to do that, we apply an online traffic estimator and we monitor traffic changes using an Exponentially...
In this paper, we introduce a pricing model that ensures efficient resource allocation that provides guaranteed quality of service while maximizing profit in multiservice networks. Specifically, a dynamic allocation policy is examined that relies on online measurements while each service class operates under a probabilistic bound delay constraint. We present a rigorous analysis of the properties of...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.