Matches in SemOpenAlex for { <https://semopenalex.org/work/W2153776688> ?p ?o ?g. }
Showing items 1 to 86 of
86
with 100 items per page.
- W2153776688 abstract "The recent reduction in telecommunications spending has increased the importance of network planning to improve the return on investment on the existing network infrastructures. Therefore, tools that help in maximizing the bandwidth efficiency of the network at a minimum cost are essential. Previous work in this area focused on increasing bandwidth efficiency and reliability. In this work, in addition to increasing the bandwidth efficiency, we address the complexity of network management and operations. This issue is explicitly addressed by our novel framework, a simple polynomial time algorithm (SimPol) that achieves optimum network performance (in terms of congestion or bandwidth consumption) using only a small number of paths. The problem formulation is based on splittable multicommodity flows. Using SimPol we show that the total number of paths is at most k+m, where k and m are the numbers of demands and edges in the network, respectively. We extend the basic framework into an integer programming formulation to address the tradeoff between network congestion and the total number of paths. We also use SimPol to address the problem of implementing path/link policies such as bandwidth-limited paths. The performance of SimPol is evaluated through extensive simulations. Using the integer programming approach, we can get exactly one path while losing about 10% to 50% in congestion depending on the number of demands. This congestion is, however, far better than the traditional shortest path routing. The framework is general and can be used in capacity planning for transport networks such as MPLS and ATM." @default.
- W2153776688 created "2016-06-24" @default.
- W2153776688 creator A5051057723 @default.
- W2153776688 creator A5054336795 @default.
- W2153776688 creator A5074925082 @default.
- W2153776688 creator A5075598023 @default.
- W2153776688 date "2004-12-23" @default.
- W2153776688 modified "2023-09-29" @default.
- W2153776688 title "A simple polynomial time framework for reduced-path decomposition in multi-path routing" @default.
- W2153776688 cites W1948092788 @default.
- W2153776688 cites W2022191808 @default.
- W2153776688 cites W2079300367 @default.
- W2153776688 cites W2103985627 @default.
- W2153776688 cites W2105808107 @default.
- W2153776688 cites W2113144894 @default.
- W2153776688 cites W2121959042 @default.
- W2153776688 cites W2129851433 @default.
- W2153776688 cites W2132233231 @default.
- W2153776688 cites W2139054829 @default.
- W2153776688 cites W2153250951 @default.
- W2153776688 cites W2611147814 @default.
- W2153776688 cites W4322358105 @default.
- W2153776688 doi "https://doi.org/10.1109/infcom.2004.1354544" @default.
- W2153776688 hasPublicationYear "2004" @default.
- W2153776688 type Work @default.
- W2153776688 sameAs 2153776688 @default.
- W2153776688 citedByCount "13" @default.
- W2153776688 countsByYear W21537766882013 @default.
- W2153776688 countsByYear W21537766882018 @default.
- W2153776688 countsByYear W21537766882020 @default.
- W2153776688 crossrefType "proceedings-article" @default.
- W2153776688 hasAuthorship W2153776688A5051057723 @default.
- W2153776688 hasAuthorship W2153776688A5054336795 @default.
- W2153776688 hasAuthorship W2153776688A5074925082 @default.
- W2153776688 hasAuthorship W2153776688A5075598023 @default.
- W2153776688 hasConcept C11413529 @default.
- W2153776688 hasConcept C114563136 @default.
- W2153776688 hasConcept C120314980 @default.
- W2153776688 hasConcept C126255220 @default.
- W2153776688 hasConcept C129880937 @default.
- W2153776688 hasConcept C132525143 @default.
- W2153776688 hasConcept C200157131 @default.
- W2153776688 hasConcept C22590252 @default.
- W2153776688 hasConcept C2776257435 @default.
- W2153776688 hasConcept C31258907 @default.
- W2153776688 hasConcept C33923547 @default.
- W2153776688 hasConcept C41008148 @default.
- W2153776688 hasConcept C41045048 @default.
- W2153776688 hasConcept C5119721 @default.
- W2153776688 hasConcept C56086750 @default.
- W2153776688 hasConcept C74172769 @default.
- W2153776688 hasConcept C80444323 @default.
- W2153776688 hasConceptScore W2153776688C11413529 @default.
- W2153776688 hasConceptScore W2153776688C114563136 @default.
- W2153776688 hasConceptScore W2153776688C120314980 @default.
- W2153776688 hasConceptScore W2153776688C126255220 @default.
- W2153776688 hasConceptScore W2153776688C129880937 @default.
- W2153776688 hasConceptScore W2153776688C132525143 @default.
- W2153776688 hasConceptScore W2153776688C200157131 @default.
- W2153776688 hasConceptScore W2153776688C22590252 @default.
- W2153776688 hasConceptScore W2153776688C2776257435 @default.
- W2153776688 hasConceptScore W2153776688C31258907 @default.
- W2153776688 hasConceptScore W2153776688C33923547 @default.
- W2153776688 hasConceptScore W2153776688C41008148 @default.
- W2153776688 hasConceptScore W2153776688C41045048 @default.
- W2153776688 hasConceptScore W2153776688C5119721 @default.
- W2153776688 hasConceptScore W2153776688C56086750 @default.
- W2153776688 hasConceptScore W2153776688C74172769 @default.
- W2153776688 hasConceptScore W2153776688C80444323 @default.
- W2153776688 hasLocation W21537766881 @default.
- W2153776688 hasOpenAccess W2153776688 @default.
- W2153776688 hasPrimaryLocation W21537766881 @default.
- W2153776688 hasRelatedWork W1575583921 @default.
- W2153776688 hasRelatedWork W16778753 @default.
- W2153776688 hasRelatedWork W1710241493 @default.
- W2153776688 hasRelatedWork W1975333294 @default.
- W2153776688 hasRelatedWork W1983278797 @default.
- W2153776688 hasRelatedWork W2015462215 @default.
- W2153776688 hasRelatedWork W2026227395 @default.
- W2153776688 hasRelatedWork W2060546393 @default.
- W2153776688 hasRelatedWork W2158378174 @default.
- W2153776688 hasRelatedWork W2384053483 @default.
- W2153776688 isParatext "false" @default.
- W2153776688 isRetracted "false" @default.
- W2153776688 magId "2153776688" @default.
- W2153776688 workType "article" @default.