JISE


  [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [14]


Journal of Information Science and Engineering, Vol. 40 No. 1, pp. 165-176


Adaptive Model for the Placement of Network Services


BRAJESH KUMAR UMRAO1,+, MAHENDRA PRATAP YADAV2
AND DHARMENDRA KUMAR YADAV3
1,3Department of Computer Science and Engineering
MNNIT Allahabad, Prayagraj, 211004 India

2Department of Computer Science and Engineering
IIIT Pune, Maharashtra, 411041 India
E-mail: brajeshumrao84@gmail.com
+; mahendra@iiitp.ac.in; dky@mnnit.ac.in


The popularity of Network Function Virtualization (NFV) increases due to offering flexible and efficient methods for placing the chains of Virtual Network Functions (VNFs). The majority of recent studies consider consistent (immutable) bandwidth and flow pro-cessing while implementing the NFV-enabled network. The considering the consistent flow processing and bandwidth requirement become crucial in NFV-enabled network, where the network behaviour is highly dynamic. Due to the regular fluctuation in network traffic, the bandwidth demand, flow processing requirements, and the available Point-of-Presence (PoP) in the network change continuously. This article presents an adaptive model for the placement of VNF chains in order to mitigate the limitations mentioned above. The objective of re-arranging the prior placement of service chain is to maintain the performance of flow processing despite the variation in flow processing and resource requirements. Meanwhile, the proposed adaptive model minimizes the number of changes (i.e., re-allocation of VNFs) in the network. The simulation results show that the proposed model delivers the network services without abruption. Moreover, it also maintains the performance of flow processing and minimizes the 12% to 25% modifications in the pre-viously placed VNFs.


Keywords: NFV, VNF, bandwidth demand, flow processing, Point-of-Presence, adaptive, placement, flow

  Retrieve PDF document (JISE_202401_11.pdf)