Service Overlay Network Research Articles

Service Composition Based on Niching Particle Swarm Optimization in Service Overlay Networks

Service oriented architecture (SOA) lends itself to model the application components to coarse-grained services in such a way that the composition of different services could be feasible. Service composition fulfills numerous service requirements by constructing composite applications with various services. As it is the case in many real-world applications, different users have diverse QoS demands issuing for composite applications. In this paper, we present a service composition framework for a typical service overlay network (SON) considering both multiple QoS constraints and load balancing factors. Moreover, a service selection algorithm based on niching technique and particle swarm optimization (PSO) is proposed for the service composition problem. It supports optimization problems with multiple constraints and objective functions, whether linear or nonlinear. Simulation results show that the proposed algorithm results in an acceptable level of efficiency regarding the service composition objective under different circumstances.

Loosely coupled service composition for deployment of next generation service overlay networks

In order to provide various attractive services to users, a user-centric approach such as usergenerated contents and services and a platform which can create a service easily and efficiently have been studied and designed during the past two decades. The IEEE NGSON standard has defined a functional architecture that provides advanced overlay functions for value-added services by collaboration of services with features of context awareness, dynamic adaptation and self-organizing management. Its service composition mechanism is comparable with service oriented architecture. However, due to SOA's complexity, it has not become as popular for user-generated services and contents as so-called mashup technologies, which also provide attractive and simple service creation. In this article we propose the adoption of loosely coupled service composition into the NGSON framework that can easily integrate existing communications and data services with little to no dependence on the underlying implementation and service description language details. Furthermore, the NGSON prototype supporting our proposal is presented as a proof of concept and to verify its advantages for operators, service providers, and end users.

Toward a multiplane framework of NGSON: a required guideline to achieve pervasive services and efficient resource utilization

The next generation service overlay network will enable the provision of pervasive services over a common IP-based transport infrastructure. However, along with the service consolidation over IP and the rapid increase of network scale, the task of service and network management has become extremely complex and disordered. Efforts are being made in various areas, such as SOA, web services, IMS, P2P/CDN overlay, and cloud computing, to achieve a scalable, secure, converged, and selfmanaged service network framework to shorten the time to market of new services, as well as lower the management costs of network/service providers. Nevertheless, these technologies are not developed in a coordinated manner for optimal scalability, resource utilization, and QoS performance. In this article, we propose a multiplane framework (MPF) for NGSON based on the integration of service composition, management, and delivery, which is a top-down reference model to achieve pervasive services and efficient resource utilization.

서비스 오버레이 네트워크의 구성을 위한 NetFPGA 기반의 IP 서비스 게이트웨이

오버레이 네트워크는 인터넷 연결성을 손상시키지 않고 새로운 네트워킹 기능을 제공할 수 있는 현실적인 방안이다. 본 논문은 서비스 오버레이의 용이한 구성을 지원하는 사용자 정의 네트워크 서비스를 소개하고 구성된 오버레이 네트워크 상에서 고속 데이터 평면 처리를 수행하는 서비스 게이트웨이의 하드웨어 및 소프트웨어 구조를 살펴본다. 또한, 멀티캐스트 응용 지원을 위한 서비스 오버레이 네트워크의 생성 과정을 예시한다. 국가과학기술연구망에 구축된 실험환경에서 서비스 게이트웨이의 성능 평가를 수행하고 수백 Mbps급 멀티미디어 서비스의 적용가능성을 확인한다. Overlay network is a ready-to-use solution to enable new network functionality with existing Internet connectivity intact. This paper introduces a network service which helps users easily compose their own service overlay networks through software-defined networks. We look into the structure of service gateway which enables 1 Gbps packet processing on composed overlay networks. We also provide examples for the way of composing service overlay for support multicast applications. Experiment results carried over the KREONET (Korea Research Environment Open NETwork) show the forwarding performance of the service gateway.

Traffic Trend Estimation for Profit Oriented Capacity Adaptation in Service Overlay Networks

Service Overlay Networks (SON) can offer end to end Quality of Service by leasing bandwidth from Internet Autonomous Systems. To maximize profit, the SON can continually adapt its leased bandwidth to traffic demand dynamics based on online traffic trend estimation. In this paper, we propose novel approaches for online traffic trend estimation that fits the SON capacity adaptation. In the first approach, the smoothing parameter of the exponential smoothing (ES) model is adapted to traffic trend. Here, the trend is estimated using measured connection arrival rate autocorrelation or cumulative distribution functions. The second approach applies Kalman filter whose model is built from historical traffic data. In this case, availability of the estimation error distribution allows for better control of the network Grade of Service. Numerical study shows that the proposed autocorrelation based ES approach gives the best combined estimation response-stability performance when compared to known ES methods. The proposed Kalman filter based approach improves further the capacity adaptation performance by limiting the increase of connection blocking when traffic level is increasing.

Predictable service overlay networks: Predictability through adaptive monitoring and efficient overlay construction and management

Providing bounded communication among participating nodes is significant for distributed systems. Internet-based applications suffer with lower performance due to absence of bounded latency. We describe PSON, an overlay network solution to this challenging problem. PSON has two components. The monitoring component, SyncProbe, utilizes efficient and adaptive monitoring techniques to measure latency, detect packet loss, and provide real-time estimates of maximum expected latency along paths of an Internet substrate. The QoSMap component constructs and manages overlay such that it yields application-level QoS and provides resilience against network failures. A distinctive feature of QoSMap is construction of QoS-compliant backup paths which facilitate in overlay management and operation during the period when primary overlay paths violate QoS. We evaluate PSON on PlanetLab to provide predictable communication for applications with different topology and QoS requirement. Our experiments confirm the effectiveness of PSON in providing an inexpensive and efficient application-layer solution to Internet’s unpredictable behavior.

Balanced Link Mapping in Multicast Service Overlay Networks Design

In order to address some deployment problems of IP multicast, the notion of Multicast Service Overlay Network (MSON) is proposed. How to construct MSON satisfying user’s demand efficiently under the situation of limited resources is a hot issue. In this paper we analyze a mathematics model of MSON construction. Under the objective of finding a virtual topology on top of physical network fulfilling all restrictions, and minimizing the cost of construction while keeping residual physical network the most balanced, an Integer Linear Programming model of the construction problem is depicted. In order to solve the problem efficiently, we propose a heuristics algorithm named BLMH. The efficiency of BLMH is evaluated by emulation experiment according to congestion link number under several scenarios.

Design and Performance Evaluation of Service Overlay Networks Topologies

Nowadays, Internet still lacks of adequate support for QoS-sensitive applications, such as VoIP, Videoconference, and Video-on-Demand. In a large extent, this is due to the fact that Internet was originally designed to provide only a best-effort packet delivery service. In recent years, Service Overlay Networks (SONs) have emerged as a profitable way to leverage these issues without changing the underlying infrastructure. In this paper, we address the topology design problem of a SON from a performance point of view. Since the analytical solution of the problem is too computationally complex, we compare the performance of some well-known topologies and we also propose a new traffic demand aware overlay topology. Through extensive simulations, we investigate the performance of each overlay topology in different network scenarios, taking into account overhead and accepted traffic between the overlay nodes.

Minimum cost service composition in service overlay networks

In service computing, it is often desirable to find the service composition solution for a given service composition request such that the total cost of the service composition solution is minimized. In this paper, we study the problem of finding the minimum cost service composition (MCSC) for a general service composition request which is represented by a directed acyclic graph (DAG). We first prove that the general case of the MCSC problem is NP-Hard. We then show that optimal solutions can be found in polynomial time for some special structured service composition requests. To this end, we derive a sufficient condition on the service composition request graph and propose corresponding algorithms to find the optimal solutions in polynomial time. Using such algorithms as building blocks, we propose heuristic algorithms to decompose the general service composition request graph into service composition request subgraphs with optimal structures. Simulation results demonstrate the effectiveness of the proposed heuristic algorithms.

Packet-switch mechanism based on QoS class mapping using flow label for overlay network

In the past few years, overlay networks have emerged as an alternative option for supporting value-added services such as fault tolerance, multicasting, and security. In this paper, we describe a quality of service (QoS) overlay network architecture for scalable, efficient and practical QoS support. In this architecture, we propose a flow label (FL)-based QoS class mapping method for QoS implementation, which can offer better scalability for applications and provide users with more refined QoS. Based on this method, a packet-switch mechanism using flow label is presented, depending on which, packets can be transmitted fast according to label, and more optimal paths can be chosen to guarantee the QoS requirement.

Very large-scale neighborhood search algorithms for the design of service overlay networks

Service Overlay Networks (SONs) allow virtual operators to create and deploy value-added Internet services with Quality of Service guarantees, while leaving the underlying network infrastructure unchanged. The deployment of a SON can be very expensive, and hence its planning requires careful decisions, including the overlay nodes’ placement and the capacity provisioning of the access links that connect the end-users to the SON infrastructure.In this work we first propose a novel Integer Linear Programming (ILP) model for the overlay network design problem which selects the optimal number and position of overlay nodes, the capacity reserved on each overlay link, as well as the optimal routing of the incoming traffic demands.Since such model can be solved to the optimum only for small network instances, we further propose an efficient and novel tabu search based heuristic for the planning of SONs that combines polynomial size and very large-scale neighborhoods. The very large-scale neighborhood of the solution given by tabu search is explored efficiently to obtain in a short time a new one that is both far from the current solution and cost-decreasing.We provide numerical results of the proposed heuristic on a set of realistic, large-size instances, including real ISP topologies, and discuss the effect of different parameters on the characteristics of the planned networks. Furthermore, we compare such results with the bound obtained solving our ILP model in small network scenarios. We show that in the considered network topologies the proposed heuristic performs very close to the optimum with a short computation time, thus providing a promising framework for the design of SONs.

Routing algorithms with constrained bandwidth in service overlay networks based on Kautz graphs

To realize QoS routing in Service Overlay Networks (SON),a fully distributed routing algorithm with constrained bandwidth,called Distributed Band Restricted Routing Algorithm (DBRRA),was presented in SON based on Kautz graphs.The algorithm used available network bandwidth,which reflected the network real-time characteristics,as routing metric.Each node maintained a part of link states in the network and routes with constrained bandwidth based on self-routing characteristics of Kautz graphs.This algorithm is of such advantages as lower computational complexity,lower additional load,strong adaptability and no loop.The simulation results show that the routing success ratio of DBRRA is close to the constrained bandwidth algorithm based on global link states.

Service overlay network capacity adaptation for profit maximization

The considered Service Overlay Networks (SON) lease bandwidth with Quality of Service (QoS) guarantees from a multitude of Internet Autonomous Systems, through service level agreements (SLA) with Internet Service Providers (ISP). This bandwidth is used to establish SON links and deliver end-to-end QoS for real time service connections. The leased bandwidth amount influences both the admitted traffic and network cost, affecting the network profit. This gives the network operator the opportunity to optimize the profit by adapting the network resources to changing traffic and SLA costs conditions. We propose a novel approach that maximizes the network profit based on traffic measurements and SLA cost changes. The approach uses an economic model that integrates the network routing policy with the adaptation of the SON link capacities. While performing the adaptation of leased bandwidth, the connection blocking constraints are also maintained. The proposed adaptive optimization approach is based on a reward maximizing routing policy derived from the Markov Decision Process theory although it can be applied to other routing policies. Analytical models as well as simulation of a measurement based implementation of the proposed models are used to evaluate the performance of the proposed approach.

Media-Oriented Service Composition with Service Overlay Networks: Challenges, Approaches and Future Trends (Invited Paper)

The massive and timely delivery of media is gradually integrating itself with the dynamic composition of media-oriented services so that new types of customized media services can be created according to the diverse de- mand of end users. The resulting effective and differentiated networking support will become one of the most important requirements of the network infrastructure in the future. In this survey paper, we first present the emerging trend on the interaction of media-oriented service composition and overlay-based networks by introducing related technical issues. Then, we describe the top-down and the bottom- up approaches that coordinate service mapping using the service overlay networks (SONs) and provisioning resources for them, respectively. Finally, we examine latest research on futuristic overlay networks for service realization.

Multi-channel live streaming in service overlay network

Service overlay network (SON) provides an effective means to deploy quality of service (QoS)-guaranteed live streaming over today's Internet. A major challenge in designing such a network is dealing with resource sharing among multiple channels. To achieve the best overall QoS in SON, we devise a new multi-channel live streaming scheme. First, we propose a multi-tree construction algorithm by infrastructure-based overlay multicast. The algorithm employs pre-allocated session degree constraints in overlay nodes to reserve resources for multiple channels, and constructs multiple trees by considering the total resource utilization of overlay nodes. Second, we propose a tree-aware queue scheduling algorithm to reduce the overlay processing delay in view of the entire overlay network. Scheduling priority is identified to trade off session priority with node location in different trees. From simulation and experimental results, the scheme achieves a differentiated control among different sessions, provides load balancing among overlay nodes, and improves the delay performance on SON.

Next Generation Service Delivery Platforms and Service Overlay Networks

Next Generation Service Delivery Platforms and Service Overlay Networks

Cooperative Resource Pricing in Service Overlay Networks for Mobile Agents

The success of peer-to-peer overlay networks depends on cooperation among participating peers. In this paper, we investigate the degree of cooperation among individual peers required to induce globally favorable properties in an overlay network. Specifically, we consider a resource pricing problem in a market-oriented overlay network where participating peers sell own resources (e.g., CPU cycles) to earn energy which represents some money or rewards in the network. In the resource pricing model presented in this paper, each peer sets the price for own resource based on the degree of cooperation; non-cooperative peers attempt to maximize their own energy gains, while cooperative peers maximize the sum of own and neighbors' energy gains. Simulation results are presented to demonstrate that the network topology is an important factor influencing the minimum degree of cooperation required to increase the network-wide global energy gain.

Self-Organization Based Network Architecture for New Generation Networks

A new generation network is requested to accommodate an enormous number of heterogeneous nodes and a wide variety of traffic and applications. To achieve higher scalability, adaptability, and robustness than ever before, in this paper we present new network architecture composed of self-organizing entities. The architecture consists of the physical network layer, service overlay network layer, and common network layer mediating them. All network entities, i.e. nodes and networks, behave in a self-organizing manner, where the global behavior emerges through their operation on local information and direct and/or indirect mutual interaction. The center of the architecture is so-called self-organization engines, which implement nonlinear self-organizing dynamics originating in biology, physics, and mathematics. In this paper, we also show some examples of self-organization engines.

Optimal design of Service Overlay Networks with economic and performance constraints

AbstractIn the last years, Service Overlay Networks (SONs) have emerged as a promising means to address some of the issues (e.g. end‐to‐end QoS) affecting the current Internet and to favor the development and deployment of new value‐added Internet services. The deployment of an SON is a capital‐intensive investment, since bandwidth with certain QoS guarantees must be purchased from the individual network domains through bilateral Service Level Agreements. Thus, minimizing the economic cost of the logical end‐to‐end service delivery infrastructure is one of the key objectives for the SON provider. When a SON is aimed at end‐to‐end QoS provisioning, its topology must be designed so as to also satisfy the specific requirements of QoS‐sensitive applications. This paper deals with the problem of planning the SON topology in order to take into account both cost and QoS constraints. More specifically, the paper proposes a set of new algorithms for the design of an optimized SON topology, which minimizes the economic cost while simultaneously meeting bandwidth and delay constraints. A performance comparison among such algorithms is finally carried out. Copyright © 2009 John Wiley & Sons, Ltd.

Distributed adaptive diverse routing for voice-over-IP in service overlay networks

This paper proposes a novel mechanism to discover delay-optimal diverse paths using distributed learning automata for Voice-over-IP (VoIP) routing in service overlay networks. In addition, a novel link failure detection method is proposed for detecting and recovering from link failures to reduce the number of dropped voice sessions. The main contributions of this paper are a decentralized, scalable method for minimizing delay on both a primary and secondary path between all pairs of overlay nodes, while at the same time maintaining the link disjointness between the primary and the secondary optimal paths. Simulations of a 50-node model of AT&T's backbone network show that the proposed method improves the quality of voice calls from unsatisfactory to satisfactory, as measured by the R-factor. With the proposed link failure detection mechanism, the time to recover from a link failure is considerably reduced.