On-Line Competitive Algorithms for Call Admission in Optical Networks

被引：0

作者：

B. Awerbuch

Y. Azar

A. Fiat

S. Leonardi

A. Rosén

机构：

[1] Johns Hopkins University,

[2] Baltimore,undefined

[3] MD 21218,undefined

[4] USA,undefined

[5] and Laboratory for Computer Science,undefined

[6] MIT,undefined

[7] Cambridge,undefined

[8] MA 02139,undefined

[9] USA. baruch@cs.jhu.edu.,undefined

[10] Department of Computer Science,undefined

[11] Tel-Aviv University,undefined

[12] Ramat Aviv 69 928,undefined

[13] Israel. \{azar,undefined

[14] fiat\}@math.tau.ac.il.,undefined

[15] Dipartimento di Informatica Sistemistica,undefined

[16] Università di Roma ``La Sapienza'',undefined

[17] via Salaria 113,undefined

[18] 00198-Roma,undefined

[19] Italia. leon@dis.uniroma1.it.,undefined

[20] Department of Computer Science,undefined

[21] University of Toronto,undefined

[22] Toronto,undefined

[23] Ontario,undefined

[24] Canada M5S 1A4. adiro@cs. toronto.edu.,undefined

来源：

Algorithmica | 2001年 / 31卷

关键词：

Key words. On-line algorithms, Competitive analysis, Optical networks.;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

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.

引用

页码：29 / 43

页数：14

共 50 条

[1] On-line competitive algorithms for call admission in optical networks
Awerbuch, B
Azar, Y
Fiat, A
Leonardi, S
Rosén, A
[J]. ALGORITHMICA, 2001, 31 (01) : 29 - 43
[2] Simple on-line algorithms for call control in cellular networks
Caragiannis, I
Kaklamanis, C
Papaioannou, E
[J]. APPROXIMATION AND ONLINE ALGORITHMS, 2004, 2909 : 67 - 80
[3] On-line measurement of QoS for call admission control
Siler, M
Walrand, J
[J]. 1998 SIXTH INTERNATIONAL WORKSHOP ON QUALITY OF SERVICE (IWQOS '98), 1998, : 39 - 48
[4] Efficient on-line call control algorithms
Garay, JA
Gopal, IS
Kutten, S
Mansour, Y
Yung, M
[J]. JOURNAL OF ALGORITHMS, 1997, 23 (01) : 180 - 194
[5] Competitive algorithms for the on-line traveling salesman
Ausiello, G
Feuerstein, E
Leonardi, S
Stougie, L
Talamo, M
[J]. ALGORITHMS AND DATA STRUCTURES, 1995, 955 : 206 - 217
[6] Genetic algorithms and call admission to telecommunications networks
Rose, C
Yates, RD
[J]. COMPUTERS & OPERATIONS RESEARCH, 1996, 23 (05) : 485 - 499
[7] Competitive on-line algorithms for distributed data management
Lund, C
Reingold, N
Westbrook, J
Yan, D
[J]. SIAM JOURNAL ON COMPUTING, 1999, 28 (03) : 1086 - 1111
[8] Competitive analysis of on-line stream merging algorithms
Chan, WT
Lam, TW
Ting, HF
Wong, PWH
[J]. MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002, 2002, 2420 : 188 - 200
[9] Scheduling for on-line taxi problem on a real line and competitive algorithms
Xin, CL
Ma, WM
[J]. PROCEEDINGS OF THE 2004 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2004, : 3078 - 3083
[10] Efficient algorithms for on-line communication in optical WDM networks (preliminary version)
Shen, H
Sum, J
Young, GHF
Horiguchi, S
[J]. PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-V, 2000, : 931 - 937

← 1 2 3 4 5 →