Advertisement

Acta Informatica

, Volume 34, Issue 8, pp 579–595 | Cite as

Minimal communication cost software construction in the Internet environment

  • Chi-Chung Hui
  • Samuel T. Chanson

Abstract.

This paper investigates the issue of building software in the Internet environment, where local area network (LAN) based systems are interconnected by links with different bandwidth and do not share file systems. The software is modeled as a directed acyclic graph. Each node in the graph represents a logical step in processing the software while the edges describe the order of execution. The problem is to construct the software at a particular LAN with minimum Internet communication cost. An optimal polynomial algorithm, SOFTCON, with time complexity \({\cal O}(N C + E + {\cal A}(N, N + E))\) is presented, where \(N\) and \(E\) are the number of nodes and edges in the graph describing the software respectively, \(C\) is the number of LANs in the Internet environment, and \({\cal O}({\cal A}({\cal N}, {\cal E}))\) is the time complexity of the network flow algorithm on the flow network with \({\cal N}\) nodes and \({\cal E}\) edges transformed from the directed acyclic graph of the software.

Keywords

Time Complexity Local Area Area Network Directed Acyclic Graph Communication Cost 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Chi-Chung Hui
    • 1
  • Samuel T. Chanson
    • 1
  1. 1. Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Hong Kong (e-mail: {cchui,chanson}@cs.ust.hk) HK

Personalised recommendations