Maximizing Network Utilization for SDN Based on WiseAnt Colony Optimization

2016 ◽  
Author(s):  
Shanwen Yi ◽  
Hua Wang ◽  
Xibo Yao ◽  
Chuangen Gao ◽  
Linbo Zhai
Keyword(s):  
Network Utilization

Cloud computing demand elasticity algorithm based on ant colony algorithm

2020 ◽  
Vol 13 ◽  
Author(s):  
Chunyu Liu ◽  
Fengrui Mu ◽  
Weilong Zhang
Keyword(s):  
Ant Colony Algorithm ◽  
Theory Of Elasticity ◽  
Ant Colony ◽  
Demand Elasticity ◽  
Network Efficiency ◽  
Elasticity Of Demand ◽  
Operating Profit ◽  
Network Load ◽  
Network Utilization ◽  
The Impact

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.

scholarly journals HTPC: heterogeneous traffic-aware partition coding for random packet spraying in data center networks

2021 ◽  
Vol 10 (1) ◽  
Author(s):  
Jiawei Huang ◽  
Shiqi Wang ◽  
Shuping Li ◽  
Shaojun Zou ◽  
Jinbin Hu ◽  
...  
Keyword(s):  
Data Center ◽  
Large Scale ◽  
Network Performance ◽  
Rooted Tree ◽  
Heterogeneous Traffic ◽  
Data Center Networks ◽  
Packet Reordering ◽  
Traffic Characteristics ◽  
Network Utilization ◽  
The Impact

AbstractModern data center networks typically adopt multi-rooted tree topologies such leaf-spine and fat-tree to provide high bisection bandwidth. Load balancing is critical to achieve low latency and high throughput. Although the per-packet schemes such as Random Packet Spraying (RPS) can achieve high network utilization and near-optimal tail latency in symmetric topologies, they are prone to cause significant packet reordering and degrade the network performance. Moreover, some coding-based schemes are proposed to alleviate the problem of packet reordering and loss. Unfortunately, these schemes ignore the traffic characteristics of data center network and cannot achieve good network performance. In this paper, we propose a Heterogeneous Traffic-aware Partition Coding named HTPC to eliminate the impact of packet reordering and improve the performance of short and long flows. HTPC smoothly adjusts the number of redundant packets based on the multi-path congestion information and the traffic characteristics so that the tailing probability of short flows and the timeout probability of long flows can be reduced. Through a series of large-scale NS2 simulations, we demonstrate that HTPC reduces average flow completion time by up to 60% compared with the state-of-the-art mechanisms.

scholarly journals The influence of cronyism on entrepreneurial resource acquisition

2021 ◽  
Author(s):  
Junfan Yu ◽  
Saskia De Klerk ◽  
Michael Hess
Keyword(s):  
Community Involvement ◽  
Private Property ◽  
Resource Acquisition ◽  
Property Development ◽  
Network Utilization ◽  
Start Up ◽  
Entrepreneurial Strategies ◽  
Staged Model ◽  
The Impact

AbstractThis research focuses on how entrepreneurs utilize cronyism to acquire resources. A case study method allowed us to explore three firms in the private property development industry in China. These firms uniquely cultivated cronyism and achieved distinctly different outcomes. Our findings highlight Chinese entrepreneurs in start-up ventures and later-stage enterprises employ cronyism. The underlying rationale for using cronyism have common and heterogeneous motivations. The similarity and distinguishing rationale also apply to the impact of cronyism. We also find two contingency working mechanisms for cronyism: entrepreneurial characteristics and a staged model for cronyism. With the firm’s growth, cronyism remains important, but firms with more community involvement outperform others. This research contributes to the theory on strategic network utilization for resource acquisition during entrepreneurial development stages. We investigate how entrepreneurial strategies can assist in adapting to the “rules of the game” while utilizing resources within the set contextual constraints.

Ant Colony-Based Load Balancing Algorithm for Multi-Source Multicast Networks

2011 ◽  
Vol 204-210 ◽  
pp. 1399-1402
Author(s):  
Ling Xiu Wang ◽  
Ye Wen Cao
Keyword(s):  
Ant Colony Algorithm ◽  
Minimum Spanning Tree ◽  
Ant Colony ◽  
Multicast Networks ◽  
Multicast Protocol ◽  
Multicast Protocols ◽  
Network Utilization ◽  
Multicast Traffic ◽  
Multicast Scheduling ◽  
Load Balancing Algorithm

IP multicast protocols tend to construct a single minimum spanning tree for a multicast source (i.e., group), in which only a few internal nodes supply multicast traffic. In multicast networks especially with multiple multicast sources where bottleneck effects may occur frequently, frequently used multicast service leads to inefficient network utilization problems. This paper presents a new network utilization algorithm for multicasting called load distribution algorithm (LDA). The LDA algorithm uses selecting candidate path based on ant colony algorithm and multicast scheduling to distribute the contention multicast packets onto their corresponding candidate paths. The numerical results show that a multicast protocol with LDA has higher efficiency of resource utilization and meanwhile maintains less end to end delay compared with the original one without LDA.

Priority-based recovery scheme improving network utilization in the IP over optical networks

2002 ◽  
Author(s):  
Sung-Woo Ryu ◽  
Dae-gun Kim ◽  
Joo S. Youn ◽  
Sok H. Jung ◽  
Chul-Hee Kang
Keyword(s):  
Optical Networks ◽  
Network Utilization ◽  
Recovery Scheme

scholarly journals Blocking Probability in Pipeline Forwarding Networks

2014 ◽  
Vol 10 (1) ◽  
pp. 30
Author(s):  
Mario Baldi ◽  
Andrea Vesco
Keyword(s):  
Proper Time ◽  
Blocking Probability ◽  
Network Routing ◽  
Analytical Models ◽  
Network Resources ◽  
High Resource ◽  
Delay Sensitive ◽  
Network Utilization ◽  
Real Size ◽  
Time Frames

As multimedia communications continue to grow steadily on the Internet, pipeline forwarding (PF) of packets provides a scalable solution for engineering delay-sensitive traffic while guaranteeing deterministic Quality of Service (QoS) with high resource utilization. In PF networks resource reservation, while ensuring deterministic QoS on a per-flow basis, can result in a not null blocking probability. A reservation request may fails due to enough resources being available but not during the proper time frames. This work analyses blocking probability of reservation requests since it affects the capability of utilizing network resources to carry traffic with deterministic QoS. The blocking probability and, consequently, the achievable network utilization are analytically derived on general topology PF networks as function of the traffic intensity given the traffic matrix and the network routing. The correctness of the blocking models is also assessed by simulation in different scenarios. This work represent a valuable contribution over previous analytical models of the blocking probability as their application to real size scenarios is impractical due to their computation complexity.

Sign in / Sign up

Export Citation Format

Share Document