Tunghai University Institutional Repository:Item 310901/21954
English  |  正體中文  |  简体中文  |  全文笔数/总笔数 : 21921/27947 (78%)
造访人次 : 4242834      在线人数 : 841
RC Version 6.0 © Powered By DSPACE, MIT. Enhanced by NTU Library IR team.
搜寻范围 查询小技巧:
  • 您可在西文检索词汇前后加上"双引号",以获取较精准的检索结果
  • 若欲以作者姓名搜寻,建议至进阶搜寻限定作者字段,可获得较完整数据
  • 进阶搜寻


    jsp.display-item.identifier=請使用永久網址來引用或連結此文件: http://140.128.103.80:8080/handle/310901/21954


    题名: Optimization of logical rings for multi-hop transmissions in WDM optical star networks
    作者: Liu, J.a , Ho, H.-J.b , Lee, S.a
    贡献者: Department of Computer Science and Information Engineering, Tunghai University
    关键词: All-to-All Broadcast (AAB);Approximation algorithm;Hamiltonian cycle;Multi-hop scheduling;Wavelength Division Multiplexed (WDM)
    日期: 2008
    上传时间: 2013-05-15T09:08:08Z (UTC)
    摘要: In this paper, we present a multi-hop scheduling algorithm for the All-to-All Broadcast (AAB) problem in Wavelength Division Multiplexed (WDM) optical star networks with N nodes. To decrease the packet delay in packet transmissions, our scheduling algorithm will limit the hop distance to a constant ρ. We transfer the ρ-hop AAB problem to the Hamiltonian cycles problem and then generate the logical rings for physical packet transmissions. In order to minimize the scheduling length, the problem of selection of logical rings is to minimize the number of tuning operations to reduce the influence of tuning latency δ for the AAB problem. We propose a 2-approximation algorithm that needs only 2?(N - 1)/ ρ? tuning operations in an AAB scheduling. When ρ < frac(δ + sqrt(δ2 - 8 δ), 2), the schedule length of our algorithm will be shorter than that of the optimal single-hop scheduling algorithm. ? 2008 Elsevier B.V. All rights reserved.
    關聯: Computer Communications
    Volume 31, Issue 10, 25 June 2008, Pages 2030-2038
    显示于类别:[資訊工程學系所] 期刊論文

    文件中的档案:

    档案 大小格式浏览次数
    index.html0KbHTML143检视/开启


    在THUIR中所有的数据项都受到原著作权保护.


    本網站之東海大學機構典藏數位內容,無償提供學術研究與公眾教育等公益性使用,惟仍請適度,合理使用本網站之內容,以尊重著作權人之權益。商業上之利用,則請先取得著作權人之授權。

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