The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Emerging Information-Centric Networking (ICN) architectures seek to optimally utilize both bandwidth and storage for efficient content distribution over the network. The Virtual Interest Packet (VIP) framework has been proposed to enable joint design of forwarding, caching, and congestion control strategies within the Named Data Networking (NDN) architecture. While the existing VIP algorithms exhibit...
Gearbox fault signal has non-stationary and non-linear features, conventional spectral analysis methods all have their own limitations. This paper presents the method of combining empirical mode decomposition (EMD) and cepstrum analysis, and develops a gearbox fault detection system based on LABVIEW. Practical tests show that each signal could be decomposed into a number of intrinsic mode functions(IMFS)...
For general multi-hop queueing networks, delay optimal network control has unfortunately been an outstanding problem. The dynamic backpressure (BP) algorithm elegantly achieves throughput optimality, but does not yield good delay performance in general. In this paper, we obtain an asymptotically delay optimal control policy, which resembles the BP algorithm in basing resource allocation and routing...
In this paper we introduce an extension of the vehicle routing problem with time windows (VRPTW) called the Load-dependent Capacitated Vehicle Routing Problem with Time Windows (LDVRPTW). This problem differs from the classical VRP and VRPTW on the transportation costs, which are calculated not only on the travel distance, but also the loads on the arcs. We propose a metaheuristic to address this...
Emerging information-centric networking architectures seek to optimally utilize both bandwidth and storage for efficient content distribution. This highlights the need for joint design of traffic engineering and caching strategies. We present a systematic framework for joint dynamic interest request forwarding and dynamic cache placement and eviction, within the context of the Named Data Networking...
The home health care crew scheduling and routing problem with stochastic service times is studied in this paper. A stochastic programming model with recourse is constructed to describe the problem. The approximate formulation for the expected penalty for late arrival at a customer is obtained and analyzed. According to its features, the problem is transformed into a classical set partitioning problem...
The open capacitated arc routing problem (OCARP) is defined and considered in this paper. The OCARP differs from the classic capacitated arc routing problem (CARP) because the vehicles are not required to return to the depot. The OCARP seeks to find a set of minimum cost open routes that serve task arcs of a given graph, subject to vehicle capacity and travel distance span restrictions. A mathematical...
In this paper, the Location-Arc Routing Problem (LARP), a relatively new problem with less research in the past, is surveyed. First, we discuss the relationships and differences between the LARP and the Location-Allocation Problem (LAP), the Capacitated Arc Routing Problem (CARP) and the Location-Routing Problem (LRP). Second, both exact and heuristic algorithms are investigated. Finally, some future...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.