A QoS Aware Multicast Routing Protocol with Scalability in Terms of Link State Advertisement

Toshihiko KATO; Seiji UENO; Shigeki MUKAIYAMA

A QoS Aware Multicast Routing Protocol with Scalability in Terms of Link State Advertisement

Toshihiko KATO, Seiji UENO, Shigeki MUKAIYAMA

Full Text Views

0

Cite this

Summary :

Recently routing protocols for QoS aware multicast are actively studied, but there are few studies focusing on the scalability of link state advertisement when the available bandwidth of a link is updated along with the QoS aware multicast tree construction. This paper proposes a new QoS aware multicast routing protocol that is scalable in terms of the link state advertisement exchange. Our protocol has the following features; (1) A multicast network is divided into domains, and the advertisement of information on links within a domain is limited within the domain. (2) Among the border multicast routers, only the link state information of inter-domain links is advertised. As a result, the number of link state advertisement messages will be drastically reduced. (3) When a multicast tree spreads over multiple domains, the tree construction needs to be performed without information on links in other domains, and it is possible that the construction may fail. In order to cope with this problem, the crank back mechanism of a tree construction is introduced. This paper describes the detailed procedures and the message formats of our protocol. It also describes the evaluation of the number of exchanged link state advertisement messages and shows that our protocol can reduce the number comparing with the conventional protocols.

Publication: IEICE TRANSACTIONS on Information Vol.E86-D No.11 pp.2352-2360

Publication Date: 2003/11/01

Publicized

Online ISSN

DOI

Type of Manuscript: Special Section PAPER (Special Issue on New Technologies in the Internet and their Applications)

Category

Cite this

Copy

Toshihiko KATO, Seiji UENO, Shigeki MUKAIYAMA, "A QoS Aware Multicast Routing Protocol with Scalability in Terms of Link State Advertisement" in IEICE TRANSACTIONS on Information, vol. E86-D, no. 11, pp. 2352-2360, November 2003, doi: .
Abstract: Recently routing protocols for QoS aware multicast are actively studied, but there are few studies focusing on the scalability of link state advertisement when the available bandwidth of a link is updated along with the QoS aware multicast tree construction. This paper proposes a new QoS aware multicast routing protocol that is scalable in terms of the link state advertisement exchange. Our protocol has the following features; (1) A multicast network is divided into domains, and the advertisement of information on links within a domain is limited within the domain. (2) Among the border multicast routers, only the link state information of inter-domain links is advertised. As a result, the number of link state advertisement messages will be drastically reduced. (3) When a multicast tree spreads over multiple domains, the tree construction needs to be performed without information on links in other domains, and it is possible that the construction may fail. In order to cope with this problem, the crank back mechanism of a tree construction is introduced. This paper describes the detailed procedures and the message formats of our protocol. It also describes the evaluation of the number of exchanged link state advertisement messages and shows that our protocol can reduce the number comparing with the conventional protocols.
URL: https://global.ieice.org/en_transactions/information/10.1587/e86-d_11_2352/_p

Copy

@ARTICLE{e86-d_11_2352,
author={Toshihiko KATO, Seiji UENO, Shigeki MUKAIYAMA, },
journal={IEICE TRANSACTIONS on Information},
title={A QoS Aware Multicast Routing Protocol with Scalability in Terms of Link State Advertisement},
year={2003},
volume={E86-D},
number={11},
pages={2352-2360},
abstract={Recently routing protocols for QoS aware multicast are actively studied, but there are few studies focusing on the scalability of link state advertisement when the available bandwidth of a link is updated along with the QoS aware multicast tree construction. This paper proposes a new QoS aware multicast routing protocol that is scalable in terms of the link state advertisement exchange. Our protocol has the following features; (1) A multicast network is divided into domains, and the advertisement of information on links within a domain is limited within the domain. (2) Among the border multicast routers, only the link state information of inter-domain links is advertised. As a result, the number of link state advertisement messages will be drastically reduced. (3) When a multicast tree spreads over multiple domains, the tree construction needs to be performed without information on links in other domains, and it is possible that the construction may fail. In order to cope with this problem, the crank back mechanism of a tree construction is introduced. This paper describes the detailed procedures and the message formats of our protocol. It also describes the evaluation of the number of exchanged link state advertisement messages and shows that our protocol can reduce the number comparing with the conventional protocols.},
keywords={},
doi={},
ISSN={},
month={November},}

Copy

TY - JOUR
TI - A QoS Aware Multicast Routing Protocol with Scalability in Terms of Link State Advertisement
T2 - IEICE TRANSACTIONS on Information
SP - 2352
EP - 2360
AU - Toshihiko KATO
AU - Seiji UENO
AU - Shigeki MUKAIYAMA
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E86-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 2003
AB - Recently routing protocols for QoS aware multicast are actively studied, but there are few studies focusing on the scalability of link state advertisement when the available bandwidth of a link is updated along with the QoS aware multicast tree construction. This paper proposes a new QoS aware multicast routing protocol that is scalable in terms of the link state advertisement exchange. Our protocol has the following features; (1) A multicast network is divided into domains, and the advertisement of information on links within a domain is limited within the domain. (2) Among the border multicast routers, only the link state information of inter-domain links is advertised. As a result, the number of link state advertisement messages will be drastically reduced. (3) When a multicast tree spreads over multiple domains, the tree construction needs to be performed without information on links in other domains, and it is possible that the construction may fail. In order to cope with this problem, the crank back mechanism of a tree construction is introduced. This paper describes the detailed procedures and the message formats of our protocol. It also describes the evaluation of the number of exchanged link state advertisement messages and shows that our protocol can reduce the number comparing with the conventional protocols.
ER -