scholarly journals Nxt-Freedom: Considering VDC-Based Fairness in Enforcing Bandwidth Guarantees in Cloud Datacenter

2020 ◽  
Vol 10 (21) ◽  
pp. 7874
Author(s):  
Shuo Wang ◽  
Zhiqiang Zhou ◽  
Hongjie Zhang ◽  
Jing Li
Keyword(s):  
Virtual Machine ◽  
Virtual Network ◽  
Specific Information ◽  
Network Resources ◽  
Network Resource ◽  
Free Network ◽  
Minimum Bandwidth ◽  
Cloud Datacenter ◽  
Bandwidth Guarantees ◽  
Cloud Network

In the cloud datacenter, for the multi-tenant model, network resources should be fairly allocated among VDCs (virtual datacenters). Conventionally, the allocation of cloud network resources is on a best-effort basis, so the specific information of network resource allocation is unclear. Previous research has either aimed to provide minimum bandwidth guarantee, or focused on realizing work conservation according to the VM-to-VM (virtual machine to virtual machine) flow policy or per-source policy, or both policies. However, they failed to consider allocating redundant bandwidth among VDCs in a fair way. This paper presents a bandwidth that guarantees enforcement framework NXT-Freedom, and this framework allocates the network resources on the basis of per-VDC fairness, which can achieve work conservation. In order to guarantee per-VDC fair allocation, a hierarchical max–min fairness algorithm is put forward in this paper. In order to ensure that the framework can be applied to non-congestion-free network core and achieve scalability, NXT-Freedom decouples the computation of per-VDC allocation from the execution of allocation, but it brings some CPU overheads resulting from bandwidth enforcement. We observe that there is no need to enforce the non-blocking virtual network. Leveraging this observation, we distinguish the virtual network type of VDC to eliminate part of the CPU overheads. The evaluation results of a prototype prove that NXT-Freedom can achieve the isolation of per-VDC performance, which also shows fast adaption to flow variation in cloud datacenter.

scholarly journals GANA-VDC: Application-Aware with Bandwidth Guarantee in Cloud Datacenters

Electronics ◽  
2019 ◽  
Vol 8 (3) ◽  
pp. 258
Author(s):  
Saleem Karmoshi ◽  
Shuo Wang ◽  
Naji Alhusaini ◽  
Jing Li ◽  
Ming Zhu ◽  
...  
Keyword(s):  
Network Architecture ◽  
Network Virtualization ◽  
Virtual Network ◽  
Network Resources ◽  
Network Resource ◽  
Physical Network ◽  
Network Bandwidth ◽  
Application Aware ◽  
Bandwidth Guarantees ◽  
Bandwidth Guarantee

Allocating bandwidth guarantees to applications in the cloud has become increasingly demanding and essential as applications compete to share cloud network resources. However, cloud-computing providers offer no network bandwidth guarantees in a cloud environment, predictably preventing tenants from running their applications. Existing schemes offer tenants practical cluster abstraction solutions emulating underlying physical network resources, proving impractical; however, providing virtual network abstractions has remained an essential step in the right direction. In this paper, we consider the requirements for enabling the application-aware network with bandwidth guarantees in a Virtual Data Center (VDC). We design GANA-VDC, a network virtualization framework supporting VDC application-aware networking with bandwidth guarantees in a cloud datacenter. GANA-VDC achieves scalability using an interceptor to translate OpenFlow features to prompt fine-grained Quality of Service (QoS). Facilitating the expression of diverse network resource demands, we also propose a new Virtual Network (VN) to Physical Network (PN) mapping approach, Graph Abstraction Network Architecture (GANA), which we innovatively introduce in this paper, allowing tenants to provide applications with cloud networking environment, thereby increasing the preservation performance. Our results show GANA-VDC can provide bandwidth guarantee and achieve low time complexity, yielding higher network utility.

scholarly journals An Edge-Based Approach for Virtual Network Embedding Based on the Graph Edit Distance

2021 ◽  
Author(s):  
Ze Xi Xu ◽  
Lei Zhuang ◽  
Meng Yang He ◽  
Si Jin Yang ◽  
Yu Song ◽  
...  
Keyword(s):  
Edit Distance ◽  
Virtual Network ◽  
Cost Ratio ◽  
Virtual Network Embedding ◽  
Network Embedding ◽  
Graph Edit Distance ◽  
Network Resources ◽  
Network Resource ◽  
Distance Method ◽  
Edge Based

Abstract Virtualization and resource isolation techniques have enabled the efficient sharing of networked resources. How to control network resource allocation accurately and flexibly has gradually become a research hotspot due to the growth in user demands. Therefore, this paper presents a new edge-based virtual network embedding approach to studying this problem that employs a graph edit distance method to accurately control resource usage. In particular, to manage network resources efficiently, we restrict the use conditions of network resources and restrict the structure based on common substructure isomorphism and an improved spider monkey optimization algorithm is employed to prune redundant information from the substrate network. Experimental results showed that the proposed method achieves better performance than existing algorithms in terms of resource management capacity, including energy savings and the revenue-cost ratio.

scholarly journals ANCS: Achieving QoS through Dynamic Allocation of Network Resources in Virtualized Clouds

2016 ◽  
Vol 2016 ◽  
pp. 1-10 ◽  
Author(s):  
Cheol-Ho Hong ◽  
Kyungwoon Lee ◽  
Hyunchan Park ◽  
Chuck Yoo
Keyword(s):  
Cloud Computing ◽  
Lightweight Design ◽  
Dynamic Allocation ◽  
Network Resources ◽  
Network Resource ◽  
Distribute System ◽  
Bandwidth Limitation ◽  
Scheduling Method ◽  
Minimum Bandwidth ◽  
Computing Platforms

To meet the various requirements of cloud computing users, research on guaranteeing Quality of Service (QoS) is gaining widespread attention in the field of cloud computing. However, as cloud computing platforms adopt virtualization as an enabling technology, it becomes challenging to distribute system resources to each user according to the diverse requirements. Although ample research has been conducted in order to meet QoS requirements, the proposed solutions lack simultaneous support for multiple policies, degrade the aggregated throughput of network resources, and incur CPU overhead. In this paper, we propose a new mechanism, called ANCS (Advanced Network Credit Scheduler), to guarantee QoS through dynamic allocation of network resources in virtualization. To meet the various network demands of cloud users, ANCS aims to concurrently provide multiple performance policies; these include weight-based proportional sharing, minimum bandwidth reservation, and maximum bandwidth limitation. In addition, ANCS develops an efficient work-conserving scheduling method for maximizing network resource utilization. Finally, ANCS can achieve low CPU overhead via its lightweight design, which is important for practical deployment.

scholarly journals On Blockchain-Based Cross-Service Communication and Resource Orchestration on Edge Clouds

Informatics ◽  
2021 ◽  
Vol 8 (1) ◽  
pp. 13
Author(s):  
Konstantinos Papadakis-Vlachopapadopoulos ◽  
Ioannis Dimolitsas ◽  
Dimitrios Dechouniotis ◽  
Eirini Eleni Tsiropoulou ◽  
Ioanna Roussaki ◽  
...  
Keyword(s):  
Network Function Virtualization ◽  
Network Resources ◽  
Service Orchestration ◽  
Network Slicing ◽  
Network Function ◽  
Resource Orchestration ◽  
Full Capacity ◽  
Cloud Datacenter ◽  
Set Up ◽  
The Internet Of Things

With the advent of 5G verticals and the Internet of Things paradigm, Edge Computing has emerged as the most dominant service delivery architecture, placing augmented computing resources in the proximity of end users. The resource orchestration of edge clouds relies on the concept of network slicing, which provides logically isolated computing and network resources. However, though there is significant progress on the automation of the resource orchestration within a single cloud or edge cloud datacenter, the orchestration of multi-domain infrastructure or multi-administrative domain is still an open challenge. Towards exploiting the network service marketplace at its full capacity, while being aligned with ETSI Network Function Virtualization architecture, this article proposes a novel Blockchain-based service orchestrator that leverages the automation capabilities of smart contracts to establish cross-service communication between network slices of different tenants. In particular, we introduce a multi-tier architecture of a Blockchain-based network marketplace, and design the lifecycle of the cross-service orchestration. For the evaluation of the proposed approach, we set up cross-service communication in an edge cloud and we demonstrate that the orchestration overhead is less than other cross-service solutions.

Layered virtual machine migration algorithm for network resource balancing in cloud computing

2017 ◽  
Vol 12 (1) ◽  
pp. 75-85 ◽  
Author(s):  
Xiong Fu ◽  
Juzhou Chen ◽  
Song Deng ◽  
Junchang Wang ◽  
Lin Zhang
Keyword(s):  
Cloud Computing ◽  
Virtual Machine ◽  
Virtual Machine Migration ◽  
Network Resource

Network resource mobilisation limitations and the alliance portfolio network

2021 ◽  
Vol ahead-of-print (ahead-of-print) ◽  
Author(s):  
Luis Miguel Bolivar ◽  
Ignacio Castro-Abancéns ◽  
Cristóbal Casanueva ◽  
Angeles Gallego
Keyword(s):  
Financial Performance ◽  
Curvilinear Relationship ◽  
Network Resources ◽  
Network Resource ◽  
Alliance Portfolio ◽  
Value Capture ◽  
Content Type ◽  
Network Parameters ◽  
Resource Mobilisation ◽  
Practical Implications

PurposeThe purpose of this study is to examine how access and mobilisation of network resources influence a firm's performance. It has been established that alliance portfolio (AP) network parameters shape the access to network resources; however, resource access understood as value creation differs from resource mobilisation understood as value capture. Hence, the paper contributes towards the comprehension of AP performance by examining the extent to which a firm's level of network resource mobilisation (NRM) plays a role in improving financial performance and how this strategy conditions the benefits obtained from a firm's AP.Design/methodology/approachThis study employs an interorganisational network approach to describe the APs of firms; subsequently, it examines how AP network parameters and resource mobilisation determine financial performance. To this end, sequential multiple regression models are applied to a sample from the Top International Airlines database, covering 135 portfolios that correspond to 1117 codeshare partnerships.FindingsThe analyses show that the NRM level has an inverted U-shaped relationship with revenue performance, thereby revealing the limitations and considerations in the strategic alliance strategy. In addition, the authors show how the resource mobilisation decision moderates the faculty of AP parameters to influence a firm's financial performance, thereby exposing the nuanced relationship between AP size, diversity and redundancy. The findings convey strategic and practical implications for managers regarding how to capture value from their APs.Practical implicationsThe findings suggest the need for NRM to form part of a firm's AP management capability, so that, by acquiring superior strategic knowledge in NRM, the firm is able to extract value from its AP through the optimal exploitation of complementary assets.Originality/valuePrevious research has highlighted the multidimensional nature of APs at the theoretical level; however, no simultaneous empirical analysis of various AP parameters has yet been produced. The research empirically analyses an AP network and how its parameters affect financial performance in the presence of a resource mobilisation strategy. Not only do the authors introduce the analysis of the curvilinear relationship between the level of NRM and a firm's performance, but also of its role in advancing the AP literature.

scholarly journals An Effective and Efficient Adaptive Probability Data Dissemination Protocol in VANET

Data ◽  
2018 ◽  
Vol 4 (1) ◽  
pp. 1 ◽  
Author(s):  
John Sospeter ◽  
Di Wu ◽  
Saajid Hussain ◽  
Tesfanesh Tesfa
Keyword(s):  
Data Dissemination ◽  
Probabilistic Approach ◽  
Mobile Network ◽  
Delivery Ratio ◽  
Network Resources ◽  
Network Resource ◽  
V2v Communication ◽  
End To End Delay ◽  
End To End ◽  
Road Segments

Mobile network topology changes dynamically over time because of the high velocity of vehicles. Therefore, the concept of the data dissemination scheme in a VANET environment has become an issue of debate for many research scientists. The main purpose of VANET is to ensure passenger safety application by considering the critical emergency message. The design of the message dissemination protocol should take into consideration effective data dissemination to provide a high packet data ratio and low end-to-end delay by using network resources at a minimal level. In this paper, an effective and efficient adaptive probability data dissemination protocol (EEAPD) is proposed. EEAPD comprises a delay scheme and probabilistic approach. The redundancy ratio (r) metric is used to explain the correlation between road segments and vehicles’ density in rebroadcast probability decisions. The uniqueness of the EEAPD protocol comes from taking into account the number of road segments to decide which nodes are suitable for rebroadcasting the emergency message. The last road segment is considered in the transmission range because of the probability of it having small vehicle density. From simulation results, the proposed protocol provides a better high-packet delivery ratio and low-packet drop ratio by providing better use of the network resource within low end-to-end delay. This protocol is designed for only V2V communication by considering a beaconless strategy. the simulations in this study were conducted using Ns-3.26 and traffic simulator called “SUMO”.

A Discovery Technology Based on Distributed Resource Management Domain

2015 ◽  
Vol 713-715 ◽  
pp. 2195-2198
Author(s):  
Jun Li Mao ◽  
Xiang Luo ◽  
Xiao Zhen Wang ◽  
Chao Hong Yang
Keyword(s):  
Resource Management ◽  
Resource Selection ◽  
Resource Discovery ◽  
Network Resources ◽  
Network Resource ◽  
Management Domain ◽  
Network Resource Management ◽  
Long Time ◽  
Resource Organization ◽  
Resource Description

Resource discovery is the key of network resource management, which includes multiple aspects, such as resource description, resource organization, and resource discovery and resource selection. For a long time, communication network resourcehas been lack of unified and standardized description, causing users difficult to precisely find related resources in demand. This paper presents a distributed resource query methods based on management domain, including distributed resource query architecture, the basic process of resource discovery, update method,query methods and so on. The method of network resources makes use of collaborative queries to realize network resource discovery according to need.

Sign in / Sign up

Export Citation Format

Share Document