A novel dynamic programming inspired algorithm for embedding of virtual networks in future networks

2020 ◽  
Vol 179 ◽  
pp. 107349 ◽  
Author(s):  
Godfrey Kibalya ◽  
Joan Serrat ◽  
Juan-Luis Gorricho ◽  
Haipeng Yao ◽  
Peiying Zhang
Keyword(s):  
Dynamic Programming ◽  
Virtual Networks ◽  
Future Networks

Spontaneous Virtual Networks: On the Road Towards the Internet´s Next GenerationSpontane Virtuelle Netze: Auf dem Weg zur nächsten Generation des Internets

2009 ◽  
Vol 50 (6) ◽  
Author(s):  
Oliver P. Waldhorst ◽  
Christian Blankenhorn ◽  
Dirk Haage ◽  
Ralph Holz ◽  
Gerald G Koch ◽  
...  
Keyword(s):  
Heterogeneous Environments ◽  
Virtual Networks ◽  
Online Game ◽  
Internet Applications ◽  
Next Generation Internet ◽  
The Road ◽  
Future Networks ◽  
Seamless Transition ◽  
On The Road ◽  
Application Requirements

AbstractNovel Internet applications demand global availability of complex services that can adapt dynamically to application requirements. At the same time, pervasive Internet usage and heterogeneous access technologies impose new challenges for service deployment. We present Spontaneous Virtual Networks (SpoVNet), a methodology that enables easy development of new services with transparent support for mobility, multi-homing, and heterogeneous environments. This article presents the overlay-based architecture of SpoVNet that supports the spontaneous deployment of new services as well as a seamless transition towards future networks. SpoVNet´s architecture offers support for the underlay aware adaptation of overlays by the use of cross-layer information. In the context of two exemplary services like a group communication service and an event service as well as two demanding applications – a realtime online game and a video streaming application – we illustrate how SpoVNet is of value in establishing services and applications for the Next Generation Internet.

Internet of Things, future networks, and the economics of virtual networks

2017 ◽  
Vol 18 (3-4) ◽  
pp. 240-255 ◽  
Author(s):  
Günter Knieps
Keyword(s):  
Internet Of Things ◽  
Intelligent Transportation Systems ◽  
Smart Grids ◽  
Transmission Control Protocol ◽  
Smart Cities ◽  
Transportation Systems ◽  
Information And Communications Technology ◽  
Virtual Networks ◽  
Qos Differentiation ◽  
Future Networks

The Internet of Things (IoT) gains momentum. Developments regarding smart grids, intelligent transportation systems, and low-power networks for smart cities constitute significant drivers in the evolution of network industries. IoT creates an array of new requirements for information and communications technology (ICT) data transmission: In addition to real-time and data geopositioning, new service characteristics result from the change of the traditional sender–receiver perspective of Transmission Control Protocol/Internet Protocol (TCP/IP) to content relevancy for many users (e.g. cloud computing) and dynamic changes of the state of devices. The future development and success of IoT hinges critically on the provision of heterogeneous quality of service (QoS) requirements which cannot be provided by best-effort TCP/IP Internet. It is thus not surprising that both in the US and the EU network neutrality regulations are currently being reconsidered. Alternative network logistics (virtual networks) dealing with heterogeneous QoS requirements of network traffic may require fundamental deviations from traditional Internet architectures. Corresponding logistics operating over joint physical infrastructures gain increasing attention under the heading of future networks (FNs). The goal of this article is to focus on the economic mechanisms of how the potentials of QoS differentiation in the context of FNs can be fully exploited and incentivized within innovative all-IP-based QoS traffic architectures.

scholarly journals Dynamic resource allocations in virtual networks through a knapsack problem's dynamic programming solution

2020 ◽  
Vol Volume 31 - 2019 - CARI 2018 ◽  
Author(s):  
Vianney Kengne Tchendji ◽  
Yannick Florian YANKAM
Keyword(s):  
Dynamic Programming ◽  
Knapsack Problem ◽  
Computer Network ◽  
Network Virtualization ◽  
Software Defined Networking ◽  
Virtual Networks ◽  
Network Resource ◽  
Problem Instances ◽  
Programmation Dynamique ◽  
The Right

International audience The high-value Internet services that have been significantly enhanced with the integration of network virtualization and Software Defined Networking (SDN) technology are increasingly attracting the attention of end-users and major computer network companies (Google, Amazon, Yahoo, Cisco, ...). In order to cope with this high demand, network resource providers (bandwidth, storage space, throughput, etc.) must implement the right models to understand and hold the users' needs while maximizing profits reaped or the number of satisfied requests into the virtual networks. This need is even more urgent that users' requests can be linked, thereby imposing to the InP some constraints concerning the mutual satisfaction of requests, which further complicates the problem. From this perspective, we show that the problem of resource allocation to users based on their requests is a knapsack problem and can therefore be solved efficiently by using the best dynamic programming solutions for the knapsack problem. Our contribution takes the dynamic resources allocation as a multiple knapsack's problem instances on variable value requests. La multitude des services à forte valeur ajoutée offert par Internet et améliorés considérablement avec l'intégration de la virtualisation réseau et de la technologie des réseaux définis par logiciels (Software Defined Networking), suscite de plus en plus l'attention des utilisateurs finaux et des grands acteurs des réseaux informatiques (Google, Amazon, Yahoo, Cisco, ...); ainsi, pour faire face à cette forte demande, les fournisseurs de ressources réseau (bande passante, espace de stockage, débit, ...) doivent mettre en place les bons modèles permettant de bien prendre en main les besoins des utilisateurs tout en maximisant les profits engrangés ou le nombre de requêtes satis-faites dans les réseaux virtuels. Ce besoin est d'autant plus urgent que les requêtes des utilisateurs peuvent être interdépendantes, imposant de ce fait au FIP des contraintes de satisfaction mutuelle des requêtes, ce qui complexifie encore plus le problème. Dans cette optique, nous montrons que le problème d'allocation des ressources aux utilisateurs en fonction de leurs requêtes, se ramène à un problème de sac à dos et peut par conséquent être résolu de façon efficiente en exploitant les meilleures solutions de programmation dynamique pour le problème de sac à dos. Notre contribution considère l'allocation dynamique des ressources comme une application de plusieurs instances du problème de sac à dos sur des requêtes à valeurs variables.

Sign in / Sign up

Export Citation Format

Share Document