Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

106

Voted

INFOCOM
1998
IEEE

135views Communications» more INFOCOM 1998»

Cost Effective Traffic Grooming in WDM Rings

15 years 7 months ago

Cost Effective Traffic Grooming in WDM Rings

Download www.utdallas.edu

We provide network designs for optical add

Ornan Ori Gerstel, Rajiv Ramaswami, Galen H. Sasak

Real-time Traffic

Communications | INFOCOM 1998 | Network Cost | OADM Ring Networks | Overall Network Cost |

claim paper

Related Content

» Costeffective singlehub WDM ring networks A proposal and analysis

» Traffic Grooming in WDM Ring Networks with the MinMax Objective

» Traffic grooming in path star and tree networks complexity bounds and algorithms

» Approximation Algorithms for Traffic Grooming in WDM Rings

» Delay Constrained Traffic Grooming in WDM Ring Networks

» Drop Cost and Wavelength Optimal TwoPeriod Grooming with Ratio 4

» Reducing network cost of manytomany communication in unidirectional WDM rings with network...

» Design and Provisioning of WDM Networks With ManytoMany Traffic Grooming

» Grooming for twoperiod optical networks

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1998
Where	INFOCOM
Authors	Ornan Ori Gerstel, Rajiv Ramaswami, Galen H. Sasaki

Comments (0)