Referenced Items are not available for this document.
We are trying to study the traffic grooming problem by minimizing overall network cost that includes the transceivers required as well as the number of wavelengths. A mathematical formulation of the traffic grooming problem in mesh networks is proposed. We also describe a heuristic using blocking island (BI) paradigm. Simulations have been carried out to prove effectiveness of our heuristic.
Published in:
Global Telecommunications Conference, 2002. GLOBECOM '02. IEEE
(Volume:3
)
Date of Conference: 17-21 Nov. 2002
- Page(s):
- 2711 - 2715 vol.3
- Print ISBN:
- 0-7803-7632-3
- INSPEC Accession Number:
- 7785947
- Digital Object Identifier :
- 10.1109/GLOCOM.2002.1189122
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
