Forwarding state scalability-aware multicast routing

Guangmin Hu; Kow Chuen Chang

doi:10.1109/ISCC.2005.73

Forwarding state scalability-aware multicast routing

Guangmin Hu, Kow Chuen Chang

Research output: Chapter in book / Conference proceeding › Conference article published in proceeding or book › Academic research › peer-review

Abstract

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 language	English
Title of host publication	Proceedings - 10th IEEE Symposium on Computers and Communications, ISCC 2005
Pages	395-400
Number of pages	6
DOIs	https://doi.org/10.1109/ISCC.2005.73
Publication status	Published - 10 Nov 2005
Event	10th IEEE Symposium on Computers and Communications, ISCC 2005 - Murcia, Spain Duration: 27 Jun 2005 → 30 Jun 2005

Conference

Conference	10th IEEE Symposium on Computers and Communications, ISCC 2005
Country/Territory	Spain
City	Murcia
Period	27/06/05 → 30/06/05

ASJC Scopus subject areas

Software
Signal Processing
General Mathematics
Computer Science Applications
Computer Networks and Communications

More information

10.1109/ISCC.2005.73

Cite this

@inproceedings{d7165c55f26847ac844f6f6dd1aed176,

title = "Forwarding state scalability-aware multicast routing",

abstract = "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.",

author = "Guangmin Hu and Chang, {Kow Chuen}",

year = "2005",

month = nov,

day = "10",

doi = "10.1109/ISCC.2005.73",

language = "English",

isbn = "0769523730",

pages = "395--400",

booktitle = "Proceedings - 10th IEEE Symposium on Computers and Communications, ISCC 2005",

note = "10th IEEE Symposium on Computers and Communications, ISCC 2005 ; Conference date: 27-06-2005 Through 30-06-2005",

}

TY - GEN

T1 - Forwarding state scalability-aware multicast routing

AU - Hu, Guangmin

AU - Chang, Kow Chuen

PY - 2005/11/10

Y1 - 2005/11/10

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=27544442110&partnerID=8YFLogxK

U2 - 10.1109/ISCC.2005.73

DO - 10.1109/ISCC.2005.73

M3 - Conference article published in proceeding or book

SN - 0769523730

SP - 395

EP - 400

BT - Proceedings - 10th IEEE Symposium on Computers and Communications, ISCC 2005

T2 - 10th IEEE Symposium on Computers and Communications, ISCC 2005

Y2 - 27 June 2005 through 30 June 2005

ER -

Forwarding state scalability-aware multicast routing

Abstract

Conference

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this