Maximizing the Number of Connections in Multifiber WDM Chain, Ring and Star Networks

Potika, Katerina

doi:10.1007/11422778_139

Cited by 5 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The MinWav-PMC problem has been extensively studied in [7], [8], [9], while the Max-PMC problem has only been studied recently in [4], [11]. Most of the previous works on multifiber networks use undirected network model.…”

Section: Introductionmentioning

confidence: 99%

Wavelength Assignment in Multifiber WDM Star and Spider Networks

Bian

2007

2007 IEEE International Conference on Communications

View full text Add to dashboard Cite

We consider the wavelength assignment problem in WDM optical networks with multiple parallel fibers: Given a set P of paths, assign a color to each path such that the number of paths with the same color on any link is at most the number of fibers in the link. Assuming the number of fibers in each link is fixed, we study two optimization problems. One is to minimize the number of colors for coloring P . The other is to color as many paths of P as possible with a given number of colors. The main results of the paper are: (1) Both the minimization and maximization problems are NP-hard in stars (thus in spiders) with uniform odd number of fibers. (2) The minimization problem is polynomial time solvable in stars with even number of fibers and in spiders with uniform even number of fibers. The result for spiders implies a (1 + 1 k−1 )-approximation algorithm for the minimization problem in spiders with uniform odd number k of fibers. (3) For the maximization problem, we show that it is polynomial time solvable for spiders with uniform even number of fibers and give a 1.58-approximation algorithm for spiders with arbitrary number of fibers. The algorithms for the maximization problem in spiders are based on our newly developed algorithm which optimally solves the call control problem in spiders. Call control is a well studied problem in communication networks. It is known solvable for stars but is NP-hard and MAX SNP-hard even for depth-3 trees. As the spider is a boundary topology between the star and the tree, the call control algorithm has its independent interests.

show abstract

Section: Introductionmentioning

confidence: 99%

Wavelength Assignment in Multifiber WDM Star and Spider Networks

Bian

2007

2007 IEEE International Conference on Communications

View full text Add to dashboard Cite

show abstract

“…The Min-PMC problem has been extensively studied [9,10,[15][16][17][18], while the Max-PMC problem has received increasing attention recently [10,24]. These investigations mainly focus on developing approximation algorithms for simple topologies such as chains, rings, and trees.…”

Section: Introductionmentioning

confidence: 99%

Wavelength assignment in multifiber star networks

Bian

2010

Networks

View full text Add to dashboard Cite

We consider the wavelength assignment problem in WDM optical networks with multiple parallel fibers: Given a set P of paths, assign a color to each path such that the number of paths with the same color containing any link is at most the number of fibers in the link. Assuming the number of fibers in each link is fixed, we study two optimization problems. One is to minimize the number of colors for coloring P . The other is to color as many paths of P as possible with a given number of colors. We show that both the minimization and the maximization problems are NP-hard in star networks with a uniform odd number of fibers. We give polynomial time optimal algorithms for the minimization and maximization problems in star networks with an even number of fibers and in the generalized star networks with a uniform even number of fibers. We also give a 1.58-approximation algorithm for the maximization problem in the generalized star networks with an arbitrary number of fibers. The algorithms for the maximization problem in the generalized stars are based on our newly developed algorithm, which optimally solves the call control problem in the generalized star networks. The call control algorithm is of independent interest.

show abstract

Untitled

Wang

et al. 2010

Networks

View full text Add to dashboard Cite

Maximizing the Number of Connections in Multifiber WDM Chain, Ring and Star Networks

Cited by 5 publications

References 9 publications

Wavelength Assignment in Multifiber WDM Star and Spider Networks

Wavelength Assignment in Multifiber WDM Star and Spider Networks

Wavelength assignment in multifiber star networks

Untitled

Contact Info

Product

Resources

About