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

@inproceedings{Potika2005MaximizingTN,
  title={Maximizing the Number of Connections in Multifiber WDM Chain, Ring and Star Networks},
  author={Katerina Potika},
  booktitle={NETWORKING},
  year={2005}
}
We study a wavelength assignment maximization problem in multifiber WDM networks. Given a network G, a set of requests, the number of fibers per link and the number of wavelengths, we want to maximize the number of requests that can be satisfied simultaneously. We propose polynomial time algorithms, that are either optimal or have a guaranteed worst case performance in basic topologies, such as chain, ring and star networks. 
View via Publisher
link.springer.com
4 Citations
Background Citations
1
Methods Citations
2

4 Citations

Citation Type

Citation Type

Wavelength Assignment in Multifiber WDM Star and Spider Networks
TLDR
Both the minimization and maximization problems are NP-hard in stars and in spiders with uniform odd number of fibers and the algorithms for the maximization problem in spiders are based on the newly developed algorithm which optimally solves the call control problem in spider.
Maximum Request Satisfaction in WDM Rings : Algorithms and Experiments
TLDR
There are simple, fast algorithms that achieve a competent number of satisfied requests in alloptical WDM rings in which the number of available wavelengths per fiber is limited and there are considerably faster than others with comparable request satisfaction performance.
Scheduling Connections via Path and Edge Multicoloring
TLDR
An exact polynomial-time algorithm for Min-PMC on spider networks with even admissible color multiplicities on each edge is given and it is shown that any algorithm which is based on path orientation cannot achieve an approximation ratio better than 7-6.
Path multicoloring in spider graphs with even color multiplicity

References

SHOWING 1-9 OF 9 REFERENCES
Resource Allocation Problems in Multifiber WDM Tree Networks
TLDR
The problem of minimizing the total number of fibers necessary to establish a given set of requests with a bounded number w of wavelengths and the problem of maximizing the number of accepted requests for given fibers and bounded number of wavelengths are considered.
A Lagrangean decomposition approach for the routing and wavelength assignment in multifiber WDM networks
  • M. Saad, Z. Luo
  • Computer Science
    Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE
  • 2002
TLDR
This paper addresses the problem of routing and wavelength assignment (RWA) in multifiber WDM networks assuming neither a special topology nor wavelength converters, and forms the problem as an integer linear program (ILP), whose validity is proven by showing that the selected lightpaths can indeed be realized by properly configuring the optical switches.
Maximizing the Number of Connections in Optical Tree Networks
TLDR
MaxPC and MaxPP are shown to be polynomial-time solvable to optimality if the tree has height one or if both W and the degree of the tree are bounded by a constant, and are proved NP-hard.
Satisfying a maximum number of pre-routed requests in all-optical rings
Routing and Path Multi-Coloring
Primal-dual approximation algorithms for integral flow and multicut in trees
TLDR
It is shown that both the maximum integral multicommodity flow and the minimum multicut problem are NP-hard and MAX SNP-hard on trees, although themaximum integral flow can be computed in polynomial time if the edges have unit capacity.
On Observing Nondeterminism and Concurrency
Wavelength assignment for minimizing system blockings in multifiber all-optical WDM networks
  • Optical Networks 4
  • 2003
Call control in rings . In : Proceedings of the 29 th International Colloquium on Automata , Languages , and Programming ( ICALP 2002 )
  • 2002