Forwarding state scalability-aware multicast routing

Guangmin Hu, Kow Chuen Chang

Research output: Chapter in book / Conference proceedingConference article published in proceeding or bookAcademic researchpeer-review


Multicast routing protocols today still scale poorly to a large number of concurrent multicast sessions in terms of forwarding states. Unlike previous approaches which concentrated on reducing forwarding states after constructing multicast trees, our approach is to make the underlying routing algorithms aware of the scalability requirement. This scalability-aware approach can be applied to many existing multicast state reduction methods, such as Aggregated Multicast (AM) and Dynamic Tunnel Multicast (DTM). We have formulated both AM-aware and DTM-aware routing problems as multicriteria optimization problems, and proposed algorithms to solve them.
Original languageEnglish
Title of host publicationProceedings - 10th IEEE Symposium on Computers and Communications, ISCC 2005
Number of pages6
Publication statusPublished - 10 Nov 2005
Event10th IEEE Symposium on Computers and Communications, ISCC 2005 - Murcia, Spain
Duration: 27 Jun 200530 Jun 2005


Conference10th IEEE Symposium on Computers and Communications, ISCC 2005

ASJC Scopus subject areas

  • Software
  • Signal Processing
  • Mathematics(all)
  • Computer Science Applications
  • Computer Networks and Communications


Dive into the research topics of 'Forwarding state scalability-aware multicast routing'. Together they form a unique fingerprint.

Cite this