FRINK Linked Data Fragments server

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

• W137238247 abstract "Many technologies exist to improve the network communications capabilities that are available to users. Gigabit bitrates, low propagation latency, and low error rates are among the bandwidth enhancements provided by optical networks. By spatially partitioning the fiber bandwidth into distinct parallel optical channels, wavelength division multiplexing (WDM) enables the efficient use of optical resources. By combining WDM with passive or active wavelength selective switches, a variety of wavelength-routing network topologies may be realized.This dissertation first addresses the computational complexity of finding the optimal number of wavelengths for tree and mesh network topologies. The problem of determining the optimal number of wavelengths needed for any set of connection requests on directed rectangular meshes that use arbitrary routing is considered in detail. This problem is shown to be NP-complete, leading to the conclusion that approximation algorithms achieving constant bounded performance for this problem do not exist.Attention is then focused on the important problem of finding algorithms for wavelength assignment on several industrially relevant topologies. Optimal algorithms for undirected trees and directed stars are developed, and hypergraph theory is used to define a class of communication requests on directed trees that results in a 3/2 optimal approximation algorithm. A twice-optimal approximation algorithm for wavelength assignment in directed meshes is given, with some restrictions on path adjacency. An algorithm for 12/7 optimal wavelength assignment for all-to-all gossiping, a data distribution technique that is of interest to parallel algorithm designers, on square meshes using row-column routing is developed and analyzed. Results on bounded resource allocation are also demonstrated for all-to-all gossiping on square meshes.Finally, the applied problem of transferring files in optical networks is examined. Lower bounds for the lengths of transfer schedules are found, and it is shown that calculating the optimal schedule is NP-complete. Approximation algorithms for scheduling 2-hop file transfers are developed under various network topologies. The techniques used for these algorithms are applied to the WAP. Assignment algorithms that perform to within $Lsb{max}+1$ and $3Lsb{max}/2$ are then developed for unique and non-unique connection requests, respectively.The computational complexity results presented in this dissertation contribute to the theoretical foundations of the emerging advanced technology of wavelength-routing WDM networking and extend previous results on wavelength assignment. The algorithms, both optimal and approximation, provide critical components for the control and management of important network topologies and improve existing results in routing and wavelength assignment." @default.
• W137238247 created "2016-06-24" @default.
• W137238247 creator A5004842043 @default.
• W137238247 creator A5033244316 @default.
• W137238247 date "1998-01-01" @default.
• W137238247 modified "2023-09-26" @default.
• W137238247 title "Routing and wavelength assignment in all-optical wdm wavelength-routing networks" @default.
• W137238247 hasPublicationYear "1998" @default.
• W137238247 type Work @default.
• W137238247 sameAs 137238247 @default.
• W137238247 citedByCount "2" @default.
• W137238247 crossrefType "journal-article" @default.
• W137238247 hasAuthorship W137238247A5004842043 @default.
• W137238247 hasAuthorship W137238247A5033244316 @default.
• W137238247 hasConcept C104954878 @default.
• W137238247 hasConcept C11413529 @default.
• W137238247 hasConcept C114614502 @default.
• W137238247 hasConcept C120314980 @default.
• W137238247 hasConcept C120665830 @default.
• W137238247 hasConcept C121332964 @default.
• W137238247 hasConcept C121684516 @default.
• W137238247 hasConcept C160724564 @default.
• W137238247 hasConcept C184720557 @default.
• W137238247 hasConcept C199845137 @default.
• W137238247 hasConcept C204948658 @default.
• W137238247 hasConcept C2778249599 @default.
• W137238247 hasConcept C31258907 @default.
• W137238247 hasConcept C31487907 @default.
• W137238247 hasConcept C33923547 @default.
• W137238247 hasConcept C41008148 @default.
• W137238247 hasConcept C6260449 @default.
• W137238247 hasConcept C74172769 @default.
• W137238247 hasConceptScore W137238247C104954878 @default.
• W137238247 hasConceptScore W137238247C11413529 @default.
• W137238247 hasConceptScore W137238247C114614502 @default.
• W137238247 hasConceptScore W137238247C120314980 @default.
• W137238247 hasConceptScore W137238247C120665830 @default.
• W137238247 hasConceptScore W137238247C121332964 @default.
• W137238247 hasConceptScore W137238247C121684516 @default.
• W137238247 hasConceptScore W137238247C160724564 @default.
• W137238247 hasConceptScore W137238247C184720557 @default.
• W137238247 hasConceptScore W137238247C199845137 @default.
• W137238247 hasConceptScore W137238247C204948658 @default.
• W137238247 hasConceptScore W137238247C2778249599 @default.
• W137238247 hasConceptScore W137238247C31258907 @default.
• W137238247 hasConceptScore W137238247C31487907 @default.
• W137238247 hasConceptScore W137238247C33923547 @default.
• W137238247 hasConceptScore W137238247C41008148 @default.
• W137238247 hasConceptScore W137238247C6260449 @default.
• W137238247 hasConceptScore W137238247C74172769 @default.
• W137238247 hasLocation W1372382471 @default.
• W137238247 hasOpenAccess W137238247 @default.
• W137238247 hasPrimaryLocation W1372382471 @default.
• W137238247 hasRelatedWork W1521782241 @default.
• W137238247 hasRelatedWork W1784378569 @default.
• W137238247 hasRelatedWork W1838176126 @default.
• W137238247 hasRelatedWork W1888155880 @default.
• W137238247 hasRelatedWork W1946648302 @default.
• W137238247 hasRelatedWork W1972505134 @default.
• W137238247 hasRelatedWork W1987147624 @default.
• W137238247 hasRelatedWork W1994701838 @default.
• W137238247 hasRelatedWork W2018754586 @default.
• W137238247 hasRelatedWork W2117909919 @default.
• W137238247 hasRelatedWork W2119897320 @default.
• W137238247 hasRelatedWork W2124387841 @default.
• W137238247 hasRelatedWork W2125136570 @default.
• W137238247 hasRelatedWork W2137330318 @default.
• W137238247 hasRelatedWork W2141013934 @default.
• W137238247 hasRelatedWork W2168338332 @default.
• W137238247 hasRelatedWork W2414330978 @default.
• W137238247 hasRelatedWork W2896406202 @default.
• W137238247 hasRelatedWork W51427855 @default.
• W137238247 hasRelatedWork W875398268 @default.
• W137238247 isParatext "false" @default.
• W137238247 isRetracted "false" @default.
• W137238247 magId "137238247" @default.
• W137238247 workType "article" @default.