Scipediacontent: Scipediacontent moved page Draft Content 697867800 to Yetginer Karasan 2002a

2021-02-03T15:35:56Z

Scipediacontent moved page Draft Content 697867800 to Yetginer Karasan 2002a

Scipediacontent: Created page with " == Abstract == In this paper we study traffic engineering in Multiprotocol Label Switching (MPLS) networks. We consider off-line computation of disjoint working and restorat..."

2021-02-03T15:35:53Z

Created page with " == Abstract == In this paper we study traffic engineering in Multiprotocol Label Switching (MPLS) networks. We consider off-line computation of disjoint working and restorat..."

New page

== Abstract ==

In this paper we study traffic engineering in Multiprotocol Label Switching (MPLS) networks. We consider off-line computation of disjoint working and restoration paths where path rerouting is used as the restoration scheme. We first compute maximum number of paths for each demand such that paths satisfy diversity requirements. Using the generated path set we study four different approaches for selecting working and restoration paths, and formulate each method as an Integer Linear Programming (ILP) problem. The first two methods treat working and restoration path design problems separately. We propose two new path design methods that jointly optimize the working and restoration paths. A traffic uncertainty model is developed in order to evaluate performances of these four approaches based on their robustness with respect to changing traffic patterns. We compare these design approaches based on the number of additional demands carried and the distribution of residual capacity over the network. It is shown through simulations that the weighted load balancing method proposed in this paper outperforms the other three methods in handling traffic demand uncertainty.

== Original document ==

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

* [http://hdl.handle.net/11693/27538 http://hdl.handle.net/11693/27538]

* [http://hdl.handle.net/11693/27558 http://hdl.handle.net/11693/27558]

* [http://repository.bilkent.edu.tr/bitstream/11693/27558/1/Robust%20Path%20Design%20Algorithms%20for%20Traffic%20Engineering%20with%20Restoration%20in.pdf http://repository.bilkent.edu.tr/bitstream/11693/27558/1/Robust%20Path%20Design%20Algorithms%20for%20Traffic%20Engineering%20with%20Restoration%20in.pdf]

* [http://kilyos.ee.bilkent.edu.tr/~ezhan/ieice1.pdf http://kilyos.ee.bilkent.edu.tr/~ezhan/ieice1.pdf],
: [https://www.computer.org/csdl/proceedings-article/iscc/2002/16710933/12OmNBSBk1q https://www.computer.org/csdl/proceedings-article/iscc/2002/16710933/12OmNBSBk1q],
: [https://dblp.uni-trier.de/db/conf/iscc/iscc2002.html#YetginerK02 https://dblp.uni-trier.de/db/conf/iscc/iscc2002.html#YetginerK02],
: [https://academic.microsoft.com/#/detail/2140554071 https://academic.microsoft.com/#/detail/2140554071]

* [http://xplorestaging.ieee.org/ielx5/7956/21983/01021784.pdf?arnumber=1021784 http://xplorestaging.ieee.org/ielx5/7956/21983/01021784.pdf?arnumber=1021784],
: [http://dx.doi.org/10.1109/iscc.2002.1021784 http://dx.doi.org/10.1109/iscc.2002.1021784]

← Older revision	Revision as of 15:35, 3 February 2021
(No difference)

Yetginer Karasan 2002a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 697867800 to Yetginer Karasan 2002a

Scipediacontent: Created page with " == Abstract == In this paper we study traffic engineering in Multiprotocol Label Switching (MPLS) networks. We consider off-line computation of disjoint working and restorat..."