• Article
  • | |
  • Metrics
  • |
  • Reference [7]
  • |
  • Related
  • |
  • Cited by
  • | |
  • Comments
    Abstract:

    Routing and channel assignment is a key topic in optical interconnection networks, and it is a primary way to get insight into the capacity of interconnection networks. Based on the optical RP(k) network, the wavelength assignment of realizing the Hypercube communication with N=2n nodes on the optical RP(k) network is discussed. By defining the reverse order of the Hypercube, an algorithm to embed the n-D Hypercube into the RP(k) network is designed, which needs at most max{2,「5.2n-5/3」} wavelengths. An algorithm to embed the n-D hypercube into the ring network is also proposed, with its congestion equal to 「N/3+N/12」. This is a better improvement than the known results, which is equal to 「N/3+N/4」. The two algorithms proposed in this paper are of great value in designing optical networks.

    Reference
    [1]Ortiz Z, Rouskas GN, Perros HG. Maximizing multicast throughput in WDM networks with tuning latencies using the virtual receiver concept. European Transactions on Telecommunications, 2000,11(1):63~72.
    [2]Qiao CM, Mei YS. Off-Line permutation embedding and scheduling in multiplexed optical networks with regular topologies. IEEE/ACM Transactions on Networking, 1999,7(2):241~250.
    [3]Yuan X, Melhem R. Optimal routing and channel assignments for hypercube communication on optical mesh-like processor arrays. In: Johnsson SL, ed. Proceedings of the 5th International Conference on Massively Parallel Processing Using Optical Interconnection. Las Vegas, NV: IEEE Press, 1998. 110~118.
    [4]Yuan X, Melhem R, Gupta R. Distributed path reservation algorithm for multiplexed all-optical interconnection networks. IEEE Transactions on Computer, 1999,48(12):1355~1363.
    [5]Yuan X, Melhem R, Gupa R. Performance of multi-hop communications using logical topologies on optical Torus networks. Journal of Parallel and Distributed Computing, 2001,61(6):748~766.
    [6]Liu FA, Liu ZY, Qiao XZ. A practical interconnection network RP(k) and its routing algorithms. Science in China (Series F), 2001,44(6):461~473.
    [7]Shen XJ, Liang WF, Hu Q. On embedding between 2D meshes of the same size. IEEE Transactions on Computer, 1997,46(8): 880~889.
    Related
    Cited by
    Comments
    Comments
    分享到微博
    Submit
Get Citation

刘方爱,刘志勇,乔香珍.光RP(k)网络上Hypercube通信模式的波长指派算法.软件学报,2003,14(3):575-581

Copy
Share
Article Metrics
  • Abstract:4155
  • PDF: 5380
  • HTML: 0
  • Cited by: 0
History
  • Received:January 30,2002
  • Revised:April 11,2002
You are the first2032782Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063