政大機構典藏-National Chengchi University Institutional Repository(NCCUR):Item 140.119/69783
English  |  正體中文  |  简体中文  |  Post-Print筆數 : 27 |  Items with full text/Total items : 113311/144292 (79%)
Visitors : 50940475      Online Users : 976
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
    Please use this identifier to cite or link to this item: https://nccur.lib.nccu.edu.tw/handle/140.119/69783


    Title: Message-Efficient Service Management Schemes for MOM-Based UPnP Networks
    Authors: 廖峻鋒
    Liao,Chun-Feng
    Fu,Li-Chen
    Chang,Hsin-Chih
    Contributors: 資科系
    Keywords: Optimization of services systems;industry-specific standards;web services communication protocols
    Date: 2013-04
    Issue Date: 2014-09-11 10:44:47 (UTC+8)
    Abstract: The use of message-oriented middleware (MOM) in pervasive systems has increased noticeably because of its flexible and failure-tolerant nature. Meanwhile, decentralized service management protocols such as UPnP are believed to be more suitable for administrating applications in small-scale pervasive environments such as smart homes. However, administering MOM-based pervasive systems by UPnP often suffers from network flood problems due to the replications of too many unnecessary messages. This paper presents several traffic reduction schemes, namely, decomposing the multicast traffic, service-based node searching, heartbeat by decomposing the multicast traffic, and on-demand heartbeat, which reduce the replications of unnecessary messages in MOM-based UPnP networks. The analytical predictions agree well with the simulated and experimental results, which show that the message counts of presence and leave announcements, node searching, and heartbeat can be greatly reduced.
    Relation: IEEE TRANSACTIONS ON SERVICES COMPUTING,6(2),214-226
    Data Type: article
    DOI link: http://dx.doi.org/10.1109/TSC.2011.43
    DOI: 10.1109/TSC.2011.43
    Appears in Collections:[Department of Computer Science ] Periodical Articles

    Files in This Item:

    File Description SizeFormat
    tsc2013020214.pdf1176KbAdobe PDF2503View/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