An Exact Algorithm for Host Allocation, Capacity and Flow Assignment Problem in WAN

Part of the IFIP — The International Federation for Information Processing book series (IFIPAICT, volume 104)


The paper presents the exact algorithm for capacity and flow assignment and hosts allocation problem in wide area computer networks. The problem consists in selection of flow routes, channel capacities and hosts allocation at nodes in order to minimize the total average delay per packet and the connecting cost of the hosts at nodes subject to budget constraint. The branch and bound method to construct the exact algorithm for solving the considered problem is used.


computer networks CFA problem wide area network network design 


  1. [1]
    AL-FAWZAN, M. A., HOYMANY F., Placement of network servers in wide-area network, Computer Networks, 2000, 34, pp. 355–361.CrossRefGoogle Scholar
  2. [2]
    KASPRZAK A., Topological Design of the Wide Area Networks, Wroclaw University of Technology Press, Wroclaw, 2001.Google Scholar
  3. [3]
    KASPRZAK A., MARKOWSKI M., Host Allocation Problem in TCP/IP Wide Area Networks,Proc. XXIInd Intern. Colloquium Advanced Simulation of Systems,Acta MOSIS No. 82, Sv. Hostyn—Ostrava, 2000, s. 285–289.Google Scholar
  4. [4]
    AMIRI A., PIRKUL H., Routing and capacity assignment in backbone communication networks, Computers & Operations Research, 1997, vol. 24, no. 3, pp. 275–287.CrossRefGoogle Scholar
  5. [5]
    CHUNG GU KANG, TAN HH., Combined channel allocation and routing algorithms in packed switched networks, Computer Communications, 1997, vol. 20, no. 13, pp. 1175–1190.CrossRefGoogle Scholar
  6. [6]
    GAVISH B., NEUMAN I., A System for Routing and Capacity Assignment in Computer Communication Networks, IEEE Trans. on Communication, 1989, vol. 37, pp. 360–366.CrossRefGoogle Scholar
  7. [7]
    GOLA M., KASPRZAK A., An Exact Algorithm for Capacity and Flow Assignment in Wide Area Computer Networks,Proc. 13th European Meeting on Cybernetics and Systems Research Cybernetics and Systems ‘86,Vienna, Vol. 2, 1996, s. 855–860.Google Scholar
  8. [8]
    KASPRZAK A., An exact algorithm for routing and capacity assignment in computer communication networks,Systems Science, Vol. 19, 1993, s. 69–81.Google Scholar
  9. [9]
    KLEINROCK L., Queueing Systems, Volume II: Computer Applications,John Wiley and Sons, New York,1976.Google Scholar
  10. [10]
    FRATTA L., GERLA M., KLEINROCK L., The Flow Deviation Method: An Approach to Store-and-Forward Communication Network Design,Networks, Vol. 3, 1973, s. 97133.Google Scholar

Copyright information

© IFIP International Federation for Information Processing 2002

Authors and Affiliations

  1. 1.The Chair of Systems and Computer NetworksWroclaw University of TechnologyWroclawPoland

Personalised recommendations