A generic architecture for autonomic service and network management

As the Internet evolves into an all-IP communication infrastructure, a key issue to consider is that of creating and managing IP-based services with efficient resource utilization in a scalable, flexible, and automatic way. In this paper, we present the Autonomic Service Architecture (ASA), a uniform framework for automated management of both Internet services and their underlying network resources. ASA ensures the delivery of services according to specific service level agreements (SLAs) between customers and service providers. As an illustrative example, ASA is applied to the management of DiffServ/MPLS networks, where we propose an autonomic bandwidth sharing scheme. With the proposed scheme, the bandwidth allocated for each SLA can be automatically adjusted according to the measured traffic load and under policy control for efficient resource utilization, while SLA compliance over the network is always guaranteed.     

An Efficient Resource Allocation Mechanism for LTE–GEPON Converged Networks

Optical–wireless convergence is becoming popular as one of the most efficient access network designs that provides quality of service (QoS) guaranteed, uninterrupted, and ubiquitous access to end users. The integration of passive optical networks (PONs) with next-generation wireless access networks is not only a promising integration option but also a cost-effective way of backhauling the next generation wireless access networks. The QoS performance of the PON–wireless converged network can be improved by taking the advantages of the features in both network segments for bandwidth resources management. In this paper, we propose a novel resource allocation mechanism for long term evolution–Gigabit Ethernet PON (LTE–GEPON) converged networks that improves the QoS performance of the converged network. The proposed resource allocation mechanism takes the advantage of the ability to forecast near future packet arrivals in the converged networks. Moreover, it also strategically leverages the inherited features and the frame structures of both the LTE network and GEPON, to manage the available bandwidth resources more efficiently. Using extensive simulations, we show that our proposed resource allocation mechanism improves the delay and jitter performance in the converged network while guarantying the QoS for various next generation broadband services provisioned for both wireless and wired end users. Moreover, we also analyze the dependency between different parameters and the performance of our proposed resource allocations scheme.     

Distributed information service architecture for overlapping multiaccess networks

Multimedia delivery in mobile multiaccess network environments has emerged as a key area within the future Internet research domain. When network heterogeneity is coupled with the proliferation of multiaccess capabilities in mobile handheld devices, one can expect many new avenues for developing novel services and applications. New mechanisms for audio/video delivery over multiaccess networks will define the next generation of major distribution technologies, but will require significantly more information to operate according to their best potential. In this paper we present and evaluate a distributed information service, which can enhance media delivery over such multiaccess networks. We describe the proposed information service, which is built upon the new distributed control and management framework (DCMF) and the mobility management triggering functionality (TRG). We use a testbed which includes 3G/HSPA, WLAN and WiMAX network accesses to evaluate our proposed architecture and present results that demonstrate its value in enhancing video delivery and minimizing service disruption in an involved scenario.     

A new surrogate placement algorithm for cloud-based content delivery networks

Cloud-based content delivery networks (CCDNs) have been developed as the next generation of content delivery networks (CDNs). In CCDNs, the cloud contributes to the cost-effective, pay-as-you-go model, and virtualization and the traditional CDNs contribute to content replications. Delivering infrastructure as a service in a networked cloud computing environment requires mapping virtual resources to physical resources, as well as traditional surrogate placement. In this paper, we develop a novel algorithm for virtual surrogate placement that combines multiple knapsack and competitive facility location problems. Moreover, we provide new formulations and theories for this problem. Finally, we compare our algorithm with the previous heuristics. Simulation results show that the proposed algorithm achieves significantly better results in terms of a decreased number of surrogate servers, decreased total path length between end users and surrogate servers, decreased average workload variance and CCDN deployment cost.     

OpenIPTV: a comprehensive SDN-based IPTV service framework

IPTV is an emerging TV content delivery service that should guarantee Quality of Service (QoS) to deliver television contents over IP for their customers. However, providing such QoS regarding service level agreements (SLA) requires frequent service monitoring and adaptive configuration mechanisms. Nowadays, Software Defined Networks (SDNs) provide capabilities to deploy and manage networks dynamically and can maintain QoS. In this paper, a novel IPTV service framework (OpenIPTV) is proposed, which utilizes SDN as an underlying technology for providing QoS for IPTV customers in a shared backbone network. OpenIPTV is implemented in a well-known OpenDayLight controller and strictly followed a modular design for the sake of efficiency. OpenIPTV comprises all service requirements such as resource monitoring, channel changing, multicast group managing and dynamic QoS multicast traffic engineering. The performance of OpenIPTV is evaluated under different scenarios and experimental results confirmed the effectiveness of the proposed framework in terms of QoS metrics. Furthermore, experimental results show that OpenIPTV is a feasible and practical solution to deliver IPTV services with high level of QoS over SDN.     

An evaluation method for secure virtual network embedding algorithms

Due to the ossification of the current Internet, it is difficult to launch new service. One of solutions is network virtualization. Numerous virtual network embedding (VNE) algorithms have been proposed in many literatures. But, there is no general methods or frameworks for evaluation of these algorithms. We have analyzed a number of studies, and found appropriate evaluation indexes that can be used in evaluating the functionalities of VNE algorithms. Based on those indexes, we presented a new evaluation method of secure VNE algorithms. To make a virtual network with the various requirements, the infrastructure provider needs effective resource allocation algorithm. The role of VNE is to allocate physical resources to virtual nodes or links to form virtual networks. In order to use the resources of physical networks, appropriate resource allocation algorithms are required. We found a set of evaluation indexes by analyzing the previous proposed researches. Through analysis, we found that our proposed method can be grouped into two functional attributes for classification. One attribute is the basic attributes that mean special features of architecture and the other is the evaluation attributes that perform the assessment of algorithms. We have evaluated the algorithms with our proposed evaluation methods and found to be useful to choose the appropriate algorithm to the infrastructure provider. The proposed method was found to be more convenient to perform the evaluation of the algorithms in real-world simulation. This method helps infrastructure providers to choose the appropriate VNE algorithm.     

SLA based resource allocation policies in autonomic environments

Nowadays, large service centers provide computational capacity to many customers by sharing a pool of IT resources. The service providers and their customers negotiate utility based Service Level Agreement (SLA) to determine the costs and penalties on the base of the achieved performance level. The system is often based on a multi-tier architecture to serve requests and autonomic techniques have been implemented to manage varying workload conditions. The service provider would like to maximize the SLA revenues, while minimizing its operating costs. The system we consider is based on a centralized network dispatcher which controls the allocation of applications to servers, the request volumes at various servers and the scheduling policy at each server. The dispatcher can also decide to turn ON or OFF servers depending on the system load. This paper designs a resource allocation scheduler for such multi-tier autonomic environments so as to maximize the profits associated with multiple class SLAs. The overall problem is NP-hard. We develop heuristic solutions by implementing a local-search algorithm. Experimental results are presented to demonstrate the benefits of our approach.     

cTMvSDN: improving resource management using combination of Markov-process and TDMA in software-defined networking

Network simulation and capabilities in the form of a logical network has increased the development of virtual networks rapidly. It is one of the best ways to increase productivity and optimize hardware equipment. Network-Virtualization plays a very important role in the development of networks as the size of the networks increases vastly. This paper examines one of the most important issues in network virtualization to provide an efficient dynamic resources infrastructure management on Software-Based Networks. The proposed method (cTMvSDN) improves resource management based on combination of Markov-Process and Time Division Multiple Access (TDMA) protocol. A customized module to the controller only initializes the mapping when there are sufficient available resources. In order to optimize the response time and SDN Quality of service, the Markov-Pattern and TDMA slicing model are used to predict the next time gaps. Successfully mapped packets will be sent in TDMA slots. Simulation results performed with NS2 and Mininet simulator showed improvement in metrics such as delay and costs in comparison with relevant studies in the literature.

     

ARMCO: Advanced topics in resource management for ubiquitous cloud computing: An adaptive approach

Cloud Computing can be seen as one of the latest major evolution in computing offering unlimited possibility to use ICT in various domains: business, smart cities, medicine, environmental computing, mobile systems, design and implementation of cyber-infrastructures. The recent expansion of Cloud Systems has led to adapting resource management solutions for large number of wide distributed and heterogeneous datacenters. The adaptive methods used in this context are oriented on: self-stabilizing, self-organizing and autonomic systems; dynamic, adaptive and machine learning based distributed algorithms; fault tolerance, reliability, availability of distributed systems. The pay-per-use economic model of Cloud Computing comes with a new challenge: maximizing the profit for service providers, minimizing the total cost for customers and being friendly with the environment.This special issue presents advances in virtual machine assignment and placement, multi-objective and multi-constraints job scheduling, resource management in federated Clouds and in heterogeneous environments, dynamic topology for data distribution, workflow performance improvement, energy efficiency techniques and assurance of Service Level Agreements.     

Priority-enabled optical shared protection: An online efficiency evaluation study

The availability of an optical connection is considered to be a critical service differentiator in WDM optical networks. In this regard, the design of a protection scheme that is able to improve the availability of high priority connections while making efficient use of optical resources is a major concern for optical network operators. In a previous work, we proposed the so-called priority-aware shared protection as a potential survivability scheme for next generation WDM networks to deal with the previously exhibited concern.

This paper develops an online study whose main purpose is to assess the efficiency of the aforementioned protection scheme. Through this study, we show that the priority-aware shared protection strategy is able to achieve both the best efficiency in terms of resource usage and in terms of availability satisfaction rate compared to existing protection solutions.     

Algorithms for optimization of the number of switchings in heat supply networks reconfiguration

Consideration is given to the problem of changing the structure of networks with reservation of lines between resources and their consumers when emergencies occur for the purpose of localization of faults and restoration of resource delivery lines. A definition of the limiting graph of reconfiguration is introduced. Using this graph, we design algorithms for finding the minimum set of vertexes the change of whose state leads to the restoration of resource delivery lines.     

A heuristic approach to resource locations in broadband networks

In broadband networks, such as ATM, the importance of dynamic migration of data resources is increasing because of its potential to improve performance especially for transaction processing. In environments with migratory data resources, it is necessary to have mechanisms to manage the locations of each data resource. In this paper, we present an algorithm that makes use of system state information (state of each site corresponding to all data resources) and heuristics to manage locations of data resources in a distributed network. In the proposed algorithm, each site maintains information about state of other sites with respect to each data resource of the system and uses it to find (i) a subset of sites likely to have the requested data resource and (ii) the site where the data resource is to be migrated from the current site. The proposed algorithm enhances its effectiveness by continuously updating system state information stored at each site. It focuses on reducing the overall average time delay needed by the transaction requests to locate and access the migratory data resources. We have evaluated the performance of the proposed algorithm and have also compared it with one of the existing location management algorithms, by simulation studies under several system parameters such as frequency of requests generation, frequency of data resource migrations, network topology and scale of network. The experimental results show the effectiveness of the proposed algorithm in all cases.     

A semantic collaborative awareness model to deal with resource sharing in grids

Grid computing environments are set up mainly to encourage the shared use of different resources based on business/scientific needs. The way these resources are shared in terms of CPU cycles, storage capacity, software licenses etc., is normally dictated by the availability of these resources outside the local administration context. The Semantic Grid is the extension of Grid computing with Semantic Web-based technologies. The Semantic Grid represents grid management data in a machine-understandable format, and reasoning can handle complicated situations in virtual organization management. This paper presents the extension of the collaborative awareness model (CAM) to manage virtual organizations in Semantic Grid environments. CAM applies some theoretical principles of awareness models to promote resource interaction and management, as well as task delivery.     

Towards an autonomic performance management approach for a cloud broker environment using a decomposition–coordination based methodology

Efficient resource allocation of computational resources to services is one of the predominant challenges in a cloud computing environment. Furthermore, the advent of cloud brokerage and federated cloud computing systems increases the complexity of cloud resource management. Cloud brokers are considered third party organizations that work as intermediaries between the service providers and the cloud providers. Cloud brokers rent different types of cloud resources from a number of cloud providers and sublet these resources to the requesting service providers. In this paper, an autonomic performance management approach is introduced that provides dynamic resource allocation capabilities for deploying a set of services over a federated cloud computing infrastructure by considering the availability as well as the demand of the cloud computing resources. A distributed control based approach is used for providing autonomic computing features to the proposed framework via a feedback-based control loop. This distributed control based approach is developed using one of the decomposition–coordination methodologies, named interaction balance, for interactive bidding of cloud computing resources. The primary goals of the proposed approach are to maintain the service level agreements, maximize the profit, and minimize the operating cost for the service providers and the cloud broker. The application of interaction balance methodology and prioritization of profit maximization for the cloud broker and the service providers during resource allocation are novel contributions of the proposed approach.     

A mechanism for resource pricing and fairness in peer-to-peer networks

In peer-to-peer (P2P) networks, each peer acts as the role of client and server. As a client, each peer is regarded as a service customer. It sends requests to other peers to download files and obtains resource allocation from them. As a server, each peer is thought as a service provider. It receives service requests from other peers and allocates its resources to them. To encourage cooperation between peers, fairness is very important in P2P networks since it fosters an incentive to the peers to offer resources to the network. We formulate a fair resource allocation model for P2P networks and investigate the utility optimization problem by Lagrangian method. In order to realize the optimal resource allocation, we present a novel price-based resource allocation scheme by applying the first order Lagrangian method and low-pass filtering scheme, so that a service provider can allocate its resources to its customers based on offered prices, achieving the efficient and fair allocation of the available resources to the serviced customers. Simulation results confirm that the proposed algorithm can achieve the optimum within reasonable convergence times.     

Middleware support for service discovery in special operations mobile ad hoc networks

Technology can play a significant role in the management and coordination activities of special operations such as emergency response, military combat missions, forest firefighting, etc. Mobile ad hoc networks (MANETs) can be used quite effectively to manage resource sharing in such operations due to their flexibility and ease of establishment. The concept of service discovery has some appealing characteristics and features that can be adopted and adapted for the nature and needs of these applications. In this study, we present the middleware architecture of a service discovery and allocation system that we propose for the applications of special operations. The main purpose of the proposed system is to locate, reserve and assign a certain service to the party that is in need of this service, with little or no human intervention. The concerned service could be medics, equipment, ambulances, etc. The network participants are divided into service providers, service requestors and anchor nodes. The anchor nodes are the ones which are used to manage resource discovery and allocation. The proposed middleware takes into consideration the classification of these network nodes on the basis of their function. Based on the classification of a certain node, only the middleware modules relevant to its function are activated. We describe the design of this middleware in detail. We also experiment with the proposed technique and present some results that show its capabilities from different performance perspectives.     

A new step toward load balancing based on competency rank and transitional phases in Grid networks

Grid computing is a network of software-hardware capabilities. It serves as a comprehensive and complete system for organizations by which the maximum utilization from resources is achieved. Resource distribution in a heterogeneous and unstable environment and also effective load distribution among these resources are the important and difficult problems in Grid networks. Using dynamic and static algorithms or searching tree and Branch and Bound algorithm are considered to be among the available methods to reach the load balancing in Grid networks. This paper presents a new method for dynamic load balancing. In this method, we use the subtraction of forward and backward ants as a competency rank to take the priority of the sites, and we use a control word to search the suitable resource as well. Our main purpose is to devote jobs to the existing resources based on their processing power. Simulation results show that the proposed method can reduce the total completion time and also total tardiness to get the load balancing. The cost of using resources as an effective factor in load balancing is also observed.     

基于下一代Internet的服务管理研究

Internet is best effort network, on the whole, it doesn't provide any quality of service assurance for services. Especially,all kinds of stream media need more network performance and quality of service. Currently, because of existing many heterogeneous networks, such as telecommunication network, IP data network , mobile network and so on ,in order to break off this heterogeneous network isolated complexion ,research and developmentnext generation network must be carried out,only by this way,can these isolated heterogeneous network be merged into an all IP network. This network will provide enormous services for service users,how to manage these services effectively is a topic proposed by next generation internet. [1] gave research status for service management and advance,this paper researches service management requirement for next generation Internet and workflow etc,and based on these technique,a service management architecture model is proposed. It consists of service access layer, service deployment layer, service providing layer, service mapping layer, policy control layer and network element managing layer. These layers coordinate to implement service management.