Matches in SemOpenAlex for { <https://semopenalex.org/work/W2285479007> ?p ?o ?g. }
Showing items 1 to 63 of
63
with 100 items per page.
- W2285479007 endingPage "21" @default.
- W2285479007 startingPage "21" @default.
- W2285479007 abstract "Computer network routing is a very important and interesting optimization problem. Many different routing algorithms have been used over the years on the Internet, often with unexpected problems.Dynamic systems, i.e. systems that change over time, can be optimized statically with a fixed solution that corresponds to some average system state, or dynamically where the solution tries to follow the system change over time. It is a normal expectation that dynamic optimization has to give better results than a static one. Dynamic optimization is more complex, requires more computation, more advanced methods, but is superior to static optimization because it can always be transformed to the static case simply by neglecting change of the system in time and selecting a single state as a representative. However, that expectation that dynamic optimization gives better results than static one applies only to the perfect dynamic optimization, which is impossible in practice. It takes some time to collect information about the system current state, and optimization is always done with that obsolete information. This situation is examined on computer network routing.By complete mathematical analysis of a simple network, we show that dynamic routing gives better results than static, as expected, but that the margin is much smaller then intuitively expected. Further analysis shows that minor advantage can easily be lost if there is even a small error in the dynamic routing tables, and actually dynamic routing can easily become worse than static. It takes time to collect information about network traffic. By the time routing tables are calculated, they are already obsolete; they are about some previous condition on the network, not the current one. Quantitative analysis shows that delays in building routing tables can affect dynamic routing performance unexpectedly strongly. This leads to the qualitative recommendation: Trying to optimize too hard will make things worse. Dynamic routing should not try to adapt to traffic changes very fast. This hypothesis is accepted today and implemented in routing algorithms." @default.
- W2285479007 created "2016-06-24" @default.
- W2285479007 creator A5067245090 @default.
- W2285479007 date "2009-02-21" @default.
- W2285479007 modified "2023-09-28" @default.
- W2285479007 title "Plenary lecture 6: relation between static and dynamic optimization in computer network routing" @default.
- W2285479007 hasPublicationYear "2009" @default.
- W2285479007 type Work @default.
- W2285479007 sameAs 2285479007 @default.
- W2285479007 citedByCount "0" @default.
- W2285479007 crossrefType "proceedings-article" @default.
- W2285479007 hasAuthorship W2285479007A5067245090 @default.
- W2285479007 hasConcept C104954878 @default.
- W2285479007 hasConcept C11413529 @default.
- W2285479007 hasConcept C120314980 @default.
- W2285479007 hasConcept C126255220 @default.
- W2285479007 hasConcept C184896649 @default.
- W2285479007 hasConcept C204948658 @default.
- W2285479007 hasConcept C31258907 @default.
- W2285479007 hasConcept C33923547 @default.
- W2285479007 hasConcept C41008148 @default.
- W2285479007 hasConcept C45374587 @default.
- W2285479007 hasConcept C74172769 @default.
- W2285479007 hasConceptScore W2285479007C104954878 @default.
- W2285479007 hasConceptScore W2285479007C11413529 @default.
- W2285479007 hasConceptScore W2285479007C120314980 @default.
- W2285479007 hasConceptScore W2285479007C126255220 @default.
- W2285479007 hasConceptScore W2285479007C184896649 @default.
- W2285479007 hasConceptScore W2285479007C204948658 @default.
- W2285479007 hasConceptScore W2285479007C31258907 @default.
- W2285479007 hasConceptScore W2285479007C33923547 @default.
- W2285479007 hasConceptScore W2285479007C41008148 @default.
- W2285479007 hasConceptScore W2285479007C45374587 @default.
- W2285479007 hasConceptScore W2285479007C74172769 @default.
- W2285479007 hasLocation W22854790071 @default.
- W2285479007 hasOpenAccess W2285479007 @default.
- W2285479007 hasPrimaryLocation W22854790071 @default.
- W2285479007 hasRelatedWork W120125775 @default.
- W2285479007 hasRelatedWork W1488661425 @default.
- W2285479007 hasRelatedWork W1950625 @default.
- W2285479007 hasRelatedWork W2010545679 @default.
- W2285479007 hasRelatedWork W202553942 @default.
- W2285479007 hasRelatedWork W2104406287 @default.
- W2285479007 hasRelatedWork W2203308532 @default.
- W2285479007 hasRelatedWork W2204609559 @default.
- W2285479007 hasRelatedWork W2399347916 @default.
- W2285479007 hasRelatedWork W2485595209 @default.
- W2285479007 hasRelatedWork W2557129798 @default.
- W2285479007 hasRelatedWork W2735428877 @default.
- W2285479007 hasRelatedWork W2737685880 @default.
- W2285479007 hasRelatedWork W2790487556 @default.
- W2285479007 hasRelatedWork W2949215333 @default.
- W2285479007 hasRelatedWork W2963879866 @default.
- W2285479007 hasRelatedWork W3194869330 @default.
- W2285479007 hasRelatedWork W585854255 @default.
- W2285479007 hasRelatedWork W1819052642 @default.
- W2285479007 hasRelatedWork W2485532461 @default.
- W2285479007 isParatext "false" @default.
- W2285479007 isRetracted "false" @default.
- W2285479007 magId "2285479007" @default.
- W2285479007 workType "article" @default.