|
|
|
|
|
ABSTRACT:
This paper investigates the problem of dynamic wave length allocation and fairness control in WDM optical networks. A f network topology, wih a two-hop path network, is studied for three classes of traffic. Each class corresponds to a source and destination pair. For each class call inter arrival and holding times are studied. The objective is to determine a wavelength allocation policy to maximize the weighted sum of users of all the three classes. This method is able to provide differentiated services and fairness control in the network. The problem can be formulated using markov decision process to find the optimal allocation policy.. It has been analytically and numerically shown that the optimal allocation policy has the form of a nondecreasing switching curve for each class. Simulation results compare the performance of the optimal policy and the heuristic algorithm, with Dynamic partitioning with those of complete sharing and complete partitioning policies.
|
|
|
|
STATISTICS
|
|
Click on # to view
|
|
Citations
|
|
0
|
|
References
|
|
0
|
|
Comments
|
|
0
|
|
Quality
|
|
0/0.00
|
|
Interest
|
|
0/0.00
|
|
View(er)s
|
|
1/111
|
|
|
|
|
|
|
| Prev |
Next |
|
