Why should we pay more for layout designers?

被引：0

作者：

Khan, SU ^{[1
]}

机构：

[1] Univ Texas, Dept Comp Sci & Engn, Arlington, TX 76019 USA

来源：

PHOTONIC DEVICES AND ALGORITHMS FOR COMPUTING V | 2003年 / 5201卷

关键词：

optical access network; optimization; network layout;

D O I：

10.1117/12.505264

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we discuss the Passive Optical Network deployment on an arbitrary grid with guaranteed tolerance towards p - 1 equipment failure. We show that this problem in general is NP-hard. We propose an algorithm, which guarantees a solution of 4-approximation to the optimal deployment, and further argue that this is the best lower bound achievable in our case. We do comparative studies with randomized layouts, were our proposed algorithm saves 45%-55% deployment cost (fiber, equipment, etc) on average.

引用

页码：108 / 116

页数：9

共 9 条

[1] A PON system suitable for internetworking optical network units using a fiber Bragg grating on the feeder fiber [J].

Chae, CJ ;

Lee, ST ;

Kim, GY ;

Park, H .

IEEE PHOTONICS TECHNOLOGY LETTERS, 1999, 11 (12) :1686-1688

[2] An ATM PON system overlaid with a 155-Mb/s optical star network for customer networking and fiber to the premises [J].

Chae, CJ ;

Park, H ;

Eom, JH .

IEEE PHOTONICS TECHNOLOGY LETTERS, 2001, 13 (10) :1133-1135

[3] Advances in broadband passive optical networking technologies [J].

Effenberger, FJ ;

Ichibangase, H ;

Yamashita, H .

IEEE COMMUNICATIONS MAGAZINE, 2001, 39 (12) :118-124

[4] A UNIFIED APPROACH TO APPROXIMATION ALGORITHMS FOR BOTTLENECK PROBLEMS [J].

HOCHBAUM, DS ;

SHMOYS, DB .

JOURNAL OF THE ACM, 1986, 33 (03) :533-550

[5] ON APPROXIMATING THE MINIMUM INDEPENDENT DOMINATING SET [J].

IRVING, RW .

INFORMATION PROCESSING LETTERS, 1991, 37 (04) :197-200

[6] Driving fiber to the home [J].

Kettler, D ;

Kafka, H ;

Spears, D .

IEEE COMMUNICATIONS MAGAZINE, 2000, 38 (11) :106-110

[7] Ethernet passive optical network (EPON): Building a next-generation optical access network [J].

Kramer, G ;

Pesavento, G .

IEEE COMMUNICATIONS MAGAZINE, 2002, 40 (02) :66-73

[8] ON A GENERALIZATION OF THE P-CENTER PROBLEM [J].

KRUMKE, SO .

INFORMATION PROCESSING LETTERS, 1995, 56 (02) :67-71

[9]

Vazirani V., 2001, APPROXIMATION ALGORI

← 1 →