Cloud providers and other data center operators are using geo-distributed data centers. But these data centers largely continue to employ the same designs as were appropriate for single data centers. These designs are wasteful because they do not take full advantage of geo-distribution. Geo-redundancy can reduce other redundancy at multiple intermediate layers in individual data centers and dec...

abstract a model based on fuzzy logic has been developed to simulate the distribution pattern of a single sprinkler. a nelson r3000 sprayer with rotator pad and water application angle of 360o which is one of the most common types of center pivot and linear move sprinklers was selected. several field experiments according to the iso-8026 and asae-s398.1 standards were performed to assess the wa...

discrete facility location,   distribution center,   logistics,   inventory policy,   queueing theory,   markov processes, the distribution center location problem is a crucial question for logistics decision makers. the optimization of these decisions needs careful attention to the fixed facility costs, inventory costs, transportation costs and customer responsiveness. in this paper we study t...

We study the location-inventory model as introduced by Teo et al. (2001) to analyze the impact of consolidation of distribution centers on facility and inventory costs. We extend their result on profitability of consolidation. We associate a cooperative game with each location-inventory situation and prove that this game has a nonempty core for identical and independent demand processes. This i...

groups may also distribute working documents as Internet Drafts. Internet Drafts are draft documents valid for a maximum of six months. Internet Drafts may be updated, replaced, or obsoleted by other documents at any time. It is not appropriate to use Internet Drafts as reference material or to cite them other than as a \working draft" or \work in progress." Abstract Multicasting is becoming an...

Security schemes of pairwise key establishment, which enable sensors to communicate with each other securely, play a fundamental role in research on security issue in wireless sensor networks. A general framework for key predistribution is presented, based on the idea of KDC (Key Distribution Center) and polynomial pool schemes. By utilizing nice properties of H2 (Hierarchical Hypercube) model,...

Multisender authentication code was firstly constructed by Gilbert et al. [1] in 1974. Multisender authentication system refers towho a groupof senders, cooperatively send amessage to a receiver; then the receiver should be able to ascertain that the message is authentic. About this case, many scholars and researchers had made great contributions to multisender authentication codes, such as [2–...

In this paper, we treat the entity authentication and subsequent key distribution problem in order to enhance multiple-entity (group of entities) communications with confidentiality and integrity services. We first give a summary of the existing methods to solve the key distribution problem. After this introduction of some known methods, we propose a different one, which detailed description wi...

This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized subsets of servers are able to compute the function. A user who wants to compute f(x) should send x to the members of an authorized subset and receive information which enables him to compute f(x). We require that such a scheme i...