Fair scheduling is an ideal candidate for fair bandwidth sharing and thereby achieving fairness among the contending flows in a network. It is particularly challenging for ad hoc ...
Md. Mamun-Or-Rashid, Muhammad Mahbub Alam, Md. Abd...
Abstract. Fair queueing in the wireless domain poses significant challenges due to unique issues in the wireless channel such as locationdependent and bursty channel errors. In thi...
Abstract--In heterogeneous networks such as today's Internet, the differentiated services architecture promises to provide QoS guarantees through scalable service differentiat...
A fair network payment protocol plays an important role in electronic commerce. The fairness concept in payments can be illustrated as that two parties (e.g. customers and merchant...
Abstract-- Elastic applications are primarily interested in minimal delay achievable for their messages under current network load. In this paper, we investigate how to transmit su...
— A research issue under investigation in the context of differentiated services (DiffServ) is the fair distribution of bandwidth between aggregates sharing the same Assured Forw...
—In multi-rate wireless LANs, throughput-based fair bandwidth allocation can lead to drastically reduced aggregate throughput. To balance aggregate throughput while serving users...
—In this paper, we consider the problem of designing scheduling algorithm for input queued switch that is both fair as well as throughput optimal. The significant body of litera...
We consider the problem of fair allocation in the package assignment model, where a set of indivisible items, held by single seller, must be efficiently allocated to agents with q...