English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 109952/140891 (78%)
Visitors : 46236135      Online Users : 987
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
    Home ‧ Login ‧ Upload ‧ Help ‧ About ‧ Administer Goto mobile version


    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/113263


    Title: 在分波多工網路上符合光功率預算的群播演算法之設計
    Authors: 蔡財量
    吳介騫
    Keywords: 分波多工;群播
    WDM;Multicast
    Date: 2005
    Issue Date: 2017-09-29 17:38:17 (UTC+8)
    Abstract: 群播是目前網際網路上一項應用廣泛的服務型態，當考慮要在分波多工網路施行群播傳輸時，利用光分裂技術即可達成群播傳輸之目的，且可節省大量的網路頻寬，但光分裂將會造成光功率的嚴重衰減。目前雖有文獻提出減少光功率衰減的方法，但都只是針對提高光功率的平均值，並不注意變異數的大小，這種做法並不能符合WDM網路實務上之所需。
    因此，本文提出一個快速計算動態群播樹最小功率的方法及藉以修正既有群播演算法的策略，修正後的演算法可以確保傳送至各目的節點的光功率不小於最低的光功率臨界值，以符合WDM網路實務上之所需。
    The multicasting is one of the important applications in recently Internet networks. Using the technology of light splitting can achieve the purpose of multicasting and save a large amount of the bandwidth of networks. However, light splitting will result in series power loss. Although several literatures of reducing the optical power loss have been proposed, which are always aimed to increase the average value of the optical power but not care about the variance. Such methods are not satisfying the requirement in WDM networks in practice.
    In this paper, we propose an effective algorithm which not only can resolve the multicasting routing problem in Sparse WDM networks but also can ensure the minimum of optical power, which is transmitted to destination nodes, within the power budget and is satisfied the requirement in WDM networks in practice.
    Relation: TANET 2005 台灣網際網路研討會論文集
    網際網路技術
    Data Type: conference
    Appears in Collections:[TANET 台灣網際網路研討會] 會議論文

    Files in This Item:

    File Description SizeFormat
    263.pdf211KbAdobe PDF2117View/Open


    All items in 政大典藏 are protected by copyright, with all rights reserved.


    社群 sharing

    著作權政策宣告 Copyright Announcement
    1.本網站之數位內容為國立政治大學所收錄之機構典藏，無償提供學術研究與公眾教育等公益性使用，惟仍請適度，合理使用本網站之內容，以尊重著作權人之權益。商業上之利用，則請先取得著作權人之授權。
    The digital content of this website is part of National Chengchi University Institutional Repository. It provides free access to academic research and public education for non-commercial use. Please utilize it in a proper and reasonable manner and respect the rights of copyright owners. For commercial use, please obtain authorization from the copyright owner in advance.

    2.本網站之製作，已盡力防止侵害著作權人之權益，如仍發現本網站之數位內容有侵害著作權人權益情事者，請權利人通知本網站維護人員(nccur@nccu.edu.tw)，維護人員將立即採取移除該數位著作等補救措施。
    NCCU Institutional Repository is made to protect the interests of copyright owners. If you believe that any material on the website infringes copyright, please contact our staff(nccur@nccu.edu.tw). We will remove the work from the repository and investigate your claim.
    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library IR team Copyright ©   - Feedback