Recently, geographic routing in wireless networks has gained attention due to several advantages of location information. Location information eliminates the necessity to set up and maintain explicit routes, which reduces communication overhead and routing table size. These advantages allow scalability especially in dynamic and unstable wireless networks. However, no matter which technologies o...

The Inventory Routing Problem (IRP) involves the distribution of one or more products from a supplier to a set of customers over a discrete planning horizon. The version treated here, the so-called Vendor Managed Inventory Routing Problem (VMIRP), is the Inventory Routing problem arising when the replenishment policy is decided a priori. We consider two replenishment policies. The first is know...

This paper examines the interactions between routing and inventory-management decisions in a two-level supply chain consisting of a cross-docking warehouse and N retailers. Retailer demand is stochastic; i.e., normally distributed and independent across retailers and over time. Travel times are fixed between pairs of system sites. Every m time periods, system inventory is replenished at the war...

The Tor network provides low-latency anonymous communication to over two million users daily. To be practical for widespread use, Tor uses onion routing, which does not protect a user against an adversary that can observe a user’s traffic at certain vulnerable positions along the traffic’s route through the Internet. A natural defense would be to choose Tor relays to minimize the chance that th...

In a growing transportation market, the optimization and organization of distribution networks have become an important issue for companies that are looking improving efficiency their freight transport systems. this context, adoption collaboration strategy between various logistics actors can enhance operational reduce sustainability impacts. paper, we evaluate economic, environmental social be...

We propose probabilistic location to enhance the performance of existing peer-to-peer location mechanisms in the case where a replica for the queried data item exists close to the query source. We introduce the attenuated Bloom filter, a lossy distributed index. We describe how to use these data structures for document location and how to maintain them despite document motion. We include a deta...