scholarly journals Heterogeneous Multipath Networks: Flow vs. Packet Based Routing in a Size-Aware Context

Author(s):  
Elie Bouttier ◽  
Riadh Dhaou ◽  
Fabrice Arnal ◽  
Cedric Baudoin ◽  
Emmanuel Dubois ◽  
...  
Keyword(s):  
Sensors ◽  
2021 ◽  
Vol 21 (23) ◽  
pp. 7862
Author(s):  
Sangun Park ◽  
Dong Eui Chang

Robot vision is an essential research field that enables machines to perform various tasks by classifying/detecting/segmenting objects as humans do. The classification accuracy of machine learning algorithms already exceeds that of a well-trained human, and the results are rather saturated. Hence, in recent years, many studies have been conducted in the direction of reducing the weight of the model and applying it to mobile devices. For this purpose, we propose a multipath lightweight deep network using randomly selected dilated convolutions. The proposed network consists of two sets of multipath networks (minimum 2, maximum 8), where the output feature maps of one path are concatenated with the input feature maps of the other path so that the features are reusable and abundant. We also replace the 3×3 standard convolution of each path with a randomly selected dilated convolution, which has the effect of increasing the receptive field. The proposed network lowers the number of floating point operations (FLOPs) and parameters by more than 50% and the classification error by 0.8% as compared to the state-of-the-art. We show that the proposed network is efficient.


2007 ◽  
Vol 9 (6) ◽  
pp. 1227-1240 ◽  
Author(s):  
D. Jurca ◽  
P. Frossard

Author(s):  
Scott Pudlewski ◽  
Brooke Shrader ◽  
Laura Herrera ◽  
Nathaniel M. Jones ◽  
Andrew P. Worthen

Author(s):  
Shiyong Li ◽  
Wei Sun ◽  
Yaming Zhang ◽  
Hongke Zhang

This paper considers optimal rate control and routing schemes for multipath networks which can be formulated as multipath network utility maximization problems. In these schemes, maximizing the aggregated user utility over the network with multipath routes under the link capacity constraints is the objective of utility maximization problems. By adopting the Lagrangian method, sub-problems for users and paths are deduced and interpreted from an economic point of view. In order to obtain the optimal rate allocation, a novel distributed primal-dual algorithm is proposed, and the performance is evaluated through simulations under two different fairness concepts. Moreover, window-based flow control scheme is also presented since it is more convenient to realize in practical end-to-end implementation than the rate control scheme.


Sign in / Sign up

Export Citation Format

Share Document