Routing Algorithm for Vertically Stacked Optical Banyan Networks with the Time Complexity O(N) using Pipelined Processors

被引：0
|
作者：
Khandker, Md. Mamun-ur-Rashid [1 ]
机构：
[1] Rajshahi Univ, Dept Appl Phys & Elect Engn, Rajshahi, Bangladesh
来源：
2008 11TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY: ICCIT 2008, VOLS 1 AND 2 | 2008年
关键词：
Vertically Stacked optical Switch networks; Nonblocking Switch Networks; Completely connected graph; Bipartite graph;
D O I：
暂无
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Centralized control routing algorithm for optical banyan networks on vertical stacking scheme has time complexity O(Nlog(2)N) for rearrangebly nonblocking structure. A distributed algorithm with O(log(2)N)) has been recently proposed in which authors have considered an N completely connected processors to take routing decision which practically would be very difficult to implement for large N. In this paper we have proposed a distributed routing algorithm with processors work in pipelined fashion and take the routing decision in linear time. Also they do not need to be completely connected which makes it more practical for implementation.
引用
收藏
页码：522 / 527
页数：6
相关论文
共 41 条
  • [1] Blocking probability of vertically stacked optical banyan networks under random routing
    Jiang, XH
    Shen, H
    Horiguchi, S
    [J]. GLOBECOM'03: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-7, 2003, : 2493 - 2497
  • [2] Performance of Fast Routing Algorithm for Vertically Stacked Optical Banyan Networks with Link Failures and Given Crosstalk Constraint
    Sultana, Basra
    Khandker, M. R.
    [J]. 2008 11TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY: ICCIT 2008, VOLS 1 AND 2, 2008, : 643 - 648
  • [3] Performance modelling for vertically stacked optical banyan networks with extra stage
    Yu, Chen
    Jiang, Xiaohong
    Horiguchi, Susumu
    [J]. INTERNATIONAL JOURNAL OF COMPUTATIONAL SCIENCE AND ENGINEERING, 2006, 2 (1-2) : 81 - 87
  • [4] Lower bound on number of planes for vertically stacked optical banyan networks with link failures
    Sultana, Basra
    Khandker, Md. Mamun-ur-R.
    [J]. PROCEEDINGS OF 10TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY (ICCIT 2007), 2007, : 178 - 183
  • [5] Lower Bound on Blocking Probability for Vertically Stacked Optical Banyan Networks with Given Crosstalk Constraint
    Sultana, Basra
    Khandker, M. R.
    [J]. 2008 11TH INTERNATIONAL CONFERENCE ON COMPUTER AND INFORMATION TECHNOLOGY: ICCIT 2008, VOLS 1 AND 2, 2008, : 638 - 642
  • [6] Blocking Behavior Analysis of Extended Pruned Vertically Stacked Optical Banyan Networks with Link Failures
    Sultana, Basra
    Khandker, M. R.
    [J]. PROCEEDINGS OF ICECE 2008, VOLS 1 AND 2, 2008, : 612 - 617
  • [7] A Routing Algorithm for Rearrangeable Nonblocking Optical Banyan-type Networks
    Guan, D. J.
    Tong, Li-Da
    Chen, Irene Y.
    [J]. 2012 SEVENTH INTERNATIONAL CONFERENCE ON BROADBAND, WIRELESS COMPUTING, COMMUNICATION AND APPLICATIONS (BWCCA 2012), 2012, : 289 - 295
  • [8] Upper Bound on Blocking Probability for Vertically Stacked Optical Banyan Networks with Link Failures and Given Crosstalk Constraint
    Sultana, Basra
    Khandker, M. R.
    [J]. PROCEEDINGS OF ICECE 2008, VOLS 1 AND 2, 2008, : 606 - 611
  • [9] Optimal multicast routing using genetic algorithm for WDM optical networks
    Siregar, JH
    Zhang, YB
    Takagi, H
    [J]. IEICE TRANSACTIONS ON COMMUNICATIONS, 2005, E88B (01) : 219 - 226
  • [10] A T-decomposition algorithm with O(n log n) time and space complexity
    Yang, J
    Speidel, U
    [J]. 2005 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), VOLS 1 AND 2, 2005, : 23 - 27
12345