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.
We consider the problem of joint service rate control and load balancing of a network of servers. The system incurs holding cost, effort cost, and a routing cost whenever a demand is routed to other servers. This formulation is motivated by recent interest on energy efficiency in IT systems where effort cost models power consumption and holding cost represents performance in terms of delay. The aim...
Video-on-demand (VOD) can broadly be categorized into two groups, namely Interactive VOD (IVOD) and near VOD (NVOD). This paper examines the resource allocation problems in a VOD network which provides a mixture of IVOD and NVOD services (RAPINVOD). The RAPINVOD problem is to determine where to install VSs for IVOD services, taking into consideration customers' demand and which programs should be...
We study streaming of scalable videos over peer-to-peer (P2P) networks. We focus on efficient management of seed servers resources, which need to be deployed in the network to make up for the limited upload capacity of peers in order to deliver higher quality video streams. These servers have finite serving capacity and are often loaded with a volume of requests larger than their capacity. We formulate...
The contradiction between distributed-GIS massive data and the limited bandwidth of network resources is becoming more and more serious, inquiry of distant vector data and transmission of massive data become the crisis key of the problem. Based on analyzing the method of massive data inquiry, combing with the query optimized method of spatial database and the cost function, we proposed a novel vector...
Auction mechanisms have been proposed as a means to efficiently and fairly schedule jobs in high-performance computing environments. The generalized vickrey auction has long been known to produce efficient allocations while exposing users to truth-revealing incentives, but the algorithms used to compute its payments can be computationally intractable. In this paper we present a novel implementation...
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.