scholarly journals JSSTR: A Joint Server Selection and Traffic Routing Algorithm for the Software-Defined Data Center

2018 ◽  
Vol 8 (9) ◽  
pp. 1478 ◽  
Author(s):  
Yunhe Cui ◽  
Lianshan Yan ◽  
Qing Qian ◽  
Huanlai Xing ◽  
Saifei Li

Server load balancing technology makes services highly functional by distributing the incoming user requests to different servers. Thus, it plays a key role in data centers. However, most of the current server load balancing schemes are designed without considering the impact on the network. More specifically, when using these schemes, the server selection and routing path calculation are usually executed sequentially, which may result in inefficient use of network resources or even cause some issues in the network. As an emerging architecture, Software-Defined Networking (SDN) provides new solutions to overcome these shortcomings. Therefore, taking advantages of SDN, this paper proposes a Joint Server Selection and Traffic Routing algorithm (JSSTR) based on improving the Shuffle Frog Leaping Algorithm (SFLA) to achieve high network utilization, network load balancing and server load balancing. Evaluation results validate that the proposed algorithm can significantly improve network efficiency and balance the network load and server load.

Author(s):  
Chunyu Liu ◽  
Fengrui Mu ◽  
Weilong Zhang

Background: In recent era of technology, the traditional Ant Colony Algorithm (ACO) is insufficient in solving the problem of network congestion and load balance, and network utilization. Methods: This paper proposes an improved ant colony algorithm, which considers the price factor based on the theory of elasticity of demand. The price factor is denominated in the impact on the network load which means indirect control of network load, congestion or auxiliary solution to calculate the idle resources caused by the low network utilization and reduced profits. Results: Experimental results show that the improved algorithm can balance the overall network load, extend the life of path by nearly 3 hours, greatly reduce the risk of network paralysis, and increase the profit of the manufacturer by 300 million Yuan. Conclusion: Furthermore, results shows that the improved method has a great application value in improving the network efficiency, balancing network load, prolonging network life and increasing network operating profit.


Author(s):  
Oleksandr Kaliuzhnyi

In this work we propose a method for organizing multipath routing for SDN networks. It have two main parts. The fisrt one is a routing method based on modified wave algorithm for finding paths, and second one is load balancing method based on ECMP algorithm. Combination of these methods can optimize using of network resources and provide a more optimal load balancing of network. The basis of routing algorithm is the search and use partially-overlapping routes. The basis of load balancing algorithm is equal distribution network load between all found routes. A comparative analysis with an existing algorithms for routing and load balancing was conducted and the advantages of this development are presented.


Symmetry ◽  
2020 ◽  
Vol 12 (9) ◽  
pp. 1556
Author(s):  
Myunghoon Jeon ◽  
Namgi Kim ◽  
Yehoon Jang ◽  
Byoung-Dai Lee

With the recent advancements in cloud computing technology, the number of cloud-based services has been gradually increasing. Symmetrically, users are asking for quality of experience (QoE) to be maintained or improved. To do this, it has become necessary to manage network resources more efficiently inside the cloud. Many theoretical studies for improving the users’ QoE have been proposed. However, there are few practical solutions due to the lack of symmetry between implementation and theoretical researches. Hence, in this study, we propose a ranking table-based network resource allocation method that dynamically allocates network resources per service flow based on flow information periodically collected from a software defined network (SDN). It dynamically identifies the size of the data transmission for each service flow on the SDN and differentially allocates network resources to each service flow based on this size. As a result, it maintains the maximum QoE for the user by increasing the network utilization. The experimental results show that the proposed method achieves 29.4% higher network efficiency than the general Open Shortest Path First (OSPF) method on average.


2012 ◽  
Vol 18 (4) ◽  
pp. 608-622 ◽  
Author(s):  
Aleksandra Kostić-Ljubisavljević ◽  
Snežana Mladenović ◽  
Vladanka Aćimović-Raspopović

Telecommunication operators endeavour to offer their users numerous services and, at the same time, to be competitive with other operators at the market while accomplishing high revenue. The only way to achieve all those goals is to make better usage of their network resources and realise high network efficiency. In this paper, we tested the assumption that a proper combination of the different dynamic telecommunication traffic routing methods and interconnection charging methods can provide higher operators revenue. In order to analyze the effects of combinations of four different routing and two interconnection charging methods on operator's revenue, we developed new software for simulation of network operations. This software is used for simulation of the three interconnected networks operators. Results considering the dependence of operator's revenue on routing and interconnection charging methods combination are analyzed and discussed.


Author(s):  
Goran Djukanovic ◽  
Goran Popovic ◽  
Dimitris Kanellopoulos

This paper proposes a routing method that is based on an Ant Colony Algorithm (ACO) for minimizing energy consumption in Wireless Sensor Networks (WSNs). The routing method is used as the backbone of the Internet of Things (IoT) platform. It also considers the critical design issues of a WSN, such as the energy constraint of sensor nodes, network load balancing, and sensor density in the field. Special attention is paid to the impact of network scaling on the performance of the ACO-based routing algorithm.


2013 ◽  
Vol 427-429 ◽  
pp. 2664-2667
Author(s):  
Zhi Qiang Cai ◽  
Rong Sheng Lv ◽  
Shi Wen Sun

Quality of Service (QoS) routing is intent to find feasible routes according to QoS constraints and optimize utilization of whole network resources. In order to solve bandwidth-guaranteed QoS routing problem, a simple but effective routing algorithm based on precomputation scheme with load balancing consideration, is proposed. The algorithm is implemented and simulated using Network Simulator (NS2). Research results showed that the proposal can keep some links free from becoming bottlenecks earlier, avoid congestion caused by unbalanced traffic load distribution, and improve performance of IP backbone networks.


2021 ◽  
Author(s):  
Gaurav Gaurav

Software Defined Networking (SDN), is an emerging networking technology. This thesis aims to develop a new Server and Network Load balancing scheme in content delivery datacenters using SDN-based architecture. The scheme, called Server and Network Load Balancing (SNLB), tends to distribute the traffic load more evenly across the network. The SNLB achieves even distribution of flows on the links and servers by utilizing real-time network statistics. Furthermore, SNLB classifies the network flows into mice (flows with small bandwidth) and elephant (flows with large bandwidth) flows and performs load balancing on these two classes of flows separately. A detailed comparison of SNLB with Global first fit, Round robin and Load based balancing is presented. Other objectives achieved in this thesis are the designs of overload traffic handling technique and Fault tolerance method. The overload traffic handling technique activates and de-activates servers according to the traffic load; the fault tolerance method can reduce the impact on network performance during the network fault.


2021 ◽  
Author(s):  
Arun Nanthakumaran

Content delivery over Internet is optimized for low use perceived latency by designing specialized Content Distribution Network (CDN). Content servers are connected through a content switch the distributes client requests among them to achieve load balancing across the servers. The content switch is located one-hop away from the servers. Server load balancing is one factor in achieveing low user perceived latency and improving operational efficiency. Traffic engineering is another factor that is generally and integrated with serverload balancing for CDN optimization. In this thesis we propose a request routing algorithm for a CDN that was designed to integrate server selection and traffic engineering functions in the request routing system. The CDN employs MPLS in the network for traffic engineering. The proposed algorithm optimizes content delivery for user perceived latency by achieving server load balancing and network traffic loan manaement among alternative paths. It also improves operational efficiency of the CDN by eliminating bottleneck paths and increasing utilization of underutilized servers and paths.


Author(s):  
MANA VIVEKANAND ◽  
SUMA REDDY

Wireless sensor networks (WSNs) have been considered as a promising method for reliably monitoring both civil and military environments under hazardous or dangerous conditions. Due to such environments ,the power supplies for sensors in the network are not usually rechargeable or replaceable. Therefore, the energy efficiency is critical for the lifetime and cost of WSN. Numerous mechanisms have been proposed to reduce the impact of communication protocols on the overall energy dissipation of WSN and communicating it with other nodes, moving on to the sink via transceiver. Efficiency of protocol can only be beneficial if the network is alive otherwise what to do for the novel ideas with the dead network. In this paper, Our proposed cluster based routing algorithm has exploited threshold level based load balancing and role transfer techniques along with multi-assistant cluster heads to cope with the aforementioned power hungry issues. Combination of multi hop and direct routing has improved our protocol energy utilization.


2021 ◽  
Author(s):  
Gaurav Gaurav

Software Defined Networking (SDN), is an emerging networking technology. This thesis aims to develop a new Server and Network Load balancing scheme in content delivery datacenters using SDN-based architecture. The scheme, called Server and Network Load Balancing (SNLB), tends to distribute the traffic load more evenly across the network. The SNLB achieves even distribution of flows on the links and servers by utilizing real-time network statistics. Furthermore, SNLB classifies the network flows into mice (flows with small bandwidth) and elephant (flows with large bandwidth) flows and performs load balancing on these two classes of flows separately. A detailed comparison of SNLB with Global first fit, Round robin and Load based balancing is presented. Other objectives achieved in this thesis are the designs of overload traffic handling technique and Fault tolerance method. The overload traffic handling technique activates and de-activates servers according to the traffic load; the fault tolerance method can reduce the impact on network performance during the network fault.


Sign in / Sign up

Export Citation Format

Share Document