Sciweavers

88 search results - page 17 / 18
» Inapproximability Results for Wavelength Assignment in WDM O...
Sort
View
CISS
2008
IEEE
14 years 1 months ago
Distributed algorithm and reversible network
Motivated to design a feasible optical network architecture for the future Internet, we address the question of scheduling (wavelength assignment) in an optical network. The key ch...
Shreevatsa Rajagopalan, Devavrat Shah
MICRO
2002
IEEE
156views Hardware» more  MICRO 2002»
13 years 6 months ago
TCP Switching: Exposing Circuits to IP
There has been much discussion about the best way to combine the benefits of new optical circuit switching technology with the established packet switched Internet. In this paper,...
Pablo Molinero-Fernández, Nick McKeown
INFOCOM
2009
IEEE
14 years 1 months ago
CFP: Cooperative Fast Protection
—We introduce a novel protection scheme, called Cooperative Fast Protection (CFP), to fight against a single link failure in survivable WDM (Wavelength Division Multiplexing) mes...
Bin Wu, Pin-Han Ho, Kwan L. Yeung, János Ta...
BROADNETS
2007
IEEE
13 years 8 months ago
Connection provisioning in QoT-guaranteed distributed all-optical networks
— As an optical signal propagates along a lightpath to its destination in wavelength-routed optical networks (WRONs), the quality of transmission (QoT) is degraded by transmissio...
Jun He, Maïté Brandt-Pearce, Suresh Su...
JSAC
2006
157views more  JSAC 2006»
13 years 7 months ago
Traffic grooming in path, star, and tree networks: complexity, bounds, and algorithms
We consider the problem of traffic grooming in WDM path, star, and tree networks. Traffic grooming is a variant of the well-known logical topology design, and is concerned with the...
Shu Huang, Rudra Dutta, George N. Rouskas