With the explosive growth of network services, the reasonable traffic scheduling and efficient configuration of network resources have an important significance to increase the efficiency of the network. In this paper, an adaptive traffic scheduling policy based on the priority and time window is proposed and the performance of this algorithm is evaluated in terms of scheduling ratio. The routing and spectrum allocation are achieved by using the Floyd shortest path algorithm and establishing a node spectrum resource allocation model based on greedy algorithm, which is proposed by us. The fairness index is introduced to improve the capability of spectrum configuration. The results show that the designed traffic scheduling strategy can be applied to networks with multicast and broadcast functionalities, and makes them get real-time and efficient response. The scheme of node spectrum configuration improves the frequency resource utilization and gives play to the efficiency of the network.
[1]
Arun K. Somani,et al.
Capacity fairness of WDM networks with grooming capabilities
,
2000,
Other Conferences.
[2]
Masahiko Jinno,et al.
Elastic and adaptive optical networks: possible adoption scenarios and future standardization aspects
,
2011,
IEEE Communications Magazine.
[3]
L. Poti,et al.
SDN control of all-optical frequency conversion and defragmentation for super-channels
,
2014,
OFC 2014.
[4]
Masahiko Jinno,et al.
Spectrum-efficient and scalable elastic optical path network: architecture, benefits, and enabling technologies
,
2009,
IEEE Communications Magazine.