Szeto et al 2002a - Revision history

Scipediacontent at 12:31, 21 January 2021

2021-01-21T12:31:27Z

Scipediacontent: Scipediacontent moved page Draft Content 402282711 to Szeto et al 2002a

2020-10-14T11:03:36Z

Scipediacontent moved page Draft Content 402282711 to Szeto et al 2002a

Scipediacontent: Created page with " == Abstract == The main contribution of this paper is a new online routing algorithm, called Dynamic Online Routing Algorithm (DORA), for dynamic setup of bandwidth guarante..."

2020-10-14T11:03:33Z

Created page with " == Abstract == The main contribution of this paper is a new online routing algorithm, called Dynamic Online Routing Algorithm (DORA), for dynamic setup of bandwidth guarante..."

New page

== Abstract ==

The main contribution of this paper is a new online routing algorithm, called Dynamic Online Routing Algorithm (DORA), for dynamic setup of bandwidth guaranteed paths in MPLS networks. The goal of DORA is to accept as many network path setup requests as possible by carefully mapping paths with reserved bandwidth evenly across the network. The key operation behind DORA is to avoid routing over links that: 1) have high potential to be part of any other paths, and 2) have less residual bandwidth available. We compare DORA against other existing constraint-based routing algorithms based on two performance metrics: path setup rejection ratio and percentage of successful reroutes. Our result shows that DORA performs better than the other algorithms in both metrics.

Document type: Part of book or chapter of book

== Full document ==
<pdf>Media:Draft_Content_402282711-beopen276-8162-document.pdf</pdf>

== Original document ==

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

* [https://link.springer.com/content/pdf/10.1007%2F3-540-47906-6_76.pdf https://link.springer.com/content/pdf/10.1007%2F3-540-47906-6_76.pdf]

← Older revision		Revision as of 12:31, 21 January 2021
Line 3:		Line 3:

	The main contribution of this paper is a new online routing algorithm, called Dynamic Online Routing Algorithm (DORA), for dynamic setup of bandwidth guaranteed paths in MPLS networks. The goal of DORA is to accept as many network path setup requests as possible by carefully mapping paths with reserved bandwidth evenly across the network. The key operation behind DORA is to avoid routing over links that: 1) have high potential to be part of any other paths, and 2) have less residual bandwidth available. We compare DORA against other existing constraint-based routing algorithms based on two performance metrics: path setup rejection ratio and percentage of successful reroutes. Our result shows that DORA performs better than the other algorithms in both metrics.		The main contribution of this paper is a new online routing algorithm, called Dynamic Online Routing Algorithm (DORA), for dynamic setup of bandwidth guaranteed paths in MPLS networks. The goal of DORA is to accept as many network path setup requests as possible by carefully mapping paths with reserved bandwidth evenly across the network. The key operation behind DORA is to avoid routing over links that: 1) have high potential to be part of any other paths, and 2) have less residual bandwidth available. We compare DORA against other existing constraint-based routing algorithms based on two performance metrics: path setup rejection ratio and percentage of successful reroutes. Our result shows that DORA performs better than the other algorithms in both metrics.
−
−	~~Document type: Part of book or chapter of book~~
−
−	~~== Full document ==~~
−	~~<pdf>Media:Draft_Content_402282711-beopen276-8162-document.pdf</pdf>~~


Line 15:		Line 10:

	* [https://link.springer.com/content/pdf/10.1007%2F3-540-47906-6_76.pdf https://link.springer.com/content/pdf/10.1007%2F3-540-47906-6_76.pdf]		* [https://link.springer.com/content/pdf/10.1007%2F3-540-47906-6_76.pdf https://link.springer.com/content/pdf/10.1007%2F3-540-47906-6_76.pdf]
		+
		+	* [http://link.springer.com/content/pdf/10.1007/3-540-47906-6_76 http://link.springer.com/content/pdf/10.1007/3-540-47906-6_76],
		+	: [http://dx.doi.org/10.1007/3-540-47906-6_76 http://dx.doi.org/10.1007/3-540-47906-6_76]
		+
		+	* [https://link.springer.com/chapter/10.1007%2F3-540-47906-6_76 https://link.springer.com/chapter/10.1007%2F3-540-47906-6_76],
		+	: [https://dblp.uni-trier.de/db/conf/networking/networking2002.html#SzetoBI02 https://dblp.uni-trier.de/db/conf/networking/networking2002.html#SzetoBI02],
		+	: [https://www.researchgate.net/profile/R_Boutaba/publication/221198635_Dynamic_Online_Routing_Algorithm_for_MPLS_Traffic_Engineering/links/0912f5076e20d617de000000.pdf?disableCoverPage=true https://www.researchgate.net/profile/R_Boutaba/publication/221198635_Dynamic_Online_Routing_Algorithm_for_MPLS_Traffic_Engineering/links/0912f5076e20d617de000000.pdf?disableCoverPage=true],
		+	: [https://dl.acm.org/citation.cfm?id=714766 https://dl.acm.org/citation.cfm?id=714766],
		+	: [https://link.springer.com/10.1007/3-540-47906-6_76 https://link.springer.com/10.1007/3-540-47906-6_76],
		+	: [https://academic.microsoft.com/#/detail/1522894013 https://academic.microsoft.com/#/detail/1522894013]
		+
		+	* [ ]

← Older revision	Revision as of 11:03, 14 October 2020
(No difference)