Toggle Main Menu Toggle Search

Open Access padlockePrints

Optimal tree structures for large service networks

Lookup NU author(s): Dr Jennie Palmer, Emeritus Professor Isi Mitrani

Downloads

Full text for this publication is not currently held within this repository. Alternative links are provided below where available.


Abstract

We consider the problem of how best to structure and control a distributed computer system containing many processors. The performance trade-offs associated with different tree structures are evaluated approximately by applying appropriate queueing models. It is shown that, for a given set of parameters and job distribution policy, there is an optimal tree structure that minimizes the overall average response time. This is obtained numerically through comparison of average response times. A simple heuristic policy is shown to perform well under certain conditions. © 2005 IEEE.


Publication metadata

Author(s): Palmer J, Mitrani I

Editor(s): Sabella, R

Publication type: Conference Proceedings (inc. Abstract)

Publication status: Published

Conference Name: 1st EuroNGI Conference on Next Generation Internet Networks (NGI)

Year of Conference: 2005

Pages: 91-98

Publisher: IEEE

URL: http://dx.doi.org/10.1109/NGI.2005.1431652

DOI: 10.1109/NGI.2005.1431652

Library holdings: Search Newcastle University Library for this item

ISBN: 078038900X


Share