Data networks
Multicast routing in datagram internetworks and extended LANs
ACM Transactions on Computer Systems (TOCS)
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
Receiver-driven layered multicast
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
PLM: fast convergence for cumulative layered multicast transmisson schemes
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Bandwidth-allocation policies for unicast and multicast flows
IEEE/ACM Transactions on Networking (TON)
The impact of multicast layering on network fairness
IEEE/ACM Transactions on Networking (TON)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Fairness in cellular mobile networks
IEEE Transactions on Information Theory
Multicast routing with end-to-end delay and delay variation constraints
IEEE Journal on Selected Areas in Communications
Fair distributed congestion control in multirate multicast networks
IEEE/ACM Transactions on Networking (TON)
Lexicographic QoS scheduling for parallel I/O
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
An optimal discrete rate allocation for overlay video multicasting
Computer Communications
A novel approach for resource allocation in broadband access networks
Proceedings of the International Conference and Workshop on Emerging Trends in Technology
A lexicographic optimization framework to the flow control problem
IEEE Transactions on Information Theory
| Hi-index | 15.04 |
We study fairness in allocating bandwidth for loss-tolerant real-time multicast applications. We assume that the traffic is encoded in several layers so that the network can adapt to the available bandwidth and receiver processing capabilities by varying the number of layers delivered. We consider the case where receivers cannot subscribe to fractional layers. Therefore, the network can allocate only a discrete set of bandwidth to a receiver, whereas a continuous set of rates can be allocated when receivers can subscribe to fractional layers. Fairness issues differ vastly in these two different cases. Computation of lexicographic optimal rate allocation becomes NP-hard in this case, while lexicographic optimal rate allocation is polynomial complexity computable when fractional layers can be allocated. Furthermore, maxmin fair rate vector may not exist in this case. We introduce a new notion of fairness, maximal fairness. Even though maximal fairness is a weaker notion of fairness, it has many intuitively appealing fairness properties. For example, it coincides with lexicographic optimality and maxmin fairness, when maxmin fair rate allocation exists. We propose a polynomial complexity algorithm for computation of maximally fair rates allocated to various source-destination pairs, which incidentally computes the maxmin fair rate allocation, when the latter exists.