Multicast Routing and Design of Sparse Connectors

Authors:
Andreas Baltz;Anand Srivastav
Affiliations:
Institut für Informatik, Christian-Albrechts-Universität Kiel, Kiel, 24118;Institut für Informatik, Christian-Albrechts-Universität Kiel, Kiel, 24118
Venue:
Algorithmics of Large and Complex Networks
Year:
2009

Citing 22
Cited 0

Probabilistic construction of deterministic algorithms: approximating packing integer programs

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
The maximum concurrent flow problem

Journal of the ACM (JACM)
Fast approximation algorithms for fractional packing and covering problems

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A natural randomization strategy for multicommodity flow and related algorithms

Information Processing Letters
Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts

SIAM Journal on Computing
A study of permutation networks: new designs and some generalizations

Journal of Parallel and Distributed Computing
Fast approximation algorithms for multicommodity flow problems

Selected papers of the 23rd annual ACM symposium on Theory of computing
Approximate minimum-cost multicommodity flows in O˜(&egr;-2KNM) time

Mathematical Programming: Series A and B
On-line routing of virtual circuits with applications to load balancing and machine scheduling

Journal of the ACM (JACM)
Fast deterministic approximation for the multicommodity flow problem

Mathematical Programming: Series A and B
Greeding matching algorithms, an experimental study

Journal of Experimental Algorithmics (JEA)
Improved Steiner tree approximation in graphs

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
On complexity, representation and approximation of integral multicommodity flows

Proceedings of the 5th Twente workshop on on Graphs and combinatorial optimization
Loss-less condensers, unbalanced expanders, and extractors

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Randomized metarounding

Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Extracting all the randomness and reducing the error in Trevisan's extractors

Journal of Computer and System Sciences - STOC 1999
Approximating Multicast Congestion

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Approximation Algorithms for General Packing Problems with Modified Logarithmic Potential Function

TCS '02 Proceedings of the IFIP 17th World Computer Congress - TC1 Stream / 2nd IFIP International Conference on Theoretical Computer Science: Foundations of Information Technology in the Era of Networking and Mobile Computing
Faster and Simpler Algorithms for Multicommodity Flow and other Fractional Packing Problems.

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Constructions of sparse asymmetric connectors with number theoretic methods

Networks
Construction of asymmetric connectors of depth two

Journal of Combinatorial Theory Series A - Special issue in honor of Jacobus H. van Lint
Fast approximation of minimum multicast congestion: implementation versus theory

CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity

Quantified Score

Hi-index	0.00

Visualization

Abstract

In a multicast communication network, each sender communicates with multiple nodes which are in request of identical data. We summarize our studies of the minimum multicast congestion problem, which generalizes the well-known NP -hard multicommodity flow problem. Moreover, we describe efficient architectures for a network allowing n senders to connect to N receivers (n N ).