Show simple item record

dc.contributor.authorYetginer, E.en_US
dc.contributor.authorKarasan, E.en_US
dc.date.accessioned2016-02-08T11:56:32Z
dc.date.available2016-02-08T11:56:32Z
dc.date.issued2002en_US
dc.identifier.issn1530-1346
dc.identifier.urihttp://hdl.handle.net/11693/27558
dc.description.abstractIn this paper we study traffic engineering of restorable paths in multiprotocol label switching (MPLS) networks. We consider off-line computation of working and restoration paths with path rerouting as the restoration scheme. First we compute a link-disjoint path set for given set of demands. Using this path set we study four approaches for selecting working and restoration paths, and formulate each method as an integer linear programming (ILP) problem. A traffic uncertainty model is developed in order to compare these approaches based on their robustness with respect to changing traffic patterns. We obtain numerical results and compare these design approaches based on the number of additional demands carried and the distribution of residual capacity over the network. © 2002 IEEE.en_US
dc.language.isoEnglishen_US
dc.source.titleIEEE International Symposium on Computers and Communicationsen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/ISCC.2002.1021784en_US
dc.subjectInteger Linear Programmingen_US
dc.subjectLink-disjoint pathsen_US
dc.subjectMultiprotocol label switching networksen_US
dc.subjectOff-line computationen_US
dc.subjectResidual capacityen_US
dc.subjectRestoration pathsen_US
dc.subjectTraffic Engineeringen_US
dc.subjectTraffic uncertaintiesen_US
dc.subjectHighway engineeringen_US
dc.subjectInteger programmingen_US
dc.subjectRestorationen_US
dc.titleRobust path design algorithms for traffic engineering with restoration in MPLS networksen_US
dc.typeConference Paperen_US
dc.departmentDepartment of Electrical and Electronics Engineering
dc.citation.spage933en_US
dc.citation.epage938en_US
dc.identifier.doi10.1109/ISCC.2002.1021784en_US
dc.publisherIEEEen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record