Allocation of Computing Resources in Two-Tier Hierarchical Wide Area Networks: An Heuristic Algorithm

This paper addresses the problem of simultaneously design of large WAN satisfying quality demands and allocation of computing resources across the network. Model of the grid structure with hierarchical communication network is presented. Data is generated in the central node, then divided into blocks and distributed among nodes which can be located in different autonomous systems represented by 1 st level networks. Nodes participating in the grid structure perform computation of blocks. Next, results are sent to the central repository. Both computation and data transfer between node and the central repository introduces a cost. The goal is to select allocation of computing resources, channel capacities and flow routes in order to minimize linear combination of the total average delay per packet and leasing cost of channel capacities of 2 nd level network,

[1]  Andrzej Kasprzak.  Topological design of the wide area networks with nonsimultaneous single commodity flow , 1995 .

[2]  Rajkumar Buyya,et al.  A taxonomy and survey of grid resource management systems for distributed computing , 2002, Softw. Pract. Exp..

[3]  Franco Travostino,et al.  Grid networks : enabling grids with advanced communication technology , 2006 .

[4]  Przemyslaw Ryba,et al.  The Gateways Location and Topology Assignment Problem in Hierarchical Wide Area Networks: Algorithms and Computational Results , 2006, ICCSA.

[5]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[6]  David P. Anderson,et al.  SETI@home: an experiment in public-resource computing , 2002, CACM.

[7]  Przemyslaw Ryba,et al.  An Approximate Algorithm for the Minimal Cost Gateways Location, Capacity and Flow Assignment in Two-Level Hierarchical Wide Area Networks , 2006, International Conference on Computational Science.

[8]  Radu Prodan,et al.  Grid Computing, Experiment Management, Tool Integration, and Scientific Workflows , 2007, Lecture Notes in Computer Science.

[9]  Przemyslaw Ryba,et al.  An Exact Algorithm for the Minimal Cost Gateways Location, Capacity and Flow Assignment Problem in Two-Level Hierarchical Wide Area Networks , 2007, ICCSA.

[10]  Farouk Kamoun,et al.  Optimal clustering structures for hierarchical topological design of large computer networks , 1980, Networks.

[11]  David P. Anderson,et al.  BOINC: a system for public-resource computing and storage , 2004, Fifth IEEE/ACM International Workshop on Grid Computing.