English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 110944/141864 (78%)
Visitors : 47869047      Online Users : 1118
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
    政大機構典藏 > 商學院 > 企業管理學系 > 會議論文 >  Item 140.119/45302
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/45302


    Title: A Fuzzy-based Algorithm to Remove Clock Skew and Reset from One-Way Delay Measurement
    Authors: 郭更生
    Kuo, Geng-Sheng
    Contributors: IEEE
    Date: 2004-11
    Issue Date: 2010-10-06 09:18:41 (UTC+8)
    Abstract: One-way delay (OWD) traces are important measurements for analyzing end-to-end performance on the Internet. It is still a great challenge to provide a scalable solution for large-scale OWD measurement. Because the clocks at end systems are usually not synchronized, the OWD measurements are often inaccurate. For the more challenging case with clock resets to some reference times during the measurement, the OWD measurements are more inaccurate. Furthermore, the measurement data often exhibit considerable network-induced noise when the network is heavily loaded. All the existing OWD measurement techniques, such as linear programming and convex-hull approach (CHA), try to solve this problem by deterministic mathematics model. However, they often fail to distinguish clock resets from temporary Internet congestion. Based on the fuzzy-clustering analysis, this paper proposes a new algorithm to estimate and remove the clock skews and resets from measurement results. This algorithm has been implemented as a tool called fuzzy-based OWD corrector (FOC). The paper then presents OWD measurements of several Internet paths using FOC. Numerical experiments demonstrate that FOC is more accurate and robust than the existing techniques. FOCs computation complexity O(N) is similar to that of CHA and its computing time is much less than that of convex-hull technique.
    Relation: Neural Networks, IEEE Transactions on (Volume:16 , Issue: 5 )
    Page(s):
    1125 - 1135
    Data Type: conference
    DOI 連結: http://dx.doi.org/10.1109/GLOCOM.2004.1378218
    DOI: 10.1109/GLOCOM.2004.1378218
    Appears in Collections:[企業管理學系] 會議論文

    Files in This Item:

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