Resource management in a hierarchical network

Abstract

A distributed algorithm for resource management in a hierarchical network is introduced which uses dynamic information about the system state in local and wide area networks. The algorithm uses broadcast information to make decision about process transfer and message routing, considering processor availability and system security. The algorithm establishes a path from the source to the destination by using information about the transfer and waiting time. Performance of the algorithm is analyzed using the elapsed time of process or message transfer and the waiting time to begin transfer. This algorithm can be implemented as part of operating system software to make decisions about process transfer and message routing in a hierarchical network.<>