MCRA: Multicost Rerouting Algorithm in SDN
Journal of Advanced Computational Intelligence and Intelligent Informatics, ISSN: 1883-8014, Vol: 24, Issue: 6, Page: 728-737
2020
- 4Citations
- 10Usage
- 5Captures
Metric Options: Counts1 Year3 YearSelecting the 1-year or 3-year option will change the metrics count to percentiles, illustrating how an article or review compares to other articles or reviews within the selected time period in the same journal. Selecting the 1-year option compares the metrics against other articles/reviews that were also published in the same calendar year. Selecting the 3-year option compares the metrics against other articles/reviews that were also published in the same calendar year plus the two years prior.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Example: if you select the 1-year option for an article published in 2019 and a metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019. If you select the 3-year option for the same article published in 2019 and the metric category shows 90%, that means that the article or review is performing better than 90% of the other articles/reviews published in that journal in 2019, 2018 and 2017.
Citation Benchmarking is provided by Scopus and SciVal and is different from the metrics context provided by PlumX Metrics.
Metrics Details
- Citations4
- Citation Indexes4
- Usage10
- Abstract Views10
- Captures5
- Readers5
Article Description
A software-defined network (SDN) partitions a network into a control plane and data plane. Utilizing centralized control, an SDN can accurately control the routing of data flow. In the network, links have various costs, such as bandwidth, delay, and hops. However, it is difficult to obtain a multicost optimization path. If online rerouting can be realized under multiple cost, then network performance can be improved. This paper proposes a multicost rerouting algorithm for elephant flow, as the latter is the main factor affecting network traffic. By performing path trimming, the algorithm can obtain the approximate optimal solution of (1 + e) in polynomial time. Simulation results show that the proposed algorithm yields good performance.
Bibliographic Details
http://www.scopus.com/inward/record.url?partnerID=HzOxMe3b&scp=85097582546&origin=inward; http://dx.doi.org/10.20965/jaciii.2020.p0728; https://www.fujipress.jp/jaciii/jc/jacii002400060728; https://www.fujipress.jp/main/wp-content/themes/Fujipress/phyosetsu.php?ppno=JACII002400060003; https://scholarworks.utrgv.edu/cs_fac/57; https://scholarworks.utrgv.edu/cgi/viewcontent.cgi?article=1056&context=cs_fac; https://www.jstage.jst.go.jp/article/jaciii/24/6/24_728/_article/-char/en/; https://www.jstage.jst.go.jp/article/jaciii/24/6/24_728/_article/-char/ja/; https://dx.doi.org/10.20965/jaciii.2020.p0728; https://www.fujipress.jp/jaciii/jc/jacii002400060728/
Fuji Technology Press Ltd.
Provide Feedback
Have ideas for a new metric? Would you like to see something else here?Let us know