On Bandwidth Adjusted Multicast Communications in Pipeline Router Architecture

Authors:
Young-Cheol Bang;Hyunseung Choo
Affiliations:
School of Electrical and Computer Engineering, Sungkyunkwan University, Suwon, Korea 440-746;School of Electrical and Computer Engineering, Sungkyunkwan University, Suwon, Korea 440-746
Venue:
The Journal of Supercomputing
Year:
2005

Citing 12
Cited 0

Introduction to algorithms

Introduction to algorithms
The quickest path problem

Computers and Operations Research
Algorithms for the quickest path problem and the enumeration of quickest paths

Computers and Operations Research
Multicast routing for multimedia communication

IEEE/ACM Transactions on Networking (TON)
Analysis and Implementation of Hybrid Switching

IEEE Transactions on Computers
A quantitative comparison of graph-based models for Internet topology

IEEE/ACM Transactions on Networking (TON)
Cut-through switching, pipelining, and scheduling for network evacuation

IEEE/ACM Transactions on Networking (TON)
Design of Scalable and Multicast Capable Cut-Through Switches for High-Speed LANs

ICPP '97 Proceedings of the international Conference on Parallel Processing
Performance Analysis of a Cut Through Vs. Packet Switching Techniques

ISCC '97 Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
A source-based algorithm for delay-constrained minimum-cost multicasting

INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
On update algorithms for quickest paths

Computer Communications
Evaluation of multicast routing algorithms for real-time communication on high-speed networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

We have developed a novel algorithm to adjust link-bandwidths of a given multicast tree, which sends a message with size r from a source to a multiple destinations taking into consideration pipelined router. The algorithm that we have developed tries to minimize the end-to-end delay time and resources such as bandwidths of a multicast tree, and performs admirably well in any given multicast tree. Our evaluation shows that the proposed algorithm dramatically reduces the end-to-end delay time and resources reserved to satisfy the time-constraints.