On-line competitive algorithms for call admission in optical networks

作     者：Awerbuch, B Azar, Y Fiat, A Leonardi, S Rosén, A 

作者机构：Johns Hopkins Univ Baltimore MD 21218 USA MIT Comp Sci Lab Cambridge MA 02139 USA Univ Roma La Sapienza Dipartimento Informat Sistemist I-00198 Rome Italy Univ Toronto Dept Comp Sci Toronto ON M5S 1A4 Canada 

出 版 物：《ALGORITHMICA》 (算法)

年 卷 期：2001年第31卷第1期

页      面：29-43页

核心收录：

学科分类：08[工学] 0835[工学-软件工程] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：on-line algorithms competitive analysis optical networks 

摘      要：We study the on-line call admission problem in optical networks. We present a general technique that allows us to reduce the problem of call admission and wavelength selection to the call admission problem. We then give randomized algorithms with logarithmic competitive ratios for specific topologies in switchless and reconfigurable optical networks. We conclude by considering full duplex communications.