FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W2116714735> ?p ?o ?g. }

• W2116714735 endingPage "266" @default.
• W2116714735 startingPage "253" @default.
• W2116714735 abstract "Reliability has been well recognized as an important design objective in the design of modern high-speed networks. While traditional approaches offer either 100% protection in the presence of single link failure or no protection at all, connections in real networks may have multiple reliability requirements. The concept of differentiated reliability (DiR) has been introduced in the literature to provide multiple reliability requirements in protection schemes that provision spare resources. In this paper, we consider the problem of routing connections with differentiated reliability in wavelength-division multiplexing (WDM) mesh networks when backup sharing is not allowed. Our objective is to route connections with minimum network cost (e.g., network resources) while meeting their required reliability. We assume connections arrive dynamically one-at-a-time and a decision as to accept or reject a connection has to be made without a priori knowledge of future arrivals. Since sharing cannot be used for achieving efficiency, the goal is to achieve efficiency by improved path selection. In this paper, we first present an integer linear programming (ILP) formulation for the problem. By solving the ILP formulation, we can obtain an optimal solution with respect to the current network state for each dynamic arrival. To solve the ILP formulation, however, is time consuming for large networks. We thus propose two approximation algorithms for the problem. The first one, called Shortest-Path-Pair-based Auxiliary graph (SPPA), can obtain an epsiv-approximation solution whose cost is at most 1 + epsiv times the optimum in O((n <sup xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink>2</sup> (n + 1) + 2mn)(log log(2n) + 1/epsiv)) time, where n and m are the number of nodes and links in a network, respectively. To reduce the computational complexity of the first algorithm, the second algorithm, called Auxiliary graph-based Two-Step Approach (ATSA), is proposed and can obtain a near optimal solution with cost at most 2 + epsiv times that of the optimal solution in O(mn(log log n + 1/epsiv)) time. Results from extensive simulations conducted on two typical carrier mesh networks show the efficiency of the two algorithms." @default.
• W2116714735 created "2016-06-24" @default.
• W2116714735 creator A5010466093 @default.
• W2116714735 creator A5016039620 @default.
• W2116714735 creator A5051588201 @default.
• W2116714735 date "2009-02-01" @default.
• W2116714735 modified "2023-09-26" @default.
• W2116714735 title "Routing Connections With Differentiated Reliability Requirements in WDM Mesh Networks" @default.
• W2116714735 cites W1492927653 @default.
• W2116714735 cites W1615185386 @default.
• W2116714735 cites W1775234880 @default.
• W2116714735 cites W1994833785 @default.
• W2116714735 cites W2004336324 @default.
• W2116714735 cites W2021435086 @default.
• W2116714735 cites W2061701207 @default.
• W2116714735 cites W2074117023 @default.
• W2116714735 cites W2078975628 @default.
• W2116714735 cites W2095618098 @default.
• W2116714735 cites W2096268361 @default.
• W2116714735 cites W2097673516 @default.
• W2116714735 cites W2107591700 @default.
• W2116714735 cites W2115172124 @default.
• W2116714735 cites W2119433111 @default.
• W2116714735 cites W2122754121 @default.
• W2116714735 cites W2126794362 @default.
• W2116714735 cites W2128995498 @default.
• W2116714735 cites W2130626677 @default.
• W2116714735 cites W2135561000 @default.
• W2116714735 cites W2141860966 @default.
• W2116714735 cites W2149189835 @default.
• W2116714735 cites W2155061423 @default.
• W2116714735 cites W2162274128 @default.
• W2116714735 cites W73629738 @default.
• W2116714735 cites W2002252750 @default.
• W2116714735 cites W301824129 @default.
• W2116714735 doi "https://doi.org/10.1109/tnet.2008.925087" @default.
• W2116714735 hasPublicationYear "2009" @default.
• W2116714735 type Work @default.
• W2116714735 sameAs 2116714735 @default.
• W2116714735 citedByCount "23" @default.
• W2116714735 countsByYear W21167147352012 @default.
• W2116714735 countsByYear W21167147352013 @default.
• W2116714735 countsByYear W21167147352014 @default.
• W2116714735 countsByYear W21167147352015 @default.
• W2116714735 countsByYear W21167147352017 @default.
• W2116714735 crossrefType "journal-article" @default.
• W2116714735 hasAuthorship W2116714735A5010466093 @default.
• W2116714735 hasAuthorship W2116714735A5016039620 @default.
• W2116714735 hasAuthorship W2116714735A5051588201 @default.
• W2116714735 hasConcept C11413529 @default.
• W2116714735 hasConcept C120314980 @default.
• W2116714735 hasConcept C121332964 @default.
• W2116714735 hasConcept C126255220 @default.
• W2116714735 hasConcept C144133560 @default.
• W2116714735 hasConcept C160724564 @default.
• W2116714735 hasConcept C162396882 @default.
• W2116714735 hasConcept C162853370 @default.
• W2116714735 hasConcept C163258240 @default.
• W2116714735 hasConcept C194648553 @default.
• W2116714735 hasConcept C2777735758 @default.
• W2116714735 hasConcept C2780945871 @default.
• W2116714735 hasConcept C2781040381 @default.
• W2116714735 hasConcept C31258907 @default.
• W2116714735 hasConcept C33923547 @default.
• W2116714735 hasConcept C41008148 @default.
• W2116714735 hasConcept C43214815 @default.
• W2116714735 hasConcept C49040817 @default.
• W2116714735 hasConcept C56086750 @default.
• W2116714735 hasConcept C62520636 @default.
• W2116714735 hasConcept C6260449 @default.
• W2116714735 hasConcept C74172769 @default.
• W2116714735 hasConcept C77088390 @default.
• W2116714735 hasConceptScore W2116714735C11413529 @default.
• W2116714735 hasConceptScore W2116714735C120314980 @default.
• W2116714735 hasConceptScore W2116714735C121332964 @default.
• W2116714735 hasConceptScore W2116714735C126255220 @default.
• W2116714735 hasConceptScore W2116714735C144133560 @default.
• W2116714735 hasConceptScore W2116714735C160724564 @default.
• W2116714735 hasConceptScore W2116714735C162396882 @default.
• W2116714735 hasConceptScore W2116714735C162853370 @default.
• W2116714735 hasConceptScore W2116714735C163258240 @default.
• W2116714735 hasConceptScore W2116714735C194648553 @default.
• W2116714735 hasConceptScore W2116714735C2777735758 @default.
• W2116714735 hasConceptScore W2116714735C2780945871 @default.
• W2116714735 hasConceptScore W2116714735C2781040381 @default.
• W2116714735 hasConceptScore W2116714735C31258907 @default.
• W2116714735 hasConceptScore W2116714735C33923547 @default.
• W2116714735 hasConceptScore W2116714735C41008148 @default.
• W2116714735 hasConceptScore W2116714735C43214815 @default.
• W2116714735 hasConceptScore W2116714735C49040817 @default.
• W2116714735 hasConceptScore W2116714735C56086750 @default.
• W2116714735 hasConceptScore W2116714735C62520636 @default.
• W2116714735 hasConceptScore W2116714735C6260449 @default.
• W2116714735 hasConceptScore W2116714735C74172769 @default.
• W2116714735 hasConceptScore W2116714735C77088390 @default.
• W2116714735 hasIssue "1" @default.
• W2116714735 hasLocation W21167147351 @default.
• W2116714735 hasOpenAccess W2116714735 @default.

• next