TY - THES A1 - Heinz, Stefan T1 - Policies for Online Target Date Assignment Problems: Competitive Analysis versus Expected Performance Y1 - 2005 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-9933 ER - TY - THES A1 - Tuchscherer, Andreas T1 - Dynamical Configuration of Transparent Optical Telecommunication Networks N2 - All-optical telecommunication networks allow for switching connections by lightpaths which can pass several network links without any opto-electronic conversion. Upon arrival of a connection request, it must be decided online, i.e., without knowledge of future requests, if it is accepted and in that case on which lightpaths the connection is routed. This online problem with the goal of maximizing the total profit gained by accepted requests is called Dynamic Singleclass Call Admission Problem (DSCA). We present existing and new algorithms for the DSCA as well as their theoretical and practical evaluation. KW - Online-Optimierung KW - Online Optimization Y1 - 2003 U6 - http://nbn-resolving.de/urn/resolver.pl?urn:nbn:de:0297-zib-10214 ER -