English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 57970/91504 (63%)
造訪人次 : 13687308      線上人數 : 44
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: http://tkuir.lib.tku.edu.tw:8080/dspace/handle/987654321/70541

    題名: Reduced binary addressing scheme for double loop networks
    作者: Kung, Ling-yang;Lee, Wei-tsong
    貢獻者: 淡江大學電機工程學系
    關鍵詞: Binary system (Mathematics);Ring networks (Computer networks);DDLCN (Computer system)
    日期: 1993-11
    上傳時間: 2011-10-23 21:24:41 (UTC+8)
    摘要: The sequential assignment of node address in double loop network is very important. According to the sequence order of node address, one of the two outgoing paths which provides the shortest distance between source and destination can be selected. In this paper, a simple addressing methodology called Reduced Binary Address Scheme (RBAS) is presented for the double loop networks. It overcomes some of the deficiencies of other proposed approaches. It provides the advantage that allows new nodes to be inserted into the network without changing the addresses of any existing nodes. In addition, it also reduces the computational complexity for routing in each node. RBAS can also be used in other networks which have strong dependence on the sequential order of node addressing.
    關聯: International Symposium Theory and its Application,
    顯示於類別:[電機工程學系暨研究所] 會議論文





    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋