In-Network Dynamic Pathlet Switching with VIRO for SDN Networks

Author(s):  
Braulio Dumba ◽  
Hesham Mekky ◽  
Guobao Sun ◽  
Zhi-Li Zhang
Keyword(s):  
IEEE Access ◽  
2021 ◽  
pp. 1-1
Author(s):  
Yuhong Wang ◽  
Xu Zhou ◽  
Hong Zhou ◽  
Lei Chen ◽  
Zongsheng Zheng ◽  
...  

2017 ◽  
Vol 117 (9) ◽  
pp. 1866-1889 ◽  
Author(s):  
Vahid Shokri Kahi ◽  
Saeed Yousefi ◽  
Hadi Shabanpour ◽  
Reza Farzipoor Saen

Purpose The purpose of this paper is to develop a novel network and dynamic data envelopment analysis (DEA) model for evaluating sustainability of supply chains. In the proposed model, all links can be considered in calculation of efficiency score. Design/methodology/approach A dynamic DEA model to evaluate sustainable supply chains in which networks have series structure is proposed. Nature of free links is defined and subsequently applied in calculating relative efficiency of supply chains. An additive network DEA model is developed to evaluate sustainability of supply chains in several periods. A case study demonstrates applicability of proposed approach. Findings This paper assists managers to identify inefficient supply chains and take proper remedial actions for performance optimization. Besides, overall efficiency scores of supply chains have less fluctuation. By utilizing the proposed model and determining dual-role factors, managers can plan their supply chains properly and more accurately. Research limitations/implications In real world, managers face with big data. Therefore, we need to develop an approach to deal with big data. Practical implications The proposed model offers useful managerial implications along with means for managers to monitor and measure efficiency of their production processes. The proposed model can be applied in real world problems in which decision makers are faced with multi-stage processes such as supply chains, production systems, etc. Originality/value For the first time, the authors present additive model of network-dynamic DEA. For the first time, the authors outline the links in a way that carry-overs of networks are connected in different periods and not in different stages.


2014 ◽  
Vol 22 (3) ◽  
pp. 361-403 ◽  
Author(s):  
F. V. C. Martins ◽  
E. G. Carrano ◽  
E. F. Wanner ◽  
R. H. C. Takahashi ◽  
G. R. Mateus ◽  
...  

Recent works raised the hypothesis that the assignment of a geometry to the decision variable space of a combinatorial problem could be useful both for providing meaningful descriptions of the fitness landscape and for supporting the systematic construction of evolutionary operators (the geometric operators) that make a consistent usage of the space geometric properties in the search for problem optima. This paper introduces some new geometric operators that constitute the realization of searches along the combinatorial space versions of the geometric entities descent directions and subspaces. The new geometric operators are stated in the specific context of the wireless sensor network dynamic coverage and connectivity problem (WSN-DCCP). A genetic algorithm (GA) is developed for the WSN-DCCP using the proposed operators, being compared with a formulation based on integer linear programming (ILP) which is solved with exact methods. That ILP formulation adopts a proxy objective function based on the minimization of energy consumption in the network, in order to approximate the objective of network lifetime maximization, and a greedy approach for dealing with the system's dynamics. To the authors’ knowledge, the proposed GA is the first algorithm to outperform the lifetime of networks as synthesized by the ILP formulation, also running in much smaller computational times for large instances.


2018 ◽  
Vol 25 (4) ◽  
pp. 919-935 ◽  
Author(s):  
Deng-hua Zhong ◽  
Han Wu ◽  
Bin-ping Wu ◽  
Yi-chi Zhang ◽  
Pan Yue

Author(s):  
Yinglian Zhou ◽  
Jifeng Chen

Driven by experience and social impact of the new life, user preferences continue to change over time. In order to make up for the shortcomings of existing geographic social network models that often cannot obtain user dynamic preferences, a time-series geographic social network model was constructed to detect user dynamic preferences, a dynamic preference value model was built for user dynamic preference evaluation, and a dynamic preferences group query (DPG) was proposed in this paper . In order to optimize the efficiency of the DPG query algorithm, the UTC-tree index user timing check-in record is designed. UTC-tree avoids traversing all user check-in records in the query, accelerating user dynamic preference evaluation. Finally, the DPG query algorithm is used to implement a well-interacted DPG query system. Through a large number of comparative experiments, the validity of UTC-tree and the scalability of DPG query are verified.


Sign in / Sign up

Export Citation Format

Share Document