Paper Search Console

Home Search Page About Contact

Journal Title

Title of Journal: J Comb Optim

Search In Journal Title:

Abbravation: Journal of Combinatorial Optimization

Search In Journal Abbravation:

Publisher

Kluwer Academic Publishers

Search In Publisher:

DOI

10.1016/0003-9969(94)90042-6

Search In DOI:

ISSN

1573-2886

Search In ISSN:
Search In Title Of Papers:

Optimization of lossbalanced multicast in allopt

Authors: Yuan Cao Oliver Yu
Publish Date: 2006/06/27
Volume: 12, Issue: 1-2, Pages: 71-82
PDF Link

Abstract

In wavelengthdivision multiplexing WDM optical networks multicast is implemented by constructing a lightforest which is a set of lighttrees with each lighttree rooted from the multicast source and terminated at a partition subset of the destination nodes Multicast routing scenario has considerable impact on the quality of optical signal received at each destination To guarantee the fairness of signal quality at different destinations in a multicast session it is desirable to construct a lossbalanced lightforest to deliver the multicast traffic A lossbalanced lightforest is composed of a set of lighttrees bounded in size number of destinations per multicast tree in size variation difference in the number of destinations among different multicast trees and in dimension maximum sourcetodestination distance on each multicast tree This paper investigates the multicast routing and wavelength assignment MCRWA problem under the lossbalance constraint The problem is formulated as an optimization model using integer linear programming ILP Numerical solutions to the optimization model can supply useful performance benchmarks for lossbalanceconstrained optical multicast in WDM networks

Keywords:

References

.
Search In Abstract Of Papers:
Other Papers In This Journal:
  1. A Lagrangian bound for many-to-many assignment problems
  2. New bounds for the balloon popping problem
  3. An exact algorithm for the maximum probabilistic clique problem
  4. A two-stage method for member selection of emergency medical service
  5. Budget-constrained minimum cost flows
  6. On the complexity of partitioning a graph into a few connected subgraphs
  7. Median problems with positive and negative weights on cycles and cacti
  8. The unconstrained binary quadratic programming problem: a survey
  9. Multiple L ( j ,1)-labeling of the triangular lattice
  10. A hybrid algorithm based on variable neighbourhood for the strip packing problem
  11. Penalty guided genetic search for redundancy optimization in multi-state series-parallel power system
  12. Evaluation performance of genetic algorithm and tabu search algorithm for solving the Max-RWA problem in all-optical networks
  13. Modified differential evolution with self-adaptive parameters method
  14. Extremal polyomino chains with respect to general Randić index
  15. The weighted link ring loading problem
  16. A new recombination lower bound and the minimum perfect phylogenetic forest problem
  17. Reconfiguration of dominating sets
  18. Approximate event detection over multi-modal sensing data
  19. Mobile facility location: combinatorial filtering via weighted occupancy
  20. Bounded information dissemination in multi-channel wireless networks
  21. Total coloring of planar graphs without adjacent short cycles
  22. Disjunctive total domination in graphs
  23. A quadratic lower bound for colourful simplicial depth
Search Result: