Existing static grid resource scheduling algorithms, which are limited to minimizing the makespan, cannot meet needs of required by cloud computing. Current infrastructure solutions provide operational support at level only. When hardware resources form virtual pool, machines deployed for use transparently. Considering competing characteristics multi-tenant environments in computing, this paper proposes a allocation model based on an imperfect information Stackelberg game (CSAM-IISG) using...

Nowadays, the most popular way of data storage is distributed and widespread cloud platform HDFS. It successfully used by many notable companies since its excellent capability. Unfortunately, original design HDFS was to handle large files, when dealing with enormous quantity small situation not very optimistic. To solve this problem, an optimized algorithm introduced, it considers size files merging into combine file, generates map record for each file. Meanwhile, we apply prefetching...

To reduce the data redundancy and energy consumption caused by explosive growth of in wireless sensor networks, this paper presents a node image based mean filtering algorithm. In provided approach, nodes are divided into active de-active to eliminate sleep redundancy. The network clustered, obtained from modeled. Simulation results show that proposed algorithm is more effective than k-medoids, which can redundant data. Moreover, it reduces consumption, improves life cycle networks. DOI:...

This paper focuses on the modification and improvement of Ad hoc On-demand Multipath Distance Vector (AOMDV) in Mobile NETwork (MANET). An improved algorithm is proposed, aiming to maximize benefit multipath achieve better performance metrics both packet loss ratio average delay. The main contributions are: (1) Factors that could cause delay MANET are analysed; (2) algorithm: routing with Backup route Update (AOMDV-BU) basic idea demonstrated; (3) Several groups NS-2 simulations 40 nodes...

Since the sensor node’s distribution in a wireless network (WSN) is irregular, geographic routing protocols using greedy algorithm can cause local minima problem. This problem may fail due to voids and lead failure of data transmission. Based on virtual coordinate mapping, this paper proposes an efficient bypassing void protocol solve control packet overhead transmission delay WSN, which called EBVRPVCM. The basic idea transfer random structure edge regular one through mapping coordinates...

Aiming at the problem that node energy is limited, network cycle short and throughput low in wireless sensor network, Dynamic Routing Protocol Based on Clustering was proposed known as KACO (K-means Ant Colony Optimal). At beginning it employs ant colony optimal k-means algorithm to form cluster, novel method which consider ratio, location distance used select cluster head. In transmission phase, dynamic hybrid routing adopted create shortest path between nodes reducing consumption...

Active Queue Management (AQM) algorithm, as a typical router based congestion control strategy, has been the focus of researchers in past few years and widely used control. There are drawbacks such large queuing delay queue jitter, which cause data retention drop oscillation. It means that existing AQM algorithms under high bandwidth can not meet Quality Service (QoS) requirements. This paper presents new algorithm on traditional BLUE M/M/1/N model is called QBLUE. Empirical simulations with...

The complex interactions inherent in mobile, dynamic systems require a representative model of node movement properties. Dynamic proposed within industry, particularly the military domain, have requirement for dependable communication and include heterogeneous nodes (varying from personal devices, to aircraft with sensors). Existing mobility models been found not be adequate capturing properties these due their tendency focus on single type, or characteristic. In this paper, Multi-Class...

This paper presents a heuristic packet loss approach based on Adaptive Random Early Detection (ARED) mechanism to maintain the instantaneous queue length in buffer and estimate dropping probability. The proposed scheme named as Hazard rate Heuristic ARED (HHA) by utilizing hazard function of Weibull distribution ARED. NS2 is used implement simulation. Statistical evaluation performed show correctness effectiveness simulation results. obtained results demonstrate that HHA has best performance...

The traditional adaptive Random Early Detection (RED) algorithm allows network to achieve high throughput and low average delay. However it uses a linear dropping probability function, which causes jitter in the core router. To overcome drawbacks of queue RED algorithm, this paper proposes new Non-Linear Adaptive (NLAR) approach based on Active Queue Management (AQM) scheme, provides non-linear adaptation function RED. NLAR enables gradient vary along with deviation that is between length...

The constraint conditions and life time issue is analyzed through network optimization model. In this paper, the distribution of cluster head uniform, nodes in employ 1-hop to communicate with head, heads use multi-hop minimum energy transmit data sink node. An independent routing (EICR) put forward overcome drawbacks LEACH. proposed algorithm, node higher ratio remaining has priority be head. Numerical simulation results show that obtained approach can enable same energy, balance node's...

Image inpainting benefits much from the future Internet, but memory and computational cost in encoding image features deep learning methods poses great challenges to this field. In paper, we propose a parallel decoding structure based on GANs for inpainting, which comprises single network network. By adding diet extended-decoder path semantic (Diet-PEPSI) unit encoder network, can employ new rate-adaptive dilated convolutional layer share weights dynamically generate feature maps by given...

This paper proposes a novel internal structure of the Adaptive Random Early Detection (ARED) algorithm through time-domain analysis using classical control theory, which is based on Active Queue Management (AQM) scheme. A new discrete-time controller has been developed 2nd order difference equation and embedded it into AQM algorithm. The experiments are conducted NS-2 simulation platform to demonstrate credibility proposed mechanism. Simulation results show that ARED (2DE-ARED) able keep...

BLUE algorithm is a typical active queue management (AQM) algorithm, studies have shown that better than the RED (Random Early Detection) algorithm. It uses packet loss and link idle events to manage congestion. However, there are still some shortcomings in parameter setting for BLUE. Especially when TCP connections changed dramatically will result overflow underflow. In this paper an improved proposed, which introduces adaptive mechanism. The packet-dropping probability determined by event,...