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 a parallel-server system with K homogeneous servers where incoming tasks, arriving at rate λ, are dispatched by n dispatchers. Servers are FCFS queues and dispatchers implement a size-based policy such that the servers are equally loaded. We compare the performance of a system with n> 1 dispatchers and of a system with a single dispatcher. Every dispatcher handles a fraction 1/n of...
In pickup and delivery problems with time windows (PDPTW), vehicles have to transport loads from pickup locations to delivery locations while respecting capacity and time constraints. When global capacity is not sufficient, the choice of locations to be served is an additional problem (selective variant). This paper presents an exact algorithm which solves the Selective PDPTW, where precedence constraints...
In recent years, the number of requests to transfer large files via large high-speed computer networks has been increasing rapidly. Typically, these requests are handled in the “best effort” manner and resulting in unpredictable completion times. In this paper, we consider a model where a transfer request either must be completed by a user-specified deadline or must be rejected if its deadline cannot...
This paper proposes a single adequate scheme for accessing the web sites instantly without delay in the web. By studying the existing techniques, new investigation has been done on DNS reply for improving performance of the web. As web traffic increases, improving the performance of the web has become a challenging issue. Efficient transmission of data through the existing network is necessary for...
Many methods have been researched to prolong sensor network lifetime using mobile technologies. In the mobile sink research, there are the track based methods and the anchor points based methods as representative operation methods for mobile sinks. However, the existing methods decrease Quality of Service (QoS) and lead the routing hotspot in the vicinity of the mobile sink. The reason is that they...
Efficient resource search in large-scale unstructured peer-to-peer (P2P) systems remains a fundamental challenge. In order to improve search performance, interest-based search is a good way to tackle the challenge. However, the existing interest-based search algorithms pay attention to user interest model and search history, but ignore some influence factors of improving performance. In this paper,...
To address the problems of resource sharing and utilization in the distributed environment, the paper aims to establish a resource overlay for the distributed system monitoring. The resource overlay can construct a logical space, and the type of the nodes in the space can be classified as host node and resource node. The host node and resource node are mapped into the logical space of network by the...
The power consumption of server systems used as part of online services is an important problem as these have become major energy users. Generally, such systems are dimensioned for peak loads and typically have average utilisations of 20-30%. This paper introduces a simple routing mechanism that uses overflow techniques to assign requests to these servers. As these mechanisms employ a staged process,...
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.