20.01.2014 Views

Lectures notes for 2010 - KTH

Lectures notes for 2010 - KTH

Lectures notes for 2010 - KTH

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

QoS & Scheduling algorithms<br />

Predictable delay is thought to be required <strong>for</strong> interactive real-time applications:<br />

Alternatives:<br />

1.use a network which guarantees fixed delays<br />

2.use a packet scheduling algorithm<br />

3.retime traffic at destination<br />

Since queueing at routers, hosts, etc. has traditionally been simply FIFO; which<br />

does not provide guaranteed end-to-end delay both the 2nd and 3rd method use<br />

alternative algorithms to maintain a predictable delay.<br />

Algorithms such as: Weighted Fair Queueing (WFQ)<br />

These algorithms normally emulate a fluid flow model.<br />

As it is very hard to provide fixed delays in a network, hence we will examine the<br />

2nd and 3rd methods.<br />

Maguire QoS & Scheduling algorithms 8: 63 of 78<br />

maguire@kth.se <strong>2010</strong>.03.21 Internetworking/Internetteknik

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!