RateOptimal scheduling schemes for asynchronous InputQueued packet switches | Zendy

Thomas Bonald | Zendy; Davide Cuda | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

RateOptimal scheduling schemes for asynchronous InputQueued packet switches

Author(s) -

Thomas Bonald,

Davide Cuda

Publication year - 2012

Publication title -

acm sigmetrics performance evaluation review

Language(s) - English

Resource type - Journals

SCImago Journal Rank - 0.223

H-Index - 80

eISSN - 1557-9484

pISSN - 0163-5999

DOI - 10.1145/2425248.2425274

Subject(s) - computer science , asynchronous communication , scheduling (production processes) , network packet , round robin scheduling , packet switching , transmission delay , computer network , real time computing , fair share scheduling , distributed computing , mathematical optimization , mathematics , quality of service

The performance of input-queued packet switches critically depends on the scheduling scheme that connects the input ports to the output ports. We show that, when packets are switched asynchronously, simple scheduling schemes where contention is solved locally at each input or output can achieve rate optimality, without any speed-up of the internal transmission rate.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research