A new HAD algorithm for optimal routing of hierarchicallystructured data networks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

In this paper a new algorithm based on aggregation/disaggregation and decomposition/composition (HAD) scheme is proposed to solve the optimal routing problems (ORP) for hierarchically structured networks. Our algorithm has two major differences with the existing HAD algorithms for hierarchically clustered networks: 1. Our algorithm works with networks which are more general than networks with clustered structure; 2. Our algorithm parallelizes the computations for different commodities so that it speeds up with a parallel time complexity of O(mlog 2 (n)), which is much less than O(Mlog 2(n)) needed for the existing HAD algorithms, for an n-node network with M commodities. Here, misa positive number usually much smaller than M and is a function of the patterns of all the commodities. The implementation of the algorithm for a 200-node network is simulated using the OPNET simulation package

Original languageEnglish
Title of host publicationINFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies
Pages594-601
Number of pages8
Volume2
DOIs
Publication statusPublished - 1 Dec 1995
Externally publishedYes
EventINFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies - Boston, MA, United States
Duration: 2 Apr 19956 Apr 1995

Other

OtherINFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies
CountryUnited States
CityBoston, MA
Period2/4/956/4/95

    Fingerprint

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Huang, G. M., & Zhu, S. (1995). A new HAD algorithm for optimal routing of hierarchicallystructured data networks. In INFOCOM'95 - 14th Annual Joint Conference of the IEEE Computer and Communications Societies (Vol. 2, pp. 594-601). [515926] https://doi.org/10.1109/INFCOM.1995.515926