|
چکیده
|
Software-defined networking (SDN) technology is fast becoming a key instrument in managing and configuring network and improving the network performance. In recent years, the size and capabilities of SDN datacenters have grown remarkably to provide efficient and effective services to the user’s demands. Generally, traffic flows in datacenter networks can be classified into two major types: large-sized (elephant) flows with high bandwidth throughput requirements and small-sized (mice) flows with low latency delays. However, managing network congestion of large volume traffic flows in a SDN datacenter is one major issue. A majority of traffic engineering techniques aims to minimize network congestion in SDN, but they commonly have considered some aspects of the flows and their demands for evaluating applications in SDN. This paper focuses on a scalable traffic engineering scheme for efficiently mapping traffic demands to paths in SDN datacenters. In this regard, an optimal solution is introduced to schedule elephant flows across paths to mitigate network congestion and increase load balancing in SDN. Nevertheless, optimal flows scheduling mechanism is still not applicable because the required time to calculate the optimal paths is not tolerable in SDN. We present a new decomposition technique for limiting the search space based on the linear programming method to solve the problem in a reasonable time. Since the mice flows have the sensitive time requirements, some paths are reserved for immediately forwarding these flows. The proposed method achieves reasonable performance regarding computation time compared with state-of-the-art solutions devoted to this topic. The results also show that the proposed traffic engineering method is effective to control network congestion and provide load balancing in SDN datacenters.
|