18 search results - page 2 / 4 » Cost Effective Traffic Grooming in WDM Rings |
LCN
2006
IEEE
14 years 8 days ago
2006
IEEE
SIAMDM
2010
13 years 4 months ago
2010
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-...
LCN
2008
IEEE
14 years 20 days ago
2008
IEEE
—In this paper we address the problem of traffic grooming in WDM rings with all-to-all and its generalization to many-to-many service by using network coding. We consider minimi...
TON
2010
13 years 29 days ago
2010
A large number of network applications today allow several users to interact together using the many-to-many service mode. In many-to-many communication, also referred to as group ...
NETWORKS
2008
13 years 6 months ago
2008
Minimizing the number of add-drop multiplexers (ADMs) in a unidirectional SONET ring can be formulated as a graph decomposition problem. When traffic requirements are uniform and ...