Max-Min Fairness in Input-Queued Switches

Madhusudan Hosaagrahara; Harish Sethu

JOURNAL ARTICLE

Max-Min Fairness in Input-Queued Switches

Year: 2005 Journal: The American Journal of Medicine Vol: 132 (7)Pages: 781-782 Publisher: Elsevier BV

Get Full-Text PDF Get Analytical Report

Abstract

This paper describes an algorithm that computes the maxmin fair allocation of rates for flows through an input-queued switch. The algorithm is provably max-min fair and can be implemented in a distributed fashion to dynamically determine flow rates.

Keywords:

Computer science Computer network Distributed computing Fair share Mathematical optimization Algorithm Mathematics Economics

Metrics

Cited By

0.80

FWCI (Field Weighted Citation Impact)

Refs

0.74

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Interconnection Networks and Systems

Physical Sciences → Computer Science → Computer Networks and Communications

Advanced Queuing Theory Analysis

Social Sciences → Business, Management and Accounting → Management Information Systems

Network Traffic and Congestion Control

Physical Sciences → Computer Science → Computer Networks and Communications

Max-Min Fairness in Input-Queued Switches

Abstract

Metrics

Citation History

Topics

Related Documents

Max-Min Fair Scheduling in Input-Queued Switches

Weighted max-min fair scheduling in input-queued crossbar switches

A novel fairness criterion for input queued switches

Input-Queued Switches

On the fairness of scheduling algorithms for input-queued switches