| Full text | |
| Author(s): |
dos Santos, Giovanne Marcelo
;
Batista, Daniel Macedo
;
Velazquez, R
Total Authors: 3
|
| Document type: | Journal article |
| Source: | 2020 IEEE LATIN-AMERICAN CONFERENCE ON COMMUNICATIONS (LATINCOM 2020); v. N/A, p. 5-pg., 2020-01-01. |
| Abstract | |
Virtual Network Functions (VNFs) can be combined together to meet several network services with reduced capital and operational expenditures. Given that the VNFs are virtualized, a network operator needs to solve two problems to efficiently deploy them: VNF placement and VNF scheduling. In this paper, we propose an algorithm to solve the two problems at the same time, placing and scheduling the VNFs on demand, and taking the software requirements into consideration, in a way that traditional distributed computing schedulers can be used. The proposed algorithm was evaluated via simulation against three other schedulers. Results showed that the algorithm is able to increase, by 19.7%, the number of completed VNFs in a scenario with 16540 VNFs being instantiated. (AU) | |
| FAPESP's process: | 15/24485-9 - Future internet for smart cities |
| Grantee: | Fabio Kon |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 14/50937-1 - INCT 2014: on the Internet of the Future |
| Grantee: | Fabio Kon |
| Support Opportunities: | Research Projects - Thematic Grants |
| FAPESP's process: | 18/22979-2 - IoT-SED: security and efficiency in data transport on Internet of Things |
| Grantee: | Daniel Macêdo Batista |
| Support Opportunities: | Regular Research Grants |