A scalable issue in multicast protocols: Reducing forwarding states

Sheng Xu; Ng Chee Hock; Liren Zhang

doi:10.1109/ICON.1999.796157

A scalable issue in multicast protocols: Reducing forwarding states

Sheng Xu, Ng Chee Hock, Liren Zhang

Research output: Contribution to journal › Conference article › peer-review

1 Citation (Scopus)

Abstract

Forwarding state explosion may cause a scalability problem in multicast protocols. In this paper we describe a technique, called dynamic overlap tree path (DOTP), to improve the scalability of existing multicast protocols. This technique, which can be incorporated in both the dense and sparse modes of multicast protocols, dynamically finds overlapped tree paths and merges their forwarding states to reduce the storage requirement in multicast routers without introducing any additional control-message overheads. Using the OPNET simulation package, we implemented some multicast protocols such as CBT and PIM and their modifications to investigate the efficiency of our proposed technique. According to the simulation, the overall average forwarding-state table size of the networks simulated can be reduced by about 30%.

Original language	English
Article number	796157
Pages (from-to)	37-42
Number of pages	6
Journal	IEEE International Conference on Networks, ICON
DOIs	https://doi.org/10.1109/ICON.1999.796157
Publication status	Published - Dec 1 1999
Event	1999 IEEE International Conference on Networks, ICON 1999 - Brisbane, QLD, Australia Duration: Sept 28 1999 → Oct 1 1999

ASJC Scopus subject areas

Computer Networks and Communications
Software
Electrical and Electronic Engineering
Safety, Risk, Reliability and Quality

Access to Document

10.1109/ICON.1999.796157

Cite this

@article{901cd02bd1c64e5fb1a11390babafc3d,

title = "A scalable issue in multicast protocols: Reducing forwarding states",

abstract = "Forwarding state explosion may cause a scalability problem in multicast protocols. In this paper we describe a technique, called dynamic overlap tree path (DOTP), to improve the scalability of existing multicast protocols. This technique, which can be incorporated in both the dense and sparse modes of multicast protocols, dynamically finds overlapped tree paths and merges their forwarding states to reduce the storage requirement in multicast routers without introducing any additional control-message overheads. Using the OPNET simulation package, we implemented some multicast protocols such as CBT and PIM and their modifications to investigate the efficiency of our proposed technique. According to the simulation, the overall average forwarding-state table size of the networks simulated can be reduced by about 30%.",

author = "Sheng Xu and Hock, {Ng Chee} and Liren Zhang",

year = "1999",

month = dec,

day = "1",

doi = "10.1109/ICON.1999.796157",

language = "English",

pages = "37--42",

journal = "IEEE International Conference on Networks, ICON",

issn = "1556-6463",

note = "1999 IEEE International Conference on Networks, ICON 1999 ; Conference date: 28-09-1999 Through 01-10-1999",

}

TY - JOUR

T1 - A scalable issue in multicast protocols

T2 - 1999 IEEE International Conference on Networks, ICON 1999

AU - Xu, Sheng

AU - Hock, Ng Chee

AU - Zhang, Liren

PY - 1999/12/1

Y1 - 1999/12/1

N2 - Forwarding state explosion may cause a scalability problem in multicast protocols. In this paper we describe a technique, called dynamic overlap tree path (DOTP), to improve the scalability of existing multicast protocols. This technique, which can be incorporated in both the dense and sparse modes of multicast protocols, dynamically finds overlapped tree paths and merges their forwarding states to reduce the storage requirement in multicast routers without introducing any additional control-message overheads. Using the OPNET simulation package, we implemented some multicast protocols such as CBT and PIM and their modifications to investigate the efficiency of our proposed technique. According to the simulation, the overall average forwarding-state table size of the networks simulated can be reduced by about 30%.

AB - Forwarding state explosion may cause a scalability problem in multicast protocols. In this paper we describe a technique, called dynamic overlap tree path (DOTP), to improve the scalability of existing multicast protocols. This technique, which can be incorporated in both the dense and sparse modes of multicast protocols, dynamically finds overlapped tree paths and merges their forwarding states to reduce the storage requirement in multicast routers without introducing any additional control-message overheads. Using the OPNET simulation package, we implemented some multicast protocols such as CBT and PIM and their modifications to investigate the efficiency of our proposed technique. According to the simulation, the overall average forwarding-state table size of the networks simulated can be reduced by about 30%.

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

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

U2 - 10.1109/ICON.1999.796157

DO - 10.1109/ICON.1999.796157

M3 - Conference article

AN - SCOPUS:48049097697

SN - 1556-6463

SP - 37

EP - 42

JO - IEEE International Conference on Networks, ICON

JF - IEEE International Conference on Networks, ICON

M1 - 796157

Y2 - 28 September 1999 through 1 October 1999

ER -

A scalable issue in multicast protocols: Reducing forwarding states

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this