A New HAD Algorithm for Optimal Routing of Hierarchically Structured Data Networks

@inproceedings{Huang1995ANH,
  title={A New HAD Algorithm for Optimal Routing of Hierarchically Structured Data Networks},
  author={Garng M. Huang and Shan Zhu},
  booktitle={INFOCOM},
  year={1995}
}
In this paper, a new algorithm based on hierarchical aggregation/disaggregation and decomposition/composition (HAD) scheme is proposed to solve the optimal routing problems (ORP) for hierarchically structured networks of multi-layer backbones. Our algorithm has two major differences with the existing HAD algorithms for hierarchically clustered networks [l], [2]: 1) our algorithm works with more general networks than the networks with the clustered structure; 2) our algorithm parallelizes the… CONTINUE READING

From This Paper

Topics from this paper.
6 Citations
9 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-9 of 9 references

MS degree in computer science from Hangzhou University, Hangzhou, China, in 1985. He received his PhD in electrical engineering from Texas A&M University, College Station

  • Shan Zhu
  • 1995

Control and Management of Large and Dynamic Networks,

  • W. T. Tsai
  • PhD dissertation, Dept. of Electrical Eng. and…
  • 1985

Optimal Routing and Flow Control Methods for Communication Networks," A

  • D. Bertsekas
  • Bensoussan and J.L. Lions, eds., Analysis and…
  • 1982

Bertsekas , " A Class of Optimal Routing Algorithms for Communication Networks

  • P. D.
  • 1980

Two Parallel Algorithms for Shortest Path Problems,

  • N. Deo, C. Pang, R. E. Lord
  • Numerische Mathematik,
  • 1980

The Gradient Projection Algorithm for Multiple Routing in Message-Switched Networks,

  • M. Schwartz, C. K. Cheung
  • IEEE Trans. Communications,
  • 1976

Similar Papers

Loading similar papers…