Matches in SemOpenAlex for { <https://semopenalex.org/work/W2067366494> ?p ?o ?g. }
Showing items 1 to 87 of
87
with 100 items per page.
- W2067366494 endingPage "886" @default.
- W2067366494 startingPage "877" @default.
- W2067366494 abstract "In SONET/WDM networks, a high-speed wavelength channel is usually shared by multiple low-rate traffic demands to make efficient use of the wavelength capacity. The multiplexing is known as traffic grooming and performed by SONET Add-Drop Multiplexers (SADM). The maximum number of low-rate traffic demands that can be multiplexed into one wavelength channel is called grooming factor. Since SADMs are expensive, a key optimization goal of traffic grooming is to minimize the total number of SADMs in order to satisfy a given set of traffic demands. As an important communication traffic pattern, all-to-all traffic has been widely studied for the traffic grooming problem. In this paper, we study the regular traffic pattern, which is considered as a generalization of the all-to-all traffic pattern. We focus on the Unidirectional Path-Switched Ring (UPSR) networks. We prove that the traffic grooming problem is NP-hard for the regular traffic pattern in UPSR networks, and show that the problem does not admit a Fully Polynomial Time Approximation Scheme (FPTAS). We further prove that the problem remains NP-hard even if the grooming factor is any fixed value chosen from a subset of integers. We also propose a performance guaranteed algorithm to minimize the total number of required SADMs, and show that the algorithm achieves a better upper bound than previous algorithms. Extensive simulations are conducted, and the empirical results validate that our algorithm outperforms the previous ones in most cases. In addition, our algorithm always uses the minimum number of wavelengths, which are precious resources as well in optical networks." @default.
- W2067366494 created "2016-06-24" @default.
- W2067366494 creator A5048487384 @default.
- W2067366494 creator A5077112915 @default.
- W2067366494 date "2008-06-01" @default.
- W2067366494 modified "2023-09-26" @default.
- W2067366494 title "On the complexity and algorithm of grooming regular traffic in WDM optical networks" @default.
- W2067366494 cites W2001550030 @default.
- W2067366494 cites W2025002731 @default.
- W2067366494 cites W2042269609 @default.
- W2067366494 cites W2059936808 @default.
- W2067366494 cites W2100266001 @default.
- W2067366494 cites W2103213096 @default.
- W2067366494 cites W2103590164 @default.
- W2067366494 cites W2104129530 @default.
- W2067366494 cites W2114465585 @default.
- W2067366494 cites W2115755077 @default.
- W2067366494 cites W2118377672 @default.
- W2067366494 cites W2139721783 @default.
- W2067366494 cites W2157264680 @default.
- W2067366494 doi "https://doi.org/10.1016/j.jpdc.2008.01.001" @default.
- W2067366494 hasPublicationYear "2008" @default.
- W2067366494 type Work @default.
- W2067366494 sameAs 2067366494 @default.
- W2067366494 citedByCount "11" @default.
- W2067366494 countsByYear W20673664942012 @default.
- W2067366494 countsByYear W20673664942014 @default.
- W2067366494 countsByYear W20673664942015 @default.
- W2067366494 countsByYear W20673664942020 @default.
- W2067366494 crossrefType "journal-article" @default.
- W2067366494 hasAuthorship W2067366494A5048487384 @default.
- W2067366494 hasAuthorship W2067366494A5077112915 @default.
- W2067366494 hasConcept C11413529 @default.
- W2067366494 hasConcept C121332964 @default.
- W2067366494 hasConcept C127162648 @default.
- W2067366494 hasConcept C134306372 @default.
- W2067366494 hasConcept C160724564 @default.
- W2067366494 hasConcept C162396882 @default.
- W2067366494 hasConcept C19275194 @default.
- W2067366494 hasConcept C198306430 @default.
- W2067366494 hasConcept C311688 @default.
- W2067366494 hasConcept C31258907 @default.
- W2067366494 hasConcept C33923547 @default.
- W2067366494 hasConcept C41008148 @default.
- W2067366494 hasConcept C49040817 @default.
- W2067366494 hasConcept C6260449 @default.
- W2067366494 hasConcept C70970002 @default.
- W2067366494 hasConcept C76155785 @default.
- W2067366494 hasConcept C77553402 @default.
- W2067366494 hasConceptScore W2067366494C11413529 @default.
- W2067366494 hasConceptScore W2067366494C121332964 @default.
- W2067366494 hasConceptScore W2067366494C127162648 @default.
- W2067366494 hasConceptScore W2067366494C134306372 @default.
- W2067366494 hasConceptScore W2067366494C160724564 @default.
- W2067366494 hasConceptScore W2067366494C162396882 @default.
- W2067366494 hasConceptScore W2067366494C19275194 @default.
- W2067366494 hasConceptScore W2067366494C198306430 @default.
- W2067366494 hasConceptScore W2067366494C311688 @default.
- W2067366494 hasConceptScore W2067366494C31258907 @default.
- W2067366494 hasConceptScore W2067366494C33923547 @default.
- W2067366494 hasConceptScore W2067366494C41008148 @default.
- W2067366494 hasConceptScore W2067366494C49040817 @default.
- W2067366494 hasConceptScore W2067366494C6260449 @default.
- W2067366494 hasConceptScore W2067366494C70970002 @default.
- W2067366494 hasConceptScore W2067366494C76155785 @default.
- W2067366494 hasConceptScore W2067366494C77553402 @default.
- W2067366494 hasIssue "6" @default.
- W2067366494 hasLocation W20673664941 @default.
- W2067366494 hasOpenAccess W2067366494 @default.
- W2067366494 hasPrimaryLocation W20673664941 @default.
- W2067366494 hasRelatedWork W1985759753 @default.
- W2067366494 hasRelatedWork W1989331140 @default.
- W2067366494 hasRelatedWork W2001413807 @default.
- W2067366494 hasRelatedWork W2034152443 @default.
- W2067366494 hasRelatedWork W2082260401 @default.
- W2067366494 hasRelatedWork W2107665243 @default.
- W2067366494 hasRelatedWork W2110904858 @default.
- W2067366494 hasRelatedWork W2134953981 @default.
- W2067366494 hasRelatedWork W2144977442 @default.
- W2067366494 hasRelatedWork W2168688921 @default.
- W2067366494 hasVolume "68" @default.
- W2067366494 isParatext "false" @default.
- W2067366494 isRetracted "false" @default.
- W2067366494 magId "2067366494" @default.
- W2067366494 workType "article" @default.