What is it about?

FMap is a new approach to scheduling network traffic in data centers. It uses a fuzzy map to prioritize and route elephant flows (large data transfers) through a jumping traveling salesman problem variant. This approach improves network performance and efficiency by reducing the number of hops and minimizing the time it takes for data to transfer. FMap can be applied to software-defined networking-based data center networks to optimize network traffic and improve overall performance.

Featured Image

Why is it important?

FMap is a unique and timely approach to scheduling network traffic in data centers. It uses a fuzzy map to prioritize and route elephant flows, which are large data transfers that can cause network congestion and affect network performance. FMap's approach is novel in that it integrates flow prioritization and routing decisions under the event of parallel incoming flows, and leverages the cooperation of the controller and OpenFlow switches in software-defined networking. The use of a fuzzy inference process to overcome the vagueness over EF's resource allocation is also a unique feature of FMap. The potential impact of FMap on improving network performance and efficiency in data centers makes it a valuable contribution to the field of network scheduling and optimization.

Perspectives

The publication "FMap: A fuzzy map for scheduling elephant flows through jumping traveling salesman problem variant toward software-defined networking-based data center networks" presents a comprehensive and innovative approach to addressing the challenges of scheduling elephant flows (EFs) in data center networks (DCNs). The document introduces the FMap approach, which leverages fuzzy inference, a customized weighted traveling salesman problem (WTSP) model, and a genetic algorithm to optimize EF scheduling. The publication addresses the need for a more comprehensive solution that integrates flow prioritization, routing decisions, and fine-grained flow specifics to prevent congestion and degradation of DCN performance. It also discusses the limitations of existing methods and emphasizes the importance of considering flow prioritization and routing decisions under the event of parallel incoming flows. The document highlights the significance of size-aware traffic engineering (TE) in DCNs and the potential impact of EFs on network performance. It also presents the proposed FMap approach as a sophisticated solution to EF scheduling in DCNs, aiming to improve network performance, reduce congestion, and address the challenges associated with handling EFs. In summary, the publication provides valuable insights into the complexities of EF scheduling in DCNs and presents a well-structured and comprehensive approach to addressing these challenges, with the potential to significantly improve the performance and efficiency of data center networks.

AhmadReza Montazerolghaem
University of Isfahan

Read the Original

This page is a summary of: FMap: A fuzzy map for scheduling elephant flows through jumping traveling salesman problem variant toward software‐defined networking‐based data center networks, Concurrency and Computation Practice and Experience, June 2023, Wiley,
DOI: 10.1002/cpe.7841.
You can read the full text:

Read

Contributors

The following have contributed to this page