The Cloud Inside the Network

2015 ◽  
pp. 2198-2224
Author(s):  
João Soares ◽  
Romeu Monteiro ◽  
Márcio Melo ◽  
Susana Sargento ◽  
Jorge Carapinha
Keyword(s):  
Cloud Service ◽  
Integrated Approach ◽  
Cloud Services ◽  
Programming Formulation ◽  
Network Resources ◽  
Major Drawback ◽  
Linear Programming Formulation ◽  
Different Levels ◽  
Integer Linear Programming Formulation ◽  
Cloud Resources

The access infrastructure to the cloud is usually a major drawback that limits the uptake of cloud services. Attention has turned to rethinking a new architectural deployment of the overall cloud service delivery. In this chapter, the authors argue that it is not sufficient to integrate the cloud domain with the operator's network domain based on the current models. They envision a full integration of cloud and network, where cloud resources are no longer confined to a data center but are spread throughout the network and owned by the network operator. In such an environment, challenges arise at different levels, such as in resource management, where both cloud and network resources need to be managed in an integrated approach. The authors particularly address the resource allocation problem through joint virtualization of network and cloud resources by studying and comparing an Integer Linear Programming formulation and a heuristic algorithm.

The Cloud Inside the Network

2013 ◽  
pp. 46-72 ◽  
Author(s):  
João Soares ◽  
Romeu Monteiro ◽  
Márcio Melo ◽  
Susana Sargento ◽  
Jorge Carapinha
Keyword(s):  
Cloud Service ◽  
Integrated Approach ◽  
Cloud Services ◽  
Programming Formulation ◽  
Network Resources ◽  
Major Drawback ◽  
Linear Programming Formulation ◽  
Different Levels ◽  
Integer Linear Programming Formulation ◽  
Cloud Resources

The access infrastructure to the cloud is usually a major drawback that limits the uptake of cloud services. Attention has turned to rethinking a new architectural deployment of the overall cloud service delivery. In this chapter, the authors argue that it is not sufficient to integrate the cloud domain with the operator’s network domain based on the current models. They envision a full integration of cloud and network, where cloud resources are no longer confined to a data center but are spread throughout the network and owned by the network operator. In such an environment, challenges arise at different levels, such as in resource management, where both cloud and network resources need to be managed in an integrated approach. The authors particularly address the resource allocation problem through joint virtualization of network and cloud resources by studying and comparing an Integer Linear Programming formulation and a heuristic algorithm.

scholarly journals Multi-Agent Path Finding with Deadlines

2018 ◽  
Author(s):  
Hang Ma ◽  
Glenn Wagner ◽  
Ariel Felner ◽  
Jiaoyang Li ◽  
T. K. Satish Kumar ◽  
...  
Keyword(s):  
Flow Problem ◽  
Search Algorithms ◽  
The Other ◽  
Path Finding ◽  
Combinatorial Search ◽  
Programming Formulation ◽  
Commodity Flow ◽  
Linear Programming Formulation ◽  
Multi Agent ◽  
Integer Linear Programming Formulation

We formalize Multi-Agent Path Finding with Deadlines (MAPF-DL). The objective is to maximize the number of agents that can reach their given goal vertices from their given start vertices within the deadline, without colliding with each other. We first show that MAPF-DL is NP-hard to solve optimally. We then present two classes of optimal algorithms, one based on a reduction of MAPF-DL to a flow problem and a subsequent compact integer linear programming formulation of the resulting reduced abstracted multi-commodity flow network and the other one based on novel combinatorial search algorithms. Our empirical results demonstrate that these MAPF-DL solvers scale well and each one dominates the other ones in different scenarios.

scholarly journals АНАЛИЗ ПОДХОДОВ К ОБЕСПЕЧЕНИЮ БЕЗОПАСНОСТИ ОБЛАЧНЫХ СЕРВИСОВ

2020 ◽  
pp. 70-82
Author(s):  
Вячеслав Вікторович Фролов
Keyword(s):  
Cloud Computing ◽  
Service Providers ◽  
Geographical Location ◽  
Cloud Service ◽  
Cloud Services ◽  
Cloud Infrastructure ◽  
Critical System ◽  
Cloud Service Providers ◽  
Safety And Reliability ◽  
Cloud Resources

The article is devoted to the analysis of modern approaches that ensure the security of cloud services. Since cloud computing is one of the fastest growing areas among information technology, it is extremely important to ensure the safety and reliability of processes occurring in the clouds and to secure the interaction between the client and the provider of cloud services. Given that fears about data loss and their compromise are one of the main reasons that some companies do not transfer their calculations to the clouds. The object of research and analysis of this work are cloud services, which are provided by various cloud service providers. The aim of the study of this work is to compare existing approaches that provide information security for cloud services, as well as offer a new approach based on the principle of diversity. There are many approaches that ensure their safety, using both traditional and cloud-specific. The multi-cloud approach is one of the most promising strategies for improving reliability by reserving cloud resources on the servers of various cloud service providers. It is shown that it is necessary to use diversity to ensure the reliability and safety of critical system components. The principle of diversity is to use a unique version of each resource thanks to a special combination of a cloud computing provider, the geographical location of data centers, cloud service presentation models, and cloud infrastructure deployment models. The differences between cloud providers and which combination of services are preferable to others in terms of productivity are discussed in detail. In addition, best practices for securing cloud resources are reviewed. As a result, this paper concludes that there is a problem of insufficient security and reliability of cloud computing and how to reduce threats in order to avoid a common cause failure and, as a result, loss of confidential data or system downtime using diversity of cloud services.

scholarly journals Tournaments as Feedback Arc Sets

10.37236/1214 ◽  
1995 ◽  
Vol 2 (1) ◽  
Author(s):  
Garth Isaak
Keyword(s):  
Linear Programming ◽  
Lower Bounds ◽  
Integer Linear Programming ◽  
Minimum Size ◽  
Programming Formulation ◽  
Binary Expansion ◽  
Feedback Arc Set ◽  
Disjoint Cycles ◽  
Linear Programming Formulation ◽  
Integer Linear Programming Formulation

We examine the size $s(n)$ of a smallest tournament having the arcs of an acyclic tournament on $n$ vertices as a minimum feedback arc set. Using an integer linear programming formulation we obtain lower bounds $s(n) \geq 3n - 2 - \lfloor \log_2 n \rfloor$ or $s(n) \geq 3n - 1 - \lfloor \log_2 n \rfloor$, depending on the binary expansion of $n$. When $n = 2^k - 2^t$ we show that the bounds are tight with $s(n) = 3n - 2 - \lfloor \log_2 n \rfloor$. One view of this problem is that if the 'teams' in a tournament are ranked to minimize inconsistencies there is some tournament with $s(n)$ 'teams' in which $n$ are ranked wrong. We will also pose some questions about conditions on feedback arc sets, motivated by our proofs, which ensure equality between the maximum number of arc disjoint cycles and the minimum size of a feedback arc set in a tournament.

Sign in / Sign up

Export Citation Format

Share Document