TY - GEN A1 - Hülsermann, Ralf A1 - Jäger, Monika A1 - Koster, Arie M.C.A. A1 - Orlowski, Sebastian A1 - Wessäly, Roland A1 - Zymolka, Adrian T1 - Availability and Cost Based Evaluation of Demand-wise Shared Protection N2 - In this paper, we investigate the connection availabilities for the new protection scheme Demand-wise Shared Protection (DSP) and describe an appropriate approach for their computation. The exemplary case study on two realistic network scenarios shows that in most cases the availabilities for DSP are comparable with that for 1+1 path protection and better than in case of shared path protection. T3 - ZIB-Report - 06-15 KW - demand-wise shared protection KW - network availability KW - network optimization Y1 - 2006 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-9080 ER - TY - GEN A1 - Hülsermann, Ralf A1 - Jäger, Monika A1 - Krumke, Sven A1 - Poensgen, Diana A1 - Rambau, Jörg A1 - Tuchscherer, Andreas T1 - Dynamic Routing Algorithms in Transparent Optical Networks An Experimental Study Based on Real Data N2 - Today's telecommunication networks are configured statically. Whenever a connection is established, the customer has permanent access to it. However, it is observed that usually the connection is not used continuously. At this point, dynamic provisioning could increase the utilization of network resources. WDM based Optical Transport Networks (OTNs) will shortly allow for fast dynamic network reconfiguration. This enables optical broadband leased line services on demand. Since service requests competing for network resources may lead to service blocking, it is vital to use appropriate strategies for routing and wavelength assignment in transparent optical networks. We simulate the service blocking probabilities of various dynamic algorithms for this problem using a well-founded traffic model for two realistic networks. One of the algorithms using shortest path routings performs best on all instances. Surprisingly, the tie-breaking rule between equally short paths in different wavelengths decides between success or failure. T3 - ZIB-Report - 02-35 KW - Dynamic Network Configuration KW - Routing and Wavelength Allocation KW - Transparent Optical Networks KW - Blocking Probability KW - Simulation Y1 - 2002 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7025 ER - TY - GEN A1 - Koster, Arie M.C.A. A1 - Zymolka, Adrian A1 - Jäger, Monika A1 - Hülsermann, Ralf A1 - Gerlach, Christoph T1 - Demand-wise Shared Protection for Meshed Optical Networks N2 - In this paper, a new shared protection mechanism for meshed optical networks is presented. Significant network design cost reductions can be achieved in comparison to the well-known 1+1 protection scheme. Demand-wise Shared Protection (DSP) bases on the diversification of demand routings and exploits the network connectivity to restrict the number of backup lightpaths needed to provide the desired level of prorection. Computational experiments approve the benefits of the concept DSP for cost efficient optical network designs. T3 - ZIB-Report - 03-24 KW - optical network design KW - shared protection KW - meshed optical networks KW - diversification Y1 - 2003 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-7461 ER - TY - CHAP A1 - Hülsermann, Ralf A1 - Jäger, Monika A1 - Poensgen, Diana A1 - Krumke, Sven A1 - Rambau, Jörg A1 - Tuchscherer, Andreas ED - Cinkler, Tibor ED - Jakab, Tivadar ED - Tapolcai, Jànos ED - Gàspàr, Csaba T1 - Dynamic routing algorithms in transparent optical networks T2 - Proceedings of the 7th IFIP Working Conference on Optical Network Design & Modelling (ONDM 2003) Y1 - 2003 UR - http://opus.kobv.de/zib/volltexte/2002/703/ SP - 293 EP - 312 PB - Kluwer Academic Press ER -