A survey of approximation algorithms for multicast congestion problems

Authors:
Rongjou Yang;Hann-Jang Ho;Singling Lee
Affiliations:
Wufeng Institute of Technology, Dept. of IM, Chia-yi, Taiwan, R.O.C.;Wufeng Institute of Technology, Dept. of CSIE, Chia-yi, Taiwan, R.O.C.;National Chung-Cheng University, Dept. of CSIE, Chiayi, Taiwan, R.O.C.
Venue:
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
Year:
2006

Citing 13
Cited 0

The steiner problem with edge lengths 1 and 2,

Information Processing Letters
Multicast routing in datagram internetworks and extended LANs

ACM Transactions on Computer Systems (TOCS)
Core based trees (CBT)

SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
An architecture for wide-area multicast routing

SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Packing Steiner trees: polyhedral investigations

Mathematical Programming: Series A and B
Adaptive group multicast with time-driven priority

IEEE/ACM Transactions on Networking (TON)
Randomized metarounding (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Towards a 4/3 approximation for the asymmetric traveling salesman problem

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The multicast packing problem

IEEE/ACM Transactions on Networking (TON)
Heuristic algorithms for packing of multiple-group multicasting

Computers and Operations Research
Approximating Multicast Congestion

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
"Time-driven priority" flow control for real-time heterogeneous internetworking

INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Reliable concurrent multicast from bursty sources

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Due to the recently rapid development of multimedia applications, multicast has become the critical technique in many network applications. In this paper, We investigate contemporary research concerning multicast congestion problems with the objective of minimizing the maximum sharing of a link. These problems include: multicast Steiner tree and multicast packing problem, etc. Most of these problems have already been proved as NP-complete, thus are mainly formulated as the Integer Linear Programming (ILP). Our objective is to investigate and analyze some of most recently developed approximation algorithms for the optimization of multicast congestion problems. We also discus how they are modelled and solved in the literature.