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 present an algorithm to implement “most balancing” packet scheduling policies in a discrete-time multi-server system of parallel queues with independent random queue-server connectivity. The MB policies are characterized by minimizing the total difference in queue lengths at every time slot. The proposed algorithm produces the server allocation strategy that achieves the minimum “imbalance index”...
A cloud-based, highly consumable queuing service must provide extreme scalability, flexible models of consistency, and high availability in the presence of network partitions. CAP theorem states that at most two of the three properties - Consistency, Availability, and Partition Tolerance - can be achieved at the same time for any shared data system. This paper presents the design and implementation...
This paper considers an M/G/1 like-queue production system, with an unreliable server under N-policy and single vacation. By renewal process and total probability decomposition, we analyze the system reliability. Several important reliability indexes are obtained and the unique relationship between a single unit repairable system and such a model is presented, which is help for analyzing more complicated...
We give a short survey of the moment properties of the basic regenerative queueing processes. Moreover, we show applicability of the regenerative simulation to estimate a steady-state performance measure of the positive recurrent basic process possessing long-range dependence. The moment properties of the embedded renewal process of regenerations play a crucial role in this analysis. We consider mainly...
In this paper we present a formal specification of a queueing network performance evaluation model for database designs. The purpose of the model is to provide what if comparisons of database designs before database system implementation. The performance model is applied to the performance evaluation of three database designs of an implementation of the TPC-C benchmark. Experimental evaluation showed...
This paper describes a new multicast scheduling scheme for multi-massive-online (MMO) applications in mobile networks. In order to reduce the amount of traffic volume, multicast channels should be fully utilized for information sharing among users while unicast channels are used to notify the current states of the users to the servers. On the other hand, most mobile terminals cannot use both multicast...
A stochastic control problem motivated by broadcast applications is considered in this paper. A natural queueing model abstraction in which each service to a queue clears all the customers at once is adopted, which can also be considered as a batch processing queueing model with infinite batch size. Each broadcast can be charged a non-negative cost. In addition, there is a cost whose rate is given...
Recently, wireless LANs have been used widely because they are flexible and easy to install. However, there are unfairness problems in wireless LANs, in that a small number of stations (STAs) may obtain a large throughput while other STAs hardly get any bandwidth. One of the unfairness problems occurs between upstream and downstream flows because the access point (AP) and each STA have the same transmission...
Web service is selected as the key technology to design a search engine based on B/S architecture. Several spider clients are deployed on many computers to finish crawling Web pages in this B/S architecture after all Web pages have been analyzed and purified. And some useful Web pages are stored into database for index design. These spider clients are controlled by a spider server. Finally some indexes...
Service discovery is indispensable to both resource sharing and service integration in the Internet/Grid. In the face of enormous and various services which scatter in the Internet/Grid, the central issue needed to be addressed by a service discovery system is how to quickly shrink the search scope and exactly locate the desired services. Moreover, since simulation experiments are limited in the number...
We propose a programmable and scalable traffic management scheme. Programmable traffic management at high-speed routers is difficult because programmability and high-speed packet processing have involved a serious tradeoff. To attain both, the new scheme combines control programs at a control server and simple packet handling functions, such as sampling packet headers and discarding packets, at routers...
In this paper we apply the Gittins optimality result to characterize the optimal scheduling discipline in a multi-class M/G/1 queue. We apply the general result to several cases of practical interest where the service time distributions belong to the set of decreasing hazard rate distributions, like Pareto or hyper-exponential. When there is only one class it is known that in this case the least attained...
A self-clocked traffic scheduling algorithm is proposed by modifying the virtual time function in the well known fair queueing algorithm, SCFQ. It can be shown that by this modification, the fairness index and the packets worst case delay will remain bounded and these bound are the same as those of SCFQ. Then, simulation is invoked to show the effectiveness of our modification, by showing improvements...
In this paper, we establish a many-sources large deviations principle (LDP) for the stationary workload of a multi-queue single-server system with simplex capacity, operated under a stabilizing and non-idling maximum-weight scheduling policy. Assuming a many-sources sample path LDP for the arrival processes, we establish an LDP for the workload process by employing Garcia's extended contraction principle...
Location based services is considered as a killer application in the wireless data market that provide information based on locations specified in the queries. We consider wireless data broadcasting as a way of disseminating information to a massive number of users. To address the issues of responsiveness, energy consumption and bandwidth contention in wireless communications, an index has to minimize...
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.