English  |  正體中文  |  简体中文  |  Items with full text/Total items : 90453/105672 (86%)
Visitors : 12186242      Online Users : 425
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
    ASIA unversity > 資訊學院 > 資訊工程學系 > 期刊論文 >  Item 310904400/18634


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


    Title: Embedding Paths of Variable Lengths into Hypercubes with Conditional Link-faults
    Authors: 龔自良;Kung, Tzu-Liang;Kueng, Tz-Liang
    Contributors: 資訊工程學系
    Keywords: Interconnection network;Hypercube;Fault tolerance;Conditional fault;Linear array;Path embedding
    Date: 2009-09
    Issue Date: 2012-11-26 13:56:16 (UTC+8)
    Abstract: Faults in a network may take various forms such as hardware failures while a node or a link stops functioning, software errors, or even missing of transmitted packets. In this paper, we study the link-fault-tolerant capability of an n-dimensional hypercube (n-cube for short) with respect to path embedding of variable lengths in the range from the shortest to the longest. Let F be a set consisting of faulty links in a wounded n -cube Qn, in which every node is still incident to at least two fault-free links. Then we show that Qn-F has a path of any odd (resp. even) length in the range from the distance to 2n-1 (resp. 2n-2) between two arbitrary nodes even if |F|=2n-5. In order to tackle this problem, we also investigate the fault diameter of an n-cube with hybrid node and link faults.
    Relation: PARALLEL COMPUTING;35(8–9): 441–454
    Appears in Collections:[資訊工程學系] 期刊論文

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML157View/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