Matches in SemOpenAlex for { <https://semopenalex.org/work/W2480493506> ?p ?o ?g. }
Showing items 1 to 79 of
79
with 100 items per page.
- W2480493506 abstract "This chapter presents a multiple constraint optimization algorithm called routing decision system (RDS) that uses the concept of preference functions to address the problem of selecting paths in core networks that satisfy traffic-oriented QoS requirements while simultaneously satisfying network resource-oriented performance goals. The original contribution lies in the use of strong scales employed for constructing a multiple criteria preference function in an affine space. The use of preference functions makes it possible for paths that match both traffic-oriented and resource-oriented goals to be selected by the algorithm. The RDS algorithm is used in conjunction with a heuristic path finding algorithm called Constraint Path Heuristic (CP-H) algorithm which is a novel approach to finding a set of constraint paths between source and destination nodes in a network. The CP-H algorithm finds multiple paths for each metric and then passes all the paths to the RDS algorithm. Simulation results showed that the CP-H/RDS algorithm has a success rate of between 93 and 96% when used in Waxman graph topologies, and is shown to be significantly better than other heuristic based algorithms under strict constraints. In addition, it is shown that the associated execution time of the CP-H/RDS algorithm is slightly higher than other heuristic based algorithms but good enough for use in an online traffic engineering (TE) application. Simulations to assess the performance of CP-H/RDS algorithm in a TE environment show that the algorithms has lower call block rates than other TE algorithms. It is also shown that the CP-H/RDS has a 96% probability of providing at least two distinct feasible backup paths in addition to the main QoS path. A framework for implementing the CP-H/RDS as a routing server is proposed. The routing decision system server (RDSS) framework is novel in that the complexity introduced by QoS awareness remains outside the network." @default.
- W2480493506 created "2016-08-23" @default.
- W2480493506 creator A5005596209 @default.
- W2480493506 creator A5055578663 @default.
- W2480493506 creator A5085358980 @default.
- W2480493506 creator A5091585522 @default.
- W2480493506 date "2010-01-01" @default.
- W2480493506 modified "2023-09-27" @default.
- W2480493506 title "Multiple Optimization of Network Carrier and Traffic Flow Goals Using a Heuristic Routing Decision System" @default.
- W2480493506 cites W1930074262 @default.
- W2480493506 cites W1975857212 @default.
- W2480493506 cites W1985282803 @default.
- W2480493506 cites W1998178253 @default.
- W2480493506 cites W2035841327 @default.
- W2480493506 cites W2056665251 @default.
- W2480493506 cites W2059797647 @default.
- W2480493506 cites W2061845328 @default.
- W2480493506 cites W2084445615 @default.
- W2480493506 cites W2105627955 @default.
- W2480493506 cites W2105808107 @default.
- W2480493506 cites W2127456145 @default.
- W2480493506 cites W2156865683 @default.
- W2480493506 doi "https://doi.org/10.4018/978-1-61520-791-6.ch007" @default.
- W2480493506 hasPublicationYear "2010" @default.
- W2480493506 type Work @default.
- W2480493506 sameAs 2480493506 @default.
- W2480493506 citedByCount "0" @default.
- W2480493506 crossrefType "book-chapter" @default.
- W2480493506 hasAuthorship W2480493506A5005596209 @default.
- W2480493506 hasAuthorship W2480493506A5055578663 @default.
- W2480493506 hasAuthorship W2480493506A5085358980 @default.
- W2480493506 hasAuthorship W2480493506A5091585522 @default.
- W2480493506 hasConcept C114809511 @default.
- W2480493506 hasConcept C126255220 @default.
- W2480493506 hasConcept C154945302 @default.
- W2480493506 hasConcept C173801870 @default.
- W2480493506 hasConcept C2524010 @default.
- W2480493506 hasConcept C31258907 @default.
- W2480493506 hasConcept C33923547 @default.
- W2480493506 hasConcept C38349280 @default.
- W2480493506 hasConcept C41008148 @default.
- W2480493506 hasConcept C74172769 @default.
- W2480493506 hasConceptScore W2480493506C114809511 @default.
- W2480493506 hasConceptScore W2480493506C126255220 @default.
- W2480493506 hasConceptScore W2480493506C154945302 @default.
- W2480493506 hasConceptScore W2480493506C173801870 @default.
- W2480493506 hasConceptScore W2480493506C2524010 @default.
- W2480493506 hasConceptScore W2480493506C31258907 @default.
- W2480493506 hasConceptScore W2480493506C33923547 @default.
- W2480493506 hasConceptScore W2480493506C38349280 @default.
- W2480493506 hasConceptScore W2480493506C41008148 @default.
- W2480493506 hasConceptScore W2480493506C74172769 @default.
- W2480493506 hasLocation W24804935061 @default.
- W2480493506 hasOpenAccess W2480493506 @default.
- W2480493506 hasPrimaryLocation W24804935061 @default.
- W2480493506 hasRelatedWork W1587280530 @default.
- W2480493506 hasRelatedWork W1963669133 @default.
- W2480493506 hasRelatedWork W1997174857 @default.
- W2480493506 hasRelatedWork W2008660757 @default.
- W2480493506 hasRelatedWork W2044269115 @default.
- W2480493506 hasRelatedWork W2088920579 @default.
- W2480493506 hasRelatedWork W2109133194 @default.
- W2480493506 hasRelatedWork W2114778474 @default.
- W2480493506 hasRelatedWork W2129626523 @default.
- W2480493506 hasRelatedWork W2153803884 @default.
- W2480493506 hasRelatedWork W2379703486 @default.
- W2480493506 hasRelatedWork W2406403585 @default.
- W2480493506 hasRelatedWork W2531962749 @default.
- W2480493506 hasRelatedWork W2625183422 @default.
- W2480493506 hasRelatedWork W2731410204 @default.
- W2480493506 hasRelatedWork W2783430681 @default.
- W2480493506 hasRelatedWork W2898365018 @default.
- W2480493506 hasRelatedWork W2960470704 @default.
- W2480493506 hasRelatedWork W3109255901 @default.
- W2480493506 hasRelatedWork W3214060373 @default.
- W2480493506 isParatext "false" @default.
- W2480493506 isRetracted "false" @default.
- W2480493506 magId "2480493506" @default.
- W2480493506 workType "book-chapter" @default.