A Maxmin Routing Algorithm for Dense Wavelength Division Multiplexing Networks

In this paper, we present an algorithm to solve the routing problem for wavelength division multiplexing networks. We use the discrete maxmin fairness as the routing metric. First we use this algorithm to solve routing problem. After we get paths for all flows in the network, we use another algorithm d-CPG in [1], to assign discrete maxmin rates for these flows. We test our algorithm by using the National LambdaRail network topology in [2].

Related Organizations

University of California, Irvine
United States

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	1
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Average
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average