A Revised Gomory-Hu Algorithm Taking Account of Physical Unavailability of Network Channels

  • Winfried AuzingerEmail author
  • Kvitoslava Obelovska
  • Roksolyana Stolyarchuk
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 1231)


The classical Gomory-Hu algorithm aims for finding, for given input flows, a network topology for data transmission and bandwidth of its channels which are optimized subject to minimal bandwidth criteria. In practice, it may occur that some channels between nodes of the network are not active. Ignoring such channels using the topology obtained be the Gomory-Hu algorithm will not lead to an optimal flow-rate.

In this paper the focus is on a modified algorithm taking into account deficient channels. While the classical algorithm generates a sequence of ring subnets, in our modified version the use of deficient channels is checked at intermediate stages in each cycle of the algorithm. When forming ring subnets, the availability of new channels to be introduced into the ring subnet is checked and in the case of unavailability another ring closest to the optimal one is selected. The network optimized by this modified algorithm guarantees the transmission of the maximum input stream.


Network topology Channel capacity Gomory-Hu algorithm 



(i) This work was realized within the framework of the Jean Monnet 2019 program under Erasmus+’611692-EPP-1-2019-1-UAEPPJMO-MODULE Data Protection in EU’.

It is also to be considered as a first step in a cooperation project under preparation, following up the joint Ukraine-Austria R & D project ‘Traffic and telecommunication networks modelling’, project No. UA 10/2017/0118U001750, M-130/2018 (cf [1]).

(ii) The authors thank Nadyja Popovuch, student at Lviv Polytechnic National University, for providing figures.


  1. 1.
    Auzinger, W., Obelovska, K., Stolyarchuk, R.: A modified Gomory-Hu algorithm with DWDM-oriented technology. In: Lirkov, I., Margenov, S. (eds.) LSSC 2019. LNCS, vol. 11958, pp. 547–554. Springer, Cham (2020). Scholar
  2. 2.
    Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton University Press, Princeton (1962)zbMATHGoogle Scholar
  3. 3.
    Gomory, R.E., Hu, T.C.: Multi-terminal network flows. J. Soc. Ind. Appl. Math. 9(4), 551–570 (1961)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Kasprzak, A.: Exact and approximate algorithms for topological design of Wide Area Networks with non-simultaneous single commodity flows. In: Sloot, P.M.A., Abramson, D., Bogdanov, A.V., Gorbachev, Y.E., Dongarra, J.J., Zomaya, A.Y. (eds.) ICCS 2003. LNCS, vol. 2660, pp. 799–808. Springer, Heidelberg (2003). Scholar
  5. 5.
    King, V.: Fully dynamic connectivity. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms. Springer, Boston (2015)Google Scholar
  6. 6.
    Larsson, C.: Design of Modern Communication Networks. Methods and Applications. Elsevier Ltd., Amsterdam (2014)Google Scholar
  7. 7.
    Tapolcai, J.: Routing algorithms in survivable telecommunication networks. Ph.D., Thesis Summary, Budapest, Hungary (2004)Google Scholar
  8. 8.
    Xin, Y., Baldine, I., Mandal, A., Heermann, C., Chase, J., Yumerefendi, A.: Embedding virtual topologies in networked clouds. In: CFI 2011 Proceedings of the 6th International Conference on Future Internet Technologies, Seoul, Korea, pp. 26–29. ACM New York (2011)Google Scholar
  9. 9.
  10. 10.
    Regulation (EU) 2016/679 of the European Parliament and of the Council of 27 April 2016 on the protection of natural persons with regard to the processing of personal data and on the free movement of such data, repealing Directive 95/46/EC (General Data Protection Regulation).

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Institute of Analysis and Scientific ComputingTU WienViennaAustria
  2. 2.Institute of Computer Science and Information TechnologiesLviv Polytechnic National UniversityLvivUkraine
  3. 3.Institute of Applied Mathematics and Fundamental SciencesLviv Polytechnic National UniversityLvivUkraine

Personalised recommendations