http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
Qingguo Jiang,Wei Shen,Chao Wang 보안공학연구지원센터 2016 International Journal of Smart Home Vol.10 No.5
The time dependent vehicle routing problem (TDVRP) is defined as a vehicle fleet of fixed capacities serves customers of fixed demands from a central depot with consideration of road networks conditions. The travel time between two customers or between customer and the depot depends on the distance of the two points and time of a day. A mathematical model is formulated for the TDVRP problem and a simulated annealing (SA) based improvement method is proposed for solving it. The main objective is to minimize the number of vehicles and the second objective is to minimize the total travel distance of the vehicles. The proposed approach was tested on the 56 test problems with 100 customers from Figliozzi’s benchmark, and results show that the improvement metaheuristic could get better solutions than Figliozzi’s algorithm in the different time dependent speeds function within an accepted computational time.
Congestion Aware Fast Link Failure Recovery of SDN Network Based on Source Routing
( Liaoruo Huang ),( Qingguo Shen ),( Wenjuan Shao ) 한국인터넷정보학회 2017 KSII Transactions on Internet and Information Syst Vol.11 No.11
The separation of control plane and data plane in Software Defined Network (SDN) makes it flexible to control the network behavior, while also causes some inconveniences to the link failure recovery due to the delay between fail point and the controller. To avoid delay and packet loss, pre-defined backup paths are used to reroute the disrupted flows when failure occurs. However, it may introduce large overhead to build and maintain these backup paths and is hard to dynamically construct backup paths according to the network status so as to avoid congestion during rerouting process. In order to realize congestion aware fast link failure recovery, this paper proposes a novel method which installs multi backup paths for every link via source routing and per-hop-tags and spread flows into different paths at fail point to avoid congestion. We carry out experiments and simulations to evaluate the performance of the method and the results demonstrate that our method can achieve congestion aware fast link failure recovery in SDN with a very low overhead.