Routing through networks with hierarchical topology aggregation
Journal of High Speed Networks
SIAM Journal on Computing
Optimal PNNI complex node representations for restrictive costs and minimal path computation time
IEEE/ACM Transactions on Networking (TON)
Source-oriented topology aggregation with multiple QoS parameters in hierarchical networks
ACM Transactions on Modeling and Computer Simulation (TOMACS)
On the k-Splittable Flow Problem
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Hierarchical QoS routing in delay-bandwidth sensitive networks
LCN '00 Proceedings of the 25th Annual IEEE Conference on Local Computer Networks
Multicommodity flow problems with a bounded number of paths: A flow deviation approach
Networks - Special Issue on Multicommodity Flows and Network Design
Hierarchical routing in multi-domain optical networks
Computer Communications
Analysis of Topology Aggregation techniques for QoS routing
ACM Computing Surveys (CSUR)
Future Generation Computer Systems
Resource Information Aggregation in Hierarchical Grid Networks
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
Topology aggregation: Merged-star method for multiple non-isomorphic topology subgraphs
Computer Communications
A hierarchical routing approach for optical transport networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - Optical networks
A service plane architecture for future optical internet
ONDM'09 Proceedings of the 13th international conference on Optical Network Design and Modeling
On advance reservation of heterogeneous network paths
Future Generation Computer Systems - Special issue: High-speed networks and services for data-intensive grids: The DataTAG project
Dynamic paths in multi-domain optical networks for grids
Future Generation Computer Systems - Special issue: High-speed networks and services for data-intensive grids: The DataTAG project
NETWORKING'08 Proceedings of the 7th international IFIP-TC6 networking conference on AdHoc and sensor networks, wireless networks, next generation internet
Service differentiation based on flexible time constraints in market-oriented grids
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
The reservoir model and architecture for open federated cloud computing
IBM Journal of Research and Development
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part I
Routing and wavelength assignment of scheduled lightpath demands
IEEE Journal on Selected Areas in Communications
Identity-based data storage in cloud computing
Future Generation Computer Systems
A cost efficient framework and algorithm for embedding dynamic virtual network requests
Future Generation Computer Systems
Hi-index | 0.00 |
The rapid development and diversification of Cloud services occurs in a very competitive environment. The number of actors providing Infrastructure as a Service (IaaS) remains limited, while the number of PaaS (Platform as a Service) and SaaS (Software as a Service) providers is rapidly increasing. In this context, the ubiquity and the variety of Cloud services impose a form of collaboration between all these actors. For this reason, Cloud Service Providers (CSPs) rely on the availability of computing, storage, and network resources generally provided by various administrative entities. This multi-tenant environment raises multiple challenges such as confidentiality and scalability issues. To address these challenges, resource (network, computing, and storage) abstraction is introduced. In this paper, we focus on network resource abstraction algorithms used by a Network Service Provider (NSP) for sharing its network topology without exposing details of its physical resources. In this context, we propose two network resource abstraction techniques. First, we formulate the network topology abstraction problem as a Mixed-Integer Linear Program (MILP). Solving this formulation provides an optimal abstracted topology to the CSP in terms of availability of the underlying resources. Second, we propose an innovative scalable algorithm called SILK-ALT inspired from the SImple LinK (SILK) algorithm previously proposed by Abosi et al. We compare the MILP formulation, the SILK-ALT algorithm, and the SILK algorithm in terms of rejection ratio of users' requests at both the Cloud provider and the network provider levels. Using our proposed algorithms, the obtained numerical results show that resource abstraction in general and network topology abstraction in particular can effectively hide details of the underlying infrastructure. Moreover, these algorithms represent a scalable and sufficiently accurate way of advertising the resources in a multi-tenant environment.