Given a sequence of iid demands and an order up to replenishment policy with negligible lead time, we prove that average fill rate is monotonically decreasing in the number of periods in the planning horizon. This was conjectured to be true in a recent issue of this journal.

In this paper we present and simulate a new self–organising algorithm for P2P unstructured networks inspired by human relationships. This algorithm, called PROSA , tries to simulate the evolution of human relationships from simple acquaintance to friendship and partnership. Our target is to obtain a self–reconfiguring P2P system which possesses some of the desirable features of social communiti...

In this paper, we present a family of novel P2P routing schemes based on Chord [26] (and its variation FChord(α) [2]) that trades off uniformity with efficiency without using any additional overhead. We prove that H-FChord(α)’s routing is more efficient than in F-Chord(α) in terms of its average path length that is O(logn/ log logn). We also show, by simulations, that H-F-Chord(α) is more effic...

We found a curvilinear relationship between density and final score. Moderately low density measures (p=.04-6) outperformed very low density graphs and higher density graphs. Graphs with very low density often contain isolated cliques that reduce average score. If all nodes are not connected, then they cannot share the best solution found, lowering the optimal score. Eliminating all multi-cliqu...

Vulnerability of networks against one-shot decapitation attacks has been addressed several times in the literature. A first study on how a network can best defend itself by replenishing nodes and rewiring edges after decapitation was made by Nagaraja and Anderson. We extend the work of those authors on iterated attack and defense by: i) considering weighted and directed networks; ii) taking int...

Information cascades on social networks, such as retweet cascades on Twitter, have been often viewed as an epidemiological process, with the associated notion of virality to capture popular cascades that spread across the network. The notion of structural virality (or average path length) has been posited as a measure of global spread. In this paper, we argue that this simple epidemiological vi...