Scipediacontent: Scipediacontent moved page Draft Content 731489082 to Kuipers et al 2006a

2021-01-21T14:17:27Z

Scipediacontent moved page Draft Content 731489082 to Kuipers et al 2006a

Scipediacontent: Created page with " == Abstract == The problem of finding multi-constrained paths has been addressed by several QoS routing algorithms. While they generally satisfy the application requirements..."

2021-01-21T14:17:23Z

Created page with " == Abstract == The problem of finding multi-constrained paths has been addressed by several QoS routing algorithms. While they generally satisfy the application requirements..."

New page

== Abstract ==

The problem of finding multi-constrained paths has been addressed by several QoS routing algorithms. While they generally satisfy the application requirements, they often do not consider the perspective of service providers. Service providers aim at maximizing the throughput and the number of accepted requests. These goals have been addressed by traffic engineering algorithms considering bandwidth as the sole application requirement. We propose a proper length function for an existing QoS routing algorithm (SAMCRA) that attempts to optimize network utilization while still offering QoS guarantees. This paper presents a comparison between several proposed algorithms via simulation studies. The simulations show that SAMCRA with a proper length performs similarly or even better than the best among the other algorithms and it has a fast running time.

== Original document ==

The different versions of the original document can be found in:

* [https://link.springer.com/content/pdf/10.1007%2F0-387-31170-X_4.pdf https://link.springer.com/content/pdf/10.1007%2F0-387-31170-X_4.pdf]

* [http://link.springer.com/content/pdf/10.1007/0-387-31170-X_4 http://link.springer.com/content/pdf/10.1007/0-387-31170-X_4],
: [http://dx.doi.org/10.1007/0-387-31170-x_4 http://dx.doi.org/10.1007/0-387-31170-x_4]

* [https://link.springer.com/chapter/10.1007/0-387-31170-X_4 https://link.springer.com/chapter/10.1007/0-387-31170-X_4],
: [https://www.narcis.nl/publication/RecordID/oai%3Atudelft.nl%3Auuid%3Ab1392396-9a8d-4159-a2ba-22cfd21a07f3 https://www.narcis.nl/publication/RecordID/oai%3Atudelft.nl%3Auuid%3Ab1392396-9a8d-4159-a2ba-22cfd21a07f3],
: [https://repository.tudelft.nl/islandora/object/uuid%3Ab1392396-9a8d-4159-a2ba-22cfd21a07f3 https://repository.tudelft.nl/islandora/object/uuid%3Ab1392396-9a8d-4159-a2ba-22cfd21a07f3],
: [http://resolver.tudelft.nl/uuid:b1392396-9a8d-4159-a2ba-22cfd21a07f3 http://resolver.tudelft.nl/uuid:b1392396-9a8d-4159-a2ba-22cfd21a07f3],
: [https://repository.tudelft.nl/islandora/object/uuid%3Ab1392396-9a8d-4159-a2ba-22cfd21a07f3/datastream/OBJ/download https://repository.tudelft.nl/islandora/object/uuid%3Ab1392396-9a8d-4159-a2ba-22cfd21a07f3/datastream/OBJ/download],
: [https://www.nas.ewi.tudelft.nl/people/Fernando/papers/Eunice05.pdf https://www.nas.ewi.tudelft.nl/people/Fernando/papers/Eunice05.pdf],
: [https://academic.microsoft.com/#/detail/1805691179 https://academic.microsoft.com/#/detail/1805691179]

← Older revision	Revision as of 14:17, 21 January 2021
(No difference)

Kuipers et al 2006a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 731489082 to Kuipers et al 2006a

Scipediacontent: Created page with " == Abstract == The problem of finding multi-constrained paths has been addressed by several QoS routing algorithms. While they generally satisfy the application requirements..."