3 April 2013 in Journal of Applied Computing Research
Increasingly popular, Internet applications for multimedia broadcasting require multipoint communication, in order to reduce network traffic rates. However, the widespread adoption of traditional multicast protocols is still held back by the current Internet structure, where the responsibility for management of multicast groups is distributed among network devices. By using distributed algorithms, such protocols generate delays in processing control groups events. In this paper we propose a clean-slate approach for multimedia multicasting, where the end to end calculation of the best route is performed to decrease delays in group configuration. The prototype developed implements this approach using OpenFlow technology. Results obtained through experimentation show a performance gain in relation to traditional IP multicasting.Key words: Multicast, SDN, OpenFlow.
17 March 2022 in IEEE Transactions on Network and Service Management
This work proposes to solve the maximal covering location problem of the Mobile Operations Coordination Center (CCOp Mv), which aims to support the operational command of the Brazilian Army. This problem consists of selecting, in a limited region and with poor communication infrastructure to the ground troops’s operating area, the positions of vehicles equipped with Base Transceiver Station (BTS), the amount needed, and theirs transmission power to be set that maximizes the coverage area and reduce the interference due to the overlap of signals. For this reason, analytical modeling based on the mixed-integer linear problem was proposed that guided two optimization solutions: (i) E-ALLOCATOR – Exact ALLOCATiOn seRvice; and (ii) M-ALLOCATOR – Metaheuristic ALLOCATiOn seRvice. The solutions were evaluated in a scenario that employs CCOp Mv to support a rescue operation based on the tragedy in January 2019 in Brumadinho-MG and compared with a heuristic. The performance evaluation results show evidence of efficiencies in terms of quality and resource savings of the proposed solutions. Furthermore, E-ALLOCATOR has been proven to be suitable for a low workload on the network. At the same time, M-ALLOCATOR is suitable for scenarios with a high workload providing almost optimal solutions within the adequate computational time for all problem instances.