Optimal virtual topologies for one-to-many communication in WDM paths and rings

被引:2
|
作者
Hartline, JRK [1 ]
Libeskind-Hadas, R [1 ]
Dresner, KM [1 ]
Drucker, EW [1 ]
Ray, KJ [1 ]
机构
[1] Harvey Mudd Coll, Dept Comp Sci, Claremont, CA 91711 USA
基金
美国国家科学基金会;
关键词
D O I
10.1109/TNET.2004.826283
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper we examine the problem of constructing optimal virtual topologies for one-to-many communication in optical networks employing wavelength-division multiplexing. A virtual topology is a collection of optical lightpatbs embedded in a physical topology. A packet sent from the source node travels over one or more lightpaths en route to its destination. Within a lightpath, transmission is entirely optical. At the terminus of a lightpath the data is converted into the electronic domain where it may be retransmitted on another lightpath toward its destination. Since the conversion of the packet from the optical to the electronic domain introduces delays and uses limited physical resources, one important objective is to rind virtual topologies which minimize either the maximum or average number of lightpaths used from the source to all destination nodes. Although this problem is NP-complete in general, we show that minimizing the maximum or average number of lightpaths in path and ring topologies can be solved optimally by efficient algorithms.
引用
收藏
页码:375 / 383
页数:9
相关论文
共 36 条
  • [1] Multicast virtual topologies in WDM paths and rings with splitting loss
    Libeskind-Hadas, R
    Hartline, JR
    Dresner, K
    Drucker, E
    Ray, K
    [J]. ELEVENTH INTERNATIONAL CONFERENCE ON COMPUTER COMMUNICATIONS AND NETWORKS, PROCEEDINGS, 2002, : 318 - 321
  • [2] Optimal one-to-many disjoint paths in folded hypercubes
    Lai, CN
    Chen, GH
    Duh, DR
    [J]. I-SPAN 2000: INTERNATIONAL SYMPOSIUM ON PARALLEL ARCHITECTURES ALGORITHMS AND NETWORKS, PROCEEDINGS, 2000, : 148 - 153
  • [3] Constructing one-to-many disjoint paths in folded hypercubes
    Lai, CN
    Chen, GH
    Duh, DR
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2002, 51 (01) : 33 - 45
  • [4] FROM A ONE-TO-MANY COMMUNICATION MODEL TO A ONE-TO-ONE MODEL
    Garcia Garcia, Alberto
    Aguado Guadalupe, Guadalupe
    [J]. REVISTA ICONO 14-REVISTA CIENTIFICA DE COMUNICACION Y TECNOLOGIAS, 2011, 9 (01): : 175 - 191
  • [5] A Lookup Tree Based Security for One-To-Many Communication
    Abuelyaman, Eltayeb
    [J]. 2014 INTERNATIONAL CONFERENCE ON INFORMATION SCIENCE, ELECTRONICS AND ELECTRICAL ENGINEERING (ISEEE), VOLS 1-3, 2014, : 1292 - 1296
  • [6] Efficient many-to-one and one-to-many multiparty quantum secure direct communication with authentication
    Liu, Wenjie
    Chen, Hanwu
    Li, Zhiqiang
    Zhao, Jun
    [J]. 2008 FOURTH INTERNATIONAL CONFERENCE ON INTELLIGENT INFORMATION HIDING AND MULTIMEDIA SIGNAL PROCESSING, PROCEEDINGS, 2008, : 1282 - 1285
  • [7] Nearly optimal one-to-many parallel routing in star networks
    Chen, CC
    Chen, JN
    [J]. 11TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM, PROCEEDINGS, 1997, : 728 - 733
  • [8] Nearly optimal one-to-many parallel routing in star networks
    Chen, CC
    Chen, J
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1997, 8 (12) : 1196 - 1202
  • [9] An efficient construction of one-to-many node-disjoint paths in folded hypercubes
    Lai, Cheng-Nan
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2014, 74 (04) : 2310 - 2316
  • [10] One-to-many node-disjoint paths in (n, k)-star graphs
    Xiang, Yonghong
    Stewart, Iain A.
    [J]. DISCRETE APPLIED MATHEMATICS, 2010, 158 (01) : 62 - 70