Data networks
Making greed work in networks: a game-theoretic analysis of switch service disciplines
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Receiver-driven layered multicast
Conference proceedings on Applications, technologies, architectures, and protocols for computer communications
Inter-receiver fairness: a novel performance measure for multicast ABR sessions
SIGMETRICS '98/PERFORMANCE '98 Proceedings of the 1998 ACM SIGMETRICS joint international conference on Measurement and modeling of computer systems
A digital fountain approach to reliable distribution of bulk data
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Achieving bounded fairness for multicast and TCP traffic in the Internet
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Uniform versus priority dropping for layered video
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
RMDP: an FEC-based reliable multicast protocol for wireless environments
ACM SIGMOBILE Mobile Computing and Communications Review
The Impact of Multicast Layering on Network Fairness TITLE2:
The Impact of Multicast Layering on Network Fairness TITLE2:
A survey of active network research
IEEE Communications Magazine
On max-min fair congestion control for multicast ABR service in ATM
IEEE Journal on Selected Areas in Communications
Handling heterogeneity in networked virtual environments
Presence: Teleoperators and Virtual Environments - special issue: IEEE virtual reality 2002 conference
Layered peer-to-peer streaming
NOSSDAV '03 Proceedings of the 13th international workshop on Network and operating systems support for digital audio and video
Priority service and max-min fairness
IEEE/ACM Transactions on Networking (TON)
Fair Bandwidth Allocation for Multicasting in Networks with Discrete Feasible Set
IEEE Transactions on Computers
Fair distributed congestion control in multirate multicast networks
IEEE/ACM Transactions on Networking (TON)
A unified framework for max-min and min-max fairness with applications
IEEE/ACM Transactions on Networking (TON)
Proactive surge protection: a defense mechanism for bandwidth-based attacks
SS'08 Proceedings of the 17th conference on Security symposium
An adaptive multirate congestion control protocol for multicast communications
Computer Communications
Proactive surge protection: a defense mechanism for bandwidth-based attacks
IEEE/ACM Transactions on Networking (TON)
Birkhoff-von Neumann switching with statistical traffic profiles
Computer Communications
An adaptive and predictive approach for autonomic multirate multicast networks
ACM Transactions on Autonomous and Adaptive Systems (TAAS)
Hi-index | 0.00 |
Many definitions of fairness for multicast networks assume that sessions are single rate, requiring that each multicast session transmits data to all of its receivers at the same rate. These definitions do not account for multirate approaches, such as layering, that permit receiving rates within a session to be chosen independently. We identify four desirable fairness properties for multicast networks, derived from properties that hold within the max-min fair allocations of unicast networks. We extend the definition of multicast max-min fairness to networks that contain multirate sessions, and show that all four fairness properties hold in a multirate max-min fair allocation, but need not hold in a single-rate max-min fair allocation. We then show that multirate max-min fair rate allocations can be achieved via intra-session coordinated joins and leaves of multicast groups. However, in the absence of coordination, the resulting max-min fair rate allocation uses link bandwidth inefficiently, and does not exhibit some of the desirable fairness properties. We evaluate this inefficiency for several layered multirate congestion control schemes, and find that, in a protocol where the sender coordinates joins, this inefficiency has minimal impact on desirable fairness properties. Our results indicate that sender-coordinated layered protocols show promise for achieving desirable fairness properties for allocations in large-scale multicast networks.