Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

Analysis of Link Utilization Using Traffic Engineering Technique in Data Center Network


Affiliations
1 Department of Business Administration and Information Systems, Arba Minch University, Ethiopia
     

   Subscribe/Renew Journal


Data center networks are driven by intensive application like data mining, web searching and cloud computing. Nowadays, topologies in data center networks applied multi-ischolar_mained tree like Canonical Tree, and Fat-Tree. In multipath routing Equal cost multiple path (ECMP) forwarding is used in most of the current data center networks. However, it fails to increased path diversity. Modified data centric routing (DCR) algorithm in a data center environment based on the topologies such as canonical and fat-tree to increase the path diversity over unequal cost link. In proposed new algorithm to increase the link utilization ,efficient load balancing and the effects of increased packet reordering on application performance with MTCP and Packet scatter, can further reduce MLU, increase link utilization through DCR routing and better load balancing, finally increase the overall network performance.

Keywords

Data Center Routing, Data Center Topology, Multipath Routing, Traffic Engineering.
Subscription Login to verify subscription
User
Notifications
Font Size

  • F.P. Tso and D.P. Pezaros, “Improving Data Center Network Utilization using Near-Optimal Traffic Engineering”, IEEE Transactions on Parallel and Distributed Systems, Vol. 24, No. 6, pp. 1139-1148, 2012.
  • A. Greenberg, P. Lahiri, D. A. Maltz, P. Patel and S. Sengupta, “Towards A Next Generation Data Center Architecture: Scalability and Commoditization”, Proceedings of ACM Workshop on Programmable Routers for Extensible Services of Tomorrow, pp. 57-62, 2008.
  • Haijun Geng, Xingang Shi, Xia Yin, Zhiliang Wang and Shaoping Yin, “Algebra and Algorithms for Multipath QoS Routing in Link State Networks”, Journal of Communications and Networks, Vol. 19, No. 2, pp. 1-5, 2017.
  • Alberto Dainotti, Antonio Pescape and Kimberly C. Claffy, “Issues and Future Directions in Traffic Classification”, IEEE Network, Vol. 26, No. 1, pp. 35-40, 2012.
  • B. Heller, S. Seetharaman and P. Mahadevan, “ElasticTree: Saving Energy in Data Center Networks”, Proceedings of 7th USENIX Conference on Networked Systems Design and Implementation, pp. 1-17, 2010.
  • Jochen W. Guck, Amaury Van Bemten, Martin Reisslein, Wolfgang Kellerer, “Unicast QoS Routing Algorithms for SDN: A Comprehensive Survey and Performance Evaluation”, IEEE Communications Surveys and Tutorials, Vol. 20, No. 1, pp. 388-415, 2017.
  • Walid Khallef, Miklos Molnar, Abderrahim Bensliman and Sylvain Durand, “On the QoS Routing with RPL”, Proceedings of International Conference on Performance Evaluation and Modeling in Wired and Wireless Networks, pp. 1-5, 2017.
  • A. Callado, C. Kamienski, S.N. Fernandes and D. Sadok, “A Survey on Internet Traffic Identification and Classification”, IEEE Communications Surveys and Tutorials, Vol. 11, No. 3, pp. 37-52, 2009.
  • T. Karagiannis, A. Broido and M. Faloutsos, “Transport Layer Identification of P2P Traffic”, Proceedings of 4th ACM International Conference on Internet Measurement, pp. 121-134, 2004
  • Shuangyin Ren, Wenhua Dou and Yu Wang, “A Deterministic Network Calculus Enabled QoS Routing on Software Defined Network”, Proceedings of IEEE 9th International Conference on Communication Software and Networks, pp. 1-5, 2017.
  • O. Yeremenko, O. Lemeshko, O. Nevzorova and Ahmad M. Hailan, “Method of Hierarchical QoS Routing based on Network Resource Reservation”, Proceedings of IEEE 1st Ukraine Conference on Electrical and Computer Engineering, pp. 971-976, 2017.
  • D. Xu, M. Chiang and J. Rexford, “Link-State Routing with Hop-by-Hop Forwarding Can Achieve Optimal Traffic Engineering”, Proceedings of 27th Conference on Computer Communications, pp. 1717-1730, 2011.
  • M. Al-Fares, S. Radhakrishnan, B. Raghavan, N. Huang and A. Vahdat, “Hedera: Dynamic Flow Scheduling for Data Center Networks”, Proceedings of 27th USENIX Symposium on Networked Systems Design and Implementation, pp. 1-7, 2010.
  • S. Sen, O. Spatscheck and D. Wang, “Accurate, Scalable in-Network Identification of P2P Traffic using Application Signatures”, Proceedings of 13th International Conference on World Wide Web, pp. 512-521, 2004.
  • P. Haffner, S. Sen, O. Spatscheck and D. Wang, “ACAS: Automated Construction of Application Signatures”, Proceedings of International Conference and Workshop on Mining Network Data, pp. 197-202, 2005.
  • O. Lemeshko, O. Yeremenko and Ahmad M. Hailan, “Design of QoS-Routing Scheme under the Timely Delivery Constraint”, Proceedings of 14th International Conference the Experience of Designing and Application of CAD Systems in Microelectronics, pp. 97-99, 2017.
  • J.D.M. Bezerra, A.J. Pinheiro, C.P. De Souza and D.R. Campelo, “Performance Evaluation of Elephant Flow Predictors in Data Center Networking”, Future Generation Computer Systems, Vol. 102, pp. 952-964, 2020
  • A. Alaa, A. Mohamed and T. Elfouly, “Energy-Cost-Distortion Optimization for Delay-Sensitive M-Health Applications”, Proceedings of International Symposium on Wireless Telecommunications, pp. 1-5, 2015.
  • T. Bujlow, M.T. Riaz and J.M. Pedersen, “A Method for Assessing Quality of Service in Broadband Networks”, Proceedings of 14th International Conference on Advanced Communication Technology, pp. 826-831, 2012.
  • Erico N. De Souza, Stan Matwin and Stenio Fernandes, “Traffic Classification with On-Line Ensemble Method”, Proceedings of International Conference on Global Information Infrastructure and Networking, pp. 1-4, 2013.

Abstract Views: 239

PDF Views: 0




  • Analysis of Link Utilization Using Traffic Engineering Technique in Data Center Network

Abstract Views: 239  |  PDF Views: 0

Authors

S. Rajanarayanan
Department of Business Administration and Information Systems, Arba Minch University, Ethiopia

Abstract


Data center networks are driven by intensive application like data mining, web searching and cloud computing. Nowadays, topologies in data center networks applied multi-ischolar_mained tree like Canonical Tree, and Fat-Tree. In multipath routing Equal cost multiple path (ECMP) forwarding is used in most of the current data center networks. However, it fails to increased path diversity. Modified data centric routing (DCR) algorithm in a data center environment based on the topologies such as canonical and fat-tree to increase the path diversity over unequal cost link. In proposed new algorithm to increase the link utilization ,efficient load balancing and the effects of increased packet reordering on application performance with MTCP and Packet scatter, can further reduce MLU, increase link utilization through DCR routing and better load balancing, finally increase the overall network performance.

Keywords


Data Center Routing, Data Center Topology, Multipath Routing, Traffic Engineering.

References