A Scalable Traffic Engineering Method in an SDN-based Data Center Network Using Decomposition Technique

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

Bastam Mostafa; Sabaei Masoud; Yousefpour Rouhollah

Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT) Year:2018 | Volume:7 | Issue:1 Page(s): 42-55

Download Full-Text

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Persian Verion

View:

592

Download:

Cites:

Information Journal Paper

Title

A Scalable Traffic Engineering Method in an SDN-based Data Center Network Using Decomposition Technique

Author(s)

Bastam Mostafa | Sabaei Masoud | Yousefpour Rouhollah | Issue Writer Certificate

Keywords

Data center networksQ1

Software-defined networksQ1

Traffic engineeringQ1

Congestion controlQ2

Linear programming decompositionQ1

Parallel solutionQ1

Abstract

Today's data centers consist of thousands of servers hosting a variety of cloud-based services. In this paper, a scalable and new technique is presented for Traffic engineering in software-defined Data center networks helping to design an optimal demand-path mapping with a tolerable computational complexity. The proposed method is based on linear programming model and attempts to minimize the maximum link utilization that causes minimum link congestion. The method focuses on an optimal solution to load balancing in networks. It proposes a new decomposition technique that can limit the search space of the original Linear Programming problem, such that the time required to solve the problem can be reduced substantially. To reduce time complexity, a decomposition technique is used to divide the problem model into smaller sub-problems, which are then solved simultaneously by applying parallelizing techniques (multiple-core computing and OpenMP). Simulation results show that solving time and load balancing are considerably improved.

Cites

No record.

References

No record.

Cite

APA: Copy

Bastam, Mostafa, Sabaei, Masoud, & Yousefpour, Rouhollah. (2018). A Scalable Traffic Engineering Method in an SDN-based Data Center Network Using Decomposition Technique. JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT), 7(1 ), 42-55. SID. https://sid.ir/paper/245827/en

Vancouver: Copy

Bastam Mostafa, Sabaei Masoud, Yousefpour Rouhollah. A Scalable Traffic Engineering Method in an SDN-based Data Center Network Using Decomposition Technique. JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT)[Internet]. 2018;7(1 ):42-55. Available from: https://sid.ir/paper/245827/en

IEEE: Copy

Mostafa Bastam, Masoud Sabaei, and Rouhollah Yousefpour, “A Scalable Traffic Engineering Method in an SDN-based Data Center Network Using Decomposition Technique,” JOURNAL OF SOFT COMPUTING AND INFORMATION TECHNOLOGY (JSCIT), vol. 7, no. 1 , pp. 42–55, 2018, [Online]. Available: https://sid.ir/paper/245827/en

Related Journal Papers