Return to search

An Efficient Hierarchical Optical Path Network Design Algorithm based on a Traffic Demand Expression in a Cartesian Product Space

No description available.
Identiferoai:union.ndltd.org:NAGOYA/oai:ir.nul.nagoya-u.ac.jp:2237/12078
Date08 1900
CreatorsYagyu, Isao, Hasegawa, Hiroshi, Sato, Ken-ichi
PublisherIEEE
Source SetsNagoya University
LanguageEnglish
Detected LanguageEnglish
TypeArticle(publisher)
RightsCopyright © 2008 IEEE. Reprinted from Selected Areas in Communications. v.26, n.6, Supplement, 2008, p. 22-31. This material is posted here with permission of the IEEE. Such permission of the IEEE does not in any way imply IEEE endorsement of any of Nagoya University’s products or services. Internal or personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution must be obtained from the IEEE by writing to pubs-permissions@ieee.org.

Page generated in 0.007 seconds