The use of game theory in the design and control of large scale networked systems is becoming increasingly more important. In this paper, we follow this approach to efficiently solve a network allocation problem motivated by peer-topeer cloud storage models as alternatives to classical centralized cloud storage services. To this aim, we propose an allocation algorithm that allows the units to u...

We generalize the classical max-min rate allocation policy with the support of the minimum rate requirement and peak rate constraint for each connection. Since a centralized algorithm for the generalized maxmin (GMM) rate allocation requires global information, which is difficult to maintain and manage in a large network, we develop a distributed protocol to achieve the GMM policy using the ava...

This paper concerns sub-channel allocation in multi-user wireless networks with a view to increasing the network throughput. It is assumed there are some sub-channels to be equally divided among active links, such that the total sum rate increases, where it is assumed each link is subject to a maximum transmit power constraint. This problem is found to be a non-convex optimization problem and i...

This paper modifies a Townsend turnpike model by letting agents stay at a location long enough to trade some consumption loans, but not long enough to support a Pareto optimal allocation. Monetary equilibria exist that are non-optimal in the absence of a scheme to pay interest on currency at a particular rate. Paying interest on currency at the optimal rate delivers a Pareto optimal allocation,...

We consider throughput-optimal power allocation in multi-hop wireless networks. The study of this problem has been limited due to the non-convexity of the underlying optimization problems, that prohibits an efficient solution even in a centralized setting. We take a randomization approach to deal with this difficulty. To this end, we generalize the randomization framework originally proposed fo...

We generalize the classical max-min rate allocation policy with the support of the minimum rate requirement and peak rate constraint for each connection. Since a centralized algorithm for the generalized maxmin (GMM) rate allocation requires global information, which is di cult to maintain and manage in a large network, we develop a distributed protocol to achieve the GMM policy using the avail...

I. FROM EXCLUSIVE USE TO PUBLIC RIGHT ............................... 240 A. Dealing the Cards, and Valuing the Deal ............................ 242 B. Reshuffling the Deck............................................................ 243 II. THE REPEAL OF GROSCH’S LAW .............................................. 246 III. THE BARAN PRINCIPLES ......................................................

Traditionally, allocating of Ethernet Passive Optical Network (EPON) bandwidth schemes relied on a centralized architecture where their Optical Line Terminal (OLT) is the sole intelligent device with the capability for the arbitration of bandwidth based on time-division access for the upstream shared channel. However, any breakdown in the OLT bandwidth allocation will affect the allotment for O...

Network bandwidth allocation is a central issue in modern communication networks. The main objective of the bandwidth allocation is to allocate an optimal bandwidth for maximizing a predefined utility over the capacity constraints to traffic sources. When a centralized operator, which manages all the bandwidth allocations in the network, has a certain operational policy, the bandwidth allocatio...

The efficient allocation of power is a major concern in today’s wireless communications systems. Due to the high demand in data rate and the scarcity of wireless resources such as power, the multi-user communication systems like the multiple access channel (MAC) and broadcast channel (BC) have become highly competitive environments for the users as well as the system itself. Theory of microecon...