Network virtualization has emerged as a solution for the Internet inability to address the required challenges caused by the lack of coordination among Internet service providers for the deployment of new services. The allocation of resources is one of the main problems in network virtualization, mainly in the mapping of virtual nodes and links to specific substrate nodes and paths, also known as the virtual network embedding problem. This paper proposes an algorithm based on optimization theory, to map the virtual links and nodes requiring a specific demand, looking for the maximization of the spare bandwidth and spare CPU in the substrate network, taking into account the CPU demanded by the hidden hops when a virtual link is mapped. The components of the virtual networks (nodes and links) that do not ask for an specific demand are then allocated following a fairness criteria ; Peer Reviewed ; Postprint (author’s final draft)


    Access

    Download


    Export, share and cite



    Optimal mapping of virtual networks considering reactive reconfiguration

    Tran, Phuong Nga / Casucci, Leonardo / Timm-Giel, Andreas | BASE | 2012

    Free access

    How Many Hops Are Needed in Multi-Hop Energy Harvesting Wireless Networks

    Liu, Xiangli / Li, Zan / Wang, Jianhuan | IEEE | 2017


    Engineering failure analysis and design optimisation with HiP-HOPS

    Papadopoulos, Yiannis / Walker, Martin / Parker, David et al. | Tema Archive | 2011



    Non-platooon inter-vehicle communication using multiple hops

    Michael, L.B. / Nakagawa, M. | Tema Archive | 1999