In this paper we analyze the hit performance of cache systems that receive file requests with general arrival distributions and different popularities. We consider timer-based (TTL) policies, with differentiated timers over which we optimize. The optimal policy is shown to be related to the monotonicity of the hazard rate function of the inter-arrival distribution. In particular for decreasing hazard rates, timer policies outperform the static policy of caching the most popular contents. We provide explicit solutions for the optimal policy in the case of Pareto-distributed inter-request times and a Zipf distribution of file popularities, including a compact fluid characterization in the limit of a large number of files. We compare it through simulation with classical policies, such as least-recently-used and discuss its performance. Finally, we analyze extensions of the optimization framework to a line network of caches.

This paper considers the problem of allocating exchange rates in peer-to-peer dissemination, which must consider the dual objectives of throughput efficiency and reciprocity between peers, the latter essential to cooperation incentives. This question has been studied in prior research for wired networks under an upload constraint, where the focus is on achieving reciprocity through decentralized peer interactions. We consider here a wireless network substrate, for which link capacities are non-uniform according to the peering choice, and exchanges may be subject to interference. A convex optimization problem is formulated that trades off efficiency and reciprocity, and various schemes are investigated to achieve a decentralized solution.

This paper studies network resource allocation between users that manage multiple connections, possibly through different routes, where each connection is subject to congestion control. We formulate a user-centric Network Utility Maximization problem that takes into account the aggregate rate a user obtains from all connections, and we propose decentralized means to achieve this fairness objective. In a first proposal, cooperative users control their number of active connections based on congestion prices from the transport layer to emulate suitable primal-dual dynamics in the aggregate rate; we show this control achieves asymptotic convergence to the optimal user-centric allocation. For the case of noncooperative users, we show that network stability and user-centric fairness can be enforced by a utility-based admission control implemented at the network edge. We also study stability and fairness issues when routing of incoming connections is enabled at the edge router. We obtain in this case a characterization of the stability region of loads that can be served with routing alone and a generalization of our admission control policy to ensure user-centric fairness when the stability condition is not met. The proposed algorithms are implemented at the packet level in ns2 and demonstrated through simulation.

IEEE 802.11n, the latest version of the widely used standard for wireless LANs, promises significant increases in speed by incorporating multiple enhancements at the physical layer. In this paper we demonstrate that, on the contrary, the straightforward deployment of 802.11n in conjunction with TCP over a simple, single access-point network, can dramatically underachieve the promised speeds. Part of the deficiency is due to overheads and can be improved by the technique of packet aggregation present in the standard. However more subtle problems are identified, in particular the downward equalization of throughputs that occurs under physical rate diversity, or the unreasonable portion of resources taken by uplink flows when competing with the more numerous downlink connections. These difficulties are demonstrated and their causes explained through a sequence of experiments with the ns3 packet simulator. Our analysis leads us to propose a desirable resource allocation for these situations of competition, and an architecture for control in the access-point to achieve it. Our solution involves a combination of packet aggregation, multiple queues and TCP-ACK isolation, compatible with the standard and where all the control resides at the AP. We demonstrate analytically and through extensive simulation that our method is able to provide significant enhancements in performance under a variety of traffic conditions.

Methods for network resource allocation have mainly focused on establishing fairness among the rates of individual flows. However, since multiple TCP connections in one or many paths can serve a common user, we advocate in this paper a user-centric notion of fairness, which we formulate in the Network Utility Maximization (NUM) framework. In particular, we develop control laws for the number of connections identified with a certain user, which can include single-path, multipath or more general aggregates of flows, and prove convergence to the optimal resource allocation. This theory applies directly to the case of cooperative users. In the case where connections are generated exogenously by possibly non-cooperative users, we develop admission control policies that ensure both network stability and user-centric fairness.

This paper studies the problem of allocating network capacity through periodic auctions. We impose the following conditions: fully distributed solutions over an arbitrary network topology, and the requirement that resources allocated in a given auction are reserved for the entire duration of the connection, not subject to future contention. Under these conditions, we study the problem of selling capacity to optimize revenue for the operator. We first study optimal revenue for a single distributed auction in a general network. Next, the periodic auctions case is considered for a single link, modelling the optimal revenue problem as a Markov decision process (MDP); we develop a sequence of receding horizon approximations to its solution. Combining the two approaches we formulate a receding horizon optimization of revenue over a general network topology, that yields a distributed implementation. The proposal is demonstrated through simulations.