English  |  正體中文  |  简体中文  |  Items with full text/Total items : 92958/108462 (86%)
Visitors : 20424426      Online Users : 250
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version

    Please use this identifier to cite or link to this item: http://asiair.asia.edu.tw/ir/handle/310904400/8150

    Title: Novel Broadcasting Algorithm of Recursive Networks
    Authors: J.F. Fang;W.Y. Liang;H.R. Chen;Ka-Lok Ng
    Contributors: Department of Bioinformatics
    Date: 2007
    Issue Date: 2010-03-19 16:24:49 (UTC+8)
    Publisher: Asia University
    Abstract: The interconnection network considered in this paper is the complete WK-Recursive network that
    demonstrates many attractive properties, such as high degree of regularity, symmetry and efficient
    communication. Chen and Duh have proposed a distributed stack-base broadcasting algorithm for the
    complete WK-Recursive networks [Networks, 24 (1994) 303-317]. To perform this algorithm, a stack of
    O(log N) elements, where N is the number of nodes, to keep the labels of links is included in each
    message. Moreover, as a node receives the message, a series of O(log N) pop and push operations on
    the stack is required. In this paper, we present a novel broadcasting algorithm for the complete WKRecursive
    network, which is much simpler and requires only constant data included in each message
    and constant time to determine the neighbors to forward the message.
    Relation: Informatica (Slovene) 31: 131-136
    Appears in Collections:[生物資訊與醫學工程學系 ] 期刊論文

    Files in This Item:

    File Description SizeFormat
    310904400-8150.doc34KbMicrosoft Word182View/Open

    All items in ASIAIR are protected by copyright, with all rights reserved.

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback