Dr. A. Shanmugam Principal, Bannari Amman Institute of Technology, Sathyamangalam – 638401 Email: [email protected] ------------------------------------------ABSTRACT------------------------------------------------------------------The World Wide Web is a vast network of documents that are linked together a set of protocols defining how the system work and transfer data. The explosion of...

* This paper is supported by National 863 Hi-Tech R&D Project under grant No.2002AA1Z2102 Abstract with the dramatically increasing of users accessing Internet services, many researchers employed cluster server to provide their Internet services and proposed all kinds of scheduling strategies to address the imbalance among real servers. However, most of them are based on TCP connections and pay...

Data centers today are heterogeneous: they have servers from multiple generations and multiple vendors; server machines have multiple cores that are capable of running at difference speeds, and some have general purpose graphics processing units (GPGPU). Hardware trends indicate that future processors will have heterogeneous cores with different speeds and capabilities. This environment enables...

We consider an optimisation problem which is motivated from storage virtualisation in the Internet. While storage networks make use of dedicated hardware to provide homogeneous bandwidth between servers and clients, in the Internet, connections between storage servers and clients are heterogeneous and often asymmetric with respect to upload and download. Thus, for a large file, the question ari...

In this paper, we develop a general model, called Latency-Rate servers (LR servers), for the analysis of traffic scheduling algorithms in broadband packet networks. The behavior of an LR server is determined by two parameters—the latency and the allocated rate. Several well-known scheduling algorithms, such as Weighted Fair Queueing, VirtualClock, SelfClocked Fair Queueing, Weighted Round Robin...

In this note, we show that existing results for optimal routing policies in the slow server problem with more than two heterogeneous servers are incomplete.

High performance servers of heterogeneous computing environments, as can be found in data centers for cloud computing, consume immense amounts of energy even though they are usually underutilized. In times when not all computing capabilities are needed the task to be solved is how to distribute the computational load in a power-efficient manner. The question to be answered is, what load partiti...

We consider the job assignment problem in a multi-server system consisting of N parallel processor sharing servers, categorized into M (≪ N) different types according to their processing capacity or speed. Jobs of random sizes arrive at the system according to a Poisson process with rate Nλ. Upon each arrival, a small number of servers from each type is sampled uniformly at random. The job is t...

This paper investigates the concept of a Markovian queueing model with heterogeneous, intermittently available servers feedback under hybrid vacation policy. Both asymmetric transition representation and policy are addressed in this article. The necessary sufficient conditions for system stability presented. In addition, steady-state probability distribution was derived by employing matrix geom...