Design of logical topologies for wavelength-routed optical networks

被引:394
作者
Ramaswami, R [1 ]
Sivarajan, KN [1 ]
机构
[1] INDIAN INST SCI, BANGALORE 560012, KARNATAKA, INDIA
关键词
D O I
10.1109/49.510907
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper studies the problem of designing a logical topology over a wavelength-routed all-optical network (AON) physical topology, The physical topology consists of the nodes and fiber links in the network, On an AON physical topology, we can set up lightpaths between pairs of nodes, where a lightpath represents a direct optical connection without any intermediate electronics, The set of lightpaths along with the nodes constitutes the logical topology, For a given network physical topology and traffic pattern (relative traffic distribution among the source-destination pairs), our objective is to design the logical topology and the routing algorithm on that topology so as to minimize the network congestion while constraining the average delay seen by a source-destination pair and the amount of processing required at the nodes (degree of the logical topology), We will see that ignoring the delay constraints can result in fairly convoluted logical topologies with very long delays, On the other hand, in all our examples, imposing it results in a minimal increase in congestion, While the number of wavelengths required to imbed the resulting logical topology on the physical all optical topology is also a constraint in general, we find that in many cases of interest this number can be quite small, We formulate the combined logical topology design and routing problem described above (ignoring the constraint on the number of available wavelengths) as a mixed integer linear programming problem which we then solve for a number of cases of a six-node network, Since this programming problem is computationally intractable for larger networks, we split it into two subproblems: logical topology design, which is computationally hard and will probably require heuristic algorithms, and routing, which can be solved by a linear program, We then compare the performance of several heuristic topology design algorithms (that do take wavelength assignment constraints into account) against that of randomly generated topologies, as well as lower bounds derived in the paper.
引用
收藏
页码:840 / 851
页数:12
相关论文
共 17 条
[1]  
BALA K, 1993, 3939302 CTR COL U
[2]  
BALA K, 1991, P INFOCOM 91, P1
[3]  
Bannister J. A., 1990, Proceedings IEEE INFOCOM '90. The Conference on Computer Communications. Ninth Annual Joint Conference of the IEEE Computer and Communication Societies. The Multiple Facets of Integration (Cat. No.90CH2826-5), P1005, DOI 10.1109/INFCOM.1990.91351
[4]   COMPUTATIONAL EXPERIENCE WITH A DIFFICULT MIXED-INTEGER MULTICOMMODITY FLOW PROBLEM [J].
BIENSTOCK, D ;
GUNLUK, O .
MATHEMATICAL PROGRAMMING, 1995, 68 (02) :213-237
[5]   LIGHTPATH COMMUNICATIONS - AN APPROACH TO HIGH BANDWIDTH OPTICAL WANS [J].
CHLAMTAC, I ;
GANZ, A ;
KARMI, G .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1992, 40 (07) :1171-1182
[6]   LIGHTNETS - TOPOLOGIES FOR HIGH-SPEED OPTICAL NETWORKS [J].
CHLAMTAC, I ;
GANZ, A ;
KARMI, G .
JOURNAL OF LIGHTWAVE TECHNOLOGY, 1993, 11 (5-6) :951-961
[7]   EFFICIENT ALGORITHM FOR VIRTUAL TOPOLOGY DESIGN IN MULTIHOP LIGHTWAVE NETWORKS [J].
GANZ, A ;
WANG, XD .
IEEE-ACM TRANSACTIONS ON NETWORKING, 1994, 2 (03) :217-225
[8]  
GREEN PE, 1992, FIBER OPTIC NETWORKS
[9]  
*IBM, 1991, OPT SUBR LIBR GUID R
[10]  
Kershenbaum A., 1993, TELECOMMUNICATIONS N