Multicast routing based on predicted traffic statistics

Paul C. Huang, Yoshiaki Tanaka

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

With the arrival of B-ISDN, widespread usage of multicast services such as TV broadcasting and video 900 services will increase the possibility of network congestion unless efficient multiple destination routing (MDR) algorithms are used. Current MDR algorithms using link cost based on bandwidth usage or distance to compute the minimum cost routing tree do not take into account the vast amount of information collected by intelligent network (IN) databases. In this paper, we propose a multicast routing algorithm which modifies the way the cost is calculated by using the predicted traffic statistics collected by IN databases. We also show that the traffic handling characteristics vastly improved over conventional MDR algorithms.

Original languageEnglish
Pages (from-to)1188-1193
Number of pages6
JournalIEICE Transactions on Communications
VolumeE77-B
Issue number10
Publication statusPublished - 1994 Oct
Externally publishedYes

Fingerprint

Routing algorithms
Statistics
Intelligent networks
Costs
Voice/data communication systems
Broadcasting
Telecommunication links
Bandwidth

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Electrical and Electronic Engineering

Cite this

Multicast routing based on predicted traffic statistics. / Huang, Paul C.; Tanaka, Yoshiaki.

In: IEICE Transactions on Communications, Vol. E77-B, No. 10, 10.1994, p. 1188-1193.

Research output: Contribution to journalArticle

@article{1608d9986b374bfeb3a861c60323ac45,
title = "Multicast routing based on predicted traffic statistics",
abstract = "With the arrival of B-ISDN, widespread usage of multicast services such as TV broadcasting and video 900 services will increase the possibility of network congestion unless efficient multiple destination routing (MDR) algorithms are used. Current MDR algorithms using link cost based on bandwidth usage or distance to compute the minimum cost routing tree do not take into account the vast amount of information collected by intelligent network (IN) databases. In this paper, we propose a multicast routing algorithm which modifies the way the cost is calculated by using the predicted traffic statistics collected by IN databases. We also show that the traffic handling characteristics vastly improved over conventional MDR algorithms.",
author = "Huang, {Paul C.} and Yoshiaki Tanaka",
year = "1994",
month = "10",
language = "English",
volume = "E77-B",
pages = "1188--1193",
journal = "IEICE Transactions on Communications",
issn = "0916-8516",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "10",

}

TY - JOUR

T1 - Multicast routing based on predicted traffic statistics

AU - Huang, Paul C.

AU - Tanaka, Yoshiaki

PY - 1994/10

Y1 - 1994/10

N2 - With the arrival of B-ISDN, widespread usage of multicast services such as TV broadcasting and video 900 services will increase the possibility of network congestion unless efficient multiple destination routing (MDR) algorithms are used. Current MDR algorithms using link cost based on bandwidth usage or distance to compute the minimum cost routing tree do not take into account the vast amount of information collected by intelligent network (IN) databases. In this paper, we propose a multicast routing algorithm which modifies the way the cost is calculated by using the predicted traffic statistics collected by IN databases. We also show that the traffic handling characteristics vastly improved over conventional MDR algorithms.

AB - With the arrival of B-ISDN, widespread usage of multicast services such as TV broadcasting and video 900 services will increase the possibility of network congestion unless efficient multiple destination routing (MDR) algorithms are used. Current MDR algorithms using link cost based on bandwidth usage or distance to compute the minimum cost routing tree do not take into account the vast amount of information collected by intelligent network (IN) databases. In this paper, we propose a multicast routing algorithm which modifies the way the cost is calculated by using the predicted traffic statistics collected by IN databases. We also show that the traffic handling characteristics vastly improved over conventional MDR algorithms.

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

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

M3 - Article

VL - E77-B

SP - 1188

EP - 1193

JO - IEICE Transactions on Communications

JF - IEICE Transactions on Communications

SN - 0916-8516

IS - 10

ER -