A distributed algorithm for constructing minimum delay spanning trees under bandwidth constraints on overlay networks

被引:0
|
作者
Baduge, Thilmee M. [1 ]
Hiromori, Akihito [1 ,2 ]
Yamaguchi, Hirozumi [1 ]
Higashino, Teruo [1 ]
机构
[1] Graduate School of Information Science and Technology, Osaka University, Osaka, 565-0871, Japan
[2] Research Laboratories, NTT DoCoMo, Japan
来源
Systems and Computers in Japan | 2006年 / 37卷 / 14期
关键词
D O I
暂无
中图分类号
学科分类号
摘要
Journal article (JA)
引用
收藏
页码:15 / 24
相关论文
共 50 条
  • [41] Path shortening schema for minimum delay spanning tree on overlay multicast
    Saito, Hiroki
    Nakamura, Yoichi
    CISIS 2007: FIRST INTERNATIONAL CONFERENCE ON COMPLEX, INTELLIGENT AND SOFTWARE INTENSIVE SYSTEMS, PROCEEDINGS, 2007, : 205 - +
  • [42] A parallel algorithm for constructing multiple independent spanning trees in bubble-sort networks
    Kao, Shih-Shun
    Klasing, Ralf
    Hung, Ling-Ju
    Lee, Chia-Wei
    Hsieh, Sun-Yuan
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2023, 181
  • [43] Constructing Independent Spanning Trees in Alternating Group Networks
    Huang, Jie-Fu
    Hsieh, Sun-Yuan
    COMPUTING AND COMBINATORICS (COCOON 2020), 2020, 12273 : 198 - 209
  • [44] Bandwidth Scheduling in Overlay Networks with Linear Capacity Constraints
    Wu, Chase Q.
    IEEE INFOCOM 2017 - IEEE CONFERENCE ON COMPUTER COMMUNICATIONS, 2017,
  • [45] Overlay multicast routing algorithm with delay and delay variation constraints
    Lin, Longxin
    Zhou, Jie
    Ye, Zhao
    ADVANCED PARALLEL PROCESSING TECHNOLOGIES, PROCEEDINGS, 2007, 4847 : 372 - 381
  • [46] Minimum node weight spanning trees searching algorithm for broadcast transmission in sensor networks
    Lipinski, Zbigniew
    2017 TWELFTH INTERNATIONAL CONFERENCE ON DIGITAL INFORMATION MANAGEMENT (ICDIM), 2017, : 150 - 154
  • [47] A parallel algorithm for k-minimum spanning trees
    Ma, J
    Iwama, K
    Gu, QP
    SECOND AIZU INTERNATIONAL SYMPOSIUM ON PARALLEL ALGORITHMS/ARCHITECTURE SYNTHESIS, PROCEEDINGS, 1997, : 384 - 388
  • [48] A table based algorithm for minimum directed spanning trees
    Feng, J.
    2001, Editorial Dept. of Systems Engineering and Electronics (12)
  • [49] An I/O Efficient Algorithm for Minimum Spanning Trees
    Bhushan, Alka
    Sajith, Gopalan
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, (COCOA 2015), 2015, 9486 : 499 - 509
  • [50] EREW PRAM algorithm for updating minimum spanning trees
    Das, Sajal K.
    Ferragina, Paolo
    Parallel Processing Letters, 1999, 9 (01): : 111 - 122