#### Filter Results:

#### Publication Year

2006

2009

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

PageRank is one of the principle criteria according to which Google ranks Web pages. PageRank can be interpreted as a frequency of visiting a Web page by a random surfer and thus it reflects the popularity of a Web page. Google computes the PageRank using the power iteration method which requires about one week of intensive computations. In the present work… (More)

We analyze the Two Level Processor Sharing (TLPS) scheduling discipline with hyper-exponential distribution for the job size and with Poisson arrival process. TLPS is a convenient model to represent the file size based differentiation in TCP/IP networks. We find a closed form analytic expression for the expected sojourn time and an approximation for the… (More)

—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… (More)

— We study the Processor-Sharing queueing model with a hyper-exponential service time distribution and Poisson batch arrival process. In the case of the hyper-exponential service time distribution we find an analytical expression for the expected conditional response time function and obtain an alternative proof of its concavity with respect to the service… (More)

Discriminatory Processor Sharing policy introduced by Kleinrock is of a great interest in many application areas, including telecommunications, web applications and TCP flow modelling. Under the DPS policy the job priority is controlled by the vector of weights. Verifying the vector of weights it is possible to modify the service rates of the jobs and… (More)

We present the software tool "Web Graph Analyzer". This tool is designed to perform a comprehensive analysis of the Web Graph structure. By Web Graph we mean a graph whose vertices are Web pages and whose edges are hyper-links. With the help of the Web Graph Analyzer we can study the local graph characteristics such as numbers and sets of incoming/outgoing… (More)

- ‹
- 1
- ›