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.
Computing frameworks have been widely deployed to support global-scale services. A job typically has multiple sequential stages, where each stage is further divided into multiple parallel tasks. We call the set of all the tasks in a stage of a job a cotask. In this paper, we aim to minimize the average Cotask Completion Time (CCT) in cotask scheduling. To the best of our knowledge, there is no prior...
This research considering one working partition of order picking system as the research object, studies order batching problem and builds order batching model of fixed maximum order number. To solve the order batching model, the storage location similarity coefficient is token as clustering index, at the same time clustering algorithm is designed. This paper explores the application analysis of the...
We study a fundamental problem of how to schedule complex workflows in the cloud for applications such as data analytics. One of the main challenges is that such workflow scheduling problems involve many constraints, requirements and varied objectives and it is extremely difficult to find high-quality solutions. To meet the challenge, we explore using mixed integer programming (MIP) to formulate and...
The current inter-domain routing protocol, namely, the Border Gateway Protocol (BGP), cannot provide end-to-end (E2E) quality-of-service (QoS) guarantees. The main reason is that an autonomous system (AS) can only receive guarantees from its first hop ASes via service level agreements (SLAs). But beyond the first hop, QoS along the path from source to destination AS is not within the source AS's control...
Longest Prefix Match (LPM) is a basic and important function for current network devices. Hash-based approaches appear to be excellent candidate solutions for LPM with the capability of fast lookup speed and low latency. The number of hash table probes, i.e. the search path of a hash-based LPM algorithm, directly determines the lookup performance. In this paper, we propose Ω-LPM to improve the lookup...
The built-in caching capability of future Named Data Networking (NDN) promises to enable effective content distribution at a global scale without requiring special infrastructure. The aim of this work is to design efficient caching schemes in NDN to achieve better performance at both the network layer and application layer. With the specific objective of minimizing the inter-ISP (Internet Service...
In this paper, we investigate the issue of minimizing data center energy usage. In particular, we formulate a problem of virtual machine placement with the objective of minimizing the total power consumption of all the servers. To do this, we examine a CPU power consumption model and then incorporate the model into an mixed integer programming formulation. In order to find optimal or near-optimal...
In this paper, a mmWave unified access and back-haul (UAB) network is presented, where both radio access (RA) and backhaul (BH) share the same millimeter wave bands. Considering uniform resource allocation of RA and BH radio resource for all pico stations, which can well mitigate the interference among pico stations, the capacity of UAB is mainly influenced by the allocated resource ratio between...
Recent studies on queue-length-based randomized link scheduling algorithms have shown their throughput-optimality. But simulation results indicate that the packet delay in such algorithms can be quite large, even when the traffic intensity is low compared with the network capacity. The reason can be traced to the fact that these algorithms need the queues to be sufficiently large before the links...
By understanding the process of threat assessment, the evaluation parameters, which affect threat level, have been analyzed comprehensively. Then the threat assessment of the Bayesian network model has been established. The dynamic Bayesian network reasoning method is used to estimate threat so that the objective factors and individual characteristics of different time slices of the same characteristics...
In this paper, an improved Discrete Particle Swarm Optimization (DPSO) algorithm is proposed to solve the uneven clustering problem, a difficult problem in Wireless Sensor Networks (WSNs) area. An uneven clustering result leads to severe energy imbalance in WSNs, which shortens the life time of networks. This paper presents a strategy to obtain good clustering result by directly using an improved...
This paper proposes a hybrid feature selection algorithm based on dynamic weighted ant colony algorithm. Features are treated as graph nodes to construct graph model. Ant colony algorithm is used to select features while support vector machine classifier is applied to evaluate the performance of feature subsets, and then feature pheromone is computed and updated based on the evaluation results. At...
Slotted ALOHA anti-collision methods have two features. The first feature is that we get the optimal throughput of slotted ALOHA increased if the number of tags and the number of slots are equal. The second feature is that if the number of tags is small and the frame size is equal to the number of tags, the throughput increases as the number of tags decreases. However, most researchers have made little...
Dijkstra algorithm has been applied widely in calculating the shortest repaired path of distribution network, however, the running time of which will increase drastically with the added number of the node. An improved Dijkstra algorithm based on the heapsort method of the complete binary tree is proposed, in which the operation on the priority queue is implemented by using the complete binary tree...
Controlled-flooding algorithms are widely used in unstructured networks. Expanding ring (ER) achieves low response delay, while its traffic cost is huge; dynamic querying (DQ) is known for its desirable behavior in traffic control, but it achieves lower search cost at the price of an undesirable latency performance; Enhanced dynamic querying (DQ+) can reduce the search latency too, while it is hard...
In this paper, a novel strategy for data transmission that is based on prediction revision dynamic adjustment data gathering algorithm (PRDA) is proposed in WSNs. The key idea of the PRDA is to separate the data prediction and model computing, and the autoregressive process model is employed for prediction revision algorithm. The model computing of PRDA is conducted by sink node firstly according...
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.