1,959 research outputs found
Scalable and Cost Efficient Algorithms for Virtual CDN Migration
Virtual Content Delivery Network (vCDN) migration is necessary to optimize
the use of resources and improve the performance of the overall SDN/NFV-based
CDN function in terms of network operator cost reduction and high streaming
quality. It requires intelligent and enticed joint SDN/NFV migration algorithms
due to the evident huge amount of traffic to be delivered to end customers of
the network. In this paper, two approaches for finding the optimal and near
optimal path placement(s) and vCDN migration(s) are proposed (OPAC and HPAC).
Moreover, several scenarios are considered to quantify the OPAC and HPAC
behaviors and to compare their efficiency in terms of migration cost, migration
time, vCDN replication number, and other cost factors. Then, they are
implemented and evaluated under different network scales. Finally, the proposed
algorithms are integrated in an SDN/NFV framework. Index Terms: vCDN; SDN/NFV
Optimization; Migration Algorithms; Scalability Algorithms.Comment: 9 pages, 11 figures, 4 tableaux, conference Local Computer Networks
(LCN), class
Recommended from our members
Multimedia delivery in the future internet
The term “Networked Media” implies that all kinds of media including text, image, 3D graphics, audio
and video are produced, distributed, shared, managed and consumed on-line through various networks,
like the Internet, Fiber, WiFi, WiMAX, GPRS, 3G and so on, in a convergent manner [1]. This white
paper is the contribution of the Media Delivery Platform (MDP) cluster and aims to cover the Networked
challenges of the Networked Media in the transition to the Future of the Internet.
Internet has evolved and changed the way we work and live. End users of the Internet have been confronted
with a bewildering range of media, services and applications and of technological innovations concerning
media formats, wireless networks, terminal types and capabilities. And there is little evidence that the pace
of this innovation is slowing. Today, over one billion of users access the Internet on regular basis, more
than 100 million users have downloaded at least one (multi)media file and over 47 millions of them do so
regularly, searching in more than 160 Exabytes1 of content. In the near future these numbers are expected
to exponentially rise. It is expected that the Internet content will be increased by at least a factor of 6, rising
to more than 990 Exabytes before 2012, fuelled mainly by the users themselves. Moreover, it is envisaged
that in a near- to mid-term future, the Internet will provide the means to share and distribute (new)
multimedia content and services with superior quality and striking flexibility, in a trusted and personalized
way, improving citizens’ quality of life, working conditions, edutainment and safety.
In this evolving environment, new transport protocols, new multimedia encoding schemes, cross-layer inthe
network adaptation, machine-to-machine communication (including RFIDs), rich 3D content as well as
community networks and the use of peer-to-peer (P2P) overlays are expected to generate new models of
interaction and cooperation, and be able to support enhanced perceived quality-of-experience (PQoE) and
innovative applications “on the move”, like virtual collaboration environments, personalised services/
media, virtual sport groups, on-line gaming, edutainment. In this context, the interaction with content
combined with interactive/multimedia search capabilities across distributed repositories, opportunistic P2P
networks and the dynamic adaptation to the characteristics of diverse mobile terminals are expected to
contribute towards such a vision.
Based on work that has taken place in a number of EC co-funded projects, in Framework Program 6 (FP6)
and Framework Program 7 (FP7), a group of experts and technology visionaries have voluntarily
contributed in this white paper aiming to describe the status, the state-of-the art, the challenges and the way
ahead in the area of Content Aware media delivery platforms
Content-aware resource allocation model for IPTV delivery networks
Nowadays, with the evolution of digital video broadcasting, as well as, the advent of high speed broadband networks, a new era of TV services has emerged known as IPTV. IPTV is a system that employs the high speed broadband networks to deliver TV services to the subscribers. From the service provider viewpoint, the challenge in IPTV systems is how to build delivery networks that exploits the resources efficiently and reduces the service cost, as well. However, designing such delivery networks affected by many factors including choosing the suitable network architecture, load balancing, resources waste, and cost reduction. Furthermore, IPTV contents characteristics, particularly; size, popularity, and interactivity play an important role in balancing the load and avoiding the resources waste for delivery networks. In this paper, we investigate the problem of resource allocation for IPTV delivery networks over the recent architecture, peer-service area architecture. The Genetic Algorithm as an optimization tool has been used to find the optimal provisioning parameters including storage, bandwidth, and CPU consumption. The experiments have been conducted on two data sets with different popularity distributions. The experiments have been conducted on two popularity distributions. The experimental results showed the impact of content status on the resource allocation process
A Scalable Approach for Service Chain (SC) Mapping with Multiple SC Instances in a Wide-Area Network
Network Function Virtualization (NFV) aims to simplify deployment of network
services by running Virtual Network Functions (VNFs) on commercial
off-the-shelf servers. Service deployment involves placement of VNFs and
in-sequence routing of traffic flows through VNFs comprising a Service Chain
(SC). The joint VNF placement and traffic routing is called SC mapping. In a
Wide-Area Network (WAN), a situation may arise where several traffic flows,
generated by many distributed node pairs, require the same SC; then, a single
instance (or occurrence) of that SC might not be enough. SC mapping with
multiple SC instances for the same SC turns out to be a very complex problem,
since the sequential traversal of VNFs has to be maintained while accounting
for traffic flows in various directions. Our study is the first to deal with
the problem of SC mapping with multiple SC instances to minimize network
resource consumption. We first propose an Integer Linear Program (ILP) to solve
this problem. Since ILP does not scale to large networks, we develop a
column-generation-based ILP (CG-ILP) model. However, we find that exact
mathematical modeling of the problem results in quadratic constraints in our
CG-ILP. The quadratic constraints are made linear but even the scalability of
CG-ILP is limited. Hence, we also propose a two-phase column-generation-based
approach to get results over large network topologies within reasonable
computational times. Using such an approach, we observe that an appropriate
choice of only a small set of SC instances can lead to a solution very close to
the minimum bandwidth consumption. Further, this approach also helps us to
analyze the effects of number of VNF replicas and number of NFV nodes on
bandwidth consumption when deploying these minimum number of SC instances.Comment: arXiv admin note: substantial text overlap with arXiv:1704.0671
- …