This paper analyzes reciprocation strategies in peer-to-peer networks from the point of view of the resulting resource allocation. Our stated aim is to achieve through decentralized interactions a weighted proportionally fair allocation. We analyze the desirable properties of such allocation, as well as an ideal proportional reciprocity algorithm to achieve it, using tools of convex optimizatio...

Multiuser orthogonal frequency division multiplexing (MU-OFDM) is a promising technique for achieving high downlink capacities in future cellular and wireless LAN systems. The sum capacity of MU-OFDM is maximized when each subchannel is assigned to the user with the best channel-tonoise ratio for that subchannel, with power subsequently distributed by water-filling. However, fairness among the ...

Residential microgrids (MGs) may host a large number of Distributed Energy Resources (DERs). The strategy that maximizes the revenue for each individual DER is the one in which the DER operates at capacity, injecting all available power into the grid. However, when the DER penetration is high and the consumption low, this strategy may lead to power surplus that causes voltage increase over reco...

In this paper, we investigate the proportional fair scheduling (PFS) problem for multiuser OFDM systems, considering the impact of packet length. Packet length influences scheduling schemes in a way that each scheduled packet should be ensured to be completely transmitted within the scheduled frames. We formulate the PFS problem as an optimization problem. Based on the observations on the struc...

The fairness concept has been widely studied in the area of data networks. The most well-known fairness criterion, max-min fairness, gives priority to the minimum rate session. Kelly questioned its appropriateness in his works on the bandwidth sharing among the end-to-end flows and proposed another fairness criterion preferring short distance flows to enhance the overall throughput, which is ca...

The viability of overlay multicasting has been established by prev ious research. However, in order to apply overlay multicast to Internet -scale distributed systems, such as the Grid and Peer-to-Peer systems, the issue of effectively enforcing fairness among peers so as to optimize overall performance remains as a challenge. This paper argues that simply appl ying a multiple -tree scheme does ...

In this paper, Long-Term Proportional Fair (LTPF) resource allocation algorithm in dynamic OFDMA system is presented, which provides long-term QoS guarantee (m 1 ainly throughput requirement satisfaction) to individual user and follows every user's QoS profile at long-term by incremental optimization of proportional fairness and overall system rate maximization. The LTPF algorithm dynamically a...

Input-queued switches are able to overcome head-of-line (HOL) blocking and achieve high throughput by using virtual output queueing (VOQ) and efficient scheduling algorithms. In this case, the buffers and control logic work at the line speed [2], which enables such architecture to be scaled up to backbone routers with very high speed, as realized in Tiny Tera [3], Cisco GSR [4], Lucent GRF [5],...

Device-to-device (D2D) communication can improve coverage, spectrum efficiency, and energy efficiency based on the current cellular network architecture. The fair scheduling for D2D communication in the orthogonal frequency division multiple access-based cellular network is studied in this paper. Based on the proportional fairness criteria, the optimization objective is formulated to maximize t...

There has been a lot of recent work on decentralized end-to-end congestion control algorithms for the Internet. These are based on ECN marking with the goal of building a low-loss, low-queueing-delay network. The control algorithms are designed on the premise that each user has a utility function, which the user is trying to maximize, while the network is simultaneously trying to maintain some ...