CORE
🇺🇦
make metadata, not war
Services
Services overview
Explore all CORE services
Access to raw data
API
Dataset
FastSync
Content discovery
Recommender
Discovery
OAI identifiers
OAI Resolver
Managing content
Dashboard
Bespoke contracts
Consultancy services
Support us
Support us
Membership
Sponsorship
Community governance
Advisory Board
Board of supporters
Research network
About
About us
Our mission
Team
Blog
FAQs
Contact us
Optimal Traffic Grooming In Wdm Mesh Networks Under Dynamic Traffic
Authors
Mostafa A. Bassiouni
Mounire El Houmaidi
Guifang Li
Publication date
1 January 2004
Publisher
'Information Bulletin on Variable Stars (IBVS)'
Abstract
We consider the sparse placement of grooming-nodes in WDM mesh networks under dynamic traffic. We formulate the problem as a weighted minimum dominating set of graphs; and compare our scheme, via simulation, to known heuristics. © 2003 Optical Society of America
Similar works
Full text
Available Versions
University of Central Florida (UCF): STARS (Showcase of Text, Archives, Research & Scholarship)
See this paper in CORE
Go to the repository landing page
Download from data provider
oai:stars.library.ucf.edu:scop...
Last time updated on 18/10/2022