Monday, 19 September, 2011
14:30 -- 16:15
Room K

Mo.1.K • Optical Network Design

Chair: Achim Autenrieth; ADVA AG Optical Networking, Germany
 
Mo.1.K.1 • 14:30 (Tutorial)
ISSUES AND CHALLENGES IN OPTICAL NETWORK DESIGN
Biswanath Mukherjee1; 1Computer Science, University of California, Davis, USA.
This Tutorial  will clarify traffic engineering (“put the traffic where the bandwidth is”) vs. network engineering (“put the bandwidth where the traffic is”) vs. network planning (“put the bandwidth where the traffic is forecasted to be”). It will cover important and emerging R&D problems on not only (long-term) network planning, but also network engineering to accommodate traffic growth. Sample problems include mixed-line-rate (MLR) networks for backbone networks (e.g., with the advent of 100G systems, should they be put everywhere? or should 10G/40G/100G systems be judiciously deployed?); cost-effective and non-disruptive upgrade of passive optical networks (PONs) for access networks; etc.
 
Mo.1.K.2 • 15:30
DIGITAL VS. ALL-OPTICAL NETWORKING IN PACKET-OPTICAL INTEGRATED TRANSPORT: A LIFECYCLE COST-BENEFIT ANALYSIS
Paola Iovanna1, Roberto Sabella1, Francesco Testa1, Patrizia Testa2, Angelo Germoni2, Mauro R. Casanova2; 1Ericsson, Italy; 2Co.Ri.TeL., Italy.
 A cost-benefit analysis of packet optical network approaches based on digital and all-optical ROADM respectively was performed. Cost, power consumption and flexibility with respect to different traffic distributions and loads have been compared.
 
Mo.1.K.3 • 15:45
ROUTING AND SPECTRUM ASSIGNMENT ALGORITHM MAXIMIZES SPECTRUM UTILIZATION IN OPTICAL NETWORKS
Yoshiaki Sone1, Akira Hirano1, Akihiro Kadohata1, Masahiko Jinno1, Osamu Ishida1; 1NTT Network Innovation Laboratories, NTT Corporation, Japan.
 This paper proposes a routing and spectrum assignment algorithm for elastic optical networks. The algorithm achieves high utilization of spectrum resources by considering the consecutiveness of common available spectrum slots among relevant fibers.
 
Mo.1.K.4 • 16:00
EFFICIENT NODE-DISJOINT PATHS SEARCH IN WDM NETWORKS WITH ASYMMETRIC NODES
Tomohiro Hashiguchi1, Yi Zhu2, Jason P. Jue2; 1Fujitsu Laboratories, Japan; 2The University of Texas at Dallas, USA.
 We present an efficient node-disjoint paths search method considering asymmetric nodes. Through simulation results, we show that the proposed method significantly improves the success rate of path search.

Back