Heavy traffic analysis of approximate max-weight matching algorithms for input-queued switches

Perform. Evaluation, pp. 1021432020.

Cited by: 0|Views2
EI

Abstract:

Abstract In this paper, we propose a class of approximation algorithms for the max-weight matching (MWM) policy for input-queued switches, called expected 1-APRX. We establish the state space collapse (SSC) result for expected 1-APRX, and characterize its queue length behavior in the heavy-traffic limit. Our results indicate that expect...More

Code:

Data:

Get fulltext within 24h
Bibtex
Your rating :
0

 

Tags
Comments